ppxscal/embedding_network huggingface dataset:
Rational secret sharing and multiparty computation: extended abstract
Authors: Joseph Halpern, Vanessa Teague
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that as few as possible of the other agents get it. We show that, under these assumptions, neither secret sharing nor multiparty function computation is possible using a mechanism that has a fixed running time. However, we show that both are possible using randomized mechanisms with constant expected running time.
Fuzzy Set in Geometric Modeling
Authors: Abd. Fatah Wahab, Jamaludin Md. Ali, Ahmad Abd. Majid, Abu Osman Md. Tap
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Geometric modeling involving uncertainty of data is the major problem in CAGD. By using the theory of fuzzy set and its properties, the issues of uncertainty can be solved through the concept of fuzzy numbers. In this paper we apply fuzzy numbers as uncertainty data and defined a new kind of fuzzy control points. With this type of points we then introduced a fuzzy Bezier curve and fuzzy B-spline. By these definitions, we construct a curve of such fuzzy spline and given an example of fuzzy Bezier curve and fuzzy B-spline in the context of CAGD at the end of this concept papers.
Hormone-Inspired Self-Organization and Distributed Control of Robotic Swarms
Authors: Wei-Min Shen, Peter Will, Aram Galstyan, Cheng-Ming Chuong
Venue: Autonomous Robots (2004)

The control of robot swarming in a distributed manner is a difficult problem because global behaviors must emerge as a result of many local actions. This paper uses a bio-inspired control method called the Digital Hormone Model (DHM) to control the tasking and executing of robot swarms based on local communication, signal propagation, and stochastic reactions. The DHM model is probabilistic, dynamic, fault-tolerant, computationally efficient, and can be easily tasked to change global behavior. Different from most existing distributed control and learning mechanisms, DHM considers the topological structure of the organization, supports dynamic reconfiguration and self-organization, and requires no globally unique identifiers for individual robots. The paper describes the DHM and presents the experimental results on simulating biological observations in the forming of feathers, and simulating wireless communicated swarm behavior at a large scale for attacking target, forming sensor networks, self-repairing, and avoiding pitfalls in mission execution.
A frequency delta-sigma analog-to-digital converter operating at a power-supply voltage of 0.6 V
Authors: Mats E. Høvin, Dag T. Wisland, Yngvar Berg, Tor S. Lande
Venue: Analog Integrated Circuits and Signal Processing (2003)

This paper describes a delta-sigma analog-to-digital converter operating at a power supply voltage of 0.6 V. The converter is implemented in a standard AMS 0.6 µm double poly process, and consists of a frequency-delta-sigma modulator where the transistor threshold voltage is decreased by floating-gate techniques.
Tracker Calibration using Tetrahedral Mesh and Tricubic Spline Models of Warp
Authors: Christoph W. Borst
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

This paper presents a three-level tracker calibrationsystem that greatly reduces errors in tracked position andorientation. The first level computes an error-minimizingrigid body transform that eliminates the need for precisealignment of a tracker base frame. The second corrects forfield warp by interpolating correction values stored withvertices in a tetrahedrization of warped space. The thirdperforms an alternative field warp calibration byinterpolating corrections in the parameter space of atricubic spline model of field warp. The system isevaluated for field warp calibration near a passive-hapticpanel in both low-warp and high-warp environments. Thespline method produces the most accurate results,reducing median position error by over 90% and medianorientation error by over 80% when compared to the useof only a rigid body transform.
Interactive debug requirements
Authors: Rich Seidner, Nick Tindall
Venue: ACM SIGSOFT Software Engineering Notes (1983)

This is a market requirements statement for Interactive Debugging. It is the result of a collaboration between the GUIDE/SHARE Language Futures Task Force (LFTF) and IBM. The LFTF was formed at meetings of SHARE and GUIDE in 1979. The objective of the task force was to provide IBM with the views of the user community on the future of the application development environment. The Task force chose to limit its discussions primarily to "enhancements to the procedural languages and the environments in which they operate."
Polimatica: Abstraction for Customizable Private Virtual Organizations in Global Grids
Authors: Yoshiharu Maeno, Masahiro Kawato, Shoji Nishimura, Fumio Machida, Tsunehiko Kamachi
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

We have developed an application service hostingmiddleware for enterprise information systems, "Polimatica",upon which a policy-customizable private virtual organization(pVO) is built. The pVO is a collection of customizableapplication services in the global grid computing environment."Polimatica" is distinctive in terms of abstraction capabilitiesin (1) policy instance description, (2) view synthesis of anextensive resource data model, (3) operation aggregation onthe OGSI extension interfaces. The performance to enforcethe policy instances is measured in a laboratory testbed for anenterprise ASP, providing B2B e-commerce (BizEngine/WS)and interactive media communication service (LiveComm).We have verified that, in 60 seconds, the feedback loop in apVO adjusts the application services as customized given thechanging environment.
Modeling the Coronary Artery Tree
Venue: Proceedings of the Shape Modeling International 2004 (2004)

