Methods and systems are provided for managing dependencies between projects in a project management application. The methods and systems utilize one or more project webs which are shared web-based collaborative workspaces for managing dependencies between projects.

With the advent of the computer age, computer and software users have grown accustomed to user-friendly software applications that help them write, calculate, organize, prepare presentations, send and receive electronic mail, make music, and the like. Modern word processing applications, for example, allow users to create and edit a variety of useful documents. Modern project management applications, as another example, allow users to create project management schedules for organizing and managing tasks, resources and labor associated with a variety of projects.
Manual and computerized project management systems allow managers and planners to organize and plan the tasks, resources and schedules required for completion of a given project. In most projects, a number of dependencies and constraints dictate the timing and completion of an overall project and of sub-projects comprising the overall project. For example, in a house construction project, a drywall sub-project may not typically begin until the completion of electrical work. And, a number of sub-projects may be constrained by the availability of labor and resources. Project management software applications have been developed for creating and automating project management schedules. With many such systems, tasks or sub-projects comprising an overall project are set out in scheduling charts, such as Gantt Charts, showing start dates and finish dates for given milestones and associated tasks comprising the overall project and providing information regarding utilized resources and constraints associated with the milestones and tasks comprising the project.
A commitment is an agreement between two people (or organizational entities) to fulfill a set of conditions. That is, commitments may be described as dependencies between two or more entities. For example, a first company team may commit to delivering a prototype of an application to a second company team by a date certain, Aug. 8, 2005. The team responsible for getting the work done is the "commitment provider", while the team relying on the timely completion of the set of conditions is known as the "commitment consumer." In this example, the commitment itself is the delivery of the application prototype.
In prior versions of Microsoft Project, this sort of dependency between projects was modeled using cross-project links ("CPLinks"). In Microsoft Project Standard, for example, to establish the dependency, a user would be required to open both projects and drag a dependency link from one task in one project to the other task in the other project. That is, CPLinks provided a tightly coupled implementation where a task from one project was imported into another project at a client station. Moreover, with CPLinks, a dependency that spans from one task in a project A to another task in a project B is treated the same way as two tasks in the same project are treated. Whenever the originating task changed by any means, the task was updated in any project that linked to the affected task. This automatic process can be very invasive to all of the projects involved, a potentially unacceptable result for a project manager of an affected project.
For example, a change in a task in project1 could result in a cascading update in project1 where a cross project linked task had one or more dates affected. The cross project linking system would then open up linked projects, project2 and project3, for example, and update the mirror of the linked task in those projects. This would often result in complete schedule shifts in the affected projects with no mechanism to undo the changes or to stop the changes from occurring. To complicate matters further, project2 and project3 might provide CPLinks themselves that are modified during the initial CPLink update. This would cause all of the projects relying on project2 and project3 to be opened and updated.
Basically one of the problems that customers face today when they're managing multiple projects is handling dependencies that span various projects. For example, assume two projects exist, project A and project B. Project B may have dependencies (i.e. tasks, resources, etc.) which depend on project A and vice versa. Customers face a fairly difficult problem managing those dependencies between projects. When something affects a task in project A, project B would like to know about it.
Currently, the task in project A is reflected "as-is" in project B. This results in a lot of "noise" as even a small change of date in project A affects project B's schedule. In the real-world, a project manager that has a commitment to another project usually would like to control the date "visible" to the other project, and allow the task in his project some buffer prior to the actual commitment date. On the flip side, project manager of project B would like to control how task changes in dependent projects affects his schedule.

Method and system for providing cross project commitments


A tube electrode stabilizer for an EDM drilling includes a stabilizer block and a mover. The stabilizer block has a concaved in shaped supporting wall that parallels to the traveling path of a tube electrode, and has a plurality of apertures interconnected to air vacuuming connections to suck air. The mover is connected to the stabilizer block for approaching the tube electrode. Suction force pushes the tube electrode against the supporting wall to achieve stabilization of the tube electrode. The stabilizer block further has a sensor to detect whether the tube electrode is seated into the stabilizer block or not and to measure the available length of the tube electrode before or after drilling.

1. Field of the Invention
The present invention relates to a tube electrode stabilizer, and more particularly, to a tube electrode stabilizer for an EDM drilling.
2. Description and the Prior Art
EDM drilling requires more considerations than die sinker Electrical Discharge Machine (EDM) in terms of the tube electrode rigidity and the supply of the dielectric fluid. Typically, holes drilled on a work piece are deep and small, and a tube electrode is used to make the holes and supply dielectric fluid for EDM drilling. The fluid is pressurized to flush away the chips generated during EDM process.
For material removal, EDM discharge power is generated within the gap formed between the tube electrode and the work piece. Discharging creates pressure pushing a lower end of the tube electrode upward and causing the tube electrode to bend especially for a small diameter tube. The pressurized fluid supplied through the tube electrode and fraction between the tube electrode and guide also contribute to the bending of the tube electrode making the tube electrode unstable.
As shown in FIG. 4, a tube electrode 5 is clamped, rotated and inserted into a guide 6 near a work piece 7 by a collet 4 of a spindle 3. Due to the hollow and thin body of the tube electrode 5, for example, 400 mm long and 0.3 mm (and less) in diameter, the tube electrode 5 has very poor rigidity. The top and the center portions of the tube electrode 5 will swing outwardly when a bending force is encountered.
The swing of the top and the center portions of the tube electrode 5 affects the accuracy and efficiency of the electrode discharge machining. This invention is therefore to solve the above-mentioned shortcomings.
The primary objective of the present invention is to provide a tube electrode stabilizer for an EDM drilling comprising a stabilizer block and a mover. The stabilizer block has a concaved in shaped supporting wall that parallels to the traveling path of a tube electrode, and has a plurality of apertures interconnected to vacuuming connections to suck air. The mover is connected to the stabilizer block for approaching the tube electrode. Suction force pushes the tube electrode against the supporting wall to achieve stabilization of the tube electrode.
The secondary objective of the present invention is to provide a tube electrode stabilizer further having a sensor to detect whether the tube electrode is seated into the stabilizer block or not and to measure the available length of the tube electrode before or after drilling.

Tube electrode stabilizer for an EDM drilling


Embodiments are directed to methods of forming a semiconductor device and resulting structures for improving gate height control and providing interlayer dielectric (ILD) protection during replacement metal gate (RMG) processes. The method includes forming a semiconductor fin on a substrate. A sacrificial gate is formed over a channel region of the semiconductor fin, and an oxide hard mask is formed on a surface of the sacrificial gate. An interlayer dielectric (ILD) is formed adjacent to the sacrificial gate. The ILD is recessed below a surface of the oxide hard mask, and a nitride layer is formed on a surface of the recessed ILD.

The present invention relates in general to semiconductor device fabrication methods and resulting structures. More specifically, the present invention relates to fabrication methods and resulting structures that improve gate height control and provide interlayer dielectric (ILD) protection during replacement metal gate (RMG) processes.
In contemporary semiconductor device fabrication processes a large number of semiconductor devices such as field effect transistors (FETs) and on-chip capacitors are fabricated on a single wafer. Some non-planar device architectures, such as fin-type field effect transistors (finFETs), employ semiconductor fins and side-gates that can be contacted outside the active region, resulting in increased device density and some increased performance over lateral devices. A typical finFET device includes a vertical fin or nanowire that extends upward from the substrate. The fin or nanowire forms the channel region of the transistor. A source region and a drain region are situated in electrical contact with the top and bottom ends of the channel region, and the gate is disposed on one or more of the fin or nanowire sidewalls.

INTERNATIONAL BUSINESS MACHINES CORPORATION


The biometrics verification system uses an application server and an authentication server, where the application server and the authentication server operate in parallel. The application server has a BIC card read module, a BIC card verification module, and a result display module. Whereas, the authentication server has a facial detection module, a facial feature extraction module, and a facial feature matching module. The BIC card read module reads source facial features from a BIC card. The BIC card verification module verifies the source facial features. The result display module displays matching results generated by the facial feature matching module. The facial detection module detects target facial images. The facial feature extraction module extracts target facial features from the target facial images. The facial feature matching module matches the target facial features with the source facial features transmitted via the secure channel service. The facial feature matching module generates the matching results.

