bluuebunny/crossref_metadata_2025 huggingface dataset:
Learning to predict protein–protein interactions from protein sequences
Authors: Gomez Shawn M. , Noble William Stafford , Rzhetsky Andrey
Published: October 2003

In order to understand the molecular machinery of the cell, we need to know about the multitude of protein–protein interactions that allow the cell to function. High-throughput technologies provide some data about these interactions, but so far that data is fairly noisy. Therefore, computational techniques for predicting protein–protein interactions could be of significant value. One approach to predicting interactions in silico is to produce from first principles a detailed model of a candidate interaction. We take an alternative approach, employing a relatively simple model that learns dynamically from a large collection of data. In this work, we describe an attraction–repulsion model, in which the interaction between a pair of proteins is represented as the sum of attractive and repulsive forces associated with small, domain- or motif-sized features along the length of each protein. The model is discriminative, learning simultaneously from known interactions and from pairs of proteins that are known (or suspected) not to interact. The model is efficient to compute and scales well to very large collections of data. In a cross-validated comparison using known yeast interactions, the attraction–repulsion method performs better than several competing techniques.
Automatic discovery and classification of bioinformatics Web sources
Authors: Rocco Daniel , Critchlow Terence
Published: October 2003

Motivation: The World Wide Web provides an incredible resource to genomics researchers in the form of query access to distributed data sources—e.g. BLAST sequence homology search interfaces. The number of these autonomous sources and their rate of change outpaces the speed at which they can be manually classified, meaning that the available data is not being utilized to its full potential. Manually maintaining a wrapper library will not scale to accommodate the growth of genomics data sources on the Web, challenging us to produce an automated system that can find, classify and wrap new sources without constant human intervention. Previous research has not addressed the problem of automatically locating, classifying and integrating classes of bioinformatics data sources.

Results: This paper presents an overview of a system for finding classes of bioinformatics data sources and integrating them behind a unified interface. We describe our approach for automatic classification of new Web sources into relevance categories that eliminates the human effort required to maintain a current repository of sources. Our approach is based on a meta-data description of classes of interesting sources that describes the important features of an entire class of services without tying that description to any particular Web source. We examine the features of this format in the context of BLAST sources to show how it relates to Web sources that are being described. We then show how a description can be used to determine if an arbitrary Web source is an instance of the described service. To validate the effectiveness of this approach, we have constructed a prototype that correctly classifies approximately two-thirds of the BLAST sources we tested. We conclude with a discussion of these results, the factors that affect correct automatic classification and areas for future study.
Greedily building protein networks with confidence
Authors: Bader Joel S.
Published: October 2003

Motivation: With genome sequences complete for human and model organisms, it is essential to understand how individual genes and proteins are organized into biological networks. Much of the organization is revealed by proteomics experiments that now generate torrents of data. Extracting relevant complexes and pathways from high-throughput proteomics data sets has posed a challenge, however, and new methods to identify and extract networks are essential. We focus on the problem of building pathways starting from known proteins of interest.

Results: We have developed an efficient, greedy algorithm, SEEDY, that extracts biologically relevant biological networks from protein–protein interaction data, building out from selected seed proteins. The algorithm relies on our previous study establishing statistical confidence levels for interactions generated by two-hybrid screens and inferred from mass spectrometric identification of protein complexes. We demonstrate the ability to extract known yeast complexes from high-throughput protein interaction data with a tunable parameter that governs the trade-off between sensitivity and selectivity. DNA damage repair pathways are presented as a detailed example. We highlight the ability to join heterogeneous data sets, in this case protein–protein interactions and genetic interactions, and the appearance of cross-talk between pathways caused by re-use of shared components.

Significance and comparison: The significance of the SEEDY algorithm is that it is fast, running time O[(E + V) log V] for V proteins and E interactions, a single adjustable parameter controls the size of the pathways that are generated, and an associated P-value indicates the statistical confidence that the pathways are enriched for proteins with a coherent function. Previous approaches have focused on extracting sub-networks by identifying motifs enriched in known biological networks. SEEDY provides the complementary ability to perform a directed search based on proteins of interest.

Availability: SEEDY software (Perl source), data tables and confidence score models (R source) are freely available from the author.
Gene Expression Profiles in the Brain Predict Behavior in Individual Honey Bees
Authors: Whitfield Charles W. , Cziko Anne-Marie , Robinson Gene E.
Published: October 2003

We show that the age-related transition by adult honey bees from hive work to foraging is associated with changes in messenger RNA abundance in the brain for 39% of ∼5500 genes tested.This result, discovered using a highly replicated experimental design involving 72 microarrays, demonstrates more extensive genomic plasticity in the adult brain than has yet been shown.Experimental manipulations that uncouple behavior and age revealed that messenger RNA changes were primarily associated with behavior.Individual brain messenger RNA profiles correctly predicted the behavior of 57 out of 60 bees, indicating a robust association between brain gene expression in the individual and naturally occurring behavioral plasticity.
Does Rejection Hurt? An fMRI Study of Social Exclusion
Authors: Eisenberger Naomi I. , Lieberman Matthew D. , Williams Kipling D.
Published: October 2003

