ppxscal/embedding_network huggingface dataset:
On the Power of Randomized Branching Programs
Authors: Farid Ablayev, Marek Karpinski
Venue:  (1996)

We define the notion of a randomized branching program in the natural way similar to the definition of a randomized circuit. We exhibit an explicit function $f_{n}$ for which we prove that: 1) $f_{n}$ can be computed by polynomial size randomized read-once ordered branching program with a small one-sided error; 2) $f_{n}$ cannot be computed in polynomial size by deterministic read-once branching programs; 3) $f_{n}$ cannot be computed in polynomial size by deterministic read-$k$-times ordered branching program for $k=o(n/\log n)$ (the required deterministic size is $\exp\left(\Omega\left(\frac{n}{k}\right)\right)$).
DILEWA: The DIstributed Learning Environment without Avatars
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Nowadays multi-user VR systems are mostly aimed to social interaction, whereas exploitation of shared virtual environment for educational purposes has been mainly left aside. We introduce notion of tutor-based system and state main differences between tutor-based multi-user system and social interaction aimed one. In the proposed approach, one of the users is the tutor while the others represent auditors. This paper focuses on possible means for expressing tutor's role including special auditor's operating modes supported by mechanism of net-routes. Theoretical considerations have been tested on DILEWA experimental system.
The Cyclone Server Architecture: Streamlining Delivery of Popular Content
Authors: Stan Rost, John Byers, Azer Bestavros
Venue:  (2000)

Abstract We propose a new technique for efficiently delivering popular content from information repositories with bounded file caches. Our strategy relies on the use of fast erasure codes (a.k.a. forward error correcting codes) to generate encodings of popular files, of which only a small sliding window is cached at any time instant, even to satisfy an unbounded number of asynchronous requests for the file. Our approach capitalizes on concurrency to maximize sharing of state across different request threads while minimizing cache memory utilization. Additional reduction in resource requirements arises from providing for a lightweight version of the network stack. In this paper, we describe the design and implementation of our Cyclone server as a Linux kernel subsystem.
Reference Linking the Web''s Scholarly Papers
Authors: Donna Bergmark, Carl Lagoze
Venue:  (2001)

Along with the explosive growth of the Web has come a great increase in on-line scholarly literature. Thus the Web is becoming an efficient source of up-to-date information for the scientific researcher, and more and more researchers are turning to their computers to keep current on results in their field. Not only is Web retrieval usually faster than a walk to the library, but the information obtained from the Web is potentially more current than what appears in printed publications. The increasing proportion of on-line scholarly literature makes it possible to implement functionality desirable to all researchers -the ability to access cited documents immediately from the citing paper. Implementing this direct access is called "`reference linking". While many authors insert explicit links into their papers to support reference linking, it is by no means a universal practice. The approach taken by the Digital Library Research Group at Cornell employs "value-added surrogates" to enhance the reference-linking behavior of Web documents. Given the URL of an on-line paper, a surrogate object is constructed for that paper. The surrogate fetches the content of the document and parsesit to automatically extract reference linking data. Applications can then use the surrogate to access this reference linking data, encoded in XML, via a well-defined Java API. We use this API to reference link the D-Lib magazine, an on-line journal of technical papers relating to digital library research. Currently we are (automatically) extractingreference linking information from the papers in this journal with 80% accuracy.
Fairness by demand and service pattern match: the alpha tuning mechanism for DQDB MANs
Authors: L. N. Kumar, C. Douligeris
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

This paper proposes a dynamic bandwidth control scheme for the distributed queue dual bus (DQDB) networks. The heavy load unfairness is effectively addressed. The match of demand and service patterns is achieved at fairly uniform delays and success rates of transmission at every node. Using a tunable parameter (/spl alpha/), the proposed scheme perceives the presence of several fictitious nodes at the end of the bus and applies access protection. Analysis and simulation studies for three standard load patterns, viz., symmetric, asymmetric and equal probability loads, show that it outperforms the bandwidth balancing mechanism.
An efficient asynchronous data transmission mechanism for data parallel languages
Authors: Xiaojie Li, K. Harada
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Reducing the overhead of data transmissions is crucial to harnessing the potential of distributed memory multiprocessors. Some optimization techniques such as overlapping communication and computation have been proposed. However, the most overlapping techniques are still limited by the following factors. (1) There is no linguistic support for overlapping communication and computation in data parallel languages; (2) There is no global analysis performed for array references over different nested loops, which will decide how to overlap communication and computation; (3). There is no formalized asynchronous data transmission mechanism in data parallel language compilers. This paper proposes an asynchronous data transmission mechanism for data parallel languages. It describes a new linguistic support, called an N-level message queue that designed to overlap communication and computation in a program. Based on an exact data-flow analysis on individual array element accesses, the compiler inserts data transmission requests to message queue into SPMD code. Experiments show that introducing an asynchronous transmission mechanism into data parallel language compilers is effective.
On the Complexity of Kinodynamic Planning
Authors: John Canny, Bruce R Donald, John Reif, Patrick G. Xavier
Venue:  (1988)

