This invention relates to a method, system and computer program product for reading data from a storage controller in storage area network. A read data instruction is received from an application requesting data from the storage controller using a primary data path. If the data on the primary data path is not transferred in a defined time interval using the primary data path, data is requested from the storage controller using one or more alternative data paths. Data is received from the storage controller on one of data paths and into a buffer. When the read instruction has completed and that the data is in the buffer, the application is notified. Each data path is associated with a buffer and the data is received into a buffer associated with the path. The application is informed which buffer holds the data and the application accesses the data from this buffer.

A known Storage Area Network (SAN) controller is the interface between an application host and a storage controller in a SAN network. The SAN controller controls the data signals over a plurality of paths between itself and the storage controller. While the controller may spread I/O activity over some or all of these paths, it will generally select a single path for each individual I/O transmission. If this path is not operational for some reason, the SAN controller and application host must wait for a long period before determining that I/O is not going to complete. Normally the SAN controller will not submit the I/O operation via an alternative path until the original attempt has timed out completely or the interconnecting fabric between the host and the storage controller has told the host that the path is not operational. This is because the controller is unable to tell the difference between an unresponsive path and a disk operation that is simply taking a long time to execute in the storage. This approach imposes a significant performance degradation on the I/Os that are submitted to unresponsive paths. For some applications which require I/Os to be completed within a few seconds this is unacceptable.
Another problem that can occur in SAN systems is with the host submitting the I/O via the selected path and when this I/O does not complete the host submits another I/O via a different path, and this second I/O does complete. The host now gives good completion status to the application and the application de-allocates the buffer associated with the transaction. The original I/O now completes using a buffer that has been de-allocated which could cause significant problems. To avoid this problem, the host (or device driver) must ensure that the host buffer associated with the transaction is not accessed by any late completing I/O activity.

Method, system, and computer program product for reading data from a storage controller in a storage area network


A sheet delivery mechanism designed to discharge successive sheets to different delivery positions includes offset rollers, an offset unit, an offsetting force generator and an offset unit swinging mechanism. The offset rollers is rotatably supported by the offset unit to discharge each sheet in a sheet transport direction. The offsetting force generator produces a driving force for shifting the offset unit back and forth along a direction perpendicular to the sheet transport direction between a reference position and offset positions. The offset unit swinging mechanism swings the offset unit about an axis parallel to rotary shafts of the offset rollers in such a manner that a sheet output direction in which the offset rollers eject each sheet varies to a direction pointing away from a sheet delivery tray when the offset unit is shifted along the direction perpendicular to the sheet transport direction by the offsetting force generator.

The present invention relates to a sheet delivery mechanism of an image forming apparatus, such as a printer or a copying machine, for discharging sheets of a printing medium carrying printed images to offset delivery positions.
When an image forming-apparatus for producing printed images on sheets of paper outputs multiple copies of printed sheets onto a sheet delivery tray provided outside a housing of the apparatus, for instance, it is usually difficult to discern boundaries between the individual copies and, therefore, a user needs to sort the individual copies upon completion of image forming operation. When producing two copies of a 10-page document by the image forming apparatus, for example, the user has to find out a boundary between the first and second copies, or the boundary between a last page of the first copy and a first page of the second copy, and separate the two copies from each other.
There are several known types of sheet delivery devices applicable to conventional image forming apparatuses for realizing efficient sorting operation. These sheet delivery devices are designed to selectively deliver multiple copies of printed sheets in different ways or at different (offset) locations by varying sheet delivery positions for easy sorting. Four specific approaches employed in these sheet delivery devices are as follows.
A first approach proposed in Japanese Laid-open Patent Publication No. 1999-199124, for example, is to feed printing paper of the same size in different orientations (portrait and landscape) for every other copy of a document and output printed sheets in the same orientations. Specifically, sheets for printing one copy are fed in such a way that a short side of each sheet goes first and sheets for printing next copy are fed in such a way that a long side of each sheet goes first. As the printed sheets are discharged in the same orientations, individual copies can be easily distinguished.
A second approach disclosed in Japanese Laid-open Patent Publication No. 2000-86056, for example, employs an offset tray. Although printed sheets are discharged from a fixed sheet output position, the offset tray is shifted (offset) to different positions so that the printed sheets are delivered to different locations for easy sorting.
A third approach proposed in Japanese Laid-open Patent Publication No. 1993-186121, for example, includes a pair of sheet output rollers individually mounted on two shafts and a differential gear mechanism provided between the two shafts. While the two sheet output rollers nip a printed sheet for discharging it, a difference is produced between rotating loads of the two sheet output rollers. The differential gear mechanism produces a difference in rotating speed between the two sheet output rollers so that multiple copies of printed sheets are output to different sheet delivery positions for easy sorting.
A fourth approach shown in Japanese Laid-open Patent Publication No. 1996-208091, for example, includes a driving roller assembly and pinch roller assemblies for discharging printed sheets. While a printed sheet to be discharged is nipped between the driving roller assembly and the pinch roller assemblies, the driving roller assembly is shifted in its axial direction. As the nipped sheet pulled by the driving roller assembly is also shifted in the axial direction of the driving roller assembly, the sheet delivery position of each sheet is varied to facilitate a sorting job.
An image forming apparatus recently developed is a so-called front access type as shown in FIG. 11, which is intended to achieve compactness in design. Referring to FIG. 11, the front-access-type image forming apparatus includes an image scanning section 160 located at an upper part, a sheet feed section 170 located at a lower part for feeding sheets of paper used for image forming, and an image forming section 180 disposed between the image scanning section 160 and the sheet feed section 170. The image scanning section 160, the image forming section 180 and the sheet feed section 170 are arranged generally in a U shape in cross section. A sheet delivery section 190 to which each sheet carrying a printed image is output is provided in a space between the image scanning section 160 and the sheet feed section 170. To meet an increasing demand for advanced features, this type of image forming apparatus incorporates a duplex (double-sided) image-forming function which is realized by a switchback sheet transport method instead of a normally used intermediate tray method. In the switchback sheet transport method, a sheet of paper is reversed by transferring the sheet in a direction opposite to an ordinary sheet transport direction through a sheet transport path S′ by means of a pair of sheet output rollers 191 immediately after an image has been formed on one side of the sheet.
For the front-access-type image forming apparatus, it is not desirable to employ the aforementioned first approach of Japanese Laid-open Patent Publication No. 1999-199124. This is because it is necessary to provide multiple sheet cassettes for each paper size to feed the printing paper in different orientations and this makes it difficult to achieve compactness of the apparatus. The aforementioned second approach of Japanese Laid-open Patent Publication No. 2000-86056 is not desirable for the front-access-type image forming apparatus either, because it is difficult to accommodate a movable offset tray in the limited space of the sheet delivery section 190. Accordingly, the aforementioned third and fourth approaches shown in Japanese Laid-open Patent Publication Nos. 1993-186121 and 1996-208091, respectively, seem to be suited to the front-access-type image forming apparatus, because arrangements of these approaches do not require a large space.
In the arrangements of Japanese Laid-open Patent Publication Nos. 1993-186121 and 1996-208091, however, sheets already discharged to different (offset) delivery positions on a sheet delivery tray, for example, might be displaced when another sheet is discharged onto the sheet delivery tray. This is because the sheet nipped by the output rollers, when discharged without a sheet output direction in which individual sheets are ejected from the output rollers being changed to a direction pointing away from a sheet delivery tray, goes into contact with at least one of the sheets already discharged onto the sheet delivery tray, and the sheet newly discharged could force, or push, one or more previously discharged sheets outward in the sheet transport direction. As a consequence, successively discharged multiple copies of the sheets might not be properly stacked at the intended delivery positions on the sheet delivery tray.


A blade for a rotor, especially a turborotor, is made of two hollow blade foot sections having matching seam surfaces to form a hollow blade with a thickened foot that is butt-welded with its blade foot sole (7) to an integral welding stub of a rotor hub or disk. The two hollow blade foot sections are soldered to each other along a radially outer seam section (5) between the seam surfaces and welded to each other along a radially inner seam section (6) between the seam surface. The radially inner seam section extends from said blade foot sole. The welded seam normally ends in the thickened blade foot section (6) and is thus shorter than the soldered seam section (5).