A neuroimaging study examined the neural correlates of social exclusion and tested the hypothesis that the brain bases of social pain are similar to those of physical pain. Participants were scanned while playing a virtual ball-tossing game in which they were ultimately excluded. Paralleling results from physical pain studies, the anterior cingulate cortex (ACC) was more active during exclusion than during inclusion and correlated positively with self-reported distress. Right ventral prefrontal cortex (RVPFC) was active during exclusion and correlated negatively with self-reported distress. ACC changes mediated the RVPFC-distress correlation, suggesting that RVPFC regulates the distress of social exclusion by disrupting ACC activity.
Impressions of Watson Through 50 Years
Authors: Koshland D. E.
Published: October 2003

Inspiring Science
Jim Watson and the Age of DNA. John R. Inglis, Joseph Sambrook, and Jan A. Witkowski, Eds. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY, 2003. 535 pp. $35, £19.99. ISBN 0-87969-698-2.

In a series of essays, 43 of Watson's colleagues offer personal perspectives on his achievements as a researcher, educator, author, and administrator.
Wada Basins and Unpredictability in Hamiltonian and Dissipative Systems
Authors: Aguirre Jacobo , Vallejo Juan Carlos , Sanjuan Miguel A. F.
Published: October 2003

Prediction is one of the fundamental goals of science. When prediction is lost, it can be thought that one of the foundations of science is shattered. The notion of a chaotic system and the sensitive dependence on initial conditions implies a certain lack of prediction on the time evolution along an orbit. However we do not speak here about this temporal prediction, but about an extreme dependence on the initial conditions that fractal structures in phase space impose, and that obstructs the prediction of the final state of the system.
A New Kind of Localized Excitations for a Large Class of (2+1)-Dimensional Systems
Authors: Tang X. Y. , Lin J. , Qian X. M. , Lou S. Y.
Published: October 2003

To discover the localized excitations as many as possible in nonlinear systems is a very meaningful aspect in nonlinear science. This paper is devoted to exhibiting a new kind of localized excitation which exists in a class of (2+1)-dimensional systems.
New Multi-Soliton Solutions of the (2+1)-Dimensional Breaking Soliton Equations
Authors: Zhang Jie-Fang , Heng Chun-Long
Published: October 2003

A simple and direct method is used to solve the (2+1)-dimensional breaking soliton equations: qt=iqxy-2iq∫(qr)ydx, rt=-irxy+2ir∫(qr)ydx. This technique yields a simplified form of the (2+1)-dimensional breaking soliton equations by use of a special Bäcklund transformation and a variable separation solution of this model is derived. Some special types of multi-soliton structure are constructed by selecting the arbitrary functions and arbitrary constants appropriately.
Chaotic Phase Synchronization in a System of Three Lasers
Authors: Zhu Shiqun , Fang Jianxing , Chen Xianfeng
Published: October 2003

Three solid state lasers that are coupled mutually on a straight line is investigated. It is shown that the phase of the laser fields is chaotically synchronizated with intermediate coupling while the laser intensities are totally chaotic and chaotically synchronized. The phase differences in the fields between three lasers show rich patterns when the coupling is changed.
High-Order Finite Element Methods for Acoustic Problems
Authors: Harari Isaac , Avraham Danny
Published: October 2003

The goal of this work is to design and analyze quadratic finite elements for problems of time-harmonic acoustics, and to compare the computational efficiency of quadratic elements to that of lower-order elements. Non-reflecting boundary conditions yield an equivalent problem in a bounded region which is suitable for domain-based computation of solutions to exterior problems. Galerkin/least-squares technology is utilized to develop robust methods in which stability properties are enhanced while maintaining higher-order accuracy. The design of Galerkin/least-squares methods depends on the order of interpolation employed, and in this case quadratic elements are designed to yield dispersion-free solutions to model problems. The accuracy of Galerkin/least-squares and traditional Galerkin elements is compared, as well as the accuracy of quadratic versus standard linear interpolation, incorporating the effects of representing the radiation condition in exterior problems. The efficiency of the various methods is measured in terms of the cost of computation, rather than resolution requirements. In this manner, clear guidelines for selecting the order of interpolation are derived. Numerical testing validates the superior performance of the proposed methods. This work is a first step to gaining a thorough analytical understanding of the performance of p refinement as a basis for the development of h-p finite element methods for large-scale computation of solutions to acoustic problems.
A Parallel Spectral Element Method for Acoustic Wave Modeling
Authors: Seriani Géza
Published: October 2003

