ppxscal/embedding_network huggingface dataset:
Health care and services delivery systems as complex adaptive systems
Authors: Joseph Tan, H. Joseph Wen, Neveen Awad
Venue: Communications of the ACM (2005)

Alan Turing and John von Neumann pioneered the study of complex systems. In analyzing feedback processes, they were interested in how complex interacting systems can respond to new information. Among other things, they found that some systems with many interactions among highly differentiated parts can produce surprisingly simple, predictable behavior (such as a programmable mechanical routine or process), while others generate behavior that may be impossible to predict, even though these systems feature simple laws and few actors or agents (such as an evolving living organism).
A massively parallel approach to deformable matching of 3D medical images via stochastic differential equations
Authors: M. Salomon, F. Heitz, G. -R. Perrin, J. -P. Armspach
Venue: Parallel Computing (2005)

The deformable matching of 3D medical images remains a difficult problem due to the high dimension of both geometric transformations and data. The matching problem is usually expressed as the minimization of a highly non-linear energy (objective) function, yielding a hard, computationally intensive, optimization problem. This paper presents a comprehensive parallel approach that yields computation times compatible with clinical routine. The image matching is based on the simulation of stochastic differential equations, enabling the optimization of the global objective function, through an annealing process. The resulting algorithm allows a fully parallel sampling of the parameters to be optimized. Due to the large number of parameters involved in deformable matching, this approach is naturally suited to massively parallel implementations. We present implementation issues and timing analysis on an MIMD parallel processing computer (SGI Origin 2000). The performances of the approach are assessed on real data, using 3D brain MR images from different individuals. Beside yielding accurate registrations, the parallel algorithm exhibits excellent relative speedups.
An astatic phase-locked system for digital signal processors: circuit design and stability
Authors: G. A. Leonov, S. M. Seledzhi
Venue: Automation and Remote Control (2005)

Block-circuits of phase-locked systems, which act as frequency synthesizers and misphasing correctors, for timing oscillators of digital signal processers are designed. The characteristic of the phase detector is determined with a timing pulse multiplier and a low-frequency filter. Astatic correctors are introduced. The global stability of the synthesized system is investigated by the Lyapunov direct method.
Learning and Measuring Specialization in Collaborative Swarm Systems
Authors: Ling Li, Alcherio Martinoli, Yaser S. Abu-Mostafa
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

This paper addresses qualitative and quantitative diversity and specialization issues in the framework of self-organizing, distributed, artificial systems. Both diversity and specialization are obtained via distributed learning from initially homogeneous swarms. While measuring diversity essentially quantifies differences among the individuals, assessing the degree of specialization implies correlation between the swarm's heterogeneity with its overall performance. Starting from the stick-pulling experiment in collective robotics, a task that requires the collaboration of two robots, we abstract and generalize in simulation the task constraints to k robots collaborating sequentially or in parallel. We investigate quantitatively the influence of task constraints and types of reinforcement signals on performance, diversity, and specialization in these collaborative experiments. Results show that, though diversity is not explicitly rewarded in our learning algorithm, even in scenarios without explicit communication among agents the swarm becomes specialized after learning. The degrees of both diversity and specialization are affected strongly by environmental conditions and task constraints. While the specialization measure reveals characteristics related to performance and learning in a clearer way than diversity does, the latter measure appears to be less sensitive to different noise conditions and learning parameters.
Robust Control: A Note on the Timing of Model Uncertainty
Authors: Arnulfo Rodriguez
Venue: Computational Economics (2004)

In this note a one-state, one-control variable quadratic linear problem with robust control and discount factor is developed to examine the optimal response of the first-period control to changes in future model uncertainty. A change in future model uncertainty has an effect on the optimal first-period control response going in the same direction as the one caused by an equal size change in current model uncertainty. However, both analytical and numerical results show that such effect is much lower than the one derived from a change in current model uncertainty. Moreover, such effect is even much lower as the change in model uncertainty moves farther away into the future. Finally, the infinite horizon result confirms the reinforcing nature of the effects on the optimal first-period control response of current and future changes in model uncertainty.
Real-time reflection mapping with parallax
Authors: Jingyi Yu, Jason Yang, Leonard McMillan
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We present a novel algorithm to efficiently render accurate reflections on programmable graphics hardware. Our algorithm overcomes problems that commonly occur in environment mapping such as the lack of motion parallax and inaccuracies when objects are close to the reflectors. In place of a 2D environment map, which only represents points infinitely far away from the reflector, we use six 4D light field slabs to represent the surrounding scene. Each reflected ray is rendered by indexing into these precaptured environment light fields. We are able to render accurate reflections with motion parallax at interactive frame rates independent of the reflector geometry and the scene complexity. Furthermore, we can move the reflectors within a constrained region of space and guarantee that the environment light field provides the necessary rays. We benefit from the programmability of existing graphics hardware to efficiently compute the reflected rays and transform them into the appropriate light field index. We also take advantage of the large texture memories and memory bandwidth available in today's graphics card to store and query hardware-compressed light fields.
Evaluation of extended dictionary-based static code compression schemes
Authors: Martin Thuresson, Per Stenstrom
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

