ppxscal/embedding_network huggingface dataset:
Stride scheduling for time-critical collision detection
Authors: Daniel S. Coming, Oliver G. Staadt
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

We present an event-based scheduling method for time-critical collision detection that meets time constraints by balancing and prioritizing computation spent on intersection tests without starvation. Our approach tests each potentially colliding pair of objects at a different frequency, with unbounded temporal resolution. We preserve believability by adaptively prioritizing intersection tests to reduce errors in collision detection, using information about the objects and scene. By combining kinetic sweep and prune with stride scheduling we interleave rendering, broad phase collision pruning, narrow phase intersection testing, and collision response. This approach accrues no per-frame overhead and allows interruption at any point in collision detection, including the broad phase.
PostB: The Post-condition Extension onto the B-Method
Authors: Shuaiqiang Wang, Ying Li, Guodong Huang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In the traditional B-Method, operations are designed only by pre-conditions and a series of substitutions, and it works well. However, with the appearance and development of the modeling by the integration of semi-formal methods (especially UML) and formal methods, the condition changes. Without the formal notations interrelated to the post-condition, B-Method cannot be embedded into UML models conveniently and flexibly in order to exert all its powers to describe systems exactly. This conditions indeed limit the adoption of B, and it is really necessary to extend the correlative definitions and properties. Therefore, this paper proposes the PostB, the extension referred to the formal notations of the post-condition to the B Method, as well as the extended set-theorem models and proof obligations referred to it.
Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule
Authors: Gao Shang, Zhang Lei, Zhuang Fengting, Zhang Chunxian
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best data sequence. A new algorithm which integrates ACO and AR is proposed to solve TSP problems. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, the new algorithm is better than ACO.
eSMP: A Multicast Protocol to Minimize SOAP Network Traffic in Low Bandwidth Environments
Authors: Khoi Anh Phan, Zahir Tari, Peter Bertok
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Web services, which are built on SOAP as the transport protocol, have emerged in recent years as a promising technology to enable interoperability between distributed applications. As such, SOAP may be used to handle a large number of transactions; and consequently it is desirable to have SOAP perform efficiently in high traffic environments. This paper presents eSMP, an extension of our previous work on a similarity-based SOAP multicast protocol (SMP). eSMP offers improvements over SMP in terms of traffic size by using its own routing protocol instead of the conventional shortest path algorithm to route messages to paths that will minimize the number of bytes transmitted in the network. From extensive experiments, it is shown that eSMP achieves a minimum of 25 percent reduction in total network traffic than SMP with a tradeoff of 10 percent increase in average response time. Compared to unicast, bandwidth consumptions can by reduced by up to 80 percent when using eSMP and 70 percent when using SMP. Therefore, eSMP is suitable for applications where bandwidth requirement is critical but not time.
Guest Editor's Introduction: Multimedia Signal Processing and Systems in Healthcare and Life Sciences
Authors: Nevenka Dimitrova
Venue: IEEE MultiMedia (2007)

The guest editor discusses the articles contained in this special issue and explains how this special issue reflects trends, challenges, and opportunities in the field at large.
An analysis of the hart intercivic DAU eSlate
Authors: Elliot Proebstel, Sean Riddle, Francis Hsu, Justin Cummins, Freddie Oakley, Tom Stanionis, Matt Bishop
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

This paper reports on an analysis of the Hart Inter-Civic DAU eSlate unit equipped for disabled access and the associated Judge's Booth Controller. The analysis examines whether the eSlate and JBC can be subverted to compromise the accuracy of vote totals, the secrecy of the ballot, and the availability of the system under the procedures in place for Yolo County. We describe several potential attacks, and show how election officials can block or mitigate them.
Sample-based estimation of correlation ratio with polynomial approximation
Authors: Daniel Lewandowski, Roger M. Cooke, Radboud J. Duintjer Tebbens
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2007)

Sensitivity analysis has become a natural step in the uncertainty analysis framework. As there is no general sensitivity measure that would capture all information on impact of input factors on model output, analysts tend to combine various measures to obtain a broader image of interactions between different modes. This article concentrates on the correlation ratio, demonstrates methods for calculating this quantity efficiently and accurately, and compares the results. A new method inspired by artificial intelligence techniques emerges as outperforming the familiar methods.
ID-Based Threshold Signature and Mediated Signature Schemes
Authors: Yong Yu, Bo Yang, Ying Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