U.S. Pat. No. 4,784,573 (Ress, Jr.) issued on Nov. 15, 1988, describes a turbine rotor with hollow, air cooled rotor blades that are integrally secured to the rotor hub, for example, by diffusion bonding. The blades are thickened at their blade foot that is connected to the rotor hub, preferably to a slightly raised plateau forming an integral part of the hub. Diffusion bonding or welding as such is known from U.S. Pat. No. 4,526,312.
It is a disadvantage in the manufacture of rotor disks with integral blades that conventionally applied welding methods require a high pressure in order to provide the required frictional movement between the rotor blade and the welding stub or plateau on the rotor hub to accomplish friction welding for forming an integral unit in which the blade foot is butt-welded to the rotor hub. These conventionally required high pressures have made it difficult heretofore, if not impossible, to produce rotor disks with hollow blades integrally secured to the rotor hub because hollow rotor blades cannot withstand these high working pressures. Incidentally, rotors with hollow rotor blades integrally secured to the rotor hub are referred to in the relevant literature as BLISK.
It has been found that the above outlined problem becomes even more pronounced if it is intended to weld hollow blades made of two hollow blade sections or blade shell parts to the rotor hub. The blade sections are conventionally soldered to each other along their entire radial length, whereby the solder is provided between matching seam or joint surfaces of the two blade sections or shell parts. The blades are weakened, particularly in the blade foot area by the solder seam extending along the entire radial length of the respective hollow blade.
German Patent Publication 2,510,286 (Weiler et al.) published Sep. 16, 1976, discloses a method for producing a connection between a rotor hub or disk primarily made of steel with rotor blades primarily made of titanium. It is known in this connection to connect the blades to the hubs by soldering, electron beam welding, diffusion welding or friction welding. However, problems have been encountered in that the connection did not have the required strength presumably due to the formation of brittle phases, particularly in the area of the welding seam and presumably also due to the different heat expansions in response to the welding heat. Weiler et al. solve this problem by first blast welding a steel plate and a titanium plate to each other to form a two layer plate. Then the steel plate layer of the two layer plate is welded to the steel rotor hub or disk and the titanium plate layer is welded to the titanium blade of the rotor disk.
German Patent Publication 1,007,565 (Sedlmeir) published on May 2, 1957 discloses hollow turbine blades for gas turbines charged with a gaseous drive medium. The individual blades have a particular cross-sectional configuration which is so constructed that the hollow cross-section increases from the blade foot to the blade head or tip to such an extent that in this direction, namely the radial direction, the material cross-section of the blade tapers off to become smaller while achieving an increase in the total cross-section of the blade. As a result less strain is applied to the connection between the blade foot and the rotor hub, whereby the respective r.p.m. of the rotor may be increased. Particular problems with the connection between the blade and the rotor hub are not described, however such problems do exist as described above.
These problems become even more pronounced when the individual hollow rotor blades are assembled of two matched blade sections or blade shell parts. Conventional welding operations have not succeeded in securely attaching such hollow two-section blades to the rotor hub. The joining seam which is normally made of solder is ripped open particularly in the blade foot area particularly in the butt-welding area between the blade foot sole and the blade foot welding stub or plateau.

Blade for rotors and method for producing rotors with such blades

MTU Motoren- und Turbinen-Union Muenchen GmbH


To enable automatic calculation of a circuit element value and a waveform by a computer. In a circuit design support for calculating a circuit element value of an analog electronic circuit to be designed, by causing a computer to execute a program having a description of a repetition calculation equation of the Newton method including the Jacobi matrix, a program of the aforementioned calculation equation in which a partial differentiation as an element in the Jacobi matrix is replaced by an approximation equation is used. Furthermore, the element to be subjected to the partial differentiation in the Jacobi matrix is obtained from the waveform observed in response to the circuit configuration of the analog electronic circuit.

1. Field of the Invention
The present invention relates to a circuit design support method, a implement thereof, and a circuit design support program, and in particular, to a circuit design support method, a implement thereof, and a circuit design support program capable of automatically designing a circuit interactively through a designer and a computer without providing a circuit equation comprised of a differential equation.
2. Description of the Related Art
The information society of recent years has been under significant development, and increase in frequencies used for an electronic circuit has become increasingly prominent, for example, a computer CPU requires operating (clock) frequencies of the order of GHz, the use of frequencies of the order of GHz has also commenced in wireless communication, and the like. Accordingly, the development of an analog circuit has become extremely important, such as a power supply circuit for supplying power to a CPU and the like, and an amplifier used in wireless communication.
The design of an analog circuit connected to an electronic circuit of which the operating frequencies increase, such as a power supply circuit or an amplifier, is categorized into the following three stages:    (1) Decision of circuit configuration,    (2) Decision of a circuit element value, and    (3) Evaluation of circuit operation.
As a tool for supporting such design on a computer, a circuit simulator such as "SPICE" has been developed, which has been widely used as an important support tool for (3) above. However, in order to simulate circuit operation, a circuit element value needs to be provided, and therefore stage (2) above is essential which derives such an element value for providing a desired operation.
A developer of an analog circuit first performs circuit analysis through manual calculation and then use the result of that analysis to decide the element value of the circuit. The circuit analysis involves many approximations, and therefore the derived element value includes errors. Accordingly, the developer inputs the derived element value into a simulator, and then repeatedly performs the above works (2) and (3) to thereby empirically adjust the element value for the circuit on the basis of the simulation result. Moreover, adjustment of the element value is largely dependent on a designer's experience, and therefore training the designer is also necessary.
On the other hand, even if the element value is obtained with the Monte Carlo method using a simulator, there exists the problem that calculation time increases exponentially as the number of conditions to be satisfied increases. That is, stage (2) above that bridges the above (1) and (3) is a bottleneck in the development of a circuit in terms of time. For this reason, a design support tool with which even a less experienced designer can easily and rapidly design a circuit is strongly required.
In consideration of this, the present inventors previously proposed a method for calculating an element value, in which the element value was numerically derived with a computer, as described in the following non-patent literature. The prior method for calculating an element value will hereinafter be described.
For example, consider a circuit described with the differential equation represented by the following eq. (1).
                                                        ⅆ              x                                      ⅆ              t                                =                      f                                      (                              t                ,                x                ,                λ                            )                                      ,                            (        1        )            where t∈R, x∈Rn, and λ∈Mm represents time, an n-dimensional state space, and m-dimensional system parameters, respectively. For simplicity, we assume thatƒ:R×Rn×Rm→Rn(t, χ, λ) ƒ(t, χ, λ)  (2)represents a C∞-class map having periodicity of period tT in a time domain. That is,ƒ(t+tT, χ, λ)=ƒ(t, χ, λ)  (3)represents the assumption. Furthermore, the above eq.(1) is assumed to have a solution of x(t)=φ(t,x0, λ), if −∞<t<∞, with respect to any intitial value x0∈Rn and all the sytem parameters λ∈Rm:x(0)=φ (0, x0, λ)=x0.
The assumption of the periodicity described in eq. (3) enables a C∞-class discrete map T which returns from the state space Rn to itself to be defined as:T:Rn→Rnχ0T(χ0, λ)=φ(tT, χ0, λ)  (4)This map is referred to as the Poincare map.
In the case where the solution x(t)=φ(t,p0, λ) of differential equation (1) has periodicity of period tT,T(p0, λ)=p0  (5)the point p0∈Rn satisfying eq. (5) is called a fixed point with respect to map T.
In order to design an electronic circuit, constraint conditions are often considered. Given that the number of conditions is N (≦m), by expressing each condition at time t=tck as gk, the constraint condition can be expressed as:
                                          G                                      (                                                x                  0                                ,                λ                            )                                =                                    [                                                                                g                        1                                                                                (                                                                              t                                                          c                                                                                1                                                                                ,                                                      x                            0                                                    ,                          λ                                                )                                                                                g                        2                                                                                (                                                                              t                                                          c                                                                                2                                                                                ,                                                      x                            0                                                    ,                          λ                                                )                                                                                ⋮                                                                                g                        N                                                                                (                                                                              t                                                          c                                                                                N                                                                                ,                                                      x                            0                                                    ,                          λ                                                )                                                                                ]                        =            0                          ,                  ∈                      R            N                          ,                            (        6        )            In this case, N parameters can be prepared as the design parameter. Consequently, the remaining (m−N) parameters need to be provided as the design specification.
