Generating Fractals with SSE/SSE2 You probably have heard about fractals before. They are beautiful pictures such as the one shown above. Any fractal can be described using iterative formulas. So you can generate a fractal by evaluating these formulas and finding the color of each pixel. That is a large Computational task, and drawing a fractal needs a fast CPU and a carefully optimized program.
标签： Generating SSE beautiful Fractals
上传时间： 2016-11-03
上传用户：小鹏
Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and Voronoi diagrams are among the most widely used data structures in the field of Computational Geometry. These are Java-oriented source codes.
标签： Delaunay triangulations triangulation clicking
上传时间： 2013-11-25
上传用户：zhaiye
DEMO_COND demonstrates the role of the condition number of a matrix (with respect to inversion) in the role of linear system solving. Matthias Heinkenschloss Department of Computational and Applied Mathematics Rice University Feb 22, 2001
标签： demonstrates DEMO_COND condition the
上传时间： 2014-01-23
上传用户：lwwhust
Abstract—In this paper, we propose transform-domain algorithms to effectively classify the characteristics of blocks and estimate the strength of the blocky effect. The transform-domain algorithms require much lower Computational complexity and much less memory than the spatial ones. Along with the estimated blocky strength,
标签： transform-domain effectively algorithms Abstract
上传时间： 2017-06-16
上传用户：zukfu
This book is about 3D math, the study of the mathematics behind the geometry of a 3D world. 3D math is related to Computational geometry, which deals with solving geometric problems algorithmically. 3D math and Computational geometry have applications in a wide variety of fields that use computers to model or reason about the world in 3D, such as graphics, games, simulation, robotics, virtual reality, and cinematography. This book covers theory and practice in C++.
标签： the math mathematics 3D
上传时间： 2014-01-23
上传用户：xwd2010
The potential of solving real-time demanding industrial applications, using vision-based algorithms, drastically grew due to an increasing availability of Computational power. In this thesis a novel real-time, vision-based Blackjack analysis system is presented. The embedding of the vision algorithms in a compound system of other information sources such as an electronic chip tray, reduces the vision task to detect cards and chips. Robust results are achieved by not just analyzing single frames but an image stream regarding game-ß ow informations. The requirements for such a system are a highly robust and adaptive behav- ior. This is motivated by the vital interest of casino entrepreneurs in a 100 statistical analysis of their offered gambling in order to support the business plan, measuring table and dealer performance and give accurate player rating. Extensive experiments show the robustness and applicability of the proposed system.
标签： applications vision-based algorithms industrial
上传时间： 2017-08-20
上传用户：liansi
An Overview of Smart Card Security. The smart card, an intelligent token, is a credit card sized plastic card embedded with an integrated circuit chip. It provides not only memory capacity, but Computational capability as well. The self-containment of smart card makes it resistant to attack as it does not need to depend upon potentially vulnerable external resources. Because of this characteristic, smart cards are often used in different applications which require strong security protection and authentication.
标签： card intelligent Overview Security
上传时间： 2017-09-25
上传用户：busterman
We introduce a sub-cell WENO reconstruction method to evaluate spatial derivatives in the high-order ADER scheme. The basic idea in our reconstruction is to use only r stencils to reconstruct the point-wise values of solutions and spatial derivatives for the 2r-1 th order ADER scheme in one dimension, while in two dimensions, the dimension-by-dimension sub-cell reconstruction approach for spatial derivatives is employed. Compared with the original ADER scheme of Toro and Titarev (2002) [2] that uses the direct derivatives of reconstructed polynomials for solutions to evaluate spatial derivatives, our method not only reduces greatly the Computational costs of the ADER scheme on a given mesh, but also avoids possible numerical oscillations near discontinuities, as demonstrated by a number of one- and two-dimensional numerical tests. All these tests show that the 5th-order ADER scheme based on our sub-cell reconstruction method achieves the desired accuracy, and is essentially non-oscillatory and Computationally cheaper for problems with discontinuities.
标签： 高精度格式
上传时间： 2016-01-13
上传用户：ccsdcczd
Computational Fluid Dynamics_ Principles and Applications
标签： CFD
上传时间： 2016-04-06
上传用户：12345678999
Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be an enormous aid to engineers who want to develop an understanding and/or predictive capability for complex behaviors typically observed in the corresponding physical systems. Simulators often serve as virtual prototypes, where a set of predefined system parameters, such as size or location dimensions and material properties, are adjusted to improve the performance of a system, as defined by one or more system performance objectives. Such optimization or tuning of the virtual prototype requires executing the simulator, evaluating performance objective(s), and adjusting the system parameters in an iterative, automated, and directed way. System performance objectives can be formulated, for example, to minimize weight, cost, or defects; to limit a critical temperature, stress, or vibration response; or to maximize performance, reliability, throughput, agility, or design robustness. In addition, one would often like to design computer experiments, run parameter studies, or perform uncertainty quantification (UQ). These approaches reveal how system performance changes as a design or uncertain input variable changes. Sampling methods are often used in uncertainty quantification to calculate a distribution on system performance measures, and to understand which uncertain inputs contribute most to the variance of the outputs. A primary goal for Dakota development is to provide engineers and other disciplinary scientists with a systematic and rapid means to obtain improved or optimal designs or understand sensitivity or uncertainty using simulationbased models. These capabilities generally lead to improved designs and system performance in earlier design stages, alleviating dependence on physical prototypes and testing, shortening design cycles, and reducing product development costs. In addition to providing this practical environment for answering system performance questions, the Dakota toolkit provides an extensible platform for the research and rapid prototyping of customized methods and meta-algorithms
标签： Optimization and Uncertainty Quantification
上传时间： 2016-04-08
上传用户：huhu123456
