80 results about "Dynamic array" patented technology

Systems and methods are provided for writing code to access data arrays. One aspect provides a method of accessing a memory array. Data is provided within a one-dimensional array of allocated memory. A dimensional dynamic overlay is declared from within a block of statements, and the declaration initializes various attributes within an array attribute storage object. The data is accessed from within the block of statements as a dimensional indexed array using the array attribute storage object. Another aspect provides a method of creating and accessing a dimensional dynamic array. A dimensional dynamic array is declared from within a block of statements, and memory storage for the array is dynamically allocated. A dynamic overlay storage object is also provided and its attributes are initialized from the dynamic array declaration. The data is accessed as a dimensional indexed array from within the block of statements using the array attribute storage object.

A system and method for the multiple selection of digitally stored objects and the link-tokens of each selected object for simultaneous presentation and examination of the selected objects with their associated linked objects and information, including organized array presentation for graphical thumbnails that represent the selected objects, as well as sub-framing, which allows intelligent partitioning of information associated with an object.

The invention discloses a satellite telemetry data treatment system and a realization method of the system, which solves the problems of telemetry data treatment, such as universality, extensibility and cross-platform. The system comprises a log module, a pointer container module, a memory management module, a basic data management module, a configuration information management module, an index table management module, a data pretreatment module, a treatment method module, a data analysis module and a data initialization and management module. The method comprises preparing configuration file and basic data, and creating a frame index table or a packet index table by use of a dynamic array, i.e. pointer container; receiving telemetry data, and carrying out effective judgment and data integration; carrying out parameter treatment, and treating the parameter result according to a manner defined by a customer; and stopping until all of the telemetry data is treated.

The invention relates to an implement method that searches linked list of data rapidly. The technical problem that needs to solve is that not only the advantages of an array and a linked list are maintained, but also limitations of use thereof are overcame. The implementations lie in that appointing a data item of each node in the linked list to an array space; each element in the array appointed by the data item has a unique index number; the linked list can be a signal linked list or a double linked list; the array can be dynamically distributed array or appointed array. The data in the entire linked list is stored in sequence. The array is combined with the linked list, which is capable of enhancing the number of the nodes of the linked list to realize the dynamical array. Because of each node appoints to an array space that appoints size, but not a data item only, the function of the double linked list is extended and frequently distribution and waste of the memory are avoided too. Storing after ordering the entire data to position the data rapidly by dichotomy is convenient to operate.

A method is disclosed for defining a multiple patterned cell layout for use in an integrated circuit design. A layout is defined for a level of a cell in accordance with a dynamic array architecture so as to include a number of layout features. The number of layout features are linear-shaped and commonly oriented. The layout is split into a number of sub-layouts for the level of the cell. Each of the number of layout features in the layout is allocated to any one of the number of sub-layouts. Also, the layout is split such that each sub-layout is independently fabricatable. The sub-layouts for the level of the cell are stored on a computer readable medium.

The invention discloses a parallel computing method capable of expanding a precision Logistic chaotic sequence, comprising the following steps: (1) saving initial parameters x0 and mu integer quantization to an one-dimensional array, and arranging the precision required to be achieved or designating iterative times; (2) the first part of the parallel computational algorithm x=x*(1-x): utilizing amatrix to save and compute the intermediate result, modifying the length of a dynamic array and saving the computation result to the dynamic array; (3) the second part of the parallel computational algorithm x=mu*x: saving the computation result to the dynamic array; (4) and if the precision or the iterative times achieves the required value, acquiring the chaotic sequence in the dynamic array, thus the computation is finished, and otherwise, transferring to step (2). The method of the invention fully utilizes the properties of a chaotic system, provides the chaotic sequence of a more expansive mapping space, can be used in the fields of secret communication, information safety and so on, and is especially suitable for encryption, storage and network transmission of graph, image and multimedia and other information.