The finite element method is well reputed for its great flexibility in solving problems with complex geometries and heterogeneous structures, but, in its classical form, it has fairly low accuracy and poor computational efficiency. This makes an adverse impact on a large-scale numerical simulation of acoustic wavefield propagation. It has been shown by the author and his co-workers that the spectral approach, based on the use of high-order orthogonal interpolating functions (the Spectral Element Method), yields high accuracy with almost no numerical artifacts; it also significantly reduces the simulation computing costs. In this paper, the method is presented in conjunction with an iterative solution technique in such a way that it fully exploits the currently available parallel computers. The underlying algorithm is based on the observations that the assembly of mass and stiffness matrices is not really needed, and that the matrix-vector product required for the iterations can be done concurrently via an element-by-element approach. Moreover, by using a tensor-product sum-factorization scheme, computational and storage requirements can be further reduced as neither element nor global matrices are ever formed. The method is tested on the Cray T3D MPP computer, and its parallel efficiency and speed performance are discussed.
Non-Reflecting Finite Element Schemes for Three-Dimensional Acoustic Waves
Authors: Patlashenko Igor , Givoli Dan
Published: October 2003

The finite element solution of problems involving three-dimensional acoustic waves in an infinite wave guide, and in the infinite medium around a structure is considered. Such problems are typical in structural acoustics, and this paper concentrates on the efficient numerical treatment of the infinite acoustic medium away from the structure. The unbounded domain is truncated by means of an artificial boundary ℬ. On ℬ, non-reflecting boundary conditions are used; these are either nonlocal Dirichlet-to-Neumann conditions, or their localized counterparts. For the high-order localized conditions, special three-dimensional finite elements are constructed for use in the layer adjacent to ℬ. The performance of the nonlocal and localized boundary conditions is compared via numerical experiments involving a three-dimensional wave guide.
Simultaneous Characterization of Source, Array and Environment Using A Ray Travel-Time Inversion Approach
Authors: Lu I-Tai
Published: October 2003

This paper presents a new ray travel-time inversion scheme not only for localizing the source and calibrating the array position, but also for characterizing environmental parameters such as sound speed profiles (in both water column and sediment), bathymetry, etc. Special attention is given to link the unknowns to good physical observables in order to enhance robustness and efficiency. Numerical studies show the algorithm is indeed extremely efficient. The algorithm is also shown to be insensitive to model mismatch and to yield quite accurate results. This paper also focuses on specific Lincoln-Sea application and analysis of a specific data set from Iceshelf-89.
The Effect of Variations in Trunk Models in Predicting Muscle Strength and Spinal Loading
Authors: Parnianpour M. , Wang J. L , Shirazi-Adl A. , Sparto P. , Wilke H.-J.
Published: October 2003

A unified modeling technique is proposed to predict the strength contour of trunk muscles during isometric exertions, which can identify the feasibility of task performance and quantify the utilization ratio for assessment of risk of development of muscular fatigue and over-exertion injury. In addition, the proposed model can estimate the joint reaction forces during performance of the feasible complex loading task in upright standing. Six anatomical models and six cost functions suggested by various research groups were considered in determining their effects on the predicted three-dimensional strength and lumbar intervertebral joint reaction forces obtained using linear and nonlinear optimizations. The present investigation has shown the importance of the fidelity of anatomical models used in estimation of spinal loading and trunk strength. The effect of cost functions on estimated compression and anterior-posterior shear forces was statistically significant. These models can assist in identifying the injurious tasks that must be ergonomically modified to prevent the risk of occupationally related low back injuries.
Post-Laminectomy Swan Neck Deformity in Adults - Report of 20 Cases
Authors: Moon M.-S. , Ha K.-Y. , Moon J.-L. , Moon Y-W. , Kim S.-S.
Published: October 2003

A retrospective study of anterior cervical fusion in post-laminectomy swan-neck deformity was carried out, the objective being to observe the effect of anterior interbody fusion on the post-laminectomy swan-neck deformity. Independent segmental interbody fusion procedure was more effective than that of the multi-joint single graft fusion in correcting the deformed cervical spine. However, there was more loss of correction as well as a slightly higher fusion failure in the former procedure than the latter.
Collective Choice and Mutual Knowledge Structures
Authors: Richards Diana , McKay Brendan D. , Richards Whitman A.
Published: October 2003

The conditions under which the aggregation of information from interacting agents results in a stable or an unstable collective outcome is an important puzzle in the study of complex systems. We show that if a complex system of aggregated choice respects a mutual knowledge structure, then the prospects of a stable collective outcome are considerably improved. Our domain-independent results apply to collective choice ranging from perception, where an interpretation of sense data is made by a collection of perceptual modules, to social choice, where a group decision is made from a set of preferences held by individuals.
Spatially Distributed Naming Games
Authors: Steels Luc , McIntyre Angus
Published: October 2003

