The present invention provides novel uses of compounds of general formula I ##STR1## wherein R.sup.1, R.sup.4 and R.sup.5 are individually hydrogen, hydroxy, halogen, trifluoromethyl, lower alkyl, lower alkoxy or (tertiary amino)(lower alkoxy); and R.sup.2 and R.sup.3 are individually hydrogen or lower alkyl, or as a pharmaceutically acceptable salt thereof in combination with a pharmaceutically acceptable carrier for the manufacture of a pharmaceutical composition for the treatment or-prophylaxis of obesity.

Obesity is a well known risk factor for the development of many very common diseases such as atherosclerosis, hypertension and diabetes. The incidence of obese people and thereby also these diseases is increasing throughout the entire industrialised world. Except for exercise, diet and food restriction no convincing pharmacologic treatment for reducing body weight effectively and acceptably currently exist. However, due to its indirect but important effect as a risk factor in mortal and common diseases it will be important to find treatment for obesity.
The term obesity implies an excess of adipose tissue. In this context obesity is best viewed as any degree of excess adiposity that imparts a health risk. The cutoff between normal and obese individuals can only be approximated, but the health risk imparted by the obesity is probably a continuum with increasing adiposity. The Framingham study demonstrated that a 20% excess over desirable weight clearly imparted a health risk. (Mann GV N. Engl. J.Med 291:226, 1974). In the United States a National Institutes of Health consensus panel on obesity agreed that a 20% increase in relative weight or a body mass index (BMI =body weight in kilograms divided by height in meters) above the 85th percentile for young adults constitutes a health risk. By the use of these criteria 20 to 30 percent of adult men and 30 to 40 percent of adult women in the United States are obese. (NIH, Ann Intern Med 103:147, 1985).
Even mild obesity increases the risk for premature death, diabetes, hypertension, atherosclerosis, gallbladder disease and certain types of cancer. In the industrialized western world the prevalence of obesity has increased significantly in the past few decades. Because of the high prevalence of obesity and its health consequences, its prevention and treatment should be a high public health priority.
When energy intake exceeds expenditure, the excess calories are stored in adipose tissue, and if this net positive balance is prolonged, obesity results, i.e. there are two components to weight balance, and an abnormality on either side (intake or expenditure) can lead to obesity.
The regulation of eating behaviour is incompletely understood. To some extent appetite is controlled by discrete areas in the hypothalamus: a feeding center in the ventrolateral nucleus of the hypothalamus (VLH) and a satiety center in the ventromedial hypothalamus (VMH). The cerebral cortex receives positive signals from the feeding center that stimulate eating, and the satiety center modulates this process by sending inhibitory impulses to the feeding center. Several regulatory processes may influence these hypothalamic centres. The satiety center may be activated by the increases in plasma glucose and/or insulin that follow a meal. Meal-induced gastric distension is another possible inhibitory factor. Additionally the hypothalamic centres are sensitive to cate-cholamines, and beta-adrenergic stimulation inhibits eating behaviour. Ultimatively, the cerebral cortex controls eating behaviour, and impulses from the feeding center to the cerebral cortex are only one input. Psychological, social, and genetic factors also influence food intake.
At present a variety of techniques are available to effect initial weight loss. Unfortunately, initial weight loss is not an optimal therapeutic goal. Rather, the problem is that most obese patient eventually regain their weight. An effective means to establish and/or sustain weight loss is the major challenge in the treatment of obesity today.
Centchroman is a non-steroidal compound known to have antiestrogenic activity. It is in use in India as an oral contraceptive (see, for example, Salman et al., U.S. Pat. No. 4,447,622; Singh et al., Acta Endocrinol. (Copenh) 126 (1992), 444-450; Grubb, Curr.Opin.Obstet. Gynecol. 3 (1991), 491-495; Sankaran et al., Contraception 9 (1974), 279-289; Indian Patent Specification No. 129187). Centchroman has also been investigated as an anti-cancer agent for treatment of advanced breast cancer (Misra et al., W. J. Cancer 43 (1989), 781-783). Recently, centchroman as a racemate has been found potent as a cholesterol lowering pharmaceutical expressed by a significant decrease of the serum concentrations (S.D. Bain et al., J.Min.Bon.Res. 9 (1994), 394.
U.S. Pat. No. 5,280,040 describes methods and pharmaceutical compositions for reducing bone loss using 3,4-diarylchromans and their pharmaceutically acceptable salts.
Thus there remains today a need in the art for compositions and methods that are useful in the treatment or prophylaxis of obesity.
One object of the present invention is to provide compounds which can effectively be used in the treatment or prophylaxis of obesity.

Use of 1-centchroman for the manufacture of a pharmaceutical composition for the treatment of obesity


An expandable local area hub network is provided by the present invention. The network comprises a plurality of hubs interconnected for direct communication. Each hub includes a plurality of ports for interfacing with remote stations, wherein the remote stations make requests that packets be transmitted on a memory coupled to the plurality of hubs. In use, one of the plurality of hubs is designated as a temporary controlling hub having controlling access to the memory bus to transmit packets on the memory bus. The temporary controlling hub relinquishing access to the memory bus when the temporary controlling hub has no requests to dispatch a packet on said memory bus.

With the recent expansion in the use of computers and computer terminals it is not unusual to have a large number of computers and terminals within a limited local area. It is very desirable to couple these units together to allow sharing of resources and permit a single terminal to access a plurality of other computers or terminals. One way of accomplishing this is the local area network (LAN). A local area network provides switching and data distribution for the transmission of information and allows computers to communicate with each other. LAN's further allow any single terminal to have access to a multiplicity of computers and peripheral equipment.
Local Area Networks, such as are used, for example, in computer communications, are well known and described in U.S. Pat. No. 5,041,963, entitled, "Local Area Network with an Active Star Topology Comprising Ring Controllers having Ring Monitor Logic Function", by Ebersole et al., issued Aug. 20, 1991; U.S. Pat. No. 4,998,247, entitled, "Active Star-Configured Local Area Network", by Irvine-Halliday et al., issued Mar. 5, 1991; U.S. Pat. No. 4,982,400 entitled, "Ring Bus Hub for a Star Local Area Network", by Ebersole, issued Jan. 1, 1991; U.S. Pat. No. 4,825,435, entitled "Multiport Repeater", by Amundsen et al., issued Apr. 25, 1989; U.S. Pat. No. 4,872,158, entitled, "Distributed Control Rapid Connection Circuit Switch", by Richards, issued Oct. 3, 1989; U.S. Pat. No. 4,787,082, entitled, "Dataflow Control Arrangement for Local Area Network", by Delaney et al., issued Nov. 22, 1988; U.S. Pat. No. 4,674,085, entitled, "Local Area Network", by Aranguren et al., issued Jun. 16, 1987; all of the foregoing being incorporated by reference.
The stations or nodes of a local area network may be configured in a variety of shapes, such as, for example, as a ring or a star. In a star-configured or local area hub network, multiple, discrete, remote stations are coupled through a central site or station, termed a hub station. The hub station follows a particular or predetermined signaling protocol to establish communications and to determine the order in which remote stations are permitted to transmit data over the network in the form of signals, such as electrical or optical signals. In one such signaling protocol, termed round robin, each of the remote stations is separately polled for transmissions. Likewise, in a round robin signaling protocol, only one station may transmit electrical signal data over the network at a time; that is, only one station may have controlling access to transmit a packet on a memory bus.
According to a ring network topology, transmission is from node to node around a closed loop and each node may alter the data passing therethrough. Each data processing device is connected to a separate node and intercepts only data messages specifically directed to a node. Since the data flows through each node and since the nodes are distributed, no central node may be separately secured and hence, the security and privacy of a ring network topology is somewhat less than that of the star network topology. Additionally, all nodes are in one closed loop and, failure of a single node may render the whole ring network inoperative. The closed loop topology also limits flexibility in some arrangements where adding new nodes or data processing stations results in the loss of data.
As with the star topology discussed above, hubs in a ring topology must follow a particular or predetermined signaling protocol to establish communications and to determine the order in which remote stations are permitted to transmit data over the network in the form of signals. The round robin signaling protocol discussed above is one such protocol and is applicable to a ring topology in the same manner it applies to a star topology.
Data transmission in a bus network topology is typically broadcast from one source to all other devices on the same bus, but is normally only accepted by the device to which it is specifically addressed. Individual data processing devices are programmed to recognize data messages addressed to or intended for them as they pass them by on the bus. The reliability of the bus network topology, in terms of network node failure, is greater than that of the ring network topology, although a break in the bus may be catastrophic. There is also greater flexibility in adding new data processing devices to the system than is normally possible with the star topology since no wiring reconfiguration is required. Although a round robin protocol is generally not applicable to a bus topology, it might be applicable if one hub is designated as the controlling hub. If this were the case, the controlling hub would be programmed with logic to govern the remaining hubs in accordance with the round robin protocol.
As disclosed and described in Draft for Standard Information Technology Local and Metropolitan Networks--Part 12--Demand Priority Access Method and Physical Layer Specification, P802.12, dated March 1994, herein incorporated by reference, a round robin protocol has been proposed to the IEEE to be employed in the local area networks transmitting data in the form of electrical signals 100 megabits per second, termed 100 Base VG. A round robin protocol provides advantages over other known network protocols, such as the protocol employed by the IEEE standard 802.3, also known as CSMA/CD (Carrier Sense Multiple Access with Collision Detection). The advantages associated with the round robin protocol are especially applicable for time sensitive multimedia communication tasks. Specifically, in multimedia applications it becomes desirable to prioritize or control access to the media or communication networks provided to different remote stations. The prioritized or controlled access permits more important communications tasks to obtain access to the network earlier than the less important tasks.
Several different media can be used to carry local area network communications. Considerations regarding network topology, maximum distance between nodes, volume of information to be transmitted, and speed of transmission are critical in a selecting particular communications medium. Physical limitations such as plenum, conduit sizes, and routing plans in the building also affect the choice of the medium. Finally, for some network topologies, user accessibility to the bus for passive tapping is also extremely important.
FIG. 1 is a schematic diagram of one embodiment of a conventional local area star-configured or hub shaped network. As previously suggested, in a local area hub network, the remote stations 10 may be arranged in a star-shaped network, or in a star configuration, in which a central station acts as a hub 12 for the remote stations 10. Thus, a hub or hub station may be used to transmit a signal packet, such as an electrical signal packet, from one remote station to another remote station, or multiple remote stations, since all of the remote stations are in direct communications with, or directly coupled to, the hub. Remote stations may comprise, for example, a data terminal or other computer-related equipment, as described in the aforementioned Demand Priority Access document.
In the context of the invention, the term "packet" refers to a complete and discrete grouping of data in the form of signals, typically digital signals, for transmission between stations. Thus, for example, a packet may comprise digital signals to be transmitted. Typically, packets include a start of frame delimiter (SFD), and an end of frame delimiter (EFD). Likewise, as described on page 4-3 of the aforesaid Demand Priority Access document, and as illustrated in FIG. 2, a packet may further include binary digital signals, or bits, representing, for example, a destination address (DA), a source address (SA), the length of the packet (L), the data to be transmitted (DATA), and a frame check sequence (FCS) for signal error checking.
In the network illustrated in FIG. 1, packets, such as electrical signal packets, transmitted between two remote stations must pass through the hub. Depending on the particular network, the hubs typically have the capability to perform and recognize a signaling protocol (often termed "handshaking"), the capability to identify and extract data from an electrical signal packet, the capability to store data in the form of electrical signals, the capability to perform signal error checking, and the capability to perform destination address matching, such as described in the aforementioned Demand Priority Access document.
For a local area hub network, it often becomes desirable to increase the size of the network without substantially degrading signal transmission performance; that is, it is desirable for the network to be extendible. However, as local area hub networks increase in size, the hardware for communications between remote stations of the network becomes increasingly complex. For example, technological limitations on the manufacture of integrated circuit chips typically restrict the number of ports that may be fabricated on one chip. Specifically, in any integrated chip implementation of a multiple-port LAN hub the number of user ports is usually limited to between six and twelve per single hub integrated chip due to physical limitation. Thus, for a large local area hub network having, for example, tens or hundreds of stations, communications between the remote stations directly linked or coupled to one hub station in the network may need to be shared among several, discrete devices or chips. Additionally, since all the network traffic must go through a specific hub, the bandwidth available to each port decreases as more ports are added to the hub. Further, the problem of performing or controlling round robin polling between these discrete devices also becomes more complex.
One way to overcome the limited number of ports available on a signal hub is the coupling of hubs to form a local area hub network consisting of multiple hubs. For such a local area hub network, the hubs should be coupled and signals must be communicated between the hubs so that the performance of the round robin signaling protocol is not substantially degraded. Furthermore, it is desirable not to increase the complexity of the hardware unduly and to exhibit low pin or port overhead by reducing the number or maintaining a relatively low number of ports needed to accomplish satisfactory operation.
In view of the foregoing discussion a need exists for an extendable local area hub network which efficiently, reliably and functionally increases the number of ports available on a local area hub network. The present invention provides such a network.

Port expansion network and method for lan hubs


When forming an MPEG-TS (transport stream) containing access units which are units of access of MPEG data, transfer timing is controlled in a transfer timing control section under control of a transfer control section. Access units are thus sent as TS packets from an access unit transfer processing section. A new PTS(Presentation Time Stamp) is embedded in a PES header supplied from a PES header transfer control section, by a PTS embedding section. A TS packet sequence containing both of them is formed by a reproduction buffer. On the other hand, a PCR(Program Clock Reference) serving as a time reference is embedded in a TS packet supplied from a PCR transfer control section and a resultant TS packet is sent to a PCR buffer, by a PCR embedding section on the basis of a STC(System Time Clock) supplied from an STC section. The TS packets are multiplexed as a TS packet sequence to form an MPEG-TS, by a TS multiplexing section.

1. Field of the Invention
The present invention relates to technical fields of a transport stream multiplexing method for multiplexing encoded data and forming a transport stream, a transport stream multiplexing apparatus, and a storage and reproduction system for conducting storage and reproduction of a transport stream thus multiplexed.
2. Description of Related Art
In recent years, digital broadcasting in which video data and audio data are digitized and multiplex-transmitted is spreading. In such digital broadcasting, the MPEG (Moving Picture Expert Group) system is adopted as a compression coding system. In digital broadcasting using the MPEG system, data of a plurality of programs are multiplexed into an MPEG transport stream (hereafter referred to as MPEG-TS) and the MPEG transport stream is transmitted. Upon receiving this, the reception system side selectively extracts desired data. Furthermore, if a storage and reproduction system is formed so as to store arbitrary data contained in MPEG-TS by using a large capacity storage device such as a hard disk, it becomes possible to reproduce stored data at timing desired by the user.
By the way, in the case where video data stored in a storage device is reproduced in the aforementioned storage and reproduction system, it is desirable to provide a special reproduction processing function corresponding to fast feed and rewinding. In this case, it is necessary to selectively reproduce a sequence of access units (access units of video data) which becomes a subject of special reproduction, among the stored video data.
According to the aforementioned conventional storage and reproduction system, time information originally given to the selected access units becomes discontinuous. If an MPEG decoding device is made to conduct ordinary decoding processing by using such time information, contradiction occurs on the time axis. For a stream comprised of the aforementioned access units, therefore, it is necessary to set a different time axis and newly provide time information.
As the approach, such a configuration can be considered that elementary stream (ES) constituted by only an access unit to be reproduced specially is extracted from the TS packet sequence of video data at a time of special reproduction and decoding processing is performed using this ES. However, in such an approach, it is necessary to provide a decoder for decoding the ES in a dedicated manner, which results in lack in versatility of MPEG system.
As a technique therefor, it is conceivable to rewrite field portions of originally given time information with such time information as to be suitable for special reproduction while maintaining the form of the original stream of the video data at the time of special reproduction. However, since such a technique is processing of simply rewriting the original time information with new time information, it becomes necessary to locate the position of the field portion to be rewritten. In this case, it becomes necessary to, for example, eliminate dispersion of time required to locate the position. Thus, time management when determining the new time information becomes very complicated. Difficulty in ensuring the accuracy on the time axis poses a problem.

Transport stream multiplexing method, transport stream multiplexing apparatus, and storage and reproduction system


Systems and methods are provided for optimizing the geometric stretch of a parametrization scheme. Given an arbitrary mesh, the systems and methods construct a progressive mesh (PM) such that all meshes in the PM sequence share a common texture parametrization. The systems and methods minimize geometric stretch, i.e., small texture distances mapped onto large surface distances, to balance sampling rates over all locations and directions on the surface. The systems and methods also minimize texture deviation, i.e., “slippage” error based on parametric correspondence, to obtain accurate textured mesh approximations. The technique(s) begin by partitioning the mesh into charts using planarity and compactness heuristics. Then, the technique(s) proceed by creating a stretch-minimizing parametrization within each chart, and by resizing the charts based on the resulting stretch. Then, the technique(s) simplify the mesh while respecting the chart boundaries. Next, the parametrization is re-optimized to reduce both stretch and deviation over the whole PM sequence. The charts may then be packed into a texture atlas for improved texture mapping in connection with a parametrization scheme.

A progressive mesh (PM) representation encodes an arbitrary mesh as a simple base mesh M0 and a sequence of n refinement operations called vertex splits. The PM defines an array {M0 . . . Mn} of level-of-detail (LOD) approximations, and supports geomorphs and progressive transmission. Unlike multiresolution frameworks based on subdivision, the meshes in a PM have irregular connectivities that can accurately model sharp features (e.g., creases and corners) at all scales.
One challenge in the PM framework is handling texture maps. Hardware rasterization features, including bump maps, normal maps, and multitexturing, allow fine detail to be captured in texture images parametrized over the mesh. Processes that implicate sources for textures include sampling detailed scanned meshes, evaluating solid textures, ray tracing, and 3D painting. In this regard, there are various problems associated with parametrizing texture images over all meshes in a PM sequence.
A single unfolding of an arbitrary mesh onto a texture image may create regions of high distortion, so generally a mesh must be partitioned into a set of charts. Each chart is parametrized by a region of a texture domain, and these parametrizations collectively form an atlas, an exemplary one of which is illustrated in FIG. 9C. For instance, several schemes simplify a mesh and then construct a texture image chart over each simplified face by sampling attributes, e.g., normals, from the original mesh.
For a PM, one might consider re-using chart images defined on faces of M0 for all meshes M1 . . . Mn. However, the problem is that a PM is generally not chart-compliant, in that its vertex splits can change the chart topology when applied indiscriminately near chart boundaries, thereby forcing parametric discontinuities. For example, the vertex split shown in FIG. 1B changes the adjacency of the three colored charts of FIG. 1A, resulting in the discontinuous texture. Fortunately, it is possible to construct a single atlas parametrization for the entire PM sequence. Chart-compliance can be obtained by first defining the charts on the original mesh, and then constraining a simplification sequence to comply with those chart boundaries, as described by Cohen, Olano and Manocha.
With respect to mesh partitioning, there have been several previous techniques that have proposed methods for parametrizing meshes by partitioning into charts. Krishnamurthy and Levoy describe an interactive system in which the user manually lays out chart boundaries by tracing curves. Maillot et al. partition mesh faces according to a bucketing of face normals. Eck et al. use a Voronoi-based partition. These last two algorithms make little effort to adapt charts to surface geometry, so the chart boundaries can hinder simplification, leading to poor LOD approximations.
The techniques of Lee et al. ("MAPS") and Guskov et al. ("Normal Meshes") map edges of the simplified base domain back to the original mesh. While the resulting charts adapt to surface geometry, their boundaries cut across faces of original mesh, requiring addition of new vertices and faces. For the applications described in MAPS and Normal Meshes, these additional vertices are only temporary, because the mesh geometry is subsequently resampled. However, the techniques of MAPS and Normal Meshes are not suited to generating a PM from a user-specified mesh, whose connectivity is often carefully optimized, because the imposition of new vertices is a drawback to such an application.
With respect to chart parametrization, several schemes have been proposed to flatten surface regions to establish a parametrization. These schemes typically obtain the parametrization by minimizing an objective functional. The main distinction between the functionals is how they measure the distance of the parametrization from an isometry, which is a mapping preserving lengths and angles.
Maillot et al. base their metric on edge springs of nonzero rest length, where rest length corresponds to edge length on the surface. To ensure that the parametrization is 1-to-1, i.e., to avoid parametric "buckling," also called "face flipping," they add an area-preservation term to the metric. However, a downside to the technique of Maillot et al. is that when the texture domain boundary is fixed, it is unclear how edge rest-lengths should be scaled. Another downside is that the weighting between the edge springs and the area-preservation term must be adjusted to produce an embedding.
Eck et al. propose the harmonic map, which weights edge springs non-uniformly. The weights can sometimes be negative, in which case an embedding is not guaranteed. Floater proposes a similar scheme with a different edge-spring weighting that guarantees embedding for convex boundaries. For either method, the parametrization can be found by solving a linear system.
Lévy and Mallet combine orthogonality and isoparametric terms in their metric. To solve the resulting nonlinear optimization, they iteratively fix one texture component, s or t, and solve for the other using a linear optimization. As with Lindstrom and Turk, a term is added, which must be sufficiently weighted to guarantee an embedding.
Hormann and Greiner propose the MIPS parametrization, which roughly attempts to preserve the ratio of singular values over the parametrization. However, the metric disregards absolute stretch scale over the surface, with the result that small domain areas can map to large regions on the surface.
With respect to appearance preserving simplification, Cohen et al. introduce texture deviation as the appropriate measure of geometric accuracy when simplifying textured meshes. The texture deviation between a simplified mesh Mi and the original mesh Mn at a point piεMi is defined as ∥pi−pn∥ where pn is the point on Mn with the same parametric location in the texture domain. Cohen et al. track texture deviation conservatively by storing a bounding error box at each mesh vertex. They demonstrate results on parametric surfaces already organized into charts; however, the techniques of Cohen et al. do not begin with an unparametrized mesh, and then seek to form an atlas parametrization that specifically minimizes texture deviation and stretch over all meshes in a PM.
Thus, it would be desirable to improve upon prior art techniques for providing texture mapping in connection with parametrization schemes. To improve upon prior art techniques, it would be desirable to provide a system that allows all meshes in the PM to share a common texture map. Furthermore, it would be desirable to create domains with straight boundaries between chart comers, unlike, for example, the approaches of Maillot et al., Lévy and Mallet and Hormann and Greiner. It would be still further desirable to provide systems and methods for texture mapping PMs that minimize geometric stretch and texture deviation. It would be still further desirable to substantially balance sampling rates everywhere on the surface by optimizing the geometric stretch of a parametrization scheme. Moreover, it would be advantageous to provide a general solution that begins with an unparametrized mesh, and then forms an atlas parametrization that minimizes texture deviation and stretch over all meshes in a PM.

This patent is subject to a terminal disclaimer.

Systems and methods for optimizing geometric stretch of a parametrization scheme


A cache coherency protocol for a multi-processor system which provides for read/write, read-only and transitional data states and for an indication of these states to be stored in a memory directory in main memory. The transitional data state occurs when a processor requests from main memory a data block in another processor's cache and the request is pending completion. All subsequent read requests for the data block during the pendency of the first request are inhibited until completion of the first request. Also provided in the memory directory for each data block is a field for identifying the processor which owns the data block in question. Data block ownership information is used to determine where requested owned data is located.

Modern day computer systems frequently comprise a central processing unit and a memory hierarchy including a relatively large, but relatively slow main memory module and a relatively fast, but relatively small cache memory coupled between the central processing unit and the main memory module. The data and instructions being processed at any one time by the central processing unit are temporarily stored in the cache memory to take advantage of the high speed of operation of the cache memory to thereby increase the overall speed of operation of the computer system. The use of a cache memory is based upon the principles of temporal locality and spatial locality. More specifically, when a central processing unit is accessing data and instructions from a particular space within physical memory, it will most probably access the data and instructions from that space and, in addition, access data and instructions from contiguous space, for a certain period of time. Accordingly, data blocks, including the contiguous space of physical memory where data being utilized by the central processing unit resides, are placed in the cache memory to greatly decrease the time required to fetch data and instructions from those frequently referred to data blocks.
A cache memory scheme may be either a write-through cache or a write-back cache. In a write-through cache, a central processing unit writes through to main memory whenever it writes to an address in cache memory. In a write-back cache, the central processing unit does not update the main memory at the time of writing to its cache memory but updates the memory at a later time. For example, when the central processing unit is changing the contents of its cache memory, it will send the latest copy of written-to data to the main memory before it refills the space within the cache occupied by the written-to data. In this manner, the speed of operation of the central processing unit is not slowed down by the time that would be required to update the main memory after each write operation. Instead, the main memory is updated at the completion of the operations relating to the data block contained in the cache memory.
Many computer systems operate on the basis of the concept of a single, simple copy of data. In a multi-processor system including several central processing units, each with its own write-back cache, incoherencies within the data arise when one of the central processing units writes to a data block in its cache memory. In other words, when a particular central processing unit writes to its cache, the main memory will not have a correct copy of the data until the central processing unit updates the main memory.
If a particular central processing unit requests a data block currently in the cache of another central processing unit of the multi-processor system and that data block has been written to by such other central processing unit on a write-back basis, as described above, a coherency scheme must be utilized to insure that the latest correct copy of the data is sent to the requesting central processing unit. Typically, heretofore known multi-processor systems have implemented a so-called "snoopy" protocol in a shared bus configuration for the several central processing units of the system to assure that the latest copy of a data block is sent to a requesting central processing unit.
Pursuant to the snoopy protocol, all of the central processing units of the multi-processor system are coupled to the main memory through a single, shared bus. Each of the caches of the several central processing units and any other devices coupled to the shared bus "snoop" on (i.e. watch or monitor) all transactions with main memory by all of the other caches. Thus, each of the caches is aware of all data blocks transferred from main memory to the several other caches throughout the multi-processor system. Inasmuch as the caches are coupled to the main memory by a single, shared bus, it is necessary to implement an arbitration mechanism to grant access to the shared bus to one of possibly several devices requesting access at any particular time. The arbitration mechanism will effectively serialize transactions with the main memory and the snoopy protocol utilizes the serialization to impose a rule that only one cache at a time has permission to modify a data block.
After modification of the data block in the one cache, the main memory does not contain a valid copy of the data until it is updated by the cache having the written to block, as described above. In accordance with the snoopy protocol, the copy of the written to data block in the one cache is substituted for the main memory copy whenever another cache requests that data block prior to the update of the main memory.
An ownership model of the snoopy protocol includes the concept of "ownership" of a data block. A device must first request and obtain ownership of a data block in its cache before it can write to that data block. At most one device can own a data block at any one time and the owner always has the valid copy of that data block. Moreover, the owner must update the main memory before it relinquishes ownership of the block to assure coherency of the data throughout the multi-processor system.
By definition, ownership means the right to modify a data block. When no device of the system owns a data block it is said to be owned by the main memory and copies of the data block may be "shared" by any of the devices of the system. A shared mode means the device has read only access to a shared copy of a data block residing in its cache. Since the main memory owns the data block in the shared mode, all shared copies exactly match the main memory and are, hence, correct copies. Once any one device other than main memory obtains ownership of a data block, no other device may share the block and all copies of the data block which are shared are invalidated at the time ownership is obtained by the one device.
It is implicit above that a single request is made and acted upon at a time on the shared bus. Hence all bus requests are ordered and all caches and the memory see them in the same order. It is also implicit above that the memory does not respond to a request if some cache owns the data; instead the owning cache supplies the data. This is typically done by having each cache search itself for the data with each bus request. If a cache finds that it owns the data, it suppresses memory (which could otherwise respond), typically with a signal wire for this purpose, and applies the data to the bus itself.
In a variation of the ownership model, the main memory includes a directory of all main memory lines to ensure that data coherency is maintained throughout the multi-processor system. The directory contains an entry for each data block in the main memory and each entry comprises a bit mask of k+1 bits. The number k equals the number of caches in the system with each one of the k bits of the mask corresponding to one of the caches. The extra bit of the k+1 bits provides the ownership status of the corresponding data block. Thus, if the (k+1) bit is on, then one and only one of the remaining bits can also be on since only one cache at a time can have write privileges to a data item.
The main memory utilizes the directory to provide a centralized cache coherency system. The main memory queries the directory for each read or write request that it receives from the various central processing units in the multi-processor system to determine the current state of the requested data item, i.e. owned or shared, depending upon the state of the (k+1) bit, and the location of copies of the data item, as indicated by the remaining bits of the bit mask.
The information obtained from the directory enables the main memory to enforce the coherency scheme. For example, if a data block is not owned and a read only copy is present in several of the caches, the (k+1) bit will be off and the bits corresponding to the caches that have a copy of the data block will each be on. If another central processing unit, which does not have a copy of the data block wants to write to the data block, it sends a request to the main memory for the data block with write privileges. The main memory will query the directory to determine that the data block is not presently owned and that copies reside in several of the caches. The main memory will send an invalidate signal to all of the caches where a copy of the data block resides, as indicated by the bits of the bit mask and then set the k+1 bit to now indicate the owned state.
The main memory further sets the bit corresponding to the requesting cache. The main memory can perform similar operations upon each read or write request to determine the state and location of any data block and to reset the bit mask and send control signals as required to maintain data coherency.
The above-described coherency protocols provide a highly effective scheme for maintaining data coherency throughout a multi-processor system including devices having write-back caches. However, a major drawback of the scheme is that only one device at a time may access main memory due to the single shared bus coupling all of the devices to the main memory and the necessity of serializing all transactions with the main memory. Thus, the maximum speed of operation theoretically possible in a system having parallel central processing units is diminished in practical applications since only one central processing unit at a time can complete a transaction with the main memory through the shared bus. Moreover, each device coupled to the shared bus must devote certain resources to an active and continuous monitoring of the shared bus in accordance with the snoopy protocol.

Cache coherency protocol for multi processor computer system


A haptic system is described. The haptic system includes a linear resonant actuator (LRA), a receiver, and a transmitter. The LRA has a characteristic frequency and provides a vibration in response to an input signal. The receiver is configured to sense received vibration from the LRA. The transmitter is configured to provide the input signal to the LRA. The receiver is coupled with the transmitter and provides vibrational feedback based on the received vibration. The input signal incorporates the vibrational feedback.

Mobile devices, such as smart phones, are increasingly desired to provide a haptic response to users. Linear resonant actuators (LRAs) are frequently utilized to provide this haptic response. However, depending upon the driving frequency for the LRA, the haptic response of an LRA may be too small for use in a mobile device. Further, the desired characteristics of the haptic response from the LRA may be difficult to achieve. Consequently, an improved mechanism for providing a haptic response, particularly in a mobile device, is desired.


A furnace cleaning apparatus for cleaning a cyclone furnace with a fluid from a fluid source. The furnace cleaning apparatus comprises a beam assembly capable of being pivotably mounted to the cyclone furnace. A rotary actuator is connected to the beam assembly for turning the beam assembly. A trolley is movably mounted to the beam assembly. A chain drive assembly and a drive source for moving the trolley relative to the beam assembly are mounted to the beam assembly. An articulated arm assembly is pivotally connected to the trolley. A rotary actuator is mounted to the articulated arm assembly for pivoting the articulated arm assembly relative to the trolley. A nozzle is connected to a second end of the articulated arm assembly. A fluid conduit connects the nozzle to a fluid source.

1. Field of the Invention
The present invention relates to a cleaning apparatus for cleaning the interior surface of a housing such as a cyclone furnace or boiler.
2. Description Of the Prior Art.
Coal fired boilers are commonly used in industry, Pulverized coal is fed into a boiler-through a cyclone burner which receives the pulverized coal from a feeder apparatus connected to the inlet of the cyclone burner. Initial burning of the coal occurs inside the cyclone burner with further burning occurring in the boiler. The boiler is typically a water-cooled horizontal cylinder. Air with a velocity of approximately 300 feet per second is admitted tangentially at the roof of the main barrel of the cyclone furnace and imparts a further whirling or centrifugal action to the coal particles. The combustible is burned at temperatures sufficiently high to melt the ash into a liquid slag, which forms a layer on the interior walls of the cyclone furnace. Incoming coal particles are thrown to the interior walls by centrifugal force and held in the slag. The coal particles are then scrubbed by the high-velocity tangential air.
The interior walls of the cyclone furnace accumulate slag deposits from the burning coal particles. The slag deposits may sometimes be as much as three feet thick. It is well known that some amount of slag is beneficial to the combustion although too much slag is detrimental. Therefore, the interior walls of the cyclone furnace need periodic cleaning to reduce the slag deposits to the desired thickness.
U.S. Pat. No. 4,673,661 to Nelson et al. discloses a semi-automated cyclone furnace cleaning apparatus requiring an operator to enter the cyclone furnace and rearrange or replace high pressure fluid nozzles in order to clean the various inside surfaces of the cyclone furnace.
U.S. Pat. No. 5,107,873 to Clinger discloses an apparatus similar to that described in the '661 patent. The apparatus disclosed in the '661 patent and the '873 patent includes a pair of diametrically opposed lances which are intended to move transversely to the longitudinal axis of the cyclone furnace and includes a nozzle arrangement to provide either a longitudinal spray or a transverse spray normal to the direction of the longitudinal spray.
It is desirable to have a furnace cleaning apparatus which provides maximum versatility in the cleaning operations of the cyclone furnace. It is further desirable to be able to adjust the angle of the fluid spray against the cyclone furnace walls. It is also desirable that the furnace cleaning apparatus be capable of simultaneously moving longitudinally in the cyclone furnace while rotating about the longitudinal axis of the cyclone furnace and further being capable of simultaneous reorientation of the direction of the nozzle spray.


A bone anchoring device includes a receiving part including a rod receiving portion with a first end, a second end, and a U-shaped recess for receiving a rod, the recess defining two free legs, and a head receiving portion at the second end for introducing and clamping the head, and a locking ring configured to be arranged around the head receiving portion, the locking ring including an engagement structure for engagement with a tool, the engagement structure defining a width of the locking ring that is greater than a greatest width of the rod receiving portion, wherein the locking ring can assume a locking position exerting a greatest compressive force on the head receiving portion of the receiving part to lock an inserted head, and wherein the locking ring is movable out of the locking position towards the first end of the rod receiving portion.

1. Field of the Invention
The invention relates to a bone anchoring device including a bone anchoring element and a receiving part for coupling a rod to the bone anchoring element. The receiving part includes a rod receiving portion for receiving the rod and a head receiving portion that is flexible so as to allow introduction and clamping of a head of the bone anchoring element. The bone anchoring device further includes a locking ring arranged around the head receiving portion that can assume a locking position in which an inserted head is locked by compression of the head receiving portion of the receiving part. The locking ring has an outer surface with an engagement portion for engagement with a tool. The tool is configured to cooperate with the receiving part and the locking ring so as to allow releasing of the locking ring from a position in which the locking ring locks the head. The bone anchoring device can be realized, for example, in the form of a polyaxial bone screw.
2. Description of Related Art
US 200910149887 A1 discloses an apparatus for connecting a bone anchor to a support rod, the apparatus including a connector body and a cap. The connector body has a socket for insertion, angulation and removal of a bone anchor. A sleeve is provided, which is configured to fit over the connector body in a temporary position, in which the sleeve permits insertion of the bone anchor, to move to a provisional locking position, in which the sleeve permits angulation but prevents removal of the bone anchor, and to move to a locking position in which the sleeve prevents both angulation and removal of the bone anchor. Tools are provided for installing the connector body, the sleeve, a cap and the support rod.

Bone anchoring device and tool cooperating with such a bone anchoring device


Methods and systems for operating a fuel fired appliance that may include an optional hardware component such as a damper are disclosed. In some cases, the presence of the optional hardware component is detected, and it is determined whether the optional hardware component is required for future operation of the fuel fired appliance. The fuel fired appliance may be operated normally if the optional hardware component is present and required, or, in some cases, if the optional hardware component is determined to be not required. If the optional hardware component is absent but required, normal operation of the fuel fired appliance may be stopped.

Commercial and residential buildings often use fuel fired appliances such as water heaters, furnaces and boilers. In many cases, the fuel fired appliances include a combustion chamber with a flue that is vented to outside of the building (e.g. atmosphere) via a vent pipe or the like. During off-cycle periods, the fuel fired appliances can lose significant heat through the vent pipe or chimney by natural convection and/or conduction. To help reduce these losses, a damper can be installed either at the flue exit or in the vent pipe. Alternatively, two or more dampers may be used, such as a flue damper installed upstream of a draft diverter of the fuel fired appliance, and a vent damper installed downstream of the draft diverter.
In some cases, electric motor controlled flue dampers may be used and controlled by a damper controller or the like. In some cases, the damper(s) may be controlled to open when combustion starts, and close immediately or sometime after combustion stops. This may help minimize the off-cycle heat losses that may occur through the vent pipe or chimney of many fuel fired appliances.

Appliance control with automatic damper detection


Controlling data storage input/output requests is described, for example, to apply a policy to an end-to-end flow of data input/output requests between at least one computing entity and at least one store. In various examples a plurality of queues are configured at one or more stages of the end-to-end flow and controlled to adhere to a policy. In examples, each stage has a control interface enabling it to receive and execute control instructions from a controller which may be centralized or distributed. For example, the control instructions comprise queuing rules and/or queue configurations. In various examples queues and queuing rules are dynamically created and revised according to feedback about any of: flow behavior, changes in policy, changes in infrastructure or other factors. In examples, high level identifiers of the flow endpoints are resolved, on a per stage basis, to low level identifiers suitable for use by the stage.

Data storage systems such as large data centers and other types of data storage system are increasingly complex. The input/output path to storage is often long and comprises many layers with opaque interfaces between them. This makes it hard to enforce end-to-end policies that dictate a storage input/output flow's performance, for example, to guarantee a particular bandwidth available for the flow. A storage input/output flow comprises a stream of storage input/output requests between storage and computing endpoints. For example, to read data from a file, write data to a file or create a file to store data.
Virtualization of physical servers and virtualization of storage in enterprise data centers has led to increased complexity along storage input/output flows.
The embodiments described below are not limited to implementations which solve any or all of the disadvantages of known data storage systems.

Systems and methods based on policy criteria for controlling the flow of data storage input/output requests between endpoints


The disclosure relates to a processing installation for aircraft structural components having at least one processing station, wherein the processing station has a clamping frame which extends along a longitudinal station axis for receiving the aircraft structural component which is intended to be processed in each case and a processing unit, such as a riveting unit, for processing the aircraft structural component and wherein the clamping frame is articulated so as to be adjustable in terms of height and pivotable to two positioning towers which are arranged in a vertical tower plane. It is proposed that there be provided transversely relative to the tower plane a transverse offset of the clamping frame which enables an aircraft structural component to be loaded onto and/or unloaded from the clamping frame along the tower plane and at least one positioning tower to be passed laterally.

The production of flying objects and in particular aircraft involves processing large aircraft structural components such as, for example, the wing and the fuselage or portions thereof in special processing installations.
The known processing installation (DE 20 2013 003 544 U1), on which the disclosure is based, has a processing station with a clamping frame for receiving the aircraft structural component which is intended to be processed in each case. The processing station is further provided with a processing unit which is constructed as a riveting unit.
For the processing of the aircraft structural components, an orientation between the clamping frame and the processing unit is required. With regard to the often freeform-like surface geometries of the aircraft structural components, the orientation is based on an at least two-axis pivoting adjustment. In the known processing installation, the clamping frame can be pivoted by means of end-side pivot bearings about a longitudinal frame axis. Furthermore, the pivot bearings are articulated so as to be able to be adjusted in terms of height to positioning towers which are arranged in a vertical door plane, whereby the pivotability of the clamping frame can be produced about substantially any notional transverse frame axes.
It is advantageous with the known processing installation that, in view of the above pivotability of the clamping frame, a pivotability of the rivet unit which regularly has an upper tool and a lower tool is not required. This simplifies the mechanical structure of the processing unit.
A challenge with the known processing installation is, however, the loading and unloading of an aircraft structural component onto or from the clamping frame. The reason for this is the necessity of the positioning towers in order to enable the pivotability about a notional transverse frame axis. In the known processing installation, loading and unloading is possible only transversely relative to the longitudinal station axis without a collision occurring with the positioning towers. As a result, linear production in which the aircraft structural component is transported cyclically along a longitudinal station axis from processing station to processing station is possible only with great handling complexity.

Processing system for aircraft structural components


An improved double down wager for blackjack involves offering the player a split double option. The split double option may be either in lieu of, or in addition to, a standard double down option. Originally, when a player elects a split double option, the player places a wager increase to the initial wager. The dealer then deals the player n additional cards. Each of the cards is separately used in combination with the initial cards to form a separate player final hand. The total wager is likewise divided into individual wagers for each player final hand so constructed. Each player final hand is then evaluated and resolved against the dealer's final hand with individual wagers being separately resolved.

Many casino games include players playing against the casino to obtain a player hand having a value closer to a target value than the house hand. Blackjack, for example, is a well known card game played in casinos. The object of the game is to have a final hand total closer to twenty-one than the dealer's final hand total without exceeding twenty-one. For purposes of calculating the final hand total, each card has a value equal to its face value except face cards, which have a value of ten, and aces, which may have a value of eleven or one as the player selects. In conventional Blackjack, the suit of the cards is irrelevant.
The form of Blackjack played in casinos is played between a dealer, representing the house, and at least one player. In a typical Blackjack game, each player makes a base wager in a wagering area on a playing surface. The dealer deals two cards to each player and two cards, one card face up and the other face down, to himself or herself.
If the dealer does not have a natural twenty one, any player receiving a natural twenty-one or Blackjack, i.e. a total of twenty-one in the initial dealt hand, is immediately rewarded, typically at a rate of 2:1, 3:2, or 6:5 and play is terminated as to that player. Each remaining player examines the player's hand and decides whether to hit, i.e. receive another card, or stand, i.e. stand on the player's current hand. A player may hit as many times as the player wishes as long as the player does not bust, i.e. receive a card causing his cumulative total to exceed twenty-one. When a player busts, the player's wager is immediately collected and play is terminated as to that player.
A player may also have additional options available depending on the initial player hand dealt. If the player receives a pair, i.e. two cards having the same face value, the player may split the pair and use each card as a basis for a separate hand. For example, if a player were to be dealt a pair of eights, the player may choose to split the pair and continue play with two hands each having an eight and an additional dealt card. Each of those individual hands is then played independently.
A player may also have the option to double down. Although the availability of the double down option vary from casino to casino, the option allows a player to double the player's wager in exchange for a single additional card. This option is typically selected when a player feels that he has a better than even chance of winning with drawing only a single card. This is often the case when the player has an initial two-card total of eleven, so that any face card will give the player a total of twenty-one, or when the dealer has a face-up card of a five or six, and the player feels it likely that the dealer will bust.
After all the players have played their hands, the dealer reveals the face-down card in the dealer's hand. The dealer plays the dealer's hand according to established house rules. That is, the casino uses established rules to eliminate the dealer's discretion. The dealer hits or stands as the house rules dictate, and resolves the wagers. In resolving the wagers, players with a final hand total closer to twenty-one than the dealer's final hand total are rewarded at 1:1. Conversely, wagers are collected from players with a final hand total further from twenty-one than the dealer's final hand total. If the dealer busts, all players who did not bust or receive a Blackjack are rewarded. If the player and dealer push, i.e. have the same final hand total, the player's wager is returned.
One drawback to this game is that players may be intimidated by the additional risk involved in the double-down wager. While the player may have a good chance of winning on the doubled wager, the all-or-nothing nature of the wager means that there is also a non-trivial chance that the player may lose double. Players may fear the disaster of holding an eleven and drawing an ace, and being "stuck" with a total of twelve. While the dealer may still bust, he may not, and the player will lose to any non-bust dealer hand. Many players may hesitate to take this risk. Thus, there is a need in the art for a method of reducing this risk of a doubled loss, while not affecting the expected value of the hand, for either the player or the casino.

Method for providing a blackjack double down wager


An endoprosthesis utilizes a biomechanical structure based on the lever model of first degree. Contrary to the widespread practice, the inventive structure has a stem placed inside the femur bone, which is not rigidly attached to this bone. Accordingly, the bone, following its known tendency to slightly pivot away from the medial plane of the body in response to the loads, does not directly contact the stem. The neck portion experiences even greater loads then the stem. The supporting anchor has a region extending laterally from the stem and pressing against a supporting surface of the housing, which also extends laterally from the body of the housing. Since the stem, supporting anchor and neck are typically constitute a one-piece component, the lateral surfaces of the supporting anchor and housing are in continuous frictional contact during displacement of the stem and housing relative to one another.

Replacement devices such as artificial joints in general and especially those for the hip have been known for many years. Such replacement devices include substitute members for the two parts of the natural joint, namely the femoral head, which is joined to the femur, and the hip socket, which receives and cooperates with the head to provide a natural universal joint.
Replacement of the natural hip joint parts is necessary when deterioration has occurred to one or both of the natural femoral head and socket. Ideally, the replacement members should reproduce the structure and function of the original members. For example, it is important that the femoral head be securely attached to the femur, that the head be received within the socket and that the resulting joint be produced with the desirable degree of resilience or cushioning.
All known prior art, for example U.S. Pat. No. 4,770,661 and U.S. Pat. No. 4,159,544 disclose a system associated with resorption of bone tissue, protrusion of the bottom of acetabulum, and loosening of the stem due to a relatively high pressure upon the bone. Furthermore, localized pressure generated by the prosthesis parts causes greater than naturally occurring displacement of the stem from its initial position. Particularly, in the upper part, the stem tends to move medially, while in the lower part, it moves outwardly laterally.
Currently used endoprosthesis models typically take into consideration the biomechanics of the femur, which is rather similar to a console. This view is applied both to normal hip joints and total joint replacements and is usually realized by a system configured to rigidly fix the stem of endoprosthesis to the surrounding bone. Typically, to further this goal, the stem may have various geometrical forms for compressive fixation; alternatively or in addition to the specifically designed forms, it is not uncommon to cement the stem to the bone.
The clinical practice and numerous data show that this approach may not fully take into consideration the following:                even after milling of the channel through the femur diaphysis, the femur bone still contains a live tissue requiring circulation of tissue fluid, which may be detrimentally affected by cementing, and        during walking, the femur bone rotates around its long axis thus gradually weakening a bond between this bone and the prosthesis. (See Guide to prosthetics, N. Kondrashin, Moscow, "Medicine" 1988, pages 87,88).


The present invention provides a method for electrohydrodynamic jet printing curved piezoelectric ceramics. First, a stable pressure is provided for a piezoelectric ceramic slurry to ensure that the slurry flows out from a nozzle at a fixed flow rate, and at the same time, an electric field is applied to the piezoelectric ceramic slurry at the nozzle to form a stable fine jet; then a curved substrate is fixed on a fixture of a curved substrate six-axis linkage module to ensure that the curved substrate is always perpendicular to the jet of the nozzle and keeps a constant distance from the nozzle during a printing process; fine jet drop on demand is realized through cooperative control of the changes of the curved substrate six-axis linkage module, the electric field and a flow field, and electrohydrodynamic jet printing and molding of curved piezoelectric ceramics is finally realized.

In recent years, intelligent equipment has continually developed in the direction of miniaturization, integration and intelligentization. This status puts forward higher requirements for electromechanical systems, and functions such as comprehensive spatial information collection and curved surface driving deformation need to be realized. In the field of sensing and driving, piezoelectric ceramics, as sensitive sensing and driving elements, are widely used due to the advantages such as fast response, simple structure and high sensitivity.
At present, a deformable wing aircraft in the field of aerospace need to integrate hundreds of piezoelectric micro-drivers on a curved wing surface to achieve coordinated deformation. A submarine in the field of navigation engineering need to capture multi-directional signals in space to achieve accurate navigation control of the submarine; and a hydrophone of a marine early warning sonar system need to perceive information in different directions in a water area to realize accurate identification of unknown objects in various directions. However, piezoelectric sensing and driving sensitive elements generally have planar structures. When sensing and driving is carried out for spatial curved structures, piezoelectric ceramic blocks are usually processed into thin sheets to be installed on a curved substrate by splicing, pasting, etc. This method has the problems such as low precision and difficulty in pasting, which limits the sensitivity and reliability of complex curved surface sensing and driving. In addition, this method also has the problems such as adhesive creep and low bonding strength between piezoelectric ceramics and a substrate, which seriously affects the performance of devices.

Method for electrohydrodynamic jet printing curved piezoelectric ceramics