Disclosed is a window housing for use in combination with a transducer style thru-hull fitting. The window housing is sealingly attached to the thru-hull fitting by use of a first securement cap. The window housing having a window panel positioned adjacent to the outer side surface of the vessel hull. A tubular shaped light assembly preferably housing LED's may be inserted into the window housing and secured thereto by the use of a second securement cap. Alternatively a tubular shaped camera assembly may be inserted into the window housing and secured thereto by the use of a second securement cap.

The use of thru-hull is well known. A conventional thru-hull vessel fitting provides an aperture through a side wall of a vessel hull. Current boating techniques require numerous thru-hull fittings above and below the water line. Fitting above the water line include cockpit draining, gray water drains for faucet and showers, anchor closet drains, AC cooling water drains, fish box drains, bilge pump drains and so forth. Thru-hull fittings below the water line are use for main engine cooling intakes, generator engine cooling intakes, air conditioning intakes, head water intakes, fish live well intakes, raw water wash-down intakes, and so forth. Further, conventional thru-hull fitting are used to support electronic devices such a depth and speed transducers.
A conventional transducer thru-hull fitting consists of an externally threaded pipe having a generally smooth inner surface. One end of the threaded pipe includes a flange fitting for securement to the vessel hull, or includes an tapered end if a flush attachment is desired. The flanges are bonded to the vessel by use of an adhesive/sealer, such as 3M 5200, wherein the threaded pipe is permanently mounted at an angle substantially perpendicular to the outer surface of the vessel hull. The inner surface of the pipe provides an open aperture allowing the ingress of water. An electric transducer is place within the aperture providing an uninterrupted access to the water.
The instant inventor employed the use of conventional transducer style thru-hulls fittings for securement of underwater cameras such as that disclosed in U.S. Pat. Nos. 6,100,921 and 6,115,060 the contents of which are incorporated herein by reference.
The use of underwater light is also well known. Underwater lighting is commonly used to attach fish but has also provided entertainment for those that frequent the water, especially pleasure boaters. It is now very common to find lights attached to the hull of a boat for use in illuminating the water while a boat is docked in a marina. The illumination of the water enhancing the safety around the boat, as well as providing entertainment as the lights attach a wide variety of fish.
Current underwater lighting devices employ that are secured to a vessel hull are extremely expensive, primarily due to the speciality thru-hull fitting that is employed. The speciality thru-hull fitting must prevent water entry yet provide an unobstructed window for passage of light from a halogen lamp, Light Emitting Diode (LED) or any other type of lighting element employed.
U.S. Pat. No. 7,044,623 discloses an underwater light requiring a specialty thru-hull vessel fitting. The fitting includes a flange placed on the outside of the vessel hull and an inner flange having a jacking plate. A jacking ring is used to squeeze the hull between the flanges. A window panel is permanently with the outer flange. If the window panel is scratched, breached, or damaged in any manner, replacement of the entire thru-hull is required.
A problem current with underwater lights is not only the cost of manufacturing the speciality housing, but the cost for repairing a speciality thru-hull fitting should any damage occur to the window panel. The window panel on current underwater lights is exposed to the elements at all times. Growth can cover the window requiring a diver to enter the water for cleaning. Entering the water at night, when it is cold, or when the conditions are less than ideal is typically avoided which leads to poor lighting situations.
Even if a diver is used to clean an underwater light having a permanently mounted window, improper handling can quickly damage the current window panels. Divers commonly use paint scrapers to remove barnacles, and sanding pads to reactivate vessel bottoms painted with an ablative paint. Should the diver be careless, the current underwater light housing will be damaged and the boat removed from the water for repair of the damaged window panel. The time and expense associated with lifting a large vessel out the water can add thousands of dollars to the cost of replacement.
Thus, what is needed in the industry is an inexpensive window housing that accepts lighting elements or cameras, and provides a means for servicing of the window housing without removing the vessel from the water.

Window housing for use with thru-hull fittings


A pneumatic tire has: a circumferential groove on each side of the tire equator; oblique grooves extending from the circumferential groove while inclining to one circumferential direction; and lug grooves extending axially outwardly beyond the tread edges from positions axially outside the circumferential groove while inclining to the one circumferential direction. The lug grooves include: a first lug groove comprising an axially inner steeply-inclined part and an axially outer mildly-inclined part; and a second lug groove extending along the mildly-inclined part. The axially inner end of the first lug groove is at a distance La of 8 to 12% of the tread width from the circumferential groove. The steeply-inclined part inclines at an angle larger than an inclination angle of the oblique grooves.

The present invention relates to a pneumatic tire, more particularly to a tread pattern capable of improving high-speed running performance, especially steering stability during running in a racing circuit, as well as wet performance.
Japanese Patent Application Publication No. 2009-101785 discloses a pneumatic tire having a tread pattern shown in FIG. 5, wherein a circumferential groove (a) is disposed on each side of the tire equator Co, and main oblique grooves (b) and auxiliary oblique grooves (c) are disposed axially outside the circumferential groove (a) and arranged alternately in the tire circumferential direction. The main oblique groove (b) and auxiliary oblique groove (c) each have an axially outer end positioned axially outside the tread edge E1.
The axially inner end of the auxiliary oblique groove (c) is located far from the circumferential groove (a), but the axially inner end of the main oblique groove (b) is located very close to the circumferential groove (a).
As a result, the land portion (d) between the circumferential groove (a) and tread edge E1 is considered as being circumferentially divided into blocks (f) in practice.
Since the axially inner part (b1) of the main oblique groove (b) is steeply inclined with respect to the axial direction, the block (f) has a narrow-angled part (fe) between the circumferential groove (a) and the steeply-inclined inner part (b1).
Therefore, it is difficult to increase the rigidity of the land portion (d) to a sufficiently high level to further improve the dry grip performance.
Thus, there is room for improvement in high-speed running performance, especially steering stability during running in a circuit.
As to the wet performance, on the other hand, since the axially inner end of the main oblique groove (b) is not opened to the circumferential groove (a), there is room for improvement in the drainage.


There is provided a communication system that includes a vehicle and a mobile device, and a method uses that system to provide vehicle owner's manual information. The method includes the steps of: receiving a digital image of a portion of a vehicle; identifying an object of the vehicle in the digital image; associating the object with at least one reference object image stored in an object library comprising a plurality of reference object images; displaying owner's manual information based on the association; and storing at least a portion of the digital image in the object library as a new reference object image for future identifications.

Vehicles today are offering an increasing number of user-selectable functions, particularly for the driver. Historically, information concerning these selectable functions has been provided in an owner's manual typically carried in the vehicle glove compartment. More recently, the use of a camera-enabled Smartphone or tablet has been proposed for use in providing such information. eKurzinfo™ is one such system for which there is a publicly-available video clip illustrating its functionality.
In such a system, when a vehicle user is unfamiliar with a button or control, the user may use a camera device in the Smartphone or tablet and film the particular button or control. Information regarding the button then may be provided using the Smartphone's or tablet's display. In addition, the Smartphone or tablet may be used to assist in performing a maintenance routine (such as filling the coolant).

Providing vehicle owner's manual information using object recognition in a mobile device


A method for transmitting a sequence of data blocks of equal length includes obtaining part of a matrix for the impulse response function of a communication channel between a transmitter and a receiver. The part relating to channel-induced interference between sampling intervals of adjacent ones of the data blocks. The method includes designing a set of one or more linearly independent waveforms based on the obtained part of the matrix for the impulse response function and transmitting a sequence of the data blocks over the channel from the transmitter to the receiver. Each data block of the sequence is a weighted linear superposition of the one or more waveforms of the designed set.

