4032 results about "Slide window" patented technology

An adaptation to Carrier Interferometry synthesis and analysis provides for complex coding and decoding in a sliding window transform. Coding and decoding functionality can be extended to spatial processing in systems employing multiple transceiver elements. Poly-amplitude codes permit successive interference cancellation in spatial and frequency-domain processing. Handoffs in cellular systems are facilitated by selecting spectral/base station combinations that optimize link performance.

Presented are systems and methods that provide a unified end-to-end detection pipeline for object detection that achieves impressive performance in detecting very small and highly overlapped objects in face and car images. Various embodiments of the present disclosure provide for an accurate and efficient one-stage FCN-based object detector that may be optimized end-to-end during training. Certain embodiments train the object detector on a single scale using jitter-augmentation integrated landmark localization information through joint multi-task learning to improve the performance and accuracy of end-to-end object detection. Various embodiments apply hard negative mining techniques during training to bootstrap detection performance. The presented are systems and methods are highly suitable for situations where region proposal generation methods may fail, and they outperform many existing sliding window fashion FCN detection frameworks when detecting objects at small scales and under heavy occlusion conditions.

A system (10) for pedestrian use includes an accelerometer (110) having multiple electronic sensors; an electronic circuit (100) operable to generate a signal stream representing magnitude of overall acceleration sensed by the accelerometer (110), and to electronically correlate a sliding window (520) of the signal stream with itself to produce peaks at least some of which represent walking steps, and further operable to electronically execute a periodicity check (540) to compare different step periods for similarity, and if sufficiently similar then to update (560) a portion of the circuit substantially representing a walking-step count; and an electronic display (190) responsive to the electronic circuit (100) to display information at least in part based on the step count. Other systems, electronic circuits and processes are disclosed.

Methods of imaging objects based on wavelet retrieval of scenes utilize wavelet transformation of plural defined regions of a query image. By increasing the granularity of the query image to greater than one region, accurate feature vectors are obtained that allow for robust extraction of corresponding regions from a database of target images. The methods further include the use of sliding windows to decompose the query and target images into regions, and the clustering of the regions utilizing a novel similarity metric that ensures robust image matching in low response times.

Improving the utilization of physical resources and reducing energy consumption in a cloud data center includes providing a plurality of virtual machines in the cloud data center; periodically reallocating resources of the plurality of virtual machines according to a current resource demand of the plurality of virtual machines in order to minimize a number of active physical servers required to handle a workload of the physical servers; maximizing a mean inter-migration time between virtual machine migrations under the quality of service requirement based on a Markov chain model; and using a multisize sliding window workload estimation process for a non-stationary workload to maximize the mean inter-migration time.

Methods and systems are provided for sequence number checking. Sequence numbers of data packets are compared to a “sliding” window. The sliding window indicates a range of sequence numbers considered valid (or invalid). The size of the sliding window may be a particular value or varied. If a sequence number is “below” the sliding window, then it may be considered invalid. If a sequence number is within the sliding window, then it may be further checked to determine if a duplicate sequence number has been received. If a sequence number is “above” the sliding window, then it may be considered valid and the sliding window is advanced. The sliding window and sequence numbers are processed using multiple level bitmaps, which indicate a historical state of sequence numbers received. Furthermore, the multiple level bitmaps may comprise summary bits to summarize a state of subsequent bits.

A system and method summarizes multimedia stored in a compressed multimedia file partitioned into a sequence of segments, where the content of the multimedia is, for example, video signals, audio signals, text, and binary data. An associated metadata file includes index information and an importance level for each segment. The importance information is continuous over as closed interval. An importance level threshold is selected in the closed interval, and only segments of the multimedia having a particular importance level greater than the importance level threshold are reproduced. The importance level can also be determined for fixed-length windows of multiple segments, or a sliding window. Furthermore, the importance level can be weighted by a factor, such as the audio volume.

Apparatuses and methods are provided for determining real time traffic conditions. A candidate road is divided into road segments by perpendicular bisectors. A spatial sliding window is positioned over at least a portion of a road segment, wherein the spatial sliding window corresponds to a front end of the road segment in a direction of travel of the road segment. Real time probe data is received from mobile devices in probe vehicles or on travelers of the at least portion of the road segment within the spatial sliding window. The real time probe data is analyzed, and a computer program assists in determining the real time traffic conditions of the at least portion of the road segment within the spatial sliding window. Based on the analysis, the real time traffic conditions are reported.

A method of rate control using a picture-based lookahead sliding window in a dual-pass transcoder/encoder compressed video architecture extracts statistics from an input video signal according to a simple compression standard, the input video signal being a compressed video signal for transcoding or an uncompressed video signal for encoding. A trans-factor is calculated for a current picture based on previous pictures in a sliding window to predict the complexity of the current picture, the trans-factor being a ratio of global complexity measures for the simple compression standard versus a sophisticated compression standard. Bits for the current picture are then allocated based on the complexity of future pictures in the sliding window. After encoding the current picture according to the sophisticated compression standard, the target bits of and the picture complexity in the sliding window, as well as the trans-factor, are updated as the window is moved by one picture. The extraction of the statistics is achieved in a transcoder by using a simple compression standard decoder to produce the statistics from the compressed video signal as the input video signal, and in an encoder by using a simple compression encoder to generate the statistics from the uncompressed video signal as the input video signal.

