一篇源于ROMA地形算法的經典論文（英文）：ROAMing Terrain: Real-time Optimally Adapting Meshes
標簽： Optimally Real-time Adapting ROAMing
上傳時間： 2014-01-21
上傳用戶：璇珠官人
The ICA/BSS algorithms are pure mathematical formulas, powerful, but rather mechanical procedures: There is not very much left for the user to do after the machinery has been Optimally implemented. The successful and efficient use of the ICALAB strongly depends on a priori knowledge, common sense and appropriate use of the preprocessing and postprocessing tools. In other words, it is preprocessing of data and postprocessing of models where expertise is truly ne
標簽： mathematical algorithms mechanical procedures
上傳時間： 2015-03-31
上傳用戶：silenthink
The goal of our final project was to design an efficient elevator simulator that can accept input from a user and mechanically operate (on a small scale) a system of 4 floors and 3 elevators using pulleys and stepper motors. Users enter input using physical pushbuttons or the computer. This input is then processed by the MCU and orders are given to the elevators. We attempted to devise an algorithm that can Optimally handle any number of floors. This project seemed like a fun challenge and something that had practical applications. Both of us have been frustrated at times by the inefficiency of some of the elevators here at Cornell, and we wanted to see if we could do a better job.
標簽： efficient simulator elevator project
上傳時間： 2013-11-25
上傳用戶：cjf0304
An Efficient and Effective Detailed Placement Algorithm Global Swap To identify a pair of cells that can be swapped to reduce wirelength (others are fixed). 2. Vertical Swap Swap a cell with a nearby cell in the segment above or below. 3. Local Re-ordering Re-order consecutive cells locally to reduce wirelength. 4. Single-Segment Clustering Place cells Optimally within a segment.
標簽： Algorithm Efficient Effective Placement
上傳時間： 2013-12-18
上傳用戶：ukuk
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem Optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
Commercially available active noise control headphones rely on fixed analog controllers to drive "anti-noise" loudspeakers. Our design uses an adaptive controller to Optimally cancel unwanted acoustic noise. This headphone would be particularly useful for workers who operate or work near heavy machinery and engines because the noise is selectively eliminated. Desired sounds, such as speech and warning signals, are left to be heard clearly. The adaptive control algorithm is implemented on a Texas Instruments (TI™ ) 1 TMS320C30GEL digital signal processor (DSP), which drives a Sony CD550 headphone/microphone system. Our experiments indicate that adaptive noise control results in a dramatic improvement in performance over fixed noise control. This improvement is due to the availability of high-performance programmable DSPs and the self-optimizing and tracking capabilities of the adaptive controller in response to the surrounding noise.
標簽： Commercially controllers headphones available
上傳時間： 2013-12-04
上傳用戶：dyctj
<li id="cqm8c"></li> <li id="cqm8c"></li>