The paper describes a model of the coronary arterytree. It has been developed for the context of medical imageprocessing and medical reporting. The model combinesgeometric information with associated medical nomenclature andanatomical relations. Applicability of the model and inter-individualgeometrical variability has been studied by matchingthe model to the individual coronary anatomy of 33 patientsimaged with a multi-detector-row computer tomographyscanner.
Predictive Text Entry in Immersive Environments
Authors: Barry McCaul, Alistair Sutherland
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

One of the classic problems with immersiveenvironments is data entry; with a head-mounted display(HMD) the user can no longer see the keyboard. Althoughfor many applications data entry is not a requirement, forsome it is essential: communicating in collaborativeenvironments, entering a filename to which work can besaved, or accessing system controls. Combiningdatagloves and a graphically represented keyboard with apredictive spelling paradigm, we describe an effective textentry technique for immersive environments; we explorethe key issues when using such a technique, and reportthe results of preliminary usability testing.
Building "Problem Solving Engines" for Combinatorial Optimization Problems
Authors: Toshihide Ibaraki
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We describe in this paper our attempts to build problemsolving engines that together cover a large portion of combinatorialoptimization problems encountered in real worldapplications. Our approach is to select a list of standardproblems, and develop their solvers as engines. All the engineswe developed are based on the idea of local searchand metaheuristics. As standard problems, we have chosenso far CSP (constraint satisfaction problem), RCPSP (recourceconstrained project scheduling problem), GAP (generalizedassignment problem), VRP (vehicle routing problem),SCP (set covering problem), MAX-SAT (maximum satisfiabilityproblem), 2PP (2-dimensional packing problem)and others. In this paper, we outline definitions of theseproblems, algorithmic contents of engines, and some computationalresults, putting emphasis on RCPSP and VRP.
Media-friendliness of a slowly-responsive congestion control protocol
Authors: Zhiheng Wang, Sujata Banerjee, Sugih Jamin
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Streaming media transfers over the Internet are expected to behave in a TCP-friendly manner while reacting slower to congestion than TCP. For this purpose, a number of slowly-responsive congestion control protocols have been developed. In this paper, we present our study on the media-friendliness of TFRC, one of the recently developed slowly-responsive congestion control mechanisms. With both simulation and Internet experiments, we show that TFRC is not necessarily smooth enough to be "media-friendly". We also discuss our approach to improve a congestion control mechanism's media-friendliness.
A Variable Rate Execution Model
Authors: Steve Goddard, Xin Liu
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

We present a task model for adaptive real-time tasks inwhich a taskýs execution rate requirements are allowed tochange at any time. The model, variable rate execution(VRE), is an extension of the rate-based execution (RBE)model. We relax the constant execution rate assumption ofcanonical real-time task models by allowing both the worstcase execution time (WCET) and the period to be variable.The VRE model also supports tasks joining and leavingthe system at any time. A schedulability condition for theVRE task model is presented that can be used as an on-lineadmission control test for the acceptance of new tasks orrate changes. Finally, a VRE scheduler was implementedin Linux as a loadable module, and several experimentsdemonstrate its correctness and analyze the overhead.
Smarandache iterations of the first kind on functions involving divisors and prime factors
Authors: Jason Earls
Venue: Smarandache Notions Journal (2004)

In this paper we consider Smarandache Iterations of the First Kind [2] upon four new functions which deal with divisors and prime factors of positive integers, make conjectures and give some open problems.
Automated Reference-Counted Object Recycling for Real-Time Java
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

We introduce an aspect-oriented reformulation ofreference-counting that is particularly well-suited to Javaapplications and does not share the error-prone characteristicof manual, user-driven reference counting. Wepresent our method in the context of the Real-Time Specificationfor Java and demonstrate that it can recycle deadobjects in bounded time. We apply partial evaluation to specializethe aspect-generated code, which substantially reducesthe reference-counting overhead.
Configurations in 4-Cycle Systems
Authors: Darryn Bryant, Mike Grannell, Terry Griggs, Martin Ma&#x010d;aj
Venue: Graphs and Combinatorics (2004)

