1520 results about "Selection algorithm" patented technology

The acceleration of peer-to-peer downloads of content files wherein a tracker performs a condition based peer selection that is dynamically adjustable. A further feature relates to the use of enhanced message scheme for communications. One embodiment is a system in a swarm having at least one origin seed capable of at least initially storing the content files with at least one tracker maintaining a list of peers wherein the tracker uses at least one dynamically adjusting peer selection algorithm to generate a condition based peer-list and provides the condition based peer-list to a requesting peer.

Aspect of the invention are directed to antivirus scanning, by a proxy server, of data downloaded from the network onto a PC workstation. The antivirus scanning is optimized for each scan by selecting an algorithm for that scan based on a determined overall likelihood that the downloaded data contains malicious code. Determination of the overall likelihood is augmented by the strength, or confidence, of statistical data relating to malware screening of results of previous downloads having similar parameters to the instant download.

An electronic catalog system provides an interface for users to author and post pieces of content, referred to as “blurbs,” for viewing by other users. The blurbs submitted by a particular author are made available for viewing in an author-specific blog (web log) format. Blurbs may also be obtained from external sources, such as from blogs hosted by various web sites. A personalized blurb selection component selects blurbs to present to users based on histories of catalog items selected by such users, and/or based on various other criteria. The blurbs selected for a particular user are presented within a personal log or “plog,” which may be updated daily and will typically contain entries from many different authors. User feedback provided on specific blurbs is taken into consideration by the personalized blurb selection algorithms.

An improved user interface and method are provided for presenting recommendations to a user when the user adds an item to a shopping cart. In response to the shopping cart add event, a page generation process generates and returns a page that includes a recommendations portion and a condensed view of the shopping cart. The recommendations portion preferably includes multiple recommendation sections, each of which displays a different respective set of recommended items selected according to a different respective recommendation or selection algorithm (e.g., recommendations based on shopping cart contents, recommendations based on purchase history, etc.). The condensed shopping cart view preferably lacks controls for editing the shopping cart, and lacks certain types of product information, making more screen real estate available for the display of the recommendations content. A link to a full shopping cart page allows the user to edit the shopping cart and view expanded product descriptions.

A communication system selection algorithm (SSA) implemented by a mobile station chooses between available systems to select a system to serve the mobile station. During initialization, the SSA causes the mobile station to scan the environment and compare available communication systems to determine the best system to provide service. After an initial system is chosen, the SSA causes the mobile station to continuously, or at discrete time intervals, scan the environment for available systems, thus allowing for a seamless switch to an available system whenever a handoff is desired. The SSA chooses the best available system based on conditions such as bit rate and cost of each available system and applying preference rules defined by a service provider and/or user of the mobile station.

Aspects of a method and system for rate selection algorithm to maximize throughput in closed loop multiple input multiple output (MIMO) wireless local area network (WLAN) system are provided and may comprise computing a maximum number of binary bits to be simultaneously transmitted via an RF channel based on signal quality. A modulation technique may be selected based on the computed maximum, communicating feedback information comprising the selected modulation technique. Subsequently transmitted data may be received via an RF channel which is modulated based on the feedback information. Another aspect of the method may comprise receiving feedback information comprising at least one of a selected modulation technique and coding rate via an RF channel, and transmitting subsequent data via said at least one of a plurality of RF channels which either modulated, or coded, based on the feedback information.

The present disclosure relates to Ethernet synchronization systems and methods that combines Synchronous Ethernet (Sync-E) and Precision Time Protocol (PTP) IEEE 1588 algorithms. The present invention includes systems and methods for Ethernet networks and node configurations that include a set of rules on node placement, such as Boundary Clock (BC) nodes and Sync-E nodes, a clock selection algorithm, a holdover algorithm, and the like. Advantageously, the present invention provides an architecture that allows practical and real-world useful clock propagation through placement of BCs and Sync-E nodes for best performance. Practical experience and theoretical design are embodied in the present invention to define a very specific set of rules on how to build a network capable of providing accurate and reliable synchronization. The present invention includes clock selection that unifies Sync-E and 1588 algorithms.

A system and a method allowing a user terminal (18) in a network to simultaneously access a plurality of radio based access networks (19, 20) of diverse access technologies. Characteristic features of the invention are access selection adapters (22, 23), each one associated with a respective radio based access network, and an access technology independent access selector (26). An access adapter has means (32) for receiving access technology dependant information from its respective access network and means (31) for translating the information into access technology independent status information. The access selector comprises an access selection algorithm (33) interacting with applications (27) resident in the user terminal and with each access adapter for selection of a radio access network based on an individual QoS profile associated with each respective application and on said access technology independent status information. The invention also relates to a method for service scheduling.

A communication system selection algorithm (SSA) implemented by a mobile station chooses between available systems to select a system to serve the mobile station. During initialization, the SSA causes the mobile station to scan the environment and compare available communication systems to determine the best system to provide service. After an initial system is chosen, the SSA causes the mobile station to continuously, or at discrete time intervals, scan the environment for available systems, thus allowing for a seamless switch to an available system whenever a handoff is desired. The SSA chooses the best available system based on measurements of each available system and applying preference rules defined by a service provider and/or user of the mobile station.