The paper investigates the dynamical properties of spatially distributed naming games. Naming games are interactions between two agents, a speaker and a hearer, in which the speaker identifies an object using a name. Adaptive naming games imply that speaker and hearer update their lexicons to become better in future games. By engaging in adaptive naming games, a coherent shared vocabulary arises through self-organisation in a population of distributed agents. When the agents are spatially distributed, diversity can be shown to arise, and changes, in population contact lead to language changes.
Graphcut textures
Authors: Kwatra Vivek , Schödl Arno , Essa Irfan , Turk Greg , Bobick Aaron
Published: October 2003

In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output and then stitched together along optimal seams to generate a new (and typically larger) output. In contrast to other techniques, the size of the patch is not chosena-priori, but instead agraph cuttechnique is used to determine the optimal patch region for any given offset between the input and output texture. Unlike dynamic programming, our graph cut technique for seam optimization is applicable in any dimension. We specifically explore it in 2D and 3D to perform video texture synthesis in addition to regular image synthesis. We present approximative offset search techniques that work well in conjunction with the presented patch size optimization. We show results for synthesizing regular, random, and natural images and videos. We also demonstrate how this method can be used to interactively merge different images to generate new scenes.
Rhythmic-motion synthesis based on motion-beat analysis
Authors: Kim Tae-hoon , Park Sang Il , Shin Sung Yong
Published: October 2003

Real-time animation of human-like characters is an active research area in computer graphics. The conventional approaches have, however, hardly dealt with the rhythmic patterns of motions, which are essential in handling rhythmic motions such as dancing and locomotive motions. In this paper, we present a novel scheme for synthesizing a new motion from unlabelled example motions while preserving their rhythmic pattern. Our scheme first captures the motion beats from the example motions to extract the basic movements and their transitions. Based on those data, our scheme then constructs a
movement transition graph
that represents the example motions. Given an input sound signal, our scheme finally synthesizes a novel motion in an on-line manner while traversing the motion transition graph, which is synchronized with the input sound signal and also satisfies kinematic constraints given explicitly and implicitly. Through experiments, we have demonstrated that our scheme can effectively produce a variety of rhythmic motions.
Progressive encoding of complex isosurfaces
Authors: Lee Haeyoung , Desbrun Mathieu , Schröder Peter
Published: October 2003

We present a progressive encoding technique specifically designed for complex isosurfaces. It achieves better rate distortion performance than all standard mesh coders, and even improves on all previous single rate isosurface coders. Our novel algorithm handles isosurfaces with or without sharp features, and deals gracefully with high topologic and geometric complexity. The inside/outside function of the volume data is progressively transmitted through the use of an adaptive octree, while a local frame based encoding is used for the fine level placement of surface samples. Local patterns in topology and local smoothness in geometry are exploited by context-based arithmetic encoding, allowing us to achieve an average of 6.10 bits per vertex (b/v) at very low distortion. Of this rate only 0.65 b/v are dedicated to connectivity data: this improves by 24% over the best previous single rate isosurface encoder.
Shadow matting and compositing
Authors: Chuang Yung-Yu , Goldman Dan B , Curless Brian , Salesin David H. , Szeliski Richard
Published: October 2003

In this paper, we describe a method for extracting shadows from one natural scene and inserting them into another. We develop physically-based shadow matting and compositing equations and use these to pull a
shadow matte
from a source scene in which the shadow is cast onto an arbitrary planar background. We then acquire the photometric and geometric properties of the target scene by sweeping oriented linear shadows (cast by a straight object) across it. From these shadow scans, we can construct a shadow displacement map without requiring camera or light source calibration. This map can then be used to deform the original shadow matte. We demonstrate our approach for both indoor scenes with controlled lighting and for outdoor scenes using natural lighting.
A geometry-based soft shadow volume algorithm using graphics hardware
Authors: Assarsson Ulf , Akenine-Möller Tomas
Published: October 2003

Most previous soft shadow algorithms have either suffered from aliasing, been too slow, or could only use a limited set of shadow casters and/or receivers. Therefore, we present a strengthened soft shadow volume algorithm that deals with these problems. Our critical improvements include robust penumbra wedge construction, geometry-based visibility computation, and also simplified computation through a four-dimensional texture lookup. This enables us to implement the algorithm using programmable graphics hardware, and it results in images that most often are indistinguishable from images created as the average of 1024 hard shadow images. Furthermore, our algorithm can use both arbitrary shadow casters and receivers. Also, one version of our algorithm completely avoids sampling artifacts which is rare for soft shadow algorithms. As a bonus, the four-dimensional texture lookup allows for small textured light sources, and, even video textures can be used as light sources. Our algorithm has been implemented in pure software, and also using the GeForce FX emulator with pixel shaders. Our software implementation renders soft shadows at 0.5--5 frames per second for the images in this paper. With actual hardware, we expect that our algorithm will render soft shadows in real time. An important performance measure is bandwidth usage. For the same image quality, an algorithm using the accumulated hard shadow images uses almost two orders of magnitude more bandwidth than our algorithm.
Free-viewpoint video of human actors
Authors: Carranza Joel , Theobalt Christian , Magnor Marcus A. , Seidel Hans-Peter
Published: October 2003

