ppxscal/embedding_network huggingface dataset:
Geocoding Natural Route Descriptions using Sidewalk Network Databases
Authors: Masatoshi Arikawa, Kouzou Noaki
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

People use descriptions referring to places through their daily life. These descriptions correspond to the region of the real world. We call such descriptions geo-referenced descriptions. We have studied a method of converting such descriptions like addresses and place names into their corresponding geographic coordinates, that is, tuples of longitude and latitude. The process of converting descriptions into coordinates is called geocoding. In this paper, we focus on natural route descriptions as a new type of target to geocode. We first propose Formal Route Statement (FRS) to represent and process natural route descriptions by means of a computer, and then explain a core schema of sidewalk network databases on the basis of a characteristic of natural route descriptions. Also, we present our prototype system to geocode natural route descriptions using sidewalk network databases based on our proposed framework.
XL-AOF: lightweight aspects for space-based computing
Authors: eva Kühn, Fabian Schmied
Venue: Proceedings of the 1st workshop on Aspect oriented middleware development (2005)

Space-based computing is a powerful model of abstraction for distributed application development. Although such applications solve a high number of cross-cutting concerns, there is no aspect-oriented environment available at the moment which supports the space-based communication paradigm. This paper describes XL-AOF, an extensible lightweight aspect-oriented framework, whose main focus is to allow for easy development of space-based applications.
Task Partitioning upon Memory-Constrained Multiprocessors
Authors: Nathan Fisher, James H. Anderson, Sanjoy Baruah
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks assigned to each processor does not exceed the processor¿s processing power. However, many multiprocessor platforms have only limited amounts of local per-processor memory; if the memory limitation of a processor is not respected, thrashing between "main" memory and the processor¿s local memory may occur during run-time and may result in performance degradation. We formalize the problem of task partitioning in a manner that is cognizant of both memory and processing capacity constraints as the memory constrained multiprocessor partitioning problem, prove that this problem is intractable, and present efficient algorithms for solving it under certain ¿ well-defined ¿ conditions.
Layering Public Key Distribution Over Secure DNS using Authenticated Delegation
Authors: John P. Jones, Daniel F. Berger, Chinya V. Ravishankar
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

We present the Internet Key Service (IKS), a distributed architecture for authenticated distribution of public keys, layered on Secure DNS (DNSSEC). Clients use DNSSEC to securely discover the identities of the relevant IKS servers, and send key lookup or management requests directly to these servers using a special-purpose protocol. Clients authenticate keys retrieved from IKS servers using key commitments published in DNSSEC. IKS derives its authentication authority from the authority DNS domains have over Internet names. The IKS architecture is loosely coupled with DNS to minimize overhead on DNS servers. We also present RIKS, a prototype IKS implementation.
Uniform random number generator
Authors: Robert A. Stryk
Venue: ACM SIGSIM Simulation Digest (1976)