In robotics, kinodynamic planning attempts to solve a motion problem subject to simultaneous kinematic and dynamic constraints. We consider the following problem: given a robot system, find a minimal-time trajectory from a start position and velocity to a goal position and velocity, while avoiding obstacles and respecting dynamic constraints on velocity and acceleration. We consider the simplified case of a point mass under Newtonian mechanics, together with velocity and acceleration bounds. The point must be flown from a start to a goal, amidst polyhedral obstacles in 2D or 3D. While exact solutions to this problem are not known, we provide the first provably good approximation algorithm, and show that it runs in polynomial time.
Computer science apprenticeship
Authors: A. Shabo, M. Guzdial, J. Stasko
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

One of the old and effective ways of training is the apprenticeship way. The effectiveness of training people in the workplace comes from different reasons. One reason may be the engagement of the apprentice in real-world problems. Another reason may be the close presence of the supervisor who provides the apprentice with scaffolding along the training process. Typically, at the beginning of the process the apprentice can't perform a lot without the scaffolding support, and towards the end of the process, scaffolding fades and the apprentice is capable of performing tasks alone. Industry and academia could benefit from this kind of model to ease the transition of undergraduate students from school to work and within each community, the transition from one level to a higher one. The authors have created a computerized apprenticeship on the Web for computer science education. It integrates the modules: 'Interactive Notes', 'Case Library', 'Problem-Solving Activities' and a 'Collaboration' module. They have focused on computer graphics as the first subject.
Sparse Complete Sets for NP: Solution of a Conjecture by Berman and Hartmanis
Authors: Stephen R. Mahaney
Venue:  (1980)

In this paper we show that if NP has a sparse complete set under many-one reductions, then P=NP. The result is extended to show that if NP is sparse reducible, then P=NP. The main techniques of this paper generalize the NP recognizer for the complement of a sparse complete set with census function to the case where the census function is not known (c.f. [HM]), then a many-one reduction of this language to the sparse set permits a polynomial time bounded tree search as in [B], [F], or [MP]. Even without actual knowledge of the census, the algorithm utilizes the properties of the true census to decide membership in SAT in polynomial time.
Winspect - A Case Study for Wearable Computing Supported Inspection Tasks
Authors: Michael Boronowsky, Tom Nicolai, Christoph Schlieder, Ansgar Schmidt
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This paper introduces the Winspect project - an application of wearable computing in an industrial inspection process - with focus on its user interface. We are presenting a case study to demonstrate the benefit of wearable input devices and the use of implicit interaction as a complementary technique. Two almost independent tasks from the application domain will be addressed: the input of findings for inspected components in a harsh environment, and a technique to overcome the display resolution when browsing in a hypertext-like documentation.
Direct Manipulation of Surfaces using NURBS-Based Free-Form Deformations
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper demonstrates how NURBS-based Free-Form Deformations (NFFDs) can be used to generate and sculpt NURBS-based objects in a way that avoids many of the limitations of ordinary FFDs. A system is described in which the user interacts with the NFFD through a set of direct-acting tools, removing the need to manipulate the mesh directly. As the user applies the tools to the object, the NFFD is updated automatically. Objects are represented as isosurfaces of the NFFD volume, giving a good insight into the way an NFFD would deform a general object.
The Little iDVD Book, 2 edition
Authors: Bob LeVitus
Venue:  (2002)

