Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

39 results about "Formal representation" patented technology

A Formal Representation of a place tends to be more objective and stat-based. An Informal Representation of a place tends to be more subjective, offering geographical context of a place through sound and sight.

Computer system with natural language to machine language translator

Presented is a system and method for converting or translating expressions in a natural language such as English into machine executable expressions in a formal language. This translation enables a transformation from the syntactic structures of a natural language into effective algebraic forms for further exact processing. The invention utilizes algorithms employing a reduction of sequences of terms defined over an extensible lexicon into formal syntactic and semantic structures. This term reduction incorporates both syntactic type and semantic context to achieve an effective formal representation and interpretation of the meaning conveyed by any natural language expression.
Owner:RAVENFLOW

Method of transforming natural language expression into formal language representation

This invention comprises a series of steps which transforms one or more natural language expressions into a single, well-formed formal language representation. Each natural language expression is partially parsed into simple fragments, each of which is then associated with one or more short formal expressions. Each formal expression is constructed in such a way as to contain one or more placeholder variables, each of which is associated with one or more attributes to constrain the types of entities that each variable can potentially represent. The resulting plurality of formal expressions is then filtered for relevance within a given context, and the surviving expressions manipulated based upon a plurality of rules, which are cognizant of the attributes associated with each variable contained therein. A user is then presented with the resulting plurality of formal expressions, whereupon the user optionally selects, rejects, adds to, logically connects and otherwise manipulates each member of said plurality. When the user is satisfied that the plurality represents an intended meaning, the formal expressions are combined into a single, formal representation.
Owner:MEREDITH FAMILY REVOCABLE TRUST

System and method for excavating abnormal features of time series data

The invention discloses a system and a method for excavating abnormal features of time series data. A minimum complete period having obvious periodic data can be acquired in a self-adaptive manner, so that a feature observation window is determined; then the Fourier feature, the principal component analysis feature, the statistic feature and the wavelet feature are extracted from the observation window respectively; finally, clustering is performed on single feature vectors respectively with a KT-Means method, and various features are abstracted and expressed as feature characters. The problem of fuzzy matching of data can be better solved by expressing features of the time series data with the feature characters in a formalized manner, and establishment of a feature library is facilitated for rapid judgment and retrieval of an abnormal process. With the adoption of the method, various feature information is contained, the abnormal process of the time series data can be known more comprehensively and integrally, and the applicability and the generalization ability of a system for abnormity monitoring and fault diagnosis of the time series data can be improved.
Owner:XI AN JIAOTONG UNIV +1

Process algebra-based real-time protocol analysis and verification system

The invention discloses a process algebra-based real-time protocol analysis and verification system. The system comprises a mathematic modeling module, a code generation module, a simulation verification module and a verification result processing module, wherein the mathematic modeling module is used for carrying out modeling by utilizing process algebra, carrying out formalized expression on a real-time protocol, establishing a real-time protocol model and carrying out formalized expression on a protocol requirement; the code generation module is used for generating a high-level language code according to the real-time protocol model; the simulation verification module is used for carrying out simulation execution on the real-time protocol model according to a semantic meaning of a process algebra description language, and analyzing and verifying the properties satisfied by the real-time protocol model according to the formalized expressions of the rea-time protocol and of the protocol requirement output by the mathematic modeling module; and the verification result processing module is used for carrying out statistic and classification on analysis and verification results output by the simulation verification module and providing evaluation for protocol property. The system disclosed by the invention provides a protocol execution process which does not satisfy the protocol requirement, and provides integral evaluation for the protocol property, so that the efficiency of optimizing the protocols by the developers is improved.
Owner:EAST CHINA NORMAL UNIV

Method for improving high speed rail train operation right time rate by running chart robustness

