ppxscal/embedding_network huggingface dataset:
Performance evaluation of directional adaptive range control in mobile ad hoc networks
Authors: Mineo Takai, Junlan Zhou, Rajive Bagrodia
Venue: Wireless Networks (2005)

This paper presents DARC (Directional Adaptive Range Control), a range control mechanism using directional antennas to be implemented across multiple layers. DARC uses directional reception for range control rather than directional transmission in order to achieve both range extension and high spatial reuse. It adaptively controls the communication range by estimating dynamically changing local network density based on the transmission activities around each network node. The experimental results using simulation with detailed physical layer, IEEE 802.11 DCF MAC, and AODV protocol models have shown the successful adaptation of communication range with DARC for varied network densities and traffic loads. DARC improves the packet delivery ratio by a factor of 9 at the maximum for sparse networks while it maintains the increased network capacity for dense networks. Further, as each node adaptively changes the communication range, the network delivers up to 20% more packets with DARC compared to any fixed range configurations.
An Efficient Swarm Neighborhood Management for a 3D Tactical Simulator
Authors: Russel Ahmed Apu, Marina L. Gavrilova
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

The paper presents a unique utilization of the Dynamic Delaunay Triangulation (DT) to devise a highly efficient algorithm for the neighborhood adjacency management which is a crucial component of a swarm-based simulation. This algorithm allows fast computation of the swarm neighborhood which is required to implement Boids flocking rules. The method also provides an efficient mechanism to detect and manage object collisions. This unique utilization of DT based data structures was applied to a new 3D tactical swarm simulation called the Battle Swarm. The result was a very high speed of simulation, which made complex application of genetic evolution possible for goal-based swarms in a three dimensional space. The method's effective and complex emergent behavior was successfully demonstrated by the Battle Swarm Simulator. In addition, the experimental section confirms that the method was highly efficient and can be used in similar applications.
Delineating complex scientific fields by an hybrid lexical-citation method: an application to nanosciences
Authors: Michel Zitt, Elise Bassecoulard
Venue: Information Processing and Management: an International Journal (2006)

Relevance of bibliometric indicators on scientific areas critically depends on the quality of their delineation. Macro-level studies, often based on a selected list of journals, accept a high degree of fuzziness. Micro-level studies rely on sets of individual articles in order to reduce noise and enhance precision of retrieval. The most usual information retrieval process is based on lexical queries with various levels of sophistication. In the experiment on Nanosciences reported here, this process was used as a first step, to delineate a 'seed' of literature. It has strong limitations, especially for emerging or transversal fields. In a second step, the alternative approach of citation linkages, was used to expand the bibliography starting from lexical seed. The extension process presented is ruled by three parameters, two deal with the cited side (threshold on citation score, and specificity towards the field), one with the citing side (threshold on the number of relevant references) interplaying in the 'referencing structure' function (RSF) introduced in a previous work. This type of combination proves effective for delineating the transversal field of Nanosciences. Further improvements of the method are discussed.
Adapting Model Driven Architecture for Modeling Heterogeneous Embedded S/W Components
Authors: Woo Yeol Kim, R. Young Chul Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In this paper, we propose 'MDA based approach for Modeling Embedded Software with xUML' to solve reusable problems of the heterogeneous embedded software. Through our proposed method, we produce 'Target Independent Meta Model' (TIM) which is transformed into 'Target Specific Model' (TSM) and which is generated 'Target Dependent Code' (TDC) via TSM. We would like to reuse a metamodel to develop heterogeneous embedded software systems. To achieve this mechanism, we extend xUML to solve unrepresented elements (such as real things about concurrency, and real time, etc) on dynamic modeling of a particular system. As a result, it is possible to develop s/w independent of hardware with reusability of models. So we adapt the MDA mechanism for embedded s/w development, which can reduce the costs and lifecycle of s/w development. It contains one example which illustrates the proposed approach.
Image Intensification for Low-Light Face Recognition
Authors: Diego A. Socolinsky, Lawrence B. Wolff, Andrew J. Lundberg
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents the first published systematic study of face recognition performance as a function of light level using intensified near infrared imagery. This technology is the most prevalent in both civilian and military night vision equipment, and provides enough intensification for human operators to perform standard tasks under extremely low-light conditions. We describe a comprehensive data collection effort undertaken by the authors to image subjects under carefully controlled illumination and quantify the performance of standard face recognition algorithms on visible and intensified imagery as a function of light level. Performance comparisons for automatic face recognition are reported using the standardized implementations from the CSU Face Identification Evaluation System. The results contained in this paper should constitute the initial step for analysis and deployment of face recognition systems designed to work in low-light level condi
A Graph Based Algorithm for Data Path Optimization in Custom Processors
Authors: Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, Daniel Gajski
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such systems. This paper presents algorithms to automatically create custom data path for a given application that optimizes both resource utilization and performance. The inputs to the architecture generator include application source code, operation execution frequency obtained by the profile run and a component library (consisting of ALUs, busses, multiplexors etc.). The output is the application specific data path specified as the set of resource instances and their connections. The algorithm starts with a dense architecture and iteratively refines it until an efficient architecture is derived. The key optimization goal is to keep performance within given boundaries while maximizing resource utilization. Our experimental results show that generated architectures are comparable to manual designs, but can be obtained in a matter of few seconds, thereby leading to significant productivity gains.
FindFlow: visual interface for information search based on intermediate results
Authors: Tomoyuki Hansaki, Buntarou Shizuki, Kazuo Misue, Jiro Tanaka
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