1. Field of Invention
The present invention relates to a biometrics verification system. More particularly, the present invention relates to a biometrics verification system utilizing facial features for verification.
2. Description of Related Art
Biometrics recognition is a technology that can recognize biological features of a living subject, such as facial features, a fingerprint, an iris, or a voice. Biometrics recognition technology has various potential applications, particularly in applications requiring access control, such as a security system or a gate control system. When an entrant wants to enter an access control system implemented with a biometrics recognition function, the entrant is required to demonstrate particular biological features, such as facial images or a fingerprint. The system compares these biological features with the biological features of an allowed entrant stored in a database. If the retrieved biological features match the ones stored in the database, the entrant is allowed to access the system.
However, during the comparison, the system compares the retrieved biological features with the features of every allowed entrant stored in a database. Therefore, comparison time required increases significantly when data volume stored in the database increases. Besides, since the biological features of allowed entrants are stored in a database, they are vulnerable to invasion. Once the biological features are revealed, all systems employing the same biological features for recognition are no longer secure and valid.

Biometrics verification system and a method thereof

International Biometrics Recognition Technologies Co., Ltd.


A closure for a container includes a cap connected to a retaining ring. The cap includes a cover and a skirt. A plurality of concentric threads are disposed on an inside surface of the skirt. The plurality of threads includes at least a first thread at a first level and a second thread at a second level. The first thread is comprised of at least a first thread segment separated from a second thread segment by a first space. The second thread is comprised of at least a third thread segment separated from a fourth thread segment by a second space. A plurality of latch segments includes a first latch segment separated from a second latch segment by a third space. The first space, the second space, and the third space at least partially overlap in along a radial direction of the cap to provide a flex point.

The beverage market has under gone a steady transition with each new generation of packaging being developed using a lighter and lighter bottle design. This process continued with the closures becoming smaller and smaller. These changes required significant changes to the bottler's equipment along with the corresponding required investment.
The present embodiments present a complete rethinking of this process. By keeping the key dimensional features of current caps, the need for changes to the bottlers equipment can be eliminated. At the same time, by redesigning the internal features of the closure to achieve what used to require a new cap and/or bottle design, a significantly lighter closure will result. More particularly, by thinning out the closure walls, interrupting the threads, modifying the closure "corner", adding ramps and a plug "rudder," an HDPE closure results that works in a market previously completely dependent on LDPE and LLDPE closures. Because HDPE is significantly stiffer than LDPE and/or LLDPE, the features of the present embodiments "lightweight" the closure and result in a closure with nearly identical field performance to current market closures. And, because the cap is lighter and because the market price is significantly lower for HDPE resin versus LDPE or LLDPE resin, the present embodiments provide a more cost effect closure to the market place while at the same time providing a significant improvement in the carbon footprint of the project. In addition, HDPE allows for a significant improvement in cycle time, further improving cost profile and carbon footprint.


Methods, systems, and apparatus, including computer programs encoded on computer storage media, for processing order information are provided. One of the methods includes: receiving, by a server from a first client associated with a user, a request for generating an order, the request comprising identification information of a food establishment, identification information of the user, and information of a selected data object; generating, by the server, the order based on the request; sending, by the server, the order to a second client associated with a processing and preparing area of the food establishment; generating, by the server, a geometric code encoding identification information of the generated order; and sending, by the server to a third client associated with a raw material storage area of the food establishment, the generated geometric code and the information of the selected data object.

In a modern society with rapid development in all aspects, a sharp contradiction is seen between the increasing pacing of work and life and people's pursuit of a high-quality life. For example, in terms of dining services, on the one hand, people asks for a fast service to avoid being late for work, etc.; on the other hand, people pursue high quality, fresh ingredients, and so on. In the existing dining service industry, however, fast-food service providers generally process and prepare food in batches in advance, and thus the freshness of ingredients and finished products cannot be guaranteed. On the other hand, although traditional dining service providers can guarantee the freshness of ingredients to some extent and can process and prepare the dishes after receiving a user's order, the waiting time varies, which is especially the case during crowded dining time when a waiting time tends to be longer.
In summary, in the current technologies, when choosing dining services, people generally can only select either speedy services or fresh food, and having both seems to be a challenge. Therefore, how to enable dining service providers to better provide both speedy services and fresh food has become a technical problem that needs to be addressed by those skilled in the art.

Restaurant, and order information processing method and apparatus


An adjustable hydrostatic axial piston machine of swash plate design includes an actuating apparatus with a cylinder/piston unit and an actuating spring. The actuating apparatus is configured to adjust a pivot cradle of the axial piston machine. The actuating spring engages around at least one axial section of the cylinder/piston unit.

The disclosure relates to an adjustable hydrostatic axial piston machine of swash plate design.
An adjustable hydrostatic axial piston machine of swash plate design has a pivot cradle, on which a swash plate is arranged, on which a multiplicity of working pistons are supported. In order to adjust a pivoting angle of the pivot cradle, an actuating apparatus is known with a cylinder/piston unit and with an actuating spring which acts counter to the latter. Here, either a positive stroke of an actuating piston of the cylinder/piston unit or a positive stroke of the actuating spring can lead to pivoting of the pivot cradle out of a neutral or zero position.
DE 199 49 169 C2 discloses an adjustable hydrostatic axial piston machine of swash plate design, in which the cylinder/piston unit is arranged so as to lie opposite the actuating spring in relation to the pivot cradle. Here, a longitudinal axis of the cylinder/piston unit is set against a drive shaft of the axial piston machine. It is a disadvantage of the solution that the actuating spring has to be of comparatively long configuration, in order to pivot the pivot cradle out of the neutral position. As a result, the axial piston machine is of long construction, in particular in the axial direction. Since the actuating spring has to be compressed or prestressed for installation, both the actuating spring and the pivot cradle are difficult and complicated to install. Furthermore, it is disadvantageous that the actuating spring does not have any axial guidance, apart from at its end sections, and is loaded with transverse forces, since, during pivoting of the pivot cradle, an articulation point of the actuating spring on the pivot cradle is displaced radially or transversely with regard to an articulation point of the actuating spring, which articulation point is fixed to the housing. Since the longitudinal axis of the cylinder/piston unit is set against the drive shaft, an actuating force which is to be applied for pivoting is additionally comparatively high.
The data sheet RDE 92703-05-L/09.08 from the applicant discloses an adjustable hydrostatic axial piston machine of swash plate design which is comparable with DE 199 49 169 C2, with a modified adjustment type but with the same disadvantages.
DE 10 2006 061 145 A1 discloses an adjustable hydrostatic axial piston machine of swash plate design, in which the cylinder/piston unit is likewise arranged so as to lie opposite the actuating spring in relation to the pivot cradle. In a deviation from the prior art shown, the cylinder/piston unit is arranged parallel to the drive shaft in order to reduce the actuating force to be applied, and the actuating piston is supported via a sliding pad on an identical sliding face of the swash plate, on which the working pistons are also supported. In addition, firstly the actuating piston and the working pistons and secondly their sliding pads are of structurally identical configuration, which reduces the outlay in apparatus and manufacturing terms. However, it is still a disadvantage of the solution that the actuating spring is long, with the result that firstly the actuating spring and the pivot cradle are difficult to install and secondly the actuating spring is loaded with transverse forces during pivoting of the pivot cradle.
In contrast, the disclosure is based on the object of providing an adjustable hydrostatic axial piston machine of swash plate design which is of smaller overall construction.


A triple eccentric valve with a symmetric drain-proof ring includes a valve body, a stem, a valve disk, a waterproof washer, and a drain-proof ring. The valve disk is formed as an asymmetric conical shape. The drain-proof ring is an O ring and is arranged in a stepped recess of the valve disk to seal the waterproof washer; the drain-proof ring is symmetric to the axis of the ring. In assembly state, a periphery of the drain-proof ring resists against an inner wall of the annular seat. The drain-proof ring is symmetrical. Furthermore, an inner side or a part of the valve seat has a shape matched to a sweeping track of an outermost point of the drain-proof ring so that when the drain-proof ring moves along the valve seat, only force tangent to the inner side of the valve seat is applied from the drain-proof ring to the valve seat.

