91 results about "Iterator" patented technology

A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.

Loading data from a computer memory system is disclosed. A memory system is provided, wherein some or all data stored in the memory system is organized as one or more pointer-linked data structures. One or more iterator registers are provided. A first pointer chain is loaded, having two or more pointers leading to a first element of a selected pointer-linked data structure to a selected iterator register. A second pointer chain is loaded, having two or more pointers leading to a second element of the selected pointer-linked data structure to the selected iterator register. The loading of the second pointer chain reuses portions of the first pointer chain that are common with the second pointer chain.Modifying data stored in a computer memory system is disclosed. A memory system is provided. One or more iterator registers are provided, wherein the iterator registers each include two or more pointer fields for storing two or more pointers that form a pointer chain leading to a data element. A local state associated with a selected iterator register is generated by performing one or more register operations relating to the selected iterator register and involving pointers in the pointer fields of the selected iterator register. A pointer-linked data structure is updated in the memory system according to the local state.

A controlled database system is designed for rapid access of data records with reduced memory storage requirements. The database system employs a set of obfuscated data records stored in data crystals that can only be accessed and read by an iterator, which is not directly accessible by the users of the database. The iterator accesses information responsive to a predefined query sent from a customer application. Rather than providing general tools to customers for constructing any possible queries, such as is done in structured query language database systems, database systems embodying the present invention allow only predefined types of queries to be used by customer applications. By restricting the types of queries customer applications can call, valuable data records remain secure from unauthorized reconstruction or duplication while still allowing limited access for specific purposes.

A method is disclosed that allows the concise implementation of one protocol encoding / decoding device for syntax conversion between an abstract data syntax and a transfer syntax presented in an open-ended variety of input / output / storage mediums, including, but not limited to random-access memory, disk files, communications sockets, buffer lists, and other static or dynamically-extensible storage structures. The abstract syntax is described using the Abstract Syntax Notation One standard and presented in a higher-level object-oriented programming language such as C++. The transfer syntax is specified by standardized encoding rules and results in a stream of octets (unsigned 8-bit characters) suitable for communication transport using the Open Systems Interconnection (OSI) protocol model. The result of encoding (which is also the input for decoding) is called a protocol data unit (PDU). For different applications, it may be useful to present the PDU using various input / output or storage mediums such as listed above. The disclosed method employs a template function parameterized on an octet output iterator interface to provide an ASN.1 encoding mechanism, and a corresponding template function parameterized on an octet input iterator interface to provide an ASN.1 decoding mechanism, both independent of the medium in which the PDU is presented.

A method of satsfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.

The present invention relates to a method for planning and scheduling timed task. Its kernel lies in that based on timing iterator it utilizes at least two line processes to schedule and execute plan-scheduled timed task. Said invention can make the plan be self-contained by means of mode of timed iterator, so that it is favorable for implementing any complex plan. Besides, when the timing iterator is implemented, it can use a calendar algorithm, so that it can eliminate deviation of daylight saving time, and can ensure planning accuracy.

Methods for structuring electronic documents having an ordered set of cells (e.g., spreadsheets or web documents) are provided. In general, the methods provide for multidimensionality by allowing cells to be split by splitting operators, thus allowing cells to contain additional groups of cells, and recursively so. Disclosed are tools and operations for building and modifying various multi-dimensional structures and for interacting with them. Splitting operators provide a two-dimensional equivalent of lexical scopes and iterators in programming languages and allow a direct mapping to external data structures. With these features, the disclosed methods are able to combine the flexibility and unstructured nature of traditional spreadsheet with the structuring capabilities of online analytic processing (OLAP)-based tools.

A computer implemented method for processing tasks is disclosed. The method includes invoking a timed iterator, during an event loop pass, without spawning a new thread, wherein the invoking includes passing a task list and a timeout constraint to the timed iterator. The method further includes executing one or more tasks in the task list for a period of time as specified in the timeout constraint, and relinquishing program control to a caller after the period of time.

