ppxscal/embedding_network huggingface dataset:
What you see is what you snap: snapping to geometry deformed on the GPU
Authors: Harlen C. Batagelo, Wu Shin-Ting
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We present a simple yet effective snapping technique for constraining the motion of the cursor of an input device to the surface of 3D models whose geometry is arbitrarily deformed by a programmable hardware fragment and vertex processor. The technique works in image space and thus snaps the cursor to the geometry actually rendered instead of the geometry originally submitted to the rendering pipeline. We also present a method to establish a correspondence between snapped geometry in image space and object space, and an efficiency improvement based on the control of frequency of frame buffer accesses. Performance tests are conducted and compared against the standard picking and snapping algorithm used by the D3DX library of the Microsoft Direct3D API. We conclude by emphasizing the feasibility of our algorithm when facing the new advances of the graphics hardware for deforming geometry on the GPU.
Evolving fuzzy systems
Authors: Brian Oduor, Andrey Anev
Venue: Journal of Computing Sciences in Colleges (2004)

The problem that is presented in this paper is that of a robot that is supposed to follow a line in an oval track as smoothly as possible. The robot is equipped with 2 sensors, each pointing at a 90-degree angle from the direction of motion. These act as the right and left range sensors having a pre-defined vision range of 100 units. In addition, the robot has a compass. It is limited to making turns of up to 10 degrees per step.
Factored, a-stable, linear multistep methods: an alternative to the method of lines for multidimensions
Authors: R. F. Warming, Richard M. Beam
Venue: ACM SIGNUM Newsletter (1979)

Historically, the development and analysis of methods for ordinary differential equations (ODEs) have been more advanced than those for partial differential equations (PDEs). The present state of numerical methods is no exception; therefore, it behooves the numerical analyst to exploit sophisticated ODE methods for the numerical solution of PDEs.
Metadata requirements for digital museum environments
Authors: Manjula Patel, Martin White, Nicholaos Mourkoussis, Krzysztof Walczak, Rafal Wojciechowski, Jacek Chmielewski
Venue: International Journal on Digital Libraries (2005)

We describe a system which addresses all the processes involved in digitally acquiring, modelling, storing, manipulating and creating virtual exhibitions from 3D museum artefacts. More specifically, we examine the significance of metadata in enabling and supporting all of these processes and describe the extensive facilities provided for authoring, maintaining and managing metadata. The development of the system has been heavily influenced by factors relating to interoperability, standards, museum best practice and feedback from two museum pilot sites. Finally, we briefly consider the system in the wider context of applications such as virtual learning environments and distributed repositories of archives.
Performance evaluation of distributed-antenna communications systems using beam-hopping: Research Articles
Authors: Honglin Hu, Jinkang Zhu, Lie-Liang Yang
Venue: Wireless Communications Mobile Computing (2005)

