946 results about "Dependency relation" patented technology

A software development system develops a product from core library of source code elements, the core library being categorized into components having one or more features. A configurator develops configuration state data based on a designated platform type and the source code elements. A graphical user interface displays a visual and logical representation of the product according to the configuration state data, includine visual indications of any unresolved dependencies. A product make routine then generates the product from the source code elements according to the configuration state data.

The present invention provides for a system and method facilitating configuration management. The system includes a configuration store that stores persisted configuration and / or dependency information associated with application(s), and, a configuration service component that manages access to the configuration store. The system can further include a configuration management engine (e.g., API) that allows client application(s) to access, query and / or modify setting(s). In accordance with an aspect of the present invention, application(s) submit an XML assembly manifest which comprises: the assembly identity, the application binaries, its dependencies etc. The manifest can also include a configuration section that declaratively specifies the persisted settings for the application. The configuration section includes an XSD-based schema that defines rich types for the settings and the settings themselves, and metadata for these settings including description and default values, manageability attributes (e.g., migrate, backup, policy), and integrity constraints called assertions (that could potentially describe the relationships between settings).

A heterogeneous multiprocessor system including a plurality of processor elements having mutually different instruction sets and structures avoids a specific processor element from being short of resources to improve throughput. An executable task is extracted based on a preset depending relationship between a plurality of tasks, and the plurality of first processors are allocated to a general-purpose processor group based on a depending relationship among the extracted tasks. A second processor is allocated to an accelerator group, a task to be allocated is determined from the extracted tasks based on a priority value for each of tasks, and an execution cost of executing the determined task by the first processor is compared with an execution cost of executing the task by the second processor. The task is allocated to one of the general-purpose processor group and the accelerator group that is judged to be lower as a result of the cost comparison.

The invention provides an implement method of an FAQ Chinese question answering system in the tourism field. The implement method comprises the steps of FAQ collection and organization, construction of a tourism field knowledge base, user query, question analysis, answer extraction and the like, thereby realizing the FAQ Chinese question answering system in the tourism field. The implement method constructs the tourism field knowledge base-field knowledge network with the help of the idea of ontology, utilizes the KDML language to define and describe the terms and the relations of the tourism field and realizes the integration of the tourism field knowledge network and a general knowledge base-knowledge network. The invention proposes a calculation method of similarity of tourism questions on the basis, the method realizes the calculation of the similarity of the questions with the help of the characteristics of the questions of the tourism field and the combination of morphological relations, the syntactic dependency relations and the field concept semantic relations in the questions, and the method further searches the related question from a candidate question set and extracts the answer of the question based on the similarity calculation. The test result of a Yunnan tourism FAQ question answering system proves that the method is feasible and has better effect.

A document annotation method includes modeling data elements of an input document and dependencies between the data elements as a dependency network. Static features of at least some of the data elements are defined, each expressing a relationship between a characteristic of the data element and its label. Dynamic features are defined which define links between an element and labels of the element and of a second element. Parameters of a collective probabilistic model for the document are learned, each expressing a conditional probability that a first data element should be labeled with information derived from a label of a neighbor data element linked to the first data element by a dynamic feature. The learning includes decomposing a globally trained model into a set of local learning models. The local learning models each employ static features to generate estimations of the neighbor element labels for at least one of the data elements.

A method and an apparatus that schedule a plurality of executables in a schedule queue for execution in one or more physical compute devices such as CPUs or GPUs concurrently are described. One or more executables are compiled online from a source having an existing executable for a type of physical compute devices different from the one or more physical compute devices. Dependency relations among elements corresponding to scheduled executables are determined to select an executable to be executed by a plurality of threads concurrently in more than one of the physical compute devices. A thread initialized for executing an executable in a GPU of the physical compute devices are initialized for execution in another CPU of the physical compute devices if the GPU is busy with graphics processing threads. Sources and existing executables for an API function are stored in an API library to execute a plurality of executables in a plurality of physical compute devices, including the existing executables and online compiled executables from the sources.

A computer readable medium storing executable instructions includes executable instructions to: receive a continuous stream of database transactions; form batches of database transactions from the continuous stream of database transactions; combine batches of database transactions with similar operations to form submission groups; identify dependencies between submission groups to designate priority submission groups; and apply priority submission groups to a database target substantially synchronously with the receipt of the continuous stream of database transactions.