The invention discloses a feature point line-based monocular camera pose estimation and optimization method and system. The method comprises the following steps of: S1, constructing an overdeterminedlinear system on the basis of a point constraint and a line constraint, and establishing a relationship between rotation matrixes and translation vectors; constructing a total cost function by utilizing a least square method according to cost functions of sub-constraints of the point constraint and the line constraint, obtaining a final cost function through importing Kaili parameter expression, and solving a rotation matrix and a translation vector of camera pose by utilizing the final cost function; and S2, importing a Sampson error in the point constraint and the line constraint to construct a target function, and optimizing the rotation matrix and the translation vector by adoption of an FNS iterator by taking the rotation matrix and the translation vector obtained in the step S2 as initial values. The method and system are unlimited to monocular photo obtaining equipment and photo scenes, are suitable for photos of vehicle-mounted monocular cameras, onboard monocular cameras and handheld monocular cameras, and are also suitable for photos in road scenes, aviation scenes and indoor scenes.

Methods for structuring electronic documents having an ordered set of cells (e.g., spreadsheets or web documents) are provided. In general, the methods provide for multidimensionality by allowing cells to be split by splitting operators, thus allowing cells to contain additional groups of cells, and recursively so. Disclosed are tools and operations for building and modifying various multi-dimensional structures and for interacting with them. Splitting operators provide a two-dimensional equivalent of lexical scopes and iterators in programming languages and allow a direct mapping to external data structures. With these features, the disclosed methods are able to combine the flexibility and unstructured nature of traditional spreadsheet with the structuring capabilities of online analytic processing (OLAP)-based tools.

A tomography system based on Cerenkov tomography, comprising: a detector of Cerenkov fluorescence for acquiring optical plane images; a structural imaging system for acquiring three-dimensional structural images;a bed device for supporting an object to be imaged; a computer for forming an optical image, a structural image and a CLT image. The invention adopts the SP3 model and the semi threshold iterator to implement the global reconstruction of the CLT, and obtains the three-dimensional tomography to image of the distribution of the radiopharmaceutical and the molecular probe in vivo within a short time. Since ordinary CCD camera is used, the cost of the imaging system has been sharply reduced for the equipment's construct and maintenance compared with PET / SPECT or γ camera. Therefore the present invention expands the options of the molecular probe, and application of the is medicine Imaging.

The invention provides a 3D (Three-Dimensional) graphic animation engine. The 3D graphic animation engine comprises a 3D graphic processing module and an OpenGL (Open Graphics Library) bottom layer, wherein the 3D graphic processing module can provide a large amount of geometric calculations and is used for establishing and leading in various meshing models, and the OpenGL bottom layer is used for realizing the drawing and the rendering of a graph; the 3D graphic processing module and the OpenGL bottom layer are encapsulated; the 3D graphic processing module comprises a view, a module and an iterator; the view is an interface which is used for connecting the module and the iterator; the module comprises a public data area, a data interface and a graph drawing interface, the public data area is used for storing public data of the module, the data interface is used for providing a method for a mobile phone operation system and / or a parent module of the module to modify the public data in the public data area, and the graph drawing interface is used for realizing module drawing by the mobile phone operation system during a drawing thread according to the public data of the public data area. The 3D graphic animation engine provided by the invention is suitable for mobile phone operation systems and can be used for effectively and smoothly displaying all kinds of two-dimensional or three-dimensional graphic animations.

Compiler techniques for inline parallelism and re-targetable parallel runtime execution of logic iterators enables selection thereof from the source code or dynamically during the object code execution.

A method, system, apparatus, and computer program product is presented for management of a distributed data processing system. The present invention uses an improved iterator methodology to dynamically adapt the administrative communication operations of the network management system so as to minimize the potential impact on system performance, including customer applications, that might be caused by system management operations. In particular, the adjustments to the operations occur in accordance with a phase or life cycle state of system management applications.

The present invention includes inquiry manager for receiving user inquiry, database system for storing object data, incidence relation configuration management unit storing object incidence relation, chart manager storing managing object incidence relation chart, and algorithm iterator for solving route in said incidence relation chart. Said inquiry manager can generate correlate inquiry according to chart manager returned optimal path and transmitting to said database system to proceed inquiry. The present invention also provides a correlate inquiry method. The present invention simplifies complicate multiple stage correlate inquiry into chart resolution through establishing object incidence relation chart.

