A spike removal tool (30, 50, 60, 70, 90, 110) for removing spike elements (14, 125) from sporting shoes (10), the spike elements (14, 125) rotatable in a first direction relative to the shoe (10) for installation and rotatable in a second direction relative to the shoe (10) for removal, the tool (30, 50, 60, 70, 90, 110) including a tool head (35, 52, 62, 72, 92, 112) having an axis of rotation, rotatable in the second direction to engage the spike element (14, 125) and including a first surface (38, 53, 73, 93, 113), a second surface (39, 52A, 62A, 72A, 93A, 113A) opposing the first surface, an engagement means carried by the first surface (38, 53, 73, 93, 113), for engaging the spike element (14, 125) and a bore (42, 55, 65, 75, 95, 117) extending centrally through the first surface into the tool head (35, 52, 62, 72, 92, 112) toward the second surface (39, 52A, 62A, 72A, 93A, 113A) along the axis of rotation, a shank (32, 51, 61, 71, 91, 111) extending from the second surface of the tool head (35, 52, 62, 72, 92, 112) and having an axis of rotation generally perpendicular to the first surface of the tool head and co-axial with the bore (42, 55, 65, 75, 95, 117).

In many sporting events, traction is an important element. In a sport requiring a great deal of running, traction is an obvious requirement. In other sporting events such as golf, running is not a requirement, but traction is still a very important element for success. Over the years shoes have been developed to provide the necessary traction. These shoes employ spikes projecting from the sole, and often from the heel. In shoes specialized for a particular sport, the spikes are often fixed in position. The drawback to this type of shoe is that only one type of spike may be employed, and over time the spikes will become worn. The worn spikes cannot be replaced, so the shoe must be discarded even if otherwise in good shape.
To overcome the problem of worn spikes on usable shoes and to provide a shoe potentially capable of being fitted with different types of spikes, a shoe having removable spikes was developed. This shoe has threaded apertures into which threaded spike elements can be fitted. When the spikes become too worn, they are simply replaced with new spikes.
While this sounds like a very simple and effective solution to the problem, and in theory works very well, in practical application, problems arise. When spikes are used over a period of time, they become dirty, worn and deformed. This standard wear and tear often makes the spikes difficult to remove. As an example, golf shoes typically employ metal spike elements consisting of a disk shaped base from which a threaded post extends in one direction and a spike extends in an opposing direction. To facilitate insertion and removal of a spike element, a pair of apertures is formed in the disk shaped base. The apertures are configured to receive the pins of a spanner type tool, which is then used to unthread and remove the spike or thread the spike into a shoe. The problem occurs when the spike element is worn for a period of time. Dirt, pebbles and other extraneous matter is often jammed into the apertures preventing the insertion of the pins of the spanner. When this occurs, the apertures must be cleaned out, which is often difficult if not impossible. Also, after much use, the disk shaped base becomes worn, and battered. This is precisely when a spike becomes worn down and should be replaced. Much of the time the apertures become deformed and will not receive the pins of the spanner, or they become so worn down that the apertures have very little depth and thus will not retain the pins. Therefore it is when the spike elements should be removed and replaced that removal becomes a problem.


The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element.

Currently, there is a continuing desire for improved handwriting recognition (HWR) systems, in particular for handheld devices such as PDAs and smart phones. Embedded HWR systems that are used in such devices should provide high accuracy and real-time speed with a small memory footprint.
Scanning n-tuple (SNT) classifiers provide accurate, high-speed recognition for offline or online character data. SNTs are maximum-likelihood classifiers that are applied to chain code feature sequences, where the probability of observing the complete code is given by the ensemble probability for observing all of the SNTs derived from the chain code.
SNT recognizers have demonstrated the potential for excellent speed and accuracy for on-line HWR analysis, but regrettably these recognizers consume significant memory resources. The present invention significantly reduces the memory use of the SNT recognizer through the use of mixture models and distributional clustering techniques. It is to be understood that this invention is applicable to any system that uses one or more probability tables.
SNT Recognizer
In regard to the implementation of a mixture model technique for probability table compression, each character sample of a character class C, the SNT algorithm generates a variable length sequence of features, f1, . . . fL. We define the i-th n-tuple of a given feature sequence to be:Xi1,N=(fi+k, fi+2k, . . . , fi+Nk)  (Equation 1)Where i=1, . . . L−Nk, and k is the sub-sampling distance. The SNT assumes that the n-tuples are all independent, thus the probability of observing a given sequence of n-tuples is given by:
                              P                                (                                                            ⋃                  i                                                                  X                                      1                    ,                    N                                    i                                            |              C                        )                          =                              ∏            i                                          P                                      (                                                X                                      1                    ,                    N                                    i                                |                C                            )                                                          (                  Equation                                                              2                )
The joint probability P(X1,N|C) is modeled by a lookup table of the normalized frequency counts of each of the possible n-tuples observed in the n-tuples for all the data for a given class C.
In regard to the implementation of a distributional clustering technique for probability table compression for each sample of a character class ci, the SNT algorithm generates a variable length chain code that is sub-sampled into tuples of length n with features f1, f2, . . . fn, where each code f ranges from 0 to σ−1.
In training, we assume a uniform distribution of the class prior probabilities p(ci) for the set of Q character classes C={c1, c2, . . . cQ} and estimate the probability distribution P(C|Ti) of the observed n-tuples at each i. In decoding, given a sequence of observed n-tuples τ=(t1, t2, . . . , tM), where tkε{T1, T2, . . . , Tσn}, k=1,2, . . . , M, the SNT classifier assumes that the n-tuples are mutually independent. Note, in addition that Xi1,Nε{T1, T2, . . . Tσn}.
Using the Bayes rule and assuming a uniform distribution of class prior probabilities, it can be shown that the posterior probability of the input belonging to class ci, p(ci|τ), is determined by the product of the conditional probabilities of class ci given each individual n-tuple. Thus the classifier selects the character class with highest posterior probability as given by:
                    c        =                  arg                                                                                max              i                                                                  ∏                                  k                  =                  1                                M                                                          p                                                  (                                                            c                                              i                        i                                                              |                                          t                      k                                                        )                                                                                (                  Equation                                                              3                )            where each p(ci|tk) is drawn from the σn×Q probability look-up table generated in training.
Unfortunately, these look-up tables can become very large with commonly used values of n≧5 and σ=8, making it impractical for embedded applications. The present invention comprises a method that can compress such look-up tables allowing the n-tuple method good performance with nominal accuracy loss at 20:1 compression, but which can scale to compressions of more than 5000:1 with only moderate increases in the error rate.
Compression of Joint Probability Tables Using Mixture Models
As with the SNT, conditional and joint probability tables are incorporated in many other on-line handwriting recognition systems for representing relationships between discrete random variables. N-gram language models and Bayesian networks are two such examples. One of the practical problems with such tables is that the table size grows exponentially with the number of random variables.
When such joint probability tables must be compressed, three factors should be considered. First, a compression algorithm should have a high compression ratio. Second, it should not severely degrade recognition accuracy. Third, it should not slow the recognizer so as to compromise real-time responsiveness. Many algorithms have been introduced for image and data communications compression (e.g. arithmetic coding, JPEG).
These methods are generally inappropriate for probability tables because the table data must be randomly accessed with minimal computational cost. In the literature of language model compression, quantization and pruning methods are used. Quantization allows probability terms to be represented with only one or two bytes rather than four. With pruning methods, high order conditional probabilities are approximated with low order ones. Those probability elements that can be approximated reliably are pruned away from tables.
Joint probability tables utilized within the present invention are decomposed into lower-dimensional components and their mixtures. Then, model parameters are quantized into integers of a predetermined size. This algorithm satisfies the three criteria for practical application. It has a high compression ratio. It classifies quickly because only linear operations are employed using integer math.
Distributional Clustering of N-Tuples
Consider the random variable over character classes, C, and its distribution given a particular n-tuple Ti, denoted P(C|Ti). The idea behind distributional clustering of n-tuples is that if two distinct n-tuples, Ti and Tj induce similar class distributions, they can be clustered together and represented by a single distribution that is the weighted average of the individual distributions:
                              P                                (                          C              |                                                T                  i                                ⋁                                  T                  j                                                      )                          =                                                            P                                                  (                                      T                    i                                    )                                                                          P                                                  (                                      C                    |                                          T                      i                                                        )                                                      +                                          P                                                  (                                      T                    j                                    )                                                                          P                                                  (                                      C                    |                                          T                      j                                                        )                                                                                P                                            (                                  T                  i                                )                                      +                          P                                            (                                  T                  j                                )                                                                        (                  Equation                                                              4                )