In free-viewpoint video, the viewer can interactively choose his viewpoint in 3-D space to observe the action of a dynamic real-world scene from arbitrary perspectives. The human body and its motion plays a central role in most visual media and its structure can be exploited for robust motion estimation and efficient visualization. This paper describes a system that uses multi-view synchronized video footage of an actor's performance to estimate motion parameters and to interactively re-render the actor's appearance from any viewpoint.The actor's silhouettes are extracted from synchronized video frames via background segmentation and then used to determine a sequence of poses for a 3D human body model. By employing multi-view texturing during rendering, time-dependent changes in the body surface are reproduced in high detail. The motion capture subsystem runs offline, is non-intrusive, yields robust motion parameter estimates, and can cope with a broad range of motion. The rendering subsystem runs at real-time frame rates using ubiquous graphics hardware, yielding a highly naturalistic impression of the actor. The actor can be placed in virtual environments to create composite dynamic scenes. Free-viewpoint video allows the creation of camera fly-throughs or viewing the action interactively from arbitrary perspectives.
Continuous capture of skin deformation
Authors: Sand Peter , McMillan Leonard , Popović Jovan
Published: October 2003

We describe a method for the acquisition of deformable human geometry from silhouettes. Our technique uses a commercial tracking system to determine the motion of the skeleton, then estimates geometry for each bone using constraints provided by the silhouettes from one or more cameras. These silhouettes do not give a complete characterization of the geometry for a particular point in time, but when the subject moves, many observations of the same local geometries allow the construction of a complete model. Our reconstruction algorithm provides a simple mechanism for solving the problems of view aggregation, occlusion handling, hole filling, noise removal, and deformation modeling. The resulting model is parameterized to synthesize geometry for new poses of the skeleton. We demonstrate this capability by rendering the geometry for motion sequences that were not included in the original datasets.
Relighting with 4D incident light fields
Authors: Masselus Vincent , Peers Pieter , Dutré Philip , Willems Yves D.
Published: October 2003

We present an image-based technique to relight real objects illuminated by a 4D incident light field, representing the illumination of an environment. By exploiting the richness in angular and spatial variation of the light field, objects can be relit with a high degree of realism.We record photographs of an object, illuminated from various positions and directions, using a projector mounted on a gantry as a moving light source. The resulting basis images are used to create a subset of the full reflectance field of the object. Using this reflectance field, we can create an image of the object, relit with any incident light field and observed from a flxed camera position.To maintain acceptable recording times and reduce the amount of data, we propose an efficient data acquisition method.Since the object can be relit with a 4D incident light field, illumination effects encoded in the light field, such as shafts of shadow or spot light effects, can be realized.
Smoke simulation for large scale phenomena
Authors: Rasmussen Nick , Nguyen Duc Quang , Geiger Willi , Fedkiw Ronald
Published: October 2003

In this paper, we present an efficient method for simulating highly detailed large scale participating media such as the nuclear explosions shown in figure 1. We capture this phenomena by simulating the motion of particles in a fluid dynamics generated velocity field. A novel aspect of this paper is the creation of highly detailed three-dimensional turbulent velocity fields at interactive rates using a low to moderate amount of memory. The key idea is the combination of two-dimensional high resolution physically based flow fields with a moderate sized three-dimensional Kolmogorov velocity field tiled periodically in space.
A data-driven reflectance model
Authors: Matusik Wojciech , Pfister Hanspeter , Brand Matt , McMillan Leonard
Published: October 2003

We present a generative model for isotropic bidirectional reflectance distribution functions (BRDFs) based on acquired reflectance data. Instead of using analytical reflectance models, we represent each BRDF as a dense set of measurements. This allows us to interpolate and extrapolate in the space of acquired BRDFs to create new BRDFs. We treat each acquired BRDF as a single high-dimensional vector taken from a space of all possible BRDFs. We apply both linear (subspace) and non-linear (manifold) dimensionality reduction tools in an effort to discover a lower-dimensional representation that characterizes our measurements. We let users define perceptually meaningful parametrization directions to navigate in the reduced-dimension BRDF space. On the low-dimensional manifold, movement along these directions produces novel but valid BRDFs.
Coherent stylized silhouettes
Authors: Kalnins Robert D. , Davidson Philip L. , Markosian Lee , Finkelstein Adam
Published: October 2003