Computer implemented method, system and computer usable program code for detecting topic shift boundaries in a multimedia stream. A computer implemented method for detecting topic shift boundaries in a multimedia stream includes receiving a multimedia stream, and performing multimodal analysis on the multimedia stream to locate a plurality of temporal positions within the multimedia stream at which topic changes have an increased likelihood of occurring to provide a sequence of multimedia portions. Characteristics for a sliding window for each multimedia portion in the sequence of multimedia portions are automatically determined, and topic shift boundaries are detected in each multimedia portion by applying a text-based topic shift detector over the media stream's text transcript using a sliding window, wherein the sliding window used with each multimedia portion has the characteristics determined from its respective multimedia portion.

A just-in-time (JIT) compiler typically generates code from bytecodes that have a sequence of assembly instructions forming a "template". It has been discovered that a just-in-time (JIT) compiler generates a small number, approximately 2.3, assembly instructions per bytecode. It has also been discovered that, within a template, the assembly instructions are almost always dependent on the next assembly instruction. The absence of a dependence between instructions of different templates is exploited to increase the size of issue groups using scheduling. A fast method for scheduling program instructions is useful in just-in-time (JIT) compilers. Scheduling of instructions is generally useful for just-in-time (JIT) compilers that are targeted to in-order superscalar processors because the code generated by the JIT compilers is often sequential in nature. The disclosed fast scheduling method has a complexity, and therefore an execution time, that is proportional to the number of instructions in an instruction block (N complexity), a substantial improvement in comparison to the N2 complexity of conventional compiler schedulers. The described fast scheduler advantageously reorders instructions with a single pass, or few passes, through a basic instruction block while a conventional compiler scheduler such as the DAG scheduler must iterate over an instruction basic block many times. A fast scheduler operates using an analysis of a sliding window of three instructions, applying two rules within the three instruction window to determine when to reorder instructions. The analysis includes acquiring the opcodes and operands of each instruction in the three instruction window, and determining register usage and definition of the operands of each instruction with respect to the other instructions within the window. The rules are applied to determine ordering of the instructions within the window.

A method detects events in multimedia. Features are extracted from the multimedia. The features are sampled using a sliding window to obtain samples. A context model is constructed for each sample. The context models form a time series. An affinity matrix is determined from the time series models and a commutative distance metric between each pair of context models. A second generalized eigenvector is determined for the affinity matrix, and the samples are then clustered into events according to the second generalized eigenvector.

The invention relates to a condition monitoring data stream anomaly detection method, in particular to a condition monitoring data stream anomaly detection method based on an improved gaussian process regression model. The problem that an existing method for processing monitoring data stream anomaly detection is poor in effect is solved. The method comprises the steps that firstly, the historical data sliding window size is determined; secondly, the types of a mean value function and a covariance function are determined; thirdly, the hyper-parameter initial value is set to be the random number from 0 to 1; fourthly, q data closest to the current time t are extracted; fifthly, the gaussian process regression model is determined; sixthly, prediction is conducted by means of the nature of the gaussian process regression model; seventhly, PI of normal data at the time t+1; eighthly, monitoring data are compared with the PI; ninthly, whether the real monitoring data need to be marked to be abnormal or not is judged; tenthly, beta (xt+1) corresponding to the monitoring value at the time t+1 is calculated; eleventhly, the real value or prediction value and the t+1 are added into DT; twelfthly, new DT is created. The condition monitoring data stream anomaly detection method based on the improved gaussian process regression model is applied in the field of network communication.

A sliding window of flash blocks is used to reduce wasted space occupied by stale data in a flash memory. The sliding window slides downward over a few flash blocks. The oldest block is examined for valid pages of data, and the valid pages are copied to the end of the sliding window so that the first block has only stale pages. The first block can then be erased and eventually re-used. A RAM usage table contains valid bits for pages in each block in the sliding window. A page's valid bit is changed from an erased, unwritten state to a valid state when data is written to the page. Later, when new host data replaces that data, the old page's valid bit is set to the stale state. A RAM stale-flags table keeps track of pages that are full of stale pages.

Methods directed to longest prefix matching and systems directed to IP address lookups are presented. The methods and systems relate in particular to IPv6 and comprise finding the longest prefix match (LPM) for an IP address. The method of the invention results in the use of filters to perform LPM. In embodiments of the invention, partial address filtering is used to further reduce filtering requirements. Reducing the number of filtering operations has the advantage of making the LPM algorithm faster and less costly to implement than prior art approaches. Also described is an “ideal offset filter” that extracts a fixed sized sliding window of bits from the IP address being processed.