Digital beamforming (DBF) techniques are capable of improving the performance of communications systems significantly. However, if the transmitted signals are conflicted with strong interference especially in the direction of the transmitted beams, these directional jamming signals will severely degrade the system performance. In order to efficiently mitigate the interference of the directional jammers, in this contribution a beam-hopping (BH) communications scheme is studied. In the BH communications scheme, only one pair of the beams is used for transmission and it hops from one to the next according to an assigned BH pattern. In this contribution, a range of expressions in terms of the average signal to interference plus noise ratio (SINR) performance have been derived, when both the uplink and downlink are considered. The average SINR performance of the BH scheme and that of the conventional single-beam (SB) as well as multiple-beam (MB) assisted beam-processing schemes have been investigated. Our analysis and results show that the BH scheme is capable of efficiently combating the directional jamming, with the aid of utilizing the directional gain of the beams generated by both the transmitter and the receiver. Furthermore, the BH scheme is capable of reducing the intercept probability of the communications. Therefore, the BH scheme is suitable for communications when several distributed antenna arrays are available around a mobile. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Adaptive Mesh Refinement in Titanium
Authors: Tong Wen, Phillip Colella
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the Adaptive Mesh Refinement methodology to numerical Partial Differential Equations at the production level. In Chombo, the library approach is used to parallel programming (C++ and Fortran, with MPI), whereas Titanium is a Java dialect designed for high-performance scientific computing. The performance of our implementation is studied and compared with that of Chombo in solving Poisson's equation based on two grid configurations from a real application. Also provided are the counts of lines of code from both sides.
The vacuum: facilitating the manipulation of distant objects
Authors: Anastasia Bezerianos, Ravin Balakrishnan
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present the design and evaluation of the vacuum, a new interaction technique that enables quick access to items on areas of a large display that are difficult for a user to reach without significant physical movement. The vacuum is a circular widget with a user controllable arc of influence that is centered at the widget's point of invocation and spans out to the edges of the display. Far away objects residing inside this influence arc are brought closer to the widget's centre in the form of proxies that can be manipulated in lieu of the original. We conducted two experiments which compare the vacuum to direct picking and an existing technique called drag-and-pick [2]. Results show that the vacuum outperforms existing techniques when selecting multiple targets in a sequence, performs similarly to existing techniques when selecting single targets located moderately far away, and slightly worse with single targets located very far away in the presence of distracter targets along the path.
Bypass Caching: Making Scientific Databases Good Network Citizens
Authors: Tanu Malik, Randal Burns, Amitabh Chaudhary
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitable for their workloads, which compare and join large data sets. Existing techniques reduce parallelism by conducting distributed queries in a single cache and lose the data reduction benefits of performing selections at each database. We develop the bypass-yield formulation of caching, which reduces network traffic in wide-area database federations, while preserving parallelism and data reduction. Bypass-yield caching is altruistic; caches minimize the overall network traffic generated by the federation, rather than focusing on local performance. We present an adaptive, workload-driven algorithm for managing a bypass-yield cache. We also develop on-line algorithms that make no assumptions about workload: a k-competitive deterministic algorithm and a randomized algorithm with minimal space complexity. We verify the efficacy of bypass-yield caching by running workload traces collected from the Sloan Digital Sky Survey through a prototype implementation.
Genetic Algorithm to Improve SVM Based Network Intrusion Detection System
Authors: Dong Seong Kim, Ha-Nam Nguyen, Jong Sou Park
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we propose Genetic Algorithm (GA) to improve Support Vector Machines (SVM) based Intrusion Detection System (IDS). SVM is relatively a novel classification technique and has been shown higher performance than traditional learning methods in many applications. So several security researchers have proposed SVM based IDS. We use fusions of GA and SVM to enhance the overall performance of SVM based IDS. Through fusions of GA and SVM, the "optimal detection model" for SVM classifier can be determined. As the result of this fusion, SVM based IDS not only select "optimal parameters" for SVM but also "optimal feature set" among the whole feature set. We demonstrate the feasibility of our method by performing several experiments on KDD 1999 intrusion detection system competition dataset.
Kinematic optimal design of a paramill: A multi-SP device
Authors: Jun-Ho Lee, Keum-Shik Hong
Venue: Journal of Robotic Systems (2004)

In this paper, a manipulability analysis of a new parallel-type rolling mill, named &ldquo;paramill,&rdquo; in its conceptual design stage is investigated. The paramill considered uses two Stewart platforms (SPs) in opposite directions for the generation of 6 degree-of-freedom motions of individual work-rolls. The objective of this new approach is to pursue an integrated control of the strip thickness, strip shape, pair-crossing angle, uniform wear of the rolls, and tension of the strip. The forward&sol;inverse kinematics problems are formulated. Two main kinematic parameters, the size of the base and the acute angle made by two neighboring joints for a given size of the work-roll, have been determined in the way that the force and moment transmission from the actuators to the work-rolls is maximized. &copy; 2004 Wiley Periodicals, Inc.
Connecting with kids: so what's new?
Authors: Lori L. Scarlatos, Amy S. Bruckman, Allison Druin, Mike Eisenberg, Molly Lenore, Oren Zuckerman
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install "what everyone else is using" without questioning how technology can be best used to enhance education. For this panel, we have assembled a broad range of researchers and practitioners who are on the forefront of using computers to teach kids in novel ways. Each panelist will summarize their approach with examples of projects that they believe will demonstrate "what's new". We will then have videotaped children pose their toughest educational challenges to the panelists. Panelists will answer by talking about how they would meet these challenges. Finally, attendees will get to vote for their favorite solution. This will expose the CHI audience to a range of educational challenges, with a taste of the different ways that these problems can be solved.
Publication of numerical algorithms
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1977)

