516 results about "Method cascading" patented technology

A data storage facility for transferring data from a data altering apparatus, such as a production data processing site to a remote data receiving site. The data storage facility includes a first data store for recording each change in the data generated by the data altering apparatus. A register set records each change on a track-by-track basis. A second data store has first and second operating modes. During a first operating mode the second data store becomes a mirror of the first data store. During a second operating mode the second data store ceases to act as a mirror and becomes a source for a transfer of data to the data receiving site. Only information that has been altered, i.e., specific tracks that have been altered, are transferred during successive operations in the second operating mode. Commands from the local production site initiate the transfers between the first and second operating modes.

Systems and methods are provided to implement a dynamic and efficient cascading policy management framework architecture for both wired and wireless networks. A plurality of Policy Functions (PFs) are assigned to a plurality of Policy Enforcement Points (PEP). The PFs make decisions regarding local policy control at the specific PEP. The PFs then delegate the policy requests or IP flows to a separate PEP that is more conducive to enforcing that policy request. Thus, policy decisions are made at the point where the most information is available, leading to fewer policy requests traversing back and forth across a network. Additionally, this cascading Policy Management Framework Architecture allows for unified policy management across multiple types of networks, including wired (Internet) and wireless (UMTS).

A method, system, and computer program product for providing consistent, end-to-end protection within a computer network for user datagrams (i.e. packets) traveling through the network. The network may comprise network segments that are conventionally assumed to be secure (such as those found in a corporate intranet) as well as network segments in non-secure networks (such as the public Internet or corporate extranets). Because security breaches may in fact happen in any network segment when datagrams are unprotected, the present invention discloses a technique for protecting datagrams throughout the entire network path by establishing cascaded tunnels. The datagrams may be exposed in cleartext at the endpoints of each tunnel, thereby enabling security gateways to perform services that require content inspection (such as network address translation, access control and authorization, and so forth). The preferred embodiment is used with the “IPSec” (Internet Protocol Security Protocol) and “IKE” (Internet Key Exchange) protocols, thus providing a standards-based solution.

Heterogeneous data at a plurality of remote nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing at least one method to be performed on the data source object and at least a second method to be automatically performed on the results of executing the first method. A user site agent breaks the user-generated script into new scripts appropriate for execution at the remote nodes and determines whether the second method should be executed at the remote nodes or at the user site. A messenger process transmits the new scripts to the appropriate remote nodes where respective agent processes respond to automatically access the appropriate data and to automatically execute the specified methods.

This invention enhances the usability of the human-computer interface by disclosing a technique for the display of single and multi-generation pop-up controls at a location that best meets the user's criterion of an optimal display location. The technique determines the minimum size of a rectangle capable of displaying the actual or likely maximum size of pop-up controls requested during any given activation of the subsystem that manages display of requested controls. The invention then identifies a location that assures the said rectangle either has no overlay or a minimum overlay of the screen area of current interest to the user while avoiding display clipping. A fixed-point is now determined within said rectangle based on physical characteristics of the controls to be displayed that permits display of descendant controls in a backward cascade that enables the user to maintain visual focus at a fixed screen location while manipulating successive controls. The invention provides the user with the ability to redisplay any previously displayed control irrespective of control type as well as provide a "Done" capability for appropriately designed controls that permits the user to convert a single selection control into a multi-selection control. As an adjunct to the reverse order the invention provides four capabilities that permit the user to undo and redo arbitrary services via performed via redisplay of ancestor controls.

The invention is a computer implemented technique for id entifying anomalous data in a data set. The method uses cascaded k-Means clustering and the ID3 decision tree learning methods to characterize a training data set having data points with known characterization. The k-Means clustering method first partitions the training instances into k clusters using Euclidean distance similarity. On each training cluster, representing a density region of normal or anomaly instances, the invention builds an ID3 decision tree. The decision tree on each cluster refines the decision boundaries by learning the sub-groups within the cluster. A test data point is then subjected to the clustering and decision trees constructed form the training instances. To obtain a final decision on classification, the decisions of the k-Means and ID3 methods are combined using rules: (1) the Nearest-neighbor rule, and (2) the Nearest-consensus rule.

The present invention relates to a system and method to facilitate efficient and automated processing of messages. A bulk filter is provided to categorize one or more received messages according to a range of classification, the range spanning from at least a bulk classification of values to at least a non-bulk classification of values. A second filter is provided to further classify the received messages in order to automatically facilitate processing of the messages. The range of classification includes a continuum of values based on a likelihood that the received messages are determined to tend toward or fall within the bulk classification of values or toward/within the non-bulk classification of values. Also, the bulk filter or filters can include an adjustable threshold setting to determine or define differences between the bulk classifications and the non-bulk classifications. Various combinations of filters are possible including multiple filter arrangements, parallel arrangements, cascaded arrangements, and other arrangements to facilitate filtering and sorting of messages in order that users can more efficiently process such information in a timely manner. Applications include the enhancement of classification procedures for identifying urgent or important email from non-urgent or non-important email, with the combination of bulk-email filters with urgency or importance filters in cascaded and parallel filtering methodologies.

