ppxscal/embedding_network huggingface dataset:
A system for the capture and synthesis of insect motion
Authors: D. P. Gibson, D. J. Oziem, C. J. Dalton, N. W. Campbell
Venue: Graphical Models (2007)

We present an integrated system that enables the capture and synthesis of 3D motions of small scale dynamic creatures, typically insects and arachnids, in order to drive computer generated models. The system consists of a number of stages, initially, the acquisition of a multi-view calibration scene and synchronised video footage of a subject performing some action is carried out. A user guided labelling process, that can be semi-automated using tracking techniques and a 3D point generating algorithm, then enables a full metric calibration and captures the motions of specific points on the subject. The 3D motions extracted, which often come from a limited number of frames of the original footage, are then extended to generate potentially infinitely long, characteristic motion sequences for multiple similar subjects. Finally a novel path following algorithm is used to find optimal path along with coherent motion for synthetic subjects.
Securing distributed data storage and retrieval in sensor networks
Authors: Nalin Subramanian, Chanjun Yang, Wensheng Zhang
Venue: Pervasive and Mobile Computing (2007)

Sensor networks have been an attractive platform for pervasive computing and communication. However, they are vulnerable to attacks if deployed in hostile environments. The past research of sensor network security has focused on securing information in communication, but how to secure information in storage has been overlooked. Meanwhile, distributed data storage and retrieval have become popular for efficient data management in sensor networks, which renders the absence of schemes for securing stored information to be a more severe problem. Therefore, we propose three evolutionary schemes, namely, the simple hash-based (SHB) scheme, the enhanced hash-based (EHB) scheme, and the adaptive polynomial-based (APB) scheme, to deal with the problem. All the schemes have the properties that only authorized entities can access data stored in the sensor network, and the schemes are resilient to a large number of sensor node compromises. The EHB and the APB schemes do not involve any centralized entity except for a few initialization or renewal operations, and thus support secure, distributed data storage and retrieval. The APB scheme further provides high scalability and flexibility, and hence is the most suitable among the three schemes for real applications. The schemes were evaluated through extensive analysis and TOSSIM-based simulations.
Using FPGA configuration memory to accelerate yield learning for advanced process
Authors: Jenny Fan, Xiao-Yu Li, Ismed Hartanto
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The configuration memory is irregularly placed in a FPGA (Field Programmable Gate Array) chip and physically attached to the programmable logic circuits. This type of memory is more powerful than standard SRAM to monitor random or systematic process defects because the configuration memory test catches defects in both the memory cell and logic circuits. This paper will demonstrate a methodology of using this capability to accelerate yield learning for advanced process.
A Technique to Reduce Peak Current and Average Power Dissipation in Scan Designs by Limited Capture
Authors: Seongmoon Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, a technique that can efficiently reduce peak and average switching activity during test application is proposed. The proposed method does not require any specific clock tree construction, special scan cells, or scan chain reordering. Test cubes generated by any combinational ATPG can be processed by the proposed method to reduce peak and average switching activity without any capture violation. Switching activity during scan shift cycles is reduced by assigning identical values to adjacent scan inputs and switching activity during capture cycles is reduced by limiting the number of scan chains that capture responses. Hardware overhead for the proposed method is negligible. The peak transition is reduced by about 40% and average number of transitions is reduced by about 56-85%. This reduction in peak and average switching activity is achieved with no decrease in fault coverage.
Image Quality Evaluation Based on No-reference Method with Visual Component Detection
Authors: Li Zhu, Guoyou Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, we present a new image quality assessment that does not rely on reference images. Our model is to estimate human quality assessment by detecting visual components, then assessing quality by empirical model. We describe an instance of this model with visual component detection, and quality modeling is estimated using radial basis function (RBF) networks. Experiments with this prototype system show better results for Human Visual System(HVS).
Comments on "The Anomalous Behavior of Flip-Flops in Synchronizer Circuits"
Authors: G. Lacroix
Venue: IEEE Transactions on Computers (1982)