The invention belongs to the technical field of multimedia, in particular relates to a method and device for increasing list refreshing frequency. The method for increasing the lift refreshing frequency, provided by the invention, comprises the steps of: a, preparing data to be displayed by a list view, storing the data by using a dynamic array; b, constructing an adapter, generating data elements corresponding to an Item array and the dynamic array of the adapter; c, optimizing the adapter, generating a view object, setting a label attribute of the view object, and caching the generated view object locally; and d, adding the adapter in the list view, and displaying the view object. According to the method and the device for increasing the lift refreshing frequency, disposable data can be avoided being generated massively by the system, system memory overhead is reduced, performance is greatly increased, so that the list view more rapidly displays pictures and the pictures roll more smoothly.

A wearable multinode three dimensional motion monitoring system based on a wireless body area network can synchronically collect and monitor human body multisection, multijoint and multi freedom motion data in real time; posture resolving is carried out for the collected motion data, and the result is sent to a mobile intelligent terminal in a Bluetooth communication mode; multinode data acquisition frequency can be above 900Hz; human body motion posture data output rate after posture resolving can reach 150Hz, thus satisfying human body whole motion condition real time monitoring demands; in addition, aiming at multinode motion data features, a corresponding multinode acquisition data structure is built, a dynamic array of corresponding size is opened in a memory, and read-write lock characteristics are fully utilized so as to ensure real time data acquisition accuracy and completeness; a plurality of threading for different tasks are built in the system backstage so as to realize three dimensional motion monitoring system multinode data acquisition, bluetooth communication, posture resolving and visualization function on the mobile terminal, thus satisfying human body motion obstacle diagnosis and assessment clinic demands.

An apparatus, method, and program product for optimizing code that contains dynamically-allocated memory. The aliasing behavior of internal pointers of dynamically-allocated memory is used to disambiguate memory accesses and to eliminate false data dependencies. It is determined whether a dynamically-allocated array will behave like a statically-allocated array throughout the entire program execution once it has been allocated. This determination is used to improve the instruction scheduling efficiency, which yields better performance.

The invention discloses a management method of graphs based on dwg and dxf file formats and belongs to the technical field of document processing. The graph management method includes utilizing Access to build a graph title bar information database, determining a method for accessing the database as ODBC (open database connectivity), accessing the database on the basis of ODBC, enabling ODBC to be connected with a data source, extracting graphic element information in a dxf file through VisualC++, storing data in the dxf file into the database and a dynamic array which is arranged, building a three-view management interface, and using an ActiveX control to realize previewing display of a dwg file; performing addition, deletion, inquiry, previewing and translation on the graph database. Graph positioning is realized directly according to information of a graph title bar, the ActiveX control is combined, and an AutoCAD-based dwg and dxf file format graph database management system is development, so that quick, safe and effective management on graphs drawn by AutoCAD is realized.

The invention belongs to the modern traffic control and the abductive technique field, disclosing a variable information board abduction area dynamic partitioning method, with the following steps: a. building the road net data structure through the forward direction incidence edge memory structure, meanwhile inducting the dynamic array Node showing the junction, the maxflux dynamic array showing the maximum flow of the road and the two dimension TurnFlux array showing the turning flow of the junction, building the extended forward direction incidence edge data structure; b. obtaining the traffic real-time information, the related information of each variable information board and the traffic ruler configuration information; c. modifying the road net data structure, building the dynamic net flow model; d. computing the abduction area of the time interval aiming to each variable information board through the built road net data structure and the net flow model. The invention has the advantages of causing the traffic of the whole area to trend towards the optimum.

A method of data reshaping for multidimensional dynamic array objects in the presence of multiple object instantiations. The method includes collecting all alias information using interprocedural point escape analysis, and collecting all shape information using interprocedural shape analysis. The method progresses with selecting the candidate dynamic objects based on alias and shape analysis, and determining the types of data reshaping for the candidate dynamic objects. The method further includes creating objects for selected dynamic objects with multiple object instantiations. The method proceeds by updating the memory allocation operations for the selected dynamic objects and inserting statements to initialize object descriptors. The method further includes creating the copy of the object descriptors for selected dynamic object assignments. The method concludes by replacing the object references by array-indexed references for selected dynamic objects using object descriptors.

