77 results about "Deterministic method" patented technology

A method of allocating resources in the presence of uncertainty is presented. The method builds upon deterministic methods and initially creates and optimizes scenarios. The invention employs clustering, line-searching, statistical sampling, and unbiased approximation for optimization. Clustering is used to divide the allocation problem into simpler sub-problems, for which determining optimal allocations is simpler and faster. Optimal allocations for sub-problems are used to define spaces for line-searches; line-searches are used for optimizing allocations over ever larger sub-problems. Sampling is used to develop Guiding Beacon Scenarios that are used for generating and evaluating allocations. Optimization is made considering both constraints, and positive and negative ramifications of constraint violations. Applications for capacity planning, organizational resource allocation, and financial optimization are presented.

Apparatuses and methods for forming displays are claimed. One embodiment of the invention relates to forming a flexible active matrix display along a length of flexible substrate. Another embodiment of the invention relates to forming multiple flexible displays along a continuous flexible substrate. Another embodiment of the invention relates to forming a flexible display along a flexible reflective substrate. Another embodiment of the invention relates to using FSA generally with a flexible web process material. Another embodiment of the invention relates to using FSA and a deterministic method such as “pick and place” to place objects onto a rigid substrate or onto a web process material. Another embodiment of the invention relates to using web processing to deposit and/or pattern display material through an in-line process.

The present invention provides an array of parallel programmable processing engines interconnected by a switching network. At least some of the processing engines execute a thread, and at least some threads communicate with each other through communication objects either internally within one processing engine or through the network. A scheduling step of the parallel programmable processing engines is initiated by one or more events, an event being defined by a change of a state variable of a communication object. The array comprises:

• • means for scheduling a scheduling step of the processing engines, the scheduling means comprising means for executing at least a first set of threads in parallel,
  • means for updating state values of communications objects in response to the parallel executing step, and
  • means for repeatedly and sequentially scheduling the executing means and the updating means until no more events occur.

The present invention also provides a deterministic method of operating such an array.

Various embodiments of the present invention provide methods and systems for deterministic calculation of radiation doses, delivered to specified volumes within human tissues and organs, and specified areas within other organisms, by external and internal radiation sources. Embodiments of the present invention provide for creating and optimizing computational mesh structures for deterministic radiation transport methods. In general these approaches seek to both improve solution accuracy and computational efficiency. Embodiments of the present invention provide methods for planning radiation treatments using deterministic methods. The methods of the present invention may also be applied for dose calculations, dose verification, and dose reconstruction for many different forms of radiotherapy treatments, including: conventional beam therapies, intensity modulated radiation therapy (“IMRT”), proton, electron and other charged particle beam therapies, targeted radionuclide therapies, brachytherapy, stereotactic radiosurgery (“SRS”), Tomotherapy®; and other radiotherapy delivery modes. The methods may also be applied to radiation-dose calculations based on radiation sources that include linear accelerators, various delivery devices, field shaping components, such as jaws, blocks, flattening filters, and multi-leaf collimators, and to many other radiation-related problems, including radiation shielding, detector design and characterization; thermal or infrared radiation, optical tomography, photon migration, and other problems.

The present invention provides an automated system and method for laying out photovoltaic (PV) solar panels on one or more regions of a roof or ground installation. Automation includes a presentation of optimal comparative layouts, use of different panels (of the same or different manufacturers), and consideration of different energy production characteristics and different layout constraints. Diverse mathematical approaches are used to determine the optimal panel layout for a given geographic region and for particular goals, including, but not limited to, the objective of maximizing the solar production from the designated region(s). The application of two such mathematical algorithms are detailed as parts of an exemplary embodiment: a deterministic edge-aligned approach as well as a nondeterministic approach that employs a genetic evolution simulation.

Systems and methods use a deterministic approach to identify, recruit and manage partners. According to some possible implementations, publicly and proprietary available data may be gathered, normalized and analyzed using proven statistical techniques to derive recruiting and ongoing partner performance.

A computer graphics system generates pixel values for pixels in an image of objects in a scene, using strictly-deterministic low-discrepancy sequences, as sample points for evaluating integrals which are used to simulate a number of computer graphic techniques, including soft shadows generated for scenes illuminated by a light source having a finite extent, such as a disk, simulation of depth of field; motion blur; and jittering. The computer graphics system uses the low-discrepancy sequence to generate sample points. The low discrepancy sequences ensure that the sample points are evenly distributed over a respective region or time interval, thereby reducing error in the image which can result from clumping of such sample points which can occur in the Monte Carlo technique. The invention facilitates the generation of images of improved quality when using the same number of sample points at the same computational cost as in the Monte Carlo technique.

