Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

920results about How to "Reduced execution time" patented technology

Precalculated caller-agent pairs for a call center routing system

Systems and methods are disclosed for preprocessing caller-agent pairs in a contact routing center, along with an intelligent routing system. A method includes determining at least one agent data for each agent of a set of agents, determining at least one caller data for each caller of a set of callers, and determining a score for each possible caller-agent pair of the set of agents and the set of callers using the agent data and the caller data in a pattern matching algorithm. The scores for each possible caller-agent pair may then be stored, e.g., in a look-up table, for retrieval, where matching a caller of the set of callers to an agent of the set of agents is based on the previously determined or calculated scores. For example, the caller-agent pair having the best score of all potential caller-agent pairs may be connected.
Owner:AFINITI LTD

Preprocessor to improve the performance of message-passing-based parallel programs on virtualized multi-core processors

Provided is a complier which optimizes parallel processing. The complier records the number of execution cores, which is the number of processor cores that execute a target program. First, the compiler detects a dominant path, which is a candidate of an execution path to be consecutively executed by a single processor core, from a target program. Subsequently, the compiler selects dominant paths with the number not larger than the number of execution cores, and generates clusters of tasks to be executed by a multi-core processor in parallel or consecutively. After that, the compiler computes an execution time for which each of the generated clusters is executed by the processor cores with the number equal to one or each of a plurality natural numbers selected from the natural numbers not larger than the number of execution cores. Then, the compiler selects the number of processor cores to be assigned for execution of each of the clusters based on the computed execution time.
Owner:IBM CORP

Automated palletizing cases having mixed sizes and shapes

A method for stacking cases on a pallet includes supplying cases to a buffer, determining physical characteristics of buffer cases including dimensions of a case base and case height, and determining available positions on the pallet where a buffer case can be placed. Rules for selecting a case from the buffer for placement on the pallet are applied to at least a portion of the buffer cases to identify a selected buffer case that satisfies at least one of the rules and a corresponding place on the pallet for the selected case. Then the selected case is removed from the buffer and placed on the pallet in the corresponding place by an industrial robot.
Owner:FANUC ROBOTICS AMERCA

Virtual machine data replication

Disclosed is a method and system for selectively restoring file-level data from a disk image backup. In embodiments, a virtual machine backup may be performed by dividing a virtual machine virtual disk file into a plurality of discrete fixed-sized data blocks sharing a common index file that is stored on a backup medium, such as a hard drive, to form a backup set. Upon restoration of data from the backup set, individual blocks of the data set are compared to corresponding blocks of the target virtual machine file. Redundant data and unchanged blocks are skipped, and only those block which have changed are restored to the target file. In this manner network bandwidth and processor resources are conserved, and replication times decreased.
Owner:UNITRENDS

Transiently dynamic flow cytometer analysis system

A flow cytometry apparatus and methods to process information incident to particles or cells entrained in a sheath fluid stream allowing assessment, differentiation, assignment, and separation of such particles or cells even at high rates of speed. A first signal processor individually or in combination with at least one additional signal processor for applying compensation transformation on data from a signal. Compensation transformation can involve complex operations on data from at least one signal to compensate for one or numerous operating parameters. Compensated parameters can be returned to the first signal processor for provide information upon which to define and differentiate particles from one another.
Owner:BECKMAN COULTER INC

Method and system for allocation of special purpose computing resources in a multiprocessor system

A method and system for allocating special-purpose computing resources in a multiprocessor system capable of executing a plurality of threads in a parallel manner is disclosed. A thread requesting the execution of a specific program is allocated a special-purpose processor with the requested program loaded on its local program store. The programs in the local stores of the special-purpose processors can be evicted and replaced by the requested programs, if no compatible processor is available to complete a request. The thread relinquishes the control of the allocated processor once the requested process is executed. When no free processors are available, the pending threads are blocked and added to a request-queue. As soon as a processor becomes free, it is allocated to one of the pending threads in a first-in-first-out manner, with special priority given to a thread requesting a program already loaded on the processor.
Owner:CODITO TECH