To be more general, from now on we will use the notion of class distribution given a particular event, Ei, denoted P(C|Ei). Tuples belonging to the same cluster are treated as identical events and induce the same class distribution. Since we now only need to store one distribution per event as opposed to one per distinct n-tuple, this paradigm leads to a compression ratio of σn: M, where M is the number of events. The small overhead of a look up table mapping any n-tuple to an event is in most cases negligible compared to the size of the probability table. Please note, in regards to equation 4 that other methods to those skilled in the art may also be used.
Measuring the Effect of Merging Two Distributions
Given two distributions P(C|Ei) and (C|Ej), the information theoretic measure for the difference between them is the Kullback-Leibler (KL) divergence measure defined as:
                                                        D              (                              P                                                  (                                      C                    |                                          E                      i                                                        )                                                                                                                            P_                                      (                              C                |                                  E                  j                                            )                                )                =                  -                                    ∑                              k                =                1                            Q                                                  p                                            (                                                      c                    k                                    |                                                            E                      i                                                                                log                                                                    (                                                                              p                                                                                (                                                                                c                                  k                                                                |                                                                  E                                  i                                                                                )                                                                                p                                                                                (                                                                                c                                  k                                                                |                                                                  E                                  j                                                                                )                                                                                )                                                                                )                                                                        (                  Equation                                                              5                )            Unfortunately this measure has two undesirable properties: it is not symmetric, and it is infinite when a class has nonzero probability in the first distribution and zero probability in the second. A related measure called "KL divergence to the mean" is defined as:
                                                                                P                                                        (                                          E                      i                                        )                                                                    P                                                        (                                                                  E                        i                                            ⋁                                              E                        j                                                              )                                                              ·                              D                (                                  P                                                        (                                          C                      |                                              E                        i                                                              )                                                                                                                  P                                            (                                  C                  |                                                            E                      i                                        ⋁                                          E                      j                                                                      )                                              )                +                                            P                                            (                                  E                  j                                )                                                    P                                            (                                                      E                    i                                    ⋁                                      E                    j                                                  )                                              ·                      D            (                                          P                                                  (                                      C                    |                                          E                      j                                                        )                                                                                                            P                                                        (                                          C                      |                                                                        E                          i                                                ⋁                                                  E                          j                                                                                )                                                  )                                                                        (                  Equation                                                              6                )
In information theoretical terms, this measure can be understood as the expected amount of inefficiency incurred if, instead of compressing two distributions optimally with their own code, we use the code that would be optimal for their mean. This measure not only avoids the two undesirable properties of the classic KL measure, but the measure is also more suitable for clustering as it measures directly the effect of merging two distributions into one. For the purpose of n-tuple clustering in the context of character recognition, we desire to further modify this measure to take into account the cumulative effect of merging two distributions on the final classification. As shown in Equation 3, each n-tuple encountered in the input character is treated as an independent event and the class likelihood of all the events are accumulated to produce the final score.
Thus, the true cost of merging two distributions should be further weighted by the prior probability of the joint event, the less frequently two events are likely to occur, the smaller the impact of merging their distributions. We call this new measure the "weighted mean KL divergence", it is defined as:Df(Ei,Ej)=P(Ei)·D(P(C|Ei)∥P(C|EiEj))+P(Ej)·D(P(C|Ej)∥P(C|EiEj))  (Equation 7)This is the distance measure we will use to cluster the n-tuple distributions. It is understood that there are many different methods for calculating the difference and/or similarities between two distributions. Any method for measuring distance between distributions known to those skilled in the art can be used.

Method and system for the compression of probability tables

International Business Machines Corporation


A container measuring device for measuring minimum and maximum diameters and the ovality of a container finish includes a seat for receiving the container finish and a gauge for measuring the minimum and maximum diameters. The measuring device is balanced on the container with the container finish received in the seat and the measuring device is then rotated to determine the dimensions of the container finish. An adjustable counterweight may be used to balance the measuring device on the container finish. Preferably, the minimum and maximum diameters are recorded by the gauge and transmitted from the gauge to a computer for a determination of whether the container finish dimensions fall within a predetermined tolerance range.

1. Field of the Invention
The invention relates to a device for measuring dimensions of containers. More particularly, the invention relates to a container finish measuring device for measuring thread dimensions and ovality of a container finish to determine whether the finish is within a predetermined tolerance limit which will result in a liquid tight seal between the container finish and cap.
2. Brief Description of the Prior Art
In the manufacture of containers, certain dimensions are required to be within predetermined tolerance limits in order for the containers to function properly. In particular, the upper surface of the container, commonly known as the finish, must be maintained within certain manufacturing tolerances in order to provide adequate cap retention for a liquid tight seal to be formed between the container finish and the container cap.
Variations in the configuration of containers, particularly plastic containers, may occur during molding or trimming operations due to many factors, including differences in the molds used to form the containers, shrinkage of the containers after molding, materials used, curing temperatures, and trimming operations. One particular source of warping or ovalization of a container finish is the trimming operation. The container "finish" includes at least the neck, threads, rim, and top surface of a container. In particular, once the bottle or container has been molded, a trimming machine is used to trim flash from the finish of the container. While the flash is being trimmed from the finish, the bottle is held in place by a clamp received around and engaging the finish. Because the container is still warm during trimming, distortion or warping of the finish may be caused by the clamping force used to hold the container.
In order to determine whether containers which are being produced are within predetermined dimensional tolerances, generally a sampling of the containers being produced is measured to determine actual dimensions and ovality. Ovality is the difference between the minimum and maximum diameters of the finish. For containers which will hold fluids, including consumer products such as detergents and bleaches, it is important that the finish of the container be within the predetermined dimensional tolerances so that a cap will be retained properly on the finish and leaks will be prevented.
A bottle finish having threads for retaining a cap includes a T-dimension and an E-dimension. The T-dimension of the finish is the outside major diameter of the threads. The E-dimension is the minor outside wall diameter of the finish at the base of the threads. Generally, a bottle is measured by using calipers to determine the T-dimension of the finish. The T-dimension is measured at a first location along the mold parting line of the bottle, and also, at a second location along a line which is 90 degrees to the mold parting line. These two diameters of the finish are then used to determine the ovality of the bottle finish by subtracting the smaller dimension from the larger. However, these measurements will not give a true ovality of the finish because the two dimensions measured may not be the true minimum and maximum dimensions of the finish.
In order to determine a more accurate ovality, it would be desirable to take a large number of measurements at different positions around the diameter of the finish so that true minimum and maximum dimensions can be determined for calculation of ovality. However, taking a large number of dimensional readings with a caliper to determine an accurate ovality is time intensive.
In addition, the dimensions of a container finish as determined by manual measurement with a caliper will include inaccuracies which vary depending on the expertise of a particular user. The inaccuracies occur due to the manual placement of the caliper, variations in the manual force applied to the caliper, and the caliper blades cutting into the soft material of the bottle finish, such as when the bottle is made of a blown thermoplastic.
As an alternative to manual measurement with a caliper, container finishes may also be measured by an optical comparator. The optical comparator takes an enlarged shadowgraph of the bottle finish to provide a highly accurate measurement of the finish diameter. However, optical comparators are quite expensive and are generally not available at the location where the bottles are made. Therefore, when using an optical comparator, bottles often must be shipped off to a laboratory for measurement, providing a very delayed determination of dimensional tolerances. As a result, a large number of reject bottles may be made before the error is corrected by adjustments to the blow molding and/or trimming processes.
In addition, the optical comparator measures only one dimension of the finish at a time. Thus, as with the manual measurement of the finish with calipers, the bottle must be rotated and remeasured at many locations to determine ovality.
In view of the above drawbacks of the known methods for measuring thread dimensions and ovality of a container finish, it would be desirable to provide a measuring device for accurately measuring the true ovality of a container finish rapidly and with minimal user error.
One type of measuring device which has been proposed for measuring dimensional tolerances of a can includes a base into which the can is placed and the can is then rotated to measure a container dimension. However, this type of device into which a can is placed and then rotated cannot be properly used for a container having a non-symmetrical shape. For example, if a container having an offset finish is set in a device of this type, the container cannot be balanced for rotation within the device. An example of such a measuring device is described in U.S. Pat. No. 5,313,714.
Accordingly, it would be desirable to provide a portable container measuring device which does not require that the container be balanced in the device for measurement. It would also be desirable to provide a measuring device which measures the true maximum and minimum dimensions of a container finish.