Described herein are approaches for generating execution plans for database commands that include an in-list predicate. The approaches can be used to generate execution plans that exploit the power of in-list iterators in ways and under circumstances not previously supported by conventional DBMSs. An in-list iterator may be used with execution subplans for processing multi-column in-list queries. An in-list iterator is used with execution subplans that scan function-based indexes. The execution plans for a multi-column in-list query limit table scans to only table partitions that contain data that satisfy the query.

Disclosed is a technique for processing predicates in an iterator function. When an iterator function included in a statement is invoked, one or more predicates included in the statement are obtained. The one or more predicates are applied to a row of data. If applying the one or more predicates results in a match, the row of data is returned. If applying the one or more predicates does not result in a match, a search is performed for another row of data for which application of the one or more predicates results in a match. Also disclosed is a technique for processing predicates in which a statement including an iterator function and one or more predicates is received. A qualification descriptor that describes the one or more predicates and one or more functions that are to be used to evaluate the one or more predicates is created. Then, the iterator function is invoked one or more times, until receiving a done indicator from the iterator function.

In a web-page-based system for designing database driven web applications, a page is initiated containing one or more top level iterators. A user introduces fields to the page from a palette including: input, display, hyperlink, iterator. In one case, the user creates iterators nested in a user-selected iterator, and retaining context of the selected iterator, where the system accommodates iterators that are recursive. In an alternative embodiment, the user adds both display and entry fields pertaining to a given user-selected iterator, retaining context of the selected iterator. Responsive to user introduced fields, the system automatically creates representative data structures in a database and automatically relates fields of the pages to the data structures in accordance with a predetermined logic.

The invention discloses a MapReduce-based CDC (Change Data Capture) method of an MYSQL database. The MapReduce-based CDC method comprises the steps of (1) generating a query statement 'select into outfile' of an abstract, and setting a zone bit according to a FIELDS clause; inserting an 'attribute value separator' into a line of tuples obtained by searching the database by the 'select into outfile'; generating abstract md5value and generating an output format for a searching result of 'select into outfile' according to a zone bit value; writing the searching result into a disk file outfile; (2) calculating difference by adopting a Hadoop MapReduce parallel framework; reading in two snapshoot files of old.txt and new.txt from a map end, storing a value of same keys in a Key / value structure in an iterator by a shuffle function of MapReduce, and synthesizing an output file of reduce into an insert file and a delete file, i.e obtaining a CDC result. According to the MapReduce-based CDC method disclosed by the invention, both grammar and implementation of the query statement in MYSQL is improved, a snapshoot file with the abstract can be generated by searching a data file of the database in one step, one I / O (Input / Output) is reduced by the generation of one snapshoot file, and a large amount of I / O can be reduced by multiple continuous snapshoot difference processes.

The invention belongs to the technical field of wireless communication, and discloses an RSSI indoor positioning and distance measuring method based on neural network learning, and an indoor positioning platform, wherein communication is established between a target node and an anchor node, and collected data is stored in a set RSSI[i] = {RSSIi1, RSSIi2, ..., RSSIiN}; setting a screening probability p, determining an upper limit value RSSImax and a lower limit value RSSImin according to a Gaussian model of the RSSI; storing the RSSI in a set RSSI[i] in a range of [RSSImin, RSSImax] into a setRSSI_gauss[i]; averaging RSSI values in the set RSSI_gauss[i]; training a strong separator by combining an algorithm of a particle swarm optimization neural network and an idea of an iterator; converting the RSSI into a distance between the anchor node and the target node by using the strong separator; and obtaining a solution of the target node by using a maximum likelihood estimation method. According to the method, the workload is reduced, the larger error existing in a single algorithm is reduced, and the accuracy of converting the RSSI value into the distance is improved, so that the positioning accuracy is improved.

The invention discloses an emotion detection method and system based on map expressions. The method includes collecting text data with map expressions, preprocessing the collected data, and convertinginto a word vector data set; and inputting a data set generated by a data preprocessing unit into a trained network model, the network model outputting a corresponding emotion detection result. The emotion detection method based on map expressions can realize emotion detection of user comments and the like; further, a multiple neural network and an attention mechanism are combined, thereby improving the identification degree of map expressions related with various emotions; the model is trained through an iterator, thereby saving internal storage; and through transfer learning, parameters that can be trained are gradually unfrozen, the risk of over-fitting after transfer learning is reduced as much as possible, and the characteristics of a pre-training model are fully kept.