:Learning a new technology can be an intimidating prospect, even when the tools are as straightforward as Apple's iDVD 3. If you've been hesitating to take the step into DVD production, wait no more--there's no gentler approach than that offered by Peachpit's best-selling "Little" book series and noted Mac columnist Bob ("Dr. Mac") LeVitus. In The Little iDVD Book, Second Edition Bob helps you conquer your fears and get down to the exciting business of creating interactive DVDs with iDVD 3 and Apple's tightly integrated iLife applications, iTunes, iPhoto, and iMovie. Through jargon-free language and step-by-step instructions, he shows you how to share movies, music, and pictures on DVD.In these pages, you'll learn about all the features that are new to this version of iDVD, including the dozens of new menu "themes"; support for iMovie chapter markers, which lets viewers skip quickly from scene to scene; automatic creation of Scene Selection menus; as well as how you can access iTunes and iPhoto libraries directly from within iDVD. And if you're interested in using iDVD software to archive or share other data (such as AppleWorks, Word, PowerPoint, and Excel files), you'll find that info as well.
Framework for Computer Based Safety-Related Systems: Overview of Draft International Standard IEC 1508
Authors: R. Bell
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This article provides an overview of the proposed International Electrotechnical Commission (IEC) standard (IEC 1508) entitled "Functional safety of electrical/electronic/programmable electronic safety-related systems" which sets out a generic approach for all Safety Lifecycle activities for electrical/electronic/programmable electronic systems (E/E/PESs) that are used to perform safety functions. The emergence of this international standard should be a major step towards the adoption of a more rational and consistent technical policy for all electrically based safety-related systems. A major objective is to facilitate the development of application sector standards. The article also considers priorities for the future if both the safety and economic benefits are to be fully realised from the adoption of this proposed international standard.
Transparent and Robust Audio Data Hiding in Subband Domain
Authors: Xin Li, Hong Heather Yu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Data hiding embeds extra information into digital media for the purpose of authentication, annotation and copyright protection. Transparency and robustness are two contradictory requirements for any data-hiding scheme.This paper studies audio data hiding using spread spectrum (SS) technique in subband domain. On transparency part, we propose a novel method of tuning psycho-acoustic models employed in audio compression to control the audibility of introduced distortion for data hiding purpose. On robustness part, we have studied feature selection and synchronization problem in order to maximize the survivability of the embedded data. Our study shows that mid-band coefficients are appropriate features for data embedding. In addition, we propose to track/recover synchronization of audio signal before the detection, facilitating the extraction of the embedded data. Experiment results have shown that our data-hiding scheme in subband domain can survive a wide range of attacks while providing transparent audio quality and abundant embedding capacity (>20bps).
Modeling and Design of a Low-Voltage SOI Suspended-Gate MOSFET (SG-MOSFET) with a Metal-Over-Gate Architecture
Authors: C. Hibert, G. A. Racine
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

A novel MEMS device architecture: the SOI SG-MOSFET, which combines a solid-state MOS transistor and a suspended metal membrane, in a unique metal-over-gate architecture, is proposed. A unified physical analytical model is developed and used to investigate main electrostatic characteristics in order to provide first-order design criteria for low-voltage, C-MOS compatible actuation. Based on the simulated electrostatic characteristics it is shown that both capacitive RF switch and microrelay (current switch) applications can be addressed by the SOI SG-MOSFET architecture. It is demonstrated that the use of a thin gate oxide (100) and a low spring constant
Research of a Genetic Algorithms Designer
Authors: L. G. Komartsova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Basic problems of the genetic algorithms (GA) usage effectiveness increase during the solution of optimization, search and adaptation problems are investigated in this study. The greatest influence on the speed of convergence and the probability of the best solution finding is made by the selective types of the genetic operators and other parameters, which ensure the greatest effectiveness of GA work. For the solution of these problems it is proposed to use a Designer allowing to automatically select the GA parameters. With the aid of the GA parameters automatic selection at the solution of the continuous and combinatory optimization problems it became possible to decrease the number of iterations and to increase the probability of extreme finding. 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
FLB: Fast Load Balancing for Distributed-Memory Machines
Authors: Andrei Radulescu, Arjan J. C. Van Gemund
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing ~(FLB). Compared to other typical list scheduling heuristics, FLB drastically reduces scheduling time complexity to O(V(log(W)+log(P))+E), where V and E are the number of tasks and edges in the task graph, respectively, W is the task graph width and P is the number of processors. It is proven that FLB is essentially equivalent to the existing ETF scheduling algorithm of O(W(E+V)P) time complexity. Experiments also show that FLB performs equally to other one-step algorithms of much higher cost, such as MCP. Moreover, FLB consistently outperforms multi-step algorithms such as DSC-LLB that also have higher cost.
MONAD: a flexible architecture for multi-agent control
Authors: Thuc Vu, Jared Go, Gal Kaminka, Manuela Veloso, Brett Browning
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Research in multi-agent systems has led to the development of many multi-agent control architectures. However, we believe that there is currently no known optimal structure for multi-agent control since the effectiveness of any particular architecture varies depending on the domain of the problem. Therefore, deployment of multi-agent teams would be significantly sped up by a development and deployment environment which would allow designers to easily modify the architecture. In this paper, we present a flexible team-oriented programming and execution architecture, MONAD, which integrates hierarchical behavior-based control, multi-agent coordination mechanisms, and agent-task allocation services. MONAD uses a novel scripting language that allows designers to easily modify the team structure, behavior hierarchy, applicability conditions, and arbitration methods, in pursuit of the best solution for a particular problem. We have evaluated the MONAD architecture within a well-accepted adversarial game environment, GameBots, to enable qualitative comparison of different control techniques. In this environment, we were able to rapidly design and test several teams of agents who used role, preference, or a combination of role and preference arbitration and observed that these different teams varied in their performance characteristics.
A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetic Progression
Authors: Paul Pritchard
Venue:  (1982)