A method of providing delay information in a multi-antenna transmission system is provided. A time delay value is selected from a set of time delay values. A mobile station is informed of information related to the selected time delay value. The same data is transmitted from a first antenna and from a second antenna. The data is transmitted from the second antenna after the data is transmitted from the first antenna according to the selected time delay value. The time delay value is selected based on a deterministic method or a random method.

A method to detect a lost status report determines that a second status report is required when an AMD PDU not negatively acknowledged in the first status report, an AMD PDU with a polling bit set, or the last negatively acknowledged AMD PDU is received after the expiry of a roundtrip timer and before all the negatively acknowledged AMD PDUs in the first status report are received. The method provides a deterministic way of detecting a lost status report, resulting in improved transmission throughput in a wireless communications system.

A device for carrying out a cryptographic method has an input interface for receiving input data, an output interface for outputting output data, and a cryptographic unit for carrying out the cryptographic method. A first functional unit is provided which is designed to convert at least a portion of the input data into transformed input data using a first deterministic method, and to supply the transformed input data to the cryptographic unit, and/or a second functional unit is provided which is designed to convert at least a portion of output data of the cryptographic unit into transformed output data using a second deterministic method, and to supply the transformed output data to the output interface.

A method and a system for generating prime numbers and testing for primality of an integer. This invention has applicability to “public key” and other encryption techniques that play an important role in the security of information technology and electronic commerce. Generation of prime numbers requires the step of testing the primality. The method includes a deterministic test for testing the primality of a number in polynomial time. The system comprises a random number generator and a primality tester. The random number generator generates a random number and the primality tester tests the primality of this random number. The primality tester can also be used independent of the random number generator. In such a case, the number whose primality is to be tested can be input via a user interface.

In a method for the secure, distributed generation of an encryption key for a cryptographic method, where the encryption key, as well as a public key are generated using deterministic methods from a large random number (seed), the seed (S) is generated on the user side by consulting variables known only to the user, and a public key (V) that is transmitted in advance from the trust center. Generation information suitable for generating the seed and, on the basis of which, the seed is able to be derived deterministically from the trust center, by consulting information known only to the center, is produced on the user side, and transmitted to the trust center to create the seed in parallel.

The invention discloses a millimeter wave phased array test and calibration method, relates to a millimeter wave phased array calibrated error characteristic analysis and especially relates to the channel inconsistency of a phased-array antenna and a method for calculating element antenna phase center offset. The method comprises: step1, correlation functions including phased-array antenna channel inconsistency and element antenna phase center offset are established according to a phased-array antenna pattern obtained in the test; step2, range space decomposition is performed on an optimized target parameter; and step3, the range corresponding to the strong spatial spectrum component is calculated by adopting a deterministic method, and the range corresponding to the weak spatial spectrum component is optimized by adopting a genetic algorithm. According to the invention, the calibration of the phased array pointing accuracy can be realized under a condition of less test work, the test workload is greatly reduced, the labor, material resources and working time are saved, a complex and precise flat scanning frame is not needed to use, and the complexity and input cost of the system are reduced.

A system and method for generating sample points that can generate the sample points in parallel. The sample points can be used in processing in parallel, with the results subsequently collected and used as necessary in subsequent rendering operations. Sample points are generated using a coarse Halton sequence, which makes use of coarse radical inverse values Φ_b^i,M(j) as follows:

Φ_b^i,M(j)=Φ_b(jM+i)

where base “b” is preferably a prime number, but not a divisor of “M,” and “i” is an integer. Using this definition, the s-dimensional coarse Halton sequence U_S^CHal,i,M, which may be used to define sample points for use in evaluating integrals, is defined as

U_s^CHal,i,M=(Φ_b1^i,M(j), . . . , Φ_{b<sub2>s</sub2>}^i,M(j))

where b₁, . . . , b_s are the first “s” prime numbers that are not divisors of “M.” Each value of “i” defines a subsequence that is a low-discrepancy sequence, and so can be used in connection with processing. Similarly, the union of all subsequences for all values of “i” between “zero” and “M−1” is also a low-discrepancy sequence, so results of processing using the coarse Halton sequences for all such values of “i” can be collected together and used in the same manner as if the results had been generated using a Halton sequence to define the sample points.