The invention provides a human body behavior identification method based on an inertial sensor. The method comprises the steps of acquiring human body behavior data of testees by means of the inertial sensor, conducting sliding window segmentation on the acquired human body behavior data, conducting feature extraction on a triaxial accelerated speed subsequence and a triaxial angular speed subsequence which are obtained after sliding window segmentation, conducting feature fusion on a feature vector to form a sample set of the human body behaviors of the testees, conducting feature selection on the sample set by means of the least correlated maximum redundant algorithm and the Bayes regularization sparse polynomial logistic regression algorithm, obtaining the classification feature vectors of all human body behaviors of all the testees, obtaining a classifier model of each human body behavior by means of a fuzzy least square support vector machine, and obtaining a human body behavior identification result after the human body behavior data are tested by means of the fuzzy least square support vector machine. By means of the human body behavior identification method, self-adaptation and identification efficiency can be improved.

Included in the invention are systems and methods of full time recording network traffic to a hierarchical data storage. Also included in the invention are systems and methods of retrieval of recorded network traffic from a hierarchically organized network data repository. Additionally included in the invention are systems and methods of efficiently filtering data in a hierarchically organized network data repository. Systems and methods of displaying recorded network data utilizing the retrieval systems are also included in the invention. Further included in the invention are systems and methods of providing sliding time window selection user interfaces. Detailed information on various example embodiments of the inventions are provided in the Detailed Description below, and the inventions are defined by the appended claims.

The invention discloses an accompanying robot path planning method and system based on obstacle virtual expansion. The method includes a step of constructing an environment map, namely a step of constructing a two-dimensional occupancy grid map according to an actual scene, with each grid being labeled as an obstacle zone or a walkable zone; a step of setting initial coordinate positions of an accompanying robot and a movable target in the grid map; a step of constructing a sliding window for the robot; a step of subjecting the obstacle zones to expansion processing, namely a step of performing initial expansion on grids where an obstacle is according to a shortest distance between the center of the robot and a body edge, determining the number of grid layers expanded on the basis of the minimum impassable zone, adopting the grids in the expanded zones as obstacle virtual expansion grids, and labeling the grade of danger of obstacle influences on the obstacle virtual expansion grids; and a step of planning a path for the accompanying robot based on an A* algorithm and an incremental path planning process. Incremental path updating is performed by adopting a path of the last moment,thus saving path planning time and increasing the response speed of the accompanying robot.

A log file processing system sorts records from large log files and groups them by session without making a complete copy of the log files by capturing a subset of the log files in a sliding memory window and identifying all records in the window that form a complete user session. Records belonging to a complete session are output for analyzing, and the remaining records are output as raw log data for additional processing. Using a ring buffer to implement the sliding memory window, data structures are used to group records by session, to identify completed sessions, and to index into the ring buffer to retrieve records for completed sessions that are to be directly analyzed. Any records remaining in the ring buffer at the end of slide window processing may be output as raw log file data and are processed as incomplete or malformed session records. An embodiment of the log file processing system provides a significant improvement on the speed of data extraction from log files into analyzable session data.

The invention provides a massive structured data storage method, a massive structured data query method, a massive structured data storage system and a massive structured data query system, which all support high-speed loading. The distributed storage method for massive structured data comprises the following steps of: receiving the data which is loaded at high speed from a user; and caching the loaded data in a distributed way by utilizing a double-sliding window structure, and storing the cached data in the distributed way after a fixed period. By the distributed storage method for the massive structured data, newly-loaded data can be cached, so that the query efficiency of application such as streaming data which frequently uses recently-loaded data in post data query can be improved.

The invention discloses a monocular vision SLAM algorithm based on a semi-direct method and sliding window optimization. The monocular vision SLAM algorithm comprises the steps that 1) color image frames acquired by a monocular color camera are uploaded to a computer through a third-party image acquisition interface; 2) the algorithm initialization process is performed, the camera pose transformation relationship between the two initial frames is established, initial map points are established, the two initial frames act as key frames and the initial map points are inserted in the map and thesliding window; and 3) the map points observed in the previous frame are projected to the current frame, and bundle set optimization computation based on the luminosity error is performed between thetwo frames of images so as to obtain the camera pose transformation between the two frames to track the movement of the camera. The monocular vision SLAM algorithm has faster operation speed, and theused equipment is simple and easy to calibrate so as to have higher practical value and wider application occasions.

A method is presented for throttling data transmissions within a data processing system. Information about a data transfer from a server to a client is received within the application layer of a server, which stores the information about the data transfer along with information about a number of recent data transfers from the server to the client to create a sliding window of historical information about data transfers. The data transfer from the application layer of the server is delayed within the application layer of the server for an amount of time that is approximately equal to a computed delay time value in response to a determination that an average data transfer rate over the number of recent data transfers from the server to the client may exceed a data transfer rate threshold parameter.