Abstract: The present invention eliminates redundant array range checks. A two-phased check is performed, namely a wide range check is performed by combining a plurality of array range checks, and a strict range check is unsuccessful, so as to reduce the number of range checks at execution time and allow execution at high speed. For instance, it is possible with a processor such as PowerPC, by using a flag, to invalidate a code for performing an array range check at high speed without increasing a code size. Consequently, the number of array range checks to be executed can be reduced so as to allow execution at high speed. Also, for instance, a plurality of array range checks can be combined without considering existence of instructions which cause a side effect. Consequently, the number of array range checks to be executed can be reduced so as to allow execution at high speed.

Abstract: A method of forming a silicon-on-insulator (SOI) metal oxide semiconductor field effect transistor (MOSFET) device is provided. The SOI MOSFET device includes a polysilicon back-gate which controls the threshold voltage of a polysilicon-containing front-gate. The back-gate functions as a dynamic threshold voltage control system in the SOI MOSFET device because it is suitable for use during circuit/system active periods and during circuit/system idle periods.

Abstract: Digital signatures of various aspects or characterizing indicia of object code classes are used to determine whether a compiled class has built-in assumptions about external classes that are incorrect due to modification and recompilation of the external class. The indicia generally involve an encoding of the layout of various run time structures in the external class such as field tables or method tables.

Abstract: Loop allocation for optimizing compilers includes the generation of a program dependence graph for a source code segment. Control dependence graph representations of the nested loops, from innermost to outermost, are generated and data dependence graph representations are generated for each level of nested loop as constrained by the control dependence graph. An interference graph is generated with the nodes of the data dependence graph. Weights are generated for the edges of the interference graph reflecting the affinity between statements represented by the nodes joined by the edges. Nodes in the interference graph are given weights reflecting resource usage by the statements associated with the nodes. The interference graph is partitioned using a profitability test based on the weights of edges and nodes and on a correctness test based on the reachability of nodes in the data dependence graph. Code is emitted based on the partitioned interference graph.

Abstract: A method and system for optimizing the representation of objects in an object-oriented programming language to reduce the memory requirement during the execution of the program, includes identifying the lifetimes of the various members of objects belonging to various classes. Next, the method uses the lifetime information to generate representations of objects belonging to these collections. Memory requirements are optimized by having members which do not have overlapping lifetimes share the same memory location.

Abstract: A method of self-trimming pattern, includes forming a pattern containing a plurality of regular or irregular features within a first material deposited on a substrate, depositing a conformal layer of second material, and etching the second material to form spacers of the second material along the sidewalls of the features in the first material.

Abstract: A complementary metal oxide semiconductor (CMOS) device having silicide contacts that are self-aligned to deep junction edges formed within a surface of a semiconductor substrate as well as a method of manufacturing the same are disclosed. Specifically, the CMOS device includes a plurality of patterned gate stack regions formed on a surface of a semiconductor substrate. Each plurality of patterned gate stack regions includes an L-shaped nitride spacer formed on exposed vertical sidewalls thereof, the L-shaped nitride spacer having a vertical element and a horizontal element, wherein the horizontal element is formed on a portion of the substrate that abuts each patterned gate stack region. Silicide contacts are located on other portions of the semiconductor substrate between adjacent patterned gate stack regions not containing the horizontal element of the L-shaped nitride spacer.

Abstract: A source image and image processing content are stored. If a processed image is requested, the source image is processed according to the processing content and the processed image is displayed. When a source image (unprocessed image) associated with a database is read, a corresponding processed image is displayed according to the processing content stored. An item(s) of processing content instructed to be undone is deleted from the processing content stored, and image processing is then retried according to the processing content after the deletion.

Abstract: A TCP-connection-router performs encapsulated clustering by dividing each encapsulated cluster into several Virtual EC (VECs), dynamically distributing incoming connections within a VEC based on current server load metrics according to a configurable policy. In one embodiment, the connection router supports dynamic configuration of the cluster, and enables transparent recovery which provides uninterrupted service to the VEC clients.

Abstract: A method and system for facilitating the selection of icons. Those icons which are next likely to be used are selected and automatically moved towards a cursor thereby facilitating selection of the icons. Additionally, those icons likely to be used or other icons selected by a user may track the cursor such that those icons are always close to the cursor and capable of being easily selected. Further, in order to facilitate selection of icons, icons are provided with the capability of announcing themselves when a cursor comes close to the icon. In addition, it is possible to reduce the amount of clutter on a computer display so that icons may be easily selected. In order to clean up a computer display, icons which are least likely to be used are faded, eliminated or shrunk to a smaller size. In another embodiment, icons that are not used very often may disappear into a master icon and further, icons which have a conceptual relationship between them may be linked by a visual graphical representation.