With reference to FIGS. 8 and 9, a prior art triple eccentric valve structure is illustrated. Such kind of valve has been disclosed in some prior art, such U.S. Pat. No. 4,284,264.
In FIG. 9, the prior art disk valve has a valve body 1′ having a chamber 10′, a stem 2′ passing through the valve body 1′ to the chamber 10′; an annular seat 30′ installed in the chamber 10′; and an drain-proof ring 32 which is an O ring. The drain-proof ring 32 is asymmetric to an axis passing through a center of the ring (referring to FIG. 8). A valve disk 31′ is installed to the valve body 1′. A radial hole radially passes through the valve disk 31′ for receiving the stem 2′ for controlling the valve disk 31′ to open or close.
The drain-proof ring is a triple eccentric structure. That is, referring to FIG. 9, a longitudinal radial line of the valve disk is shifted from a longitudinal radial line of the valve body, this is so-called first shift (A′); an axial center of the valve disk is shifted from the center of the valve body, this is so-called second shift (B′); the valve disk 31′ is an asymmetric taper so as to form as a third shift (C′). Since in the prior art, the valve disk 31′ is an asymmetric taper (see FIG. 8) and thus the drain-proof ring 32′ received in an annular trench of the valve disk 31′ is also an asymmetric structure for tightly contracting the annular seat 30′ received in the inner annular wall of the valve body 1. As a result, every radial part of the drain-proof ring 32′ is critically defined to match the shape of the annular seat 30′. Thus, it is very difficult to manufacture this ring. Furthermore, a slight rotation of the drain-proof ring 32′ with respect to the annular seat 30′ will induce gaps between the valve body and the valve disk and thus fluid will drain out from one side of the valve to another side.
As illustrated in FIGS. 8 and 9, it is illustrated that in the prior tripe eccentric valve, a lower side of the valve is horizontal and the upper side thereof is inclined. The slopes of sides between the upper and lower sides are between the slope of the horizontal line and the slope of the included line of the upper side. As a result, the edges of the drain-proof ring 32′ (see FIG. 8) are asymmetrical with respect to the middle axial line. This induces the difficulties in manufacturing process because it must be precise to form the desired shape. Furthermore, in installing the drain-proof ring, the positioning of the ring must be very accurately to fit the shape of the annular seat around the ring. Furthermore, the structure of the drain-proof ring 32′ will resist against the valve seat 30′. For a long time, the valve ring 30′ will distort. If dirt material is remained in the connection area between the drain-proof ting 32′ and the valve seat 30′, the drain-proof ring 32′ will push the dirt material to compress the valve seat 30′ so as to destroy the sealing effect of the valve.
Therefore, there is an eager demand for a novel design which can improve the above mentioned defects.

Triple eccentric valve with symmetric drain-proof ring applied no normal force to valve seat


Pyrimidine- and triazine-based chemical compounds that are useful, for example, as protein kinase inhibitors for treating cancer, neurological disorders, autoimmune disorders, and other diseases, and methods of using such compounds.

Homeostasis requires signaling between cells to coordinate activities such as cellular proliferation and differentiation. Inappropriate signaling can cause or exacerbate immune system pathologies, such as allergies, autoimmune diseases, and inflammation, as well as neurological and cardiovascular maladies. In particular, cancer, the uncontrolled proliferation of cells, is strongly associated with breakdown in normal cellular signaling. Signaling often involves catalyzed transfer of phosphoryl groups to and from serine, threonine, and tyrosine residues on proteins as part of signal transduction, a step catalyzed by enzymes called protein kinases. For this reason, efforts to treat cancer and other diseases have directed attention to inhibition of protein kinases.
CK2, an essential serine/threonine protein kinase, until recently has not been considered as a possible target in cancer chemotherapy, but a wide variety of cancers exhibit elevated levels of CK2 activity that correlate with the aggressiveness of tumor growth. Furthermore, decreasing CK2 activity, through use of small molecules, dominant negative overexpression of kinase inactive mutants, anti-sense methods, or small interfering RNAs, decreases cellular proliferation, increases the level of apoptosis in cancer cells, and eradicates the PC3 human prostate cancer cells from tumor-bearing mice. Existing C2 inhibitors such as emodin, coumarins, TBB (triazole), quinazolines, DRB and quercetin, however, while useful for laboratory studies, lack the qualities of a clinically useful chemotherapeutic agent.
A need remains, therefore, for compounds that inhibit CK2 activity for treating pathologies associated with phosphorylation catalyzed by this protein kinase.


According to one embodiment, a solid-state imaging device includes a pixel unit, a flicker detecting unit, a flicker-level estimating unit, and a flicker correcting unit. The flicker detecting unit detects, based on a magnitude relation of a signal amount in each of lines formed in the pixel unit, presence or absence of a flicker. The flicker-level estimating unit estimates a flicker level in each of the lines of the next frame. The flicker correcting unit corrects, for each of the lines, a flicker that occurs in a signal of an image picked up by the pixel unit.

In a solid-state imaging device of a complementary metal oxide semiconductor (CMOS) type, a flicker like a lateral strip occurs under a fluorescent lamp. As a measure against the flicker, there is a method of adjusting a gain of a signal level of each of lines through signal processing (Japanese Patent Application Laid-Open No. 2003-319204 and Japanese Patent Application Laid-Open No. 2004-222228). As another measure against the flicker, there is a method of switching accumulation time in a unit of a half of a power supply frequency of the fluorescent lamp to prevent the occurrence of the flicker and, when a light amount is in the middle of a light amount of the fluorescent lamp, adjusting a digital gain to supplement a signal amount (Japanese Patent Application Laid-Open No 2003-18458). As a method of suppressing the flicker without reducing the signal amount, there is a method of controlling accumulation time in line units (Japanese Patent Application Laid-Open No. 2007-215062).
However, in the methods disclosed in Japanese Patent Application Laid-Open No. 2003-319204 and Japanese Patent Application Laid-Open No. 2004-222228, a frequency of the flicker cannot be detected, scanning time for a plurality of fields is required for detection of the flicker, and the flicker like the lateral stripe fixed at the time of 60 hertz cannot be suppressed. In the method disclosed in Japanese Patent Application Laid-Open No. 2003-18458, the signal amount is as small as a half at the minimum and a signal to noise ratio is deteriorated by about 3 decibels by shot noise. In the method disclosed in Japanese Patent Application Laid-Open No. 2007-215062, because the flicker is detected from a change in a light amount during imaging under the fluorescent lamp illumination, if a subject has light and shade, the flicker cannot be accurately detected.


The system for determining the activity of a person lying down has at least one motion sensor (CM) having at least one measurement axis, which is provided with a fastener (MF) for firmly connecting the motion sensor (CM) to a user. The system includes a filter (FILT) for selecting, for at least one measurement axis of the motion sensor (CM), a high-frequency signal (HF) and a low-frequency signal (BF); a first calculation unit (CALC1) for calculating a first variable (x(n)) representing a temporal variation of the low-frequency signal (BF); a second calculation means (CALC2) for calculating a second variable (y(n)) comprising the Euclidean norm, along at least one measurement axis, of the high-frequency signal (HF); and an analysis unit (AN) that determines an activity of prone user as a function of time using a hidden Markov model having N states corresponding to N activities respectively. The analysis unit (AN) also combines conjoint probability density functions of the first and second variables, said probability density functions being defined for each state of the model in question; and probabilities of transitions between two successive states.