The invention discloses a mind map use case file conversion method and device, relates to the computer technology, and the method and the device are used for converting a mind map use case file into an excel test case convenient for team management. The method comprises the steps of obtaining a mind map use case file; traversing the father node and the plurality of child nodes corresponding to thefather node to obtain a plurality of text values, and storing the plurality of text values to a dynamic array Array; obtaining a configuration file of the standard use case template file, the configuration file comprising a plurality of use case names; analyzing the Graylist to obtain a plurality of text values corresponding to the plurality of use case names; and determining a standard form fileaccording to the plurality of use case names and the text values corresponding to the plurality of use case names. The embodiment of the invention is applied to converting the mind map use case fileinto the standard excel test case.

The invention discloses a quick data retrieval method and a quick data retrieval system by a novel Hash value table. In the method, a mapping table and a dynamic array are created; elements of the dynamic array include data and subscripts, and the mapping table is used for storing position indexes of the elements in the dynamic array; through the subscripts, the mapping relation between the mapping table and the dynamic array can be built, and operations such as adding, inquiring and deleting of the elements in the dynamic array can be realized. The system comprises a creating module and a retrieving module, and the retrieving module comprises an adding unit, an inquiring unit and a deleting unit. By the quick data retrieval method and the quick data retrieval system, frequent traversal and inquiry in linked-list operations are avoided, and time is effectively saved; particularly, for access operations on mass data, through the subscripts, Hash value conflict can be avoided, and operation objectives can be achieved quickly and accurately.

The invention is applied in the field of computer software, and provides a large-capacity file splitting method, a large-capacity splitting device and a large-capacity file splitting system. The method comprises the following steps of: according to the capacity of a memory and sizes of each piece of data in a split file, acquiring data volumes of each sub-file obtained by the splitting; according to a total data volume of the split file and the data volumes of each sub-file obtained by the splitting, acquiring the data volumes of each sub-file obtained by the splitting, cyclically reading and writing the data in batches and splitting the split file. In the method, the device and the system, the file reading channel, the file writing channel and a mode of cyclically reading and writing the data in batches in a form of dynamic arrays are adopted to accurately split a large-capacity binary file, so program splitting speed is high, the performance is stable and the problem of operation failure caused by the exhaust of the memory is solved; and the sub-files obtained by the splitting can be directly burned into the memory for data decomposition application in combination with a singlechip.

The invention provides a method for searching contour noise points of a three-dimensional point cloud data, and the method is used for searching the contour surface noise points of the three-dimensional point cloud data based on an optical surface scanning three-dimensional measurement system. The method comprises the following steps of: searching and cancelling remote noise points on the contour surface of the three-dimensional point cloud data; and computing the normal vectors of all points in the three-dimensional point cloud data, searching the contour noise points of the three-dimensional point cloud data, etc. According to the method, a good man-machine interaction function can be realized, and the contour noise points of the three-dimensional point cloud data can be efficiently and exactly searched, so that an effective method for improving the quality of the point cloud data can be provided. When the method is specifically realized, the searched noise points are firstly marked to be the color which is different from the other data points, to be distinguished, and are stored in a special dynamic array. Finally, if the noise points are confirmed to be capable of being cancelled, the noise points which are marked and stored in the dynamic array are removed. Therefore, the fairness of the contour surface of the point cloud data can be effectively improved, and the stereoscopic vision effect can be improved.

Systems and methods are provided for caching dynamic arrays. According to one aspect, a cache memory device is provided for caching dynamic arrays or dynamic overlays. According to one embodiment, the device includes a plurality of memory cells and at least one register for storing access information to access at least one array stored in the plurality of memory cells. According to another aspect, an electronic system is provided that includes a main memory, a dynamic array cache memory device, a general cache memory device, and a processor. The dynamic array cache memory device is coupled to the main memory and adapted for caching array data. The general cache memory device is coupled to the main memory and is adapted for caching regular data. The processor is coupled to and adapted for communication with the main memory, the general cache memory device, and the dynamic array cache memory device.

