146 results about "Random choice" patented technology

Read disturb is reduced in non-volatile storage. In one aspect, when a read command is received from a host for reading a selected word line, a word line which is not selected for reading is randomly chosen and its storage elements are sensed to determine optimized read compare levels for reading the selected word line. Or, a refresh operation may be indicated for the entire block based on an error correction metric obtained in reading the storage elements of the chosen word line. This is useful especially when the selected word line is repeatedly selected for reading, exposing the other word lines to additional read disturb. In another aspect, when multiple data states are stored, one read compare level is obtained from sensing, e.g., from a threshold voltage distribution, and other read compare levels are derived from a formula.

A method for playing a wagering game allowing a player to be eligible for a progressive jackpot having an actual value. The method comprises conducting the wagering game that has a randomly selected outcome selected from a plurality of outcomes, and displaying a displayed value of the progressive jackpot to the player. The method further includes increasing the displayed value by increments of a first denomination, and awarding a player an award value of the progressive jackpot in response to the player achieving the progressive jackpot. The award value is greater than the displayed value and is equally divisible by a second denomination that is larger than the first denomination. Other methods are provided for creating an escrow pool for funding the difference between the displayed and award values, and also for awarding multiple jackpots from a plurality of progressive jackpots.

Access to a wireless communication system (100) by a subscriber station (101-103) is facilitated by selecting (705) an access sequence from a set of sequences that have been identified to have a low average of peak-to-average-power-ratios of access signals generated by the set of sequences and also based on a good cross-correlation of the access signals; forming (714) the access waveform by generating an access signal using the access sequence and appending in the time domain a cyclic prefix to the access signal; and transmitting (715) the access waveform. In some implementations, the access waveform is cyclically shifted (820) before the cyclic prefix is appended, and in some implementations, the signal is transmitted (710, 810) in a randomly selected sub-band of an access interval.

A plurality of computer nodes communicates using seemingly random IP source and destination addresses and (optionally) a seemingly random discriminator field. Data packets matching criteria defined by a moving window of valid addresses are accepted for further processing, while those that do not meet the criteria are rejected. In addition to “hopping” of IP addresses and discriminator fields, hardware addresses such as Media Access Control addresses can be hopped. The hopped addresses are generated by random number generators having non-repeating sequence lengths that are easily determined a-priori, which can quickly jump ahead in sequence by an arbitrary number of random steps and which have the property that future random numbers are difficult to guess without knowing the random number generator's parameters. Synchronization techniques can be used to re-establish synchronization between sending and receiving-nodes. These techniques include a self-synchronization technique in which a sync field is transmitted as part of each packet, and a “checkpoint” scheme by which transmitting and receiving nodes can advance to a known point in their hopping schemes. A fast-packet reject technique based on the use of presence vectors is also described. A distributed transmission path embodiment incorporates randomly selected physical transmission paths.

A system for collecting personally identifying information from individuals and using that information in verifying their identity and permitting their access to one or more secure systems via a single login authentication system. Based on a series of questions (opinion-based), a database of answers is developed for each user. To access a secure system at a base level of security, a user is asked to answer a group of questions randomly selected from the database and presented to the user for answers. If the questions are correctly answered, the user is permitted access to the secure system. Once access is granted, under certain circumstances, the user can access additional secure systems either as a result of the base level of security previously established, or a higher level of security, which requires the user to correctly answer additional randomly selected questions.

Provided is a biometric authentication system capable of preventing spoofing attacks even if leakage of key information and a registration conversion template occurs. A communication terminal device (300) calculates secret key information k′ which is exclusive OR of key information k of the registration biological information and masked value c′ which is randomly selected from a predetermined error correction code group, and calculates verified information c′″ which is exclusive OR of sent information c″ and value c′. A biometric authentication device (500) calculates exclusive OR of authentication biological information, information k′, and registration conversion template w, as information c″, wherein the template w is exclusive OR of information x, information k, and authentication parameter c randomly selected from the code group; and performs biometric authentication on the basis of a degree of matching between information c′″ corresponding to information c″, and the parameter c.