A 4-cycle system of order n, denoted by 4CS(n), exists if and only if n&#x2261;1 (mod 8). There are four configurations which can be formed by two 4-cycles in a 4CS(n). Formulas connecting the number of occurrences of each such configuration in a 4CS(n) are given. The number of occurrences of each configuration is determined completely by the number d of occurrences of the configuration D consisting of two 4-cycles sharing a common diagonal. It is shown that for every n&#x2261;1 (mod 8) there exists a 4CS(n) which avoids the configuration D, i.e. for which d=0. The exact upper bound for d in a 4CS(n) is also determined.
A declarative approach to optimize bulk loading into databases
Authors: Sihem Amer-Yahia, Sophie Cluet
Venue: ACM Transactions on Database Systems (TODS) (2004)

Applications, such as warehouse maintenance, need to load large data volumes regularly. The efficiency of loading depends on the resources that are available at the source and at the target systems. Our work aims to understand the performance criteria that are involved in bulk loading data into a database and to devise tailored optimization strategies.Unlike commercial systems and previous research on the same topic, our approach follows the fundamental database principle of physical-logical independence. A loading program is represented as a sequence of algebraic expressions. This abstraction enables the use of appropriate algebraic rewritings to optimize a loading program and of a cost model that takes into consideration efficiency criteria such as the processing times at the source and target systems and the bandwidth between them. A slow-loading program may be preferable if it does not slow down other applications by consuming too much memory. Thus, we view the problem of optimizing a loading program as finding a compromise between several efficiency criteria.The ability to represent loading programs in an algebra and performance criteria in a cost model has two very desirable properties: reusability and efficiency. Database programmers do not have to write loading programs by hand. In addition, tuning loading programs becomes easier since programmers have a better control on the performance criteria specified in the cost model. The algebra captures data transformations that would have been otherwise hardcoded in loading programs. Consequently, richer optimizations can be explored. Finally, our optimization techniques are not specific to one particular system. They can be used for loading data and from to any structured store (e.g., relational, structured files).We implemented our ideas in a complete environment for migrating ODBC-compliant databases into the O2 object-oriented database system. This prototype provides a declarative view language to specify loading, an interface to specify directives, such as desired database physical organization and constraints on several criteria, such as resource and bandwidth consumption, an algebraic optimizer, a code generator, and an execution environment to control failures and guarantee incremental loading. Our experiments show that a tailored optimization is necessary when loading large data volumes into a database.
Giving Meaning to Macros
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

With the prevalence of legacy C/C++ code, it continuallybecomes more important to address the issues of readability andmaintainability. When considering the problems with refactoringor migrating C/C++ code we see how important a role pre-processordirectives play. In part, because of these preprocessordirectives it is extremely difficult to maintain our code.We outline a method of fact extraction and manipulationto create a set of transformations that remove preprocessordirectives from the original source, converting them into regularC/C++ code with as few changes as possible, while maintainingreadability in the code. In addition, we briefly explore someof the subtle issues that arise when migrating preprocessordirectives. After discussing the general architecture of our testimplementation, we look at some metrics gathered by running iton two software systems.
Data Mining Source Code to Facilitate Program Comprehension: Experiments on Clustering Data Retrieved from C++ Programs
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

This paper presents ongoing work on using data miningto discover knowledge about software systems thusfacilitating program comprehension. We discuss how thiswork fits in the context of tool supported maintenanceand comprehension and report on applying a newmethodology on C++ programs. The overall frameworkcan provide practical insights and guide the maintainerthrough the specifics of systems, assuming littlefamiliarity with these.The contribution of this work is two-fold: it provides amodel and associated method to extract data from C++source code which is subsequently to be mined, andevaluates a proposed framework for clustering such datato obtain useful knowledge. The methodology is evaluatedon three open source applications, results are assessedand conclusions are presented. This paper concludes withdirections for future work.
View inference for heterogeneous XML information integration
Authors: Euna Jeong, Chun-Nan Hsu
Venue: Journal of Intelligent Information Systems (2003)

This paper proposes a novel approach to integrating heterogeneous XML DTDs. With this approach, an information agent can be easily extended to integrate heterogeneous XML-based contents and perform federated search. Based on a tree grammar inference technique, this approach derives an integrated view of XML DTDs in an information integration framework. The derivation takes advantages of naming and structural similarities among DTDs in similar domains. The complete approach consists of three main steps. (1) DTD clustering clusters DTDs in similar domains into classes. (2) Schema learner applies a tree grammar inference technique to generate a set of tree grammar rules from the DTDs in a class from the previous step. (3) Minimizer optimizes the rules generated in the previous step, transforms them into an integrated view, and generates source descriptions. We have implemented the approach into a system called DEEP and tested the system on several domains. Experimental results reveal that this system can effectively and efficiently integrate radically different DTDs.
Core and Backhaul Transport
Authors: D. Johnson
Venue: BT Technology Journal (2004)