FindFlow is a search interface that enables users to construct queries visually on the screen. Because the constructed queries show the process of the search, the user can take a step forward in the search while monitoring the process. The queries can be recombined freely, and previous search results can be reused. In addition, FindFlow shows results interactively for each operation. FindFlow is advantages for searches in which the user repeats trial and error many times.
Inference of concise DTDs from XML data
Authors: Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

We consider the problem to infer a concise Document Type Definition (DTD) for a given set of XML-documents, a problem which basically reduces to learning of concise regular expressions from positive example strings. We identify two such classes: single occurrence regular expressions (SOREs) and chain regular expressions (CHAREs). Both classes capture the far majority of the regular expressions occurring in practical DTDs and are succinct by definition. We present the algorithm iDTD (infer DTD) that learns SOREs from strings by first inferring an automaton by known techniques and then translating that automaton to a corresponding SORE, possibly by repairing the automaton when no equivalent SORE can be found. In the process, we introduce a novel automaton to regular expression rewrite technique which is of independent interest. We show that iDTD outperforms existing systems in accuracy, conciseness and speed. In a scenario where only a very small amount of XML data is available, for instance when generated by Web service requests or by answers to queries, iDTD produces regular expressions which are too specific. Therefore, we introduce a novel learning algorithm CRX that directly infers CHAREs (which form a subclass of SOREs) without going through an automaton representation. We show that CRX performs very well within its target class on very small data sets. Finally, we discuss incremental computation, noise, numerical predicates, and the generation of XML Schemas.
Dynamic Resource Prices in a Combinatorial Grid System
Authors: Michael Schwind, Oleg Gujo, Tim Stockheim
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Our paper presents an agent-based simulation environment for task scheduling in distributed computer systems (grid). The scheduler enables the simultaneous allocation of bundles comprising resources such as CPU time, communication bandwidth, volatile, and non-volatile memory. The resources are allocated by an iterative combinatorial auction with proxybidding agents trying to acquire their desired resource allocation profiles. In order to support an efficient bidding process, the auctioneer provides resource price information to the bidding agents. Due to the complementarities and substitutionalities of the bid bundles in the proposed setting, the calculation of these prices is computationally expensive. This article proposes two different price approximation mechanisms: one scarcity basedscheme and a second approach using shadow prices based on the dual formulation of the relaxed linear program of the allocation problem. The stability of both allocation mechanisms is compared in the context of a closed grid system (economy) where agents buy and sell production capacity. The objective of each agent is to acquire complementary resource capacity to increase his productivity. The system's pricing and the agents' bidding behavior is evaluated based on both measures in situations of gradually increasing resource failure to test the stability of the allocation mechanism.
DS2IS: Dictionary-based Segmented Signal Inversion Scheme for Low Power Dynamic Bus Design
Authors: Shang-Fang Tsai, Shanq-Jang Ruan
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

