Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 730 dari 34197, Total: 341964 data)

Symplectic Rotational Geometry in Human Biomechanics

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 3)
Nomor Halaman : 455-474
Abstraksi Narasi : In this paper we present rotational symplectic geometry for use in modern biomechanics of human motion. Generalized Hamiltonian formalism has been formulated on the configuration manifold consisting of rotational Lie groups. The proposed symplectic biodynamics includes conservative, dissipative, and driving forces and spinal reflex-like servo controls. Reduction of the angular configuration manifold enables topological brain-like control, as well as a subsequent topological analysis.

Accelerating the Nonuniform Fast Fourier Transform

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 3)
Nomor Halaman : 443-454
Abstraksi Narasi : The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the numerical solution of partial differential equations. In a typical problem, one is given an irregular sampling of N data in the frequency domain and one is interested in reconstructing the corresponding function in the physical domain. When the sampling is uniform, the fast Fourier transform (FFT) allows this calculation to be computed in  operations rather than  operations. Unfortunately, when the sampling is nonuniform, the FFT does not apply. Over the last few years, a number of algorithms have been developed to overcome this limitation and are often referred to as {\em nonuniform FFTs} (NUFFTs). These rely on a mixture of interpolation and the judicious use of the FFT on an oversampled grid [A. Dutt and V. Rokhlin, {\em SIAM J.\ Sci.\ Comput.}, 14 (1993), pp. 1368--1383].\ \indent% In this paper, we observe that one of the standard interpolation or ``gridding" schemes, based on Gaussians, can be accelerated by a significant factor without precomputation and storage of the interpolation weights. This is of particular value in two- and three-dimensional settings, saving either  in storage in d dimensions or a factor of about 5--10 in CPU time (independent of dimension).

Single Transferable Votes with Tax Cuts

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 3)
Nomor Halaman : 417-442
Abstraksi Narasi : Some tally methods for preferential elections are discussed from the following point of view: How well do they respect a wish from the voter that subsidiary votes in the ballot cannot hurt the chances of the ballot's top-ranked candidate? The standard variation of single transferable votes (STV) is constructed to obey this principle, but other defects show up, in particular nonmonotonicity, premature eliminations, and free rides. The tax cut algorithm is also an essential part of Meek's modification of STV. Properties of the algorithm are established and other ways to apply it are considered, with the purpose of reducing the election method's weaknesses without losing too many of its strengths.

The Theory of Implementation of Social Choice Rules

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 3)
Nomor Halaman : 377-414
Abstraksi Narasi : Suppose that the goals of a society can be summarized in a social choice rule, i.e., a mapping from relevant underlying parameters to final outcomes. Typically, the underlying parameters (e.g., individual preferences) are unknown to the public authority. The implementation problem is then formulated: Under what circumstances canone design a mechanism so that the unknown information is truthfully elicited and the social optimum ends up being implemented? In designing such a mechanism, appropriate incentives must be given to the agents so that they do not wish to misrepresent their information. The theory of implementation or mechanism design formalizes this ``social engineering' problem and provides answers to the question just posed. I survey the theory of implementation in this article, emphasizing the results under two different benchmarks (that agents have dominant strategies and that they play a Nash equilibrium). Examples discussed include voting, and the allocation of private and public goods under complete and incomplete information.

A Simple Mesh Generator in MATLAB

Nama Pengarang : Per-Olof Persson
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 329-345
Abstraksi Narasi : Creating a mesh is the first step in a wide range of applications, including scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short and simple MATLAB code, described in more detail than usual, so the reader can experiment (and add to the code) knowing the underlying principles. We find the node locations by solving for equilibrium in a truss structure (using piecewise linear force-displacement relations) and reset the topology by the Delaunay algorithm. The geometry is described implicitly by its distance function. In addition to being much shorter and simpler than other meshing techniques, our algorithm typically produces meshes of very high quality. We discuss ways to improve the robustness and the performance, but our aim here is simplicity. Readers can download (and edit) the codes from http://math.mit.edu/~persson/mesh.

An Invitation to Hermite's Integration and Summation: A Comparison between Hermite's and Simpson's Rules

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 311-328
Abstraksi Narasi : Hermite's rule for numerical integration is presented and compared with the more familiar Simpson's rule. Through several examples, the power of Hermite's rule for numerical summation is then demonstrated. It is established that Hermite's rule surpasses Simpson's rule due to better error estimates and due to the fact that Simpson's rule is not easily applicable to numerical summation. For these reasons, it is argued that Hermite's rule should replace Simpson's rule in the undergraduate curriculum. The derivation of Hermite's rule is accessible to undergraduates, and the topic should be included in the undergraduate curriculum.