Methods, systems, computer program products, and methods of doing business by improving the scheduling of execution of jobs for or by network-connected devices, thereby enabling the job execution process to scale more easily, efficiently, and effectively to support large numbers of devices and/or users. Examples of jobs include, but are not limited to, distribution of resources (including software, configuration information, images, and other types of content) to a device, fetching a device's inventory information, backing up a device's contents, and so forth. Jobs are programmatically scheduled based upon a specified time internal, according to a class of the requester. Only if an earliest start time after which the job may be executed for this requester has been reached will the job be executed; otherwise, the job execution is delayed. The disclosed techniques lessen the need for additional servers to handle spikes in processing load, reduce the likelihood of reaching system overload, and reduce the likelihood of cascading failures that may occur when systems are overloaded.

One embodiment of the present invention provides systems and methods, which allow a more efficient shopping experience. A cascading commerce menu provides access to a plurality of product, service, and/or content categories. In one embodiment, the cascading commerce menu is stored on a client computer, thereby providing quick access to the menu.

A system may generate action requests for a service management system. A user preference data store may contain electronic records for a set of users, including, for example, at least one user preference value. A back-end application computer server may receive, from a remote user mobile device, an indication associated with an event. The server may then determine at least one location coordinate associated with the event and select a sub-set of service providers from a service provider data store based on the location and at least one user preference value. The server may generate an action request for a designated one of the sub-set of service providers in accordance with logic based rules and transmit information about the action request to the designated service provider and the remote user mobile device. The server may receive an action request update and transmit a modified action request to another service provider.

A request event manager for a network of consumer electronic devices. In one embodiment, the request event manager maintains a database of home network services, and allows the home network services to be scheduled for execution over time. Home network services herein refer to high-level abstractions of a consumer electronic device's functionalities, and also content that is available from the consumer electronic device. The request event manager of the present invention also creates and maintains a service request list (SRL) which details the service actions in a hierarchical fashion. By maintaining a database of home network services, the request event manager of the present invention allows user applications to specify and schedule concatenated or hierarchical events such that different network activity across interconnected heterogeneous consumer electronic devices can be synchronized without requiring complicated logic to be implemented. The request event manager of the present invention may be implemented as part of a middleware infrastructure for a home network, and may reside within a home server.

Disclosed is a system, method, and program for performing a join operation on a multi-column table and at least two satellite tables having a join condition. Each satellite table is comprised of multiple rows and at least one join column. Each multi-column table is comprised of multiple rows and at least one column corresponding to the join column in each satellite table. A join operation is performed on the rows of the satellite tables to generate a first join result comprising concatenations of the rows of the satellite tables. Less than all the concatenated rows in the first join result that satisfy the join condition are then selected. The selected concatenated rows in the first join result are then joined to the multi-column table.

An expense allocation method utilizes matrix multiplication to transform a set of reciprocal or cascading allocation rules into a new set of one-step allocation rules. The new set of rules reallocates amounts directly to the ultimate destination without going through numerous intermediate levels of reallocation. By taking advantage of the specific structure of the matrix, and partitioning the matrix into four (4) subparts, the matrix multiplication process is greatly simplified. The expense allocation method can be easily and efficiently implemented on a computer system, including computers based upon parallel or vector architectures. This invention permits most allocation work to be done before the end of an accounting period, allowing end-of-period accounting work to be completed sooner. Alternatively, expenses can be allocated as they occur, rather than waiting until the end of a period.

The invention provides a face attribute recognition method of a deep neural network based on cascaded multi-task learning and relates to the computer vision technology. Firstly, a cascaded deep convolutional neural network is designed, then multi-task learning is used for each cascaded sub-network in the cascaded deep convolutional neural network, four tasks of face classification, border regression, face key point detection and face attribute analysis are learned simultaneously, then a dynamic loss weighting mechanism is used in the deep convolutional neural network based on the cascaded multi-task learning to calculate the loss weights of face attributes, finally a face attribute recognition result of a last cascaded sub-network is used as the final face attribute recognition result based on a trained network model. A cascading method is used to jointly train three different sub-networks, end-to-end training is achieved, the result of face attribute recognition is optimized, different from the use of fixed loss weights in a loss function, a difference between the face attributes present is considered in the invention.