1. Field of the Invention
The invention relates generally to data communications and, more particularly, to reducing inter-symbol interference in data communications.
2. Discussion of the Related Art
This section is intended to introduce aspects that may be helpful to facilitating a better understanding of aspects of the invention. Accordingly, statements of this section are to be read in this light and are not to be understood as admissions about the scope of the prior art.
Data communication schemes have handled inter-symbol interference (ISI) by a variety of techniques. One such technique is known as orthogonal frequency division multiplexing (OFDM). OFDM uses modulation waveforms that enable the essential removal of ISI in a frequency-dependent channel.
In OFDM, each transmitted data block is a weighted superposition of OFDM modulation waveforms. The OFDM modulation waveforms form an orthonormal basis set over a time period (TS-Tg) where TS is the length of the OFDM block and Tg is the duration of either a guard interval or a cyclic prefix. The communication channel has a delay spread TD that is the length of a communication channel's memory. Since ISI does not distort symbols separated by the communication channel's delay-spread, Tg is selected to be greater than or equal to TD in OFDM. In an OFDM block, the weights of the superposition define the data symbol being transmitted.
In OFDM, each transmitted data block is demodulated by projecting the received data block onto a basis set of conjugate OFDM modulation waveforms. Since the OFDM modulation waveforms are a basis set over the interval (TS-Tg), the projections may be performed over the last (TS-Tg) of the OFDM data blocks. That is, the projections do not need to use prefix portions of the OFDM data blocks. Since the channel memory is limited to a time of length TD, an earlier transmitted OFDM block substantially only produces ISI in the cyclic prefix or guard portion of the next received OFDM data block. Thus, by ignoring said cyclic prefix or guard portions of received OFDM data blocks, OFDM produces demodulated data that is substantially free of distortion due to ISI. OFDM techniques may also effectively diagonalize the communication channel.
Unfortunately, cyclic prefix and guard portions of OFDM data blocks consume bandwidth that might otherwise be used to transmit data. As the communication channel's delay-spread approaches the temporal length of the OFDM data block, the bandwidth remaining for carrying data shrinks to zero. Thus, OFDM communication schemes would not be expected to be bandwidth-efficient in communication channels whose delay-spreads approach the length of the OFDM data blocks.


To prevent electric charge up from being accumulated on the plane scanned by an electron beam and further to improve the S/N ratio, an electron beam irradiating apparatus comprising: position information signal outputting section for outputting position information signals, in sequence to designate positions at which an electron beam is irradiated on a plane scanned by the electron beam, so as to designate the irradiation positions at random; and irradiation controller for controlling the electron beam to irradiate the electron beam at the irradiation positions in response to the outputted position information signals. Further, to integrate an photoelectric signal over a sufficient time interval within the period of the pixel clock signal, the electric signal detecting circuit comprises a plurality of sample hold circuits and a selecting circuit for selecting and activating the sample hold circuits in sequence.

1. Field of the Invention
The present invention relates to an electron beam irradiating apparatus, and specifically to an electron beam irradiating apparatus which can irradiate an electron beam upon a plane scanned by an electron beam, by designating electron beam irradiation positions. Further, the present invention relates to an electric signal detecting apparatus incorporated in the electron beam irradiating apparatus, and more specifically to the detecting apparatus for generating a video signal in response to a photoelectric signal generated by the electron beam irradiating apparatus.
2. Description of the Prior Art
In the semiconductor manufacturing process for instance, the microstructure of a semiconductor sample is observed with the use of an electron beam irradiating apparatus such as an electron microscope, for instance.
In the prior art electron beam irradiating apparatus, a saw-tooth waveform signal referred to as a horizontal scanning signal and a vertical scanning signal is applied to a scanning coil to scan irradiation positions on a scanning plane in sequence continuously. Further, a horizontal blanking signal is applied to the scanning coil to return the electron beam to the start position for each scanning line. Additionally, whenever all the scanning operation ends once on one scanning plane, a vertical blanking signal is applied to the scanning coil, so that the same area can be irradiated with the electron beam repeatedly.
In the case where the semiconductor sample is observed in the semiconductor manufacturing process, the surface of the semiconductor sample is usually formed of an insulating substance such as photoresist. Therefore, when the sample as described above is continuously irradiated with the electron beam of the prior art electron microscope, there arises a problem in that the sample is charged up electrically because the conductive path of the irradiated electrons is small and narrow.
Once this charge-up phenomenon exists, since the irradiation direction of the electron beam applied upon the sample is distorted by the electric charge, an object to be observed by the electron microscope cannot be accurately photographed, or noise is superposed upon the object detection signals.
To reduce the electric charge accumulated on the sample, various countermeasures have been so far proposed, for instance such that the voltage for accelerating the electron beam is lowered (low voltage method); the electron density is reduced (low doze method); the scanning speed is increased (high speed scanning method), etc. In the above-mentioned prior art methods, however, it is still extremely difficult to hold all over the scanned sample surface in an equipotential level.
One of the major reasons is that in the prior art electron beam irradiating apparatus, the line scanning is repeated, except a special case as in an automatic focusing operation. In this repeated line scanning operation, as far as the conductive sample is being scanned, there exists no specific problem. However, when the insulating sample is being scanned repeatedly, the electric charge up increases in proportion to the number of repeated scanning operation. When the scanning width is as narrow as several pixels in particular, the charged electrons can be well discharged, so that the electric charge is not accumulated, in the case of where the scanning width extends to about 50 pixels, with the result that it becomes difficult to observe the sample of insulating material.
Further, in the prior art electric signal detecting apparatus incorporated in the electron beam irradiating apparatus, when the electric signal such as photoelectric signals are integrated by the sample hold circuit in response to the pixel clock signal of the video signal within the period of the clock signal, since the number of the sample hold circuit is only one, there exists a problem in that it is impossible to integrate the photoelectric signal over a sufficient time interval within the period of the clock signal, because the same sample hold circuit must respond to the succeeding clock signal.

Electron beam irradiating apparatus and electric signal detecting apparatus


A mounting assembly includes a base; a post extending from the base, the post defining a vertical axis; a beam mounted on the post and being pivotable about the vertical axis, the beam comprising a first portion extending in a first horizontal direction and terminating in a first end, and a second portion extending in a second horizontal direction opposite of the first direction and terminating in a second end; an equipment mounting bracket at the first end; a latch along the beam and having an engaged position and release position, wherein in the engaged position the latch prevents the beam from pivoting; and a latch release along the second portion of the beam. A method of accessing equipment mounted on the mounting assembly includes actuating the latch release such that the latch moves from the engaged position to the release position; and rotating the beam about the vertical axis.

Equipment, such as security cameras, lights, etc., may be mounted on rooftops for convenience. In order to reach over areas adjacent buildings, such equipment is typically mounted at the very edge of the roof. However, mounting and servicing such equipment provides unique challenges, particularly when mounted on a flat rooftop. Flat rooftops are susceptible to leaks, and penetration of the rooftop surface material is not desired. Further, while flat rooftops may be easily accessed, the need to mount equipment near or on the edge of the roof poses safety concerns when the equipment is being mounted or serviced.
Existing rooftop mounting systems are subject to flexing and vibrations, which may be problematic with the use of a security camera. Existing systems may also risk puncturing or wearing out the rooftop surface material due to non-ideal weight distribution. Further, existing systems with a pivoting mounting arm may still require service personnel to reach areas at or near the edge of the roof to be able to release and/or pivot the mounting arm to a service position.
There is a need for a mounting assembly that can be mounted on flat rooftops without perforating, puncturing, or otherwise damaging the rooftop surface material. There is further a need for a mounting assembly that can be used to mount equipment at, near, or even over the edge of a rooftop while allowing the mounted equipment to be positioned for safe servicing.