Balancing container finish measuring device

by Patricia Van Bebber, legal representative


There is provided a method for synchronization between one or more base stations to provide broadcast multicast service, including: receiving a session start request message, and extracting a service start setting time set to start broadcast service from the session start request message; comparing the service start setting time to a modification check time being a check time which is later than and closest to the service start setting time, among check times at which it is determined whether or not broadcast service has changed, the check times having a predetermined time interval; deciding, when the modification check time is later than the service start setting time by a predetermined internal slack time period or more, the modification check time as a service start time at which broadcast service starts; and transmitting information indicating the service start time to the base stations.

1. Technical Field
An example embodiment of the present invention relates in general to synchronization between base stations, and more particularly, to a method and apparatus for synchronization between base stations to provide broadcast multicast service in a multi-cell environment.
2. Related Art
A Long Term Evolution (LTE) mobile communication system is a packet-based mobile communication network and a next-generation communication system evolved to provide various high-speed data services. The LTE system defines a Multimedia Broadcast and Multicast Service (MBMS) based on a Multimedia Broadcast multicast service Single Frequency Network (MBSFN) in order to provide broadcast services through a wireless communication network.
In order to provide broadcast service based on the MBSFN, all base stations belonging to the corresponding service region should transmit the same information to a plurality of terminals simultaneously. For synchronized transmission, the base stations have to use the same scheduling algorithm and receive packets with the same content from the upper node before a radio transmission period starts. Also, for synchronized transmission of information, all the base stations need to be synchronized. A region in which all base stations are synchronized is defined as a MBSFN synchronized area. Also, a group of cells providing the same service, among base stations (cells) belonging to such a MBSFN synchronized area, can be defined as a MBSFN area.
For synchronized transmission of information, the base stations belonging to the MBSFN area have to receive the same scheduling information from a Multi-Cell/Multicast Coordinate Entity (MCE). A Broadcast Multicast Service Center (BM-SC) provides information using a SYNC protocol for synchronized transmission. The SYNC protocol has time stamps and packet serial numbers as additional information that is used to check scheduling times and packet loss.
Specifically, a control message for starting new broadcast service is generated by the BM-SC and transmitted to the MCE via a MBMS Gateway (MBMS-GW) and a Mobility Management Entity (MME). The MCE allocates radio resources to the new broadcast service, decides a service order based on priority, and notifies the corresponding base stations of the start of the broadcast service. Accordingly, the BM-SC which distributes broadcast contents transmits service packets for the corresponding broadcast service to the base stations, and the base stations receive the service packets and transmit them to a wireless sections.
Also, base stations belonging to a MBSFN synchronized area and MCEs controlling the base stations are accurately synchronized in hardware using a GPS or another methods so that the base stations can transmit synchronized data to the wireless sections.
As described above, although conventional synchronized base stations are configured to enable synchronized transmission using a SYNC protocol in a BM-SC, there is a problem that when the BM-SC transmits service packets for a broadcast at an arbitrary time in accordance with the start of the broadcast service, inconsistency in broadcast service time may occur. In other words, when the BM-SC transmits service packets to base stations at an arbitrary time, the service packets may reach the base stations at different times, that is, transmission delays of the service packets are generated due to different networks established between the base stations and differences in performance of intermediate routers configured between the base stations. Transmission delays cannot be avoided even when the SYNC protocol is used
Also, when it is the start of broadcast service, a service operator can designate an absolute start time of the broadcast service to base stations belonging to a MBSFN region through a management message or the like. However, such a static control method makes it difficult to properly reflect the dynamic characteristics of broadcast services, and there are also difficulties in the actual implementation.

Synchronization method and apparatus for broadcast multicast service

Electronics and Telecommunications Research Institute


To estimate an image quality deterioration level at a high accuracy. An image quality deterioration level is estimated by judging whether image quality deterioration is suppressed or not by error concealment processing when decoding is not correctly performed, based on information obtained in decoding processing. When it is judged that error concealment is effectively operated, it is estimated that deterioration of an image quality even in an image region not correctly decoded is small. When it is estimated that error concealment is not effectively operated, it is estimated that image deterioration is heavy.

Methods for objectively evaluating the qualities of videos are classified into three types. That is, the first method is a method for directly comparing an original image and a degraded image to evaluate the quality of an image. The second method is a method for extracting only the characteristic amount of an original image and then evaluating the image quality based on the extracted characteristic amount and the degraded image. The third method is a method for evaluating an image quality based on only degraded images.
A specific example of the first method is recommended by ITU-T (International Telecommunication Union Telecommunication Standardization Sector), as described in non-patent document 1. However, the application for transmitting videos from a transmitter to receivers has an upper limit of a transmission line band, which makes it difficult transmit original images. If original images are not transmitted, the receiver cannot evaluate the image quality using the first method.
Moreover, the second method requires multiplexing the characteristic amount of an original image to original transmission image data and then transmitting the resultant data or transmitting the characteristic amount of an original image via another transmission line. When the characteristic amount of an original image is multiplexed and transmitted, the existing transmitter has to be replaced. Transmitting the characteristic amount of an original image via another transmission line requires replacing the existing communication system including the transmitter. In other words, the problem is that it is difficult to implement new operations in the existing system.
The third method has an advantage over merely requiring a replacement of the receiver because information on original images is not totally required, thus facilitating new operations. The image quality evaluating apparatus that estimates the image quality based on received data only, without using original images, is disclosed in the patent documents 1 and 2. In the image evaluating apparatus disclosed in the patent document 1, when received data is not correctly decoded due to, for example, an occurrence of transmission error on the transmission line, which transmits image data encoded for data amount compression, the number of regions where errors (errors in image data) have occurred is measured to determine it as a level of image quality degradation.
As described in the patent document 1, when image data cannot be decoded correctly, the decoding apparatus generally performs an error concealment process (an error hiding process), which obscures regions not correctly decoded, to video frames. By doing so, end users view images subjected to the error concealment process.    Patent document 1: Japanese patent Laid-open publication No. 2000-341588 (paragraphs 0044, 0072, 0095)    Patent document 2: Japanese patent Laid-open publication No. 2001-25014    Non-patent document 1: ITU-T recommendation J.144, March, 2004

Image quality evaluating method, image quality evaluating apparatus and image quality evaluating program


An approach for pathing users of an AR (Augmented Reality) software event is provided. The approach includes retrieving a matched pair of users based on a social media and game profile. The approach determines the current event of the matched pair and creates a new event, requiring cooperative engagement between the matched pair. Based on the status notification from the matched pair associated with the created new event, the approach re-match the pairs for future and new AR event.

The present invention relates generally to the field of software and gaming, and more particularly to providing a collaborative path through the use of Augmented Reality.
AR (Augmented reality) is an enhanced version of reality created by the use of technology to overlay digital information on an image in the real physical world. The digital information can include multiple sensory modality such as visual, auditory, haptic, somatosensory and olfactory. The overlaid sensory information can be constructive (i.e. additive to the natural environment), or destructive (i.e. masking of the natural environment). The AR experience is interwoven harmoniously with the physical world such that it is perceived as an immersive part of the real environment. Thus, AR can transform a user's perception of a real-world environment. In contrast, VR (virtual reality) completely replaces the user's real-world environment with a simulated one.
AR technology can and have been applied to the gaming industry. Several games were developed for prepared indoor environments, such as AR air hockey, collaborative combat against virtual enemies, and AR-enhanced pool table games. Augmented reality allowed video game players to experience digital game play in a real-world environment such as Pokémon Go™.