Method and arrangement for handover in a radio access network

An object of the present invention is to provide a mechanism for handling a handover in a more efficient way. The invention relates to a method in a mobility controller (180) in a radio access network for preparing a handover. The method comprises the following steps to be taken during data transmission between a mobile terminal (140) and a source base station (120), before the handover: Sending a request to a candidate base station (122), which request aims at measuring and reporting timing alignment to be used by the mobile terminal (140) when communicating with the destination base station (122) after the handover, if the candidate base station becomes the destination base station (122) after the handover; receiving a report from the destination base station (122) comprising said requested timing alignment; and when the destination base station (122) is selected among the at least one candidate base stations, sending a message to the mobile terminal (140) to use said timing alignment received from the destination base station (122) when communicating with the destination base station (122) after the handover.
Owner:TELEFON AB LM ERICSSON (PUBL)

Method and system for automated generation of customized factory installable software

An automated system for software installation in a build-to-order information handling system. In one embodiment of the invention, a plurality of software applications are received and are disassembled to separate the individual constituent program files. These program files are decompressed and are stored in temporary file directories. Program files that are common to each of the software applications are identified and indexed. After the file analysis, the files are regrouped and a stored as a new set of compressed files. Once the new set of compressed files has been created, the top level scripts for the software application images are updated for use with the new compressed files to allow the desired combinations of software applications to be regenerated. The regenerated compressed files are then loaded into the factory servers for use in manufacturing information handling systems.
Owner:DELL PROD LP

MemX: virtualization of cluster-wide memory

MemX provides a distributed system that virtualizes cluster-wide memory to support data-intensive and large memory workloads in virtual machines (VMs), and provides benefits in virtualized settings: (1) VM workloads that access large datasets can perform low-latency I / O over virtualized cluster-wide memory; (2) VMs can transparently execute very large memory applications that require more memory than physical DRAM present in the host machine; (3) reduces the effective memory usage of the cluster by de-duplicating pages that have identical content; (4) existing applications do not require any modifications to benefit from MemX such as the use of special APIs, libraries, recompilation, or relinking; and (5) supports live migration of large-footprint VMs by eliminating the need to migrate part of their memory footprint resident on other nodes. Detailed evaluations show that large dataset applications and multiple concurrent VMs achieve significant performance improvements using MemX compared against virtualized local and iSCSI disks.
Owner:THE RES FOUND OF STATE UNIV OF NEW YORK

Method for synchronizing multiple heterogeneous source databases based on log

The invention discloses a method for synchronizing multiple heterogeneous source databases based on log. The method comprises the following steps of: 1) reading source data, extracting operation on a source database according to a log file of the source database at the source database end, and reversely generating an SQL (structured query language) execution script of data operation; 2) transferring the SQL script; 3) processing data conflict; and 4) writing target data. The method disclosed by the invention is used for realizing data synchronization between multiple heterogeneous source databases and a target database, can overcome the obstacle caused by heterogeneous databases, and does not bring any influence on the performance and structure of the source databases.
Owner:苏州博远容天信息科技股份有限公司

Method and system for automatically distributing wireless communication channels

The invention discloses a method and a system for automatically distributing wireless communication channels. The method comprises the following steps of: periodically measuring the channel condition of each effective channel corresponding to an AP (Access Point) to obtain channel measurement sample values of each effective channel; updating a channel quality evaluation sheet corresponding to each effective channel by adopting the channel measurement sample values in a plurality of measurement periods; monitoring a trigger signal, wherein the trigger signal comprises a periodical judgment request; and judging whether channel selection is required again according to the channel quality evaluation sheet corresponding to the current work channel of the AP when the judgment request is monitored; if so, selecting a target channel according to the channel measurement sample values of each effective channel; and switching the current work channel of the AP to the target channel. The method and the system can effectively improve the accuracy of channel quality judgment and shorten the execution time of channel distribution, so that the time validity is improved.
Owner:COMBA TELECOM SYST CHINA LTD