The transport network is essential in connecting together a network's nodes in a reliable and cost-effective way. Within the inter-city network, high-bandwidth connections will be managed using optical control plane technology, allowing traffic to be dynamically routed on demand and re-configured around any network event. Optical transport network standards will allow a wide range of protocols to be carried transparently across the network. In the outer part of the core network where traffic is collected from aggregation nodes and taken to the main switching sites, cost-effective support for multiple services is particularly important. Efficient mapping and aggregation techniques are essential. As solutions are also required for transporting data from a wide range of node sizes, a range of technologies will be required in the backhaul network.
Exploiting purity for atomicity
Authors: Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
Venue: ACM SIGSOFT Software Engineering Notes (2004)

The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is an equivalent serial execution in which the actions performed by any thread while executing the atomic procedure are not interleaved with actions of other threads. Several existing tools verify atomicity by using commutativity of actions to show that every execution reduces to a corresponding serial execution. However, experiments with these tools have highlighted a number of interesting procedures that, while intuitively atomic, are not reducible.In this paper, we exploit the notion of pure code blocks to verify the atomicity of such irreducible procedures. If a pure block terminates normally, then its evaluation does not change the program state, and hence these evaluation steps can be removed from the program trace before reduction. We develop a static analysis for atomicity based on this insight, and we illustrate this analysis on a number of interesting examples that could not be verified using earlier tools based purely on reduction. The techniques developed in this paper may also be applicable in other approaches for verifying atomicity, such as model checking and dynamic analysis.
Investigating Available Instruction Level Parallelism for Stack Based Machine Architectures
Authors: Huibin Shi, Chris Bailey
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Stack architectures have attracted much renewed research in recent years, due largely to the arrival of the JAVA programming language for Internet, and more recently in embedded applications. However, instruction level parallelism (ILP) has not yet received significant attention with respect to such machines. We have developed a stack code viewer/analyzer tool to analyze available ILP in stack assembler-code, together with the UTSA simulator, under unlimited software and hardware resource configurations. Results for basic block analysis reveal marginal speedups of available ILP over the serial execution in the absence of mechanisms for branch speculation or code optimization. Results for superblock and loop unrolling techniques show that more significant improvements can be made to available parallelism where effort is directed. An experiment is also presented to highlight the significance of branch prediction. In all tests, our stack code viewer/analyzer tool can graphically represent the scheduling result of each basic block.
Teaching qualitative data analysis to graduate students
Authors: Grant Blank
Venue: Social Science Computer Review (2004)

This article reports the author's experience teaching sociology graduate students how to analyze qualitative data. The course focused on teaching practical skills of defining coding categories, coding text, analyzing coded text, and writing up the results of analysis. The assignments used Qualrus software to give students hands-on practice doing all of these. The course was enthusiastically received and will become a permanent part of the sociology methods course offerings at American University.
Observations on Universality and Portability in High-Performance Computing
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

The universality of the hardware model and the portability of the software model are two central themes in high-performance computing, especially as parallelism and memory hierarchy force a gradual but irreversible departure from the classical, sequential paradigm of computing. This paper considers the possibility of formulating an analytical, quantitative approach to the study of universality and portability, offering a perspective on known results and indicating avenues for further investigation.
Leakage Power Optimization Techniques for Ultra Deep Sub-Micron Multi-Level Caches
Authors: Nam Sung Kim, David Blaauw, Trevor Mudge
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

On-chip L1 and L2 caches represent a sizeable fraction of the totalpower consumption of microprocessors. In deep sub-micron technology,the subthreshold leakage power is becoming the dominantfraction of the total power consumption of those caches. In thispaper, we present optimization techniques to reduce the leakagepower of on-chip caches assuming that there are multiple thresholdvoltages, VTH's, available. First, we show a cache leakage optimizationtechnique that examines the trade-off between access timeand leakage power by assigning distinct VTH's to each of the fourmain cache components - address bus drivers, data bus drivers,decoders, and SRAM cell arrays with sense-amps. Second, we showoptimization techniques to reduce the leakage power of L1 and L2on-chip caches without affecting the average memory access time.The key results are: 1) 2 VTH's are enough to minimize leakage in asingle cache; 2) if L1 size is fixed, increasing the L2 size can resultin much lower leakage without reducing average memory accesstime; 3) if L2 size is fixed, reducing L1 size can result in lower leakagewithout loss of the average memory access time; and 4) smallerL1 and larger L2 caches than are typical in today's processorsresult in significant leakage and dynamic power reduction withoutaffecting the average memory access time.