A mobile station device transmits a random access preamble to a base station device and performs uplink timing alignment based on the synchronization timing deviation information included in a random access response which the base station device transmits in response to the transmitted random access preamble, wherein in an uplink synchronous status, the mobile station device does not perform uplink timing alignment based on synchronization timing deviation information included in a random access response, which is a response to a random access preamble whose preamble ID is randomly selected by the mobile station device.

the present invention provides a method for authenticating a user in a multiparty quantum communication comprising: generating l quantum entangled states with N particles and transmitting each particle of the l quantum entangled states to N users, by a quantum communication server, wherein the N is a natural number larger than 2; determining, by the quantum communication server, whether a disguised attacker exists among N users on the basis of a first error rate calculated by using n quantum states randomly selected from the l quantum states possessed by the users respectively and a previously shared secret key in each of the users; and controlling, by the quantum communication server, each of the users to generate a new secret key using m_k quantum states and replace the previously shared secret key with the new secret key.

The invention provides a method of forensic digital watermarking that randomly selects an orientation and/or embedding protocol for a digital watermark signal to be embedded in the content signal. It then embeds the digital watermark signal at the selected orientation in the content signal. The embedding applies a different orientation to the forensic watermark for each instance of embedding a watermark. This thwarts averaging and over-embedding attacks.

A method of establishing a secure channel between a human user and a computer application is described. A secret unique identifier (“PIN”) is shared between a user and an application. When the user makes a request that involves utilizing the PIN for authentication purposes, the application renders a randomly selected identifier. The randomly selected identifier is in a format that is recognizable to a human but is not readily recognizable by an automated agent. The randomly selected identifier is then presented to the human user. The user identifies the relationship between the randomly selected identifier and the PIN. If the user's input reflects the fact that the user knows the PIN, then the user is authenticated.

A steganographic method embeds hidden information like digital watermarks and digital fingerprints into an image by applying one or more zero-mean patches to a digital signal that conveys the image. Each zero-mean patch comprises elements having an average value substantially equal to zero. A copyright protection system is implemented by selecting one or more zero-mean patches in pseudo-random fashion, modifying the patches by perturbing their elements in pseudo-random fashion, and applying the patches to image pixels at locations that are selected in pseudo-random fashion. The copyright protection system further includes a procedure for checking for the presence of a watermark in a digital signal.

A server (115) having a communication link comprises an application execution environment, a random IP address generator application (135) executing within the application execution environment of the server to randomly select (205) an IP address, a communications interface configured to send outbound data or to receive inbound data thereby establishing the communications link in coordination with the random IP address generator application and a processor (150). Preferably, the processor is programmed to receive a request from a client (112 or 114) and process the request if an IP address randomly selected at the client synchronously matches the randomly selected IP address at the server. Additionally, the processor can be further programmed to ignore the request from the client if the IP address randomly selected at the client fails to synchronously match the randomly selected IP address at the server.

The present invention includes a method and system for determining link weights that when utilized will optimize the performance of a network in the event of a link failure without the need to alter the link weights. The method includes determining two sets of links, one that includes links with a significant amount of loading and one that includes links with a modest amount of loading. A set of permissible solutions is generated utilizing one randomly chosen link from each set. After omitting recent best permissible solutions, the remaining permissible solutions are evaluated by analyzing for the complete network topology and for the topologies corresponding to all single-link failure states and the best permissible solution is found. If the best permissible solution is better than the current optimal solution, then the best permissible solution is made the optimal solution. These steps are repeated until a predetermined number of iterations have been evaluated without a change in the optimal solution. When that occurs, the number of links used to generate the set of potential solutions is randomly changed and the above-described steps are repeated. The method is complete after a second predetermined number of iterations have been evaluated no matter how many changes to the optimal solution.

