67 results about "Problem domain" patented technology

Provided herein is a pen-based editing system for manipulating mathematical expressions. Through a largely gesture based, directly manipulative interface, the system allows a user to make conventional changes to expressions, such as copy and move, and also to work with the expressions in ways peculiar to the problem domain, including, for example, handling ambiguity, expression fragments and alternate recognitions. The system is a generalization of an online recognizer for mathematical expressions. The system uses the same basic recognition techniques as the online recognizer, however the input information available to the editor is more varied, including mixtures of known and unknown characters and positional relations.

A method for visual representation of end user response time (EURT) in a multi-tiered network application is provided. Search criteria for searching a repository of client statistics records is received. The search criteria specifies identification information pertaining to a user of a multi-tiered network application experiencing application performance problems and a time period associated with the application performance problems. The identification information identifies an IP address of user's computing device. A plurality of client statistics records matching the search criteria is retrieved from the repository. The retrieved plurality of client statistics records is sorted based on measurements of performance parameters. A graph representing relevant topology hierarchy of the multi-tiered network application is presented to a user based on the sorted client statistics records. The graph visually identifies connections between nodes of the multi-tiered application. The identified connections include potential root-causes of the specified application performance problems.

A method and computer program product for optimization of large scale resource scheduling problems. Large scale resource scheduling problems are computationally very hard and extremely time consuming to solve. This invention provides a Lagrangian relaxation based solution method. The method has two distinct characteristics. First, the method is formal. It is completely structure-based and does not use any problem domain specific knowledge in the solution process, either in the dual optimization or the primal feasibility enforcement process. Second, updating the Lagrangian multipliers after solution of every sub-problem without using penalty factors results in fast and smooth convergence in the dual optimization. The combination of high quality dual solution and the structure-based primal feasibility enforcement produces a high quality primal solution with very small solution gap. An optimal solution is first found to the dual of the resource scheduling problem by sequentially finding a solution to a plurality of sub-problems and updating a set of values used in the dual problem formulation after each sub-problem solution is obtained. Coupling constraint violations are systematically reduced and the set of values are updated until a feasible solution to the primal resource scheduling problem is obtained. An initial set of multiplier values is further determined by solving a relaxed version of the primal problem where most of the local constraints except the variable bounds are relaxed.

The invention discloses a data quality management method and a data quality management system. The data quality management method comprises the following steps: managing a quality knowledge library; analyzing the data quality characteristics, and presetting a quality problem domain, a quality dimension domain, a quality rule domain and a quality standard domain; collecting quality information: selecting the quality dimension and the quality rules required by a user from the quality knowledge library, and extracting a data set meeting the user requirements from the original data sets; evaluating the data quality: evaluating the data quality according to the collected quality information, and generating and submitting a data quality report to the user or a quality manager according to the quality problem domain and the quality standard domain in the quality knowledge library; and improving the data quality: correcting the data quality problem detected in the evaluation of the data quality for improvement. The data quality management method and the data quality management system are applied to monitoring, evaluating and continuously improving the data quality in the whole hydrology industry based on the whole data processing procedure of the hydrology industry.

A cognitive system and method for predicting and detecting security breaches is provided which yields cognitive inputs to a security management interface accessible by a human operator. The system utilizes symbolic cognitive architectures and inference processing algebras allowing the system to respond to open, incomplete, and/or unknown problem domains, offering flexibility in the case of unexpected changes in the security environment. The system is also capable of intelligently, and in real-time, adapting security peripheral configurations to further probe and analyze the real-time security environment, provided real-time data that can be processed with symbolic cognitive architectures and inference process algebras enabling the identification of new and emerging threat profiles leading to the prediction and detection of security breaches.

Communication latency, now a dominant factor in computer performance, makes physical size, density, and interconnect proximity crucial system design considerations. The present invention addresses consequential supercomputing hardware challenges: spatial packing, communication topology, and thermal management. A massively-parallel computer with dense, spherically framed, geodesic processor arrangement is described. As a mimic of the problem domain, it is particularly apt for climate modelling. However, the invention's methods scale well, are largely independent of processor technology, and apply to a wide range of computing tasks. The computer's interconnect features globally short, highly regular, and tightly matched distances. Communication modes supported include neighbour-to-neighbour messaging on a spherical-shell lattice, and a radial network for system-synchronous clocking, broadcast, packet-switched networking, and IO. A near-isothermal cooling system, physically divorcing heat source and sink, enables extraordinarily compact geodes with lower temperature operation, higher speed, and lower power consumption.