A method of real-time processing of network events, wherein an event comprises a plurality of attributes. The method comprises maintaining counters, including counters indicating numbers of occurrences and co-occurrences of instances of specific attributes of received network events, maintaining a record of instances of specific attributes of recent events, receiving a first event, increasing respective counters based on the instances of attributes of the first event. The method further comprises calculating relation measure scores between a first instance of the first attribute of the first event and instances of the first attribute of events recently received. The relation measure score depends on a number of co-occurrences in which the first instance of the first attribute and a second instance of the first attribute were received within the measurement window, the total number of occurrences of the first instance and the total number of occurrences of the second instance. The method also comprises identifying a group of events as related based on their relation measure scores and creating incident information based on the identified group of events.

Network events in network management contain information related to network problems, configuration changes, time information and performance characteristics, network status information, etc. Alarms and CM (configuration management) events are examples of network management events. They provide important information for network operators to monitor and control network services. However, a major problem of current network management systems is that, the amount of events/alarms received is far too big for human operators to handle. With the increasing size of the networks (more network nodes deployed in the field), new services being added the scale of this problem is becoming exponential in its nature. The flow of events information received by network management systems is constantly growing and processing those takes time, whereas it is important that, at least some of these events, are handled with minimum delay.
Filtering functions known in the art are generally offered by current management to handle flood of network events. Different filter rules, such as frequency-based filters and threshold based filters can be defined by network operators to reduce number of events that need to be processed. There are some major problems with this approach. It requires defining manually expert rules for the filters to work. It is not flexible and adaptive. Networks are constantly changing, for example their topologies and configurations. The static expert rules are not adaptive and do not respond to network dynamics. For example, if a new alarm is added to the network after network configuration, a filter rule must be manually updated if the network operator wants to capture these newly added alarms.
A more advanced approach known in the art uses machine learning clustering techniques to group alarms to improve their handling efficiency. In these solutions alarms are represented as data vectors. The system computes distances between vectors and then puts alarms with distance between each other below a threshold into a single cluster. Various clustering techniques can be used, for example k-means algorithm. However, there are some limitations with this approach too. Firstly, it is difficult to transform alarms to data vectors for distance computation, especially for text attribute values of alarms. It involves complex natural language processing. For example, it is difficult to give distances between these text values, such as "ss7Mtpl1LossOfSignal" "Active Function Failed" and "RADIUS Accounting Server Switched". Secondly, these systems do not support real-time alarm groups or clusters updating. Alarms and events are continuously arriving in real-time, existing alarms groups needed to be updated for new arrivals. However, these systems only can create brand new set of clusters for new arriving alarms or re-computing whole alarm data set again. Creating brand new clusters for new alarms means that network operators have to deal with multiple alarm clusters related to a same existing network problem. Re-computing the whole alarm data set again is computationally expensive and fails to deliver results in real-time

Method and device for real-time network event processing


An equation transforming unit triangular transforms a matrix M and a vector v to generate a matrix M′ and a vector v′ for a system of linear equations M′x=v′ in n unknowns that has an equivalence relation with a system of linear equations Mx=v in n unknowns. The triangular transformation is such that the matrix M is transformed into an upper triangular matrix without the diagonal elements of the matrix M being changed to 1. An inverting unit calculates the inverses of the diagonal elements of the matrix M′. An equation computing unit finds the solutions of the system of linear equations M′x=v′ using the matrix M′, the vector v′, and the calculated inverses of the diagonal elements. An inverse computing unit computes the inverse I of an element y in GF(q) which is an extension field of a finite field GF(p), based on the solutions found by the equation computing unit.

1. Field of the Invention
The present invention relates to cryptographic and error correction techniques for information security, and in particular relates to computation techniques which use extension fields and systems of equations.
2. Description of the Prior Art
Secret communication or digital signature techniques have increasingly been used in data communication in recent years.
Secret communication techniques allow communication to be performed without the communicated content being revealed to third parties. Digital signature techniques, meanwhile, enable the recipient to verify whether the communicated content is valid or whether the information is from the stated sender. Such secret communication or digital signature techniques use a cryptosystem called public key cryptography. Public key cryptography provides a convenient method for managing the separate encryption keys of many users, and so has become a fundamental technique for performing communication with a large number of users.
In the public key cryptography, different keys are used for encryption and decryption, with the decryption key being kept secret and the encryption key being made public. Here, one of the founding principles for the security of public key cryptography is the so-called discrete logarithm problem. Representative examples of the discrete logarithm problem are problems based on finite fields and problems based on elliptic curves. Such problems are described in detail in Neal Koblitz (1987), A Course in Number Theory and Cryptography, Springer-Verlag.
(Elliptic Curve Discrete Logarithm Problem)
The elliptic curve discrete logarithm problem is the following.
Let E be an elliptic curve defined over a finite field GF(q) (q=pn, p a prime, n a positive integer), with a point G on the elliptic curve E, given when the order of E is divisible by a large prime, being set as a base point. This being so, the problem is to find an integer x such thatY=x*G                 where Y is a given point on E, if such an integer x exists.
In this specification, the operator * represents elliptic curve exponentiation, so that x*G means G is added to itself x times on E. Also, GF(q) is an extension field of a finite field GF(p). For details about extension fields, see T. Okamoto & H. Yamamoto (1997), Modern Encryption, Mathematics of Information Sciences Series, Sangyo Tosho, pp. 26–28.
(Prior Art 1: ElGamal Signature Scheme which Uses the Elliptic Curve Discrete Logarithm Problem)
The ElGamal signature scheme using the elliptic curve discrete logarithm problem is described below with reference to FIG. 9.
In the figure, a device 310 used by a user A (hereafter, "user A 310"), a management center 320, and a device 330 used by a user B (hereafter, "user B 330") are connected via a network.
Let p be a prime, q=pn, n be a positive integer, and E be an elliptic curve over a finite field GF(q), with G being a base point of E and r being the order of G. Which is to say, r is the smallest positive integer that satisfiesr*G=0                where 0 is the zero element in the additive group on the elliptic curve E.(1) Public Key Generation by the Management Center 320
First, the management center 320 generates a public key YA of the user A 310 using the user A's secret key xA which has been informed beforehand, according to the equationYA=xA*G                 (S1, S2).
The management center 320 announces the finite field GF(q), the elliptic curve E, and the base point G as system parameters, and reveals the public key YA of the user A 310 to the user B 330 (S3, S4).
(2) Signature Generation by the User A 310
The user A 310 generates a random number k (S5), calculatesR1=(rx,ry)=k*G                 (S6), and finds s satisfyings×k=m+rx×xAmod r         (S7) where m is a message to be sent from the user A 310 to the user B 330.
The user A 310 sends the message m and the signature (R1,s) to the user B 330 (S8).
(3) Signature Verification by the User B 330
The user B 330 verifies the authenticity of the user A 310 by judging whethers*R1=m*G+rx*YA                 is true (S9).
This equation is derived from
                              s          *                      R            1                          =                              [                                          (                                                      (                                          m                      +                                                                        r                          x                                                ×                                                  x                          A                                                                                )                                    /                  k                                )                            ×              k                        ]                    *          G                                        =                              (                          m              +                                                r                  x                                ×                                  x                  A                                                      )                    *          G                                        =                              m            *            G                    +                                    (                                                r                  x                                ×                                  x                  A                                            )                        *            G                                                  =                              m            *            G                    +                                    r              x                        *                          Y              A
