91 results about "Dynamical programming" patented technology

The present invention provides a system, method and software for programming and configuring an adaptive computing architecture or device. The invention utilizes program constructs which correspond to and map directly to the adaptive hardware having a plurality of reconfigurable nodes coupled through a reconfigurable matrix interconnection network. A first program construct corresponds to a selected node. A second program construct corresponds to an executable task of the selected node and includes one or more firing conditions capable of determining the commencement of the executable task of the selected node. A third program construct corresponds to at least one input port coupling the selected node to the matrix interconnect network for input data to be consumed by the executable task. A fourth program construct corresponds to at least one output port coupling the selected node to the matrix interconnect network for output data to be produced by the executable task;

A network of sensor and controller nodes having the ability to be dynamically programmed and receive updated software from one another, and from a host system. Each network node includes multiple state machines, at least some of which are operable relative to physical pins at the network node; the physical pins correspond to inputs from sensor functions or outputs to control functions. The network nodes include microcontrollers that are operable in an operating mode to execute a state machine and respond to commands from other nodes or the host, and in a read mode to receive and store program instructions transmitted from other nodes or the host. A learn mode is also provided, by way of which a network node can store program code corresponding to instructions and actions at the node when under user control.

The present invention leverages spatial relationships to provide a systematic means to recognize text and / or graphics. This allows augmentation of a sketched shape with its symbolic meaning, enabling numerous features including smart editing, beautification, and interactive simulation of visual languages. The spatial recognition method obtains a search-based optimization over a large space of possible groupings from simultaneously grouped and recognized sketched shapes. The optimization utilizes a classifier that assigns a class label to a collection of strokes. The overall grouping optimization assumes the properties of the classifier so that if the classifier is scale and rotation invariant the optimization will be as well. Instances of the present invention employ a variant of AdaBoost to facilitate in recognizing / classifying symbols. Instances of the present invention employ dynamic programming and / or A-star search to perform optimization. The present invention applies to both hand-sketched shapes and printed handwritten text, and even heterogeneous mixtures of the two.

A network system providing highly reliable transmission quality for delay-sensitive applications with online learning and cross-layer optimization is disclosed. Each protocol layer is deployed to select its own optimization strategies, and cooperates with other layers to maximize the overall utility. This framework adheres to defined layered network architecture, allows layers to determine their own protocol parameters, and exchange only limited information with other layers. The network system considers heterogeneous and dynamically changing characteristics of delay-sensitive applications and the underlying time-varying network conditions, to perform cross-layer optimization. Data units (DUs), both independently decodable DUs and interdependent DUs, are considered. The optimization considers how the cross-layer strategies selected for one DU will impact its neighboring DUs and the DUs that depend on it. While attributes of future DU and network conditions may be unknown in real-time applications, the impact of current cross-layer actions on future DUs can be characterized by a state-value function in the Markov decision process (MDP) framework. Based on the dynamic programming solution to the MDP, the network system utilizes a low-complexity cross-layer optimization algorithm using online learning for each DU transmission.

A system extracts translations from translated texts, such as sentence translations from translated versions of documents. A first and a second text are accessed and divided into a plurality of textual elements. From these textual elements, a sequence of pairs of text portions is formed, and a pair score is calculated for each pair, using weighted features. Then, an alignment score of the sequence is calculated using the pair scores, and the sequence is systematically varied to identify a sequence that optimizes the alignment score. The invention allows for fast, reliable and robust alignment of sentences within large translated documents. Further, it allows to exploit a broad variety of existing knowledge sources in a flexible way, without performance penalty. Further, a general implementation of dynamic programming search with online memory allocation and garbage collection allows for treating very long documents with limited memory footprint.

A method of programming a programmable analog device that introduces on a single chip a set of tailored analog blocks and elements that can be configured and reconfigured in different ways to implement a variety of different analog functions. The analog blocks can be electrically coupled to each other in different combinations to perform different analog functions. Each analog block includes analog elements that have changeable characteristics that can be specified according to the function to be performed. Configuration registers define the type of function to be performed, the way in which the analog blocks are to be coupled, the inputs and outputs of the analog blocks, and the characteristics of the analog elements. The configuration registers can be dynamically programmed. Thus, the device can be used to realize a large number of different analog functions and applications.