1. Field of the Invention
The present invention relates to a system and to a method for determining the activity of a person lying down.
2. Description of the Related Art
Systems and methods for motion analysis based on hidden Markov models are known, such as those described for example in the documents "Gesture recognition using the XWand" by Daniel Wilson and Andy Wilson and "Motion-based gesture recognition with an accelerometer" (bachelor's thesis) by P. V. Borza.
The document "A hidden Markov model-based stride segmentation technique applied to equine inertial sensor trunk movement data", Journal of Biomechanics 41 (2008), 216-220 by Thilo Pfau, Marta Ferrari, Kevin Parsons and Alan Wilson relates to analysis of driving by horses.
An object of the invention is to allow the activity of a person lying down to be determined.
According to one aspect of the invention, a system is proposed for determining the activity of a person lying down, comprising at least two processing pathways of signals at the output of at least one motion sensor substantially affixed to said person, wherein a first of said at least two processing pathways processes a first component comprising signals of low frequencies and a second processing pathway processes a second component of signals of high frequencies, in which the system further comprises:                first calculation means for calculating a first variable (x(n)) representing a temporal variation of said first component, for at least an axis of said motion sensor;        second calculation means for calculating a second variable (y(n)) comprising the Euclidean norm, along at least one measurement axis, of said second component; and        analysis means configured for determining an activity of said person as a function of time using a hidden Markov model having N states corresponding to N activities respectively,        said analysis means being configured for combining:        conjoint probability density functions of said first and second variables, said probability density functions being defined for each state of the model in question; and        probabilities of transitions between two successive states.
According to a preferred embodiment, the probability density functions associated with each state comprise the product of at least one first probability density function of said first variable multiplied by at least one second probability density function associated with said second variable.
It is noted that a hidden Markov model can be defined by two random processes: a first process, which in the present application is called "state" and is not observed, or in other words is hidden, and a second process which is the observation, the probability density function of which at a given instant depends on the value of the state at the same instant. According to this aspect of the invention, the state can take discrete values.
Such a system enables the activity of a person lying down to be determined accurately and at low cost.
In one embodiment, a conjoint probability density function comprises a product of at least one probability density function for obtaining the first variable and of at least one probability density function for obtaining the second variable, said probability density functions being defined by the following expressions:
         {                                                                      P                BF                                                          (                                  x                                                        (                    n                    )                                                  )                                      =                                          1                                                                                2                                                π                                                                                σ                      x                                                                                ·                              ⅇ                                  -                                                            x                      2                                                              2                                                                    σ                        x                        2                                                                                P                HF                                                          (                                  y                                                        (                    n                    )                                                  )                                      =                                          1                                                                                2                        k                                                                                σ                      y                      k                                                                                Γ                                                                    (                                                  k                          2                                                )                                                                                y                                                        (                    n                    )                                                                                k                    2                                    -                  1                                                                          ⅇ                                  -                                                            y                                                                    (                        n                        )                                                                                2                                                                    σ                        y                        2                                                                                in which:    PBF(x) is the probability density function of the first variable x corresponding to the state in question;    PHF(y) is the probability density function of the second variable y corresponding to the state in question;    k represents the degree of freedom of the high-frequency component equal to the number of measurement axes taken into account by said motion sensor;    σx represents the square root of the variance of the first variable x, in the state of the hidden Markov model in question;    σy represents the square root of the variance of the second variable y in the state of the hidden Markov model in Question; and    Γ is the gamma function satisfying
                    Γ                          (                      1            2                    )                    =              π              ,                  Γ                          (          1          )                    =      1        and            Γ                    (                  n          +          1          +                      1            2                          )              =          n                                                        Γ                                (                          n              +                              1                2                                      )                          .            Thus, for each state i, probability density functions Px,i(n) and Py,i(n), can be defined such that:
         {                                                                      P                                  x                  ,                  i                                                                          (                                  x                                                        (                    n                    )                                                  )                                      =                                          1                                                                                2                                                π                                                                                σ                      x                                                                                ·                              ⅇ                                  -                                                                                x                                                                          (                          n                          )                                                                    2                                                              2                                                                    σ                                                  x                          ,                          i                                                2                                                                                P                                  y                  ,                  i                                                                          (                                  y                                                        (                    n                    )                                                  )                                      =                                          1                                                                                2                        k                                                                                σ                                              y                        ,                        i                                            k                                                                                Γ                                                                    (                                                  k                          2                                                )                                                                                y                                                        (                    n                    )                                                                                k                    2                                    -                  1                                                                          ⅇ                                  -                                                            y                                                                    (                        n                        )                                                                                2                                                                    σ                                                  y                          ,                          i                                                2
σy,i being a quantity proportional to the time average of the variable y(n) in the state i. For example, σy,i is the time average of the variable y(n) divided by k.
Thus, the real probability density functions of the observed signals can be approximated by probability density functions generally tailored to most movements.
In one embodiment, said analysis means are suitable for determining an activity of the lying-down user as a function of time using a hidden Markov model in at most five states chosen from a rest activity, a slight agitation activity, a trembling activity, a moderate agitation activity and a strong agitation activity.
Such a system serves to analyze the activity of a mobile element with improved accuracy. This is because by taking into account the high-frequency component it is possible to use additional information that enables small movements of the sensor, or in other words oscillations or vibrations, such as trembling, to be detected.
According to one embodiment, said analysis means are suitable for determining an activity of the lying-down user from a set of predetermined pairs of values of first and second variances, defining movement classes.
Thus, the non-observed process or state of the hidden Markov model can be a discrete 1st-order Markov process taking values in the set {0, 1, 2, 3, 4}. It can be characterized by the probabilities of transitions from one state to another: P(State=j|State=i).
The observed process of the hidden Markov model is the multidimensional signal (x(n),y(n)), the conjoint probability density function of which depends on the state (the hidden process) at a given instant. Thus, for each state, the conjoint probability density function of the observed signal can be defined by the following equation:
      P              (                        x                                (            n            )                          ,                                            y                                            (                n                )                                                                                              State                =                i                            )                                =                                    P              iState                                                  (                              x                                                  (                  n                  )                                            )                                      ,                                                    y                                (            n            )                              )        =            ∑              n        =        0                    n        max                                ∑                  m          =          0                          m          max                                            α                      iState            ,                          m              +                                                (                                                            m                      max                                        +                    1                                    )                                                n                                                                                P                          x                                            (                                                      σ                    x                                                                          [                    m                    ]                                                  )                                                                    (                          x                                            (                n                )                                      )                                                        P                          y                                            (                                                      σ                    y                                                                          [                    n                    ]                                                  )                                                                    (                          y                                            (                n                )                                      )                              in which αiState,j is a weighting coefficient enabling a state to be modeled by a plurality of elementary movements. This determination coefficient can be determined experimentally.PiState(x,y), also denoted by Pi(x(n),y(n)) represents the probability density function associated with the state i at the instant n, of x(n) and y(n). It comprises the product of the probability density functions Px,i(x(n)) and Py,i(y(n)) defined above.If a set of observed data θ(n) is considered, combining the observed data x(n) and y(n), the following expression may be written:Pi(x(n),y(n))=Pi(θ(n)=p(θ(n)/E(n)=i),with E(n) representing the state at the instant n.Since P(x,y|State=i) is a probability density function, the following condition is preferably met by the weighting coefficients:
            ∑              n        =        0                    n        max                                ∑                  m          =          0                          m          max                                  α                  iState          ,                      m            +                                          (                                                      m                    max                                    +                  1                                )                                          n                                            =  1.
Using such classes it is possible to define, for each pair of movement classes, an elementary movement. One state of the model can therefore be described by a number of elementary movements.
In one embodiment, said pairs of values of first and second variances are suitable for satisfying the following conditions:
         {                                        n            ∈                          [                              0                ;                                  n                  max                                            ]                                                                        m            ∈                          [                                                (                                      0                    ;                    m                                    )                                max                            ]                                                                                n              max                        ≤            10                                                                          m              max                        ≤            10                                                                                n                max                            ×                              m                max                                      ≥            6.
Thus, the number of defined elementary movements makes it possible to describe most movements of a person lying down and remains small enough to allow processing in real time.
In one embodiment, said movement classes are eighteen in number and are defined by:
σx[0]=5×10−3, σx[1]=1.8×10−2, σx[2]=3.5×10−2, σx[3]=5.5×10−2, σx[4]=8×10−2, σx[5]=1×10−1, σy[0]=1×10−2, σy[1]=3×10−2 and σy[2]=8×10−2.
These values are particularly well suited for determining the activity of a person lying down.
According to one embodiment, said real coefficients are defined by the following table:
iState2State4State5State1State(slight3State(moderate(strongClass(rest)agitation)(trembling)agitation)agitation)00.2564000010.05130.052600020.0256400.040030.25640.15790.040040.05130.26320.1600500.05260.200060.25640.15790.040070.05130.26320.160.09260800.05260.200.0926090.0256000.03700100000.1852011000.160.18520120.0256000.0370.0556130000.18520.0556140000.18520.05561500000.27781600000.27781700000.2778
These values are particularly well suited for determining the activity of a person lying down.
At each instant n, it is then possible to determine a state of the person, knowing Pi(x(n),y(n)) by the expression:E(n)=argimax(Px,i(x(n))Py,i(y(n))=argimax(Pi(x(n),y(n)),in which the function arg max represents the maximum argument.If the person at the instant n is at the state i, then E(n)=i.
However, it is generally not satisfactory to determine the state E(n) at the instant n solely from the observed data, x(n) and y(n), and from the associated probability density functions Px,i(x(n)) and Py,i(y(n)) associated with these data respectively.
Experience has shown that it is desirable to take into account a priori, a state, for example the state E(n−1) determined during the instant n−1.
Let us consider the quantity θ(n), collecting the observed data x(n) and y(n), then it is possible to write the following:Pi(x(n),y(n))=Pi(θ(n)=p(θ(n)/E(n)=i),E(n) representing the state at the instant n.If E(0:N) denotes the series of states between the instant n=0 and the instant n=N, and if θ(0:N) denotes the observed data between the instant n=0 and the instant n=N, the probabilities of the sequence of states E(0:N) corresponding to the sequence of states E(0), E(1) . . . E(N) can be expressed as:
      p              (                        E                                (                          0                                            :                                                                                N                        )                          ❘                  θ                                (                                          0                                                  :                                                                                N                            -              1                        )                              )          α                  p              (              E                          (          0          )                    )              p              (                        θ                                (            0            )                          /                  E                                (            0            )                              )                    ∏              n        =        1            N                          p                          (                                    E                                            (                n                )                                      /                          E                                            (                                  n                  -                  1                                )                                              )                                  p                          (                                    θ                                            (                n                )                                      /                          E                                            (                n                )                                              )                    For example, for the sequence E(0:N)={i, i, i, . . . , i}, this probability can be expressed as:
                                                                        p                                                  (                                                            E                                                                    (                        0                        )                                                              =                    i                                    )                                                                          p                                                  (                                                                                θ                                                                          (                          0                          )                                                                    ❘                                              E                                                                          (                          0                          )                                                                                =                    i                                    )                                                                                ∏                                      n                    =                    1                                    N                                                                  p                                                        (                                                                  E                                                                          (                          n                          )                                                                    =                                                                        i                          ❘                                                      E                                                                                (                                                              n                                -                                1                                                            )                                                                                =                        i                                                              )                                                                        )                                          p                                      (                                                                    θ                                                              (                      n                      )                                                        ❘                                      E                                                              (                      n                      )                                                                      =                i                            )                                      )                            (        1        )
The estimated sequence of states E(0:N) can be that in which the probability is the highest. In practice, rather than considering all the possible sequences and for each one calculating its probability, it may be advantageous to use a Viterbi algorithm for estimating this sequence.
P(E(0)) denotes the probability associated with the initial state E(0). It is possible for example to choose an equiprobable distribution of each of the possible states when n=0.
p(θ(0)/E(0)) represents the probability of observing the data θ(0) at the instant E(0). This corresponds to the probability Pi(x(n=0),y(n=0)) with E(n)=i.
p(E(n)/E(n−1)) represents the probability of being in a state E(n) at the instant n, whereas the person was in a state E(n−1) at the instant n−1.
p(θ(n)/E(n)) represents the probability of observing the quantities θ(n) when the person is in the state E(n). This corresponds to the probability Pi(x(n),y(n)) with E(n)=i.
The probabilities p(E(n)/E(n−1)) correspond to probabilities of a transition from a state E(n−1) to a state E(n). These probabilities are indicated in the following embodiment table, adopting the notations E(n−1)=j and E(n)=i.
The series of states E(0) . . . E(N) maximizing the expression (1) may be obtained using for example the Viterbi algorithm well known to those skilled in the art.
Thus:    1) by establishing, for each state E(n):            the probability of observing the quantities θ(n) when the person is in the state E(n), denoted by p(θ(n)/E(n));        the probability of a transition from a state E(n−1) to a state E(n), denoted by p(E(n)/E(n−1));            2) by establishing the probability associated with each state E(0); and    3) by obtaining observed quantities θ(n) at each instant n between n=0 and n=N,it is possible to obtain the most probable series of states E(0) . . . . E(N).
It is noted that, in the expression θ(n)={x(n), y(n)}, x(n) and y(n) are the so-called low-frequency and high-frequency components respectively of the signal S(n) measured by the motion sensor at the instant n.
In one embodiment, the probabilities P, of said hidden Markov model, for transitions between two successive states representing respectively one type of posture, are such that:
2State4State5StateP(jState/1State(slight3State(moderate(strongiState)(rest)agitation)(trembling)agitation)agitation)1State0.99000.00250.00250.00250.0025(rest)2State0.0070.990.00100.00100.0010(slightagitation)3State0.0070.00100.990.00100.0010(trembling)4State0.0070.00100.00100.990.0010(moderateagitation)5State0.0070.00100.00100.00100.99(strongagitation)
These values are particularly well suited for determining the activity of a person lying down.
According to one embodiment, the system includes display means.
Thus, the results may be displayed in real time or subsequently.
In one embodiment, said motion sensor comprises an accelerometer and/or a magnetometer and/or a gyroscope.
According to one embodiment, the system comprises fastening means suitable for being fastened to the wrist, to the torso or to the head of the person.
According to another aspect of the invention, a method is provided for determining the activity of a person lying down, comprising at least a step of configuring two processing pathways of signals at the output of at least one motion sensor substantially affixed to said person, wherein a first of said at least two processing pathways processes a first component comprising signals of low frequencies and a second processing pathway processes a second component of signals of high frequencies, said method further comprising:                a first calculation step for calculating a first variable (x(n)) representing a temporal variation of said first component, for at least an axis of said motion sensor;        a second calculation step for calculating a second variable (y(n)) comprising the Euclidean norm, along at least one measurement axis, of said second component; and        an analysis step for determining an activity of said person as a function of time using a hidden Markov model having N states corresponding to N activities respectively,        said analysis step combining sub-steps of calculating:        conjoint probability density functions of said first and second variables, said probability density functions being defined for each state of the model in question; and        probabilities of transitions between two successive states.

System and method for determining the activity of a person lying down

Commissariat a l'Energie Atomique et aux Energies Alternatives


A microwave carrier signal emitted from a tracker unit is amplitude moduld periodically at different preset modulation frequencies during spaced intervals between established time slots. The carrier signal is detected by differently coded credential units within a reception zone whereby such signal is demodulated at the different modulating frequencies to produce reply signals at one of several different code frequencies during one of the time slots dependent on the credential unit coding. The reply signals are detected by the tracker unit during narrowed reception windows within the time slots. Such reply signals are decoded within separate frequency channels corresponding to the code frequencies thereof to extract signal data processed to indicate entry, departure and status of the credential units relative to the reception zone.

This invention relates in general to a credential identification system.
Heretofore, systems involving the use of cards having magnetic and/or optical reading properties were inserted into or placed in operative relation to a receiver. Card reading operations were rather slow in such systems and other procedural limitations of a physical nature were often associated therewith. Also, the number of available identification codes associated with credential identification cards in prior systems was rather limited.
Use of such identification systems for certain installations imposes especially burdensome demands, including tracking movement of personnel and equipment as well as operational reliability.
It is therefore an important object of the present invention to provide a credential card type of security system having a relatively large number of available identification codes and the capability of tracking personnel without physical limitations on movement or excessive procedural demands on personnel.
A further object is to provide a security identification system providing the foregoing attritubes in such a manner as to be compatible with computer intelligence and inventory management.

The United States of America as represented by the Secretary of the Navy


A vulcanizable ethylene-propylene rubber composition with improved thermal aging resistance is made from ethylene-propylene rubber, an alkoxysilane such as N-(N-vinylbenzylaminoethyl)-gamma-aminopropyltrimethoxysilane or its hydrochloride, a reinforcing filler, and a vulcanizing agent. These vulcanizable ethylene-propylene rubber compositions can also contain vinyl group-containing organopolysiloxane gum. These compositions cure to rubber with excellent mechanical properties, excellent electrical insulation properties, and thermal aging resistance which makes them suitable for electrical wire insulation.

1. Technical Field
The present invention relates to a vulcanizable ethylene-propylene rubber composition.
2. Background Information
Ethylene-propylene rubbers have excellent mechanical properties and electrical insulating properties, and as a consequence are well-suited for use in automobile parts, components for electrical instruments and devices, etc. However, this type of rubber also has a low resistance to thermal aging, which places limitations on its use. Recent attempts at improving the thermal aging resistance have involved the addition of aging inhibitors to this type of rubber, but the results in this regard have not been entirely satisfactory.


A remote battery access device for remotely and conveniently positioning the battery of a smoke detector from the smoke detector. The remote battery access device includes a battery module having a battery holder shaped to retain the battery. The remote battery access device may also include an electrical connector for electrically connecting the battery module to the smoke detector and a plurality of wires connecting the electrical connector with the battery module, which permit the smoke detector to be disposed remotely from the battery module.

This invention relates generally to battery powered smoke detectors and smoke detectors having back-up batteries that are used in residential and commercial buildings. More specifically, the invention is directed to a battery access device that is located remotely from a smoke detector to permit convenient changing and monitoring of the battery.
A common problem and frustration with current smoke detectors is the difficulty and inconvenience in changing the battery that is held within its housing. First, smoke detectors are typically attached to the ceiling of a room. Where the ceiling of a room is vaulted, the smoke detector is often located near the top of a vaulted ceiling. Consequently, a ladder or chair must often be used to boost a person into position to access the smoke detector to change the battery. Additionally, some disabled people, including persons confined to a wheel chair, are physically incapable of accessing the smoke detector and thus, must rely on another person to change the battery in a smoke detector. Moreover, some elderly people and others with impaired balance should not climb on chairs and ladders such that it would be unsafe for them to change the battery in a smoke detector.
Second, some smoke detectors have a housing whose faceplate must be removed in order to change the battery. Often, the faceplate is difficult to properly replace, so that the smoke detector may be inadvertently damaged during replacement or the faceplate may fall off after the battery has been replaced providing an unsightly view to occupants of the room until someone is willing access the smoke detector and replace its faceplate.
Third, because smoke detectors are typically located above the person seeking to change its battery, the battery may be improperly oriented when installed in the smoke detector. In some cases, improperly installing a battery may damage the smoke detector. Additionally, the battery may not properly contact the electrical contacts of the smoke detector, which may prevent the battery from powering the smoke detector.
As a result of these difficulties, spent batteries are often not replaced or even initially installed in smoke detectors. As a result, the smoke detectors do not function properly to warn the occupants of the building of a growing fire which can cause the unnecessary loss of life and property.
Accordingly, a need exists for a means for providing the convenient installation or replacement of the battery of a smoke detector. Furthermore, a need exists for a means to easily discern whether a battery is currently connected to a smoke detector. A need also exists for a convenient way to discern the status of the battery within the smoke detector.

Remotely located battery for a smoke detector


A data compression/decompression processor implements a modified Ziv-Lempel ("LZ") coding technique. The processor includes three modules, an interface, a coder-decoder ("CODEC"), and a MODEL. The CODEC and the MODEL modules together form compression engine, in which the CODEC provides variable length coding and data packing, and the MODEL implements the LZ processing. The MODEL uses content addressable memory ("CAM") in encoding mode for text storage and character matching, and uses CAM in decoding mode as an on-chip RAM to obtain high speed access.

1. Field of the Invention
The invention pertains to data compression, and more particularly to apparatus and methods for lossless data compression.
2. Background of the Invention
Dictionary coding is a class of compression techniques characterized by the replacement of groups of consecutive characters, or "phrases," occurring in the data, or "text," with indexes into some dictionary. The selection of entries for the coding dictionary is an important consideration in the design of a dictionary scheme, and the choice of phrases may be made staticly, semiadaptively, or adaptively. A particularly useful class of compression methods based on an adaptive scheme is known as Ziv-Lempel ("LZ") coding, which essentially involves replacing phrases with a pointer to where they have occurred earlier in the text. Dictionary techniques, including LZ coding, are described in detail in T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression, Prentice Hall, Englewood Cliffs, N.J., USA, 1990, pp. 206-243, and are incorporated herein by reference.
Dictionary techniques are useful for their speed and economy of memory. Typically, a serial, hashing search method is employed. Unfortunately, in some applications even dictionary techniques implemented with a serial hashing search method are not as fast as desired.

Data compression using content addressable memory


A system and method for configuration of a programmable logic device using routing cores. A program executing on a processor includes instructions that select functions to be provided by the programmable logic device. The instructions invoke functions from a library of logic and router core generators to define logic cores and router cores to intercouple the logic cores. From the logic and router core definitions, the program utilizes a bit-stream library to generate programming bits. The programmable logic device is then loaded with the programming bits by the program.

Field programmable gate arrays (FPGAs), first introduced by XILINX in 1985, are becoming increasingly popular devices for use in electronics systems. In general, the use of FPGAs continues to grow at a rapid rate because FPGAs permit relatively short design cycles, reduce costs through logic consolidation, and offer flexibility in their reprogrammability. The capabilities of and specifications for XILINX FPGAs are set forth in "The Programmable Logic Data Book," published in 1998 by XILINX, Inc., the contents of which are incorporated herein by reference.
The field of reconfigurable computing has advanced steadily for the past decade, using FPGAs as the basis for high-performance reconfigurable systems. Run-Time Reconfigurable (RTR) systems distinguish themselves by performing circuit logic and routing customization at run-time. RTR systems using FPGAs are expected to result in systems that require less hardware, less software, and fewer input/output resources than traditional FPGA-based systems. However, scarcity of software that supports RTR is believed to be one reason that RTR has been outpaced by research in other areas of reconfigurable computing.
Whereas with traditional configuration of FPGAs the time taken to generate a programming bitstream is generally not real-time critical, with RTR systems, the time required to generate the programming bitstream may be critical from the viewpoint of a user who is waiting for the FPGA to be reconfigured. Thus, it may be acceptable to take hours to generate a programming bitstream using traditional configuration methods. In a run-time environment, however, it is expected that the reconfiguration process require no more than a few seconds or even a fraction of a second.
Reconfiguration of an FPGA may include reparameterizing various logic cores and rerouting connections between the logic cores. Parameterizable cores permit the user to enter information about the desired core, from which a customized circuit conforming to this information is constructed. An example of a parameterizable core is an adder core to produce an adder circuit. Example parameters include the size, for example, 4 bit, 8 bit, or 16 bit, and serial versus parallel.
Once reparameterized, the connections between cores and placement on the FPGA must be established. Routers in a traditional configuration process generally route connections for all the circuit elements. That is, these routers define connections for all the circuit elements in a design. Therefore, in an RTR environment, traditional reparameterization and routing methods are inappropriate given the real-time operating constraints.
A system and method that address the aforementioned problems, as well as other related problems, are therefore desirable.

Configuration of programmable logic devices with routing core generators


A water softening module has a case body which includes cover members secured to their respective ends of a cylindrical case. A pair of electrodes are provided in the case body. A fibrous medium is located in contact with a water-outlet-side face of the electrodes. The fibrous medium has a stacked structure constituted of a first fiber layer and a second fiber layer, which are electrically conductive. The first fiber layer is positioned in contact with the upstream side of the second fiber layer, and the first fiber layer is positioned in contact with the downstream-side face of the electrodes. The specific surface area of the first layer is smaller than that of the second fiber layer.

1. Field of the Invention
The present invention relates to a water treatment apparatus that removes hardness components from water electrically.
2. Description of the Related Art
There are air sterilizing apparatuses known in the art which are designed to counteract viruses and the like suspended in the air, using an electrolyzed water, containing hypochlorous acid, generated by an electrolysis of tap water or the like. In this type of air sterilizing apparatus, the air is sterilized as viruses and the like in the air passing through a gas-liquid contact member are inactivated through contact with the electrolyzed water supplied to the gas-liquid contact member.
However, there are instances where the electrolyzed water used in inactivating viruses and the like contains hardness components (calcium ions, magnesium ions, etc.). And once these hardness components turn into solid matter (scale) inside the gas-liquid contact member, the air passages in the gas-liquid contact member can develop clogging, which may cause a drop in the equipment's capacity for sterilizing. To resolve this problem, a water treatment apparatus called a water softening module is used in softening water by reducing the hardness of electrolyzed water in advance. Also in use is a type of water treatment apparatus called a water softening module, in which the water to be treated is softened by having the hardness components precipitate as scale on electrode portion.
A problem with such conventional water treatment apparatuses has been the precipitation of hardness components as scale on the electrode portion, which results in a pressure loss in the flow path and thus a drop in the amount of passing water. This has been a main cause of the reduced capacity of the equipment in removing the hardness components from water.


The invention relates to an axle body, particularly for a commercial vehicle, wherein the body is configured substantially as an axle pipe, which comprises a center section and at least one receiving section connected thereto for receiving an axle guide, wherein the axle body in the center section has a substantially constant wall thickness, and wherein the axle body in the receiving section, at least in some regions, has a wall thickness that is greater than the wall thickness of the center section.

The present invention pertains to an axle body, a running gear design, a method for making an axle body, as well as a method for making a running gear design, intended especially for a commercial vehicle.
Axle bodies of this kind are known in the prior art. Thus, axle bodies consisting of an axle pipe, a left and a right stub axle, as well as two shells or wraps are used. The axle pipe and the stub axles are joined together essentially concentrically or coaxially by a friction welding method. To provide a connection between the axle pipe and an axle guide, the shells are fastened to the axle pipe by a shielded arc welding method. In this way, the axle guide can be welded all around to the shell, which in turn is joined to the axle pipe by two spot welds arranged at the side. Thus, the encircling weld seam by which the axle guide is fastened need not be made directly on the axle pipe, for such an encircling weld by virtue of the notch effect and the heat influence would lead to a weakening of the axle pipe, so that there would be a danger of the axle pipe breaking.
Therefore, the problem of the present invention is to provide an axle body, a running gear design, a method for making an axle body, as well as a method for making a running gear design, especially for a commercial vehicle, guaranteeing that the axle body is easy and economical to fabricate and at the same time has a high axial and polar section modulus and thus can withstand high loads.


A image processing device includes an image selection means and an image gathering means. The image selection means receives a plurality of rectangular selected images selected by user's operation. The image gathering means overlays specific sides of two selected images on each other among the plurality of selected images to gather the plurality of selected images within an output image corresponding to predetermined paper.

The present disclosure relates to image processing devices and image processing methods and specifically relates to an image processing device and an image processing method which can automatically gather a plurality of images with a blank reduced.
Various types of image processing devices have been proposed which have a synthesizing function of synthesizing desired parts of plural pieces of image information for recording to a recording medium.
For example, a scanner reads image information on an original document. A memory stores the read image information. A display device displays it on its display screen. Thereafter, the image information in the memory is processed by operating a stylus or the like on the image information displayed on the display screen to store desired part of the image information into an additional memory. This series of processes is performed on a plurality of original documents. After the additional memory stores image information in which each desired part of the image information of the original documents are synthesized, a printer records the stored image information onto a recording medium.
However, the image processing devices of the above type can detect neither the input size of image information read by the scanner nor the output size of image information that the printer should output. For this reason, respective image information cannot be displayed maximally on the screen of the display device, thereby lowering the operability in processing the image information. Further, desired parts cannot be extracted from plural pieces of image information different in size for synthesis in desired size.
In order to solve the above problems, some image processing device reads plural pieces of image information, extracts and aggregates their respective desired parts into a single image, and then records the aggregated one onto a recording medium. In the image processing device, when the input size of image information is set at reading the image information by an image reading means, a first storage means stores the image information read by the image reading means according to the set input size. Then, the image processing device displays the stored image information on the display device through a first image displaying means. When the output size of the image information is set at processing of the image information stored in the first storage means by an image processing means, a second storage means stores the image information processed by the image processing means according to the set output size. Further, the image processing device displays the stored image information on the display device through a second image displaying means and records it on a recording medium by a record output means. Accordingly, a variety of image information can be always displayed maximally on the screen of the display device. Further, desired parts can be extracted from respective plural pieces of image information different in size and be synthesized into one in desired size.

Image processing device and image processing method which gather a plurality of images within an output image


Disclosed is a system configured to determine filter parameters of an audio precompensation filter for the compensation of an associated sound generating system having at least two loudspeakers. The system is configured to obtain sound field models describing the sound field in at least one region of space designated the bright zone and the sound field in at least one region of space designated the dark zone. The system is also configured to obtain a target sound field in the bright zone. Further, the system is configured to determine filter parameters of the audio precompensation filter so that a criterion function is optimized under the constraint of causality and stability of the dynamics of the audio precompensation filter to enable reproduction of a desired target sound field in the bright zone, while reproducing as little sound as possible in the dark zone.

Audio reproduction systems are often located in shared spaces, where several potential listeners may be present simultaneously. In many situations, this is not a problem, as the system can be dimensioned and designed in such a way that the acoustical properties of the system are good in all listener locations. There are however situations where not all potential listeners want to listen to the same material at the same sound volume. In an automobile, for instance, perhaps the driver needs to focus on navigating without being disturbed by the music to which the passengers may want to listen. Another example may be watching two different films simultaneously in the same room. A region of space in which no sound from a certain source is desired is often referred to as a 'dark zone', while a region of space in which sound, ideally emulating a desired sound field, from the source is desired is called a 'bright zone'.
The potential of such a system has sparked interest in the research community and a lot of scientific papers have been published on the topic. The most commonly utilized method is called Acoustic Contrast Control (ACC) and is based on maximizing the quotient of bright zone energy over dark zone energy. This approach sometimes encounters problems related to the mathematical tractability of the inversion in the criterion to be maximized. A reformulation, called Energy Difference Maximization (EDM), reposes the problem and maximizes the difference between bright zone energy and dark zone energy, which is mathematically more tractable but does not achieve quite the same level of acoustic separation in the extreme, as ACC does.
Both the ACC method and the EDM method have the sole focus of maximizing acoustical contrast and do not consider the acoustical properties within the bright zone at all. A variety of methods seeking to find a compromise between achieved contrast and good bright zone properties have therefore been developed during the recent years. However, these methods are all prone to pre-ringing or other acoustical artefacts relating to excessively long signal build-up times.
Significant effort has also gone into research on how to produce audio filters that compensates for the sound generation system itself. A solution that generates a causal and stable filter is presented in the European patent EP 2 257 083. This solution will not be limited by invalid assumptions and post-optimization filter fixes but does not explicitly take into consideration the possibility that different source materials or different sound intensities are desired in different spatial locations.
There is thus a general need for improvements in the field of designing audio precompensation filters.

Audio precompensation filter optimized with respect to bright and dark zones


The invention provides novel methods and materials for genetic and genomic analysis using single or multiplex isolation of protein-associated nucleic acids, including transposase-assisted chromatin immunoprecipitation (TAM-ChIP) and antibody-oligonucleotide proximity ligation. These methods comprise tagging and isolating chromatin or other protein-associated nucleic acids and using antibody-oligonucleotide complexes that recognize the proteins associated with such nucleic acids.

Overview of Epigenetic Mechanisms
Epigenetics is broadly defined as changes in phenotype that are heritable but do not involve changes in the DNA sequence, and, from a historical perspective, stems from long-standing studies of seemingly anomalous (i.e., non-Mendelian) and disparate patterns of inheritance in many organisms [1]. Examples include variation of embryonic growth, mosaic skin coloring, random X inactivation, and plant paramutation. Discoveries in a large number of different model systems have been pivotal in identifying the three principle epigenetic mechanisms of (i) histone modifications, (ii) DNA methylation, and (iii) non-coding RNAs, which function in concert to influence cellular processes such as gene transcription, DNA repair, imprinting, aging, and chromatin structure, as depicted in FIG. 2.
Gene transcription occurs in the context of the nucleosomal structure of chromatin. A nucleosome consists of an octamer of histone proteins (two molecules of each core histone H2A, H2B, H3, and H4) around which is wrapped 147 base pairs (bp) of DNA. Histones are small basic proteins with an unstructured amino-terminal "tail" that are the target of numerous post-translational modifications [2, 3]. Specific histone marks in the fission yeast Saccheromyces pombe were demonstrated to be directly operating as activating and repressing signals for gene transcription[4]. Methylation of lysine 4 and acetylation of lysine 9 of histone H3 are associated with transcriptionally active chromatin, while methylation of lysine 20 of histone H4 and methylation of lysine 9 and 27 of histone H3 are repressive marks, found in transcriptionally silent heterochromatin regions [5, 6]. The repressive histone H3 lysine 9 trimethyl-mark is bound by HP1 proteins, which in turn recruit non-coding RNAs involved in regulating heterochromatin formation[7].
Similar mechanistic links have also been identified between histone marks and DNA methylation. Highly repetitive DNA tandem repeat sequences such as those found in pericentric heterochromatin rely on the repressive H3K9 methylation mark to direct de novo DNA methylation while at promoters, EZH2, a histone lysine methyltransferase containing complex is involved [8]. Members of the methyl-CpG binding domain (MBD) family of proteins which are readers of DNA methylation are found in complexes with histone modifying enzymes (MeCP2 recruits histone deacetylases to mediate histone repressive marks [9]). Studies in multicellular organisms such as the invertebrates Caenorhabditis elegans and Drosophila melanogaster and plants such as Arabidopsis thaliana have generated crucial links between these epigenetic mechanisms [10].
In spite of all the advances to date, however, the epigenetics research field is still in the discovery phase, with many mechanistic questions remaining unanswered and many key players yet to be identified. Just as in the past, the continued study of epigenetic mechanisms in a variety of model organisms will be required to answer these questions. Development of enabling technologies suitable for a broad spectrum of model systems are also critical for accelerating the rate of discovery, especially since the various epigenetic mechanisms are functionally interconnected.
Chromatin Immunoprecipitation (ChIP)
ChIP was first described in 1993 following studies of the association of histone acetylation state with transcriptional gene silencing in yeast [11]. Its adaptation to mammalian cells was reported five years later, in 1998 [12]. Since its initial description, the technique has remained essentially unchanged. As described below and depicted in FIG. 1, Panel A, DNA sequence analysis is performed on the fraction of DNA isolated by immunoprecipitation with antibodies specific to the protein of interest. This technique is used in a wide variety of applications. These include profiling histone modification patterns, from their intragenic distribution through to genome-wide analysis, determining the composition of protein complexes recruited by specific histone marks, identifying regions of de novo DNA methylation, or, with some modifications to the procedure, detecting nascent non-coding RNAs.
Advances in PCR and DNA sequencing technologies have positively impacted the DNA analysis portion of the ChIP technique, which has expanded from semi-quantitative analysis of single genes using end-point PCR, to quantitative analysis with real-time PCR, through to genome-wide analysis afforded by ChIP-chip, wherein the captured DNA is used to probe a high-density microarray, or ChIP-Seq, wherein the captured DNA is subjected to NGS ("next generation sequencing") [6, 13]. While these improvements have increased the magnitude of sequence information available for analysis from a single reaction, the limitations associated with efficient immunocapture of protein-associated DNA have not been addressed.
Only incremental improvements, such as the introduction of magnetic beads for immunocapture in place of agarose or sepharose beads, as in Active Motif's ChIP-IT Express™ kit, have been made [14]. The improved recovery (fewer beads are lost during wash steps), reduced background (wash steps are more thorough) afforded through the use of magnetic beads has allowed for a ten-fold reduction in the sample size requirements, from 2-10 million cells to 0.1-1 million cells. In general, these lower sample requirements apply only to high affinity antibodies targeting abundant proteins, such as RNA polymerase II or histone modifications. In addition, the sample size requirement remains a considerable barrier in some research areas, such as embryology and stem cells where cell numbers are very limiting, and is further compounded by the limitation that the only a single protein can be analyzed in each ChIP experiment. The number of cells required is thus directly proportional to the number of proteins to be analyzed, impacting cost and time considerations. An additional challenge stems from the need of ultra-high affinity antibodies for use in this technique. Many antibodies qualified for use in immunofluorescence and/or immunohistochemistry, which can be used to demonstrate in situ association of the protein of interest with DNA or chromatin, or antibodies which have been shown to effectively function in immunoprecipitation, fail in ChIP applications where the target protein is present in high molecular weight multi-protein-chromatin complexes containing DNA fragments up to 1 kb (kilobase) in length. The binding affinity of the antibody for its cognate target must be strong enough to withstand the physical forces associated with constant agitation of the suspension and immobilization by the beads used to isolate the complexes.
Need for and Benefits of the Invention
The instant invention has broad and significant practical applications. These applications span all life sciences research with eukaryotic organisms, because epigenetic mechanisms are highly conserved throughout eukaryotes. The methods of this invention are more efficient than existing methods such as ChIP. These new, patentable methods enable concurrent analysis of multiple chromatin-associated proteins, eliminate the labor intensive NGS library preparation procedures, and have the potential to significantly reduce the amount of samples needed compared to traditional ChIP methods. This is relevant to not only to the stem cell and embryology research fields where samples are limiting, but also fields such as high throughput screening of large numbers of samples in clinical and pharmaceutical applications, where miniaturization is a major cost driver. In addition, ChIP analysis is limited by the small percentage of antibodies that work effectively in the method. Since the methods of the invention do not require immunoprecipitation, antibodies that do not work in ChIP can be adapted to work with the instant invention, thereby expanding the number of cellular proteins whose genomic distribution can now be determined.

Multiplex isolation of protein-associated nucleic acids


A control apparatus includes a driving device that is capable of operating regardless whether the engine is running or not. A variable valve actuation mechanism is driven by the driving device. During an idling operation of the engine, a control section controls the driving device such that the variable valve actuation mechanism maintains the valve timing at a valve timing advanced relative to a most retarded valve timing. The control section controls the driving device such that the variable valve actuation mechanism changes the valve timing to the most retarded valve timing after a stopping operation of an autonomous operation of the engine is initiated. Therefore, shock due to the initiation of the engine starting operation is reduced without decreasing fuel economy.

The present invention relates to a valve timing control apparatus and method for internal combustion engines.
To optimize the power and fuel economy throughout the entire engine operating range, internal combustion engines, such as automobile engines, that are equipped with a variable valve actuation mechanism for changing the valve timing of intake valves according to the engine operating state have been made practical. For example, variable valve actuation mechanisms are known that are provided with oil from a mechanical oil pump and operate based on the pressure of the oil.
To perform stable combustion while guaranteeing necessary compression ratio during an idling operation of such an internal combustion engine, the valve timing of intake valves is set to timing that guarantees the necessary compression ratio (hereinafter, referred to as idling valve timing).
Also, when an engine starting operation is initiated (when cranking of the engine is started), the compression ratio is preferably lowered to reduce shock. Specifically, it is preferable that the valve timing of the intake valves be further retarded compared to the idling valve timing to the most retarded timing so that the valves are closed at the most retarded timing.
Therefore, after an engine stopping operation is initiated during idling, the valve timing of the intake valves is changed from the idling valve timing to the most retarded timing in preparation for the next initiation of the engine starting operation (refer to Japanese Laid-Open Patent Publication No. 2000-204987).
When the stopping operation of an internal combustion engine is initiated, the pressure of oil discharged by a mechanical oil pump substantially drops to zero in accordance with a reduction in the engine speed, and the power for operating the variable valve actuation mechanism is also reduced. Therefore, in the period from when the stopping operation is initiated during idling to when the engine rotation is actually stopped, the valve timing of the intake valves cannot necessarily retarded to the most retarded timing. If the valve timing of the intake valves are not retarded to the most retarded timing until the engine rotation is stopped, the initiation of the next engine starting operation will be executed with a high compression ratio. Occupants of the vehicle therefore are likely to feel shock when cranking is started.
To deal with such problems, it may be configured that, when stopping an internal combustion engine, the valve timing of the intake valves are changed to the most retarded timing before initiating an operation for stopping autonomous operation of the engine. In this case, however, idling must be continued until the valve timing of the intake valves are changed to the most retarded timing. During idling in this state, the valve timing is more retarded compared to that during normal idling, i.e., idling valve timing. Thus, combustion cannot be performed while guaranteeing necessary compression ratio. This inevitably destabilizes the combustion and decreases the fuel economy.

Valve timing control apparatus and method for internal combustion engine