Connectivity mechanism utilizing augmented reality


A method for operating a pressure control system having a multi-stage compressor includes providing a multiply compressed pressure medium by the multi-stage compressor for filling a pressure medium reservoir or pressure medium chambers of the pressure control system. Providing the multiply compressed pressure medium includes (i) providing, by a first compression stage, a pre-compressed pressure medium and additionally compressing, at least by a second compression stage, the pre-compressed pressure medium, and/or (ii) introducing an already-compressed charging pressure medium into an intermediate volume between the first compression stage and the second compression stage of the multi-stage compressor and further compressing the charging pressure medium at least by the second compression stage. The charging pressure medium simultaneously passes via a control line to a control input of a shut-off valve that interacts with the first compression stage, such that a charging pressure of the charging pressure medium predefines a control pressure.

Multi-stage compressors serve for achieving a high level of compression of a pressure medium, in particular of a gas, for example air, by virtue of the pressure medium, which has been pre-compressed in a first compression stage, being additionally compressed in a subsequent second compression stage. It is also possible for further compression stages to be provided in a cascade, in which, in each case, the pressure medium compressed by the preceding compression stage is compressed further.
If consumers, for example of an air suspension system or of a ride-height control system in a vehicle, are to be supplied with the pressure medium, a multi-stage compressor of said type can be used in order to provide the pressure medium with a corresponding pressure for the supply to pressure springs. Here, the multi-stage compressor compresses the pressure medium, which is introduced from the atmosphere into an intake space, by means of two or more compression stages, and transfers the pressure medium that has been compressed in multi-stage fashion to the pressure springs. Alternatively, an already-compressed pressure medium from a pressure medium reservoir may be used, which is compressed once more by the compressor.
This is described for example in DE 10 2008 034 240 B4, according to which a ride-height control system is provided in the case of which a multi-stage compressor is used in order to convey the pressure medium from the atmosphere or out of a pressure medium reservoir, wherein two compression stages are provided. If pressure medium from the atmosphere is compressed, the pressure medium is conducted through both compression stages, whereas, in the case of delivery of the pressure medium out of the pressure medium reservoir, a compression of the pressure medium fed to the consumer is performed only by means of the second compression stage. In order, in this case, to reduce or inhibit the compression work of the first compression stage, a shut-off valve designed as a 2/2 directional valve is provided, which, in the case of conveyance out of the pressure medium reservoir, prevents a conveyance of compressed pressure medium out of the first compression stage to the second compression stage. The shut-off valve is in this case actuated electrically by means of a control device.
DE 103 21 771 A1 describes a multi-stage compressor in the case of which, for the deactivation of the first compression stage, a bypass line with a pneumatically controllable shut-off valve is provided, which connects an intake space of the compressor to the first compression space. The pneumatic shut-off valve is in this case opened in a manner dependent on the pressure in the intake space, such that a pressure equalization can occur between the intake space and the compression space. This serves for deactivating the first compression stage in a manner dependent on the pressure of the pressure medium admitted into the intake space. In this way, in a manner dependent on the admitted pressure medium, a high level of compression can be achieved with a small volume flow in single-stage operation. By contrast, in two-stage operation, a high volume flow is realized, and the pressure medium flows through two compression stages.
In DE 10 2011 083 614 A1, provision is made, in an open operating mode, for air to be compressed by means of two compression stages, and for the compressed air to be fed to a pressure medium reservoir. In a closed operating mode, the already-compressed air from the pressure medium reservoir can be admitted into an intermediate volume between the first and the second compression stage and compressed again by means of one of the compression stages in order to subsequently pass into the consumers. A return of air from the consumers into the pressure medium reservoir is also provided. For control purposes, electrically actuated switchover valves are provided, which correspondingly shut off and open up the flow paths for the compressed air or the air to be compressed.
DE 10 2012 010 390 A1 describes a ride-height control system in the case of which, in a closed operating mode, air that has already been compressed by means of a compressor is fed from a pressure reservoir into consumers designed as spring struts. For the control of the pressure in the ride-height control system, a pressure-limiting function is provided, which is configured either in the form of a discharge valve or in the form of a pilot control valve, which each discharge air into the atmosphere in the presence of an excessively high pressure in the system.

Method for operating a pressure control system comprising a multi-stage compressor, and pressure control system


A wheel-type resistance device includes a flywheel which is rotated together with a hub member around an axle and which has an accommodation chamber indented axially to form a first circumferential portion that extends in a radial direction relative to the axle. A plurality of magnetically attractive members have magnetically permeable members thereon and are angularly displaced on the first circumferential portion. A dragging force adjusting member is mounted on the axle and is shiftable in the axial direction. The adjusting member has a left major surface with a second circumferential portion opposing the first circumferential portion for mounting a plurality of magnets so that the magnets will be drawn by the magnetically attractive members through the permeable members when the flywheel rotates. A shifting member is operable to shift the adjusting member away from the flywheel so as to decrease the dragging force imposed upon the rotation of the flywheel. A coil spring biases the adjusting member toward the flywheel against the action of the shifting member.

1. Field of the Invention
This invention relates to a resistance device for a bicycle exerciser, more particularly to a wheel-type resistance device which provides a magnetic resisting force between a flywheel and a dragging force adjusting member thereof.
2. Description of the Related Art
Referring to FIGS. 1 and 2, a conventional wheel-type resistance device of a bicycle exerciser includes a flywheel 2 which rotates together with a hub member 9 around an axle 1. The flywheel 2 has an accommodation chamber 2a which is indented axially to form an inner peripheral wall 2b around the axle 1. Two magnetically permeable members 6 are secured on the inner peripheral wall 2b. A dragging force adjusting member 3 is sleeved slidably on the axle 1 and has an outer peripheral wall 3b provided with a plurality of arcuate magnets 7 opposite to the magnetically permeable members 6. When the hub member 9 is rotated by a pedaling action of a user to rotate the flywheel 2, the magnets 7 are drawn by the magnetically permeable members 6 to generate a magnetic dragging force.
A guiding seat 5 is secured to the exerciser and has a rail arm 5b which passes through a through hole 3a in the adjusting member 3. A cable 8 has one end 8a connected to the adjusting member 3, and an opposite end mounted on the bicycle exerciser and operable so as to pull the adjusting member 3 away from the flywheel 2 in the axial direction by the guidance of a guiding rail 5b to decrease the opposing surfaces of the magnetically permeable members 6 and the magnets 7 decrease in turn the magnetic dragging force (as shown in the dotted lines of FIG. 1). A coil spring 4 is sleeved on the axle 1 to bias the adjusting member 3 toward the flywheel 2 against the action of the cable 8.
The drawbacks of the conventional resistance device are as follows:
1. The biasing force of the coil spring 4 must be overcome when moving the adjusting member 3, thereby resulting in inconvenience during operation. PA1 2. The size of the clearance between the inner and outer peripheral wall 2b, 3b must be very precise. A relatively large clearance will affect adversely the magnetic dragging force, and is liable to contamination. PA1 3. The movement of the adjusting member 3 is guided only by the rail arm 5b and tends to be oblique relative to the axle 1, thereby resulting in possible contact between the magnets 7 and the magnetically permeable members 6, and in the generation of noise. PA1 4. Each of the magnetically permeable members 6 is bent to be semi-circular in shape, thereby resulting in increased difficulties during manufacture and assembly.

Wheel-type resistance device for a bicycle exerciser

No. 64, Alley 60, Lane 632, Sec. 3, Chang-Hsin Rd.


A method for providing intravascular brachytherapy includes the step of positioning a radiation source within a target area to be radiation and orienting the attenuator found on the catheter. Once the attenuator or shield is properly oriented, a reference or normalization point or marker (508) is selected. This reference marker (508) can placed, as one example, on the external elastic lamina closest to catheter (100) and can serve as a reference point for the brachytherapy treatment. Several other points of interest can be is selected (504, 506, 510) on the image (500) or images that have been gathered of the treatment site, with dosage levels (512, 522, 520 and 518) being display automatically on the display (406) close to the IVUS image (500).