An electronic data mining process for mining from an electronic data base using an electronic digital computer a listing of commercially useful information of the type known in the art as an association rule containing at least one uninstantiated condition. For example, the commercially useful information may be information useful for sales promotion, such as promotion of telephone usage. The computer retrieves from the database a plurality of stored parameters from which measures of the uninstatiated condition can be determined. The computer uses a dynamic programming algorithm and iterates over intervals or sub-ranges of the parameters to obtain what is called an at least partially optimized association rule, as optimized intervals or sub-ranges of at least some of the retrieved parameters, for example, time intervals of high usage of certain types of telephone connections. These optimized intervals are provided as the listed commercially useful information. The amount of needed iteration is reduced in some cases by using so-called bucketing and divide-and-conquer techniques. Extension of the process for a plurality of uninstantiated conditions is described.

A scheduling system for choosing the most appropriate heuristic for solving time-dependant scheduling problems. The invention includes a means for selecting the most appropriate heuristic method for generating a schedule from an enumerative (“brute force”) method, a dynamic programming method, and a genetic method. The invention further includes a hashing function that is capable of detecting duplicate solutions generated by the dynamic programming module and a height-balanced binary tree for providing search insertion and deletion operations.

A method for level three feature extraction from a print image extracts features associated with a selected ridge segment using a gray-level image under the guidance of at least one binary image. The level three features are a sequence of vectors each corresponding to a different level three characteristic and each representing a sequence of values at selected points on a print image. The level three features are stored and used for level three matching of two prints. During the matching stage, ridge segments are correlated against each other by shifting or a dynamic programming method to determine a measure of similarity between the print images.

A method or system of optimally scheduling projects with resource constraints and stochastic task durations. This is a new framework in order to solve real world problems of uncertainties and computational dilemma in project scheduling and management. This new framework is devised with a constraint programming (CP) procedure as an approximate dynamic programming (ADP) to reduce the size of domain.

A method for dynamically programming Field Programmable Gate Arrays (FPGA) in a coprocessor, the coprocessor coupled to a processor, includes: beginning an execution of an application by the processor; receiving an instruction from the processor to the coprocessor to perform a function for the application; determining that the FPGA in the coprocessor is not programmed with logic for the function; fetching a configuration bit stream for the function; and programming the FPGA with the configuration bit stream. In this manner, the FPGA are programmable “on the fly”, i.e., dynamically during the execution of an application. The hardware acceleration and resource sharing advantages provided by the FPGA can be utilized more often by the application. Logic flexibility and space savings on the chip comprising the coprocessor and processor are provided as well.

A Hidden Markov model is used to segment a data sequence. To reduce the potential for error that may result from the Markov assumption, the Viterbi dynamic programming algorithm is modified to apply a multiplicative factor if a particular set of states is re-entered. As a result, structural domain knowledge is incorporated into the algorithm by expanding the state space in the dynamic programming recurrence. In a specific example of segmenting resumes, the factor is used to reward or penalize (even require or prohibit) a segmentation of the resume that results in the re-entry into a section such as Experience or Contact Information. The method may be used to impose global constraints in the processing of an input sequence or to impose constraints to local sub-sequences.

Software that performs the following steps: (i) receiving a first set of observed data pertaining to healthcare events, the first set of observed data including a subset of patient care event data pertaining to patient care events and a subset of prescription data pertaining to prescription events; (ii) generating a graphical model representing a probabilistic relationship between the patient care event data and the prescription data, the graphical model including a set of latent variable(s) estimated from the first set of observed data using an expectation maximization method; (iii) receiving a second set of observed data pertaining to healthcare events associated with a healthcare provider; and (iv) computing, using a dynamic programming approach, a first prescription score for the healthcare provider relating to a computed probability under the generated graphical model of at least one prescription event of the second set of observed data.

A computer process, called VGRAM, improves the performance of these string search algorithms in computers by using a carefully chosen dictionary of variable-length grams based on their frequencies in the string collection. A dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance is disclosed. A method for automatically computing a dictionary of high-quality grams for a workload of queries. Improvement on query performance is achieved by these techniques by a cost-based quantitative approach to deciding good grams for approximate string queries. An approach for answering approximate queries efficiently based on discarding gram lists, and another is based on combining correlated lists. An indexing structure is reduced to a given amount of space, while retaining efficient query processing by using algorithms in a computer based on discarding gram lists and combining correlated lists.

A method / process for repeater insertion in the absence of timing constraints. Delays are optimized for multi-receiver and multi-layer nets and can be introduced in the early steps of design planning. It serves as a tool for interconnect prediction as well as planning. In the presented formulation, no restrictions are made on where the repeaters are added or what the topology of the net is. The tabulated results demonstrate improvement (speed ups) using the method / process of the present invention. The present invention runs in linear time and achieves better results that the existing dynamic programming formulation and other published heuristics. Polarity in a circuit design is corrected by traversing the circuit and carrying backwards a cost of fixing the polarity. On a subsequent traversal, buffers inserted fix the polarity.

