Abstract: Technologies are described herein for defining the scope of a sub-cube based upon a database query. A request is received to perform a query of a multi-dimensional database, such as a cube, stored at a server computer. In response to the request, the scope for a sub-portion, called a sub-cube, of the multi-dimensional database is determined based upon the query. The scope of the sub-cube may be determined by identifying the minimum sub-portion of the cube necessary to perform the query. Once the scope has been determined, the sub-cube is generated at the server computer and transmitted to a client computer. The client computer stores the sub-cube locally and performs the requested database query on the sub-cube stored at the client computer. A user interface may be provided through which a user can modify the scope of the sub-cube determined based upon the query.

Abstract: Organic compounds containing heteroatoms and their use in preparing Ziegler-Natta(Ziegler-Natta) catalyst with single activation center. The Ziegler-Natta olefin polymerization catalyst is preparing by adding organic or inorganic solid carrier or compound of them which is pre-activated by heating or pre-treated chemically, organic compound containing heteroatoms and metallic compound into magnesium compound/tetrahydrofuran solution. The Ziegler-Natta olefin polymerization catalyst prepared in the present invention is fluidizable powder and can prepare ethene homopolymer and copolymer of controllable construction with high catalytic activity, during homo-polymerization and combined polymerization with alpha-olefin of C3˜C18 under action of catalyst promoter such as alkyl aluminum, alkyl aluminoxane, and so on.

Abstract: An object oriented search mechanism extracts structural metadata and data based on type of document contents and data sources connected to the documents. Relationships between textual and non-textual elements within documents as well as metadata associated with the elements and data sources are utilized to generate a unified object model with the addition of semantic information derived from metadata and taxonomy, which are used to enhance search indexing, ranking of search results, and dynamic adjustment of result rendering user interface with fine tuned relevancy. Additional data from data sources connected to the documents may also be used to unlock hidden data such as data that has been filtered out in an original document.

Abstract: Relationships between linked and/or embedded documents as well as documents sharing data source(s) are captured and rendered through virtual documents. Virtual documents are created representing linked/embedded documents and data sources associated with a relevant document. Relationships between real and virtual documents are preserved and rendered along with search results providing a user a comprehensive picture of search results.

Abstract: Data processing architecture where submitters can write data and/or metadata changes to a destination through an asynchronous interface. The architecture includes a ticketing system that issues a ticket (a unique identifier) to the submitter in response to receiving a changelist from the submitter. When the changes are successfully completed at the destination, the cached destination data can be re-downloaded to the submitter, and the changes cached in the submitter, discarded. Absent this capability, a user has to manually manage the cached changes and cached data. The architecture can be distributed in that multiple submitters can submit changelists. The destination provides data integrity by managing submissions to assist in ensuring data integrity across multiple submissions. Automatic changelist cleanup is provided on the submitter so that changelists do not impact performance, memory, and storage.

Abstract: An object oriented search mechanism extracts structural metadata and data based on type of document contents and data sources connected to the documents. Relationships between textual and non-textual elements within documents as well as metadata associated with the elements and data sources are utilized to generate a unified object model with the addition of semantic information derived from metadata and taxonomy, which are used to enhance search indexing, ranking of search results, and dynamic adjustment of result rendering user interface with fine tuned relevancy. Additional data from data sources connected to the documents may also be used to unlock hidden data such as data that has been filtered out in an original document.

Abstract: A method to evaluate Electro-Myocardial Cardiogram (EmCG) parameters is disclosed. The method comprises calculating a Contraction Strength Strain (CSS) and Relaxation Strength Strain (RSS) index. The calculation is represented by a non-linear waveform that represents the excitement function and pump function of the heart.

Abstract: Data processing architecture where submitters can write data and/or metadata changes to a destination through an asynchronous interface. The architecture includes a ticketing system that issues a ticket (a unique identifier) to the submitter in response to receiving a changelist from the submitter. When the changes are successfully completed at the destination, the cached destination data can be re-downloaded to the submitter, and the changes cached in the submitter, discarded. Absent this capability, a user has to manually manage the cached changes and cached data. The architecture can be distributed in that multiple submitters can submit changelists. The destination provides data integrity by managing submissions to assist in ensuring data integrity across multiple submissions. Automatic changelist cleanup is provided on the submitter so that changelists do not impact performance, memory, and storage.

Abstract: Financial intelligence architecture that employs financial types that are combined with rules to build financial behavior into the product. Types have behaviors such that types can be assigned that lead to the physical creation of underlying code which embodies the behaviors. Extensibility is provided at least by type parameterization and new type creation. Because types are a design time experience, types are two-way and can be modified, even after instantiation. This allows for mixing and matching of types and underlying behavior giving the system more flexibility at design time while providing a huge simplification of all the details that actually go into such financial applications. The type library is a set of rules that produce metadata, which metadata is later processed by a separate engine to produce the physical schema. The type library defines the basic interactions, data types, and behaviors for predefined dimensions in the system.