In the above paper1 Fleishchhammer and Dortok present a measurement system to analyze the metastable state in synchronizer circuits. We present the specific measures which have to be taken in the design for such a system to get intrinsic characterization of circuits. We propose a measurement system based on the introduction of a new parameter of synchronizer circuits allowing an accurate characterization of the considered phenomenom. Some results are given concerning standard flip-flops.
Failure Detection in Large-Scale Internet Services by Principal Subspace Mapping
Authors: Haifeng Chen, Guofei Jiang, Kenji Yoshihira
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Fast and accurate failure detection is becoming essential in managing large scale Internet services. This paper proposes a novel detection approach based on the subspace mapping between system inputs and internal measurements. By exploring these contextual dependencies, our detector can initiate repair actions accurately, increasing the availability of system. While a classical statistical method, the canonical correlation analysis (CCA), is presented in the paper to achieve subspace mapping, we also propose a more advanced technique, the principal canonical correlation analysis (PCCA), to improve the performance of CCA based detector. PCCA extracts a principal subspace from internal measurements that is not only highly correlated with the inputs, but also a significant representative of original measurements. Experimental results on a J2EE based web application demonstrate that such property of PCCA is especially beneficial to failure detection tasks.
Contribution of Multiresolution Description for Archive Document Structure Recognition
Authors: A. Lemaitre, J. Camillerapp, B. Couasnon
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

When reading a document, we intuitively have a first global approach in order to determine the whole structure, before reading parts in details. We propose to apply the same kind of mechanism by introducing the concept of mul- tiresolution in an existing generic method for structured document recognition. This new combination of different vision levels makes it possible to recognize low structured documents. We present our work on an example: the multiresolution description of archive documents that are naturalization de- cree registers from the 19th and 20th century. The valida- tion has been made on 85,088 images. Integrated in a plat- form for archive documents, the located elements offers to users a fast leaf through naturalization decrees.
Modeling Process Patterns and Their Application
Authors: Hanh Nhi Tran, Bernard Coulette, Bich Thuy Dong
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Process pattern is an emerging approach for process reuse. Representing process models based on process patterns to explicit process solutions and factor recurrent process constituents is useful for process understanding as well as process modeling. This subject, however, is still a challenge for the software process technology community. In this paper, we present a UML-based process meta-model that allows explicit representation of process patterns in process models. The novel of our proposition is to enable the application of different process knowledge kinds not only for building but also for improving process models.
Visualisation techniques to support derivation tasks in software product line development
Authors: Daren Nestor, Luke O'Malley, Patrick Healy, Aaron Quigley, Steffen Thiel
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Adopting a software product line approach allows companies to realise significant improvements in time-to-market, cost, productivity, and system quality, A fundamental problem in software product line engineering is the fact that a product line of industrial size can easily incorporate several thousand variation points. The scale and interdependencies can lead to variability management and product derivation tasks that are extremely complex to manage. This paper investigates visualisation techniques to support and improve the effectiveness of these tasks.
Competition of large-scale projects: The game model of gas pipeline construction
Authors: S. A. Brykalov, M. A. Melentsova, O. I. Nikonov
Venue: Automation and Remote Control (2007)

Consideration is given to the problem of large-scale projects competition in the formulation motivated by real problems of defining the rational development of oil and gas transportation systems. The problem is formulated as a noncooperative game of n persons. Standard existence theorems and algorithms for computing the Nash equilibrium solutions are not applicable to it. For the case when all functional parameters of the problem are defined by exponential functions, a finite solution algorithm is proposed. Here is developed the approach proposed and studied in [1---5].
Evaluation of High-tech Program Based on Rough Set Theory
Authors: Tinghuai Ma, Meili Tang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Evaluating and selecting high-tech program is the most important for the investment company. This paper establishes the multi-targets evaluation system, which based on rough set theory. This paper analyses the evaluation data of the high-tech program, in order to find the important and primary parameters. According to reduction of rough set, we design and implement a reduction algorithm named pruning method. Finally, an example is used to illustrate the effectiveness and practicability of the method proposed.
A New Chaos Encryption Algorithm Based on Parameter Randomly Changing
Authors: Xiao-jun Tong, Ming-gen Cui
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The paper proposed a new encryption algorithm of one dimension chaotic map, which based on parameter randomly changing. Through the randomly changing of parameter and iteration times, the complicated degree of chaotic sequences and cryptographic specific property are strengthened, and improved algorithm has n2 times long cycle compared to original function. Theory analysis to the mapping is well-distributed, and self-correlation and mutual -correlation is also good property. Through encryption test, it shows that new algorithm has high security , is realized easily ,and the encryption speed is very fast.
Lisp environments
Authors: John Foderaro
Venue: ACM SIGPLAN Lisp Pointers (1987)