The recent flurry of random number routines and your continued plea for material had led me to dust off my favorite trick uniform random number generator. It requires no seed, produces numbers uniformly distributed between 0 and 1, is acyclic and for all practical purposes, is completely unpredictable and irreproducible. 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
An On-Chip Garbage Collection Coprocessor for Embedded Real-Time Systems
Authors: Matthias Meyer
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Garbage collection considerably increases programmer productivity and software quality. However, it is difficult to implement garbage collection both efficiently and suitably for real-time systems. Today, garbage collection is exclusively realized in software and either fails to guarantee a small upper bound for pause times or suffers from considerable synchronization overhead. In this paper, we present the design and implementation of an on-chip garbage collection coprocessor that closely cooperates with the main processor. The benefits of thisconfiguration include low garbage collection overhead, low-cost synchronization of collector and application programs, and hard real-time capabilities. We successfully realized the garbage collection coprocessor along with a pipelined RISC processor on a single FPGA. Performance measurements on the prototype show that the longest pauses caused by the garbage collector are less than 500 clock cycles and that the total runtime overhead is as little as a few percent if the application is provided with a reasonable amount of memory headroom.
Design/process learning from electrical test
Authors: B. Koenemann
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Modern design-for-test (DFT) practices not only simplify test generation but also make it much easier to diagnose problems uncovered in electrical test. In fact, many diagnostics steps can be automated enough to enable batch processing of large quantities of fail data captured during production test. Hidden in these fail data is very valuable information about the product design, manufacturing process, and interactions between the two. The embedded tutorial provides an overview of some of the analysis methods that are being used and/or prototyped in the industry, as well as the underlying data sharing between the design and manufacturing areas that is required for and enabled by the analyses.
Optimizing the SPARK program slicer
Authors: Ricky E. Sward, Leemon C. Baird,  III
Venue: ACM SIGAda Ada Letters (2005)

Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program slices from SPARK procedures along with a proof that the functionality of the original procedure is equivalent to the functionality of the collection of resulting slices. This paper extends this work by showing how assumptions in the proof can cause inefficiencies in SPARKSlicer and by presenting alternatives that optimize out the inefficiencies. The original proof is modified to show that the SPARK program slicer still produces functionally equivalent program slices from SPARK procedures with these optimizations.
On a Serverless Networked Virtual Ball Game for Multi-Player
Authors: Yoshihiro Kawano, Tatsuhiro Yonekura
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper studies the way to improve consistency of states in a ball-game typed Distributed Virtual Environment (DVE) with lag, in peer-to-peer (P2P) architecture. That is, we are studying how to reduce in real-time the difference of states between the participating terminals in a virtual ball game caused by transmission lag or update interval. We are also studying how to control shared objects in real-time in a server-less network architecture. Specifically, a priority field called Allocated Topographical Zone (AtoZ) is used in P2P for DVE. In a critical case, defined as inconsistent phenomena between the peers, caused by the network latency, a stricter ownership determination algorithm, called dead zone is introduced. Concession parameter is used to reduce the possibility of such a case. By using these protocols in combination, a robust and effective scheme is achieved for a virtual ball game and these protocols ware extended for multi-player game. As an example of the application, a realtime networked doubles air-hockey is implemented for evaluation of the influence of these protocols on interactivity and on consistency.
Automation of instrument design, coding, data entry, data cleaning, and codebook generation
Authors: K. Steinbrenner
Venue: ACM SIGSOC Bulletin (1979)

In reviewing the survey process, it is clear that for all surveys certain common operations are involved which are independent of where the survey is done or who is in charge of it. To show how these various steps could become part of an integrated data processing system, I first want to describe each step separately, as it is accomplished normally. The description which follows is based on procedures executed at NORC, but similar steps are followed almost everywhere else. Certain terms might be unique to NORC, but their meaning should become clear from the context. 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
Control flow based obfuscation
Authors: Jun Ge, Soma Chaudhuri, Akhilesh Tyagi
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

A software obfuscator is a program O to transform a source program P for protection against malicious reverse engineering. O should be correct (O(P) has same functionality with P), resilient (O(P) is resilient against attacks), and effective (O(P) is not too much slower than P). In this paper we describe the design of an obfuscator which consists of two parts. The first part extracts the control flow information from the program and saves it in another process named Monitor-process. The second part protects Monitor-process converting it into an Aucsmith like self-modifying version. We prove the correctness of the obfuscation scheme. We assess its resilience and efficiency to show that both are This supports the claim that our approach is practical.
A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem
Authors: Hanif D. Sherali, Jitamitra Desai
Venue: Journal of Global Optimization (2005)