A method of assessing a network uses a model (450) having nodes (100, 110) to represent parts of the network infrastructure and the application services, and having links to represent how the nodes influence each other. Dependencies or effects of the application services are found by determining paths through the nodes and links of the model (530). Such assessment can be useful for design, test, operations, and diagnosis, and for assessment of which parts of the infrastructure are critical to given services, or which services are dependent on, or could have an effect on a given part of the infrastructure. The dependencies or effects can encompass reachability information. The use of a model having links and nodes can enable more efficient processing, to enable larger or richer models. What changes in the dependencies or effects result from a given change in the network can be determined (830).

A processor is connected to a storage device storing an incoming e-mail, a dependency database, and code for a calendar application. The dependency database can be built from an e-mail corpus containing a plurality of natural language e-mails containing scheduling information. The incoming e-mail is parsed by the processor to build a dependency tree containing word pairs from the e-mail that are found in the dependency tree. The word pairs are stored as dependency pairs in a tree structure in the dependency tree. A probability sum for the dependency tree is calculated to determine if the e-mail contains scheduling information. If the probability sum exceeds a predetermined value, the e-mail is assumed to contain scheduling information and the scheduling information is extracted from the dependency tree and exported to the calendar application.

A system and method for improved testing of a software build is provided. The system and method automatically track differences between software builds by scanning the binaries of a software product to automatically discover its classes. The system and method then build a detailed dictionary that captures static and dynamic information of that build, including class dependencies. A comparison may be made with another build, so that the present invention may automatically execute selective tests on any types, and their dependencies, that have had a structural or behavioral modification since the last build. Testers may load a set of constructors for any specific types to further increase coverage of types (or classes) tested. The present invention may also provide detailed reports that may be used to drive future testing work and target specific areas of the code for additional testing. The system and method may further provide code generation from intermediate code to specified targets to aid in reproducing and fixing bugs.

Embodiments of a system and method for providing class dependency graph-based class loading and reloading may be used to segregate namespaces in a graph-centric way, and may provide a set of normalized topologies that may be used to efficiently support hot-swapping of programmatic logic such as classes, applets, and beans, among other applications. Embodiments may provide a domain-independent, flexible and robust namespace segregation technique that is based on the dependency between the various classes and not on details like the roles the classes play. The problem of segregating namespaces is formulated as a graph theory problem, and a solution is sought through graph techniques. The graph may be normalized by identifying and grouping interdependent classes and non-interdependent classes in separate groups. A directed dependency relationship of the groups may be determined using the relationships between the member classes of the groups.

An improved system and method for revising natural language parse trees is provided. A revision dependency parser may learn a set of transformation rules that may be applied to dependency parse trees generated by a base parser for revising the dependency parse trees. A corpus of natural language sentences and a set of correct dependency parse trees may be used to train a revision dependency parser to correct dependency parse trees generated by the base parser. A revision engine may compare the dependency parse trees produced by the base parser with the correct ones present in the training data to produce an observation-rule pair for each dependency. A rule may specify a transformation on the predicted dependency parse tree generated by the base parser to replace an incorrect dependency with a corrected dependency or may change the type of dependency expressed for the grammatical function of the dependent word.

Methods and systems consistent with the present invention provide an improved software development tool that represents multiple dependencies between a dependent node and a defining node in a project as a single dependency link. Methods and systems consistent with the present invention also identify and display details regarding each dependency in a project upon request by the user.

An improved method for providing parallel apply in asynchronous data replication in a database system is disclosed. The improved method and system provides a high speed parallel apply of transactional changes to a target node such that the parallel nature of the application of changes does not compromise the integrity of the data. The method and system detects, tracks, and handles dependencies between transaction messages to be applied to the target node. If a transaction message has a dependency on one or more preceding transaction messages whose applications have not yet completed, that transaction message is held until the application completes. In addition, the method and system requires significantly less overhead than conventional approaches.

A computer-implemented method for automatically generating computer code for a software system from a representation of the software system. An architectural description language is used to represent activities and dependencies between activities as separate entities. Dependencies are managed by coordination processes associated with the dependency. Activities and dependencies are connected through ports which encode interfaces between activities and coordination processes. At least one associated computer program is identified for each activity and dependency for implementing the activity or managing the dependency, wherein the representation is defined by activities, dependencies and ports through which activities are connected to dependencies. The associated computer programs are combined to provide the computer code for the software system.

A project template information management database 1 of a planning operation management support system includes: database groups from 20 to 23 saving setting information of planning operations performed in the past, names of process flows in the respective layers (task name), lead times (lead time) required for the respective process flows (task), and dependency relations between the process flows (task), as templates by the respective customers; a result database 15 storing trading results with customers in the past; and a calendar database 16 storing calendar information setting actual working days when workers in charge of the respective process flows carry on a work, and holidays. A client terminal 4 includes: an input device 35 inputting new project names, customer names, and delivery dates; and a CPU41 calling a corresponding customer's template from the project template information management database 1 by inputting the customer name, the name of the new project, and the delivery date, creating a new project information, and displaying the Gantt chart on the screen.