Massively computational parallizable optimization management system and method

A distributed processing system, program product and method of executing a computer program distributed across a plurality of computers. First, interested participants register and provide a commitment for available excess computer capacity. Participants may enter a number of available hours and machine characteristics. A normalized capacity may be derived from the machine characteristics and a normalized excess capacity may be derived from the number of hours committed for the participant. New registrants may be assigned benchmark tasks to indicate likely performance. Parties may purchase capacity for executing large computer programs and searches. The computer program is partitioned into multiple independent tasks of approximately equal size and the tasks are distributed to participants according to available excess capacity. A determination is made whether each distributed task will execute within a selected range of other distributed tasks and, if not, tasks may be reassigned. The likelihood that a task will complete may be based on the participant's past performance. As each task is completed, the completing participant is checked to determine if the task is on schedule. Any task assigned to computers that are found to be behind schedule may be reassigned to other participants. A check is made to determined whether each task is assigned to at least one participant and several tasks may be assigned to multiple participants. Once all tasks are complete, the best result is selected for each task. Each participant may be compensated for normalized excess capacity and that compensation and charges to requesting parties may be based on total available normalized capacity.
Owner:TWITTER INC

Data backup method of distributed file system

The invention provides a data backup method of a distributed file system. The method includes: setting up a thread pool by a synchronous control node, distributing source files to each thread according to a copy list, and parallelly conducting metadata synchronization of each source file and the corresponding target file; judging content consistency of each file block in the source files and the target files by each thread of the synchronous control node to analyze difference between each distributed source file and the corresponding target file; judging content consistency of each chunk in the source files and the target files by a source data node to analyze difference between the source file blocks and the target file blocks; duplicating data of the source file blocks to the corresponding target file blocks by a target data node according to the difference analyzing results of the source file blocks and the target file blocks. Data transmission among trans-cluster data nodes can be reduced by effectively using existing data of the target files of a target file system, and data backup execution time is shortened since file backup is completed by taking a file block as a unit.
Owner:清能艾科(深圳)能源技术有限公司

Multiple inspection robot cooperative operation method for substation sequence control system

ActiveCN102566576AShort driving routeIn place detection time is fastPosition/course control in two dimensionsSequence controlLoop control
The invention discloses a multiple inspection robot cooperative operation method for a substation sequence control system. When the closed-loop control and the state visualization of the intelligent substation sequence control system are implemented, the executing and checking time of the sequence control system can be effectively saved by adopting the method. The invention provides the multiple inspection robot cooperative operation method which comprises the following steps: modeling by adopting a topological method on the basis of the substation environment, forming a topological network chart and a communication relation matrix according to walking routes of inspection robots, and carrying out search and traversal of paths to output a discharge matrix and a shortest path matrix; in the single-step sequence control process, determining a shortest communication path sequence of each inspection robot from a current position to a target point according to the distance matrix and the shortest path matrix; carrying out excellence selection of single-step sequence control, i.e. selecting the inspection robot with the optimal performance under the condition of considering comprehensive indexes of journey, time, safety and maneuverability; determining an operation path sequence of each inspection robot and a corresponding activation event; and carrying out on-line monitoring, wherein if the environment is changed, the on-line monitoring takes charge of debugging and recovering operation.
Owner:STATE GRID INTELLIGENCE TECH CO LTD

Copy planning in a concurrent garbage collector

A garbage collector is disclosed that permits extensive separation of mutators and the garbage collector from a synchronization perspective. This relative decoupling of mutator and collector operation allows the garbage collector to perform relatively time-intensive operations during garbage collection without substantially slowing down mutators. The present invention makes use of this flexibility by first conservatively determining which objects in a set of regions of interest are live, then planning where to copy the objects (preferably including clustering), and finally performing the actual copying.
Owner:CLAUSAL COMPUTING

Source adaptive system and method for 2D iDCT