NO SUPPLIED
Structure Sharing and Parallelization in a GB Parser
Authors: Marwan Shaban
Venue:  (1994)

Abstract By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita''s algorithm (as described in \cite{tomi86}), we investigate how a GB parser can preserve the structure sharing output by Tomita''s algorithm. In this report, we discuss the implications of using Tomita''s algorithm in GB parsing, and we give some details of the structure-sharing parser currently under construction. We also discuss a method of parallelizing a GB parser, and relate it to the existing literature on parallel GB parsing. Our approach to preserving sharing within a shared-packed forest is applicable not only to GB parsing, but anytime we want to preserve structure sharing in a parse forest in the presence of features. 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
Before the B5000: Burroughs Computers, 1951-1963
Authors: George T. Gray, Ronald Q. Smith
Venue: IEEE Annals of the History of Computing (2003)

Like many companies entering the computer industry, Burroughs began by working on US government contracts. Once sufficient expertise had been gained, the company entered the general-purpose computer market. The Datatron computer, obtained through the ElectroData Corporation acquisition, was a modest success in the late 1950s; however, pioneering work on transistor computers for military contracts was not immediately transferred to the commercial marketplace.
Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling
Authors: Hadas Shachnai, Philip S. Yu
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

In a Video-on-demand (VOD) computer system, batching requests for the same video to share a common data stream can lead to significant improvement in throughput. Using the {\em wait tolerance} characteristic that is commonly observed in viewers behavior, we introduce a new paradigm for scheduling in VOD systems. We propose and analyze two classes of scheduling schemes: the Max_Batch and Min_Idle schemes, that provide two alternative ways for using a given stream capacity for effective batching. In making a video selection, the proposed schemes take into consideration the next stream completion time as well as the viewer wait tolerance. We compared the proposed schemes with the two previously studied schemes: (1) first-come-first-served (FCFS) that schedules the video with the longest waiting request and (2) the maximum queue length (MQL) scheme that selects the video with the maximum number of waiting requests. We show through simulations that the proposed schemes outperform substantially FCFS and MQL in reducing the viewer turn-away probability, while maintaining a small average response time. In terms of system resources, we show that by exploiting the viewers wait tolerance, the proposed schemes can reduce significantly the server capacity required for achieving a given level of throughput and turn-away probability as compared to the FCFS and MQL. Furthermore, our study shows that an aggressive use of the viewer wait tolerance for batching may not yield the best strategy, and that other factors, such as the resulting response time, fairness, and loss of viewers, should be taken into account.
Inductive Characteristics of Power Distribution Grids in High Speed Integrated Circuits
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The inductive characteristics of several types of gridded power distribution networks are described in this paper. The inductance extraction program FastHenry is used to evaluate the inductive properties of grid structured interconnect. In power distribution grids with alternating power and ground lines, the inductance is shown to vary linearly with grid length and inversely linearly with the number of lines in the grid. The inductance is also relatively constant with frequency in these grid structures. These properties provide accurate and efficient estimates of the inductance of power grid structures with various dimensions.