This invention relates in general to the field of intravascular brachytherapy, and more particularly, to a method and apparatus for providing intravascular bracytherapy treatment planning.
Research has found that up to 45% of the angioplasty procedures performed require an additional intravascular intervention procedure be performed after several months due to restenosis. These additional interventions do not only increase the cost of health care, but also have serious effects on the health and well being of patients having to undergo these additional medical procedures.
Many recent medical studies have demonstrated that intravascular radiation treatment, also known as intravascular brachytherapy, may inhibit restenosis in vessels that have undergone angioplasty or other coronary revascularization procedures (e.g., atherectomy, ablations, etc.). This is a welcome sign for patients who have undergone angioplasty or other revascularization procedures, given that brachytherapy may avoid patients from having to undergo subsequent procedures.
One problem that currently occurs during intravascular brachytherapy procedures is that physicians have to spend a large amount of time prior to, and/or during a procedure in treatment planning in order to determine how much radiation dosage to apply and where to apply the dosage within the treatment site. Since undertreating with radiation can result in not inhibiting the neointima and, in some cases, can actually result in stimulating smooth muscle cell proliferation and extra-cellular matrix production. While overtreating with radiation can induce necrosis or aneurysm. Given this, physicians are very cautious and take time in developing a proper radiation treatment plan for patients.
Current brachytherapy systems, even those that employ IVUS guidance tend not to provide physicians with the needed features and information needed to form a proper treatment plan, much less one that takes a minimal amount of time. A need thus exists in the art for a method and apparatus that can provide a solution to this problem.

Method and apparatus for intravascular brachytherapy treatment planning


A multi-direction image viewing system includes a triangular or rectangular image case, and plural projectors symmetrically installed to the inner sides of the image case in three or four directions. Projecting light paths cross each other so that the size of the image case is reduced to 1/6.7 to ⅓ of the size of the conventional image case. By reducing the weight of the image case through size reduction, the multi-direction image viewing system can serve as a mobile multi-direction image viewing system coupled with a trailer and transported by a small sized vehicle such as a motorcycle, as a wide viewing angle multi-direction image system attached to a wall and coupled with the safety fence of the bus terminal or the subway station, and as an image viewing system mounted to a ceiling or wall.

1. Field of the Invention
The present invention relates to an image advertising system, and more particularly, to an image advertising system having minimal size and weight and a triangular structure capable of guaranteeing a sufficient viewing angle and a sufficient large screen, and to allow people to watch images in multi directions.
In detail, the present invention relates to an image viewing system, in which projection light paths of plural projectors cross one another, images are formed in a minimal sized image case in multiple directions, capable of being installed to a wall or a safety fence of a subway station, and capable of being engaged with a trailer to be conveniently moved.
2. Description of the Related Art
FIG. 9a is a view illustrating a conventional image viewing system including a screen 1e installed to a wall and a projector 2 for projecting an image upon the screen 1e or including a single flat-screen display such as a plasma display panel installed to a wall in the horizontal direction.
Generally, a viewing range within which a viewer 12 may effectively view an image, i.e. a horizontal length A of the screen 1e, as shown in FIG. 9, is about 30 degrees outward from the both vertical edges of the screen 1e, i.e. 60 degrees. A viewer must be within these 60 degrees to effectively view the entirety of the screen 1e. This fact is already known.
For reference, as shown in FIG. 1a, a horizontal length A to a vertical length B, e.g. the aspect ratio, is 16:9, i.e. A:B is 1.77:1. The ratio of in a movie theater is 2.35:1.
As shown in FIG. 2, when the image is projected by the projector 2, a projection ratio of the horizontal length A of the screen 1e to a projection distance C of a standard projection lens of the projector 2, i.e. an image projection ratio (hereinafter referred to as a projection ratio), is 1:1.3, as is also already known.
Although the projection ratio of the projection lens of the projector 2 from 1:0.8 to 1:3 can be applied to the present invention, the projection ratio of the projector 2, for the purpose of illustration, is assumed to be that of the projection ratio of a standard projection lens, 1:1.3.
This means that when the projection distance C is 1.3 m, the horizontal length of the screen is 1 m and the projection distance C is longer than the horizontal length A of the screen. In other words, it means that the projection distance C of the projector 2 is equal to the length of a side of an image case 3.
In the present invention, the size of the displayed image, i.e. the horizontal length A of the screen, ranges from 0.7 m to 3 m, preferably 1.5 m. For the purpose of illustration, hereinafter, a screen having a horizontal length A of 1.5 m is described.
When the horizontal length A of the screen is 1.5 m, the projection distance C must be 1.95 (m1.5 m×1.3) due to the projection ratio 1:1.3.
As shown in FIG. 2b, by setting the projection distance C (1.95 m) of right, left, front, and rear projectors 2a, 2b, 2c, and 2d to a reference, the projection distance C of the projector 2 becomes a factor to determine the sizes of front, rear, right, and left sides of a conventional rectangular image case 10. For example, the lengths C2 of the right and left sides of the conventional rectangular image case 10 become the sum of the projection distances of the front and rear projectors 2a and 2b, C+C, i.e. 1.95 m+1.95 m=3.9 m.
Thus, the size of the conventional rectangular image case 10 determined by the front, rear, right, and left sides thereof becomes C2×C2=3.9 m×3.9 m, and the horizontal length A, i.e. the size of the image, of the transparent screen 1 becomes 1.15 m. In other words, the screen size of the conventional rectangular image case 10 (1.15 m) is only 30% of the length (3.9 m) of a side of the conventional rectangular image case 10.
In other words, as shown in FIG. 2b, when a plurality of projectors 2 is installed, the length of a side of the conventional image case 10 is double that of the projection distance C, but the size of the transparent screen is not increased.
This phenomenon, as shown in FIG. 3, occurs in a triangular image case 3b.
Thus, according to the conventional image case, as shown in FIG. 4a, when a multi-direction image viewing system is installed to the ceiling, although the size of the conventional image case 10 is increased, the horizontal length A of the screen cannot be maximized. Moreover, as shown in FIG. 5a, when the conventional triangular image case 11 is installed in a passage, since the height C4 of the triangular is high, the size of the conventional triangular image case is also increased to obstruct pedestrian passage.
Moreover, as shown in FIGS. 6a and 7a, in an image viewing system engaged with a trailer 8, the width of the image case 3 having plural transparent screens 1 installed in four directions must not be over the average width (1.7 m) of a 1 ton truck.
However, since the length of a side of the conventional image case 3 having the screens with a horizontal length A, 1.5 m, installed in multiple directions is 3.9 m, as shown in FIG. 6a, the horizontal length A of the conventional image case 3 is over the width D (1.7 m) of a vehicle and is over the width (2.5 m to 3.5 m) of a lane of a general paved road. Thus, the conventional image case 3 cannot be transported through the road.
Although there is an image vehicle in which the image case is fixed to the rear side thereof, since the image case cannot be separated from the image vehicle, each image case requires a corresponding vehicle. Moreover, since the size of the image case is restricted according to the size of the transporting vehicle, screens cannot be installed in multiple directions, but only in a single direction.
As shown in FIG. 9b, in a conventional screen advertising system installed in a station of a subway, a train, or the like, the projector 2 is installed on the ceiling, and a scattering screen 1e is installed to a wall nearby the windows of trains, opposite to the platform.
According to the conventional screen advertising system in FIG. 9b, when the trains 91 enter the subway station, the trains 91 hide the scattering screen 1e, in the case that a safety fence 14 is installed in the subway station, since the safety fence 14 is disposed between the scattering screen 1e and the projector 2, consumers cannot view the scattering screen 1e.
Meanwhile, passengers stand in lines at the sides of doors 13a of the trains 91 and passengers in the trains 91 exit through the central area of the doors 13a.
Thus, as shown in FIG. 9c, when the scattering screen 1e is installed to the safety fence 14, effective view range of the scattering screen 1e, as shown in FIG. 1, is 30 degrees, respectively, at the right and left sides thereof, i.e. a total of 60 degrees. Thus, as shown in FIG. 9c, since the passengers at the sides of the doors 13a cannot view the entire scattering screen 1e, but only some passengers may view, advertising impact of the conventional screen advertising system is deteriorated.
In addition, as shown in FIG. 9a, in order to increase the advertising impact of the image advertising system, the image advertising system, installed in passages such as passages in a shopping mall through which consumers walk, must have a viewing range greater than 120 degrees. However, the conventional image advertising system has a viewing range of only 60 degrees, i.e., the sum of the right and left ranges. Thus, it is an object of the present invention to increase the viewing angle.
As shown in FIGS. 3 and 16a, when the projectors 2 are disposed at the inner intermediate portion of the conventional triangular image case 11 and the transparent screens 1 are installed at the sides of the conventional triangular image case 11, since the size of the conventional image advertising system is double that of the projection distance C of the projectors and the weight is increased due to the increased size, the conventional triangular image case installed to the wall of the passage serves as a factor to disturb consumers' passing.
Thus, in the multi-direction image system using the projectors 2, there are important technical problems such that a screen having a maximal horizontal length A is implemented in an image case 3 having a minimal space, to the contrary, the same size screen is implemented in the minimal sized image case 3, and/or images are displayed in two directions, i.e. in the right and left directions of the image case 3, in three directions, i.e. in the right, left, and central directions of the image case 3, or in multiple directions, i.e. in the front, rear, right, and left direction of the image case 3.