The system includes following parts: query manager capable of receiving query requests; database system capable of storing data of objects to be mongered; authentication server in use for receiving request information of authentication from client end, and for sending the said information to the query manager; parsing the said information, and creating query statements, the query manager carries out query to the database system; object manager stores associated graph of relation of objects to be mongered; iterator of graph stores prearranged algorithms, which are in use for solving paths in the said associated graph of relation, and returns optimal result to the query manager. The invention also discloses method for carrying out authentication by using associated queries. Using associated graph of relation and root object to carry out authentication, the method possesses features of high efficiency, and easy of modifying associated relation.

A software wrapper for interfacing to pre-existing software code is provided. The software wrapper is capable of inheriting from a first application program interface (API) and a second API. For calls to the first API, the software wrapper delegates to a pre-existing enumeration of objects. The wrapper creates a vector identifying elements of the enumeration. Iterators provided by the wrapper maintain positional cursors for calls to the second API. A comparison is made between each of the positional cursors and the vector. If a positional cursor exceeds the size of the vector, additional elements are extracted from the enumeration, placed in the vector, and returned on the second API. Otherwise, if the positional cursor is smaller than the vector size, the wrapper delegates directly to the vector. The first API can be a java-based enumeration API and the second API can be a java-based collection API.

Methods and apparatus, including computer program products, implementing and using techniques for accessing and organizing data items, including items of digital media, such as digital images, video stream, audio stream, text documents and the like. An object model defines a plurality of data object classes, including a media object class for representing items of digital media and a tag object class for representing categories of digital media. A request for one or more data items specifies a search condition. A collection of one or more data objects instantiated from the data object classes is generated, whereby the data objects in the collection represent data items satisfying the search condition. An iterator configured to sequentially access the data items represented by the data objects in the collection of data objects is generated and used to sequentially access the data items.

Disclosed is a dynamically adaptable stream segment prefetcher for prefetching stream segments from different media streams with different segment name formats and with different positioning of the segment name iterator within the differing segment name formats. In response to receiving a client issued request for a particular segment of a particular media stream, the prefetcher identifies the segment name format and iterator location using a regular expression matching to the client issued request. The prefetcher then generates prefetch requests based on the segment name format and incrementing a current value for the iterator in the segment name of the client issued request.

The invention discloses a method using fixed-length fields to optimize iterative inquiry, including: set up a fixed-length major key field in database; choose the values of all the condition-matched recorded major key fields and save in a disk file according to specific requirements; set up iterative device and batch inquire the database through iterative device, construct the SQL sentence through read the values of major key fields in disk file during inquiry; after the completion of iterative inquiry, delete the iterative device and the value saved in disk file. The invention optimizes the present widely used iterative inquiry method, solve problems that when large amount of data inquiries can not obtain high inquiry speed and occupies large amounts of EMS memory problem and so on.

A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.

An object-oriented system for managing relational numerical data includes a relation interface that provides access to a relation and its attributes and tuples, wherein an attribute is a data item with a numeric value and a relation is a set of n-tuples of attribute values, wherein the relation interface maintains its tuples in a fixed order and is adapted to selecting subsets of attributes and / or tuples wherein a new relation interface instance is created, an iterator interface for iterating over the tuples of a relation, wherein the iterator is adapted to acquiring the tuple attribute data as data is being accessed, and a notification interface for notifying other classes whenever changes occur in a relation interface instance.

The invention provides a nuclear magnetic resonance image reconstruction method, a nuclear magnetic resonance image reconstruction device, a storage medium and terminal equipment. Under-sampled nuclear magnetic resonance images are collected. The under-sampled nuclear magnetic resonance images are input into a pre-trained nuclear magnetic resonance image reconstruction model for image reconstruction. Nuclear magnetic resonance reconstruction images are obtained. The nuclear magnetic resonance image reconstruction model is obtained through training aided by an iterator. An iterative process ofan iterator is learned in advance by using a neural network model. According to the method, the neural network model can quickly reconstruct the input nuclear magnetic resonance image according to thepre-learned nuclear magnetic resonance image reconstruction method. Parameters do not need to be adjusted in the iterative reconstruction process. The time required for reconstructing the nuclear magnetic resonance image is shortened. The efficiency of reconstructing the nuclear magnetic resonance image is improved.