Techniques for reducing the computational complexity of conventional similarity-based approaches for temporal event clustering of digital photograph collections include one or more approaches to select boundaries based on dynamic programming and the Bayes information criterion. Each method performs competitively with conventional approaches and offer significant computational savings.

The disclosure provides an approach for detecting and localizing action in video. In one embodiment, an action detection application receives training video sequences and associated eye gaze fixation data collected from a sample of human viewers. Using the training video sequences and eye gaze data, the action detection application learns a model which includes a latent regions potential term that measures the compatibility of latent spatio-temporal regions with the model, as well as a context potential term that accounts for contextual information that is not directly produced by the appearance and motion of the actor. The action detection application may train this model in, e.g., the latent structural SVM framework by minimizing a cost function which encodes the cost of an incorrect action label prediction and a mislocalization of the eye gaze. During training and therafter, inferences using the model may be made using an efficient dynamic programming algorithm.

A method and system are described for end-user transaction recognition based on server data such as sequences of remote procedure calls (RPCs). The method may comprise machine-learning techniques for pattern recognition such as Bayesian classification, feature extraction mechanisms, and a dynamic-programming approach to segmentation of RPC sequences. The method preferably combines information-theoretic and machine-learning approaches. The system preferably includes a learning engine and an operation engine. A learning engine may comprise a data preparation subsystem (feature extraction) and a Bayes Net learning subsystem (model construction). The operation engine may comprise transaction segmentation and transaction classification subsystems.

A detailed placement process which optimizes cell placement with up to one hundred percent densities in a linear run time. The output from a conjugate-gradient coarse placement process is input to the detailed placement process. A dynamic programming technique is used to optimize cell placement by swapping cells between two or more rows. The search space is pruned beforehand. A greedy cleanup phase using an incremental row placer is used. Thereby, the detailed placement process handles congestion driven placements characterized by non-uniform densities expeditiously and efficiently.

Before executing a search for optimal correspondence relationship with a coarse-to-fine DP (dynamic programming) algorithm using time information of peaks appearing in a chromatogram as input data, a simplified linear correction is executed based on detection of start point and end point of the section in which the peaks are present. It is sufficient to correct only nonlinear time deviations in coarse-to-fine DP, and the space to be searched is thus narrowed down. In addition, in coarse stage DP, the number of pieces of data to be processed is reduced by selecting peaks based on peak intensity. Between coarse stage DP and fine stage DP, local inappropriate matching is eliminated by performing filtering processing in accordance with trend of time deviations over the entire chromatogram. The space to be searched in fine stage DP becomes narrow, which reduces the number of candidates to be searched and shortens the calculation time.

An optical or digital code processing solution that identifies users and generates customized or programmable response actions based upon variables, profiles, histories, business models, and other criteria. An interactive solution that adds value to existing multi-dimensional optical and digital codes by creating targeted and customized responses. An interactive solution that enables a code capture to commence a chain of programmed responses involving single or multiple users. A code solution that integrates code readers and code generators onto a platform that can be dynamically programmed and updated to generate user specific and input specific responses. A solution that captures user information for tracking, marketing, and data base creation. A solution that integrates codes and responses with payment and financial processing functions.

The subject invention relates to systems and methods that enable dynamic programming and execution of an electronic communications dialog. In one aspect, a configurable messaging system is provided. The system includes a configuration file to describe interface options of a computerized dialog session, wherein the configuration file specifies interface activities and state transitions between the interface options within the configuration file. A state controller executes the interface options during communications activities with the dialog session. The configuration file can also describe prompt elements to solicit information from users or applications.

The invention relates to a video pre-fetching and cache replacement decision-making method for mobile perception in mobile edge calculation, designs a mobile perception utility function, and providesa novel trade-off method between a mobile edge data pre-fetching and cache replacement strategy. And not only is the allocation of edge server cache resources among different videos optimized, but also storage resources are allocated for different code rates of the same video. The invention proves that the proposed cache replacement problem is a knapsack constrained NP (NP-Hard) problem. In orderto solve the problem, the invention provides a mobile perception video prefetching cache and replacement (MAVPCR) algorithm, which is a dynamic programming (DP) algorithm. According to the invention,the trade-off of data prefetching and cache replacement strategies can be better realized. Experiments prove that the optimization problem is converted into integer linear programming with knapsack constraints, the hit rate can be increased, the cost is effectively controlled, and meanwhile, the video distortion rate is reduced.