Disclosed is a unique spine protector for use with or without protective clothing and in particular, in bomb disposal suits or in sports related activities. The protector is made up of a plurality of overlapping elongate support members having a central recess in the mid-portion thereof such that when an external force is applied to the spine protector, the force exerted is transmitted to the spinal muscles and/or thoracic support structures on either side of the vertebrae while the vertebrae remain minimally loaded. The spine protector is made up of two sizes of support members which overlap each other in mating relationship and are loosely joined so that the spine protector can flex in three dimensions.

Protective clothing, particularly designed for protection of the spine, is well known. All of the devices known today suffer from two principal problems: (1) there is not sufficient flexibility in the protective gear; and (2) the known spine protectors bear directly upon the vertebrae. Thus, an external force is transmitted directly to the vertebrae in spite of the use of large amounts of padding and other materials.
It is, therefore, an object of the present invention to provide a spine protector which is both strong and flexible and of relatively light weight.
It is a further object of the present invention to provide a spine protector which when hit with an external force, such as when a bomb technician is thrown back after an explosion onto or against objects close to them, or when an athlete impacts an unyielding object or is impacted by another athlete or an object carried by another athlete, the force is transmitted to the spinal structures on either side of the spinal column rather than to the vertebrae.


Liquid abrasive slurry for chemical-mechanical polishing of semiconductor wafers is held on a rotating polish table by a containment device having two continuous circular bonded strips of differing flexibilities. A releasable clamp seals the entire length of the more flexible strip to the table periphery.

The present invention concerns chemical-mechanical polishing of semiconductor wafers or similar workpieces, and more particularly relates to a device for effectively containing an abrasive slurry on a rotating polish table.
In the conventional "chem-mech polish" (CMP) process, passivated semiconductor wafers are rotated against a polishing pad. A pH-controlled abrasive slurry introduced onto the rotating table maintains a proper etch rate of the passivation layer to achieve a very smooth planar surface on the wafers. U.S. Pat. No. 4,910,155 to Cote and Leach describes preferred procedures and materials for polishing semiconductor wafers; this patent also refers to other descriptions of "chem-mech" polishing methods.
In some CMP systems, the slurry flows continuously onto a flat polish table. As the table rotates, slurry is flung off the edge and carried away by a drain. This is wasteful of slurry material, leads to nonuniformity of the slurry at different locations, and splatters the abrasive slurry into surrounding machinery. In the Cote et al. patent, a raised wall of rectangular cross-section surrounds the table's edge. Such a wall or containment device must form a liquid-tight seal around the entire periphery of the polish table. Yet, at the same time, the wall must be easily removable in order to clean the polish table periodically, and must be quickly reinstallable on the table for setting up the next run with a new batch of slurry.
Conventional containment devices for CMP systems tend to be leaky, physically unwieldy, and difficult to install and remove. Some crude systems merely have as a wall, a thin plastic or metal band taped around the edge of a polish table. Large amounts of leakage occur in such systems, and cleaning the table between runs involves untaping and then replacing and resealing the entire wall. Another CMP apparatus uses a thick circular metal wall bolted at several points to counterbores in a flat polish table. Such a wall is bulky, but still weak and easily bent out of shape when removed from its polish table. Reinstallation for a new run requires accurate alignment and manipulation of a number of bolts. Leakage still occurs, however, between the table and the wall in the regions between the bolts.

Slurry containment device for polishing semiconductor wafers

International Business Machines Corporation


An image processing apparatus includes a usage state determination portion determining a usage state of a camera portion; and an object detection portion detecting an object from an image captured by the camera portion using a plurality of methods, in which the object detection portion detects the object from the captured image by prioritizing the plurality of methods based on the usage state.

The technology disclosed in the present specification relates to an image processing apparatus and an image processing method processing an image captured by a camera, an image capture apparatus and a computer program, and, in particular, relates to an image processing apparatus and an image processing method detecting an object, such as a face image of a person included in an image, an image capture apparatus and a computer program.
In an environment in which people live, there are various products which are targets controlled by a user, such as domestic appliances or information devices. A gesture operation is one example of a method in which a user remotely operates this type of device.
For example, a remote operation apparatus capturing an image of an operator operating an operation display unit displaying an operation button or a menu, and detecting an operation by an operator based on the shape of a hand region and movement detected from the captured image, and display of the operation display unit has been proposed (for example, refer to Japanese Unexamined Patent Application Publication No. 2010-79332). According to the related art, it is possible to recognize a gesture of a user using the contours of a finger.
In addition, an image recognition apparatus has been proposed in which an operation of an operator is 3-dimensionally read with respect to a virtual operation surface, whether or not a movement is an operation is determined based on a positional relationship between a portion of an operator and a virtual operation surface, and if the motion of the operator is performed in any region of two or more virtual operation strata determined based on the positional relationship with the virtual operation surface, the content of the operation is determined based on the operation classification allocated in advance to the virtual operation stratum and the motion of an operator in the virtual operation stratum (for example, refer to Japanese Unexamined Patent Application Publication No. 2010-15553).
For a gesture operation, it is basic to analyze a gesture by recognizing a face or a hand of a user from an image of a user captured by a camera. Accordingly, it is considered to be possible to introduce gesture operations to various domestic appliances or information devices to which a camera is mounted.
A face recognition system, for example, is configured of two processes: a face recognition processes detecting the position of a face image and extracting the position as a detected face, and a face recognition process performing recognition of the detected face (specified as a person). Among the above processes, the face detection processes is a process in which a template image of a face or the like is scanned on an input image, and a detected face is extracted by pattern matching is in general use (for example, refer to Japanese Patent No. 4389956).
Incidentally, since if the face image in the input image is rotated with the optical axis of the camera as a center, pattern matching is not appropriately performed on the posture of template image, there is a problem in that the face detection accuracy is lowered. For example, in a case in which a camera is mounted to a device performing gesture operations and the device main body is supported by a rotating mechanism (for example, refer to Japanese Unexamined Patent Application Publication No. 11-24577, Japanese Unexamined Patent Application Publication No. 2003-157016 and Japanese Unexamined Patent Application Publication No. 2011-17738), it is assumed that a face image captured with an internal camera rotates.
Alternatively, also in a case in which the device to which the camera is mounted is a hand-held type, it is assumed that the posture of the camera changes according to the motion of the arm of the user, and that the subject image captured rotates.
For example, a face image detection apparatus has been proposed, which performs face detection by tracking changes in a face image using a plurality of reduced rotated image data items in which input image data is reduced and rotated to a plurality of angles (for example, refer to Japanese Unexamined Patent Application Publication No. 2008-287704). However, when performing pattern matching with a template image with respect to a plurality (n) of reduced rotated image data items, the processing amount is increased by n times.
In addition, when the inclination of a portable telephone is detected using an acceleration sensor (incline angle detection unit) and a face detection process is performed from a captured image, a portable electronic device with an attached camera performing face detection by a subject image for face detection being rotated based on detected incline information of the portable telephone or by changing the order in which pixels are read out has been proposed (for example, refer to Japanese Unexamined Patent Application Publication No. 2009-105559). However, even though the efficiency of the detection process itself increases, the processes in which the subject image is rotated increase. In addition, if pattern matching is not performed on a template image with respect to a subject image after rotation processing only, in a case in which the incline of the face of a subject does not match the incline information of the portable telephone, lowering of the detection precision is a concern.

