119 results about "State transition table" patented technology

Error-free state tables are automatically generated from a specification of a group of desired performable functions, such as are provided in a programming language in a formal notation such as Backus-Naur form or a derivative thereof by discriminating tokens corresponding to respective performable functions, identifications, arguments, syntax, grammar rules, special symbols and the like. The tokens may be recursive (e.g. infinite), in which case they are transformed into a finite automata which may be deterministic or non-deterministic. Non-deterministic finite automata are transformed into deterministic finite automata and then into state transitions which are used to build a state table which can then be stored or, preferably, loaded into a finite state machine of a hardware parser accelerator to define its personality.

A method and apparatus for providing welding-type power includes a source of welding-type power and a controller. The controller is a state-based controller, and / or a deterministic control module, connected to the controller output. The state-based control module includes, in an embodiment, software instructions and a digital processor, and / or a state transition table stored in a spreadsheet data base. The controller is responsive to a feedback circuit. One or more welding peripherals, such as a wire feeder or robot, are connected to the controller. The current state may be represented by data in a first line of a spreadsheet and a state-ending event by a second, perpendicular, line of a spreadsheet. The subsequent state is determined by the intersection of the first and second lines in another embodiment.

A method and apparatus for providing welding-type power includes a source of welding-type power and a controller. The controller is a state-based controller, and / or a deterministic control module, connected to the controller output. The state-based control module includes, in an embodiment, software instructions and a digital processor, and / or a state transition table stored in a spreadsheet data base. The controller is responsive to a feedback circuit. One or more welding peripherals, such as a wire feeder or robot, are connected to the controller. The current state may be represented by data in a first line of a spreadsheet and a state-ending event by a second, perpendicular, line of a spreadsheet. The subsequent state is determined by the intersection of the first and second lines in another embodiment.

The invention discloses an SDN firewall state detecting method and system based on the OpenFlow protocol. The method comprises adding a state table and a state transition table inside an OpenFlow switch to recording the state and the change information of data flows; meanwhile, also establishing and maintaining a state transition table in an SDN controller to achieve synchronization of data flow states of the controller and the switch. Besides, the invention also discloses modification of the format of an original OpenFlow table. The modification comprises adding associated state fields into the original OpenFlow table, modifying the OpenFlow protocol and adding new message State_in to facilitate treatment of previous state operation information of the controller and the switch and to maintain uniformity of the connecting state tables in the controller and the switch. The SDN firewall state detecting method and system based on the OpenFlow protocol can effectively achieve access control with finer granularity, and meanwhile, by means of cooperative operation of the OpenFlow switch and the SDN controller, can complete deployment of a state detecting firewall and provide safe and efficient services for an SDN network.

The embodiment of the invention provides a method and device for matching regular expressions. The method comprises the following steps of: firstly, inputting a message to be matched and a DFA (Deterministic Finite Automaton) state table, wherein the DFA state table comprises a state transition table including transition relationships between all state addresses and each state in the matching process of the regular expressions; secondly, judging a data type corresponding to the present state, wherein the data type includes a single-character Char type and a multi-character Str type, and the data corresponding to the Str type are a plurality of continuous characters; if the data type is the Str type, matching a plurality of character values in the current state of the message to be matchedand the matching condition, and when matched, shifting to the next state satisfying the matching condition; if the data type is the Char type, matching a single character value at the current state in the message to be matched and the matching condition, and when matched, shifting to the next state satisfying the matching condition; and when the next state is an accept state, finishing the matching process and outputting a success result of matching. The method for matching regular expressions has high matching speed and high efficiency and the space occupied by the DFA items is small.

An assertion generating system is disclosed. In an assertion generating system 207, a graphical editor 201 generates design data of a semiconductor integrated circuit by graphically editing a specification (finite state machine, process sequence) of the semiconductor integrated circuit with the use of a state transition table and a state transition figure or by editing the process sequence into a timing chart and a time series figure based on user operations, and a syntax analyzer 203 and a property extractor 204 generate a property that verifies the specification of the semiconductor integrated circuit based on the design data. The assertion generator 205 converts the property into an assertion description language 206.

