Abstract: A system that automatically matches schema elements is provided. In one aspect, given a selected element of one schema, the system can calculate the best matching candidate elements of another schema. The calculation can be based on a heuristic combination of factors, such as element names, element types, schema structure, existing matches, and the history of actions taken by the user. Accordingly, the best candidate (according to the calculation) can be emphasized and/or highlighted. The tool can auto-scroll to the best choice. Similarly, the user can request the calculation and display to best candidates by pressing a keyboard key or hot key. As well, the user can prompt display of the best candidates by using the mouse (e.g., moving the mouse over the element E or clicking on E), or both (e.g., mouse over with hot key depressed).

Abstract: A system and method facilitating data access operations is provided. The system can facilitate an executable, instance-level interaction between a source model (e.g., schema) expressed in a first metamodel (e.g., object-oriented metamodel) and a target model expressed in a second metamodel (e.g., SQL metamodel). The system can produce instance mappings to round-trip the data between the source schema and the generated target schema. For example, the system can support object-to-relational mapping scenarios that are common in business applications. Typically, in such applications the business logic runs on top of an object model, whereas the actual data is persisted in SQL databases. To shield the applications from impedance mismatch and storage management issues, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.

Abstract: The subject invention pertains to transaction processing systems and methodologies that allows update transactions to read stale data copies and update a data store therewith. Each transactional operation, including a read, can carry or be associated with one or more freshness constraints or tests that specify how fresh a data copy must be in order to be read. More specifically, the subject invention provides systems and methods that extend transactions and serializability to account for out-of-date reads that are justified by freshness requirements.

Abstract: A system that facilitates composition of schema mappings. A general algorithm is provided for composing a broad class of mappings, where one or both mappings are not functions, such as constraints between two schemas and the inverse of functions. A composition component performs composition on schema mappings of disparate data sources, which schema mappings can be expressed by at least one of full, embedded, and second-order dependencies, wherein the second-order dependencies need not be in source-to-target form. The algorithm for composition further includes a procedure that tests whether the composition algorithm will terminate.

Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Abstract: Maintaining versions and workspaces in an object repository is disclosed. The system provides an efficient way to manage versions of objects by only copying objects when absolutely necessary, i.e. when a property value in a particular object has changed. In addition, the system provides a mechanism to control whether or not relationships are propagated to successor versions of an object. A further aspect of the system is that resolution of objects during a relationship traversal can be customized depending on whether or not an application accessing the objects is version-aware. If the application is not version aware, a means for resolving the relationship to a particular object is provided. A still further aspect of the system is that merge behavior is parameterized. When two versions of an object are merged, flags control how conflicts in property values and relationship contents are managed.

Abstract: Maintaining versions and workspaces in an object repository is disclosed. The system provides an efficient way to manage versions of objects by only copying objects when absolutely necessary, i.e. when a property value in a particular object has changed. In addition, the system provides a mechanism to control whether or not relationships are propagated to successor versions of an object. A further aspect of the system is that resolution of objects during a relationship traversal can be customized depending on whether or not an application accessing the objects is version-aware. If the application is not version aware, a means for resolving the relationship to a particular object is provided. A still further aspect of the system is that merge behavior is parameterized. When two versions of an object are merged, flags control how conflicts in property values and relationship contents are managed.

Abstract: Systems and methods for automatically and generically matching models are provided, such as may be provided in a matching application or matching component, or provided in a general purpose system for managing models. The methods are generic since the methods apply to hierarchical data sets outside of any particular data model or application. Similarity coefficients are calculated for, and mappings are discovered between, schema elements based on their names, data types, constraints, and schema structure, using a broad set of techniques. Some of these techniques include the integrated use of linguistic and structural matching, context dependent matching of shared types, and a bias toward subtree, or leaf, structure where much of the schema content resides.