We describe a way to render stylized silhouettes of animated 3D models with temporal coherence. Coherence is one of the central challenges for non-photorealistic rendering. It is especially difficult for silhouettes, because they may not have obvious correspondences between frames. We demonstrate various coherence effects for stylized silhouettes with a robust working system. Our method runs in real-time for models of moderate complexity, making it suitable for both interactive applications and offline animation.
Realistic modeling of bird flight animations
Authors: Wu Jia-chi , Popović Zoran
Published: October 2003

In this paper we describe a physics-based method for synthesis of bird flight animations. Our method computes a realistic set of wingbeats that enables a bird to follow the specified trajectory. We model the bird as an articulated skeleton with elastically deformable feathers. The bird motion is created by applying joint torques and aerodynamic forces over time in a forward dynamics simulation. We solve for each wingbeat motion separately by optimizing for wingbeat parameters that create the most natural motion. The final animation is constructed by concatenating a series of optimal wingbeats. This detailed bird flight model enables us to produce flight motions of different birds performing a variety of maneuvers including taking off, cruising, rapidly descending, turning, and landing.
Sparse matrix solvers on the GPU
Authors: Bolz Jeff , Farmer Ian , Grinspun Eitan , Schröder Peter
Published: October 2003

Many computer graphics applications require high-intensity numerical simulation. We show that such computations can be performed efficiently on the GPU, which we regard as a full function
streaming
processor with high floating-point performance. We implemented two basic, broadly useful, computational kernels: a
sparse matrix conjugate gradient solver
and a regular-grid
multigrid solver
. Real time applications ranging from mesh smoothing and parameterization to fluid solvers and solid mechanics can greatly benefit from these, evidence our example applications of geometric flow and fluid simulation running on NVIDIA's GeForce FX.
Non-iterative, feature-preserving mesh smoothing
Authors: Jones Thouis R. , Durand Frédo , Desbrun Mathieu
Published: October 2003

With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a
non-iterative
feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.
When is a user not a user?
Authors: Marcus Aaron
Published: October 2003

Our profession is debating hotly our professional objectives, techniques, and terminology. User-interface design speaks of users, design, and computer-based systems. Are there terms that would be more helpful to convey the right meaning of users, design, and user-interfaces? For that matter, what should we call ourselves and what we do?
Security and privacy issues of handheld and wearable wireless devices
Authors: Di Pietro Roberto , Mancini Luigi V.
Published: October 2003

The distinguished capabilities of these devices are also the very reasons they require security and privacy protections of an unprecedented scale.
Introduction
Authors: Devlin Keith
Published: October 2003

The main benefit of learning and doing mathematics is that it develops the ability to reason about formally defined abstract structures like those in computer science and its applications.
What is the attraction to computing?
Authors: Almstrum Vicki L.
Published: October 2003

The strongest motivators include a sense of accomplishment from solving problems and programming; the weakest include being captivated by the Web and a passion for playing computer games.
Progressive point set surfaces
Authors: Fleishman Shachar , Cohen-Or Daniel , Alexa Marc , Silva Cláudio T.
Published: October 2003

Progressive point set surfaces (PPSS) are a multilevel point-based surface representation. They combine the usability of multilevel scalar displacement maps (e.g., compression, filtering, geometric modeling) with the generality of point-based surface representations (i.e., no fixed homology group or continuity class). The multiscale nature of PPSS fosters the idea of
point-based modeling.
The basic building block for the construction of PPSS is a projection operator, which maps points in the proximity of the shape onto local polynomial surface approximations. The projection operator allows the computing of displacements from smoother to more detailed levels. Based on the properties of the projection operator we derive an algorithm to construct a base point set. Starting from this base point set, a refinement rule using the projection operator constructs a PPSS from any given manifold surface.
Test vector decomposition-based static compaction algorithms for combinational circuits
Authors: El-Maleh Aiman H. , Osais Yahya E.
Published: October 2003

Testing system-on-chips involves applying huge amounts of test data, which is stored in the tester memory and then transferred to the chip under test during test application. Therefore, practical techniques, such as test compression and compaction, are required to reduce the amount of test data in order to reduce both the total testing time and memory requirements for the tester. In this article, a new approach to static compaction for combinational circuits, referred to as
test vector decomposition (TVD)
, is proposed. In addition, two new TVD based static compaction algorithms are presented. Experimental results for benchmark circuits demonstrate the effectiveness of the two new static compaction algorithms.
Robots, after all
Authors: Moravec Hans
Published: October 2003

Artificial minds for mechanical bodies capable of autonomous manual work finally seem within reach.
The next step in Web services
Authors: Curbera Francisco , Khalaf Rania , Mukhi Nirmal , Tai Stefan , Weerawarana Sanjiva
Published: October 2003

How three specifications support creating robust service compositions.
Contracts and types
Authors: Meredith L. G. , Bjorg Steve
Published: October 2003

Addressing the need for a more formal account of service descriptions and service contracts with a mobile process algebra.
Variance with alternative scramblings of digital nets
Authors: Owen Art B.
Published: October 2003