As technology scales down to nanometer technology, coupling effects between neighboring wires have a significant impact on power consumption and signal integrity on on-chip interconnects. Especially, on-chip inductive effects need to be taken into account due to low-resistance metal interconnection and fast signal transition times in nowadays IC design. In this paper, we propose a low power bus encoding scheme which reduces the capacitive and inductive effects between bus wires simultaneously by the measurement of real RLC model. The experimental results showed that our approach can save power consumption of the bus up to 15%.
The Collaborative Semantic Grid
Authors: David De Roure, Jeremy Frey, Danius Michaelides, Kevin Page
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Grid and Semantic Web technologies both enable heterogeneous resources to be joined up to achieve new functionality and capability, and their combined effectiveness has been demonstrated through a number of 'Semantic Grid' projects. These typically apply Semantic Web technologies in Grid applications, in a datagrid or within the Grid middleware. In this paper we suggest how both approaches also support distributed collaborative endeavours, and explore their combined role. We illustrate this 'Collaborative Semantic Grid' through a number of case studies, and contemplate the changing nature of collaboration as these technologies evolve.
Interview with Jon Kaas
Authors: Staff
Venue: Journal of Cognitive Neuroscience (1999)

Jon Kaas received a Ph.D. in Psychology with Irving Diamond at Duke University and completed a postdoctoral fellowship with Clinton Woolsey in neurophysiology at the University of Wisconsin, where he also collaborated with Ray Guillery. After 4 years as an Assistant Professor in Neurophysiology at Wisconsin, he moved to the Department of Psychology at Vanderbilt University where he is currently Centennial Professor. Awards include the Earl Sutherland Prize, Javits Neuroscience Investigator Award, Krieg Cortical Discoverer Award, and American Psychological Association Distinguished Scientific Contribution Award. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Real Time Multimodal Interaction with Animated Virtual Human
Authors: Li Jin, Zhigang Wen
Venue: Proceedings of the conference on Information Visualization (2006)

This paper describes the design and implementation of a real time animation framework in which animated virtual human is capable of performing multimodal interactions with human user. The animation system consists of several functional components, namely perception, behaviours generation, and motion generation. The virtual human agent in the system has a complex underlying geometry structure with multiple degrees of freedom (DOFs). It relies on a virtual perception system to capture information from its environment and respond to human user's commands by a combination of non-verbal behaviours including co-verbal gestures, posture, body motions and simple utterances. A language processing module is incorporated to interpret user's command. In particular, an efficient motion generation method has been developed to combines both motion captured data and parameterized actions generated in real time to produce variations in agent's behaviours depending on its momentary emotional states.
On the power of parallel communicating Watson-Crick automata systems
Authors: Elena Czeizler, Eugen Czeizler
Venue: Theoretical Computer Science (2006)

Parallel communicating Watson-Crick automata systems were introduced in [E. Czeizler, E. Czeizler, Parallel communicating Watson-Crick automata systems, in: Z. Ésik, Z. Fülöp (Eds.), Proc. Automata and Formal Languages, Dobogókö, Hungary, 2005, pp. 83-96] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [D. Kuske, P. Weigel, The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems, DLT 2004, Lecture Notes in Computer Science, Vol. 3340, Auckland, New Zealand, 2004, pp. 272-283], that for Watson-Crick finite automata, the complementarity relation plays no active role. However, this is not the case when considering parallel communicating Watson-Crick automata systems. In this paper we prove that non-injective complementarity relations increase the accepting power of these systems. We also prove that although Watson-Crick automata are equivalent to two-head finite automata, this equivalence is not preserved when comparing parallel communicating Watson-Crick automata systems and multi-head finite automata.
Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
Venue: ACM International Conference Proceeding Series; Vol. 198 (2006)

Innovations in network-based services continue to have strong impact on our world, resulting in a huge research interest in infrastructures that supports traditional and novel applications based on Internet. Accesses to interactive and multimedia services through a large variety of Internet devices require guaranteed performance, resource availability and proximity of content to the network access points. Scalability issues pose a number of design and performance problems at any level: systems, protocols, software. There is a number of open research challenges in improving content generation, personalization and delivery. The goal of this one-day workshop is to bring together researchers, developers, web service providers, application and network designers from academia and industry to exchange ideas about the problems they are facing and to discuss recent and innovative solutions.Topics of interest to this workshop include (but are not limited to) performance studies and solutions (algorithms, protocols, architectures) that tend to improve user experience in accessing interactive applications based on Internet.
Adaptive Estimation and Control of a Z-axis MEMS Gyroscope with Time-varying Rotation Rates
Authors: Lili Dong
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

