80 results about "Enumerated type" patented technology

Disclosed embodiments of the present invention relate to a system and method for automatic generation of a star schema. The system and method may comprise categorizing a data field into one of a plurality of data field types, one of the data field types being an enumeration type data field. The system and method may further comprise developing dimensions for a table that represents an initial star schema design using the categorization of the data, detecting functional dependencies between the data field and other data fields, and refining the initial star schema design by modifying the table based on detected functional dependencies.

A simplified method of encoding information needed to set the NENA 08-001 v2 Result code based on two essential factors that are stored in a data store at runtime. An ESRResponse header is built with two fields created as simple enumerated types: LocationSrc and RoutedOnAlgo. For each emergency call there is one entry in this data store. The first field of the ESRResponse header comprises one of five possible unique values, as does the second field.

A system and method for dynamically enumerating the links in arbitrary hyperlinked data structures using parsing rules are provided. A hyperlinked data structure may be enumerated by reading one or more data objects through an object access interface, parsing the one or more data objects in the data structure, identifying two or more data elements in the one or more data objects, combining one or more data elements to obtain one or more hyperlink addresses, and reading the one or more hyperlink addresses to enumerate the one or more data objects. In one embodiment, hyperlinked structures such as Websites, may be enumerated using configuration templates. The templates may include heuristic parsing rules. The definition of the templates may be independent of the evolution of the data objects over time.

An enumerator employs “indexing volumes” as the add-on values used to compute indexes for n-item ordered sets such as symbol sequences. Each indexing volume is associated with a different class into which the allowed ordered sets are partitioned. The indexing volumes all equal or exceed the number of ordered sets that belong to their respective classes. Additionally, the indexing volume V_i associated with a given class of i-item equals or exceeds the sum of the indexing volumes associated with the classes that contain the (i−1)-item prefixes of the ordered sets that belong to the given class. The indexing volumes are quantized such that each volume V=wr^s, where r is an integer greater than unity, s is a non-negative integer, w is a positive integer less than r^m, m is some positive integer less than h, and, for some allowed ordered set whose size is less than n, h is the number of radix-r digits in the smallest quotient that results from evenly dividing by a positive-integer power of r the set count of the class to which that allowed ordered set belongs. As a result, the addition operations used to compute the indexes can be performed with limited precision, and storage requirements for the add-on values can be relatively modest.

A method for identifying vulnerable system call pairs is disclosed. The method is based on a model for identifying Time-Of-Check-To-Time-Of-Use (TOCTTOU) problem (called STEM), which enumerates the potential file system call pairs (called exploitable TOCTTOU pairs) that form the check/use steps. The system function calls are classified into a plurality of predefined classes and pairs of the function calls are formed according to predefined criteria, where the function calls within a pair are associated with the same file invariant.

The invention discloses a method and a device for parallel enumeration of support points based on a metric space. The method comprises the following steps: calling a message delivery interface, distributing to-be-calculated data to M nodes, wherein each node is assigned to a data set; controlling the M nodes to respectively call a fork function, creating N child processes in each node, and assigning the data sets corresponding to the nodes to the N child processes, so that each child process is assigned to a child data set, and N is equal to the number of GPUs contained in each node; controlling the N child processes established in the M nodes to operate; controlling the N GPUs in the corresponding node one by one through the N child processes; using the GPUs to traverse the data in the sub data set corresponding to the child process; carrying out parallel enumeration of the support point and storing the enumeration result. Through the aforementioned manner, the parallel enumeration ofthe support point can be effectively realized; the time consumed by enumeration of the support point is effectively shortened; and the performance of data calculation is improved.

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.

The embodiments of the present invention relate to a method and device for enumerating Input/Output devices (IO devices). The method for enumerating input/output devices includes: obtaining the identifier of each processor and the identifier of each Input/Output (IO) hub in the system; respectively instructing each processor to simultaneously enumerate specific IO hubs and IO devices connected thereto according to the identifier of each processor and the identifier of each IO hub; and obtaining related information about the IO devices enumerated by the instructed processors. According to the embodiments of the present invention, the task of enumerating IO devices in the system can be assigned to a plurality of processors simultaneously, thus greatly shortening the time consumed by the enumeration process, and accelerating the initiation process of the system.