A method for domain specific language design includes, with a physical computing system, receiving from a user, a number of annotations for at least one of a set of statements within a problem domain, the annotations identifying a set of elements within the statement. The method further includes forming a set of grammar rules for the problem domain based on the annotations, and parsing the set of statements using the set of grammar rules.

A method for automatically generating test cases from a domain specific description language specification makes use of the properties of the language to derive domain specific axioms and language specific predicates. These properties are embedded into an extended finite state machine which is in turn supplied to the input of a test case generator. The enhanced extended finite state machine, referred herein as an extended finite state machine accounting for axioms and predicates (EFSMAP) contains states and transitions associated with information on implied behavior of the specified system within a particular problem domain. The implicit behavior, defined by the axiomatic properties of the operators of the domain specific language, provide test capability of the associated system that was not explicitly set forth in the formal specification, but nevertheless should be tested to increase confidence in the reliability of the finished product.

A system and algorithm to map alerts to a problem domain is provided so that the size of a codebook for the problem domain may be reduced and correlated independently of the general system and/or other problem domains in the system topology. When one or more symptoms of a fault appear in the system topology, the problem domain is discovered dynamically and the codebook for the problem domain generated dynamically. The system described herein provides for computation of a problem domain that has a reduced object repository for a set of objects which are directly or indirectly impacted by monitored symptoms. Multiple problem domains may be independently computed in order to build one or more codebooks. Each problem domain may be smaller compared to a system topology resulting in scale and performance improvements for codebook computation and correlation.

The present invention relates to a valuation-based learning system. The system is configured to receive a plurality of inputs, each input being input evidence corresponding to a variable in a Dempster-Shafer Reasoning System. The Dempster-Shafer Reasoning System is a network of interconnected nodes, with each node representing a variable that is representative of a characteristic of a problem domain. A discount weight is then optimized for assigning to each of the inputs. A basic probability assignment (bpa) is generated using the Dempster-Shafer Reasoning System, and where the bpa is an output for use in determining a solution of the problem domain. Finally, a solution to the problem domain is determined using the bpa.

A programming model that takes general purpose APIs and machine-generates new programming models based on user defined schemas that provide the developer with data and view separation, and a way to communicate to the host application using the domain of the problem being solved. The system comprises a schema component that the developer uses to define a schema that includes one or more domain terms related to the problem to be solved, and a mapping component that uses the schema to search and map selected constructs from one or more generic host application APIs to the corresponding problem domain terms. Once the mapping is completed, a generating component generates a new API that is used by a host application to facilitate developing an application document using terms related to the domain of the problem to be solved.

In various embodiments of the present invention, optimal or near-optimal multidirectional context sets for a particular data-and/or-signal analysis or processing task are determined by selecting a maximum context size, generating a set of leaf nodes corresponding to those maximally sized contexts that occur in the data or signal to be processed or analyzed, and then building up and concurrently pruning, level by level, a multidirectional optimal context tree constructing one of potentially many optimal or near-optimal context trees in which leaf nodes represent the context of a near-optimal or optimal context set that may contain contexts of different sizes and geometries. Pruning is carried out using a problem-domain-related weighting function applicable to nodes and subtrees within the context tree. In one described embodiment, a bi-directional context tree suitable for a signal denoising application is constructed using, as the weighting function, an estimated loss function.

The invention discloses a method for establishing a software requirement model, which comprises the following steps: a problem domain is identified and a viewpoint is defined; a scene is established for each viewpoint relevant to a software system to be developed; a system requirement model is established in an action description language; all the viewpoints are tested; if the testing result is problem finding, the corresponding scene action model or the viewpoint action model is required to be modified and returned to be detected again until the testing result of every viewpoint passes; and if the testing result passes, all the viewpoint action models are synthesized to get and output a final system requirement model. By adopting the technologies of scene and viewpoint, a good foundation is laid by the method of the invention for establishing the high quality requirement model for a complex software system and automatically detecting whether a software system is correct and complete; moreover, the invention is compatible with other modeling methods and technologies and has good universality and utility.