There have been many proposals for randomizations of digital nets. Some of those proposals greatly reduce the computational burden of random scrambling. This article compares the sampling variance under different scrambling methods. Some scrambling methods adversely affect the variance, even to the extent of deteriorating the rate at which variance converges to zero. Surprisingly, a new scramble proposed here, has the effect of improving the rate at which the variance converges to zero, but so far, only for one dimensional integrands. The mean squared
L
2
discrepancy is commonly used to study scrambling schemes. In this case, it does not distinguish among some scrambles with different convergence rates for the variance.
Developmental influences on auditory perception in female zebra finches - is there a sensitive phase for song preference learning?
Authors: Riebel Katharina
Published: October 2003

Song plays an important role in mate choice in oscine songbirds. Male advertising song is culturally transmitted resulting in individual- or population-specific song variants. Evidence is accumulating that female song preferences are influenced by those song variants they experienced when young, but the nature and timing of the acquisition process itself is still poorly understood. Song acquisition (as well as sexual imprinting) has been studied in more detail in zebra finches (Taeniopygia guttata) than in any other songbird species, making it timely to review the consequences of early exposure on female song perception in this species. The current literature provides substantial evidence not only for preference learning but also for exposure-dependent perceptual fine-tuning. Sensitivity for song preference learning changes over the course of development. Preference learning does not seem to occur earlier than 25 days of age (hence paralleling the time course for song acquisition in males), but a potential endpoint is currently less obvious. However, studies so far have focussed on the outcome rather than the process of learning, and thus have not aimed at delineating a sensitive phase. Early acquired song preferences seem highly stable regardless of additional experience, which suggests a self-terminating process as previously found for sexual imprinting. There are still obvious gaps in our understanding of the mechanisms underlying the process of song preference learning, but these seem worthwhile addressing, as the consequences for mate choice might differ dramatically depending on when and from whom learning takes place.
Show me your CDIB
Authors: Hamill James F.
Published: October 2003

Discourse concerning the legitimacy of claims of Indian identity characterize much of the debate in Indian country today. Any legitimate claim to an Indian identity rests, in part, on tribal membership, which requires certification by the U.S. government in the form of a Certified Degree of Indian Blood (CDIB) and a tribal membership identification. Once a person establishes biological heritage with the CDIB, the blood quantum—full, 1/2, 1/256, and so forth—often is taken as a rough measure of “Indianness.” This emphasis on blood quantum has been an important feature of both Indian and Tribal identity in Oklahoma throughout the 20th century. Using data from interviews with Oklahoma Indian people taken in the 1930s, 1960s, and gathered in the field from 1994 on, this report will look at the meaning and importance of blood quantum in Indian identity and how that has been expressed by Indian women and men throughout the past 100 years.
Influence of Simulated Weightlessness on the Oral Pharmacokinetics of Acetaminophen as a Gastric Emptying Probe in Man: A Plasma and a Saliva Study
Authors: Gandia Peggy , Bareille Marie‐Pierre , Saivin Sylvie , Le‐Traon Anne Pavy , Lavit Michel , Guell Antonio , Houin Georges
Published: October 2003

This study evaluated the effect of simulated weightlessness on gastric emptying, using acetaminophen as a probe and −6° head‐down bed rest to simulate zero gravity. Eighteen volunteers were given 1 g of acetaminophen orally before the bed rest and at days 1, 18, and 80. Cmax, tmax, AUC0‐∞, AUC0‐t, and t1/2 were calculated for plasma and saliva. The plasma Cmax showed a significant increase (10.43 μg/mL [day 1] to 14.74 μg/mL [day 80]), while tmax significantly decreased (1.41 h [day 1] to 0.91 h [day 80]). Similar results were obtained with saliva, and there were significant increases in the AUCs. The good correlation between the plasma and saliva data suggests that saliva sampling can be valid for acetaminophen pharmacokinetics. The changes in Cmax and tmax indicated more rapid drug absorption, which could have been as a result of faster gastric emptying or an increased blood flow to the intestine.
Does the Kinin System Mediate in Cardiovascular Abnormalities? An Overview
Authors: Sharma Jagdish N.
Published: October 2003

All the components of the kallikrein‐kinin system are located in the cardiac muscle, and its deficiency may lead to cardiac dysfunction. In recent years, numerous observations obtained from clinical and experimental models of diabetes, hypertension, cardiac failure, ischemia, myocardial infarction, and left ventricular hypertrophy have suggested that the reduced activity of the local kallikrein‐kinin system may be instrumental for the induction of cardiovascular‐related diseases. The cardioprotective property of the angiotensin‐converting enzyme inhibitors is primarily mediated via the kinin‐releasing pathway, which may cause regression of left ventricular hypertrophy in hypertensive situations. The ability of kallikrein gene delivery to produce a wide spectrum of beneficial effects makes it an excellent candidate in treating hypertension and cardiovascular and renal diseases. In addition, stable kinin agonists may also be available in the future as therapeutic agents for cardiovascular and renal disorders.
Immigrant Women Implementing Participatory Research in Health Promotion
Authors: Meyer Mechthild C. , Torres Sara , Cermeño Nubia , MacLean Lynne , Monzón Rosa
Published: October 2003