In this ElGamal digital signature scheme using the elliptic curve discrete logarithm problem, elliptic curve exponentiation is repeatedly performed to generate the public key and the signature and to verify the signature.
For details on elliptic curve exponentiation, see "Efficient Elliptic Curve Exponentiation" in Miyaji, Ono & Cohen (1997), Advances in Cryptology-Proceedings of ICICS'97, Lecture Notes in Computer Science, Springer-Verlag, pp. 282–290 (hereafter "document 1").
Let an elliptic curve be defined by an equation of the formy2=x3+a×x+b                 with some point P on the elliptic curve being represented by 2-tuple coordinates (x1,y1) called affine coordinates.
Elliptic curve exponentiation in the 2-tuple coordinate is known to involve inverse operations on the finite field GF(q).
Document 1 makes brief mention of a 3-tuple coordinate called projective coordinate. 2-tuple coordinates can be transformed into corresponding 3-tuple coordinates as shown by(x1,y1)→(x1,y1,1)
Elliptic curve exponentiation in the 3-tuple coordinate involves no inverse operations on the finite field GF(q). Since inverting a finite field element generally takes considerable computation time, the 3-tuple coordinate is often used in elliptic curve exponentiation.
However, when transforming 3-tuple coordinates into corresponding 2-tuple coordinates as shown by(X,Y,Z)→(X/Z, Y/Z)                inversion on the finite field GF(q) is necessary.
In step S6 in FIG. 9, for instance, after 2-tuple coordinates are transformed into 3-tuple coordinates, elliptic curve exponentiation is performed on the 3-tuple coordinates, and the resulting 3-tuple coordinates are transformed into corresponding 2-tuple coordinates. Inversion is needed in this transformation of the 3-tuple coordinates to the 2-tuple coordinates.
(Prior Art 2: Inversion in an Extension Field)
A conventional inverse operation on an extension field GF(q) (q=pn, p a prime, n a positive integer) is performed in the following way.
For simplicity's sake, a generator polynomial of the extension field GF(q) is set as f(g)=gn−β whose root is α, and an element of GF(q) to be inputted in the generator polynomial is set asx=x0+x1×α+ . . . +xn−1×αn−1 (1) Step 1
Based on the element x of GF(q), a system of equations for yi (i=0, 1, . . . , n−1)
                              x          0                                  y          0                    +              β                                                            x                      n            -            1                                            y          1                    +              β                                                            x                      n            -            2                                            y          2                    +      …      +              β                                                            x          1                                  y                      n            -            1                                =    1                                x          1                                  y          0                    +                                                  x          0                                  y          1                    +              β                                                            x                      n            -            1                                            y          2                    +      …      +              β                                                            x          2                                  y                      n            -            1                                =    0                                x          2                                  y          0                    +                                                  x          1                                  y          1                    +                                                  x          0                                  y          2                    +      …      +              β                                                            x          3                                  y                      n            -            1                                =    0    ⋮                              x                      n            -            2                                            y          0                    +                        x                      n            -            3                                            y          1                    +                        x                      n            -            4                                            y          2                    +      …      +              β                                                            x                      n            -            1                                            y                      n            -            1                                =    0                                x                      n            -            1                                            y          0                    +                        x                      n            -            2                                            y          1                    +                        x                      n            -            3                                            y          2                    +      …      +                        x          0                                  y                      n            -            1                                =    0                  is formed.(2) Step 2
The solutions yk (k=0,1, . . . ,n−1) of the system of equations are sought.
(3) Step 3
From the solutions yk (k=0,1, . . . ,n−1), the inverseI=y0+y1α+ . . . yn−1αn−1                 is calculated. Hence the inverse of the element x in the extension field GF(q) is obtained.
The validity of this inverse operation is shown below.
If the inverse I and the element x satisfy the relationshipxI=1 mod f(g)                then
                    xI        =                                                            x              0                                                  (                                                y                  0                                +                                                      y                    1                                                      α                                +                …                +                                                      y                                          n                      -                      1                                                                                α                                          n                      -                      1                                                                                )                                +                                                                                x              1                                                  α                                            (                                                      y                    0                                    +                                                            y                      1                                                            α                                    +                  …                  +                                                            y                                              n                        -                        1                                                                                α                                              n                        -                        1                                                                                )                                              +                                                                                x                2                                                                            α                  2                                                                  (                                                            y                      0                                        +                                                                  y                        1                                                                  α                                        +                    …                    +                                                                  y                                                  n                          -                          1                                                                                α                                                  n                          -                          1                                                                                )                                                      +                                                              ⋮                                                                                x                              n                -                1                                                                                α                                  n                  -                  1                                                                          (                                                      y                    0                                    +                                                            y                      1                                                            α                                    +                  …                  +                                                            y                                              n                        -                        1                                                                                α                                              n                        -                        1                                                                                )                                                                        and alsoαnβmod f(g)
Accordingly,
                    xI        =                                                            x              0                                                  (                                                y                  0                                +                                                      y                    1                                                      α                                +                …                +                                                      y                                          n                      -                      1                                                                                α                                          n                      -                      1                                                                                )                                +                                                                                x              1                                                  (                                                                    y                    0                                                      α                                +                                                      y                    1                                                                          α                    2                                                  +                …                +                                                      y                                          n                      -                      1                                                                          β                                            )                                +                                                                                x              2                                                  (                                                                    y                    0                                                                          α                    2                                                  +                                                      y                    1                                                                          α                    3                                                  +                …                +                                                      y                                          n                      -                      1                                                                          αβ                                            )                                +                                                        ⋮                                                                      x                          n              -              1                                                      (                                                            y                  0                                                                  α                                      n                    -                    1                                                              +                                                y                  1                                                β                            +              …              +                                                y                                      n                    -                    1                                                                                α                                      n                    -                    2                                                                  β                                      )                                              which can be rearranged in ascending order of power of α into
                    xI        =                                                            x              0                                                  y              0                                +                      β            ×                          x                              n                -                1                                      ×                                                                            y              1                                +          …          +                      β                                                                                x              1                                                  y                              n                -                1                                              +                                                                              α                                      (                                                                    x                    1                                                                          y                    0                                                  +                                                      x                    0                                    ×                                      y                    1                                                  +                …                +                                                      βx                    2                                                                          y                                          n                      -                      1                                                                                )                                +                                                                                α              2                                                  (                                                                    x                    2                                                                          y                    0                                                  +                                                      x                    1                                                                          y                    1                                                  +                …                +                                  β                                                                                x                    3                                                                          y                                          n                      -                      1                                                                                )                                +                                                        ⋮                                                                      α                          n              -              1                                                      (                                                            x                                      n                    -                    1                                                                                y                  0                                            +                                                x                                      n                    -                    2                                                                                y                  1                                            +              …              +                                                x                  0                                                                  y                                      n                    -                    1                                                                        )
From this equation and the relationship xI=1, the system of equations in step 1 is derived.
Therefore, calculating an inverse in the extension field GF(q) is equivalent to solving a system of equations on the basic field GF(p).
Though the foregoing example uses the generator polynomial of the form gn−β for simplicity's sake, a system of equations can be formed by the same procedure for a generator polynomial of ordinary form.
(Prior Art 3: Solution of a System of Equations on the Basic Field GF(p))
A conventional method for solving a system of equations on the basic field GF(p) is described below. This method is called Gaussian elimination. For details on Gaussian elimination, see K. Mizugami (1985), Mathematical Calculations by Computers, Introduction to Programming Series, Asakura Shoten, pp. 76˜82 (hereafter "document 2").
A system of equations for xk (k=0, 1, 2, . . . , n−1)
                                                        a              11                                                  x              0                                +                                    a              12                                                  x              1                                +          …          +                                    a                              1                                n                                                                x                              n                -                1                                                    =                  b          1                                                                            a              21                                                  x              0                                +                                    a              22                                                  x              1                                +          …          +                                    a                              2                                n                                                                x                              n                -                1                                                    =                  b          2                                        ⋮                                                                                a              n1                                                  x              0                                +                                    a              n2                                                  x              1                                +          …          +                                    a              nn                                                  x                              n                -                1                                                    =                  b          n                                    is solved by Gaussian elimination in the following manner.(Step 1)