In this issue we survey the Lisp programming environment provided on the family of Lisp machines built by Xerox. These machines, which once ran only Interlisp-D, are now said to run 'Xerox Lisp' which is a combination of Interlisp-D and Common Lisp. 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
API Tests for RAM Chips
Authors: V. P. Srini
Venue: Computer (1977)

With 16K RAM chips already in commercial use and 64K RAM chips being planned, the increasing length of time needed to run test patterns could lead to cost increases that would offset the advantages of the larger devices. For example, many existing tests of the important pattern-sensitive-fault class, such as galloping 0's and 1's,* require a test length proportional to the square of the number of bits in the RAM chip.1-4Clearly, the time consumed by such tests looms as a major component in the overall costs of chip production.
Xregion: A structure-based approach to Storing XML Data in Relational Databases
Authors: Li-Yan Yuan, Meng Xue
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we propose a new structure-based approach, called Xregion, to store XML data in relational databases. Our approach first partitions an XML document into several disjoint regions according to the cardinality of element nodes, and then maps these regions into separate relations. Our experimental results demonstrate that the proposed approach dramatically improves the performance of queries on the XML data over the existing approaches.
On Extending IMS Services to WLANs
Authors: Ahmed Hasswa, Abd-Elhamid Taha, Hossam Hassanein
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The IP Multimedia Subsystem (IMS) provides a framework that accommodates current and future services in wired and wireless networks. However, IMS does not handle non- 3G elements such as Wireless Local Area Networks (WLANs). In order to provide interconnection at the service layer between 3G and WLANs, interworking between IMS and WLAN is necessary. Extending IMS beyond 3G to WLANs is a crucial step towards the evolution of a seamless universal next generation wireless network, commonly known as 4G. In this paper, a novel architecture for service layer interworking between WLAN and 3G is presented. The architecture takes into consideration the interaction of WLAN Application SIP servers with the IMS Call Session Control Functions (CSCFs) and the extensibility of Application Servers (ASs) beyond the core IMS network. A WLAN AS is introduced into the IMS network and an SIP server into the WLAN. These act as interworking arbitrators and communicate with each other to provide service and session continuity. The main advantage of this architecture is its feasibility within the standard. It is also non-intrusive to the IMS core or the WLAN.
A Pragmatic Introduction to Courseware Design
Authors: J. Nievergelt
Venue: Computer (1980)

After surveying the history of CAI, this article clarifies environmental requirements and presents a practical set of stylistic dos and don'ts for writing instructional material. 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
A control theory framework for performance evaluation of mobile manipulators
Authors: Katarzyna Zadarnowska, Krzysztof Tchoń
Venue: Robotica (2007)

We propose a new, control theoretic methodology for defining performance measures of mobile manipulators. As a guiding principle, we assume that the kinematics or the dynamics of a mobile manipulator are represented by the end point map of a control system with outputs, and that a locally controllable system yields nontrivial performance measures. In the paper, we focus on two categories of dynamic performance measures: the compliance measure and the admittance measure. In both these categories, the following local and global performance characteristics are introduced: the agility ellipsoid, the agility and mobility, the condition number and the distortion. The usefulness of new local measures is demonstrated on the example of determining optimal motion patterns of a wheeled mobile robot.
A Conceptual Incentive Mechanism of P2P File Sharing Systems Based on Game Theory
Authors: Xue Kai-ping, Wang Qi, Hong Pei-lin, Lu Han-cheng, Hu Ming-xiu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Selfish adaptive peers are widespread in Peer to Peer(P2P) file sharing systems, whose actions greatly reduce the system's performance. So how to maintain significant levels of cooperation to encourage collaborative is an important aspect of P2P research. In this paper, the cooperation models of P2P file sharing systems are constructed based on the Prisoner's Dilemma Game (PDG) and the Snowdrift Game (SG), which add a new viewpoint to P2P file sharing systems understanding. In particular, the performances of the two models are investigated in three aspects: the frequency of cooperation, the equilibrium-time, and the full completion time, which indicate that both the PDG and the SG can effectively motive cooperation against free riding. In addition, the SG performs better than the PDG in promoting peers to share what they have, which suggests theoretic guidelines to design a good incentive mechanism in the future.
A Memetic Differential Evolutionary Algorithm for High Dimensional Functions' Optimization
Authors: Yu Gao, Yong-Jun Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A differential evolutionary (DE) algorithm modified by initialization and Local searching is proposed. In the new algorithm, the stochastic properties of chaotic system is used to spread the individuals in search spaces as much as possible, the simplex search method is employed to speed up the local exploiting and the DE operators help the algorithm to jump to a better point. Numerical experiments on benchmark examples including 13 high dimensional functions demonstrate that the new method achieved an improved success rate and final solution with less computational effort.
Transaction Management for Grid Workflow Applications
Authors: Feilong Tang, Minglu Li, Minyi Guo, Zhengwei Qi, Yi Wang, Yanqin Yang, Daqiang Zhang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