One embodiment of the present invention provides a system that reuses information associated with a constraint solving operation for a problem domain. This system begins by receiving a constraint problem from the problem domain. Then, the system searches through a problem cache for an entry which corresponds to the canonical representation. If a corresponding entry does not exist in the problem cache, the system produces an entry in the problem cache for the canonical representation. Otherwise, if a corresponding entry already exists in the problem cache, the system generates a solution to the canonical representation by reusing the solver heuristic associated with the corresponding entry in the problem cache.

The invention relates to a layering collocation method of land utilization. According to the layering collocation method of the land utilization, basic data of the land utilization are firstly obtained and collected by a land utilization layering collocation model, land needing to be optimized in spatial arrangement is suitability evaluated, a specific genetic algorithm chromosome and a genetic evolution operator are constructed aiming at optimization problems of the land utilization spatial arrangement, mapping from a problem domain to the algorithm domain is accomplished and the spatial arrangement of various kinds of land is optimized by using the genetic algorithm under the guidance of a space optimization objective, and then land utilization competition between the optimized spatial arrangement of the various kinds of land and the land utilization in an existing state is solved by combining knowledge in the land planning field and the game theory. The layering collocation method of the land utilization is capable of well optimizing the spatial arrangement of the various kinds of land and good at coordinating the land utilization. The knowledge in the land planning field ensures that a land utilization coordination result is reasonable and the game theory is capable of solving the land utilization competition by introducing benefit factors, and feasibility of the land utilization coordination result is well guaranteed.

Methods, software programs and systems for extending and modifying software functionality, and, more particularly, for using one or more patterns for an enterprise software object to express desired functionality and configuration, and to generate the enterprise software object using the patterns, in an enterprise environment are disclosed. A method according to certain of these embodiments includes selecting one or more patterns from a number of patterns, where the one or more patterns are for an enterprise software object. The enterprise software object can then be generated. The enterprise software object is generated using the one or more patterns. Each of the patterns is configured to describe a solution within a corresponding one of a number of problem domains.

The invention relates to an optimal transportation meshless (OTM) method for solving large deformation of a material and aims at solving the problems of effective and stable solving of maximum deformation, high-speed impact and geometric distortion, metal material molding, multiphase coupling and the like. The OTM method adopts a material point and node pair original problem domain to perform discretion and adopts a local maximum entropy interpolation function to construct a continuous movement function, and the problem that mesh distortion caused in maximum deformation processed by adopting a finite element method, the problem that a Dirichlet boundary condition cannot be directly added for a meshless method, calculating misconvergence and the like are avoided. In addition, due to the fact that interpolation and integration are performed at different discrete points, an effective meshless numerical integration mode is provided, and the problem of tensile stress instability is solved. The OTM method serves as an incremental updating Lagrangian method to make mass conservation automatically achieved without solving. Time discretion is performed by adopting an optimal transportation theory, the momentum conservation and symplectic conservation of a discrete system are ensured, and the operation efficiency and precision are greatly improved.

The invention discloses a method for processing data quality and a system, wherein, the method comprises the following steps: establishing the management process of data according to the pre-set data quality problem domain and the pre-set data quality planning domain; automatically processing the data by implementing the management process so as to obtain the processing result of the data. As an integral data processing process is established according to the characteristic of the data, and all the problems are managed in a unified manner, the invention has the advantage that the root of an occurred problem can be found in the data processing process according to the problem, thereby improving the stability and the quality of a data production process; and, as both the data processing processes based on the data quality problem domain and the data quality planning domain can be executed automatically, the invention further has the advantages that the automaticity of the data management is higher; the accuracy and the practicability of the analysis are enhanced; and the basis of the following analysis management is provided.

The invention discloses a time requirement modeling and verification method based on a problem frame method, which is used for modeling time requirements and verifying normative consistency of a time-critical system. The invention relates to the operations as follows: (1) defining an interaction and problem domain as a logical clock by using the concepts of the logical clock and clock relations in a clock constraint specification language (CCSL) based on a functional requirement model problem graph of the problem frame method; using clock constraint to define time constraint of an interaction environment (comprising the interaction and problem domain) of the time-critical software system to be developed, wherein the time constraint comprises quantitative and qualitative relations, establishing a time requirement model and exporting a time protocol of the system to be developed via time constraint of the environment; (2) defining formal semantics of the clock constraint, establishing a transformational rule from the clock constraint to an NuSMV description according to the semantic, using the rule to convert the time constraint into the NuSMV description, using a model detecting tool NuSMV to verify consistency of the time protocol according to a computation tree logic (CTL) expression of a consistent property.