A matrix M and a vector v are given respectively as
      M    =          (                                                  a              11                                                          a              12                                            …                                              a                              1                                n                                                                                a              21                                                          a              22                                            …                                              a                              2                                n                                                                          ⋮                                ⋮                                ⋮                                ⋮                                                              a              n1                                                          a              n2                                            …                                              a              nn                                          )            v    =          (                                                  b              1                                                                          b              2                                                            ⋮                                                              b              n                                          )
Meanwhile, a vector X is given as
  X  =      (                                        x            0                                                            x            1                                                •                                      •                                                  x                          n              -              1                                            )
Then the above system of equations can be simply written asMX=v
The matrix M an d the vector v are triangular transformed so as to put the matrix M into upper triangular form, as a result of which a matrix M′ and a vector v′ are generated. Here, the triangular transformation is such a transformation that changes all elements beneath the diagonal elements of a matrix to 0, and such a transformed matrix is called an upper triangular matrix.
The procedure of this conventional triangular transformation is explained below with reference to FIG. 10.
First, counter j is set at 1 (S21). Next, the inverse Ij of ajj is computed (S22), 1 is assigned to ajj (S23), and ajk=ajk×Ij and bj=bj×Ij are set for j+1≦k≦n (S24). Then counter i is set at j+1 (S25).
Following this, 0 is assigned to aij (S26), aik=aik−ajj×ajk is set for j+1≦k≦n (S27), and also bi=bi−aij×bj is set (S28). Then it is judged whether i=n (S29). If i≠n, counter i is incremented by 1 (S31) and the procedure returns to step S26. If i=n, it is judged whether j=n (S30). If j≠n, counter j is incremented by 1 and the procedure returns to step S22. If j=n, the procedure ends.
As a result, the matrix M′ and the vector v′ are obtained. The matrix M′ is a matrix whose diagonal elements are all 1 and whose elements beneath the diagonal elements are all 0.
The system of equations M′X=v′ and the system of equations MX=v have an equivalence relation.
Let the matrix M′ and the vector v′ be written respectively as
            M      ′        =          (                                                  c              11                                                          c              12                                            …                                              c                              1                                n                                                                                c              21                                                          c              22                                            …                                              c                              2                                n                                                                          •                                •                                •                                •                                                •                                •                                •                                •                                                              c              n1                                                          c              n2                                            …                                              c              nn                                          )                  v      ′        =          (                                                  d              1                                                                          d              2                                                            •                                                •                                                              d              n                                          )      (Step 2)
The system of equations M′X=v′ is solved using the generated matrix M′ and vector v′, in the following way.
The values n−1, . . . , 1, 0 are set one by one in counter c in this order. For counter c,yc=dc+1                 is calculated when c=n−1, and
      y    c    =            d              c        +        1              -                  ∑                  i          =                      c            +            1                                    n          -          1                                  (                              c                          c              +                              1                                                                                i                            +              1                                ×                      y                          i              -              1                                      )                            is calculated when c≠n−1.

Apparatus for solving system of equations on finite field and apparatus for inverting element of extension field

Matsushita Electric Industrial Co., Ltd.


A scanning system driving device capable of quickly and gently starting a scanning system. This driving device includes an electromagnetic clutch for forward rotation, for transmitting a driving force from a driving source to a moving body for an optical system, and a control circuit for controlling the application of a voltage to the electromagnetic clutch. The control circuit applies a rated voltage in the form of pulses to the electromagnetic clutch at intervals of such OFF time that the moving speed of the moving body is reduced once when the illumination and the scanning of a document by the moving body are started.

1. Field of the Invention
The present invention relates generally to a scanning system driving device used in an image forming apparatus, having a scanning system for illuminating and scanning a document, such as a copying machine or an image scanner, and more particularly, to an improvement in transmission control of a driving force of the scanning system driving device.
As a scanning system provided for a copying machine or the like, there are two types of scanning systems: a scanning system in which an optical system is moved relative to a still document, and a scanning system in which a document platen is moved relative to a still optical system. In this specification, the term "scanning system" is used as a general term for the above described two types of scanning systems. Consequently, a scanning system driving device includes both a device for moving and controlling an optical system and a device for moving and controlling a document platen.
2. Description of the Prior Art
An image forming apparatus such as a copying machine includes a scanning system for optically scanning a document by driving an optical system or a document platen. For example, in a copying machine comprising a scanning system in which an optical system is driven, a moving body holding a light source and a reflecting mirror is displaced at uniform speed relative to a document. Consequently, the surface of the document is illuminated and scanned. In the process, a photoreceptor is exposed by light reflected from the document, and an electrostatic latent image is formed on the surface of the photoreceptor. This electrostatic latent image is developed into a toner image, and the toner image is transferred and fixed to copy paper, to achieve copying.
In such an image forming apparatus such as a copying machine, there are strong demands toward improvements in the image quality, along with miniaturization and higher speed. Therefore, improvements have been made for shortening the rise time elapsed before the scanning speed of the document by the scanning system reaches a predetermined speed, as well as preventing the nonuniformity of speed from occurring during the scanning of the document.
The electrostatic latent image formed on the surface of the photoreceptor is formed by the light reflected from the document illuminated and scanned. In order to increase the copying speed, therefore, it is essential that the scanning system be moved at high speed. Furthermore, in order to accurately reproduce a document image, it is necessary to keep the scanning speed constant.
On the other hand, if the copying machine is miniaturized, the moving distance of the scanning system from the home position to the position where illumination and scanning are started is short. Therefore, it is necessary to rapidly increase the moving speed of the scanning system. If the moving speed of the scanning system is thus rapidly increased so-called overshoot is produced. That is, the speed of the scanning system once exceeds the rated speed immediately before the speed of the scanning system reaches the rated speed. This overshoot degrades the copy image corresponding to the region in the vicinity of the position where illumination and scanning are started. Consequently, care must be taken to exclude the effect of the overshoot.
A prior art technique in which the moving speed of a scanning system is rapidly increased and a copy image is not affected by overshoot is shown in FIG. 11. A driving force on the scanning system is supplied from a main motor, provided in the copying machine, through an electromagnetic clutch. FIG. 11(a) shows the change with time of the voltage applied to the electromagnetic clutch, and FIG. 11(b) shows the change with time of the moving speed of the scanning system.
In this prior art technique, in order to rapidly increase the moving speed of the scanning system, the voltage applied to the electromagnetic clutch is instantaneously increased to a predetermined rated voltage at the time of starting the scanning system, as shown in FIG. 11(a). This predetermined rated voltage is a voltage applied to the electromagnetic clutch when the scanning system is driven at rated speed so as to illuminate and scan a document. In FIG. 11, an idle period is a period elapsed from the time when the rotation of the main motor is started until the electromagnetic clutch is connected, an approach period is a period elapsed from the time when the scanning system is in the home position until it reaches the position where illumination and scanning are started, and an image forming period is a period during which the document is illuminateded and scanned.
In this prior art technique the electromagnetic clutch is instantaneously connected, so that the driving force from the main motor is impulsively transmitted to the scanning system. Immediately after the scanning system rises, therefore, the moving speed of the scanning system fluctuates, as shown in FIG. 11(b). If the moving speed vibrates, excellent image formation is not carried out. Consequently, a period during which the moving speed vibrates is taken as an approach period, and a period after the moving speed is stabilized is taken as an image forming period.
In this prior art technique, however, it is necessary to ensure a sufficient approach period to stabilize the moving speed of the scanning system. Therefore, the distance from the home position to the position where illumination and scanning are started of the scanning system, that is, an approach distance, is increased. Therefore, there occurs a problem that the copying machine is prevented from being miniaturized.
This problem is solved by another prior art technique shown in FIG. 12. In this prior art technique a applied to an electromagnetic clutch is gradually increased, as shown in FIG. 12(a), Therefore, a driving force from a main motor is gently transmitted to a scanning system. As a result, the moving speed of the scanning system is smoothly increased and stabilized at rated speed in a short time, as shown in FIG. 12(b). Consequently, no long approach distance is required, thereby making it possible to miniaturize the copying machine, unlike the prior art technique shown in FIG. 11.
In this prior art technique however, a dedicated electric circuit of complicated construction is required to gradually increase the voltage applied to the electromagnetic clutch. Therefore, there occurs a new problem in that the cost is increased.
Still another prior art technique by which this problem is solved is disclosed in Japanese Patent Laid-Open Gazette No. 148138/1986. This gazette discloses the technique for applying a pulse voltage to an electromagnetic clutch in the early stages of scanning and repeatedly connecting and/or disconnecting the clutch to achieve a substantially half clutched state. In this prior art technique, however, the pulse period, the pulse content and the like of the pulse voltage are not sufficiently considered. That is, the natural vibration of an optical system is promoted by repeatedly connecting and/or disconnecting the clutch, so that the image quality is liable to be degraded.