As Grid technology is expanding from scientific computing to business applications, transactional workflow management emerges as one of the most important services for Grids. The ShanghaiGrid project launched in Shanghai, China implemented a basic workflow service without the reliability support. In this paper 1 , we propose a transactional Grid workflow service (GridTW), providing a reliable and automatic workflow management for the ShanghaiGrid as well as other Grid workflow applications. This paper focuses on how to manage Grid transactions and combine transaction management with the workflow service. We present an automatic compensation based coordination algorithm with which the GridTW guarantees the reliability of Grid workflows. An important feature of our algorithm is that it can adapt to the dynamics Grid applications by the event- and condition-driven mechanism, and allows users to select execution results from committed subtransactions.
Hybrid Detectors for Subpixel Targets
Authors: Joshua Broadwater, Rama Chellappa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Subpixel detection is a challenging problem in hyperspectral imagery analysis. Since the target size is smaller than the size of a pixel, detection algorithms must rely solely on spectral information. A number of different algorithms have been developed over the years to accomplish this task, but most detectors have taken either a purely statistical or a physics-based approach to the problem. We present two new hybrid detectors that take advantage of these approaches by modeling the background using both physics and statistics. Results demonstrate improved performance over the well known AMSD and ACE subpixel algorithms in experiments that include multiple targets, images, and area types -- especially when dealing with weak targets in complex backgrounds.
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
Authors: D. J. Kuck
Venue: IEEE Transactions on Computers (1972)

This paper is concerned with the problem of analyzing ordinary Fortran-like programs to determine how many of their operations could be performed simultaneously. Algorithms are presented for handling arithmetic assignment statements, DO loops and IF statement trees. The height of the parse trees of arithmetic expressions is reduced by distribution of multiplication over addition as well as the use of associativity and commutativity. DO loops are analyzed in terms of their index sets and subscript forms. Some general underlying assumptions about machine organization are also given. In terms of several measures which are defined, the results of experimental analyses are presented. About 20 Fortran IV programs consisting of nearly 1000 source cards were analyzed. Evidence is given that for very simple Fortran programs 16 processors could be effectively used operating simultaneously in a parallel or pipeline fashion. Thus, for medium or large size Fortran programs, machines consisting of multiples of a basic 16 processor unit could be used.
The contents-sharable management system for active learning
Authors: Mizue Kayama, Toshio Okamoto
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The purpose of this study is to explore the architecture for collaborative learning environment, in which individual learning and collaborative learning are smoothly connected. We proposed the composition model of a collaborative workplace, and the management model to the action in collaborative learning space and the state of learning context. Based on the previous proposals, in this paper we describe the mechanism for Contents-Sharable between a private workplace and a collaborative workplace.
Implementation and Performance Evaluation of a P2PSIP Distributed Proxy/Registrar
Authors: Jean-Francois Wauthy, Laurent Schumacher
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In this paper, the design of a distributed Proxy/Registrar based on Distributed Hash Tables is discussed. Three implementations, relying on OpenChord and Bamboo, are presented, and two of them are thoroughly tested in registration and call scenarios. In a distributed configuration with loadbalancing, this distributed Proxy/Registrarmanages to handle 1,500+ REGISTER requests per second and 700+ call attempts per second. These performance show that P2PSIP is a valid option for large, decentralized set-ups.