The field of cluster analysis is primarily concerned with the partitioning of data points into different clusters so as to optimize a certain criterion. Rapid advances in technology have made it possible to address clustering problems via optimization theory. In this paper, we present a global optimization algorithm to solve the fuzzy clustering problem, where each data point is to be assigned to (possibly) several clusters, with a membership grade assigned to each data point that reflects the likelihood of the data point belonging to that cluster. The fuzzy clustering problem is formulated as a nonlinear program, for which a tight linear programming relaxation is constructed via the Reformulation-Linearization Technique (RLT) in concert with additional valid inequalities. This construct is embedded within a specialized branch-and-bound (B B) algorithm to solve the problem to global optimality. Computational experience is reported using several standard data sets from the literature as well as using synthetically generated larger problem instances. The results validate the robustness of the proposed algorithmic procedure and exhibit its dominance over the popular fuzzy c-means algorithmic technique and the commercial global optimizer BARON.
Scheduling functional regression tests for IBM DB2 products
Authors: Edward Xia, Igor Jurisica, Julie Waterhouse, Valerie Sloan
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Functional Regression Testing (FRT) is performed to ensure that a new version of a product functions properly as designed. In a corporate environment, the large numbers of test jobs and the complexity of scheduling the jobs on different platforms make performance of this testing an important issue. A grid provides an infrastructure for applications to use shared heterogeneous resources. Such an infrastructure may be used to solve large-scale testing problems or to improve application performance. FRT is a good candidate application for running on a grid because each test job can run separately, in parallel. However, experience indicates that such applications may suffer performance problems without a proper cost-based grid scheduling strategy.The Database Technology (DBT) Regression Test Team at IBM conducts the FRT for IBM® DB2® Universal DatabaseTM (DB2 UDB) products. As a case study, we examined the current test scheduling approach for the DB2 products. We found that the performance of the test scheduler suffers because it does not incorporate cost-dependent selection of jobs and slaves (testing IDs). Therefore, we have replaced the DB2 test scheduler with one that estimates jobs' run times, and then chooses slaves using those times. Although knowing a job's actual run time is difficult, we can use case-based reasoning to estimate it based on past experience. We create a case base to store historical data, and design an algorithm to estimate new jobs' run times by identifying cases that have executed in the past. The performance evaluation of our new scheduler shows a significant performance benefit over the original scheduler. In this paper, we also examine how machine specifications, such as the number of slaves running on a machine and the machine speed, affect application performance and run time estimation accuracy.
D.C. Versus Copositive Bounds for Standard QP
Authors: Kurt M. Anstreicher, Samuel Burer
Venue: Journal of Global Optimization (2005)

The standard quadratic program (QPS) is minx¿¿xTQx, where $$\Delta\subset\Re^n$$ is the simplex ¿ = {x ¿ 0 ¿ ¿i=1n xi = 1}. QPS can be used to formulate combinatorial problems such as the maximum stable set problem, and also arises in global optimization algorithms for general quadratic programming when the search space is partitioned using simplices. One class of `d.c.' (for `difference between convex') bounds for QPS is based on writing Q=S¿T, where S and T are both positive semidefinite, and bounding xT Sx (convex on ¿) and ¿xTx (concave on ¿) separately. We show that the maximum possible such bound can be obtained by solving a semidefinite programming (SDP) problem. The dual of this SDP problem corresponds to adding a simple constraint to the well-known Shor relaxation of QPS. We show that the max d.c. bound is dominated by another known bound based on a copositive relaxation of QPS, also obtainable via SDP at comparable computational expense. We also discuss extensions of the d.c. bound to more general quadratic programming problems. For the application of QPS to bounding the stability number of a graph, we use a novel formulation of the Lovasz ¿ number to compare ¿, Schrijver's ¿¿, and the max d.c. bound.
The effects of computer-generated elaborative mnemonics
Authors: Frederick J. Brigham
Venue:  (2005)

The use of elaborative mnemonic strategies has been an effective tool to assist students with learning disabilities recall unfamiliar and abstract information. Previous studies have demonstrated that when the elaborative mnemonics are used on maps typically found in textbooks, students with learning disabilities are able to recall a greater number of locations as well as more associative information about the events. As school systems implement state mandated standards based tests for compliance with the federal law, No Child Left Behind, the need for effective strategies for students to recall information has become imperative. This study investigates the use of computer generated elaborative mnemonic maps for middle school students with learning disabilities. This study compared the traditional map-like displays of Civil War battles to one paper and two different computer generated elaborative mnemonic maps. Map-like displays containing the names of 14 battles of the American Civil War and information about each battle were presented to 44 middle school students with learning disabilities. The study consisted of four map conditions that presented Civil War battles and battle information based on the Virginia Standards of Learning using: (a) paper maps with traditional, non-descriptive icons to mark each battle, (b) paper maps using elaborative mnemonic icons, (c) computer generated maps using elaborative mnemonic icons, and (d) computer generated maps using elaborative mnemonic buttons that enlarged when the student clicked the mouse on the image. Scripted lessons were given to students in each condition identifying the correct location of the battle on the respective maps along with factual information about each battle. At the conclusion of the lesson, the examiner gave the student a brief distractor task to prevent rehearsal of the information. At the end of the task, students were asked to identify the proper location of each battle by placing a letter in a box on a test map where the battle took place. After identification of the battle location, students were asked to identify the associative information related to the battle. A 4 condition (traditional, paper elaborative mnemonic, computer elaborative icon, and computer elaborative button) by 2 (location vs. event) repeated measures Analysis of Variance was conducted to analyze the students responses. No significant differences were found among the different conditions on the two respective measures. A significant difference was found when the recall of event information was disaggregated from the recall of location. This finding suggests that the use of computer generated elaborative mnemonics is a powerful strategy to help students with learning disabilities recall unfamiliar and abstract information.
Update on the antitrust ghost in the standard-setting machine
Authors: Jeffery B. Fromm, Robert A. Skitol
Venue: IEEE Micro (2005)