A Relational Database Management System (RDBMS) having any arbitrary structure is translated into a multi-dimensional data model suitable for performing OLAP operations upon. If a relational table defining the relational model includes any tables with cardinality of 1,1 or 0,1, the tables are merged into a single table. If the relational table is not normalized, then normalization is performed and a relationship between the original table and the normalized table is created. If the relational table is normalized, but not by dependence between columns, such as in the dimension table in a snowflake schema, the normalization process is performed using the foreign key in order to generate the normalized table. Once the normalized table is generated, OLAP measures are derived from the normalized relational table by an automated method. In addition, OLAP dimensions are derived from the normalized relational table and the results of the OLAP measures derivation by an automated method according to the present invention. According to an aspect, it is possible to associate a member of a dimension to another member of the same or another dimension. According to another aspect, it is possible to create a new dimension of analysis, the members of which are all the different values that a scalar expression can take on. According to yet another aspect, it is possible to access the various instances of a Reporting Object as members in an OLAP dimension. According to the yet another aspect, it is possible to apply opaque filters or a combination of them to the data that underlies analysis.

The methods, systems, data structures and computer program products for deploying software components are provided, including deploying components in an enterprise environment. Dependency relationships among components to be deployed are determined. Those components which are not dependent upon any other component may be installed first and substantially in parallel. Components which are dependent only upon the first installed components are next installed, substantially in parallel. Installation thus progresses until all components have been installed. By installing in parallel those components having a similar level of dependency, rather than installing all components sequentially, the deployment is more efficient and requires less time to complete.

The invention discloses a text orientation analysis method which comprises the following steps of: preprocessing a review text; identifying a dependency relation structure of the Chinese syntax; calculating content polarity values of sentiment words; completing two-tuples extraction of evaluated objects and evaluation words and determining a slave relation between the evaluated objects; weighting and summing orientation values of the sentiment words to obtain an orientation value of a sentence so as to implement discrimination on orientation of a sentence level; discriminating appraising orientation of sentiment in the review by positive and negative polarity values of the sentence level; and according to the size of a polarity absolute value, discriminating intensity of appraising sentiment in the review. A product review orientation discriminator comprises an acquisition module, a preprocessing module, a syntactic analysis module, a sentiment calculating engine, a two-tuples mining engine, a content controller and a sentiment discriminator. According to the invention, a combined sentiment dictionary is combined and a domain ontology is added into text orientation analysis; accuracy of polarity calculation of the sentiment words and (the evaluated objects and the evaluation words) two-tuples extraction is improved; and orientation analysis on product reviews in a forum is implemented.

A system and a priori method of discovering dependencies between relational database column pairs and application of discoveries to query optimization is provided. For each candidate column pair remaining after simultaneously generating column pairs, pruning pairs not satisfying specified heuristic constraints, and eliminating pairs with trivial instances of correlation, a random sample of data values is collected. A candidate column pair is tested for the existence of a soft functional dependency (FD), and if a dependency is not found, statistically tested for correlation using a robust chi-squared statistic. Column pairs for which either a soft FD or a statistical correlation exists are prioritized for recommendation to a query optimizer, based on any of: strength of dependency, degree of correlation, or adjustment factor; statistics for recommended columns pairs are tracked to improve selectivity estimates. Additionally, a dependency graph representing correlations and dependencies as edges and column pairs as nodes is provided.

In one embodiment, a computer accessible medium stores a plurality of instructions including instructions which, when executed: track dependencies among a plurality of assets; and responsive to an identification of an asset for potential recovery (the “selected asset”), identify an asset dependency set corresponding to the selected asset. The asset dependency set comprises at least a subset of the plurality of assets, wherein each asset in the subset has a dependency with the selected asset. In some embodiments, one or more of the following may be provided: tracking asset dependencies and presenting the asset dependency set to the user; pruning the asset dependency set to a recovery set identifying the asset dependency set; generating the recovery order (optionally optimized); initiating the recovery according to the recovery order; performing recovery steps; generating the recovery plan and / or executing recovery plans.