One inherent drawback of current Identity based (IDbased) cryptosystems is that they cannot provide an efficient solution to immediately revoke a user's identity. In this paper, we firstly propose an ID-based threshold signature scheme and show that it has the properties of unforgeability and robustness. Then, inspired by Boneh et al.'s idea of mediated RSA, based on the proposed threshold signature scheme, we construct an ID-based mediated signature scheme, where an immediate revocation of a user's identity in ID-based cryptosystems can be obtained.
Mutual Information for Lucas-Kanade Tracking (MILK): An Inverse Compositional Formulation
Authors: Nicholas Dowson, Richard Bowden
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Mutual Information (MI) is popular for registration via function optimisation. This work proposes an inverse compositional formulation of MI for Levenberg-Marquardt optimisation. This yields a constant Hessian, which may be pre-computed. Speed improvements of 15% were obtained, with convergence accuracies similar to those of the standard formulation.
Appropriation by adornments: personalization makes the everyday life more pleasant
Authors: Petra Ahde
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This paper describes the importance of adornments in the process of appropriation. When a product, place or space is singularized, it is made personal by marking or labeling it with visible or invisible signs. These visible signs are often adornments, but the invisible signs are in the mind of the owners. With these adornments people mark their pleasurable and significant products, places and spaces. The significance of an object can be experienced regardless of the value of the material. The pleasurable experiences related to the products, or pleasurable experiences in the places, make them important.
Flying over a polyhedral terrain
Authors: Hamid Zarrabi-Zadeh
Venue: Information Processing Letters (2008)

We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p>=1, computes a (c+@e)-approximation to the L"p-shortest path above a polyhedral terrain in O(n@elognloglogn) time and O(nlogn) space, where n is the number of vertices of the terrain, and c=2^(^p^-^1^)^/^p. This leads to a FPTAS for the problem in L"1 metric, a (2+@e)-factor approximation algorithm in Euclidean space, and a 2-approximation algorithm in the general L"p metric.
Exploiting type-awareness in a self-recovering disk
Authors: Kiron Vijayasankar, Gopalan Sivathanu, Swaminathan Sundararaman, Erez Zadok
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

Data recoverability in the face of partial disk errors is an important prerequisite in modern storage. We have designed and implemented a prototype disk system that automatically ensures the integrity of stored data, and transparently recovers vital data in the event of integrity violations. We show that by using pointer knowledge, effective integrity assurance can be performed inside a block-based disk with negligible performance overheads. We also show how semantics-aware replication of blocks can help improve the recoverability of data in the event of partial disk errors with small space overheads. Our evaluation results show that for normal user workloads, our disk system has a performance overhead of only 1-5% compared to traditional disks.
A subthreshold CMOS circuit for a piecewise linear neuromorphic oscillator with current-mode low-pass filters
Authors: Kazuki Nakada, Tetsuya Asai, Tetsuya Hirose, Hatsuo Hayashi, Yoshihito Amemiya
Venue: Neurocomputing (2007)

We propose an analog current-mode subthreshold CMOS circuit implementing a piecewise linear neuromorphic oscillator. Our circuit was derived from a piecewise linear oscillator model proposed by Matsuoka, well known as a building block for constructing a robot locomotion controller. We modified Matsuoka's oscillator to be suitable for analog current-mode integrated circuit implementation, and designed and fabricated it as an analog current-mode circuit. Through circuit simulations and experimental results on a fabricated chip, we demonstrate that our neuromorphic oscillator generates a stable oscillation, and the amplitude and frequency of the oscillation can be controlled by tuning bias currents over a wide range. Further, we propose a compensation for device mismatch in the neuromorphic oscillator through feedback from a coupled physical system.
Adaptive teams of autonomous aerial and ground robots for situational awareness: Field Reports
Authors: M. Ani Hsieh, Anthony Cowley, James F. Keller, Luiz Chaimowicz, Ben Grocholsky, Vijay Kumar, Camillo J. Taylor, Yoichiro Endo, Ronald C. Arkin, Boyoon Jung, Denis F. Wolf, Gaurav S. Sukhatme, Douglas C. MacKenzie
Venue: Journal of Field Robotics (2007)