This invention discloses a fast two-dimensional inverse Discrete Cosine Transform (iDCT) that adapts to compressed video source statistics to reduce execution time. iDCT algorithms for sparse blocks eliminate calculations for some zero coefficients and are implemented with quad-word parallel single-instruction-multiple-data (SIMD) multimedia instructions. It is observed that end-of-block marker value histograms vary little within single shots. An adaptive control mechanism is proposed that selects the optimal set of iDCTs to prepare for an entire shot from its first frames (to reduce software overheads and penalties). This introduces no degradation of decoded video quality as compared with a conventional SIMD 8×8 iDCT implemented with Intel MMX instructions.
Owner:CISCO SYST CANADA

Distributed Multi-Core Memory Initialization

In a system having a plurality of processing nodes, a control node divides a task into a plurality of sub-tasks, and assigns the sub-tasks to one or more additional processing nodes which execute the assigned sub-tasks and return the results to the control node, thereby enabling a plurality of processing nodes to efficiently and quickly perform memory initialization and test of all assigned sub-tasks.
Owner:ADVANCED MICRO DEVICES INC

SQL (structured query language) query plan generation method oriented to streaming data processing

The invention provides an SQL(structured query language) query plan generation method oriented to streaming data processing, which is characterized by including the following steps of receiving SQL commands input by users; judging whether grammars of the SQL commands are correct or wrong; preprocessing the SQL commands if the grammars of the SQL commands are correct; switching the continuous duty to the streaming duty, analyzing and optimizing the streaming duty to generate query plans if the SQL commands indicate the continuous duty; and finally (7) carrying out the query plans. The SQL query plan generation method oriented to streaming data processing is capable of generating the optimum SQL query analysis plans according to characteristics of data, is high in processing speed and analysis efficiency and particularly suitable for the field of streaming data processing, while users are allowed to use user-defining SQL data format.
Owner:HUAZHONG UNIV OF SCI & TECH

Apparatus and method for switchable conditional execution in a VLIW processor

An apparatus for switchable conditional execution in a VLIW processor is provided, comprising one or more decoders, one or more ALU with control units, and a register file. The decoders loads and decodes said instructions from a fetch unit for decoding and sending the decoded instructions to the ALU with control units for execution. The register file stores and forwards the results on result buses to the decoders. The execution of a VLIW instruction includes a fetch stage, a decode stage, plural execution stages and a write-back stage. The invention has the features of approximate ASIC timing by conditional write-back with the compiler support for the conditional write-back, condition resolved just before write-back., software selective conditional issue and conditional write-back modes, and without hardware interlock / dependence checking for the VLIW processor.
Owner:IND TECH RES INST

System, program product, and methods to enable visual recording and editing of test automation scenarios for web application

Systems to provide automated testing of a markup software application, program product, and methods are provided. An example of a system can include a network, at least one computer including memory and a processor, and application testing program product stored in the memory of the at least one computer. The application testing program product can include instructions that when executed by the processor of the respective computer causes the respective computer to perform various operations to include receiving a user selection identifying a target element of an application; determining a command describing an action being performed; identifying a translator responsive to a captured command; and generating at least one of the following: an abstract script describing the action being performed by the target element, a context-sensitive verification available for the target element, or a context sensitive synchronization available for the target element.
Owner:PROGRESS SOFTWARE

Distributed control system and information processing system

In a real-time distributed control system in which a plurality of network controllers are connected, a middleware module in each control unit executes starting of application modules and calling RT communication processing according to starting order information in application configuration information. RT communication service sends and receives messages between the application modules corresponding to the calling. The application configuration information and the messages are generated by an information processor based on user defined information, and transmitted to each of the units. A network driver executes network communication using a network controller which stores sending and receiving messages. A network driver priority manager determines priority of processing of the network driver corresponding to priorities of sent and received messages, and a scheduler executes processing of the network driver according to the priority of the processing of the network driver.
Owner:HITACHI LTD

Optimized distinct count query system and method