Image processing apparatus, image processing method, image capture apparatus and computer program


Printing occurs when a marking engine deposits ink on a substrate to produce a pattern. The printed pattern can differ from the desired pattern when the marking engine is out of adjustment, the substrate and ink do not interact optimally, or for other reasons. A tone reproduction curve can be used to adjust the pattern or the marking engine so the printed pattern and desired pattern are similar. Another effect of printing is that contours can appear. Contouring can be reduced if a smooth tone reproduction curve is used. Aspects of the embodiments address limitations and flaws in the prior art by using a smoothing parameter and a smoothing matrix to produce TRCs that minimize contours.

Printing is the art of producing a pattern on a substrate. The substrate is usually paper and the pattern is usually text and images. A marking engine performs the actual printing by depositing ink, toner, dye, or similar patterning materials on the substrate. For brevity, the word "ink" will be used to represent the full range of patterning materials. In the past, the pattern was introduced to the marking engine in the form of a printing plate. Modernly, digital data is commonly used to specify the pattern. The pattern can be a data file stored in a storage device.
People often want to produce a pattern using different marking engines. When many copies of the pattern are desired it is convenient to use many marking engines. For example, a publisher believing that a book will be very popular might want a few million copies of the book. The publisher can use dozens of marking engines to produce all those copies. One risk that the publisher faces is that different marking engines produce different copies. One marking engine can produce dark copies. Another might produce copies that look too red. Furthermore, marking engines change over time. As such, the marking engines must be calibrated so that they all produce similar copies all of the time.
FIG. 1, labeled as prior art, illustrates producing a tone reproduction curve 108 for a marking engine 102. A storage device 101 stores a calibration patch pattern in the form of data. A calibration patch pattern is a collection of calibration patches. Every calibration patch has a desired color and the desired colors 107 are also stored by the storage device 101. Every color, including black and shades of gray, can be characterized by its reflectance. A marking engine 102 accepts the calibration patch pattern and prints a target patch pattern 103. A target patch pattern 103 contains a number of target patches 104 with each target patch 104 corresponding to a calibration patch.
A reflectance measuring device 105, such as that disclosed in U.S. Pat. No. 6,384,918, can measure the target patch pattern 103. Every target patch 104 has a reflectance and the reflectance measuring device 105 can measure those reflectances. The measured reflectances are the target colors 108. Target colors 108 and desired colors 107 can be utilized by a processor 106 to produce control points 107. A processor 106 can also use the control points 110 to produce a tone reproduction curve 111. The tone reproduction curve 111 can then be stored on a storage device 109.
FIG. 2, labeled as prior art, illustrates one possible target patch pattern 201. There are ten different target patches in the illustrated target patch pattern 201. The black patch 202 is the patch that is most saturated with black ink or toner. The 90% patch 203 is supposed to be 90% as dark as the black patch 202. The 10% patch 204 is supposed to be 10% as dark as the black patch 202. The paper outside of and between the patches can be measured to find the color of unpatterned substrate. The target patch pattern of FIG. 2 uses only black ink. Other target patch patterns use produced with cyan, magenta, and yellow inks as well.
FIG. 3, labeled as prior art, illustrates a TRC 300. TRCs can be used to adjust the amount of ink a marking engine uses to produce a color. The input axis 301 and the output axis 302 are both shown to have values ranging from 0 to 255. Although other ranges can be used to similar effect, the 0-255 range is used here for illustrative purposes. A value of 0 indicates no ink is to be deposited on the substrate. A value of 255 indicates a maximum amount of ink is to be deposited on the substrate. Values between 0 and 255 indicate intermediate amounts of ink are to be deposited. Without a TRC, a request for 100 yellow results in a corresponding amount of yellow ink. With a TRC, a request for 100 yellow can be mapped to a different amount of ink. In FIG. 3, a value of 100 is input 303. The TRC 300 maps the input to the output. The 100 input 303 is mapped to 107 output 304. The TRC 300 of FIG. 3, can be used to map a request for 100 yellow into a request for 107 yellow.
An example of the usefulness of TRCs is using black ink to produce a shade of gray. Under ideal conditions, the desired gray is made by depositing 70 black. The marking engine used, however, always deposits too little black ink. It deposits 70 black when it is asked to deposit 77 black. A TRC can be used to map the 70 to 77. The request for 70 black becomes a request for 77 black. The marking engine then produces the desired shade of gray by depositing 70 black.
Many marking engines use cyan, magenta, and yellow inks in addition to black ink. Cyan, magenta, and yellow are primary colors when used in marking engines because they can be combined in various proportions to produce an entire gamut of colors. As such, a printed image can be thought of as a combination of a cyan image, a magenta image, a yellow image, and a black image. Each of the images in the combination is also known as a color separation. For example, a calibration patch pattern can have four patches, one each of cyan, magenta, yellow, and black. The magenta color separation would appear as a single magenta patch. Similarly, the black color separation would appear as a single black patch.
Another example of the usefulness of TRCs is using cyan, magenta, yellow, and black inks to produce a process gray. A process gray is a gray that is ideally created by depositing no black ink and equal amounts of cyan, magenta, and yellow inks. Marking engines typically deposit an amount of ink other than that requested. The desired gray in this example is ideally made by depositing 128 cyan, 128 magenta, 128 yellow, and 0 black. The marking engine used, however, deposits 128 cyan when 131 is requested, 128 magenta when 127 is requested, 128 yellow when 130 is requested, and 0 black when 0 is requested. TRCs can adjust the requested amounts so that the marking engine is requested to deposit 131 cyan, 127 magenta, 130 yellow, and 0 black. The marking engine then actually deposits 128 cyan, 128 magenta, 128 yellow, and 0 black to produce the desired process gray.
FIG. 4, labeled as prior art, illustrates a high level flow diagram of a process for obtaining control points. After the start 401, a calibration patch pattern can be obtained from a storage device. As discussed above, every calibration patch has a desired color. Next, the calibration patch pattern can be printed on a substrate to produce a target patch pattern 403. The target colors of the target patches in the target patch pattern can then be measured 404. Control points can be determined from the desired colors and target colors 405 because every target color is associated with desired color through the acts of printing and reflectance measurement. Then the process is done 406.
FIG. 4 illustrates one process flow for determining control points. Control points can be obtained or determined in a variety of other ways. Some of those ways are described in U.S. Pat. No. 6,744,531, United States Patent Application Publication No. 20040136015A1, and United States Patent Application Publication No. 2004136013A1, which are incorporated herein by reference.
FIG. 5, labeled as prior art, illustrates a graph 500 with four control points 501. A curve 502 can be fit to the control points. The curve 502 can be used as a TRC. Fitting the curve 502 to the control points 501 is necessary because there is calibration data for only four points and the curve 502, used as a TRC, must be defined for 255 points.
The curve 502 of FIG. 5 was fit to the control points by a person. Curves can also be fit to control points by curve fitting algorithms. Curve fitting algorithms typically interpolate between the control points and extrapolate, if necessary, to the minimum and maximum values that the curve must include. Current curve fitting algorithms and techniques do not produce adequate TRCs when producing TRCs from calibration data because of contouring.
Contouring is a visible artifact that can detract from a printed image. One example appears in printed images having large areas that appear to be one color or shade, such as a picture with a blue cloudless sky. In reality, there are many subtly different areas that are not apparent to the human eye because the areas blend together. An improper TRC can remove the blending effect so that sharply defined areas of slightly different color become readily apparent to the human eye.
Another example of contouring is an image with a smooth transition between two different shades or colors. An improper TRC can remove the smooth transition and replace it with a series of differently colored bands.
Curve fitting algorithms often yield TRCs that produce contours. A need therefore exists for producing TRCs that do not produce contours.