Abstract: Systems and methods for automatically and generically matching models are provided, such as may be provided in a matching application or matching component, or provided in a general purpose system for managing models. The methods are generic since the methods apply to hierarchical data sets outside of any particular data model or application. Similarity coefficients are calculated for, and mappings are discovered between, schema elements based on their names, data types, constraints, and schema structure, using a broad set of techniques. Some of these techniques include the integrated use of linguistic and structural matching, context dependent matching of shared types, and a bias toward subtree, or leaf, structure where much of the schema content resides.

Abstract: A color display facsimile of a cosmetic product comprised of the formulation of an original cosmetic product and prescribed amounts of each of a thermoplastic, copolymeric hardening agent and a hydrocarbonous-based temperature control component. The resultant display facsimile is capable of exhibiting the exact-likeness characteristics of true color, size, and shape of the original cosmetic product. The method for preparing said color display facsimile is also disclosed.

Abstract: A pencil barrel is prepared by extruding, shaping, and cooling, under controlled conditions, a foamable, thermoplastic resin-based composition. The combination of the particular extrudable composition and the means of shaping and cooling the tubular extrudate obtained therefrom are readily useful as barrels, i.e. sheaths, for sharpenable pencils, particularly in the cosmetic industry. The resultant pencil barrels are characterized by their sharpenability, uniform satin-matte smoothness, outstanding printability, and their prolonged resistance to atmospheric conditions. The method for making said pencil barrels is also disclosed.

Abstract: A color display facsimile of a cosmetic product comprised of the formulation of an original cosmetic product and prescribed amounts of each of a thermoplastic, copolymeric hardening agent and a hydrocarbonous-based temperature control component. The resultant display facsimile is capable of exhibiting the exact-likeness characteristics of true color, size, and shape of the original cosmetic product. The method for preparing said color display facsimile is also disclosed.

Abstract: A method for the encapsulation of pigment particles utilized in ink formulations by means of vinyl polymerization, within an aqueous medium, and the cosmetic products prepared with said ink formulations are disclosed. The method of encapsulation can be either that of free-radical polymerization, wherein a peroxide catalyst and a antioxidant are employed or that of a redox system wherein an ion-producing metallic pigment is utilized. The resultant cosmetic products are characterized by their overall smoothness, uniform color, and increased dispersibility of the ink formulations utilized therein, and, due to the presence of the ink formulation having the encapsulated pigment particles dispersed therein.

Abstract: A hydrocarbonous-based cosmetic product, such as a lipstick, has its surface treated by means of a plasma treatment process employing a halogen gas. The treated (i.e., halogenated) surface has a uniform, satin-matte finish, as well as a lower wetting angle with respect to certain materials capable of providing the cosmetic product with an ultra-glossy finish. Thus, if such materials are subsequently applied to the halogenated surface of the cosmetic product, the cosmetic product can be provided with an ultra-glossy finish.

Abstract: Molded cosmetic products, containing a uniform ultra glossy wet look surface finish are molded in polymeric molds or mold inserts whose inner walls have been modified by subjecting them to a plasma treatment. This allows an improved release of the products and imparts the wet look surface finish to the cosmetic products.

Abstract: A module of a thermoplastic impregnated with a cosmetic color is fabricated using ethylene vinyl acetate (EVA) as the thermoplastic. The module may have an adhesive layer secured to one surface for securing the module to various carrier substrates as cosmetic containers, carrier dispensing layers or the skin of a user for providing a true indication of cosmetic color. The cosmetic color may actually be a sample of the cosmetic being provided or a sample of the color formulation as prepared during the manufacture of the cosmetic.

Abstract: A compact case has a lid which forms a joint with an associated base when the lid is in its closed position relative to the base. A magnetic sealing mechanism positively seals substantially the entire length of the joint. The magnetic sealing mechanism can also function to releasably and moveably secure cosmetic product containers and cosmetic implements and accessories to the compact case.

Abstract: A cosmetic compact case includes an elongated body which is provided with a plurality of cosmetic-containing receptacles on an exterior surface thereof. Access to the cosmetic material contained in the receptacles is controlled by a cover which is slideably mounted on the body of the compact case.