The present invention relates to a system and method of optimizing execution of a distinct count query. The system and method allows clients or database administrators to improve queries by properly designing data cubes and partitions of the data in the cube. The partition data can also be ordered so as to facilitate determining the range of each partition. Partitions with overlapping ranges can be executed in parallel. Furthermore, partitions with non-overlapping ranges can also be executed in parallel to optimize query execution rather than digressing from parallel to sequential execution by virtue of their range.
Owner:MICROSOFT TECH LICENSING LLC

System and method for content based social recommendations and monetization thereof

Disclosed is a system and method for automatically detecting social relationships from consumer image collections. The disclosed systems and methods provide the ability to infer relationships between people thereby creating dynamic social networks from the occurrences of people appearing in digital images. Occurrences of people in pictures can be detected based on known or to be known facial recognition technology. These inferences enable relationship determinations regarding whether the people are family members, friends, acquaintances or merely strangers who happen to be in the same place at the same time. The disclosed detection of such relationships enables the building of intelligent image management systems. Furthermore, based on the detected social relationships, advertisements can be served not solely to a single person, but to multiple people within the scope of the social relationship
Owner:YAHOO INC

Method and apparatus for optimizing execution of database queries containing user-defined functions

A query engine (or optimizer) which supports database queries having user-defined functions maintains historical execution data with respect to each of multiple user-defined functions. The historical execution data is dynamically updated based on query execution performance. When executing a query having user-defined functions, the query engine uses the historical execution data to predict an optimal evaluation ordering for the query conditions and, preferably, to dynamically adjust the evaluation order when appropriate. Preferably, the historical execution data includes historical execution time of the user-defined function and proportion of evaluated records which satisfied the query parameters.
Owner:IBM CORP

Resource access method and URG

The invention provides a resource access method and a URG. The method comprises the steps that the URG receives a resource request sent by a client end, wherein the resource request comprises one or more resource IDs, and each resource ID corresponds to one resource; the URG conducts permission validation on the client end; the URG generates one or more single resource requests corresponding to one or more resource servers based on the one or more resource IDs after verification is passed; each single resource request comprises an access token corresponding to the requested resource, and the access tokens represent that a resource owner allows the URG to access the resources; the URG sends one or more single resource requests to the one or more resource servers respectively; the URG receives one or more responding messages of the one or more single resource request from the corresponding resource server, and the one or more responding messages carry the resources corresponding to the one or more single resource requests; the URG sends the resources to the client end.
Owner:HUAWEI TECH CO LTD

Authentication system executing an elliptic curve digital signature cryptographic process

An authentication system and a method for signing data are disclosed. The system uses a hardware software partitioned approach. In its implementation the system of the invention compares favourably with performance and other parameters with a complete hardware or full software implementation. Particularly, advantageously there is a reduced gate count. Also as disclosed in the invention the system makes it difficult for hackers to attack the system using simple power analysis.
Owner:TATA CONSULTANCY SERVICES LTD

Pipelined parallelization with localized self-helper threading

A system and method for automatically parallelizing a computer program for multi-threaded execution. A compiler identifies and parallelizes non-DOALL parallel regions, such as loops, within a computer program. The compiler determines enhanced helper thread instructions based upon the main body instructions of the non-DOALL region. These helper thread instructions are inserted ahead of the main body instructions within each of the plurality of threads, rather than within a single main thread. Next, synchronization instructions are inserted in one or more threads such that the main body of work of each thread is performed in a pipelined manner. The helper thread instructions within each thread may reduce the total execution time of each thread.
Owner:ORACLE INT CORP

Method and system for automatically generating unit test case of reproduced operation problem

The method comprises: modifying the computer program according to running problem capable of happening in the one or more target program units concerned by the computer program; testing and executing the modified program; according to the running problem occurring in the execution of the target program unit, automatically generating a unit test case. Said modification step comprises: adding a capture code and problem code into the program; the capture code is used for recording the execution path and the execution context of the target problem unit; said problem code is used for detecting the running problem in the process of executing said target program unit. The invention also provides a method and a system which uses said method and system to make debugging and regression testing.
Owner:INT BUSINESS MASCH CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products