Skip to main content

Engineering: General

Latest Innovations
Fast and Accurate Quantum Chemistry Simulations via Multiobjective Genetic Algorithms Embodiments of the present invention provide, among other things, methods, apparatus, and systems for tuning a semiempirical process for predicting energy... Read More Embodiments of the present invention provide, among other things, methods, apparatus, and systems for tuning a semiempirical process for predicting energy for different molecular configurations. In an example method, an energy value and an energy gradient are determined for each of a plurality of molecular configurations using an accurate method. A functional form of the semiempirical process is optimized using the determined energy values and energy gradients via multiobjective optimization. The functional form relates one or more parameters to energy values and energy gradients.
A Technique for Improving Performance by Preexecuting Instructions within a Simple Processor Pipeline A processor triggers a first advanced execution processing pass to an instruction sequence in response to a first stalled instruction and initiates... Read More A processor triggers a first advanced execution processing pass to an instruction sequence in response to a first stalled instruction and initiates execution of a further instruction in the instruction sequence that stalls during the performance of the first advanced execution processing pass. A second advanced execution pass is performed through the instruction sequence in which the further instruction is processed again to provide a valid result after stalling. In one form, the first instruction is performed while the processor operates in a normal execution mode and the first and second advanced execution processing passes are performed while the processor operates in an advance execution mode.
Adaptive Time Continuation in Competent Genetic and Evolutionary Algorithms Methods and systems for optimizing a solution set. A solution set is generated, and solutions in the solution set are evaluated. Desirable solutions from... Read More Methods and systems for optimizing a solution set. A solution set is generated, and solutions in the solution set are evaluated. Desirable solutions from the solution set are selected. A structural model is created using the desirable solutions, and a surrogate fitness model is created based on the structural model and the desirable solutions. A new solution set may be generated and/or evaluated, based on analyzing at least one of the structural model and the surrogate fitness model, and determining a method for generating a new solution set and/or evaluating the new solution set based at least in part on the analyzing.
A Symmetric Digital Chaotic Cryptosystem: The Alpcan Chaotic Cipher (ACC) A symmetric cryptosystem uses cascaded chaotic maps to encrypt plaintext and decrypt ciphertext. Received plaintext is encrypted using the cascaded chaotic... Read More A symmetric cryptosystem uses cascaded chaotic maps to encrypt plaintext and decrypt ciphertext. Received plaintext is encrypted using the cascaded chaotic maps to generate a ciphertext. The ciphertext can then be decrypted using the same cascaded chaotic maps in order to retrieve the plaintext.
iWatcher: Simple and General Architectural Support for Software Debugging Methods and systems for memory monitoring. A triggering access is detected at one or more monitored memory regions. When a triggering access is detected, a... Read More Methods and systems for memory monitoring. A triggering access is detected at one or more monitored memory regions. When a triggering access is detected, a function is accessed for determining a monitoring function, and a monitoring function associated with a particular triggered memory location address is automatically determined.
A Method for Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax A computer program product being embodied on a computer readable medium for extracting semantic information about a plurality of documents being accessible... Read More A computer program product being embodied on a computer readable medium for extracting semantic information about a plurality of documents being accessible via a computer network, the computer program product including computer-executable instructions for: generating a plurality of tokens from at least one of the documents, each token being indicative of a displayed item and a corresponding position; and, constructing at least one parse tree indicative of a semantic structure of the at least one document from the tokens dependently upon a grammar being indicative of presentation conventions.
Intelligent Knowledge Analysis, Synthesis, Management, Acquisition, and Actioning System in the Context of VIAS Under CMS A method and system for augmenting a corpus with documents on concepts not sufficiently covered within the corpus is provided. The augmentation system... Read More A method and system for augmenting a corpus with documents on concepts not sufficiently covered within the corpus is provided. The augmentation system generates a corpus concept graph from the documents of a corpus. A corpus concept graph represents concepts of the documents as nodes and related concepts as links between nodes. To generate a corpus concept graph, the augmentation system identifies the concepts that are related within each document of the corpus and adds nodes and links to the corpus concept graph for related concepts. The augmentation system analyzes the corpus concept graph to determine whether the relatedness of concepts of the documents of the corpus is sufficient. If the relatedness of a pair of concepts is not sufficient, then the augmentation system attempts to identify documents not already in the corpus that are related to the concepts that are not sufficiently related.
Scalable System Software for a Gigabit Active Router In the present scalable system routing method, received packets are associating with threads for processing the received packets. While a previously... Read More In the present scalable system routing method, received packets are associating with threads for processing the received packets. While a previously received packet is being processed, arrival of an interrupt is checked. If there is an interrupt, a thread is created associating the interrupt is created. Then, a determination of whether the thread associated with the interrupt has a priority that is higher than the priority of a thread associated with the previously received packet is made. If the thread associated with the interrupt has a higher priority than the previously received packet, the thread associated with the previously received packet is saved in a Shared Arena storage area. However, if the thread associated with the interrupt does not have a higher priority than the previously received packet, the thread associated with the interrupt is queued. Because threads are attached to the packets, the threads can now be suspended and resumed without having to disable interrupts, which includes periods during a context switch. As a result, a more flexible and efficient scheduling routing method can be implemented.
Video Compression Algorithm For transmitting digital video information over a network such as the Internet, a hybrid coding scheme (FIGS. 9-18) with wavelet I frame coding and H.263... Read More For transmitting digital video information over a network such as the Internet, a hybrid coding scheme (FIGS. 9-18) with wavelet I frame coding and H.263 predictive coding produces a robust, low bit rate video coding scheme. A new packetization method analyzes macroblock level dependency structure (FIG. 19) and packetizes the bit stream so as to minimize dependencies between packets and thereby minimize packet loss damage.
Fair Scheduling and Medium Access in Wireless Packet Networks A wireless shared channel network packet communication method emulates fluid flow fair scheduling. Errors inherent in wireless communication and... Read More A wireless shared channel network packet communication method emulates fluid flow fair scheduling. Errors inherent in wireless communication and unaccounted for in fair scheduling for wired networks are accounted for according to the method. Lagging communication flows, typically caused by burst errors in wireless communication systems, make up for their lag by causing leading flows to give up their lead. The method is independent of the pattern of channel error. In a preferred embodiment, lag compensation is accounted for by a service tag which identifies a precedence for contention based upon the previous denial of access for channel error. This precedence allows compensation when channels become error free. A modified preferred embodiment first attempts intraframe compensation by swapping slots when a host predicts an error for its assigned slot and another host assigned a later slot is able to transmit in the slot. Interframe compensation, when needed, is accomplished preferably by a round robin contention among backlogged flows. Errors are predicted by hosts for a subsequent slot when activity is sensed in a current slot but no good packet is received. Preferred packet structures include data and control slots, with data slots partitioned to provide necessary error status and backlog information piggybacked with data so a base has sufficient information to implement compensation in contention resolution.

Pages