This paper evaluates how much extended dictionary-based code compression techniques can reduce the static code size. In their simplest form, such methods statically identify identical instruction sequences in the code and replace them by a codeword if they yield a smaller code size based on a heuristic. At run-time, the codeword is replaced by a dictionary entry storing the corresponding instruction sequence.Two previously proposed schemes are evaluated. The first scheme, as used in DISE, provides operand parameters to catch a larger number of identical instruction sequences. The second scheme replaces different instruction sequences with the same dictionary entry if they can be derived from it using a bit mask that can cancel out individual instructions. Additionally, this paper offers a third scheme, namely, to combine the two previously proposed schemes along with an off-line algorithm to compress the program. Our data shows that all schemes in isolation improve the compressibility. However, the most important finding is that the number of operand parameters has a significant effect on the compressibility. In addition, our proposed combined scheme can reduce the size of the dictionary and the number of codewords significantly which can enable efficient implementations of extended dictionary-based code compression techniques
A software system for researching of the traction capability of belt transmissions with flexible bandage
Authors: Svetlin Stoyanov, Antoaneta Dobreva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The software system realizes a traction calculation of belt transmissions and presents the results in an analytical and graphical way. The change of the input data occurs in a real time. The user can observe input data's influence over traction capability. Results have been discussed. Conclusions are made.
Regular maps and principal congruence subgroups of Hecke groups
Authors: Ioannis Ivrissimtzis, David Singerman
Venue: European Journal of Combinatorics (2005)

Regular q-valent maps correspond to normal subgroups of the triangle group (2, q, ∞). This group has a representation as the Hecke group Hq which is generated by z → -1/z and z → -1/z+λq, where λq := 2 cos π/q. We investigate the regular maps corresponding to the principal congruence subgroups of Hq. Those of low index give many interesting regular maps.
Realization of Series and Parallel R-L and C-D Impedances Using Single Differential Voltage Current Conveyor
Authors: Mehmet Incekaraoglu, Uğur Çam
Venue: Analog Integrated Circuits and Signal Processing (2005)

In this paper, realization of series and parallel R-L immitances using differential voltage current conveyor (DVCC) is presented. The proposed circuits enable actively simulation series and parallel R-L and (-R)-(-L) immitances. Applying RC:CR transformation to the proposed configurations, series and parallel C-D and (-C)-(-D) simulators can also be realized with the same topology. They employ single DVCC and at most three resistors and one capacitor. No component matching constraints are imposed for the realisations. The performance of the proposed immittance simulators is demonstrated on both a second-order voltage and second-order current-mode filters. PSPICE simulations are given to verify the theoretical analysis.
Improving Asset Management and Order Fulfillment at Deere & Company's C&CE Division
Authors: Loren Troyer, James Smith, Sean Marshall, Elan Yaniv, Sridhar Tayur, Martin Barkman, Alev Kaya, Yong Liu
Venue: Interfaces (2005)

In 2001, Deere's Commercial and Consumer Equipment (C&CE) Division, with growing sales of $3 billion, set out to improve its on-time delivery from plants to dealers and to reduce its inventory while maintaining customer service levels. C&CE used state-of-the-art inventory optimization techniques embedded in SmartOps' multistage inventory planning and optimization (MIPO) product to set trustworthy weekly inventory targets. C&CE used these targets, together with appropriate dealer incentives, to transform to a pull system and exceed its goals. With 2,500 dealers, 100 product families, and a 26-week planning horizon, Deere's application of multiechelon inventory optimization may be the largest example of applied stochastic inventory theory in practice in a multiagent environment. With the enterprise-wide system integration, Deere improved its factories' on-time shipments from 63 percent to 92 percent, while maintaining customer service levels at 90 percent. Between 2001 and 2003, Deere reduced or avoided inventory by $890 million, improving annual shareholder value added (SVA) by $107 million. By the end of 2004, the C&CE Division will exceed its goal in $1 billion of inventory reduction or avoidance, a year ahead of schedule.
Connectivity transformation for mesh metamorphosis
Authors: Minsu Ahn, Seungyong Lee, Hans-Peter Seidel
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