Abstract: A video server is provided with buffer manager which balances the loads on the various "movie storage" elements of a video server by preferentially buffering streams on highly loaded storage elements. The allocation of buffer takes place only when the storage element load increases due to the arrival of a new request or when buffer becomes available due to the pausing or stopping of an old request.

Abstract: An apparatus and method includes segmenting each sequence to be stored in a database into nonoverlapping or minimally overlapping subsequences with equal length. Each subsequence is then normalized using a normalization procedure (such as normalized with respect to the energy or maximum amplitude of each sequence) and transformed into a series of coefficients in a feature space. The search is based on hierarchical correlation in the feature space between the target sequence with the subsequences. The correlation between the target sequence and the stored sequences is performed first at the lowest level in the hierarchy. At any given level, a match is declared when the correlated result is larger than a specific threshold. Sequences that fail to satisfy the matching criterion are discarded. The process is continued at the following level until the highest level is reached. Because of the hierarchical search, linear scan of the entire sequence can be avoided.

Abstract: A system and method for caching sequential data streams in a cache storage device. For each information stream, a determination is made as to whether its data blocks should discarded from cache as they are read by a consuming process. Responsive to a determination that the data blocks of a stream should be discarded from the cache are read by the consuming process, the data blocks associated with that stream are cached in accordance with an interval caching algorithm. Alternatively, responsive to a determination that the data blocks of a stream should not be discarded from the cache storage device as they are read by the consuming process, the data blocks of that stream are cached in accordance with a segment caching algorithm.

Abstract: A system and method are provided for determining load capacity of a system. Physical components of the system and their interconnection are identified. The physical components are converted into logical components such that at least one logical component is created by grouping a plurality of the physical components and such that a load on the logical component will result in an approximately fixed proportional load on the plurality of physical components. Links between the logical components and a proportion of the load placed on each link between a source and destination pair are determined. A model of the logical components and interconnection of the logical components in is then stored in an electronically accessible data structure formed in a memory. A system and method for determining a path for routing data between a source and a destination pair in a system are also provided.

Abstract: A system and method for scheduling the number of channels in video-on-demand servers so as to deal with time varying load. The scheduling process is hierarchical. A higher level scheduler controls the rate of channel consumption based on anticipated load, and a lower level scheduler selects the waiting client requests to be served when a channel is allocated by the higher level scheduler.

Abstract: A system and method of using spare disk bandwidth and buffer capacity maximizes the system throughput of a multimedia server. An important issue is determining a criterion for selecting a data stream for which the additional disk bandwidth should be used. Minimization of buffer consumption is selected as the criterion to select an appropriate media stream to use the spare system resources. Buffer consumption measures not only the amount of buffer but also the amount of time the space is occupied (i.e., the space-time product). Even though both currently active streams and waiting streams can be chosen to adjust the rate of retrieval, it is generally more effective for the active streams.

Abstract: A system and method are provided for processing filesystem commands for use in a computing system of a type in which a filesystem can be mounted multiple access modes. Responsive to a remount command, the filesystem access mode is changed from a present access mode (such as read-only) to another access mode (such as read-write) without disruption of the processes executing in the computing system.

Abstract: Portions of multimedia program (presentation) are repetitively broadcast to receiving stations with subsequent portions being broadcast less frequently than preceding portions. Blocks of at least one of the portions are broadcast in varying permutations from one repetition to a next repetition. Further, each portion is of a length which is proportional to a sum of the lengths of all preceding portions. A receiver is provided with selects blocks to be skipped (in a pyramid type broadcast) based on information indicative of the permutation selected by the server. The receiver determines the number of blocks to skip before buffering the next block for the video being viewed.

Abstract: A data processing system and method which manages lock requests at both the transaction and process levels. A lock manager allocates one lock request block (LRB) per process and identifies the ownership of the lock by storing process, transaction and shared IDs in the LRB. The process ID is used to identify which lock to release when a process wants to release the lock before transaction commit while the transaction ID is used to identify all locks to be released at the commit/roll back time of the transaction. The shared ID is a unique value which identifies the lock. The LRB also has a granted transaction mode (GTM) field which stores a value representing the upper bound of the lock modes granted to the transaction. Whenever a lock is granted or released, the GTM of the transaction is recomputed.

Abstract: A system and method of transforming the standard compressed media stream used for distribution to a local form for a client station. A media stream is downloaded from an input source to a device in the local station and then played out the video stream in the local station. During the playout, the stream is transformed to another storage format by altering the standard/original compression form to a local form.