A sufficient number of data items are selected for inclusion in a data set so as to discourage a transmission of the entire set over a limited bandwidth communications path, such as the Internet. Each data item comprises one or more sections, which taken together constitute the complete data set. Each section of the data set is linked to another section of the data set, and each section's link is bound to the section via the use of one or more watermarks. Upon presentation of material for rendering, the presence of the entirety of the data set is verified by ascertaining the presence of linked-to sections. For further security, the links between sections is formed by a random selection of each linked-to section. To verify that each linked-to section corresponds to the original section that was linked-to, each link contains an identifier of the linked-to section that can be used to determine that a retrieval of a linked-to section corresponds to the originally assigned linked-to section. If the identifier associated with the linked-to section does not properly match the presented linked-to section, a rendering of the data items of the data set is prevented. In a preferred embodiment, a closed linked list is formed, so that every section of the data set can be included in the verification process, if desired.

The embodiment of the invention discloses a selection method for a source returning path and a server. The method comprises the steps that after at least one IP address corresponding to a to-be-accessed domain name is determined according to the to-be-accessed domain name, the network access quality of operators and cities to which the IP addresses belong is acquired, and the IP address corresponding to the operator and the city which have the highest network access quality is taken as a source returning IP address. Accordingly, the purpose that when multiple operator lines exist, the source returning IP address is selected according to the network access quality of the operators and the cities without selecting a line simply and randomly, it is guaranteed that a user can access resources at the highest speed, and the access efficiency is effectively improved.

A randomly selected point on an elliptic curve is set as the initial value of a variable and calculation including a random point value is performed in an algorithm for calculating arbitrary scalar multiple operation on an elliptic curve when scalar multiplication and addition on an elliptic curve are defined, then a calculation value obtained as a result of including a random point is subtracted from the calculation result, whereby an intended scalar multiple operation value on an elliptic curve is determined.

The present invention is directed to systems for and methods of controlling access to computer systems. A method in accordance with the present invention comprises performing a test that includes comparing input responses to randomly selected questions with corresponding pre-determined responses to the questions and granting access to the system in the event the test is passed. A first condition of passing the test is that each input response matches a corresponding pre-determined response. Once passing the test, the user is granted permissions to access data based on his position. For example, a corporate director generally has greater permissions than an engineer. Preferably, the user's permissions determine an encryption key and a decryption key that the user is able to use to access protected data.

The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Short spreading is used within a random access channel in an OFDM based network to spread data for transmission through the channel. The resource allocation of the random access channel is divided into a number of resource blocks in frequency, time, or both frequency and time. Each resource block has a dimension that is only a portion of the overall size of the resource allocation. During contention, a randomly selected short spreading code may be used to provide data spreading within a randomly selected resource block.

A detector and method for estimating channel data probability in a multi-user or multiple-input multiple-output communication system includes summing conditional bit probabilities conditioned on hypothetical channel data patterns over stochastically selected hypothetical channel data patterns. Various detailed hardware structures and circuits are also described.

The invention discloses a method for optimizing a plurality of QoS grid workflows by adopting an ACO, wherein, three kinds of QoS parameters are considered. The method can not only satisfy the QoS constraint given by a user but also optimize one QoS parameter given by the user. The method comprises the following steps that: firstly, ants are initialized, each ant can select a structural direction in random and establishes a task sequence in accordance with the preference constraint; next, each ant selects a kind of heuristic information on the basis of the pheromone by adopting the selection method of roulette and updates local pheromone. After the heuristic information is selected, the ants map tasks in a task list to the service process in sequence on the basis of the pheromone and the heuristic information. When all the ants complete the construction of solutions, each scheduling solution is evaluated and all the pheromone is updated.

A hierarchical-GBL/LBL NAND array with a plurality of LG and MG groups in either orthogonal BL/CSL scheme or parallel BL/SL scheme including a plurality of block-decoders with a shared self-timed delay control circuit and a plurality of fully-shielding dynamic CACHE registers made of 2 local broken metal lines within the array and DRAM-like SA is provided. Each DCR capacitor is flexibly expandable by connecting multiple C_LGs made by the local broken metal lines of the LGs to form a C_MG of a larger MG. Based on the NAND array, multiple randomly selected WLs in multiple random blocks within multiple random LGs within one MG can be selected on basis of one WL per block per LG for performing an ABL pipeline and concurrent SLC program without verification, and on basis of one WL per block per MG for performing an ABL-like or HBL pipeline and concurrent SLC read.