A method of data reshaping for multidimensional dynamic array objects in the presence of multiple object instantiations. The method includes collecting all alias information using interprocedural point escape analysis, and collecting all shape information using interprocedural shape analysis. The method progresses with selecting the candidate dynamic objects based on alias and shape analysis, and determining the types of data reshaping for the candidate dynamic objects. The method further includes creating objects for selected dynamic objects with multiple object instantiations. The method proceeds by updating the memory allocation operations for the selected dynamic objects and inserting statements to initialize object descriptors. The method further includes creating the copy of the object descriptors for selected dynamic object assignments. The method concludes by replacing the object references by array-indexed references for selected dynamic objects using object descriptors.

A method is provided for processing a digital information set having a plurality of information bytes. The method comprises receiving the information set, determining a set of initialization parameters, initializing a set of state variables using the set of initialization parameters, and generating a plurality of cryptors, each cryptor being a virtual dynamic array containing a monoalphabetic cipher. The method further comprises modifying the state variables and one or more of the cryptors, setting the index value for each cryptor in the plurality of cryptors; and selecting an ordered cryptor subset to be applied to an information byte. The information byte is processed using the ordered cryptor subset to produce a processed information byte. If the information byte is a plaintext byte, the processed byte is an encrypted byte, and vice versa. The actions of modifying, setting, selecting, and processing are then repeated for each remaining information byte.

The invention discloses an array element number minimization sparse array optimization algorithm including directivity coefficient and beam scanning range constraint. According to the method, on the basis of a sparse array comprehensive framework, a dynamic array element position expansion and contraction mechanism is introduced, and a mathematical optimization model with the minimum array element number as a target function, the beam width, the peak side lobe level, the directivity coefficient and the beam scanning range as constraint conditions and the array element arrangement mode and amplitude-phase excitation as design parameters is established; and an iterative convex optimization algorithm is proposed to efficiently solve the mathematical optimization problem, and the required minimum array element number, array element position distribution and a corresponding amplitude-phase excitation vector are obtained. The maximum innovation of the method is that the established mathematical optimization problem considers the direct optimization of the directivity coefficient, has a feasible region range approaching the real sparse array element position, can consider the grating lobe problem occurring during sparse array scanning, and provides an efficient optimization algorithm for solving.

The invention discloses a mixed assembly sequence generation method based on symbols. The method comprises steps of establishing a ZBDD expression of a connection matrix and an interference matrix according to the connection matrix and the interference matrix of an assembly; solving a precedence relation matrix in dependence on the interference matrix of the assembly; searching all feasible assembly sequences, establishing a file for storing the feasible assembly sequences and subassemblies generated in the assembly process, and establishing a dynamic array for storing path numbers for generating the subassemblies; and refining the established file for storing the feasible assembly sequences and the subassemblies, and deleting dead states in the assembly process. The invention can ensure completeness of assembly sequences by analyzing all possible assembly operations at the high space and time efficiency, ensure reliability of the assembly sequences by determining local assembly geometric feasibility, ensure high efficiency of an algorithm by determining satisfiability of a precedence relation, and finally complete generation of all the feasible assembly sequences of the assembly.

The invention relates to a three-dimensional cell information storage structure and an operation method during etching and deposition technology cell automata simulation, and belongs to the technical field of simulation on etching and deposition courses during a micro-electronic processing course. The storage structure is characterized in that a two-dimensional static array is created to express information of a cell automata model, wherein information of each element of the two-dimensional static array comprises recording of the number of all surface cells of a (x, y) column, and a one-dimensional dynamic array for storing all the surface cells of the (x, y) column; each element in the one-dimensional dynamic array records information of the cells, records coordinate values z of the surface cells along a z axis, and is used for reducing the three-dimensional cell automata model; and all the elements in the one-dimensional dynamic array zcell are sequenced according to the coordinate values z in an ascending manner. The operation method of the cells comprises the steps of random access on the cells, and adding, deleting and modifying of the cell information. The storage structure and the operation method solve the problem that the existing three-dimensional cell information storage structure used during cell automata simulation cannot realize high-resolution cell automata simulation.