TRC smoothing algorithm to improve image contours in 1D color controls


An information storage device (10) includes a cartridge (14) which can be removably inserted into a cradle (13) coupled by a cable (12) to a host computer. The cartridge includes an outer housing (54) containing a chamber (122), and having an electrical connector (63) on the exterior. An inner housing (128) contains a hard disk mechanism, and is resiliently supported within the chamber by four resilient elements (131-134). A flex circuit (146) extends from the inner housing to the connector, and permits relative movement of the inner and outer housings. The resilient elements are formed by cutting a cross-shaped part (402) from a foam sheet, cutting two square parts (406-407) from a different foam sheet, adhesively laminating the outer parts to opposite sides of the center part, and then cutting the resulting assembly along two planes to form the four resilient elements.

This invention relates in general to techniques for protecting a hard disk drive mechanism from mechanical shock and, more particularly, to techniques for protecting a hard disk drive mechanism from mechanical shock when the mechanism is disposed in a removable data storage cartridge.
Computer technology has evolved very rapidly over the past twenty-five years. One aspect of this evolution has been a progressively increasing demand for progressively more storage capacity in removable data storage cartridges. For example, floppy disks capable of storing approximately 360 KB of data gave way to floppy disks capable of storing 720 KB, which in turn gave way floppy disks capable of storing approximately 1.44 MB of data.
Thereafter, removable data storage cartridges with still higher storage capacities became commercially available, for example in the form of cartridges available under the tradename ZIP from Iomega Corporation of Roy, Utah, which is the assignee of the present application. ZIP cartridges provide data storage capacities on the order of 100 MB to 250 MB. Still another significant increase in storage capacity was subsequently realized when Iomega introduced removable cartridges under the tradename JAZ, which has storage capacities on the order of 1 GB to 2 GB. Nevertheless, the demand for still greater storage capacity in removable cartridges continues to progressively increase, such that there is a current demand for cartridges capable of storing 5 GB to 20 GB, or even more.
One approach to such a high-capacity cartridge involves the use within the cartridge of a high-capacity hard disk drive mechanism. There are pre-existing removable cartridges which include a sealed hard disk drive mechanism. Such a hard disk drive mechanism typically includes a sealed housing containing not only a rotatable storage medium in the form of a hard disk, but also a motor for rotating the disk, at least one read/write head, and a mechanism for effecting movement of the read/write head relative to and adjacent the disk. While these pre-existing cartridges have been generally adequate for their intended purposes, they have not been satisfactory in all respects.
In this regard, hard disk drive mechanisms are very sensitive to vibration and mechanical shock, and this sensitivity is particularly acute in high-capacity hard disk drive mechanisms. When such a hard disk drive mechanism is incorporated into a removable cartridge, and since a cartridge of this type can be easily dropped whenever it is not inserted into a drive, there is a high potential for significant mechanical shock or vibration that can damage either the read/write head and/or the rotatable disk of the hard disk drive mechanism.
A further consideration is that, in order for any removable data storage cartridge to have a high degree of commercial success, it must be possible to sell it at a relatively low price, which in turn means that it must be possible to fabricate it at a relatively low price. Consequently, any type of structure provided in the cartridge to offer protection from shocks must be relatively inexpensive, one aspect of which is that there must be an efficient and inexpensive way to manufacture that structure.
From the foregoing it may be appreciated that a need has arisen for a technique that provides a data storage mechanism in a removable cartridge with a high level of protection from shock and vibration. According to the present invention, a method and apparatus are provided to address this need, and involve: providing a data storage portion within an inner housing, the inner housing having first and second surface portions on opposite sides of the exterior thereof and having a side surface portion which extends between peripheral edges of the first and second surface portions; locating the inner housing in a chamber within an outer housing; transporting signals that include data between the data storage section and a location external to the outer housing; and resiliently supporting the inner housing within the chamber using a plurality of resilient elements disposed within the chamber. This resilient support of the inner housing involves: positioning the resilient elements at spaced locations along a periphery of the inner housing; configuring each of the resilient elements to include first and second outer portions which are coupled to opposite sides of a center portion; causing the center portion to engage the side surface portion of the inner housing and the first and second outer portions to respectively engage the first and second surface portions of the inner housing; selecting for the center portion a material having a first compression characteristic; selecting for the first outer portion a material having a second compression characteristic different from the first compression characteristic; and selecting for the second outer portion a material having a third compression characteristic different from the first compression characteristic.
It will also be appreciated that, as to structure which provides shock and vibration protection for an inner housing disposed within an outer housing, there is a need for a technique to efficiently and inexpensively fabricate this protective structure. According to a different form of the present invention, a method is provided to address this need, and involves: cutting from a first sheet of resilient material a center part having a plurality of arms projecting outwardly in respective different directions; cutting from a second sheet of resilient material a first outer part; cutting from a third sheet of resilient material a second outer part; adhesively securing the first and second outer parts to opposite sides of the center part to form an assembly, each of the outer parts having portions which project outwardly beyond the center part in the region between each adjacent pair of the arms thereof; cutting the assembly along a plurality of cutting planes to subdivide the assembly into a plurality of resilient elements, the cutting planes each being perpendicular to the planes of lamination between the outer parts and the center part, and each being oriented so that each of the arms of the center part is split in a lengthwise direction into two portions of approximately equal width; and using a set of the resilient elements to resiliently support an inner housing within an outer housing, the resilient elements of the set being disposed at spaced locations along a periphery of the inner housing.

Method and apparatus for protecting a hard disk drive from shock


Real space image including a simple prototype created based on three-dimensional CAD data is captured by an image input apparatus. A position/orientation measuring apparatus measures positions and orientations of the image input apparatus and simple prototype. An information processor captures position/orientation information representing the position and orientation of the simple prototype in the image captured by the image input apparatus 102. The information processor further extracts a hand area from an image, renders a three-dimensional computer graphic image on the simple prototype, excluding the extracted hand area, in the image based on the position/orientation information and the three-dimensional CAD data, and synthesizes the image and the three-dimensional computer graphic image. Here, the simple prototype has a different color from a color of the hand area.

1. Field of the Invention
The present invention relates to an image display system and image display method for providing an observer with virtual space image information over real space image information at a given viewpoint.
2. Description of the Related Art
Hitherto, a mixed reality system provides a user with a synthesized image by merging a real space image and a virtual space image created in accordance with a user's viewpoint and a user's viewing direction. A mixed reality system disclosed in Japanese Patent Laid-Open No. 11-136706 can provide an observer with a feeling that a virtual object actually exists in a real space such that the user can perform more real observation with a sense of actual size than a conventional virtual reality system (VR system).
On the other hand, designing forms and creating designs using a three-dimensional CAD (which will be called 3D-CAD) are going mainstream so far in design/manufacturing fields. The predominant methods for evaluating an object designed by a 3D-CAD includes a method for visually evaluating data (solid data) created by a 3D-CAD, which is displayed on a screen of a computer as three-dimensional computer graphics (called 3D-CD, hereinafter) and a method for creating a simple prototype (simple mock-up) by using a rapid prototyping apparatus for visual and tactile evaluation.
However, the method in which 3D-CAD data is displayed as 3D-CG on a screen of a computer can provide evaluation in a virtual space but cannot provide evaluation of an object in a real space with a sense of actual size. The method in which a simple prototype (simple mock-up) is created by using a rapid prototyping apparatus is effective for recognizing a rough form but does not reconstruct detail information, such as design and/or form details and colors, designed under 3D-CAD, due to limitations in processing accuracy, material and so on. Therefore, a method for evaluating design data in a more finished form has been demanded.

Image display method and image display system