39 results about "Formal representation" patented technology

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.

In certain example embodiments, distributed cloud application deployment systems (DCADS), and/or associated methods are provided. A formal description of the cloud application is created. The cloud application's formal representation, with its constituent nodes and their associated properties and interfaces, etc., is exported to a machine processable form. The exported DCADS machine processable rendition and any needed implementation artifacts are retrieved by a cloud application deployer that helps facilitate the deployment of the cloud application into the distributed and heterogeneous cloud environments as prescribed in the DCADS.

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.

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.

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.

The invention relates to a security threat analyzing method based on a service data stream model. The method includes the steps of establishing the service data stream model, decomposing an information system, analyzing key service flow, recognizing and grading sensitive data, and analyzing the security threat. According to the technical scheme, by establishing the key service data flow link of the information system on the basis of the service data stream model, introducing the security grades of the sensitive data, and recognizing the security threat of each key service flow and conducting formal representation according to the key service data flow model, a user can be helped to design the security threat analysis better conforming to the system service flow, and therefore the overall security of an application system is enhanced.

The invention discloses a method for combining semantic Web services based on an expanded Petri network model. The method is characterized by including the following steps that (1), according to sub-services involved in the combining process of the semantic Web services, an original Petri network model is expanded, and the expanded Petri network model of the sub-services is formed; (2), through the expanded Petri network model of the sub-services, a formal description and a function mechanism of the expanded Petri network model of a semantic Web service combination result are achieved combined with formalization presentation of the semantic Web service combination result; (3), on the basis of the expanded Petri network model obtained according to the step 1 and the step 2, the semantic Web service combination is achieved. A Petri network is used as a basic model for expansion, moreover,the service combination method based on the expanded Petri network model is provided, and therefore dynamic combination of execution sequences of the sub-services is achieved.

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.

Disclosed is an automatic modeling technology for a typical matching structure in an aircraft manufacturing tool. The technology mainly comprises the following steps: (1) defining a formalization expression of an automatic selection and positioning method of components of the typical matching structure, (2) reading and explaining a semantic model, (3) positioning and installing the components, and (4) generating a final model of the components. By the application of the automatic modeling technology, automatic modeling of the common typical matching structure in the aircraft manufacturing tool can be achieved, and development efficiency of the aircraft manufacturing tool is improved.

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.

Method of generating a number of steps constituting an adaptable clinical workflow based on a recursive approach in which for each step of the workflow the following steps are executed: Selecting a number of knowledge bases to be included in a reasoning step on the basis of (a) goal(s), generating (a) query(ies) taking into account the goal(s), applying the selected knowledge bases and the generated queries to a reasoning engine so as to generate a solution, interpreting this solution by translating the solution given in a formal representation into (an) executable action(s) for the current step in the clinical workflow.

The invention discloses a transaction stock rapid finding method based on time sequence convolution self-coding, and relates to the technical field of data mining, and the technical scheme is that themethod comprises the steps: obtaining stock transaction quotation data in a time span; performing time series data formalized representation on the obtained stock transaction quotation data to generate time series formalized data of the stock; generating a time sequence convolution self-encoding model according to the time sequence formalized data, and training the time sequence convolution self-encoding model; and finding out the transaction stock according to the time sequence convolution self-encoding model in combination with the time sequence formalized data. The beneficial effects of the invention are that the method can automatically detect the transaction stock in any time span, and saves the manual analysis cost; 2, transaction stock s with non-breakthrough index threshold typescan be detected.

A computer-implemented method can include receiving, at a computing device including one or more processors, an input from a user. The input can include one or more characters in a first writing system. The method can further include segmenting the input to obtain one or more segmentations, where each segmentation can include at least one segment including at least one character in the first writing system. A fuzzy model can be applied to the segmentations to obtain potential formal representations for the segmentations. Each of the potential formal representations can be in the first writing system and represent text in a second writing system. A plurality of character candidates can be determined based on the potential formal representations. Each of the plurality of character candidates can be a possible appropriate representation of the user input in the second writing system.

The invention discloses a multi-domain system design and optimization method. The multi-domain system design and optimization method comprises the steps of presenting a system optimizing method in a formalized mode on basis of system modeling language SysML(System Modeling Language), and defining the presentation standard of a system design model by a SysML extension mechanism; analyzing according to the functional demands of a multi-domain system to be designed and optimized, establishing a system design model on basis of the presentation standard, and automatically extracting a system optimizing model; and invoking a system optimizing method to automatically solve the system optimizing model, returning an optimizing result to a system optimization model, and optimizing the system design model according to the optimizing result. According to the method disclosed by the invention, the system design and the system optimization can be combined effectively, and the automatic optimization of the system can be realized in the system design process.

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.

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 model or 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.

The invention provides an ontology construction method in the field of coal mine typical dynamic disasters. According to the method, a traditional skeleton method and a seven-step method are fused, the technology used in the ontology construction process is elaborated in detail, and an ontology construction thought which can be achieved in engineering is provided for researchers. A Jena tool is used to realize formal representation of an ontology, and an architecture of the Jena tool and key codes used for construction are introduced.

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.

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.

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.