In this paper, we report on the integration challenges of the various component technologies developed toward the establishment of a framework for deploying an adaptive system of heterogeneous robots for urban surveillance. In our integrated experiment and demonstration, aerial robots generate maps that are used to design navigation controllers and plan missions for the team. A team of ground robots constructs a radio-signal strength map that is used as an aid for planning missions. Multiple robots establish a mobile ad hoc communication network that is aware of the radio-signal strength between nodes, and can adapt to changing conditions to maintain connectivity. Finally, the team of aerial and ground robots is able to monitor a small village, and search for and localize human targets by the color of the uniform, while ensuring that the information from the team is available to a remotely located human operator. The key component technologies and contributions include: (a) Mission specification and planning software; (b) exploration and mapping of radio-signal strengths in an urban environment; (c) programming abstractions and composition of controllers for multirobot deployment; (d) cooperative control strategies for search, identification, and localization of targets; and (e) three-dimensional mapping in an urban setting. &copy; 2007 Wiley Periodicals, Inc.
Performance and user based analysis of a collaborative virtual environment system
Authors: Maria Andréia Formico Rodrigues, Ricardo Régis Cavalcante Chaves
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In this work, we analyse the effect of network parameters on the judged usability of a collaborative virtual environment. Participants were trained to find the exit of a virtual maze by a trainer, which guided the exploration of the virtual space. An extensive experimental evaluation was conducted by simulating a series of operational parameters (network bandwidth and latency) to assess the reported effectiveness of the training. An objective similarity metric based on processing time per test was also defined and used, as well as subjective user's evaluations. Further, we have successfully correlated subjective evaluation and objective measure by computing the correlation values and showing how the two values co-vary.
Address/memory management for a gigantic LISP environment or, GC considered harmful
Authors: Jon L White
Venue: ACM SIGPLAN Lisp Pointers (1987)

The possibility of incredibly cheap, fantastically large media for storage gives rise to a realistic LISP memory management scheme under which GC may be postponed for days, or even indefinitely; the idea is encapsulated in the acronym "DDI" --- "GC? Don't Do It!". Tertiary memory is used to archive pages of the LISP environment which are perhaps reclaimable. but which have not been proven so; whereas the standard technique of "paging" is used to swap active data from the main memory to a secondary store such as magnetic disk. Some scenarios are presented considering a variety of currently-available technologies, and of one speculative possibility --- videodisc --- by which a requisite compactifying GC would be done "overnight", or over the weekend. With enough tertiary available, one design could last for over 12 years without a GC. "Write-once" memories, probably unusable for most applications, would not be at a disadvantage here.
Evaluating a computer literacy curriculum: a comparative study of evaluation procedures for validating a computer literacy curriculum
Authors: Barbara L. Kurshan, Thomas M. Sherman
Venue: ACM SIGCUE Outlook (1978)

A multi-measure validation procedure was employed to evaluate a computer literacy curriculum. The evaluation was based upon the assumption that a comparison of results from several validation techniques produces more conclusive evidence about transfer hypotheses generated for the curriculum. The evaluation process was enhanced by the development and use of a sequenced decision-making procedure through which validation data from many sources could be employed. The results of the evaluation were used to produce a validated and reproducible curriculum consisting of sixty-two specific computer literacy objectives relating to five major goals or objectives.
Servers for BT's interactive TV services
Authors: G. W. Kerr
Venue: BT Technology Journal (2007)

Servers are a major component in an interactive TV service, and once systems of only modest size are considered, the technology requirements are challenging. If BT moves to a roll-out of broadband interactive TV services, then close working with chosen suppliers will be required if costs are to be viable.This paper looks at some server architectures and technologies that might eventually be part of BT's interactive TV service.
Practices of Grid Computing for Genome Alternative Splicing Analysis
Authors: YU Huashan, Kong Lei
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Alternative splicing analysis represents a typical computing pattern in bioinformatics. In such a problem's domain, there are massive and irregular batch jobs. It is critical to improve such a computation's efficiency and reduce the cost. Based on computational Grid technologies, a solution has been devised. The solution consists of a Grid service model for representing heterogeneous resources, a WS Service-Group for dynamically discovering as many appropriate resources as possible, and a WS Service- Group for performing massive, irregular batch jobs on distributed resources in a parallel and optimized way. The solution has been implemented in Harmonia, a computational Grid software platform developed by Peking University. Experiments has approved the solutions feasibility and practicability, also has presented some hints for improving its efficiency.
Classifier fitness based on accuracy
Authors: Stewart W. Wilson
Venue: Evolutionary Computation (1995)

In many classifier systems, the classifier strength parameter serves as a predictor of future payoff and as the classifier's fitness for the genetic algorithm. We investigate a classifier system, XCS, in which each classifier maintains a prediction of expected payoff, but the classifier's fitness is given by a measure of the prediction's accuracy. The system executes the genetic algorithm in niches defined by the match sets, instead of panmictically. These aspects of XCS result in its population tending to form a complete and accurate mapping X × A → P from inputs and actions to payoff predictions. Further, XCS tends to evolve classifiers that are maximally general, subject to an accuracy criterion. Besides introducing a new direction for classifier system research, these properties of XCS make it suitable for a wide range of reinforcement learning situations where generalization over states is desirable.
Large scale P2P distribution of open-source software
Authors: Serge Abiteboul, Itay Dar, Radu Pop, Gabriel Vasile, Dan Vodislav, Nicoleta Preda
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Open-source software communities currently face an increasing complexity in managing and distributing software content among their developers and contributors. This is mainly due to the continuously growing size of the software, of the community, the high frequency of updates, and the heterogeneity of the participants. We propose a large scale P2P distribution system that tackles two main issues in software content management: efficient content dissemination and advanced information system capabilities.
A Data Access Scheme of Heterogeneous Data Resource in Grid
Authors: Gui Liu, Hongyu Zhu, Xianghui Xie, Xiaoliang Lu, Linsheng Lu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Under Grid environments, how to access a set of heterogeneous data resource in a uniformed way is a well studied subject. The two most important problems about it are: 1. how to hide the different access manners of different data resources and 2. how to map real data to virtual data which can be used by various applications. In this paper, the Data Grid virtual access and integration tool: virtual Data Center has been designed to meet these new challenges. It addresses a new paradigms and constraints which deeply impacts data access. At the same time, the virtual data access possibilities and an automated method for data resources integrating and heterogeneous data resource access are promoted.
Web Service-Based Dynamic Resource and Job Managements for Large-Scale and Long-Time Grid Computations
Authors: Yingwen Song, Yoshio Tanaka, Hiroshi Takemiya, Satoshi Sekiguchi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In order to guarantee large-scale and long-time appli- cations to execute smoothly in a dynamic and heteroge- neous grid environment, we have designed and implemented a framework by which users can reserve and allocate on- demand resources, and manage their jobs from within grid- enabled applications. This framework is based on a three- tier architecture that consists of client API, centralized bro- ker of resource and job managements, and backend services on resource reservation and job scheduling. The reserva- tion service is currently based on Maui, and the job schedul- ing service is DRMAA (Distributed Resource Management Application API) compliant. In this paper, we present the API functionality, the architecture, and the implementation of this framework.
On the probabilistic epipolar geometry
Authors: Sami S. Brandt
Venue: Image and Vision Computing (2008)

In this paper, we are going to answer the following question: assuming that we have estimates for the epipolar geometry and its uncertainty between two views, how probable is it that a new, independent point pair will satisfy the true epipolar geometry and be, in this sense, a feasible candidate correspondence pair? If we knew the true fundamental matrix, the answer would be trivial but in reality we do not know it because of estimation errors. So, as an independent point in the first view is given, we will show we may compute the point-probability-density function, termed as the epipolar pdf, for the epipolar line points in the second view that describes the current level of knowledge of the epipolar geometry between the views. This point-point-probability-density relation is a probabilistic form of the epipolar constraint that also approaches the true point-line relation as the number of training correspondences tends to infinity. In this paper, we will also show that the eigenvectors of the epipolar line covariance matrix have certain interpretations on the image plane, of which one is the previously observed, narrowest point of the epipolar envelope. The results of this paper are important since the uncertainty of the epipolar constraint can be now taken into account in a sound way in applications.
A Specification Method for Specifying Data and Procedural Abstractions
Authors: B. G. Claybrook
Venue: IEEE Transactions on Software Engineering (1982)

A specifilcation method designed primarily for specifying data abstractions, but suitable for specifying procedural abstractions as well, is described. The specification method is based on the abstract model approach to specifying abstractions. Several data abstractions and procedural abstractions are specified and a proof of implementation correctness is given for one of the data abstractions-a symbol table.
Performance of Synchronized Iterative Processes in Multiprocessor Systems
Authors: M. Dubois
Venue: IEEE Transactions on Software Engineering (1982)

A general methodology for studying the degree of matching between an architecture and an algorithm is introduced and applied to the case of synchronized iterative algorithms in MIMD machines.
Nonorthogonal Projections for Feature Extraction in Pattern Recognition
Authors: T. W. Calvert
Venue: IEEE Transactions on Computers (1970)

It is known that R linearly separable classes of multidimensional pattern vectors can always be represented in a feature space of at most R dimensions. An approach is developed which can frequently be used to find a nonorthogonal transformation to project the patterns into a feature space of considerably lower dimensionality. Examples involving classification of handwritten and printed digits are used to illustrate the technique.