An image transforming device enables 3-D auto-stereoscopic display of a two-dimensional projected image. Optical waveguides in the form of ribbons are used. A stack of ribbons at a receiving end receives the projected image. A horizontal and vertical ribbon arrangement at the other end of the ribbon forms a screen for display of a transformed 3D image. A spacer material at the output end separates the vertical positioning of each ribbon. A screen may be assembled from the output ends of multiple devices forms. The two-dimensional image may be projected in changing colors. When changing colors are projected, the device may further include two lens arrays: a static micro-lens array and a dynamic array of micro-lenses, which is capable of motion synchronized with the changing colors.

The invention discloses a method for optimizing display data. The method comprises the steps that data are imported into a static array; the number of the data and the maximum value of a horizontal reel are calculated, wherein the number of the data and the maximum value of the horizontal reel can be normally displayed in the set width of a chart control; data, corresponding to the data number which can be normally displayed, in the imported data are imported into a dynamic array starting from the starting position, corresponding to the initial value preset by the horizontal reel, in the imported data; the data in the dynamic array are assigned to the chart control to form a chart; the present chart is converted into a picture; the picture is displayed; the present value of the horizontal reel is detected, and the picture displaying process is triggered again according to the value. According to the method for optimizing the display data, the data can be displayed in the chart control at equal intervals, and imported data volume cannot be limited by the chart control any more.

The present invention discloses a data page access method, an NVM-based database storage engine, and a computer readable storage medium. The method comprises the following steps: storing a mirrored data page of a buffer pool on a nonvolatile memory NVM; modifying the data page in the buffer pool according to the write access of the data page, and storing the page number, undo log information, andmodified log information of the data page in a preset dynamic array. According to the data page access method, the NVM-based database storage engine, and the computer readable storage medium in the invention, the redo log buffer in the existing relational database is removed by storing the mirrored data page of the buffer pool on the NVM, and the redo log recording process is removed in the data page modification process, thereby increasing the concurrency and improving the performance of the database storage engine.

The present invention relates generally to interactive advertising and more specifically to computer games allowing advertisers to market their products, prize giveaways, coupons and the like using a game of chance in an interactive manner. To play the game, a gamer may use for example a mobile device's image capturing means for scanning at least one coded advertising image within a coded frame for which an interactive game application animates a dynamic array of game frames and randomly selects a game frame from the dynamic array for display. The randomly selected game frame may comprise of multimedia content for vouchers, prizes, giveaways, that may be redeemed for cash or other prizes.

The invention discloses a simulation method and system. The method includes: receiving coordinates of a three-dimensional entity, converting the coordinates of the three-dimensional entity into two-dimensional situation coordinates, storing the two-dimensional situation coordinates to a dynamic array set by a VGPath control, and adopting the VGPath control to draw the two-dimensional situation coordinates in the dynamic array into a trajectory, wherein the VGPath control is a control in special instrument design software VAPS XT, and the trajectory is used for showing a travelling route of the three-dimensional entity. By the simulation method and system, by the aid of the special instrument design software VAPS XT based graphical design function, two-dimensional situation display can be realized simply, error rate is low, and high efficiency and accuracy in simulation can be guaranteed.

The invention discloses a method for operating a database table based on backward generation of a database table structure. The method comprises the following steps of creating an Oracle database table in a database editor, and establishing a database table structure mapping relationship; querying, reading and judging the information of the Oracle database table; reversely extracting a managementtable from the Oracle database table, and respectively storing the query contents into a manager database table; cyclically querying the information stored in the manager database table, extracting and storing into a defined dynamic module, organizing data in the dynamic module into Java codes, and generating two DAO files, two TO files, a FROM file and a VO file; by calling the files, increasing,deleting, modifying and querying the database table. The method has the advantages that the operation codes are standard and uniform, the operation and subsequent maintenance of the database are convenient, the workload of a developer is reduced, the quick editing of the database is realized, and the like; the higher application value and popularization value are realized in the technical field of the databases.