The present invention is a method and apparatus for compressing and decompressing data. In particular, the present invention provides for (de-)compressing naturalistic color-image and moving-image data, including high-precision and high-definition formats, with zero information loss, one-sample latency and in faster than real time on common computing platforms, resulting in doubled transmission, storage, and playback speed and doubled transmission bandwidth and storage capacity, and hence in doubled throughput for non-CPU-bound image-editing tasks in comparison with uncompressed formats. The present invention uses a nearly symmetrical compression-decompression scheme that provides temporal, spatial, and spectral compression, using a reversible condensing/decondensing filter, context reducer, and encoder/decoder. In the preferred embodiment of the invention, the compression filter is implemented as a cascade of quasilinear feedforward filters, with temporal, multidimensional spatial, and spectral stages, where appropriate, in that order, whose support consists of adjacent causal samples of the respective image. The decompressor cascades quasilinear feedback inverse filters in the reverse order. The filters can be implemented with mere integer addition, subtraction, and either one-dimensional table lookup or constant multiplication and binary shifting, depending on the computing environment Tables permit the data precision to be constrained throughout to that of the image samples. The encoder uses a table of prefix codes roughly inversely proportional in length to their probability, while the decoder uses chunked decode tables for accelerated lookup. In the fastest and simplest mode, the code tables are context-independent. For greater power, at the cost of a reduction in speed, the code tables are based on the temporal, multidimensional spatial, and spectral adjacent causal residue samples, where contexts with similar probability distributions are incoherently collapsed by a context reducer using one-dimensional lookup tables followed by implicitly multidimensional lookup tables, to minimize the overall table size. The invention's minimal resource requirements makes it ideal for implementation in either hardware or software.

A mechanism is provided for maintaining some global windowing context to parent/child relationships. When a current window spawns a child window, a data structure stores the parent/child relationship within the window hierarchy. A cascading menu indicates to the user the contextual relationship of a current window to related windows. The user may then navigate among related windows using the cascading menu.

A system and method for detecting file content similarity within a file system. The system may include a storage device configured to store a plurality of files and a file system configured to manage access to the storage device. The file system may be configured to compute a compressed size of at least a portion of a given file, and to store an indication of the compressed size in a named stream corresponding to the given file. In one specific implementation of the system, the file system may be further configured to determine a value of a file harmony metric from the compressed size of the concatenation of a first and second file and the compressed sizes of the first and second files, where the compressed sizes of the first and second files may be stored in a corresponding one of a plurality of respective named streams.

A method and apparatus are described to perform cascading search methodologies on one or more data sets from one or more databases. A graphical user interface for setting up the searching is also described. In one embodiment, the invention can include designating a first strategy comprising a search string applied to operate upon data records in a first database, designating a second search strategy comprising the search string applied to operate upon data records in a second database, and forming a search hierarchy comprised of the first search strategy followed by the second search strategy. In another embodiment, the invention can include a graphical user interface comprising a first area to select a database, a second area to select a search type, and a third area to select an attribute from the selected database upon which to execute the selected search type.

A system and method for use in data analysis are provided. The system comprises a data processing utility configured to receive and process input data, comprising: plurality of neural network modules capable for operating in a training mode and in a data processing mode in accordance with the training; a network training utility configured for operating the neural network modules in the training mode utilizing selected set of training data pieces for sequentially training of the neural network modules in a cascade order to reduce an error value with respect to the selected set of the training data pieces for each successive neural network module in the cascade; and an abnormality detection utility configured for sequentially operating said neural network modules for processing input data, and classifying said input data as abnormal upon identifying that all the neural network modules provide error values being above corresponding abnormality detection thresholds.

An arithmetic device able to optimize the logic level, able to prevent an increase in the component data, able to prevent the area efficiency as an integrated operation efficiency, and circuit, achieving an improvement in the achieving a reduction power consumption, provided with a first selection device for selecting coefficient inputs C0I to CkI in accordance with a control signal ASEL, a second selection device for selecting data inputs D0I to DmI in accordance with a control signal BSEL, a third selection device for selecting cascade inputs P0 to Pn−2 in accordance with a control signal CSEL, an ALU for receiving as input the output signal of the first to third selection devices and performing a logic operation in accordance with instructions of the control signals ALUMD etc., a MAC for receiving as input the output signals of the first to third selection devices and performing operation in accordance with instructions of

Computer implemented processes and software products generate profiles of entities, such as providers, clients, merchants and customers, and entities comprising interacting pairs of entities. The processes including deriving direct profiles from transaction data pertaining to an entity and enhancing the profile of one entity using the profile of another entity. Parallel and serial applications of the derive and enhance processes on various individual and multiple entites yields enhanced profiles that powerfully describe the interactions and relationship of the entities to each other, and between their members.