A device and method for treating patent ductus arteriosus in a human. A catheter having a collapsible/expandable heating element at a distal end for entering an infant transcutaneously and being advanced to the ductus arteriosus. A method of heating the inner surface of the ductus arteriosus with the heating element to a temperature sufficient to produce a material change in the collagen of the ductus arteriosus such that the ductus arteriosus passage shrinks to closure.

Patent ductus arteriosus is a condition resulting from the partial continuation of fetal circulation. A fetus does not use its own lungs to oxygenate its blood, rather the fetus' blood bypasses the lungs and is oxygenated by the placenta. The ductus arteriosus allows blood to flow between the pulmonary artery and aorta in utero bypassing the non-functioning lungs during fetal development. Normally, the ductus arteriosus conduit closes naturally. This is prostaglandin dependent. If the ductus remains open, the infant has pathological shunting of blood from the systemic to the pulmonary system. This results in pulmonary hypertension which if uncorrected can result in the infant's disability and death.
Surgical procedures have been developed for closing the ductus which involve open heart surgery. The chest of the infant is opened to expose the ductus. A suture is tied around the ductus to seal it closed. For obvious reasons, open heart surgery is not desirable if alternatives exist.
Although other methods of occluding defects, most notably the use of a plastic plug to occlude the defect, were suggested as early as the 1950's, such methods similarly require the use of open heart surgery to access the defect and place the prosthetic implant.
Beginning in the early 1970's, a number of devices and methods were proposed for the percutaneous transluminal catheterization procedure for the repair of intracardiac defects. For example, U.S. Pat. No. 3,874,388 to King, et al., describes a device in which a pair of umbrella-like occluders are positioned on opposite sides of a defect and drawn and locked together at a central hub which crosses the defect. Although the King device and method proposed to eliminate the need to perform open heart surgery, use of the device was complicated in that generally the device required the umbrella-like occluders to be opened manually once positioned at the defect.
Collagen-containing connective tissue is ubiquitous in the human body and demonstrates several unique characteristics not found in other tissues. It provides the cohesiveness of the musculoskeletal system, the structural integrity of the viscera as well as the elasticity of integument. Intermolecular cross links provide collagen connective tissue with unique physical properties of high tensile strength and substantial elasticity. A previously recognized property of collagen is shrinkage of collagen fibers when elevated in temperature. This unique molecular response to temperature elevation is the result of rupture of the collagen stabilizing cross links and immediate contraction of the collagen fibers to about one-third of their original linear dimension. Additionally, the caliber of the individual fibers increases greatly, over four fold, without changing the structural integrity of the connective tissue.
There has been discussion in the existing literature regarding alteration of collagen connective tissue in different parts of the body. One known technique for effective use of this knowledge of the properties of collagen is through the use of infrared laser energy to effect tissue heating. The use of infrared laser energy as a corneal collagen shrinking tool of the eye has been described and relates to laser keratoplasty, as set forth in U.S. Pat. No. 4,976,709. The importance of controlling the localization, timing and intensity of laser energy delivery is recognized as paramount in providing the desired soft tissue shrinkage effects without creating excessive damage to the surrounding non-target tissues.
Another known technique of altering collagen is described in U.S. Pat. No. 5,458,596 to treat joints. U.S. Pat. No. 5,437,664 describes using a catheter for venous occlusion and coagulation of blood, but does not contemplate treating patent ductus arteriosus by shrinking the vessel to closure.

Method for the treatment of patent ductus arteriosus


An approach is provided in which a storage system detects that an extent residing on a first one of a set of physical storage devices requires relocation. The storage system identifies a set of backend connection properties of each of a set of backend connections between the storage system and the set of physical storage devices. The set of backend connection properties includes at least a connection bandwidth between the storage system and at least one of the physical storage devices. In turn, the storage system relocates the extent from the first physical storage device to a second one of the set of physical storage devices based at least in part, on the set of backend connection properties.

A storage area network (SAN) is a dedicated network that provides access to consolidated, block level data storage. SANs are primarily used to make storage resources (e.g., disk arrays, tape libraries, optical jukeboxes, etc.) accessible to servers such that the resources appear as locally attached devices to operating systems.
A SAN typically includes file systems, which are logical storage abstraction mappings to the physical storage resources (storage virtualization). In a block-based storage environment, a single "block" of information is addressed using a logical unit (LUN) identifier and an offset within that LUN, known as a logical block addressing (LBA). The LUN identifier identifies a logical unit from multiple LUNs and is essential for managing block storage arrays of a storage area network (SAN). A typical LUN may be used with any storage resource that supports read/write processes.
Storage area networks typically utilize an analytics system to monitor load balancing between the various physical storage resources. Multiple disks enclosures are connected to the analytics system, which are volumes that are visible from the storage system and available to an application. Multiple virtualized volumes may be exposed to the upper layers (e.g., host applications), which the upper layers use to store data.
Multi-tiered storage is a storage approach where data is stored on various types of storage devices primarily based on criteria such as (i) frequency of use, (ii) security, and (iii) data recovery requirements. Data that is frequently accessed by an application whose response is time sensitive is typically stored on solid state drives (SSDs). Other data that is infrequently accessed and for which a higher response time is more tolerable is typically stored on high capacity 7.2K RPM (revolutions per minute) drives because the cost per gigabyte of storage is much higher for SSDs than it is for the 7.2K RPM hard disk drives (HDDs).
One type of a multi-tier storage solution evaluates storage workloads and automates the placement of data amongst different storage tiers to achieve the optimal performance. Since SSDs are costlier than HDDs, this solution allows dynamic relocation of data of across tiers based on the data usage by placing "hot" (frequently accessed) data with high I/O (input/output) density and low response time requirements on SSDs while targeting HDDs for "cooler" data that is accessed more sequentially and/or at lower rates.
In one embodiment, the multi-tier storage solution uses an I/O monitoring daemon that monitors I/Os performed on HDDs. Based on data access frequency, the daemon identifies data that is heavily accessed (hot) and stores the hot data on SSDs for high throughput, low response times, and IOPS (Input/Output Operations Per Second) energy efficient characteristics. As a result, the amount of expensive storage required to meet a given level of performance is minimized compared to other methods of data placement for tiered storage.
Load balancing is a mechanism that relocates "extents" between physical storage devices within a same tier of a multi-tier storage solution. An extent is a set of 1024 blocks and is a unit for data relocation/migration in a block storage system. Extent migration between the same tier LUNs is also referred to as intra-tier migration. When a storage device is highly utilized in proportion to other storage devices in the same tier, then a portion of its hot extents are moved to a lower-utilized storage device if the lower-utilized storage device is not anticipated to reach a performance limit after the migration. The load balancing process improves performance as hotter extents are distributed among multiple disks of the same tier and plays an important role to minimize overload scenarios.