Several journals exist which publish numerical "algorithms" in the form of a mixture of natural language and mathematics. Very often a pre-condition for publication is a convergence proof. Some of these journals also publish comparison of algorithms via numerical experiments. This is all very fine, but is it of much use to users of algorithms?
Emergence of Collective Behavior in Evolving Populations of Flying Agents
Authors: Lee Spector, Jon Klein, Chris Perry, Mark Feinstein
Venue: Genetic Programming and Evolvable Machines (2005)

We demonstrate the emergence of collective behavior in two evolutionary computation systems, one an evolutionary extension of a classic (highly constrained) flocking algorithm and the other a relatively un-constrained system in which the behavior of agents is governed by evolved computer programs. The first system demonstrates the evolution of a form of multicellular organization, while the second demonstrates the evolution of a form of altruistic food sharing. In this article we describe both systems in detail, document the emergence of collective behavior, and argue that these systems present new opportunities for the study of group dynamics in an evolutionary context. We also provide a brief overview of the breve simulation environment in which the systems were produced, and of breve's facilities for the rapid, exploratory development of visualization strategies for artificial life.
Congestion control for high performance, stability, and fairness in general networks
Authors: Fernando Paganini, Zhikui Wang, John C. Doyle, Steven H. Low
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

This paper is aimed at designing a congestion control system that scales gracefully with network capacity, providing high utilization, low queueing delay, dynamic stability, and fairness among users. The focus is on developing decentralized control laws at end-systems and routers at the level of fluid-flow models, that can provably satisfy such properties in arbitrary networks, and subsequently approximate these features through practical packet-level implementations.Two families of control laws are developed. The first "dual" control law is able to achieve the first three objectives for arbitrary networks and delays, but is forced to constrain the resource allocation policy. We subsequently develop a "primal-dual" law that overcomes this limitation and allows sources to match their steady-state preferences at a slower time-scale, provided a bound on round-trip-times is known.We develop two packet-level implementations of this protocol, using 1) ECN marking, and 2) queueing delay, as means of communicating the congestion measure from links to sources. We demonstrate using ns-2 simulations the stability of the protocol and its equilibrium features in terms of utilization, queueing and fairness, under a variety of scaling parameters.
Safety critical software development for space application: invited talk abstract
Authors: Michel Turin
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This talk provides an overview of methods and tools used for space software development & verification by EADS Space Transportation.
Many-step two-person games with a fixed sequence of moves under aggregated information on partner's choice
Authors: V. S. Aliev, A. F. Kononenko
Venue: Automation and Remote Control (2005)

A many-step two-person game is studied with a fixed sequence of moves under aggregated information on every move at the decision making instant and on the choice of player 2 at the current move. Player 1, knowing this information at every step i, first chooses a strategy xi(·) = (x1(·),...,xn(·)), i = $$\overline {1,n,} $$ , and informs it for n moves to player 2 at the beginning of the game. His maximal guaranteed result and the corresponding optimal (¿-optimal) strategy are determined. Such games under complete (nonaggregated) information are formulated and a compact expression for the strategy of player 1 is derived.
On-line motion blending for real-time locomotion generation: Research Articles
Authors: Sang Il Park, Hyun Joon Shin, Tae Hoon Kim, Sung Yong Shin
Venue: Computer Animation and Virtual Worlds (2004)

In this paper, we present an integrated framework of on-line motion blending for locomotion generation. We first provide a novel scheme for incremental timewarping, which always guarantees that the time goes forward. Combining the idea of motion blending with that of posture rearrangement, we introduce a motion transition graph to address on-line motion blending and transition simultaneously. Guided by a stream of motion specifications, our motion synthesis scheme moves from node to node in an on-line manner while blending a motion at a node and generating a transition motion at an edge. For smooth on-line motion transition, we also attach a set of example transition motions to an edge. To represent similar postures consistently, we exploit the inter-frame coherency embedded in the input motion specification. Finally, we provide a comprehensive solution to on-line motion retargeting by integrating existing techniques. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Evaluation of Signature-Based Testing of RF/Analog Circuits
Authors: Amir Zjajo, Jose Pineda de Gyvez
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Due to its low cost, low test time and reduced test complexity, structural testing is preferred to functional whenever possible. The study presented in this paper indicates that the two low-frequency structural test methods considered, power supply current monitoring and the power supply ramping technique, provide a valuable supplement/alternative when one of the functional tests (gain, noise figure and total harmonic distortion) in the test set can be complemented or substituted by structural test and add to or maintain no loss of fault coverage.
First steps in the retro-engineering of a GUI toolkit in the B language
Authors: Francis Jambon
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