This paper presents a new adaptive control algorithm to control the sense axis of a Z-axis MEMS gyroscope. A force-to-rebalance mode of operation is applied to the sense axis. Under this mode, the output amplitude of sense axis is continuously monitored and driven to zero by the controller while an input rotation rate is measured. Adaptive laws are developed to estimate the rotation rate and a quadrature error term caused by mechanical imperfection. In the paper, we suppose the rotation rate of the gyroscope is an unknown time-varying piecewise continuous parameter, rather than a constant as in current literature. A Lyapunov approach is applied to obtain both control and adaptive laws.
Genetic algorithms in simulating optimal stacking sequence of a composite laminate plate with constant thickness
Authors: P.-F. Pai, S. Deng, C.-C. Lai, P.-S. Wu
Venue: International Journal of Modelling and Simulation (2006)

Due to their high reliability, composite materials are commonly used in industry. The stacking sequence is crucial to the strength of composite materials; however, the arrangement of this sequence is very time consuming. Because the stacking sequence is usually NP complete, genetic algorithms (GA) were employed to deal with the stacking sequence problems in this study. The interlaminate stress σ33 of a constant thickness composite plate, which is obtained by the analytical method, was used as the fitness function in the GA to find its minimum value by arrange the ply stacking sequence. Three examples of constant thickness and symmetrical composite laminate plates were used to examine the performance of the proposed algorithms. The results of computational tests presented are very encouraging.
Architecture for Providing Services in the Ubiquitous Computing Environment
Authors: Goro KUNITO, Kenji SAKAMOTO, Naoharu YAMADA, Tatsuo TAKAKASHI, Satoshi TANAKA
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Computing and telecommunications are maturing, and Ubiquitous computing has become quite interesting as a new environment in which to seek new services. The goal of Ubiquitous computing is the enhancement of computer utilization by making many computers available throughout the physical environment, but making them effectively invisible to the user. The goal of services in the ubiquitous environment is not making either services or appliances the center of attention, but rather enhancing users' lives in an unobtrusive manner. In the ubiquitous computing environment, services should be triggered by environmental situations instead of user's explicit actions. This paper analyzes the triggers needed to provide services from the viewpoint of time, location and objects, shows an architecture to achieve services in the ubiquitous computing environment, and presents a prototype of the real world model for the service platform.
Evaluating ERP Performance from User Perspective
Authors: Jen-Yin Yeh
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Over the past decade, organizations have spent billions of dollars implementing ERP systems. Most of evaluation methodologies for ERP systems originated in the functional/technical and/or economic/financial paradigms. Previous researches have suggested user satisfaction is one of key factor evaluating IS performance. This study investigated ERP performance from user perspective. A multi case study approach was used to collect data in 13 Taiwanese companies. The findings indicated that ERP users were satisfied with their systems in terms of task and decision support although information quality was critiqued by some users. ERP implementation was found to impact employee's feelings, physical needs and psychological states.
View-Dependent Rendering of Large-Scale Molecular Models using Level of Detail
Authors: Jun Lee, Sungjun Park, Jee-In Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Real-time surface rendering of large-scale molecular models such as a colon bacillus requires a great number of polygons to be displayed. Since a long latency of display and manipulation is fatal in maintaining presence in a virtual environment, high performance computing power and high quality graphical components are required to exercise realtime rendering of large-scale molecular model. Such as a colon bacillus. The rendering requires to provide high quality images of a critical part which is called as an active site combines with other molecule like a new drug. We propose an algorithm which enables a PC level computer to render and display large-scale molecular models in real-time. The proposed algorithm adaptively visualizes large-scale molecular models and support high quality rendering of active site. We tested our algorithm with molecular models of which polygons range from 533,774 polygons to 2,656,246 polygons. Our system enables biologists to display and manipulate large-scale molecular models in real-time which cannot be done fast enough to be used in a virtual environment using the conventional systems.