Abstract:
Electronic information is made more readily available to one or more access requesters based on an anticipated demand for the electronic information using a process, system or computer software. For instance, electronic information stored on a first storage medium is identified for transport (e.g., in response to a request of at least one of the access requesters), and the electronic information is transported accordingly. Afterwards, a determination is made to store the electronic information on a second storage medium that is more accessible to the access requesters than the first storage medium. The determination is based on an anticipated demand of the access requestors for the electronic information. The anticipated demand is determined based at least on information that is not particular to any single access requestor. The electronic information then is stored on the second storage medium and the access requesters are provided access to the electronic information from the second storage medium.
Abstract:
A method of assembling an optical fiber connector includes the steps of providing a ferrule with an internal through passage, and using a gas for treating a surface of the internal through passage to enhance a bonding capability of the surface. Adhesive is introduced into at least a portion of the internal through passage and at least one optical fiber is secured to the surface of the internal through passage by the adhesive. Another method includes the steps of providing the ferrule with an internal through passage including a shoulder, a window that extends through a side surface, and a cap having at least a portion inserted into the window. Adhesive is introduced into at least a portion of the internal through passage and is in engagement with the shoulder for providing an axial stop for securing at least one optical fiber with respect to the internal through passage.
Abstract:
In its many embodiments, the present invention provides a novel class of pyrazolo[1,5-a]pyrimidine compounds as inhibitors of cyclin dependent kinases, methods of preparing such compounds, pharmaceutical compositions containing one or more such compounds, methods of preparing pharmaceutical formulations comprising one or more such compounds, and methods of treatment, prevention, inhibition, or amelioration of one or more diseases associated with the CDKs using such compounds or pharmaceutical compositions.
Abstract:
A method, apparatus, and article of manufacture for computer-implemented exploitation of database indexes. A statement is executed in a database stored on a data storage device connected to a computer. The database contains data. A model based on pattern matching for a user-defined predicate and selection of an index exploitation rule based on a matched user-defined predicate is provided to be used for exploiting an index to retrieve data from the database.
Abstract:
A female hardened fiber optic connector for terminating an end of a fiber optic cable that is suitable for making an optical connection with another hardened cable assembly and cable assemblies using the same are disclosed. The female hardened fiber optic connector includes a connector assembly, a crimp body, a connector sleeve, and female coupling housing. The connector sleeve has one or more orientation features that cooperate with one or more orientation features inside the female coupling housing. The crimp body has a first shell and a second shell for securing the connector assembly at a front end of the shells and a cable attachment region rearward of the front end for securing a cable.
Abstract:
A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.
Abstract:
Embodiments of the present invention generally relate to methods for removing contaminants and native oxides from substrate surfaces. The methods generally include exposing a substrate having an oxide layer thereon to an oxidizing source. The oxidizing source oxidizes an upper portion of the substrate beneath the oxide layer to form an oxide layer having an increased thickness. The oxide layer with the increased thickness is then removed to expose a clean surface of the substrate. The removal of the oxide layer generally includes removal of contaminants present in and on the oxide layer, especially those contaminants present at the interface of the oxide layer and the substrate. An epitaxial layer may then be formed on the clean surface of the substrate.
Abstract:
A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.