This paper provides a progress report on an initial approach of retro-engineering of a graphical toolbox using the B method. Nowadays, dependable systems which feature graphical user interfaces do not use Widgets libraries, safety of which was ensured. The use of formal methods (the B method in our study) is an interesting solution making it possible to guarantee some of the properties (safety and conformity) of these Widgets. We show that retro-engineering of classical Widgets (Button, Slider) or more elaborate ones (RangeSlider) is possible but error prone and reveals some badly controlled concepts.
The role of modelling in the software engineering curriculum
Authors: A. J. Cowling
Venue: Journal of Systems and Software (2005)

This paper argues that the concept of modelling, and particularly the modelling of software system structures, is not being given sufficient attention within current sources that describe aspects of the software engineering curriculum. The paper describes the scope of modelling as a general concept, and explains the role that the modelling of software system structures plays within it. It discusses the treatment of this role within the various sources, and compares this both with the experience of the role that such modelling plays in the undergraduate curriculum at Sheffield University, and with the practice in other branches of engineering. The idea is examined that modelling should be treated as a recurring concept within the curriculum, and it is shown that this gives rise to a matrix structure for the software engineering curriculum. The paper discusses how such a structure can be mapped into a conventional hierarchical curriculum model, and the relationships that need to be made explicit in doing so. It describes the practical implications of these results for the structures of degree programmes in software engineering.
FROST: Revisited and Distributed
Authors: Vincent Poirriez, Rumen Andonov, Antoine Marin, Jean-Francois Gibrat
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

FROST (Fold Recognition-Oriented Search Tool) is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a database of about 1200 known 3D structures, each one associated with empirically determined score distributions. FROST uses these distributions to normalize the score obtained when a protein sequence is aligned with a particular 3D structure. Computing these distributions is extremely time consuming; it requires solving about 1,200,000 hard combinatorial optimization problems and takes about 40 days on a 2.4 GHz computer. This paper describes how FROST has been successfully redesigned and structured in modules and independent tasks. The new package organization allows these tasks to be distributed and executed in parallel using a centralized dynamic load balancing strategy. On a cluster of 12 PCs, computing the score distributions takes now about 3 days which represents a parallelization efficiency of about 1.
Effective Steganalysis Based on Statistical Moments of Wavelet Characteristic Function
Authors: Yun Q. Shi, Guorong Xuan, Chengyun Yang, Jianjiong Gao, Zhenping Zhang, Peiqi Chai, Dekun Zou, Chunhua Chen, Wen Chen
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, an effective steganalysis based on statistical moments of wavelet characteristic function is proposed. It decomposes the test image using twolevel Haar wavelet transform into nine subbands (here the image itself is considered as the LL0 subband). For each subband, the characteristic function is calculated. The first and second statistical moments of the characteristic functions from all the subbands are selected to form an 18-dimensional feature vector for steganalysis. The Bayes classifier is utilized in classification. All of the 1096 images from the CorelDraw image database are used in our extensive experimental work. With randomly selected 100 images for training and the remaining 996 images for testing, the proposed steganalysis system can steadily achieve a correct classification rate of 79% for the non-blind Spread Spectrum watermarking algorithm proposed by Cox et al., 88% for the blind Spread Spectrum watermarking algorithm proposed by Piva et al., and 91% for a generic LSB embedding method, thus indicating significant advancement in steganalysis.
Rank order filters and priority queues
Authors: Anne Kaldewaij, Jan Tijmen Udding
Venue: Distributed Computing (1992)

A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency.
Induction from answer sets in nonmonotonic logic programs
Authors: Chiaki Sakama
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

Inductive logic programming (ILP) realizes inductive machine learning in computational logic. However, the present ILP mostly handles classical clausal programs, especially Horn logic programs, and has limited applications to learning nonmonotonic logic programs. This article studies a method for realizing induction in nonmonotonic logic programs. We consider an extended logic program as a background theory, and introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The proposed methods extend the present ILP techniques to a syntactically and semantically richer framework, and contribute to a theory of nonmonotonic ILP.