As described above, the design of an electronic circuit comes down to solution methods of the above eqs. (5) and (6), which are algebra equations. These algebra equations are now rewritten as:
                                          F                                      (                                                x                  0                                ,                λ                            )                                =                                    [                                                                                T                                                                          (                                                                                x                              0                                                        ,                            λ                                                    )                                                                    -                                              x                        0                                                                                G                                                                    (                                                                              x                            0                                                    ,                          λ                                                )                                                                                ]                        =            0                          ,                  ∈                      R                          n              +              N                                                          (        7        )            where T((x0, λ), x0, and λ can be expresses as T(x0λ)=[T1(x0, λ, T2 (x0, λ), . . . , Tn (x0, λ)]T, x0=x(0)=[x1(0), x2(0), . . . , xn(0)]T, and λ=[λ1, λ2, . . . , λm]T, respectively. Further, λu ∈RN is defined as:λu={λu1, λu2, . . . , λuN|λuk (K=1, 2, . . . , N) are unknown design parameters in λ. }  (8)
To solve design equation (7), the Newton method that is the most general algorithm for solving an algebra equation is used. The unknown in eq. (7) is expressed as u∈Rn+N:u=[x0T,λuT]T, and then an interative calculation:
                              u                      k            +            1                          =                              u            k                    -                                    F                                            (                                  u                  k                                )                                                                    F                ′                                                          (                                  u                  k                                )                                                                        (        9        )            is performed until the termination condition of ∥k+1u−uk∥<δ is satisfied,
                                          F            ′                                          (                          u              k                        )                          =                  [                                                                                ∂                                                                        T                          1                                                                                (                                                      u                            k                                                    )                                                                                ∂                                                                        x                          1                                                                                (                          0                          )                                                                                -                  1                                                                                ∂                                          T                      1                                                                            ∂                                                                  x                        2                                                                                (                        0                        )                                                                                ⋯                                                                                ∂                                          T                      1                                                                            ∂                                                                  x                        n                                                                                (                        0                        )                                                                                ∂                                          T                      1                                                                            ∂                                          λ                                              u                                                                                1                                                                                ⋯                                                                                ∂                                          T                      1                                                                            ∂                                          λ                      uN                                                                                ∂                                                                  T                        2                                                                                (                                                  u                          k                                                )                                                                                ∂                                                                  x                        1                                                                                (                        0                        )                                                                                ∂                                              T                        2                                                                                ∂                                                                        x                          2                                                                                (                          0                          )                                                                                -                  1                                                            ⋯                                                                                ∂                                          T                      2                                                                            ∂                                                                  x                        n                                                                                (                        0                        )                                                                                ∂                                          T                      2                                                                                ∂                                              λ                                                  u                                                                                1                                                                                ⋯                                                                                ∂                                          T                      2                                                                            ∂                                          λ                      uN                                                                                ⋮                                                                                ∂                                                                  T                        n                                                                                (                                                  u                          k                                                )                                                                                ∂                                                                  x                        1                                                                                (                        0                        )                                                                                ∂                                          T                      n                                                                            ∂                                                                  x                        2                                                                                (                        0                        )                                                                                ⋯                                                                                ∂                                              T                        n                                                                                ∂                                                                        x                          n                                                                                (                          0                          )                                                                                -                  1                                                                                ∂                                          T                      n                                                                            ∂                                          λ                                              u                                                                                1                                                                                ⋯                                                                                ∂                                          T                      n                                                                            ∂                                          λ                      uN                                                                                ∂                                                                  g                        1                                                                                (                                                                              t                                                          c                                                                                1                                                                                ,                                                      u                            k                                                                          )                                                                                ∂                                                                  x                        1                                                                                (                        0                        )                                                                                ∂                                          g                      1                                                                            ∂                                                                  x                        2                                                                                (                        0                        )                                                                                ⋯                                                                                ∂                                          g                      1                                                                            ∂                                                                  x                        n                                                                                (                        0                        )                                                                                ∂                                          g                      1                                                                            ∂                                          λ                                              u                                                                                1                                                                                ⋯                                                                                ∂                                          g                      1                                                                            ∂                                          λ                      uN                                                                                ⋮                                                                                ∂                                                                  g                        N                                                                                (                                                                              t                            cN                                                    ,                                                      u                            k                                                                          )                                                                                ∂                                                                  x                        1                                                                                (                        0                        )                                                                                ∂                                          g                      N                                                                            ∂                                                                  x                        2                                                                                (                        0                        )                                                                                ⋯                                                                                ∂                                          g                      N                                                                            ∂                                                                  x                        2                                                                                (                        0                        )                                                                                ∂                                          g                      N                                                                            ∂                                          λ                                              u                                                                                1                                                                                ⋯                                                                                ∂                                          g                      N                                                                            ∂                                          λ                      uN                                                                                ]                                    (        10        )            In addition, k is the number of iterations and <<1 (where we assume =10−9). In this case, uk+1 is the solution of eq. (7).
In order to calculate eq. (9), it is required to obtain T(uk) in eq. (10), which can be obtained by applying the Runge-Kutta Method to eq. (1). Further, respective elements of the Jacobi matrix F′(uk) given by eq. (10) are derived by solving the following linear variational equations:
                                                                        ⅆ                                  ⅆ                  t                                                                                ∂                  ϕ                                                  ∂                                      x                    0                                                                        =                                                            ⅆ                  f                                                  ⅆ                  x                                                                                ∂                  ϕ                                                  ∂                                      x                    0                                                                                ,                                                    with                                                                                ∂                    ϕ                                                        ∂                                          x                      0                                                                                |                                  t                  =                  0                                                      =            I                                                                                ⅆ                                  ⅆ                  t                                                                                ∂                  ϕ                                                  ∂                  λ                                                      =                                                                                ⅆ                    f                                                        ⅆ                    x                                                                                ∂                    ϕ                                                        ∂                    λ                                                              +                                                ∂                  f                                                  ∂                  λ                                                              ,                                                    with                                                                                ∂                    ϕ                                                        ∂                    λ                                                                                |                                  t                  =                  0                                                      =            0                                              (        11        )            Eqs. (11) can be regarded as differential equations with respect to ∂ (t, uk)/∂x0 and ∂φ(t, uk)/∂λ. That is, if esqs. (11) are solved from 0 to tT or tck with the Runge-Kutta Method, ∂φ(tT, uk)/∂x0, ∂φ(tck, uk)/∂x0, ∂φ(tT, uk)/∂λ, and 7 φ(tck, uk)/∂λ can be derived. Tk is a function of φ, and also gk can typically be expressed as a function of φ, and therefore, from these values, Tk(uk)/∂x0, Tk(uk)/∂λ, gk(Tck, uk)/∂x0, and gk(tck, uk)/∂λcan be numerically derived.
Conventionally, the unknown coefficient u has been obtained by the above-described calculation, and consequently . .λu that is the design value of the electronic circuit has been decided.
FIG. 2 is a flowchart illustrating a procedure in which a circuit design is performed using the above-described prior calculation procedure. The procedure is comprised of 5 steps: (1) the circuit configuration decision step of deciding electronic circuit configuration; (2) the circuit equation formulation step in which a circuit designer manually decides circuit equation (1) on the basis of the decided circuit configuration; (3) the variational equation derivation step in which a circuit designer derives the variational equations (11) from the circuit equation; (4) the constraint condition derivation step of deriving the constraint condition (eq. 7); and (5) the step of deriving a circuit element value and a waveform by solving conditional equation (7) with circuit equation (1) and variational equations (11), and if a satisfactory solution is not obtained in step 5, then an operation returns to step 1.
Non-patent literature 1: IEEE TRANSACTION ON CIRCUITS AND SYSTEM-1: fundamental theory and applications, vol. 49, No. 7, July 2002.
As described above, the prior method is configured to derive a voltage or current waveform x(t)=φ(t, x0, λ) by providing the circuit equation in an explicit form following the consideration of circuit configuration and then solving the circuit equation. However, it is not easy to automatically derive the circuit equation with a computer, and therefore, there exists a problem of having to depend on manual calculation. Furthermore, every time a circuit configuration or the characteristic of a circuit element is modified, the circuit equation has to be reformulated, resulting in a large expenditure of time. In other words, in the prior method, a series of works, i.e., deriving the circuit equation from the circuit configuration and then deriving the variational equations constitute barriers to an automated design.
It is therefore a purpose of the present invention to provide a circuit design support method, a implement thereof, and a circuit design support program with which a circuit element value and a waveform can be derived automatically with a computer.

Circuit design support method, device thereof, and circuit design support program


A DLI call from the batch application is intercepted, wherein the DLI call is made for the purpose of accessing a hierarchical database. It is then determined if the access to the hierarchical database is a checkpoint trigger event. A segment counter for a trigger segment in a checkpoint trigger for the checkpoint trigger event is incremented if the trigger segment is identified by the DLI call. The segment counter is compared to a segment commit threshold in the checkpoint trigger and commit point processing is performed on behalf of the batch application if the segment counter is in a predetermined relation to the segment commit threshold.

IMS is a hierarchical database management system (HDBMS) developed by International Business Machines Corporation. IMS has wide spread usage in many large enterprises where high transaction volume, reliability, availability and scalability are of the utmost importance. IMS provides software and interfaces for running the businesses of many of the world's large corporations. However, companies incorporating IMS databases into their business models typically make significant investments in IMS application programs in order to have IMS perform meaningful data processing work particularly tailored to the needs of their respective enterprises. IMS application programs are typically coded in COBOL, PL/I, C, PASCAL, Java or assembly language. These application programs may perform IMS database functions by making Data Language One (DLI) calls to invoke needed IMS processing.
A batch IMS application program may have been developed to run as a stand-alone batch application outside of the IMS subsystem environment. These programs are characteristically invoked by specifying either "PARM=DLI" or "PARM=DBB" on the Job Control Language (JCL) EXEC statement and are henceforth referred to as DLI/DBB batch applications.
A batch IMS application may also be developed to run as a BMP batch application executing under the control of an IMS subsystem. These programs are characteristically invoked by specifying "PARM=BMP" on the JCL EXEC statement and are henceforth referred to as BMP batch applications.
A batch IMS application, either a DLI/DBB batch application or a BMP batch application, may be initially developed without the deployment of commit point processing. This may be a reasonable development approach at the time an application is originally developed. However, various conditions and environmental factors may change over time making it desirable to add commit point processing at some future time.
For example, a database may grow in size over time such that higher processing volumes are encountered. This can result in excessive contention for record locking resources (such as enqueue/dequeue blocks in IMS), or negatively impact response time where needed segments are locked out from other online applications. Furthermore, without taking frequent commit points, an application may experience a significant recovery cost in the event of an abnormal termination. This is because all of the work performed by the application must be backed out and redone going all the way back to the beginning of the job. This may be an unacceptable impact for an enterprise that is executing long running jobs.
Furthermore, it is frequently desirable for a particular DLI/DBB batch application to be converted to a BMP batch application. For example, program recovery procedures may be greatly simplified by changing from a DLI/DBB batch application to a BMP running under the IMS subsystem. This simplification occurs because the BMP execution environment provides for advanced logging capabilities utilizing a single system log as well as automatic data backout in the case of an abnormal termination. Furthermore, the ability to share critical IMS resources is enhanced under the IMS subsystem since resources may be locked and unlocked dynamically as required, rather than locking these resources for the entire duration of the DLI/DBB batch application. However, converting and running a DLI/DBB batch application as a BMP application may encounter unwanted and unnecessary abnormal terminations when commit point processing is not being performed by the batch application. This is because, within the BMP online processing environment, enqueue/dequeue blocks must be periodically and timely released by an application to avoid exhaustion of the finite supply of these blocks, and it is commit point processing that is used to accomplish this periodic and timely release.
Implementing commit point processing into an existing application may entail a time consuming and error prone manual process to comply with all commit point processing requirements within a BMP environment. It is an object of the present invention to assist the database administrator and database developer with a novel and non-obvious improvement for expediting this aspect of the conversion process.
Therefore, it is frequently necessary for commit point processing to be added to IMS batch applications for a variety of reasons, as briefly discussed supra. However, modifying an IMS batch application program to incorporate commit point processing may be a tedious, complex and error-prone process. For example, following a checkpoint call, all positioning within the IMS database is lost. Therefore, prior to proceeding with the business logic of the batch application at hand, it may be necessary to reestablish all positioning within the database to the state immediately preceding the checkpoint call.
Modifying an existing batch application to incorporate appropriate checkpoint calls and to reestablish proper positioning within a database can be an intimidating task for even the best of programmers. This is because substantial code changes must be made with exacting precision, possibly with minimal program documentation and/or loss of contact with the original developers of the batch application. Many IMS enterprises delay receiving, or entirely forego, the many advantages of commit point processing because of the extensive coding effort, discussed supra, involved with making the transition to a commit point enabled batch application.
Even for a new batch application, where the difficulty of inadequate documentation for an existing application is not a factor, the complexity of implementing commit point processing into the new application may also slow the development process, with significant increase in the coding and testing effort.
Accordingly, there is a great need for a solution to facilitate and expedite the addition of commit point processing to an existing batch IMS application, as well as solutions to speed the development of new batch applications requiring commit point processing.

Auto-commit processing in an IMS batch application


A method for therapeutic and/or diagnostic treatment of soft tumor carcinoma in mammals using certain metals or particle-emitting radionuclides complexed with hydroxyethylethylenediaminetriacetic acid is described.

Metal ligand complexes are routinely used for medicinal applications. For example, gadolinium complexes (gadolinium-diethylenetriaminepentaacetic acid. Gd-DTPA) are used to enhance the quality of magnetic resonance imaging. Gd-DTPA has been utilized in studying abnormalities of the gastrointestinal tract, liver, and kidneys as well as visualizing heart infarcts. [See I. K. Adzaml., J. Nucl. Med. 32, 139 (1989).] When radioactive metal ions are used, diagnostic imaging or therapy can be the end objective. Thus .sup.99m Tc, a pure gamma emitter, in the form of a metal ligand complex is routinely used as a diagnostic agent. In some cases, such as the use of .sup.99m Tc-DTPA, injection of the complex into the bloodstream does not result in the radionuclide localizing in any tissue. Instead, the radionuclide is eliminated from the body by the kidneys into the urine. In other cases, the radionuclide does localize in desired specific organs or tissues. Thus specific .sup.99m Tc-phosphonic acid complexes localize in bone [Radiology 149, 823-828 (1983)] and one of the uses of .sup.99m Tc-phosphonic acid complexes is the detection of calcific tumors.
More recently, similar chemistry has been used to deliver particle emitting radionuclides to calcific type tumors. The aim of these agents is to diliver a therapeutic radiation dose to the site of the tumor. This type of agent takes advantage of fast bone turnover for its localization. Thus Deutsch et al. [Radiology 166, 501-507 (1988)] have proposed a rhenium-dipho for the treatment of bone cancers and Simon et al. (U.S. Pat. No. 4,898,724) have taught the use of rare earth radionuclides with aminophosphonic acids towards the same objective.
The specific delivery of metals to soft tissue (i.e. non-calcific) tumors has also been an objective for scientists. Anghilery in Nuklearmedizin 23, 9-14 (1984) describes the difficulty in achieving this objective when he states that "there are no fundamental qualitative differences in the structural, biochemical and functional characteristics of a tumor compared to the normal cell." With the advent of monoclonal antibodies, a plethora of activity has emerged using these proteins to deliver radionuclides to soft tissue tumors [e.g. A. R. Fritzberg et al., Pharm. Res. 5(6), 325 (1988)]. Bifunctional chelating agents were developed to bind the metal ions to the monoclonal antibody through a chelating agent (which metal-ligand-antibody system is termed a "conjugate") and many such conjugates have emerged. Some conjugates use gamma emitters such as .sup.99m Tc or .sup.111 In for imaging (see for example U.S. Pat. Nos. 4,454,106, 3,994,966, 4,662,420 and 4,479,930); and other proposed conjugates with particle emmiters such as .sup.67 Cu [see for example J. C. Roberts et al., Appl. Rad. Isotopes 40(9), 775 (1989)] or .sup.90 Y [see for example J. Nucl. Med. 26(5), 503 (1985)] for therapy. It was believed that the use of the conjugates provided the answer to the site specific delivery of a metal ion to soft tissue tumors. However, in the practice of the use of these conjugates a series of problems has been observed. For example, the problems have involved the fragile nature of the antibody, the slow clearance of the radioactivity from the blood stream, the uptake of radioactivity in non-target tissues such as liver and kidney, and the potential of an immune response of the patient to the injected protein.
Another approach to delivering metal ions to soft tissue cancers or tumors is by means of a metal ligand complex. Although this complex approach has not been pursued in the recent literature, it has received extensive attention in earlier literature. The recognition by Andrews et al. in Radiology 61, 570-599 (1953) that Ga.sup.+3 had a tendency to localize in soft tissue tumors led to the development of .sup.67 Ga-citrate as a tumor imaging agent [R. L. Hayes, Int. J. Nucl. Med. Biol. 10(4), 257-251 (1983)]. Although .sup.67 Ga-citrate is presently used for detecting abscesses more than for tumor diagnosis, many clinicians prefer to use it over the monoclonal antibody conjugates for diagnosis. Even though .sup.67 Ga-citrate is widely used, it has various disadvantages. For example, the rate of blood clearance is slow, so that images are taken as much as 48 hours post injection with .sup.67 Ga-citrate [see Int. J. Appl. Nucl. Med. Biol. 8, 249-255 (1984)]. In addition, high uptake of the .sup. 67 Ga-citrate in non-target tissues make images difficult to interpret [see Curr. Concepts in Diagn. Nucl. Med. 1(4), 3-12 (1984)].
In attempts to obtain more useful complexes for delivery of metal ions to soft tissue tumors, certain aminocarboxylic acid complexes have been used. For example, Karube et al. in Chem. Pharm. Bull. 30(7), 2529-2533 (1982) found that .sup.99m Tc-ethylenediaminediacetic acid (EDDA) and .sup.57 Co-EDDA could be used to image tumors in experimental animals bearing Ehrlich tumors. However, .sup.99m Tc complexes with other ligands were less effective. Some of the ligands tested with .sup.99m Tc were iminodiacetic acid (IDA), methyliminodiacetic acid (MIDA), nitrilotriacetic acid (NTA), ethylenediaminetetraacetic acid (EDTA), and hydroxyethylethylenediaminetriacetic acid (HEDTA). Woolfenden et al. in Int. J. Nucl. Med. 10(4), 251-256 (1983) found that .sup.153 Sm-citrate and .sup.153 Sm-chloride had a high liver uptake and suggested the use of higher stability chelates, such as .sup.153 Sm-EDTA, could improve the tumor to liver ratio. More recently, J. Harvey Turner in Eur. J. Nucl. Med. 13, 432-438 (1987) studied .sup.153 Sm chelates including HEDTA. The .sup.153 Sm-HEDTA chelates used a 20 to 1 HEDTA to Sm molar ratio. Tumor uptake was found to be significantly less than that of .sup.67 Ga-citrate; liver dose was much greater than tumor dose. He concluded that "it is unlikely that effective therapy doses of Sm-153 can be delivered to melanoma tumors by these and similar chelates." He suggested the use of monoclonal antibodies with .sup.153 Sm. Another attempt to have complexes deliver metal ions to soft tissue tumors was made by Tsc et al. in J. Nucl. Med. 30, 202-208 (1989) where they studied .sup.153 Sm-EDTA at a 10 to 1 ligand to metal molar ratio. These researchers proved that the complex was stable and compared the use of high specific activity .sup.153 Sm (1.7 Ci/mG) to low specific activity .sup.153 Sm (1.1 mCi/mG) in mice bearing Lewis lung carcinoma. They proposed using the complex as an imaging agent using the high specific activity .sup.153 Sm. However, similar to what J. Harvey Turner reported, these researchers also found significant uptake in the liver as shown by their biodistribution and images.
Therefore, there is still a need for an adaquate system to deliver radionuclides selectively to soft tissue tumors. Surprisingly, it has now been found that various radionuclide-HEDTA complexes, particularly the .sup.153 Sm-HEDTA complex, having a high ligand to metal molar ratio, such as from at least 50:1, give good soft tumor localization with no significant liver uptake and can be used as diagnostic or therapeutic agents.

Method of treating and/or diagnosing soft tissue tumors


The slit lamp microscope is capable of easily adjusting a slit-light and a backlight. The slit lamp microscope comprises: a slit lamp for emitting a slit-light; a mirror unit having a reflecting mirror or a prism, which reflects the slit-light emitted from the slit lamp toward an eye of an examinee; a microscope unit for observing the eye of the examinee; and a backlight source for emitting a backlight, which illuminates a circumference of the slit-light, toward the eye of the examinee. The backlight source is provided to the mirror unit.

A slit lamp microscope is used, by an ophthalmologist, for observing an eye of an examinee.
A conventional slit lamp microscope will be explained.
The slit lamp microscope irradiates an eye of an examinee with a slit-light from an oblique direction so as to visualize and observe transparent or semi-transparent tissues. The slit lamp microscope includes a slit-light optical system for emitting the slit-light and a microscope unit.
In case of irradiating the eye of the examinee with the slit-light only, an irradiation point on the eye is sometimes unknown. In this state, if a picture of the eye is taken, the slit-light will be focused on a slit. To solve this problem, a backlight source for illuminating a circumference of the slit-light, is provided to the conventional slit lamp microscope.
Japanese Laid-open Patent Publication No. 2011-177273 discloses a light emitting diode (LED) used for emitting a backlight. An auxiliary lamp unit including the LED is attached to a front end of a flexible arm.
The flexible arm is attached to a face supporting section, which supports a face of the examinee, and the backlight is emitted from a position above the eye of the examinee.
In the slit lamp microscope disclosed in Japanese Laid-open Patent Publication No. 2011-177273, the slit-light optical system for emitting the slit-light and the auxiliary lamp unit for emitting the backlight are separately provided.
However, in the conventional slit lamp microscope, irradiation points of the slit-light and the backlight on the eye of the examinee are separately adjusted when the slit-light and the backlight are emitted. So it takes a long time to adjust the both irradiation points.


A method for producing butyraldehydes, by separating and purifying mixed butyraldehyde products formed by hydroformylation of propylene, into n-butyraldehyde and isobutyraldehyde by using a distillation column, wherein the distillation column is operated under such conditions that the pressure at the top of the distillation column is within a range of from 0.001 to 0.5 kg/cm.sup.2 G, and the pressure at the bottom of the column is within a range of from 0.05 to 1.0 kg/cm.sup.2 G.

1. Field of the Invention
The present invention relates to a method for producing butyraldehydes. Particularly, it relates to a method for separating and purifying mixed aldehyde products formed by hydroformylation of propylene into n-butyraldehyde and isobutyraldehyde by distillation.
2. Discussion of Background
A process which comprises hydroformylation of propylene to obtain mixed butyraldehyde products, separating the products by distillation into n-butyraldehyde and isobutyraldehyde, subjecting the obtained n-butyraldehyde to aldol condensation to obtain 2-ethylhexanal, which is further subjected to hydrogenation to obtain 2-ethylhexanol, or a process which comprises subjecting the n-butyraldehyde directly to hydrogenation to obtain n-butanol, has been world-widely practiced on an industrial scale.
As a conventional technique for separating butyraldehyde isomers, e.g. Japanese Unexamined Patent Publication No. 273841/1992 discloses a method wherein crude aldehyde products containing branched chain and straight chain aldehydes are distilled in a single distillation column to obtain three different product streams simultaneously. As the distillation conditions for this method, it is disclosed that the distillation column is operated at a temperature of from about 115.degree. to 140.degree. C. under such a pressure condition that the pressure at the top of the column is from 0.07 to 2.1 kg/cm.sup.2 G, and the Examples are carried out under a column top pressure of from 0.6 to 0.7 kg/cm.sup.2 G at a column bottom temperature of from 99.degree. to 129.degree. C., and the pressure at the bottom of the column is from about 1.08 to 1.42 kg/cm.sup.2 G as calculated from the vapor pressure of n-butyraldehyde.
Further, U.S. Pat. No. 5,227,544 discloses a method for producing 2-ethylhexanol of a high purity, which comprises adding a small amount of water to an aldehyde distillation column to hydrolyze an oligomer of isobutyraldehyde contained in the crude butyraldehyde and to recover its entire amount in the form of a monomer. Here, the temperature at the top of the aldehyde distillation column is described to be preferably from 70.degree. to 90.degree. C., and the pressure at the top of the column is from about 0.2 to about 1.3 kg/cm.sup.2 G, as calculated from the vapor pressure of isobutyraldehyde.
Such an aldehyde distillation column designed to separate n-butyraldehyde and isobutyraldehyde, requires a large plate number and a large amount of reflux, since the boiling points of aldehyde isomers to be separated are very close to each other, and reboiling is one of the sections which require the largest energy in the process.
Now, to discuss the heat balance of a process relating to unitization of exhaust heat, the process will be described as divided into a heat generating side and a heat consuming side.
Firstly, the heat generating side will be described with reference to literatures. INDICATIONS, Winter 1982/83 (The International Journal of Davy Mackee) discloses that a hydroformylation reaction is carried out at about 100.degree. C. under about 20 atm by maintaining a uniform catalyst solution in a reactor using an aldehyde polycondensation product as a solvent in the presence of a rhodium catalyst and a triphenylphosphine ligand.
Further, an Example of Japanese Unexamined Patent Publication No. 242038/1990 discloses a method wherein a reaction is carried out at 100.degree. C. in a completely mixing type reactor of a first stage using the same catalyst as used in INDICATIONS, and an unreacted gas is introduced in a bubbling column type reactor of a second stage to further conduct a reaction at 90.degree. C. An Example of Japanese Unexamined Patent Publication No. 112733/1985 discloses a method wherein a hydroformylation reaction is carried out at 120.degree. C. using a water-soluble rhodium-phosphine complex as a catalyst.
Furthermore, WO93/20034 discloses Examples wherein a condensation reaction of n-butyraldehyde using an aqueous NaOH solution as a catalyst, is carried out at a temperature of from 63.degree. to 120.degree. C., and Japanese PCT Publication No. 501483/1991 discloses Examples wherein a catalytic hydrogenation reaction of aldehydes is carried out at a temperature of from 120.degree. to 125.degree. C. Japanese Unexamined Patent Publication No. 39632/1983 discloses a gas phase hydrogenation process which is carried out at an outlet temperature of the reactor of 195.degree. C. However, in such a high temperature reaction, reuse of the heat of reaction is easy, and the heat of reaction is effectively used e.g. for preheating water for a boiler or a hydrogenation step.
Now, the heat consuming side will be described. The main parts in the process where the recovered heat is used, include, for example, a distillation column for alcohol purification and an aldehyde distillation column for separating a n-butyraldehyde and isobutyraldehyde. In the distillation column, reboiling belongs to the heat consuming side, and at the same time, the condenser at the top dissipates the heat and thus may be regarded as belonging to the heat generating side.
In the distillation for purifying 2-ethylhexanol, it is common to employ a column top pressure within a range of from a few tens mmHgA to about 100 mmHgA. The column top temperature is from about 100.degree. to 122.degree. C., as calculated from the vapor pressure, and the column bottom temperature is still higher by about 10.degree. to 30.degree. C. than the column top temperature. The distillation for purifying n-butyl alcohol is carried out usually under a column top pressure at a level of atmospheric pressure, the column top temperature is about 118.degree. C., and the column bottom temperature is still higher by about 10.degree. to 30.degree. C. than the column top temperature.
Thus, the temperature levels at the heat generating side and the heat consuming side are very close to each other, and it has heretofore been difficult to conduct heat recovery inexpensively by direct heat exchange.
The conventional aldehyde distillation column has been operated under a relatively high pressure condition as mentioned above in order to decompose and recover high boiling point substances in the mixed aldehyde products as valuable products and to increase the column top temperature by pressurizing to make the temperature difference from the cooling water large so as to reduce the heat conducting area of the column top condenser. Consequently, the column bottom temperature has been necessarily high, whereby the energy consumption at the time of reboiling is large, and it has been difficult to efficiently recover exhaust heat from other heat generating steps in the process.


In accordance with the present disclosure there is provided a process for preparing a hydrogenated olefin polymer by hydrogenation of a polyoctene; said polyoctene being prepared by reacting a C8-olefin feed comprising an isomeric mixture of an alpha-olefin and a non-alpha olefin monomer in a controlled manner with the help of an ionic catalyst, while controlling at least one condition of the reaction selected from the group of condition consisting of exotherm, contact time of the olefin feed with ionic catalyst and molar ratio of the ionic catalyst to the olefin feed within predetermined ranges to obtain an oligomerized mixture comprising at least one polyoctene and unreacted ionic catalyst.

Value addition to a waste olefin feed is one of the biggest challenges for large scale industries. In general practice, the olefin waste feed is blended as fuel in LPG, gasoline, diesel or fuel oil. The olefin by-product stream generated at the polyolefin production plant comprises significant amount of olefins. For example a "polyethylene column residue" generated while manufacturing ethylene-octene copolymer comprises octene at the rate of 7900 kg/day.
Different methodologies have been practiced in prior-art for value-addition to these olefin by-product streams. Catalytic oligomerization of olefins is considered as one of the routes for value addition. Oligomerization is generally carried out on alpha-olefins. The oligomerized products of an alpha-olefin are further processed in variety of forms that include hydrogenated polyalpha-olefins, motor oils, synthetic lubricating oil, hydrogenated polydecenes as emollients, carrier oils in cosmetics, hydrogenated polyisobutenes as emollient and moisturizer.


This invention relates to a method or system for providing an indication or establishment of airway patency of a patient comprising monitoring of at least one targeted gas (e.g. CO2, N2 or may be other gases capable of being detected, monitored, and measured) that is being expired or being expelled from an airway of a patient (e.g. an apnoeic or non-spontaneously breathing patient), and based on measurements of the at least one targeted gas for a period of time, providing an indicator as to an output of the measurements of the at least one targeted gas for the period of time, or a determination as to airway patency, or a determination as to a location of a blockage or obstruction in the airway, or combinations of these.

Patients may lose respiratory function during anaesthesia, or sedation, or more generally during certain medical procedures. Prior to a medical procedure a patient may be pre-oxygenated by a medical professional to provide a reservoir of oxygen saturation, and this pre-oxygenation is generally carried out with a bag and a face mask. Once under general anaesthesia, patients must be intubated to ventilate the patient. In some cases, intubation is completed in less than 60 seconds, but in other cases, particularly if the patient's airway is difficult to traverse (for example, due to cancer, severe injury, obesity or spasm of the neck muscles), intubation will take significantly longer. While pre-oxygenation provides a buffer against declines in oxygen saturation, for long intubation procedures, it is necessary to interrupt the intubation process and reapply the face mask to increase the patient's oxygen saturation to adequate levels. The interruption of the intubation process may happen several times for difficult intubation processes, which is time consuming and puts the patient at severe health risk. After approximately three attempts at intubation the medical procedure will be abandoned.
If a patient's airway becomes occluded or obstructed (e.g. the airway may have collapsed or an item may have become lodged in the airway), then despite respiratory therapies which may be attempted for delivery to the patient for respiratory support, such therapies may be partially or wholly ineffective. In such situations, patient safety is compromised.
Reference to any prior art in this specification is not, and should not be taken as, an acknowledgement or any form of suggestion that that prior art forms part of the common general knowledge in the field of endeavour in any country in the world.


A method comprising determining that interference may occur in a wireless network an apparatus is connected to, obtaining a first link that is of a first type, obtaining a second link that is of a second type, determining data to be transmitted from the apparatus to another apparatus connected to the wireless network, determining that a transmission occurs in the first link and transmitting the data in the second link, wherein the transmission in the first link has a longer duration than transmitting the data in the second link and the transmission in the first link and transmitting the data in the second link overlap in time.

Wireless communication networks allow apparatuses such as terminal devices to be connected to a network and transmit and receive data wirelessly even when a terminal device is moving. An apparatus may further have a multi-link capability allowing the apparatus to be connected to multiple channels and/or bands simultaneously. Wireless transmission may be prone to interference and therefore it is desirable to ensure that interference does not prevent successful transmission of data in a wireless network.

Ensuring transmissions are completed in a wireless network


An electronic system for mapping a work site that includes a plurality of radar sensors to be provided on vehicles moving on the site, the radar sensors being able to detect objects included in a respective area of detection and acquire their relative positions. The system includes a speed module configured for determining a speed parameter for objects detected by the radar sensors, according to their relative positions. The system also includes a classification module configured for classifying detected objects as standing still or moving objects according to the respective speed parameters, and a map module configured for creating a common map of the site providing the positions of standing still objects detected in the site by said plurality of radar sensors, according to a reference system.

The invention relates to a method and system for mapping work sites, in particular agricultural or a construction sites. In detail, the invention relates to the mapping of a work site by means of vehicles running thereon, particularly construction vehicles, like excavators or the like and agricultural vehicles, such as tractors, combines, etc.
It is well known that one of the main concerns of the operator driving an excavator in a construction site, is to avoid to run into a building or a pole or another obstacle. This is especially critical when the operator drives in reverse, because of the limited visibility. Similar problems arise when an operator is driving a tractor in an agricultural field.
Currently, the operators working for many days in the same site, try to remember the peculiarities of this site, namely the positions of various fixed objects which may obstacle the operations and or be source of collision risk. Also, the operator, during lunch breaks, or similar occasions, share the information about the positioning of these fixed objects. However, this is not a reliable system for preventing possible collisions and for avoiding to go through inefficient complicated maneuvers in order to move through the working site.
It is an object of the present invention to provide an apparatus and a method for mapping a site, particularly a working site, able to satisfy the above-cited need. This object is achieved by the system realized in accordance with claim 1 and by the method carried out according to claim 12.

Method and system for mapping a work site


A logic analyzer according to the subject invention includes a disassembler for disassembling object code. The disassembler automates the process of locating op-code addresses by utilizing information derived from an object file corresponding to the code whose execution is being disassembled. The object file includes addresses for the starting location of op-codes corresponding to individual source code lines. When the disassembler cannot determine the correct starting location for an op-code, it uses information from the object file to obtain the address of an op-code within a specified range of interest.

In earlier days, engineers typically wrote control code for test and measurement systems in assembly language, a low-level language. Today, however, to improve development time and to enable the creation of programs having greater functionality and complexity to be developed in shorter time, engineers typically employ high-level languages, for example C, C++, etc. The high-level language is converted into machine code for operation on the particular processor, by a compiler/assembly/linker system, which generates assembly language and/or machine code based on the high-level source code.
Unfortunately, when debugging the program, the engineer must work with the low-level machine code. The low-level machine code is a series of binary numbers, or hexadecimal codes (base 16) and is not easy to understand. Typically, the machine code is reconverted to assembly language by a disassembler program to aid the engineer to understand the code that he is viewing.
However, the engineer did not write the software in assembly language. Moreover, the engineer may be unfamiliar with the methods employed by the compiler to generate assembly language code corresponding to various source code statements. Thus, it becomes complicated for the engineer to understand the exact operation of the system during a debugging operation.
Substantially all computer programs must be debugged because of their complexity, and because human programmers make mistakes. Computer code that performed well in simulation may fail to perform adequately under "real world" conditions for a variety of reasons, such as the relative unpredictability of the timing and form of real world input signals. Traditional software debuggers perform disassembly of code residing on the system under test (also known as the target system) and aid in the troubleshooting of code that is not performing as expected. Disassembly of computer code is the process of converting machine code back into assembly language for ease of understanding by a programmer or engineer troubleshooting a problem. Software debugger based disassemblers typically have access to the target system memory by way of an emulator probe or serial connection, such as through a JTAG port. Using this access, they are able to perform disassembly based on the memory image in the target system, translating the code found there into higher-level assembly language.
Disassembler software can also be run on a logic analyzer, such as a TLA 700 Series Logic Analyzer, manufactured by Tektronix, Inc. of Beaverton, Oreg. Such a disassembler running on a logic analyzer is described in U.S. Pat. No. 6,016,556, entitled SYSTEM FOR IDENTIFYING AN ACQUISITION SAMPLE CORRESPONDING TO A SOURCE CODE STATEMENT, (Heath), issued 18 Jan. 2000, assigned to the same assignee as the subject invention, and hereby incorporated by reference. Disassembler software running on a logic analyzer translates low-level machine code, of the target system under test, into easy-to-understand higher-level language as a troubleshooting aid to the user of the logic analyzer. Unfortunately, a disassembler running in a logic analyzer does not have access to the memory of the system under test. It therefore cannot operate on an image of that memory to translate the code. Moreover, a logic analyzer cannot interrogate the system under test to determine the contents of a particular memory location. A logic analyzer can only monitor bus traffic on the target system, and attempt to interpret the binary data that it acquires from the bus.
In a logic analyzer, the process of disassembly involves converting acquired bus transaction records into a listing of assembly language instructions that, when executed, would have generated that bus activity. This conversion process is sometimes ambiguous as a result of a variety of circumstances such as insufficient transaction history, variable length instructions, and lack of an instruction fetch indicator. When any of these conditions occur, the conversion process will most likely suffer. That is, the conversion process sometimes makes an incorrect assumption about where a new assembly language instruction, known as an op-code, actually begins. The disassembler often mistakes data or address information for an op-code, and consequently incorrectly disassembles the given set of bus transactions, because the disassembler was pointed to an incorrect starting address.
To compensate for this ambiguity, disassemblers currently provide a mechanism known as "mark op-code", which enables a user to manually indicate the correct starting address for an assembly language instruction. There are two significant problems with this solution. First, users must recognize when the displayed disassembly trace is incorrect and then figure out where it went wrong in order to know where to place the op-code mark. This can be confusing and error prone because the user is usually looking at unfamiliar code. Second, users must manually mark numerous such locations as they examine different parts of an acquisition trace. This manual marking procedure can be cumbersome and time consuming, especially because the user must frequently "jump" to new locations in the acquisition buffer that have not been previously disassembled. What is needed is a disassembler for a logic analyzer that more efficiently, more precisely, and automatically resolves most of these starting address ambiguities.

Logic analyzer having a disassembler employing symbol table information for identifying op-codes


The present application discloses a processing method, device, terminal and apparatus for partial bandwidth deactivation timer, including: receiving an instruction related to the uplink transmission sent by the network side; starting or restarting the partial bandwidth deactivation timer according to the received instruction. The present application clarifies the specific working mechanism of the partial bandwidth deactivation timer, so that the terminal and the base station can perform signaling and data transmission on the correct resources, thereby avoiding signaling and data transmission errors and resource waste.

In a traditional Long Term Evolution (LTE) system, the cell bandwidth at the network side is less than or equal to the receiving bandwidth of 20 MHz of the terminal, so the network side always allocates the total uplink and downlink bandwidth of the cell to the terminal, and the terminal can work over the entire cell bandwidth. In a Next generation Radio (NR) system, the network-side bandwidth can be up to 400 MHz, which is much larger than the receiving capability of the terminal. Therefore, the concept of Band Width Part (BWP) is introduced, that is, the large bandwidth at the network side is divided into multiple BWPs, one or more BWPs are configured to the terminal, and a part of the configured BWPs are activated for uplink and downlink transmissions for the terminal, where the activated downlink BWP is called the active DL BWP, and the activated uplink BWP is called the active UL BWP. In the R15 version, for a terminal, only one DL BWP and one UL BWP are allowed to be activated at one moment, and the inactive BWPs cannot perform the uplink and downlink signaling and data transmissions.
For the BWP, the 3GPP further defines some basic concepts:
Initial BWP: for a terminal that accesses initially, it can only use the initial BWP to complete the connection establishment process. The initial BWP contains the basic cell broadcast signaling and random access resources and others.
Default BWP: the next generation NodeB (gNB) at the network side can configure a default BWP for a terminal in the connected state, and the terminal can perform some basic work on the default BWP, such as maintaining the cell connection, performing the cell measurement, initiating the random access, and the like.
Configured BWP: the BWP configured by the network side for a single terminal in the connected state, where each BWP may have different configuration content, such as Physical Uplink Control Channel (PUCCH) configuration, Semi-Persistent Schedule (SPS) configuration or the like. The DL BWP (downlink BWP) and UL BWP (uplink BWP) may be configured respectively.
Active BWP: in the BWPs configured by the network side for a terminal, the terminal only uses the active BWPs for uplink and downlink transmissions. The active BWPs are divided into active DL BWP and active UL BWP.
After configuring multiple BWPs for the terminal, the network side may use the physical layer signaling Downlink Control Indicator (DCI) to change the active BWPs, where the active uplink and downlink BWPs may be changed respectively. In addition, the BWP inactivity timer (Band Width Part inactivity timer) is introduced. When the BWP inactivity timer expires, the active DL BWP of the terminal needs to be changed to the default DL BWP.
The disadvantage in the prior art is that the working mechanism of the BWP inactivity timer has not been specified.

Processing method, device, terminal and apparatus for partial bandwidth deactivation timer

DATANG MOBILE COMMUNICATIONS EQUIPMENT CO., LTD.


Disclosed is an optical fiber pressure sensor including: a polarization beam splitter that splits input light from a broadband light source into two beams; a polarization controller through which vertically and horizontally polarized light coming out of the polarization beam splitter pass; a pressure chamber in which the polarization beam splitter and the polarization controller may be placed; and an optical spectrum analyzer into which vertically and horizontally polarized light passing through the polarization controller and getting out of the polarization beam splitter is introduced, wherein the pressure chamber includes a polarization-maintaining fiber and an optical fiber Bragg grating.

Field of the Invention
The present invention relates to an optical fiber pressure sensor and a pressure measuring method using the same, and more particularly, to an optical fiber pressure sensor capable of measuring pressure through change in wavelength of output interference spectrum at the time of applying pressure.
Description of the Related Art
Nowadays, many sensors are used to prevent a safety accident in advance at industrial sites, and new sensors have been developed up to now. Among them, pressure sensors are used in various industrial fields. When the sensors described above are embodied using optical fibers, it is possible to make the sensors smaller and lighter than electronic sensors, and there is no influence of electromagnetic interference on them. In addition, there is an advantage that optical fiber is strong against corrosion and has a life longer than that of a general electric wire.
Particularly, in order to optically measure pressure while making the best of above advantages, polarization-maintaining fiber (PMF) can be used. The PMF is an optical fiber that maintains polarization of polarized incident light to an optical fiber output terminal as it is by inducing large birefringence to an optical fiber core. As a method of inducing birefringence to an optical fiber core, there are a method of inserting a stress rod with a different expansion rate to a part of cladding to apply stress to the core, and a method of deforming a shape of a core into an elliptical shape other than a circular shape. As types of PMF described above, there are a panda type PMF, a bow-tie type PMF, and an elliptical clad type PMF. When external environmental factors such as temperature, pressure, strain, etc. around such a PMF are changed, physical properties of the PMF are varied. Using these characteristics that the physical properties of the PMF are varied, it is possible to measure change in various physical parameters applied to the PMF.
In particular, a Sagnac birefringence interferometer based on polarization-maintaining photonic crystal fiber (PM-PCF) has a simple structure, has high sensitivity of PM-PCF physical property to change in external physical parameters, has a characteristic which does not depend on input polarization, and is insensitive to change in external temperature, and thus it is widely used as a sensor head or a demodulation filter recently.
However, the PM-PCF used as the sensor head of the optical fiber pressure sensor is expensive over ten times as compared with the PMF, and has pressure sensitivity equal to or lower than the half, which are its disadvantages. In addition, the internal structure of the PM-PCF contains the periodical arrangement of air holes, and thus fusion splicing with general optical fibers is difficult, resulting in the increase of fusion splicing loss. And the increased splicing loss disturbs the accuracy of a sensor, which is another problem.
As a related report, an optical fiber pressure sensor having a Sagnac birefringence interferometer structure formed of PM-PCF with a length of 58.4 cm was demonstrated in Appl. Optics. vol. 47, pp. 2835-2839, 2008. In the previous study, a measurement range was 0 to 0.3 MPa, and measured pressure sensitivity was about 3.42 nm/MPa.

Optical fiber pressure sensor and pressure measuring method using the same

PUKYONG NATIONAL UNIVERSITY INDUSTRY-UNIVERSITY COOPERATION FOUNDATION


An apparatus for purifying an exhaust gas for an internal combustion engine having units for the adsorption of HC gases in the exhaust gas, arranged in an exhaust manifold of the engine facing corresponding exhaust ports in such a manner that straight flows from the corresponding exhaust ports contact the corresponding adsorption units. A controller receives a signal indicating a temperature of one of a catalytic converter and the adsorption units. The controller sends a signal to a cooling apparatus, such as a fan, indicating a desired on condition of the cooling apparatus based on the temperature signal. The cooling apparatus is provided for generating air flows for cooling the adsorption units. The fan is operated when the engine, in a cold state, is started. The operation of the fan is continued until a catalytic converter arranged downstream from the adsorption units becomes effective, i.e. the temperature of the catalytic converter is higher than a predetermined value.

1. Field of the Invention
The present invention relates to a device for purifying an exhaust gas from an internal combustion engine. More particularly, the present invention relates to a device for purifying hydrocarbon (HC) components in an exhaust gas in a gasoline internal combustion engine, which are generated when an engine in a cold condition is started.
2. Description of Related Art
A catalytic converter is usually arranged in an exhaust pipe of an internal combustion engine, so that exhaust gas contacts the catalyst layers of the catalytic converter. As a result, unburnt components, such as hydrocarbon (HC), are purified. However, in order to obtain such an operation, the catalyst must be in an activated condition, i.e., the catalyst must be in a desirable temperature range. Thus, when an engine in a cold condition is started, the exhaust gas purification can not be obtained until the temperature of the catalyst is increased to the desired value.
In order to obviate this problem, Japanese Unexamined Patent Publication No. 6-212951 proposes a solution wherein an adsorption unit is arranged in an exhaust manifold in such a manner that the HC adsorption unit faces an exhaust port of the engine. Due to the arrangement of the adsorption unit with respect to the exhaust port, a straight flow of exhaust gas from the exhaust port first contacts the adsorption unit, so that hydrocarbon components, in the exhaust gas at a low temperature, generated just after the engine is started are captured and temporarily held by the adsorption unit. An increase in the temperature of the exhaust gas causes the hydrocarbon components to be released from the adsorption unit and entrained in the flow of the exhaust gas. The released hydrocarbon components in the flow of the exhaust gas are purified at a catalytic converter located at a downstream position, which is now in an activated condition.
In the above mentioned patent, the adsorption unit is constructed by a casing which is opened only at a side facing the exhaust port, and a carrier body including HC adsorbent housed in the casing. Due to this one end closed structure, the straight flow of the exhaust gas contacting with the HC adsorbent is prevented from being passed through the layer of the HC adsorbent, so that an increase in the temperature to the HC release temperature (about 100.degree. C.) after the start of the engine occurs relatively slowly. As a result, the HC components generated prior to the completion of the activation of the catalytic converter are held in the adsorption unit, on one hand and, on the other hand, the adsorption unit is prevented from being overheated when the temperature of the exhaust gas is high due to the execution of a high load operation.
However, even in the above mentioned improved system, it may be possible that a premature desorption occurs prior to the activation of the catalyst located downstream from the adsorption unit, which causes the HC components to be exhausted without being purified at the catalytic converter. Thus, there has been a long felt need that the adsorption unit is, for a prolonged time, maintained at a low temperature whereat the HC adsorption capacity is high. Furthermore, in the above mentioned prior art system, an arrangement of the exhaust system is such that the exhaust gas is partly directly directed to the exhaust pipe. In other words, lighter components in the exhaust gas are directed to the exhaust pipe without making contact with the adsorption unit, thereby reducing HC adsorption capacity compared to a construction wherein all of the exhaust gas flows into the HC adsorption unit as disclosed in the Japanese Unexamined Patent Publication No. 2-135126.
Furthermore, it is usual for an internal combustion engine to use a rich air-fuel mixture during a high load operation, which makes the temperature of the exhaust gas low, thereby preventing the catalytic converter from being overheated. However, in order to allow an internal combustion engine to be operated under a theoretical air-fuel ratio, an arrangement is often employed, in a vehicle for use in European countries, wherein a catalytic converter is arranged below a floor of the vehicle, where the temperature of the exhaust gas is relatively low. However, a use of the prior art device (Japanese Unexamined Patent Publication No. 6-212951) in such a type of vehicle will easily cause the temperature of the exhaust gas from an exhaust port to be highly increased, so that the temperature of the adsorption unit is also highly increased, which causes the fine structure of the adsorption unit to be easily damaged. Furthermore, a substantial gas flow is not generated inside the HC adsorption unit, which prevents the HC gas from being fully subjected to a desorption even after the temperature of the adsorbent is higher than a predetermined desorption temperature, resulting in the HC components being carbonized, thereby reducing the HC adsorption capacity.