This patent is subject to a terminal disclaimer.

International Business Machines Corporation


A method for reducing Peak-to-Average Power Ratio (PAPR) in a Single Carrier Frequency Division Multiple Access (SC-FDMA) based radio communication system is provided. The method includes arranging symbols mapped to predetermined sub-carrier allocation types such that phases of the symbols do not overlap, and transmitting the arranged symbols.

Single Carrier Frequency Division Multiple Access (SC-FDMA) has been introduced to improve Peak-to-Average Power Ratio (PAPR) of communication systems using Orthogonal Frequency Division Multiplexing (OFDM). In theory, SC-FDMA has nearly the same PAPR efficiency as in the single carrier system. However, in an SC-FDMA application, resources may be wasted because signals are not allocated to some sub-carriers that constitute an entire frequency band.
On the other hand, if all the sub-carriers are used, use of SC-FDMA is unlikely to improve PAPR due to signal overlapping. Therefore, a need exists for an apparatus and method to reduce PAPR even when the entire frequency band is used for SC-FDMA.
The above information is presented as background information only to assist with an understanding of the present disclosure. No determination has been made, and no assertion is made, as to whether any of the above might be applicable as prior art with regard to the present disclosure.

Method and apparatus for reducing peak-to-average power ratio in single carrier-frequency division multiple access based radio communication system


The use of T7 bacteriophage to produce DNA length standards by enzymatically joining terminally repetitious, blunt-ended DNA has now been demonstrated. It is now possible to precisely control the formation of concatemeric DNAs thereby generating custom-made size-ranges of length standards. Furthermore, the standards thus produced are stable over time providing a highly reproducible and convenient product for the molecular biologist.

A. Field of the Invention
The present invention describes a method for producing DNA length standards useful in sizing long DNA molecules (40-600+kb) typically encountered when working with chromosomal DNA, for example during chromosomal mapping, or with large viral and plasmid DNA. Specifically, the invention is a method for enzymatically constructing such standards by use of crude cell extracts and with the realization of both a previously unattainable stability of the standards and control of their length.
B. Description of the Related Art
As the study of molecular biology evolved, workers in this field strived to manipulate and fractionate by size larger and larger pieces of DNA using the molecular tools previously successful on smaller fragments of DNA. However, serious difficulties arise when manipulating very large DNA molecules. One set of the problems has given way to recent advances in the field of electrophoresis which utilize rotating gels or pulsing electric fields. Using these new techniques, it is now possible to fractionate by length DNA molecules as long as 10 megabases (Cantor, et al., 1988; Cantor and Schwartz, 1984; Serwer, 1987; U.S. patent application, Ser. No. 212521 incorporated herein by reference).
Not the least of the problems remaining for workers wishing to use the new techniques of rotating gel electrophoresis (RGE) and pulsed-field electrophoresis is the availability of stable, reproducible length standards which provide discrete markers of known length. The most useful primary length standards used in the past have been obtained by annealing single-stranded ends of mature, 49 kb bacteriophage .lambda. to form concatemers (end-to-end multimers of the monomeric DNA).
However, .lambda. standards suffer limitations due to their short terminal repeats (12 bp); damage to these ends either before or during the concatemerization process limits the length of the concatemers. The concatemers of .lambda. phage that do form are not particularly stable to denaturation since the overlapping ends are quite short. Thus, when used under conditions that even mildly denature DNA, such as elevated temperature, bacteriophage .lambda. standards are destabilized and rendered useless as DNA length markers.
Additional problems arise with the .lambda. standards if the standard preparation is allowed to sit for even short periods of time. Since the concatemerization which occurs with the .lambda. DNA is non-enzymatic, these preparations tend to further concatemerize over time giving rise to non-reproducible results from one usage to the next and to a much shorter shelflife. The only successful manner in which to prevent deterioration of .lambda. standards is to maintain them in significantly diluted solutions which requires at least one subsequent concentration step or which renders them too dilute for many applications.
Other viruses with terminally repetitious, double-stranded DNA are the T-odd bacteriophages. During infection, T7-related bacteriophages produce linear, end-to-end concatemers of the unit length viral genome. These concatemers are then incorporated as a single viral genome into preformed coat-protein shells called proheads. Although the exact mechanism for construction and cleavage of the concatemers and the subsequent packaging of this DNA into the bacteriophage coat-protein has been the subject of extensive study, it is not yet completely understood.
The details of some of the physiological events for the T7 bacteriophage began to be known around 1970 when investigators noticed "intermediates" during the intracellular DNA synthesis of several species of bacteriophage (Kelly and Thomas, 1969). By the middle of the 1970's, workers using rate zonal centrifugation and electron microscopy established that the formation of DNA concatemers inside the bacterial host cell did not arise from normal bacteriophage recombination (Miller et al., 1976). Subsequently, it was found that most of this type of concatemer did not contain integral multiples of the monomeric length T7 DNA (Serwer, et al., 1987).
Using restriction endonuclease analysis, it was possible to determine that most of the concatemeric DNA from T7-infected cells consisted of bacteriophage genomes arranged in a linear head-to-tail fashion. (Langman et al., 1978; Serwer, et al., 1987). Adjacent genomes within a concatemer were found to overlap for a length of about 200 base pairs which was far greater than the overlapping 12 base pair tails of .lambda. bacteriophage DNA (Langman et al., 1978). Later, the length of the T7 terminal repeat was found to be 160 base pairs (Dunn & Studier, 1983).
Advances in a similar double-stranded bacteriophage, T3, established that an in vitro system could be used in which mature DNA purified from T3 was packaged into the empty viral head precursors. The concatemers generated by this method were visualized by electron microscopy and by their incorporation into infectious bacteriophage particles (Fujisawa et al., 1980). The emphasis of subsequent research using the T3 bacteriophage has been to refine the in vitro system for the purposes of maximizing the T3 DNA packaging reaction when conducted with unconcatemerized, monomeric DNA (Hamada et al., 1986; Shibata et al., 1987).
Studies of organization and expression of T7 DNA led to the determination of its nucleotide sequence and the localization of some of the genetic elements responsible for the bacteriophage functions in the host cell (Studier and Dunn, 1983; Dunn and Studier, 1983; Lee and Sadowski, 1984; White and Richardson, 1987). It is important to note that all of the studies involving the use of mutants of T7 and of processing of bacteriophage DNAs have focused upon the complete maturation cycle. Though the concatemers formed by these systems were manipulated extensively and fractionated by centrifugation, nothing in the literature suggested that the concatemeric products of the T7 bacteriophage themselves could be viewed as an end-product useful as a DNA length standard for which a maximized system might be derived.
Attempts by one of the inventors of the current invention to fractionate in vivo T7 concatemeric DNA by agarose gel electrophoresis initially met with very limited success (Serwer and Greenhaw, 1981; Serwer, et al. 1987). Only a minority of these in vivo concatemers formed bands at integral (.eta.) length the multiples of the T7 monomer; the longest of these had an 0 of 4. It was not feasible to control the natural viral metabolism in a manner to produce stable, discrete DNA length standards. It was necessary to overcome these problems in order for the T7 concatemers, which possessed several advantages to the concatemers of .lambda. DNA, to be used as DNA length markers.

Board of Regents, The University of Texas