Few studies on women's health include immigrant women as participants, and fewer are conducted by immigrant women themselves. In this article, the authors present a model that allowed their full participation as researchers and authors. They describe their experiences using participatory research methods with Hispanic women in multiple ways to reach out to isolated women, collect data about community needs, and provide health education. They explore the advantages and challenges of being trained for both researcher and health educator roles, describe opportunities to use this approach to assess service needs, and discuss the potential for personal empowerment. They also report on the time commitment that such a bilingual project requires. In the process of interviewing marginalized women, they realized how much health promotion and participatory research complement each other. The authors conclude that combining participatory research with health promotion activities has promise to contribute toward increased empowerment of immigrant communities.
Preventing Developmental Disabilities and Promoting Maternal and Child Health: Women Organizing for Change
Authors: Wilson Ann M.
Published: October 2003

Mental retardation and related developmental disabilities affect 1.5% of the population in the United States. Efforts to address preventable developmental disabilities—such as those caused by lead poisoning, fetal alcohol syndrome, and traumatic brain injuries—have been the focus of activities in one state for almost 20 years. These efforts were created, and have been organized and sustained, by women. The prevention coalition was established to foster cooperation, identify and develop resources, and advocate for programs, services, and legislation. The coalition further promotes the development of leaders in the human services and public health fields and embraces feminist principles of collaboration, mutual support, nurturance,and self-empowerment in its organizing efforts. Implications for community organizing and development, public awareness and community education around primary prevention issues, legislative advocacy, mentoring and coaching of emerging leaders, community partnerships, and social change are discussed.
Gender Biases in Child Welfare
Authors: Risley-Curtiss Christina , Heffernan Kristin
Published: October 2003

Gender biases are pervasive in child welfare research and practice. Although these biases have been addressed to some extent in the literature, there continues to be a lack of information on fathers and an overrepresentation of information on mothers, and thus the biases continue. This article explores how these biases are currently manifested in both research and practice and makes recommendations for changes in research, policy, and practice.
Intimate Terrorism and Common Couple Violence
Authors: Graham-Kevan Nicola , Archer John
Published: October 2003

This study sought to both replicate and considerably extend the findings of Johnson (1999) that there are two distinct subgroups of physical aggression within relation-ships: intimate terrorism and common couple violence. The present sample consisted of women residing at Women's Aid shelters and their partners (N = 86), male and female students (N = 208), men attending male treatment programs for domestic violence and their partners (N = 8), and male prisoners and their partners (N = 192). Respondents completed measures on physical aggression, injuries sustained, escalation of physical aggression, and controlling behaviors. Cluster analysis was employed to categorize relationships as either intimate terrorism or common couple violence. Frequency analysis showed broad support for Johnson's findings.
Internet-Based Communication in Crisis Management
Authors: Perry Danielle C. , Taylor Maureen , Doerfel Marya L.
Published: October 2003

This article examines how organizations integrate the Internet into crisis communication. Results suggest four findings about Internet usage in crisis. First, a majority of the organizations studied are turning to the Internet to communicate with the public and the news media during a crisis. Second, organizational type does not appear to be a factor in the integration of the Internet in crisis response with financial organizations, new technology organizations, and consumer product organizations as the most frequent adopters. Third, crisis type does not appear to be a factor in an organization’s decision to use the Internet in its immediate crisis response. Fourth, although most organizations are incorporating both traditional and new media communication tactics into their responses to crisis, there is a continued preference for traditional tactics. These findings illustrate how mediated communication may create new possibilities for crisis response and are translated into suggestions for how managers can integrate new media into their mix of communication tactics in crisis management.
Development of the Alcohol and Other Drug Self-Efficacy Scale
Authors: Kranz Katherine M.
Published: October 2003

Objective: This article reports the initial development of the Alcohol and Other Drug Self-Efficacy Scale (AODSES). Method: The scale instrument is designed to measure social workers' perceived self-efficacy of their substance abuse knowledge and skills with MSW practitioners (N =399). Results: Factor analysis revealed six subscale factors in the initial scale development com-posed of 43 items, accounting for 76% of the variance with excellent internal reliabilities. The six subgroup factors were moderately correlated. Conclusions: Given the reliability and validity of the scale, it may be useful in agency settings to evaluate and measure social workers' confidence in treating clients who have alcohol and other drug problems. Replication of the study is a necessary next step with another group of social workers for further external and internal validation.