The invention discloses a method for improving the on-schedule rate of the operation of a high-speed railway train by utilizing the robustness of a working diagram in the technical field of operation dispatching and control of high-speed trains. The method adopts a technical proposal that a preset working diagram is subject to formal representation; a polynomial matrix expression form of the working diagram is given to evaluate a feature value; then the perturbation of the working diagram is defined, and the ratio of the perturbation and the total delay time is utilized to weigh the robustness of the working diagram; a Petri network is utilized to simulate the operation of the train in a section, and the deviation of the arrival and departure time of the train and diagram-specified time produced during the simulation is fed back to the perturbation calculation; the robustness of the working diagram is calculated; according to the requirement of the robustness of the preset working diagram, the arrival and departure time of the train in the working diagram is adjusted, and then the operation simulation of the train and the robustness calculation are performed; and the circulation is performed until the robustness of the working diagram achieves the preset requirement. The method provides an evidence for establishing high-efficiency railway working diagrams and assuring the safe, punctual and high-speed operation of railways.
Owner:BEIJING JIAOTONG UNIV

Task decomposition method for heterogeneous multi-robot system based on recursive algorithm

The invention relates to a task decomposition method for a heterogeneous multi-robot system based on a recursive algorithm. Resources involved are formally represented, a triplet is used to formally represent tasks that a robot can accomplish, a task decomposition algorithm based on a recursive function is called, and a task execution flow is restored according to a stack call trace of a function.The defects that an existing task decomposition method has poor generality, robots mostly are heterogeneous robots, a set of tasks can not be obtained and different allocation schemes and execution sequences of sub tasks have a large economic benefit gap are overcome. The unified and shareable formal representation of system environment resources and tasks is carried out, the method has good adaptability, robots with different abilities can be expressed in the same representation, a heterogeneous robot system is supported, a recursive algorithm is employed, the traversal search can be carriedout for any possible decomposition method in a robot ability space, and all decomposition schemes can be obtained.
Owner:YANGZHOU UNIV

Emotion recognition method based on brain-computer generative adversarial

The invention discloses an emotion recognition method based on brain-computer generative adversarial. For an emotion recognition task, cognitive representation with emotions is obtained after the human brain processes information, while a machine only learns representation in an image form. If a generation relation between the cognitive representation with emotions and the representation in an image form can be established, a machine can be guided to learn through the human brain and endowed with the emotion cognitive ability of the human brain. In order to give information perceived by a human brain to a machine, a generation model from image visual features to electroencephalogram emotion features needs to be established, so that generation from formal representation to cognitive representation is realized. According to the method, the relation between electroencephalogram emotion features and image visual features is explored, the relation between formal representation and cognitive representation is established, and brain-computer collaborative intelligence is achieved. In order to reduce the difference between cognitive representation and formal representation and enable the formal representation to infinitely approach the cognitive representation, the invention designs an emotion recognition method based on brain-computer generative adversarial.
Owner:HANGZHOU DIANZI UNIV

Accessible webpage navigation method based on navigation target extraction

The invention discloses an accessible webpage navigation method based on navigation target extraction. The accessible webpage navigation method comprises the following steps: after capturing webpages from an internet, carrying out the following operation for each webpage: firstly, analyzing the webpage as a file garget model tree; performing depth-first traversal on the file target model tree, and numbering nodes of the file target model tree by using nature numbers; by taking the absolute difference of corresponding numbers of two hyperlinks as the distance between the hyperlinks, dividing hyperlinks with small distances into one group; calculating the number of hyperlinks of each hyperlink group, and the mean and the square difference of lengths of hyperlink texts; by taking the number of hyperlinks, the mean and the square difference of lengths of the hyperlink texts as characteristics, representing the hyperlink groups in a formalization manner; classifying the hyperlink groups after representation of formalization into navigation targets and non-navigation targets. The accessible webpage navigation method has the advantages that the navigation targets in the webpages can be automatically extracted, users can be navigated rapidly among webpages, and the user representation degree can be increased.
Owner:ZHEJIANG UNIV

Emotion recognition method based on brain-computer cross-modal migration