The following is a guest column, following up Richard Stern's Micro Law column in the May-June 2005 issue of IEEE Micro, by two lawyers involved in presenting Hewlett-Packard's RAND proposal to the IEEE PatCom recently.
Hierarchial self-organization of minicolumnar receptive fields
Authors: Jörg Lücke
Venue: Neural Networks (2004)

We study self-organization of receptive fields (RFs) of cortical minicolumns. Input driven self-organization is induced by Hebbian synaptic plasticity of afferent fibers to model minicolumns based on spiking neurons and background oscillations. If input in the form of spike patterns is presented during learning, the RFs of minicolumns hierarchically specialize to increasingly small groups of similar RFs in a series of nested group subdivisions. In a number of experiments we show that the system finds clusters of similar spike patterns, that it is capable of evenly cover the input space if the input is continuously distributed, and that it extracts basic features from input consisting of superpositions of spike patterns. With a continuous version of the bars test we, furthermore, demonstrate the system's ability to evenly cover the space of extracted basic input features. The hierarchical nature and its flexibility with respect to input distinguishes the presented type of self-organization from others including similar but non-hierarchical self-organization as discussed in [Lücke J., & von der Malsburg, C. (2004). Rapid processing and unsupervised learning in a model of the cortical macrocolumn. Neural Computation 16, 501-533]. The capabilities of the presented system match crucial properties of the plasticity of cortical RFs and we suggest it as a model for their hierarchical formation.
Literature from the software tarpit or the how, where and why of software documentation
Authors: Alex Warman
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

John Lees' "Reaction from the Trenches" (SIGDOC Vol. 7, No. 2) has raised some interesting points on the relationship between documentation and a concept of "good" programs. I have worked on some large projects for both systems programming and applications programming jobs over the years. In recent years I have taught a few programming courses for beginners and more advanced programmers. This led me to explore firstly, the way that programs are developed - both good and bad, and then to try to discover how good people should be introduced and guided toward a notion of "good" programming practice. I shall describe how these concepts evolved and led to a view which requires most documentation to be produced before any code is written. Indeed, it becomes part of the preparation and planning for coding and then testing. Thus, documentation is no longer seen as something separate from the software and as an evil extra that prevents programmers from getting on with the next interesting and important program. Rather it is seen as an essential and integral part of a well organized approach to producing software products. Finally, I believe that it is a moot point as to whether it is worse to have software which is poorly documented or software that does not work. 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
Formal Verification of Structured Analysis and Design in HOS
Authors: Chia-Chu Chiang, Roger Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Traditional structured analysis and design methods have been criticized because the methods lack formality to provide a design for rigorous development. Several approaches have been developed for verifying a design by integrating traditional structured analysis and design methods with formal specification languages. However, the integration of traditional structured analysis and design methods with formal specification languages may confuse the problem definition and understanding with the attempt to define system structures and algorithms in the design phase. In addition, formal specification languages may add complexity to the design due to the complexity of the language syntax and semantics. In this paper, we are presenting an approach to verification of a structured design in HOS without using formal specification languages. Rules for the partial and total correctness of the design are also discussed.