A string matching system comprises a state transition table generator for generating a state transition table based on a matching condition described in a regular expression, and an automaton for including a state that makes a transition according to the state transition table generated by the state transition table generator; if, in the state transition table generated based on the matching condition, there exists no next transition destination state with respect to a current-state and input-characters tuple, the automaton makes a transition to the initial state without proceeding to read input characters.Furthermore, the string matching system comprises a state transition table generator for generating a state transition table based on matching conditions described in a regular expression, and an automaton that makes a transition according to the state transition table generated by the state transition table generator; if no next-transition destination state with respect to a current-state and input-character tuple exists in the state transition table generated based on the matching condition, then the state transition table generator determines an exclusion character based on which the automaton make a transition to a predetermined state without proceeding to read input characters, to generate a state transition table.

Trellis-based methods for reducing feedback while maintaining performance in a Multiple Input, Multiple Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system. The methods involve: receiving a plurality of symbols from a plurality of sub-carriers at a receiver; selecting a plurality of indices of codewords corresponding to a codebook of pre-coding weighting matrices for the sub-carriers based on vector quantization compression of the codewords, including selecting a plurality of indices based on trellis-based feedback encoding; and transmitting the selected indices over a wireless channel to a transmitter. Optimal precoding matrices are selected at the same time for all subcarriers by searching for the optimum choice of matrices along a trellis. Selecting a plurality of indices based on trellis-based feedback encoding includes constructing a trellis by specifying a state transition table.

The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

A state transition definition table describes state transition definitions. A state transition table generation class is generated from the state transition definition table. A state transition management module controls the state transition of screens utilizing a state transition table generated from a state transition table generation class, based on the input of events derived from screens. A state transition management module controls the display of screens based on the state transition thereof.

A system and method for state transition intrusion detection is provided. The system and method employ a state transition file, containing a listing or table of all available state transitions associated with a given operation. A log file is then generated using state transition data gathered during the performance of a given operation. Depending upon the instructions present in the state transition file, one or more state transitions in the log file are digitally signed. To determine if an intrusion has occurred, the log file is analyzed, state transition by state transition. This analysis is accomplished by comparing the signatures associated with the state transitions in the log file with those signatures contained in the state transition file, thereby detecting any erroneous signatures. Each operation capable of being performed is accounted for in the state transition file such that all available state transitions associated with the operation are stored in the file. The type of operation represented in the log file is then determined and the transitions contained in the log file are compared to those transitions associated with the operation type in the state transition file. Any missing state transitions denote tampering or modification of the log file, indicating an intrusion, whereupon an administrator is notified.

An assertion generating system is disclosed. In an assertion generating system 207, a graphical editor 201 generates design data of a semiconductor integrated circuit by graphically editing a specification (finite state machine, process sequence) of the semiconductor integrated circuit with the use of a state transition table and a state transition figure or by editing the process sequence into a timing chart and a time series figure based on user operations, and a syntax analyzer 203 and a property extractor 204 generate a property that verifies the specification of the semiconductor integrated circuit based on the design data. The assertion generator 205 converts the property into an assertion description language 206.

The invention relates to a state conversion table-based judging method of the consistency of mulitsource audit data service. It adopts many types of information collecting agents distributed various places of a system to implement multiple information collecting modes, acquires audit data from various links and layers of the system, the information collecting agents process various information forms to generate a united standard audit information and report it to a service audit data consistency judgment center, which makes a whole consistency judgment on the service audit data based on the state conversion table, according to the relevance between the front and back service links, finds the inconsistency of service processing operations in various links, in time finds the occurrence of abnormal service operations like revising relative data, falsifying service data flow round an application system, etc, and makes the corresponding transaction processing according to the consistency judgment result. It can find the occurrence of abnormal service operations in time and enhances the strength of the auditing and monitoring mechanism.

A universal method of trellis encoding signals mapped according to any signal constellation format involves constructing an encoder output table and a state transition table. The encoder output table defines the output symbol of an encoder given the input symbol and the present state of the encoder, while the state transition table defines the next state of the encoder given the present state of the encoder and the input applied to the encoder. The output table and the next state table are constructed with the objective of providing maximal distances between the branches of the trellis diagram without any regards for the shift register implementation of the code. Cyclic trellis-coded modulation is an example of such codes without feed-forward or feed-back shift register implementations, and with equal or better performance than “optimal” shift register trellis codes with 16 states or less. The cyclic trellis codes for both AWGN and Rayleigh fading applications can be constructed for any signal constellation without resorting to exhaustive searches.