Apparatus for patching a control program in a processor which executes a control program stored in non-volatile memory, and which has access to a plurality of patch routines. The apparatus comprises storage for storing trap addresses each of which is associated with the address of a patch routine; a comparator for comparing the address of the program counter with the patch addresses; and a diverter for responding to a positive comparison by diverting the control program to the patch routine whose address is associated with the trap address that gave rise to the positive comparison. Each trap address is associated with one of the possible operating states of the processor. The apparatus includes a selector for selecting a predetermined number of trap addresses from the trap addresses stored in the storage so as to select trap addresses that are associated with the current operating state of the processor. The comparator compares the address in the program counter with the selected addresses only.

The processors or microprocessors presently in use perform their operations in compliance with the instructions of a control program (or code) which is generally to be found in non-volatile memory of the ROM type. The control program is "masked", i.e. it is made during manufacture of the integrated circuit by the masking technique.
Because of errors in certain instructions of the control program in non-volatile memory, or because the control program needs to be modified, it can happen that it is desired to perform one or more patches, each consisting in replacing the erroneous instruction or sequence of instructions or modified instructions by a replacement routine which is known as a "patch".
If the control program were stored in read/write memory or RAM, or indeed in electrically programmable read-only memory (EPROM), then actual replacement would indeed be possible. However, in the present case, because the control program is in (masked) non-volatile memory, such actual replacement is not possible.
Conventionally, a control program stored in ROM is patched by diverting the control program while it is running to a corrected or modified patch stored in RAM and generally located outside the chip on which the processor and the ROM are formed.
In a known technique, branching instructions are inserted at regular intervals in the control program. Executing each branching instruction amounts to diverting (first jump) the execution of the control program to an address which is situated in RAM and which contains a jump instruction (second jump):
either to the address of a patch routine, supposing that certain instructions in the control program following the branching instruction include errors or need to be modified;
or else, in the absence of errors, to a return address in the control program immediately following the address of the branching instruction.
In other words, the address of each branching instruction constitutes a predefined trap address and corresponds necessarily to two jumps.
That known technique suffers from several drawbacks. Firstly, it increases the real time constraints on the control program since two jumps need to be executed at each trap address, whether or not there is a patch to be performed. In addition, it requires RAM of large size if it is desired to make a large number of trap addresses available within the control program, because each patch stored in RAM contains not only corrected or modified instructions but also a copy of the entire program segment situated between the trap address concerned and the address of the instructions that are to be corrected or modified.
In order to mitigate the drawbacks of that known technique, control program patching apparatus has been proposed comprising, in particular:
means for storing a plurality of trap addresses, each associated with the address of one of the patch routines;
a means for comparing the address of the control program contained in the program counter with each of the trap addresses contained in the storage means; and
means for diverting the control program if the comparator means deliver a positive comparison, with diversion being to a patch routine whose address is associated with the trap address concerned by the positive comparison.
That known apparatus operates as follows: on each instruction cycle, it is determined whether the instruction being executed is one of the trap addresses, and on detecting a match, the logic of the apparatus changes the current address in the program counter, replacing it with the address of the patch routine.
That known apparatus presents several advantages over the above-mentioned known technique. In particular, it makes it possible to provide a patch at any address in the control program (since it is possible to select which addresses are stored as trap addresses in the storage means), while minimizing the size of the RAM required for the patches (since the patch routines contain only those instructions that have been corrected or modified, and is the means for storing the trap addresses take up little memory space).
However, as presently designed, that known apparatus does not deliver performance that is as good as desired since it makes it possible to provide only a limited number of corrections to the control program.
In order to guarantee the operating speed of the processor and restrict the area of silicon required, the number of trap addresses with which the comparator means can compare the address contained in the program counter must necessarily be limited.
Thus, at present, only a small number of correction opportunities are available (e.g. eight). In other words, only a few patch routines can be used with a given control program. Unfortunately, it often happens that it is desirable to provide a larger number of corrections or modifications to the control program.


The specification discloses a portable shelter which is conveniently transportable, easy to set up, and structurally stable in a variety a situations. The portable shelter comprises a canopy which is supported by opposing side support structures connected by a lateral support member and canopy support beams. The portable shelter can be disassembled and/or folded for convenient transportation.

Many outdoor activities can be affected by weather and the elements. Even outdoor activities that rely on outdoor weather can be made less enjoyable by too much of a good thing. For example, people typically prefer sunny weather while lounging on a beach or near a pool. However, excessive sun exposure can cause discomfort, overheating, sunburns, and other problems. Additionally, bright sunlight can interfere with enjoyment of other activities while lounging, such as reading or using electronic devices. Accordingly, it is often desired to have a source of shade available. In some situations, protection from other weather conditions such as wind or rain is also desired.
Further, because shelter is often desired in locations where permanent structures do not exist or are unwanted, shelters which may be easily transported are often preferred. Many types of shelters are known and have been used, including some which are portable. However, all known prior art shelters suffer from one or more of the following problems: they are too heavy or bulky for convenient transport, too difficult to assemble, rely on external features for support, or suffer from instability when assembled.


A molded motor of the present invention includes a rotor, a stator, a pair of shaft bearings, a pair of metal brackets, and a molding resin. The rotor has: a rotary shaft extending in a shaft direction; and a rotary body that has a permanent magnet and is fixed to the rotary shaft. The stator has: a stator core on which a plurality of salient poles are formed; and a plurality of coils each wound on each salient pole via an insulator, where the stator is covered by the molding resin and is disposed to face the rotor. The pair of metal brackets each fix each of the shaft bearings, and the shaft bearings rotatably support the rotor. Further, the rotary body has a dielectric layer formed between the rotary shaft and an outer peripheral surface of the rotary body. A metal member is provided, on an outer peripheral side of a coil end of the coil and on at least a part facing the coil end, in a circumferential direction.

When a brushless DC motor is driven by an inverter using a pulse width modulation method (hereinafter, referred to as a "PWM method"), a neutral point potential of a winding wire is not zero. Therefore, a voltage difference occurs between an outer ring of a shaft bearing and an inner ring of the shaft bearing (hereinafter, this voltage difference is also referred to as a "shaft voltage"). There is a problem that if this shaft voltage exceeds a breakdown voltage of an oil film in the shaft bearing, a discharge occurs in the shaft bearing, whereby electrolytic corrosion occurs on the shaft bearing.
To prevent such electrolytic corrosion from occurring on the shaft bearing, PTL 1 discloses a measure in which a stator core and a metal bracket are electrically connected to each other. With this configuration, the stator core and the metal bracket are electrically connected to each other, and potentials of the stator core and the metal bracket are the same. Therefore, the shaft voltage can be low, and, as a result, it is possible to prevent the electrolytic corrosion on the shaft bearing.
On the other hand, there are known molded motors in which a stator is covered with a molding resin to lower noise and vibration. Regarding such molded motors, as the power output of the motor has been increased in recent years, heat generation in a coil wound on the stator core has increased; therefore, there arises a problem that the molding resin is thermally deteriorated.
To prevent such thermal deterioration of the molding resin, PTL 2 discloses a technique in which an epoxy resin containing filler having high thermal conductivity is used as the molding resin. This improves heat radiation performance of the molding resin and can thus prevent thermal deterioration.
However, in a case where an excessive current flows through the coil wound on the stator core for some reason and the coil generates heat and heats up to high temperatures, an insulator for insulating an outer peripheral surface of a conductive wire of the coil can melt, and a short-circuit can occur in the conductive wires of the coil. If the conductive wires are short-circuited and generate a spark, the spark can ignite a gas generated when insulating resin or the like provided between the coil and the stator core is heated by the spark. Further, in a case where the molding resin is thermally deteriorated due to the heat of the coil, and a crack or the like is created in the molding resin, the ignited fire can leak outside the motor through the cracked part.

PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD.