ppxscal/embedding_network huggingface dataset:
Toward Distributed Service Discovery in Pervasive Computing Environments
Authors: Dipanjan Chakraborty Anupam Joshi, Yelena Yesha
Venue: IEEE Transactions on Mobile Computing (2006)

The paper proposes a novel distributed service discovery protocol for pervasive environments. The protocol is based on the concepts of peer-to-peer caching of service advertisements and group-based intelligent forwarding of service requests. It does not require a service to be registered with a registry or lookup server. Services are described using the Web Ontology Language (OWL). We exploit the semantic class/subClass hierarchy of OWL to describe service groups and use this semantic information to selectively forward service requests. OWL-based service description also enables increased flexibility in service matching. We present simulation results that show that our protocol achieves increased efficiency in discovering services (compared to traditional broadcast-based mechanisms) by efficiently utilizing bandwidth via controlled forwarding of service requests.
Frame rules from answer types for code pointers
Authors: Hayo Thielecke
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed at local reasoning in the sense that only the type of a code pointer is needed, and there is no need to know the whole code itself. The main features of the type system are separation logic connectives for describing the heap, and polymorphic answer types of continuations for keeping track of jumps. Specifically, we address an interaction between separation and answer types: frame rules for local reasoning in the presence of jumps are recovered by instantiating the answer type. However, the instantiation of answer types is not sound for all types. To guarantee soundness, we restrict instantiation to closed types, where the notion of closedness arises from biorthogonality (in a sense inspired by Krivine and Pitts). A machine state is orthogonal to a disjoint heap if their combination does not lead to a fault. Closed types are sets of machine states that are orthogonal to a set of heaps. We use closed types as well-behaved answer types.
A Variadic Extension of Curry's Fixed-Point Combinator
Authors: Mayer Goldberg
Venue: Higher-Order and Symbolic Computation (2005)

We present a systematic construction of a variadic, applicative-order, multiple fixed-point combinator in Scheme. The resulting Scheme procedure is a variadic extension of the n-ary version of Curry's fixed-point combinator. It can be used to create mutually-recursive procedures, and expand letrec-expressions.
Automatic verification of parameterized systems
Authors: Amir Pnueli
Venue:  (2005)

Verification plays an indispensable role in designing reliable computer hardware and software systems. With the fast growth in design complexity and the quick turnaround in design time, formal verification has become an increasingly important technology for establishing correctness as well as for finding difficult bugs. Since there is no &ldquo;silver-bullet&rdquo; to solve all verification problems, a spectrum of powerful techniques in formal verification have been developed to tackle different verification problems and complexity issues. Depending on the nature of the problem whose most salient components are the system implementation and the property specification, a proper methodology or a combination of different techniques is applied to solve the problem. In this thesis, we focus on the research and development of formal methods to uniformly verify parameterized systems. A parameterized system is a class of systems obtained by instantiating the system parameters. Parameterized verification seeks a single correctness proof of a property for the entire class. Although the general parameterized verification problem is undecidable [AK86], it is possible to solve special classes by applying a repertoire of techniques and heuristics. Many methods in parameterized verification require a great deal of human interaction. This makes the application of these methods to real world problems infeasible. Thus, the main focus of this research is to develop techniques that can be automated to deliver proofs of safety and liveness properties. Our research combines various formal techniques such as deductive methods, abstraction and model checking. One main result in this thesis is an automatic deductive method for parameterized verification. We apply small model properties of Bounded Data Systems (a special type of parameterized system) to help prove deductive inference rules for the safety properties of BDS systems. Another methodology we developed enables us to prove liveness properties of parameterized systems via an automatic abstraction method called counter abstraction . There are several useful by-products from our research: A set of heuristics is established for the automatic generation of program invariants which can benefit deductive verification in general; also we proposed methodologies for the automatic abstraction of fairness conditions that are crucial for proving liveness properties.
Hybrid Feature Extraction and Feature Selection for Improving Recognition Accuracy of Handwritten Numerals
Authors: P. Zhang, T. D. Bui, C. Y. Suen
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The recognition of handwritten numerals is a challenging task in pattern recognition. It can be considered as one of the benchmarks in evaluating feature extraction methods and the performance of classifiers. In this paper, we propose a new method to improve the recognition accuracy of handwritten numerals by using hybrid feature extraction and random feature selection. First, we present seven feature extraction methods. A novel multi-class divergence criterion for large scale feature analysis is proposed and a random feature selection strategy is used to congregate three new hybrid feature sets. The new congregated features are complementary as they are formed from different original feature sets extracted by different means. Experiments conducted on MNIST database show that our proposed method can increase the recognition accuracy.
Unstructured MEL modelling of nonlinear unsteady ship waves
Authors: Q. X. Wang
Venue: Journal of Computational Physics (2005)

An unstructured mixed-Eulerian-Lagrangian model (MEL) is described for the simulation of the nonlinear wave-body interaction, as opposed to the structured model used widely in this field. In present model, the free surface is interpolated accurately using a polynomial scheme coupled with the moving least-squares method, and is triangulated with a local interrogation method coupled with the advancing front method to provide a high quality mesh. A new method is devised to update the free surface intersection with the body, based on the desingularized boundary-integral method. Double desingularized point sources are used for a control point at the intersection, with one inside the body and the other above the free surface, to satisfy both the body and free surface boundary conditions over there. The desingularized point sources are positioned in terms of the element sizes as well as solid angles of the boundary surface, so as to avoid possible overcrowding of the sources at the corners of the surface. Solid angles on the surface are computed analytically using the spherical triangle theory. As an illustration, the algorithm is used to simulate the wave generation for a Wigley hull, which impulsively starts to move at a constant speed on a calm water surface. The anticipated Kelvin ship-wave pattern is well simulated. The wave profiles along the hull agree well with the measured results of Nobeless and McCarthy [Proceedings of the 2nd DTNSRDC Workshop, Maryland, 1983, pp. 5-35]. As compared to a structured approach, the unstructured model reduces the CPU time and memory requirements and, being robust in handling complex geometries, is more versatile in practical applications.
On the Existence of Codimension-One Nonorientable Expanding Attractors
Authors: V. Medvedev, E. Zhuzhoma
Venue: Journal of Dynamical and Control Systems (2005)

We prove that a structurally stable diffeomorphism of any closed (2m + 1)-manifold, m ¿ 1, has no codimension one nonorientable expanding attractors. However, given any d ¿ 3, there exists an 9-stable A-diffeomorphism of a closed d-manifold with a codimension one nonorientable expanding attractor.
Elementary Science Classroom Learning with Wireless Response Devices - Implementing Active and Experiential Learning
Authors: Yu-Fen Chen, Sung-Bin Chang, Chen-Chung Liu, Tak-Wai Chan, Ming-Yu Hung, Yun-Chen Lu
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Active learning enables learners to actively engage in learning. Learning not only transfers material to students for learning, but also encourages greater mental engagement and more extensive student- student and student-instructor interaction than does a typical lecture class. Peer Instruction (PI) engages students in active learning by achieving continuous instructor-student interaction in a physics lecture. However, the methodologies and the effectiveness of implementing PI for elementary school students have seldom been clarified. This study explores the possibility of adopting PI in an elementary science classroom. The research considerations of the study are as follows: (1) how wireless technology can enhance PI in elementary science classroom; (2) how a teacher can engage students in pre-class reading, and (3) whether elementary school students have sufficient social skills to perform a PI discussion? These questions are examined by observing how the PI pedagogical model worked with a wireless response system in elementary science classroom. Based on the observation, this study also proposes a way of improving the PI learning experience of elementary school students by adding experiments and observations during peer discussion to explain concepts and phenomena in physics.
Recognizing Mimicked Autistic Self-Stimulatory Behaviors Using HMMs
Authors: Tracy Westeyn, Kristin Vadas, Xuehai Bian, Thad Starner, Gregory D. Abowd
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

Children with autism often exhibit self-stimulatory (or "stimming") behaviors. We present an on-body sensing system for continuous recognition of stimming activity. By creating a system to recognize and monitor stimming behaviors, we hope to provide autism researchers with detailed, quantitative data. In this paper, we compare isolated and continuous recognition rates of emulated autistic stimming behaviors using hidden Markov models (HMMs). We achieved an overall system accuracy 68.57% in continuous recognition tests. However, the occurrence of stimming events can be detected with 100% accuracy by allowing minor frame-level insertion errors.
The DRI Motor Vehicle prospects model: an example of econometrics and simulation
Authors: Edward Matluck
Venue: ACM SIGSIM Simulation Digest (1977)

This paper outlines DRI's Motor Vehicles prospect model and presents the results of some sample simulations. The model demonstrates how econometric and simulation techniques can be fruitfully applied at the micro economic level.The model is designed to assess the effects of changes in motor vehicle technology on all facets of the industry. The user first configures the vehicles to be produced over the forecast horizon. Simulation of the model then yields yearly bills of materials, production and investment costs, fuel economy and other fleet characteristics over a forecast horizon. The demand sector of the model forecasts new vehicle sales by market segment as a function of economic and demographic behavior. Final fleet characteristics are thus a function of both the supply and demand for motor vehicles.The model is currently being used by business and government. It is a natural tool for use in making fuel economy estimates and evaluation of motor fuel related energy policy issues. For materials suppliers it is a valuable aid for both long and short term planning. In the automotive after-market it can depict the current and future demand for individual replacement parts with a high degree of accuracy. 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
Boosting-based Transductive Learning for Text Detection
Authors: David Bargeron, Paul Viola, Patrice Simard
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We present a promising new framework for improving boosting performance with transductive inference when training an automatic text detector. The resulting detector is fast and efficient, and it exhibits high accuracy on a large test set.
Knowledge construction in a geographically disparate, cross-indigenous, computer-supported, collaborative context
Authors: Richard Baker Hall
Venue:  (2005)

There is a lack of knowledge (prescriptions, guidelines, specifications) relative to geographically disparate, computer-supported, collaborative, intercultural teams who must effectively learn and work together on tasks of common purpose at the interface of cultures. Prescriptive models are needed that will successfully facilitate and sustain cross-indigenous, computer-supported collaboration (CSC). The present study approaches the problem from a cross-indigenous perspective rooted in psychology with a Chinese x&imacr;nl&imacr;xu&eacute; orientation embedded within a socio-constructivist pedagogy via a computer-supported collaborative medium. Using a between-subjects design, twelve post-baccalaureate participants from U.S. and Chinese Heritage Cultures (CHC) were assigned to computer-supported collaborative teams consisting of one of three possible levels of cultural configuration (CHC/CHC, CHC/US, and US/US). Teams independently worked and learned together within web-enabled collaboratories using a synchronous/asynchronous tool suite. Each team was asked to determine whether analogous elements exist within CHC that could augment or supersede the utility of the existing American model for successful CSC. Six models exhibiting various degrees of hybridity emerged from the intercultural and culturally homogenous CHC teams as expected. These models are treated both quantitatively (in terms of IM transcript dialog data, along with supporting model comparisons and post-test questionnaire responses), and qualitatively through interviews. The findings have implications for computer-supported collaborative work and learning, instructional designers, trainers in globally distributed companies, distance learning programs, and the increasingly diverse American classroom and workplace.
An Error-Resilient and Tunable Distributed Indexing Scheme for Wireless Data Broadcast
Authors: Jianliang Xu, Wang-Chien Lee, Xueyan Tang
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Access efficiency and energy conservation are two critical performance concerns in a wireless data broadcast system. We propose in this paper a novel parameterized index called the exponential index that has a linear yet distributed structure for wireless data broadcast. Based on two tuning knobs, index base and chunk size, the exponential index can be tuned to optimize the access latency with the tuning time bounded by a given limit, and vice versa. The client access algorithm for the exponential index under unreliable broadcast is described. A performance analysis of the exponential index is provided. Extensive ns-2-based simulation experiments are conducted to evaluate the performance under various link error probabilities. Simulation results show that the exponential index substantially outperforms the state-of-the-art indexes. In particular, it is more resilient to link errors and achieves more performance advantages from index caching. The results also demonstrate its great flexibility in trading access latency with tuning time.
High-Performance Task Distribution for Volunteer Computing
Authors: David P. Anderson, Eric Korpela, Rom Walton
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Volunteer computing projects use a task server to manage work. Clients periodically communicate with the server to report completed tasks and get new tasks. The rate at which the server can dispatch tasks may limit the computing power available to the project. This paper discusses the design of the task server in BOINC, a middleware system for volunteer computing. We present measurements of the CPU time and disk I/O used by a BOINC server, and show that a server consisting of a single inexpensive computer can distribute on the order of 8.8 million tasks per day. With two additional computers this increases to 23.6 million tasks per day.
Winning the Game of Risk: Neumann's Take on Sound Design
Authors: Laurianne McLaughlin
Venue: IEEE Security and Privacy (2005)

In an interview with Peter Neumann, he discusses the state of the information assurance discipline, as well as current market forces impacting software security, risks to the US computing infrastructure, and promising future security technologies.
eDSR: A Decentralized Service Registry for e-Commerce
Authors: Li Yin, Huang Xingli, Zou Futai, Ma Fanyuan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Electronic Commerce is driving distributed computing towards a model of service based interactions. The core of service interaction relies on the discovery of services. In this paper we propose a decentralized registry, based on a Peer-to-Peer infrastructure called eDSR for e-Commerce Service discovery. In eDSR, the service descriptions are managed in a completely decentralized way. Experimental results show that eDSR has good robustness and scalability.
On the Use of Bit Filters in Shared Nothing Partitioned Systems
Authors: Josep Aguilar-Saborit, Victor Muntes-Mulero, Calisto Zuzarte, Hebert Pereyra, Josep-L. Larriba-Pey
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Parallel query processing is in the core of many business analysis environments. Such applications impose a high demand on the computer hardware to achieve results in reasonable times, specially when queries are launched against huge amounts of warehouse data. We look into the problem of parallel query processing on large data sets focussing on a rational use of the network and memory resources. In this context, we propose a new protocol to make use of bit filters in parallel shared nothing systems for non-collocated joins. We call our protocol Remote Bit Filters with Requests (RBF_R). We have implemented a prototype of RBF_R for the first time in a major commercial database, IBM® DB2 Universal Database™ (DB2 UDB). RBFR has two important advantages over the previous usage of bit filters in the same context. First, it reduces the amount of memory used compared to previous solutions. This allows for the processing of more or larger queries. Second, the protocol itself has an insignificant impact on communication. This means that it is as efficient as the previous strategies, avoiding the saturation of the network in parallel intensive network usage environments.
Unit Detection from American Football TV Broadcast using Multimodal Content Analysis
Authors: Guy Ravitz, Mei-Ling Shyu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, a multimodal unit detection framework to detect and extract units, a novel concept towards event detection and extraction in sports TV broadcasts, is proposed. The proposed unit is defined to be a segment of a sports TV broadcast that describes a potentially interesting event, which possesses the potential of attracting the attention of the observer and satisfy his/her need of viewing the more interesting segments of the broadcast. A number of events that are considered as the unit target events are game impacting events such as score, missed score, penalties, and special game inserts, such as highlights and statistics clips. The proposed framework serves as an efficient data preprocessing procedure that can reduce the amount of data by ridding off the irrelevant data and prepare the remaining data in an efficient way for future event detection and extraction. Several experiments are conducted on various football games from different TV broadcasts, including college football and professional football. The experimental results demonstrate that the proposed framework effectively achieves the goal of data reduction, which is expected to increase the accuracy of event detection and extraction from the American football TV broadcast.
Applications of Lefschetz Numbers in Control Theory
Authors: Peter Saveliev
Venue: SIAM Journal on Control and Optimization (2005)

We develop some applications of techniques of the Lefschetz coincidence theory in control theory. The topics are existence of equilibria and their robustness, and controllability and its robustness.
Data management in peer-to-peer systems
Authors: Hector Garcia-Molina
Venue:  (2005)

The peer-to-peer (P2P) model of distributed computation is characterized by three laws: (i) all peers are born equal; (ii) the set of participant peers is dynamic and may be arbitrarily large; and (iii) peers are distributed over a wide-area network. These three laws pose significant challenges to the development of efficient data-management solutions in the P2P model. The first law requires decentralized design with no reliance on central servers, as well as load balance across peers. The second law requires designing for failures being the norm rather than an exception. The third law requires optimization of data placement and communication for a heterogeneous underlying network where the latency and communication bandwidth between different pairs of peers may be different. We discuss how these challenges may be met in enabling efficient data management solutions over P2P systems. Some of the highlights of our contributions include: (1) Hierarchical overlay-network design optimized for the underlying physical network with improved fault isolation support for efficient data caching. (2) Novel load-balancing algorithms for range-partitioned data that enables efficient range queries. (3) Data-partitioning techniques for multi-dimensional data which, combined with novel routing structures, enable efficient multi-dimensional queries. (4) Indexing schemes for dynamic data that can trade off the cost of maintaining the index against the benefit that the index offers for queries.
Engineering details of a stable force-directed placer
Authors: K. Vorwerk, A. Kennings, A. Vannelli
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Analytic placement methods that simultaneously minimize wire length and spread cells are receiving renewed attention from both academia and industry. We describe the implementation details of a force-directed placer, FDP. Specifically, we provide: (1) a description of efficient force computation for spreading cells; (2) an illustration of numerical instability in these methods and a means by which these instabilities are avoided; (3) spread metrics for measuring cell distribution throughout the placement region; and (4) a complementary technique which aids in directly minimizing HPWL. We present results comparing our analytic placer to other academic tools for both standard cell and mixed-size designs. Compared to Kraftwerk and Capo 8.7, our tool produces results with an average improvement of 9% and 3%, respectively.