The technology disclosed offers a declarative framework that implements a machine for multi-step progression of interaction with an entity. The declarative framework is usable over and over for a broad range of applications because it provides a simple rule-based authoring tool that can be used for specifying different elements and components of a complex state machine, including state definitions, state transition triggers, state transition conditions and state transition actions. Once defined, the state machine is automatically generated and implemented based on the declarative input provided by a non-technical user.

An automated administration system for providing state-based control of soft-labeled keys (SLKs) in a wireless terminal or other type of communication system terminal. In an illustrative embodiment, the automated administration system uses a set of operations to generate information representative of a state machine for controlling labels for the SLKs. The operations process input received from a given user, e.g., a form specifying desired features, layout and language, and generate a state transition table or other suitable representation of a corresponding state machine. Other information generated by the automated administration system may include a control table and a label table. The control table associates a different set of SLK label identifiers with each state in a set of states of the terminal. Each of the label identifiers specifies a label to be associated with a given one of the SLKs in at least one of the states. The label identifiers are used as pointers into the label table which specifies, for each of the label identifiers, a corresponding label for one of the SLKs. The set of operations may be repeated for different users or groups of users of the system, such that a different state machine is generated for each of the users or groups, thereby allowing different users or groups to have different types and arrangements of feature access via their terminal SLKs. The set of operations may be implemented at least in part in software associated with a switch of the system.

A data retrieval system includes a retrieval request block for generating a retrieval key including a current state number and a current character string including N characters latched from an input character string, and a state transition memory operating for retrieval based on a state transition table. The state transition table includes a plurality of input entries each including a combination of a current state number and a character pattern string having N characters, and a plurality of output entries each including combination of a next state number and a pattern number of a character pattern retrieved from the input character string. The state transition memory operates for a plurality of retrievals in parallel retrieval processing.

An information processing apparatus includes: model learning means for self-organizing, on the basis of a state transition model having a state and state transition to be learned by using time series data as data in time series, an internal state from an observation signal obtained by a sensor; and controller learning means for performing learning for allocating a controller, which outputs an action, to each of transitions of a state or each of transition destination states in the state transition model indicating the internal state self-organized by the model learning means.

An I / O driver has v / i characteristic control for maintaining a substantially flat output impedance response using a transmission gate configuration at an I / O output pad. The configuration includes a linear resistive element electrically connected at an I / O pad for limiting a processed data I / O signal, an active impedance element for receiving and processing the data signal, which comprises data represented by a series of voltage state transitions, and pull-up and pull-down array calibration words, for generating and outputting a processed I / O output signal to the resistive element to output a substantially flat v / i response at switching of the data signal.

A string matching system comprises a state transition table generator for generating a state transition table based on a matching condition described in a regular expression, and an automaton for including a state that makes a transition according to the state transition table generated by the state transition table generator; if, in the state transition table generated based on the matching condition, there exists no next transition destination state with respect to a current-state and input-characters tuple, the automaton makes a transition to the initial state without proceeding to read input characters.Furthermore, the string matching system comprises a state transition table generator for generating a state transition table based on matching conditions described in a regular expression, and an automaton that makes a transition according to the state transition table generated by the state transition table generator; if no next-transition destination state with respect to a current-state and input-character tuple exists in the state transition table generated based on the matching condition, then the state transition table generator determines an exclusion character based on which the automaton make a transition to a predetermined state without proceeding to read input characters, to generate a state transition table.

The invention discloses a GPU-based NFA matching method and a device. The matching method includes calculating pairwise compatibility of all the states in the NFA, encoding each state according to the compatibility to form virtual NFA, and obtaining a virtual NFA state transition table corresponding to the virtual NFA, wherein the compatibility refers to that if two states in the NFA are not in an active state simultaneously, they are compatible, otherwise, they are not compatible; and then storing the virtual NFA state transition table in a global memory of a GPU, and matching data in a to-be-processed data package after an interleaving process based on the virtual NFA state transition table. According to an embodiment, the complexity during the matching process can be reduced effectively, the matching speed of the NFA can be improved, and problems in the prior art are well solved.