A method and apparatus optimizes the protection of computing networks. This protection utilizes attenuated (weakened) strains of live, replicating, malicious code such as viruses and worms, analogous to the development of live, attenuated, human vaccines in the medical field. In a preferred embodiment, this is achieved by (1) attenuating a malicious program, e.g. a virus or worm, or software vulnerability by limiting its virulence, i.e., limiting its damage and resource usage, (2) modifying the virus to confer immunity on the network that it infects, e.g., automatically patching a vulnerability, or marking the infected host as immune to further infection, (3) releasing the newly attenuated virus into the network, (4) tracking the attenuated virus and its success rate (e.g., rate and ratio of successfully patched to un-patched vulnerable hosts), and (5) limiting the spread of the virus vaccine, e.g., emergency termination, timeout to die, “white-list” of hosts not to touch, network IP address limitation, restricted IP ranges, variable address selection algorithm.

The present invention relates to a selection method of a user resident mechanism pf a wireless multi-hop relay network and synergy relay nodes centralizedly controlled by the base station. The present invention provides a user resident mechanism, uses thefriendly relay nodes relay and control the signaling transmission to complete; at the same time provides a relay node selection method of carrying out the centralized control and management to the entire relay node selection process by the base station, which is carried in synergies through potential relay nodes and the target terminal. The identification and selection of the relay node are divided into two steps: the first step is to identify the appropriate relay nodes, to constitute an alternative assembly; and the second step is to select a relay nodes subset to tansmit the carrying business from the alternative assembly according to the multi-optimization objective selection algorithm, and contemporarily completing the business carrying configuration of the relay nodes in the subset based on the business properties, as well as the hollow characteristics. The method not only focuses on a two-hop wireless relay network, but also can extend to the multi-hop wireless relay networks, or even extends to a wireless Mesh network and a wireless sensor network.

Systems and methods for providing an interactive display having indicators of video-on-demand programs are described. The systems and methods select indicators for inclusion in the interactive display according to a promotional selection algorithm.

A system, method and program product for selecting an algorithm and feature set to solve a problem. A perpetual analytics system is disclosed that provides a genetic algorithm for jointly selecting an algorithm and feature set to solve a problem, comprising: an evolutionary computing engine for processing data encoded as chromosomes, wherein each chromosome encodes an algorithm and a feature set; a domain knowledge store that maintains a plurality of algorithms and a plurality of features; a system for applying a generation of chromosomes to a set of data to provide a set of results; and a fitness function for evaluating the set of results to rate a performance of each chromosome in the set of chromosomes; wherein the evolutionary computing engine is adapted to evolve a subset of the set of chromosomes into a new generation of chromosomes.

The invention discloses a selection method for user plane security algorithm, including steps of: entity at the other end of the network receives request sent by user terminal; entity at the other end of network acquires and selects user plane algorithm according to security information of user terminal. The invention also provides a system and device for selecting user plane security algorithm. By the invention, network could select algorithm of different security level according to service or user's demand, namely that algorithm is negotiated based on different services or different users, so that encryption operation in network is more flexible, and protection on different levels is provided to users and services with different security demand.

Systems and methods are provided for producing a stereo disparity map representing an imaged subject. A plurality of sensors (102 and 104) are operative to produce a plurality of images. Each image has an associated exposure according to an exposure level of an associated sensor. A system control (106) determines exposure levels for the plurality of sensors according to an exposure selection algorithm. A disparity processing component (112) is operative to generate a stereo disparity map from a plurality of images. An image merger (110) is operative to merge a plurality of images to produce a composite image having an increased dynamic range.

In one embodiment, a multithreaded processor includes a plurality of buffers, each configured to store instructions corresponding to a respective thread. The multithreaded processor also includes a pick unit coupled to the plurality of buffers. The pick unit may pick from at least one of the buffers in a given cycle, a valid instruction based upon a thread selection algorithm. The pick unit may further cancel, in the given cycle, the picking of the valid instruction in response to receiving a cancel indication.

The invention relates to a method for realizing vehicle-mounted mobile self-organized network routing, which is characterized by comprising the following steps that: (1) a static node is arranged at each intersection; (2) when forwarding a data packet, a source node can forward the data packet to the static node relatively close to a target static node at one end of a road section where the source node is positioned; (3) when forwarding the data packet, the static node firstly judges whether the static node closer to the target static node is in a neighbouring list or not, if so, the static node directly forwards the data packet to the corresponding static node, otherwise, the static node selects a neighbouring road section according to a road section selection algorithm, and then appoints another static node on the selected road section as the static node of a road section receiving terminal, wherein the neighbouring road section is not the road section which just receives the data packet; and the road section direction of the neighbouring road section is close to the target static node; and (4) when receiving the same data packet transmitted from the same source node from different road sections, a routing static node selects an optimal route which is high in the success rate for receiving the data packet and relatively short in delay time, and forbids the receiving routes which are not optimal at the same time.