The invention discloses an emotion recognition method based on brain-computer cross-modal migration. For an emotion recognition task, cognitive representation with emotions is obtained after a human brain processes information, what is obtained by machine learning is only the formal representation of an image, and if a migration relation between the cognitive representation and the formal representation can be established, machine learning is guided through the human brain, and the machine is endowed with the emotion cognitive ability of the human brain; in order to give information perceived by the human brain to the machine, a cross-modal migration model of an image mode and an electroencephalogram mode needs to be established, so that the migration relation between the formal representation and cognitive representation is obtained. According to the method, the migration relation between the electroencephalogram mode and the image mode is explored, the relation between formal representation and cognitive representation is established, and brain-computer collaborative intelligence is achieved. In order to reduce the difference between the cognitive representation and formal representation and enable the formal representation to infinitely approach the cognitive representation, the invention designs the emotion recognition method based the brain-computer cross-modal migration.
Owner:HANGZHOU DIANZI UNIV

Method based on quantitative verification method for evaluating reliability of concurrent real-time system

The invention discloses a method based on a quantitative verification method for evaluating the reliability of a concurrent real-time system. The method comprises the following steps that 1, a probabilistic timed interface automaton with parameters is adopted for constructing a concurrent real-time system model; 2, the model constructed in the step 1 is combined according to input/output operationpairs on an interface, and the combined PPTIA model is converted into a time-domain diagram by using a forward reachability algorithm with parameters; 3, a probabilistic timed strategy logic (PTSL) language is used for constructing formal specifications of reliability requirements; 4, a verification algorithm is used for evaluating the reliability of the concurrent real-time system. According tothe method, in order to solve the problems that existing logical languages cannot directly conduct formal representation on strategies and data required by models cannot be accurately obtained in thedesign stage, the quantitative verification method on the basis of the probabilistic timed interface automaton with the parameters and probabilistic timed strategy logic is adopted for evaluating thereliability of the concurrent real-time system.
Owner:JILIN UNIV

Method for generating information spreading path with global minimum cost between microblog groups

The invention discloses a method for generating an information spreading path with global minimum cost between microblog groups. The method mainly comprises three steps of path cost modelling, initial path generation and deep path optimization, wherein formal representation of the information spreading path between the groups and construction of a time cost model of the information spreading path are realized in the step 1; an information spreading path with local minimum cost between the groups is generated in the step 2; and the information spreading path with the global minimum cost is finally generated and output through iterative optimization of crossover and mutation operators in the step 3. Compared with the prior art, the method has the advantages of high accuracy, fast speed, strong extendibility, simplicity and easiness in implementation and can be applied to the fields, such as public opinion monitoring, data visualization, electronic commerce, intelligent transportation and medical treatment and health.
Owner:TONGJI UNIV

Synthetic path automatic generation method based on recursion decomposition of chemical production problem

InactiveCN107832970AMeet choice jobResourcesChemical synthesisDecomposition
The invention relates to a synthetic path automatic generation method based on the recursion decomposition of a chemical production problem. According to the invention, a solvable judgment device of asynthetic process is designed on the basis of a recursion function. Whether a target product can be generated through a series of chemical synthesis processes or not is judged under the limitation ofcurrent raw materials and reactions. In this way, a synthetic process decomposition device is designed. The synthetic process of the target product is decomposed, and all possible synthesis paths areautomatically generated. According to the method, the defects respectively existing in the existing logic center method and the information center method are overcome. According to the recursion traversing algorithm, the types and the number limit of raw materials in the actual production condition are considered, and a unified formal expression method is designed. The method can be better applied to actual chemical production of different conditions. All decomposition schemes can be obtained after the judgment on whether the decomposition is enabled or not is made. Therefore, the selection work of the follow-up path can be better realized.
Owner:YANGZHOU UNIV

A method for composing an application using a plurality of distributed interaction patterns

The present invention relates to a method for composing an application using a plurality of distributed interaction patterns including services, events, actions and properties. A second semantic modelor Thing Recipe is provided as a basis for representing the application. This Thing Recipe provides a concept for orchestration or choreography of interaction patterns distributed across a network. The process from a specification of the Thing Recipe to its deployment is considerable shorter than the implementation and orchestration of web service. The Thing Recipe is not only interpretable but also executable. The semantic approach of the Thing Recipe enables a formal representation capable of a machine-based discovery of the application functionality and, at the same time, a machine interpretation and execution. This means that a Thing Recipe can be directly executed in any device that has an embedded runtime with reasoning capabilities.
Owner:SIEMENS AG
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products