In previous mesh morphing techniques, the vertex set and connectivity of an in-between mesh are fixed and only the vertex positions are interpolated between input meshes. With this restriction, to accurately represent both source and target shapes, an in-between mesh should contain a much larger number of vertices than input meshes. This paper proposes a novel approach for mesh morphing, which includes connectivity changes in a metamorphosis. With the approach, an in-between mesh contains only the vertices from the input meshes and so the in-between vertex count does not exceed the sum of source and target vertex counts. The connectivity changes are realized by a sequence of edge swap operation, determined by considering the geometric errors from the input meshes. Experimental results demonstrate that the proposed approach generates almost same in-between shapes as the metamesh-based approach with a much smaller number of vertices.
Mac Os X Tiger For Unix Geeks
Authors: Brian Jepson, Ernest Rothman
Venue:  (2005)

If you're one of the many Unix developers drawn to Mac OS X for its Unix core, you'll find yourself in surprisingly unfamiliar territory. Unix and Mac OS X are kissing cousins, but there are enough pitfalls and minefields in going from one to another that even a Unix guru can stumble, and most guides to Mac OS X are written for Mac aficionados. For a Unix developer, approaching Tiger from the Mac side is a bit like learning Russian by reading the Russian side of a Russian-English dictionary. Fortunately, O'Reilly has been the Unix authority for over 25 years, and in Mac OS X Tiger for Unix Geeks, that depth of understanding shows. This is the book for Mac command-line fans. Completely revised and updated to cover Mac OS X Tiger, this new edition helps you quickly and painlessly get acclimated with Tiger's familiar-yet foreign-Unix environment. Topics include: Using the Terminal and understanding how it differs from an xtermUsing Directory Services, Open Directory (LDAP), and NetInfoCompiling code with GCC 3Library linking and porting Unix softwareCreating and installing packages with FinkUsing DarwinPortsSearch through metadata with Spotlight's command-line utilitiesBuilding the Darwin kernelRunning X Windows on top of Mac OS X, or better yet, run Mac OS X on a Windows machine with PearPC! Mac OS X Tiger for Unix Geeks is the ideal survival guide for taming the Unix side of Tiger. If you're a Unix geek with an interest in Mac OS X, you'll find this clear, concise book invaluable.
Detecting Outliers in Spatial Database
Authors: Tianqiang Huang, Xiaolin Qin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Detecting outlier in spatial database is important for many KDD applications. Existing works in outlier detection donýt distinguish between spatial dimension and non-spatial dimension or have poor efficiency. In this paper, we proposed a new measure to identify spatial outliers. We defined spatial outlier factor (SOF) to detect spatial outliers efficiently, and proposed a algorithm (SOFind) to identify them. SOF can successfully identify significant outliers and filtrate some meaningless outliers but canýt do it by other methods. The experimental results show that our approach is effective and efficient.
Low Power Data Prefetch for 3D Image Applications on Coarse-Grain Reconfigurable Architectures
Authors: F. Rivera, M. Sanchez-Elez, M. Fernandez, R. Hermida, N. Bagherzadeh
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper we present a data prefetch policy for the execution of 3D interactive applications on coarse-grain reconfigurable architectures. User's actions not occurring at expected times combined with the volume of data involved in this kind of applications impact strongly in performance. We define a data prefetch scheme to avoid reconfigurable processing unit stalls due to operands unavailability through profiling methodologies and special search algorithms. Experimental results satisfy time constraints of interactive applications and show a power effective solution for them.
Computational and physical modeling challenges in structural molecular biology and proteomics
Authors: Bruce R. Donald
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Some of the most challenging and influential opportunities for Physical Geometric Algorithms (PGA) arise in developing and applying information technology to understand the molecular machinery of the cell. Our recent work (and work by others) shows that many PGA techniques may be fruitfully applied to the challenges of computational molecular biology. PGA research may lead to computer systems and algorithms that are useful in structural molecular biology, proteomics, and rational drug design.Concomitantly, a wealth of interesting computational and physical modeling problems arise in proposed methods for discovering new pharmaceuticals. In this talk, I'll discuss some recent results from my lab, including new algorithms for interpreting X-ray crystallography and NMR (nuclear magnetic resonance) data, disease classification using mass spectrometry of human serum, and protein redesign. Our algorithms have recently been used, respectively, to reveal the enzymatic architecture of organisms high on the CDC bioterrorism watch-list, for probabilistic cancer classification from human peripheral blood, and to redesign an antibiotic-producing enzyme to bind a novel substrate. I'll overview these projects, and survey some of the algorithmic, modeling, and computational challenges.
Policy Modeling and Refinement for Network Security Systems
Authors: Joao Porto de Albuquerque, Heiko Krumm, Paulo Licio de Geus
Venue: Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (2005)