The invention discloses a method for improving game code reusability, a terminal device and a storage medium, and is suitable for game software development. The method provided by the invention comprises the following steps that: defining a structural body, wherein the structural body contains the attribute value and the callback function of a game object setting the enumeration of a game object attribute, and setting a key value corresponding relationship of the game object attribute and the attribute value during the creation of the game object each time; and when the same type of game is developed, changing the enumeration and the callback function of the game object attribute. By use of the method, the structural object is defined to carry out enumeration on the game object attribute so as to establish the key value corresponding relationship of the attribute and the attribute value. When new game is developed, only the attribute of the enumeration and the call function need to bechanged, the portability and the reusability of codes can be improved, in addition, a workload can be reduced, and working efficiency is improved.

The invention relates to a graphical concept modeling method and device, computer equipment and a storage medium. The method comprises the following steps: constructing a topological graph of a cross-shaped dual-tree graphic structure; the cross-shaped double-tree graphic structure comprises a longitudinal tree and a transverse tree and is used for receiving modeling task information; analyzing the modeling task information to obtain a modeling scene, a modeling object instance, an attribute field and a data type enumeration attribute; respectively writing the modeling scene, the modeling object instance, the attribute field and the data type enumeration attribute into a longitudinal tree and a transverse tree according to a longitudinal tree direction rule, an anti-shielding automatic arrangement rule and a node migration rule to obtain an architecture tree and an attribute tree; and modeling the architecture tree and the attribute tree according to an attribute field inheriting rule, an attribute value inheriting rule, a homonymous attribute fusion rule and a same parent attribute fusion rule to obtain an architecture-attribute graph. By adopting the method, the simulation modeling efficiency can be improved.

The invention discloses an enumeration type design method and device, electronic equipment and a computer storage medium, and the method comprises the steps: obtaining enumeration information which comprises an enumeration variable, an enumeration value and an enumeration description; executing the written script to generate an intermediate file containing enumeration information; packaging the public method to a public method file by utilizing the intermediate file; and quoting the intermediate file, and realizing a corresponding enumeration function by using a public method in the public method file. According to the method, enumeration-related processing scripts are developed in the early development stage, and if enumeration information is adjusted in the later development process, only script files need to be executed again, and related intermediate files are generated again; when an enumeration function needs to be used, a related intermediate file is quoted, and an encapsulatedpublic method is used in a code, so that the enumeration function corresponding to the public method can be realized, the development efficiency is improved, and different reports, page presentation and data related to the same enumeration are highly unified.

Embodiments of the present invention are directed to a method and apparatus for extending a program element in a dynamically typed programming language. In one embodiment, a program element is extended without altering the source code defining the program element. An extend structure is used to extend a program element in a particular program. In one embodiment, the program element is a function. The function is extended by adding code to be executed by the function. In another embodiment, the program element is an enumeration. The enumeration is extend by adding additional constants to the enumeration. In another embodiment, the program element is a class. In one embodiment, a class is extended by adding code to the constructor of the class. In another embodiment, a class is extended by adding member variables to the class. In yet another embodiment, a class is extended by adding member functions to the class.

The invention discloses an inspection method which is based on textual output format of man-machine command, including the following steps: output parameter type of the man-machine command is added to a parameter attribute dictionary and enumeration of the man-machine command is added to an enumeration attribute dictionary; a script file of the man-machine command is traversed and definitions including output parameters and output partition in the script file are respectively added to an output parameter attribute dictionary and an output partition attribute dictionary; content of the parameter attribute dictionary and the enumeration attribute dictionary and that of the output parameter attribute dictionary and the output partition attribute dictionary are compared and inspected to judge whether the output parameter format is correct or not. As the parameter format inspection method which is based on dictionaries and regular expression is adopted, the inspection of legality of the parameter format is completed by the program, thus solving the problem of illegal display of the output parameter information; problems discovered can be obviously seen and pointedly solved by opening error log, thus reducing difficulty of program development and maintenance.

The invention discloses an underlying key value data classification optimization method based on Cockroach DB, and belongs to the technical field of distributed databases. According to the invention,an enumeration type DataType is newly added in the header of an RPC request in a distributed database Cockroach DB, and underlying data classification identifiers and table identifiers are analyzed ina request processor to obtain data types and table identifiers and transmitted to a storage engine; and the storage engine adopts different data optimization strategies for different types of read-write characteristics. According to the invention, the read-write amplification problem of the database can be optimized, so that the read-write performance of the database is improved, and the method has very good popularization and application values.

The invention discloses a method for preventing occurrence of pseudo initial code in a coded data stream. An initial code in the data stream is changed into another enumeration conflict code whose length is the same as that of the initial code, and modification information is written in the head or tail of the coded data stream. The method successively solves the problem of occurrence of pseudo initial code in the coded data stream.