A program generation program used in a personal computer processes information on relationship between an action and a pair of a state of a system and an event to create a program for incorporating a new state in a state transition table. The computer reads the state transition table in a storage medium and selects the state specified in the state transition table. The computer generates a program that determines whether the selected state is an exceptional state or a normal state on the basis of state information in the state transition table. Based on the result of the determination, the program performs an action including a state transition or a process allocated to the exceptional state specified in the state transition table when the state is the exceptional.

The invention discloses an FSA based voice emotion interaction device and method. The interaction device comprises a voice collection module, a voice emotion identification module and a voice emotion interaction module, wherein the voice collection module sets a record source, the sampling rate, an audio channel and the audio data format, and then writes raw data in an original file to generate a file A; the voice emotion identification module identifies the voice emotion of the file A; and the voice emotion interaction module makes emotion interaction via an emotion carrier. The voice emotion interaction module comprises an establishment module of an FSA model, an establishment module of an emotion interaction state transition table and a transition torque module, wherein the establishment module of the FSA model uses an FSA to describe voice emotion state and transition process thereof; the establishment module of the emotion interaction state transition table defines and determines transition function of the FSA; and the transition matrix module uses a state transition matrix to describe the state transition function in the FSA model.

A detection system in which a user can indicate the permissible sequences of packets (e.g., by virtue of a state transition table), and the detection system detects packets which are inconsistent with such permissible sequences. As a result, all anomalies (which are inconsistent with the user specified normal behavior) may be reliably detected.

A behavior index indicates a development of occurrence of events included in log data by a connection of a plurality of nodes, and includes a branching node connecting to two or more subsequent nodes and an integrating node connected to two or more preceding nodes. When a regular expression converting part inputs a search condition indicating an event appearance order from a client, a search automaton retaining part generates a state transition table in accordance with the search condition. While a node type determining part determines the node types of the respective nodes of the behavior index, a state evaluating part analyzes the respective nodes to determine the states of the respective nodes, and determines whether or not a state transition pattern matches the state transition table. Regarding a branching node, the respective nodes of each of branching routes branching from the branching node are analyzed. Regarding an integrating node, the respective nodes of each of upstream routes merging into the integrating node are analyzed.

The embodiment of the invention provides URL (Uniform Resource Location) analyzing method and equipment. The method comprises the steps of: scanning characters in a URL character string sequentially; updating the current state of an FSM (FDM-channel Selector Module) according to the scanned current character, a constructed FSM state conversion table of the URL and the current state of the FSM; updating the state of a sub FSM according to the scanned current character, a sub FSM state conversion table of constructing a path field and the current state of the sub FSM when scanning the characters of the path field of the URL, wherein the sub FSM state conversion table comprises the states of the updated sub FSMs corresponding to different types of characters when different types of characters are scanned in the current states of different sub FSMs; when the final states of the FSM and the sub FSMs are accepting states, judging that the URL conforms to URL syntax; otherwise, judging that the URL does not conform to the URL syntax.

Systems and methods are described for generating an interactive voice response (IVR) application from a state transition table and set of extensible markup language templates. Embodiments include representing an interactive student-computer dialog as a state transition table. The target interactive voice and video response (IVVR) markup language is encoded as a discrete set of extensible templates. The dialog states are mapped to IVVR markup language by selecting appropriate extensible templates and instantiating parameterized elements of each template with dialog state constituents. Embodiments organize the extended templates coherently and package the extended templates for deployment on an IVVR delivery platform.

A status transition table generation portion generates a status transition table containing combination information cells provided in the form of a matrix for describing information corresponding to combinations of internal status and event. In a status transition table design support portion, a test path generation portion generates a test path including a series of test cases to be executed as a status transition test, based on information accepted by an operation specification information input acceptance portion. In a test support portion, a test cell highlight portion highlights a combination information cell associated with the next test case to be executed, during execution of the status transition test, and a test result history, an error replication procedure, and test progress are displayed on a display portion.