Abstract: Data processing architecture where submitters can write data and/or metadata changes to a destination through an asynchronous interface. The architecture includes a ticketing system that issues a ticket (a unique identifier) to the submitter in response to receiving a changelist from the submitter. When the changes are successfully completed at the destination, the cached destination data can be re-downloaded to the submitter, and the changes cached in the submitter, discarded. Absent this capability, a user has to manually manage the cached changes and cached data. The architecture can be distributed in that multiple submitters can submit changelists. The destination provides data integrity by managing submissions to assist in ensuring data integrity across multiple submissions. Automatic changelist cleanup is provided on the submitter so that changelists do not impact performance, memory, and storage.

Abstract: Technologies are described herein for defining the scope of a sub-cube based upon a database query. A request is received to perform a query of a multi-dimensional database, such as a cube, stored at a server computer. In response to the request, the scope for a sub-portion, called a sub-cube, of the multi-dimensional database is determined based upon the query. The scope of the sub-cube may be determined by identifying the minimum sub-portion of the cube necessary to perform the query. Once the scope has been determined, the sub-cube is generated at the server computer and transmitted to a client computer. The client computer stores the sub-cube locally and performs the requested database query on the sub-cube stored at the client computer. A user interface may be provided through which a user can modify the scope of the sub-cube determined based upon the query.

Abstract: Tools and techniques are described for selecting member sets for generating asymmetric queries. User interfaces provided by this description may include representations of different dimensions that include respective members. These dimensions define hierarchical data structures against which queries are run to generate requested reports. The user interfaces may include representations of members associated with different dimensions, with members from different dimensions arranged in selected orders. The user interfaces may also provide selection tools that activate symmetrical or asymmetrical rendering modes for constructing the query. In the symmetrical rendering mode, the query cross-joins all of the members selected from one dimension with all of the members selected from the other dimension.

Abstract: Technologies are described herein for defining the scope of a sub-cube based upon a database query. A request is received to perform a query of a multi-dimensional database, such as a cube, stored at a server computer. In response to the request, the scope for a sub-portion, called a sub-cube, of the multi-dimensional database is determined based upon the query. The scope of the sub-cube may be determined by identifying the minimum sub-portion of the cube necessary to perform the query. Once the scope has been determined, the sub-cube is generated at the server computer and transmitted to a client computer. The client computer stores the sub-cube locally and performs the requested database query on the sub-cube stored at the client computer. A user interface may be provided through which a user can modify the scope of the sub-cube determined based upon the query.

Abstract: A parsing and indexing mechanism for dynamically generated reports is provided. Upon detection of a dynamically generated report, a data source for the dynamically generated report may be identified based on metadata or other information associated with the report. Crawleable or machine readable metadata and data may be generated using the data source such that data represented in the report and/or other relevant data from the data source can be indexed and searched.

Abstract: An object oriented search mechanism extracts structural metadata and data based on type of document contents and data sources connected to the documents. Relationships between textual and non-textual elements within documents as well as metadata associated with the elements and data sources are utilized to generate a unified object model with the addition of semantic information derived from metadata and taxonomy, which are used to enhance search indexing, ranking of search results, and dynamic adjustment of result rendering user interface with fine tuned relevancy. Additional data from data sources connected to the documents may also be used to unlock hidden data such as data that has been filtered out in an original document.

Abstract: Relationships between linked and/or embedded documents as well as documents sharing data source(s) are captured and rendered through virtual documents. Virtual documents are created representing linked/embedded documents and data sources associated with a relevant document. Relationships between real and virtual documents are preserved and rendered along with search results providing a user a comprehensive picture of search results.

Abstract: User role based customizable searches, where crawled documents may be evaluated against user roles or attributes during crawl time, are provided. Metadata retrieved from searched documents may also be evaluated against the user roles and/or attributes such that customized search results ranking documents based on their content beyond textual content may be provided.

Abstract: A disposable “Enhance Dynamic Flow Data” electrode, including: a flexible strips EDFD electrode and leads cable and voltage socket. Electrode with affixed program micro control chip, the chip having a positioned inside, the strips electrode have six electrode on one electrode with (V1,V2,V3,V4,V5,V6) attached of a receptor pad end connection with the skin for receiving electrical impulses and signal which is adapted for connection with an electro-cardiologram measuring on body chest apparatus. The specific enhance the dynamic flow signal configuration propriety for electrocardiography recording. An embodiment of the invention will be described in greater detail below with reference to the accompanying drawings which show an EDFD electrode and wire or wireless leads cable connect with device embodying the invention. Enhance bio-electrical signal's purity, thus enhances the test for more accuracy analysis finally.

Abstract: Sharable extended cell information is used by multidimensional data models to enable cell annotations and line item details. Annotations are notes stored with a cell in a multidimensional dataset. Line item details permit levels of numeric detail below the lowest dimensional granularity. When receiving a multidimensional dataset in response to a query, a client application receives indicator information at the cell level, indicating to the client application that extended cell information is retrievable.

Abstract: Data allocation is performed by translating a rule set to a query list. An allocation engine receives the rule set and the data and generates a query list. The query list may be in MDX or SQL syntax. After modifying the queries in the list into a list of physical queries that match the specific characteristic of the data store, a modeling abstraction layer provides the physical queries to the data store engine to perform the queries and provide the results to the allocation engine. The allocation engine allocates the data among existing or new hierarchical levels based on the query results. The allocated data may be stored in the same data store as the original data.