Testing of Clustering

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 285-308
Abstraksi Narasi : In this work we study the problem of clustering with respect to the diameter and the radius costs: We say that a set X of points in  is $(k,b)-clusterable with respect to the diameter cost if X can be partitioned into k subsets (clusters) so that the distance between every pair of points in each cluster is at most b. In the case of the radius cost we require that all points that belong to the same cluster be at a distance of at most b for some common central point. Here we approach the problem of clustering from within the framework of property testing. In property testing, the goal is to determine whether a given object has a particular property or whether it should be modified significantly so that it obtains the property. In the context of clustering, testing takes on the following form: The algorithm is given parameters k, b, , and , and it can sample from the set of points X. The goal of the algorithm is to distinguish between the case when X is (k,b)-clusterable and the case when X is -far from being -clusterable. By -far from being -clusterable we mean that more than  points should be removed from X so that it becomes -clusterable. In this work we describe and analyze algorithms that use a sample of size polynomial in k and  and independent of |X|. (The dependence on  and on the dimension, d, of the points varies with the different algorithms.) Such algorithms may be especially useful when the set of points X is very large and it may not even be feasible to observe all of it. Our algorithms can also be used to find approximately good clusterings. Namely, these are clusterings of all but an -fraction of the points in X that have optimal (or close to optimal) cost. The benefit of our algorithms is that they construct an implicit representation of such clusterings in time independent of |X|. That is, without actually having to partition all points in X, the implicit representation can be used to answer queries concerning the cluster to which any given point belongs.

Stochastic Models That Separate Fractal Dimension and the Hurst Effect

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 269-282
Abstraksi Narasi : Fractal behavior and long-range dependence have been observed in an astonishing number of physical, biological, geological, and socioeconomic systems. Time series, profiles, and surfaces have been characterized by their fractal dimension, a measure of roughness, and by the Hurst coefficient, a measure of long-memory dependence. Both phenomena have been modeled and explained by self-affine random functions, such as fractional Gaussian noise and fractional Brownian motion. The assumption of statistical self-affinity implies a linear relationship between fractal dimension and Hurst coefficient and thereby links the two phenomena. This article introduces stochastic models that allow for any combination of fractal dimension and Hurst coefficient. Associated software for the synthesis of images with arbitrary, prespecified fractal properties and power-law correlations is available. The new models suggest a test for self-affinity that assesses coupling and decoupling of local and global behavior.

Link Analysis: Hubs and Authorities on the World Wide Web

Nama Pengarang : Chris H. Q. Ding
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 256-268
Abstraksi Narasi : Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between authority and hub webpages on a particular topic by taking into account the structure of the Web graphs formed by the hyperlinks between the webpages. In this paper, we give a detailed analysis of the HITS algorithm through a unique combination of probabilistic analysis and matrix algebra. In particular, we show that to first-order approximation, theranking given by the HITS algorithm is the same as the ranking by counting inbound and outbound hyperlinks. Using Web graphs of different sizes, we also provide experimental results to illustrate the analysis.

Geometric Fourier Analysis of the Conformal Camera for Active Vision

Nama Pengarang : Subekti, Sukono
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 46 (No. 2)
Nomor Halaman : 230-255
Abstraksi Narasi : Suppose one intends to design an active vision system that should perform some artificial intelligence functions. For instance, it should recognize a planar object (or a three-dimensional object containing a piece of a planar surface) in a dynamic scene. Ideally, such a system should be built upon some data model representing visual inputs and algorithms storing, processing, and analyzing visual information that are well adapted to image transformations produced by different perspectives between planar objects and the imaging system. In spite of its importance, this problem remained unsolved until recently. In this article, building on the author's work, projective Fourier analysis for patterns is constructed in the framework of geometric Fourier analysis on groups and homogeneous spaces. It is done by identifying in the conformal camera the group , which gives image projective transformations by acting through linear-fractional mappings on the image plane---homogeneous under the group action. This analysis is being implemented in perspectively adapted digital image processing, and its basic components are tested for binary images in computer simulations. It is recognized that the data model of digital image representation developed in the article is explicitly designed for foveated sensors, the use of which in active vision systems is presently limited due to the lack of such a data model.
← Kembali ke Halaman Utama