A processor is connected to a storage device storing an incoming e-mail, a dependency database, and code for a calendar application. The dependency database can be built from an e-mail corpus containing a plurality of natural language e-mails containing scheduling information. The incoming e-mail is parsed by the processor to build a dependency tree containing word pairs from the e-mail that are found in the dependency tree. The word pairs are stored as dependency pairs in a tree structure in the dependency tree. A probability sum for the dependency tree is calculated to determine if the e-mail contains scheduling information. If the probability sum exceeds a predetermined value, the e-mail is assumed to contain scheduling information and the scheduling information is extracted from the dependency tree and exported to the calendar application.

The invention provides a Mongolian-Chinese machine translation method for enhancing semantic feature information based on a Transformer model. The method comprises the following steps: firstly, starting from the language characteristics of Mongolian, finding out the characteristics of the additional components of the Mongolian in terms of stem, affixes and lattices, and merging the language characteristics into the training of a model; secondly, distributed representation for measuring the similarity between the two words is taken as a research background, and the influence of depth, density and semantic coincidence degree on the concept semantic similarity is comprehensively analyzed; in the translation process, a Transformer model is adopted, and the Transformer model is a multi-layer encoder which performs position encoding by using a trigonometric function and is constructed on the basis of an enhanced multi-head attention mechanism. A decoder architecture, which completely dependson the mechanism of attention to draw the global dependency between the input and the output, eliminates recursion and convolution.

A method for determining the dependencies between objects in a system is provided. Determining the dependencies between objects involves analyzing data about the objects and applying rules to the data about the objects. According to one embodiment, a first set of dependencies between a plurality of objects may be based on data in a set of sources and dependency rules, whereas a second set of dependencies between the plurality of objects may be based on data from a different set of sources but the same dependency rules. According to another embodiment, a first set of dependencies between a plurality of objects may be based on data in a set of sources and dependency rules, whereas a second set of dependencies between the plurality of objects is based on data from the same set of sources but different dependency rules.

A data processing apparatus capable of performing processing in units of block data by using processing results of other block data in a short time is provided, wherein a deblocking filter performs horizontal filtering processing and vertical filtering processing on first block data and second block data obtained by dividing restructured picture data into two in parallel by adjusting their dependency relation.

A method, apparatus, and computer instructions are provided for enhancing software catalog manageability, providing abstract software configuration, and desired state management. A first mechanism is provided for enhancing software catalog manageability. The first mechanism includes a software model that separates metadata of software from actual binaries of the software. A second mechanism is provided for abstracting software configuration for automation. The second mechanism includes a hierarchical software resource template structure that specifies parameters, dependencies between parameters, features, options, and parameters that cannot be predefined. The template is consumed by user defined workflows to create actual software resources during deployment. A third mechanism is provided for desired state management and patch compliance assessments. The third mechanism checks against a server template or software resource in a data center model against what is installed on actual machines to determine compliance.

Software management methods and apparatus for performing software configuration management operations and for supporting build processes are described. Both implied and explicit dependency relationship information is captured and intelligently used in an automated fashion avoiding or reducing the need for human tracking of such relationships. Temporary or non-persistent data elements used during various phases of the software development process are automatically detected, including for example environment variables and their values and the versions of tools used to operate on the software components. A persistent association is created and stored between the normally temporary data element(s) and the software component(s) they affect. Implicit dependencies between data elements and software components are also automatically updated and revision-controlled, making historical and current implicit dependencies persistent. A software management information data base including implicit dependency relationship and explicit dependency relationship information is created. The information reflects explicit or implied relationships between various software components.

Embodiments of a system and method for providing class dependency graph-based class loading and reloading may be used to segregate namespaces in a graph-centric way, and may provide a set of normalized topologies that may be used to efficiently support hot-swapping of programmatic logic such as classes, applets, and beans, among other applications. Embodiments may provide a domain-independent, flexible and robust namespace segregation technique that is based on the dependency between the various classes and not on details like the roles the classes play. The problem of segregating namespaces is formulated as a graph theory problem, and a solution is sought through graph techniques. The graph may be normalized by identifying and grouping interdependent classes and non-interdependent classes in separate groups. A directed dependency relationship of the groups may be determined using the relationships between the member classes of the groups.

A system and method are disclosed for extracting information from text which can be performed without prior knowledge as to whether the text includes a list. The method applies parser rules to a sentence spanning lines of text to identify a set of candidate list items in the sentence. Each candidate list item is assigned a set of features including one or more non-linguistic feature and a linguistic feature. The linguistic feature defines a syntactic function of an element of the candidate list item that is able to be in a dependency relation with an element of an identified candidate list introducer in the same sentence. When two or more candidate list items are found with compatible sets of features, a list is generated which links these as list items of a common list introducer. Dependency relations are extracted between the list introducer and list items and information based on the extracted dependency relations is output.