In todayýs network environments the integrated design and management of different security technologies and mechanisms are of great interest. Especially in large networks, the security management should be supported by approaches with an appropriate level of abstraction, such that a system can be considered independently of the complex configuration details of its various component mechanisms. Furthermore, the employment of the security services and the design of their configurations should be supported by a structured technique that separates the consideration of the system as a whole from the detailed design of the subsystems. Pursuing these goals, this papers offers an approach to modeling network security systems, based on the concepts of policy-based management and model-based management, and analyzes the policy representation and refinement as well as the model validation enabled by this modeling.
Effects of Velocity on Human Force Control
Authors: Mengnan (Mary) Wu, Jake J. Abbott, Allison M. Okamura
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Although many robots and haptic interfaces are of the impedance type, admittance-type devices offer distinct advantages, such as high damping and stiffness display, particularly in applications requiring precise motion control. This study seeks to quantify human force control limitations in admittance control systems, where robot velocity is controlled to be proportional to the force applied by a human operator. Measurements of human force control in both admittance- and velocity-controlled scenarios were used to quantify force control precision, as well as to find a threshold over which a human cannot control a constant force and determine if that threshold depends on admittance gain or velocity. Experimental results show that robot velocity, not admittance, determines force control precision. Thus, velocities in admittance control systems should be limited to ensure that human force inputs remain precise.
The other side of turnover: managing IT personnel strategically
Authors: Havard Meland, Rolf Petter Waage, Maung K. Sein
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Turnover has always been regarded as dysfunctional for organizations especially in the IT industry. Research and practice has focused on retaining IT professionals. IT companies have made efforts to retain their workers by increasing salaries, fringe benefits and in general, create an environment attractive for high performing knowledge workers. In this paper, we present a different perspective and argue that turnover is a possible strategic facilitator for organizational development. Using theory of planned behavior, theory of psychological contracts and building upon prior research in IT turnover, we propose a model which we call Strategic Turnover Management Process (STMP). In developing our model, we supplemented the theoretical and empirical premises with data gathered from an internationally known IT consulting company. The model has three stages - assessing employees' intentions, deciding on intervention measures, and enacting actual intervention. We propose ways of implementing our model and conclude by stressing that preventing turnover should not be the goal of any organization, but rather be accepted as a natural part of the market dynamics. Organizations should not try to stop the water from flowing downstream, but aim to control its speed and direction.
Acquiring and validating motion qualities from live limb gestures
Authors: Liwei Zhao, Norman I. Badler
Venue: Graphical Models (2005)

This paper presents a neural computing model that can automatically extract motion qualities from live performance. The motion qualities are in terms of laban movement analysis (LMA) Effort factors. The model inputs both 3D motion capture and 2D video projections. The output is a classification of motion qualities that are detected in the input. The neural nets are trained with professional LMA notators to ensure valid analysis and have achieved an accuracy of about 90% in motion quality recognition. The combination of this system with the EMOTE motion synthesis system provides a capability for automating both observation and analysis processes, to produce natural gestures for embodied communicative agents.
On Goppa Codes and Weierstrass Gaps at Several Points
Authors: Cícero Carvalho, Fernando Torres
Venue: Designs, Codes and Cryptography (2005)

We generalize results of Homma and Kim [J. Pure Appl. Algebra Vol. 162, (2001), pp. 273--290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.
Optimal topology control for balanced energy consumption in wireless networks
Authors: Yingshu Li, Xiaoyan Cheng, Weili Wu
Venue: Journal of Parallel and Distributed Computing (2005)

Hosts in wireless networks are usually powered by batteries, thus the lifetime of a network depends on the battery life of each individual host. One major solution to improve energy-efficiency is to minimize the total energy consumption. However, battery energy is a local resource, to save energy at each host and balance the energy consumption among all the hosts in the network appear to be more practical. In this paper, we prove that minimum weight incremental arborescence (MWIA) is the optimal solution for minimizing the maximum transmission power among a set of wireless nodes. We propose an algorithm that utilizes MWIA to construct a connected topology, called MWIA-based Topology Control(MWIA-TC) algorithm. We further apply MWIA-TC to the accumulated energy consumption. The theoretical analysis and experimental results show that MWIA-TC outperforms a well-known algorithm, Minimum Incremental Power (MIP), in both energy saving and network lifetime extension.