ppxscal/embedding_network huggingface dataset:
Typed Memory Management in a Calculus of Capabilities
Authors: David Walker, Karl Crary, Greg Morrisett
Venue:  (2000)

Region-based memory management is an alternative to standard tracing garbage collection that makes potentially dangerous operations such as memory deallocation explicit but verifiably safe. In this article, we present a new compiler intermediate language, called the Capability Calculus, that supports region-based memory management and enjoys a provably safe type system. Unlike previous region-based type systems, region lifetimes need not be lexically scoped and yet the language may be checked for safety without complex analyses. Therefore, our type system may be deployed in settings such as extensible operating systems where both the performance and safety of untrusted code is important. The central novelty of the language is the use of static capabilities to specify the permissibility of various operations, such as memory access and deallocation. In order to ensure capabilities are relinquished properly, the type system tracks aliasing information using a form of bounded quantification. Moreover, unlike previous work on region-based type systems, the proof of soundness of our type system is relatively simple, employing only standard syntactic techniques. In order to show our language may be used in practice, we show how to translate a variant of Tofte and Talpin''s high-level type-and-effects system for region-based memory management into our language. When combined with known region inference algorithms, this translation provides a way to compile source-level languages to the Capability Calculus.
Adaptable Real-Time Distributed Object Management for Command and Control Systems
Authors: John Maurer, Roman Ginis, Richard Freedman, Michael Squadrito, Steven Wohlever, Bhavani Thuraisingham
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Between now and the early part of the next century, significant portions of today's real-time command, control, and communication (C3) systems will become either functionally inadequate or logistically insupportable. Furthermore, due to the continuing budget reductions, new developments of next generation real-time C3 systems may not be possible. Therefore, current real-time C3 systems need to become easier, faster, and less costly to upgrade in capability and easier to support. What is needed is an approach to evolve current real-time C3 systems into the extensible systems required for the future.This paper describes our Adaptable Real-time Distributed Object Management (ARTDOM) approach for command and control systems. We have constructed a testbed environment and experimented with a Common Object Request Broker Architecture (CORBA) Object Request Broker (ORB). This project is a three year initiative and is expected to be completed at the end of 1999.
A Better Tool for Query Optimization
Authors: Dina Bitton, Bradley T. Vander Zanden
Venue:  (1985)

When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly distributed in the relation. In this paper we depart from this assumption and instead consider Zipf distributions that are known to accurately model text and name distributions. Given a relation of cardinality $n$ where a non-key attribute $A$ has a Zipf distribution, we derive both an exact formula and an approximate non-iterative formula for the expected number of distinct $A$-values contained in a sample of $k$ randomly selected tuples. The approximation is accurate, and it is very easy to compute. Thus it provides a practical tool to deal with non-uniform distributions in query optimization.
AC1 triangular finite element for analyzing multilayered shell structures
Authors: F. Dau, O. Polit, M. Touratier
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with a new triangular finite element to analyse the behaviour of multilayered shells. This element is based on a refined kinematical model and uses both conforming finite element method and higher order approximations. Including a non-linear distribution with respect to the normal co-ordinate for transverse shear stresses and continuity requirements between layers for both transverse shear stresses and displacements, this model does not require any shear correction factors and allows to satisfy the boundary conditions at the top and bottom surfaces of the shell. Various strain expressions available for shell are discussed. Finally, results in linear static, free vibrations and transient dynamic response for multilayered shells structures show the efficiency of this new shell finite element.
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
Authors: Nader H. Bshouty, Jeffrey Jackson
Venue:  (1994)

We generalize the notion of PAC learning from an example oracle to a notion of efficient learning on a quantum computer using a quantum example oracle. This quantum example oracle is a natural extension of the traditional PAC example oracle, and it immediately follows that all PAC-learnable function classes are learnable in the quantum model. Furthermore, we obtain positive quantum learning results for classes that are not known to be PAC learnable. Specifically, we show that DNF is efficiently learnable with respect to the uniform distribution by a quantum algorithm using a quantum example oracle. While it was already known that DNF is uniform-learnable using a membership oracle, the quantum example oracle is provably less powerful that a member oracle. We also generalize the notion of calssification noise to the quantum setting and show that the quantum DNF algorithm learns even in the presence of such noise. This result contrasts with a recent negative result for DNF in the statistical query model of learning from noisy data.
Distributed Framework for Real-Time Multimedia Object Communication
Authors: Husni Fahmi, Walid G. Aref, Mudassir Latif, Arif Ghafoor, Peiya Liu, Liang Hsu
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In this paper we highlight major technical requirements for designing and developing future distributed multimedia information system using Internet technology. The key requirements of this system are to allow users to access and search and to communicate multimedia documents consisting of text, audio, video, and image. We emphasize the role of object-oriented technology for information management and real-time communication protocols to guarantee QoS.We present a reference architecture for Web-based real-time distributed multimedia system which integrates enabling technologies including real-time streaming, multimedia indexing and searching, and distributed object management.
Agent Server Technology for Next Generation of Web Applications
Authors: Gaku Yamamoto, Hideki Tai
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Web applications providing services customized for individual users have become common.Such applications require very high performance though the available development time is very short.Therefore, we need very flexible and high performance platform for such customized Web applications.In this paper, we introduce an agent server technology based on an "agent-oriented programming model" for developing Web applications and show how the technology addresses issues in such Web application development.
Optimizing main-memory join on modern hardware
Authors: Stefan Manegold, Peter A. Boncz, Martin L. Kersten
Venue:  (1999)

In the past decade, the exponential growth in commodity CPUs speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems have not yet adapted to these trends, and show poor utilization of both CPU and memory resources on current hardware. In this article, we show how these resources can be optimized for large joins and translate these insights into guidelines for future database architectures, encompassing data structures, algorithms, cost modeling, and implementation. In particular, we discuss how vertically fragmented data structures optimize cache performance on sequential data access. On the algorithmic side, we refine the partitioned hash-join with a new partitioning algorithm called radix-cluster, which is specifically designed to optimize memory access. The performance of this algorithm is quantified using a detailed analytical model that incorporates memory access costs in terms of a limited number of parameters, such as cache sizes and miss penalties. We also present a calibration tool that extracts such parameters automatically from any computer hardware. The accuracy of our models is proven by exhaustive experiments conducted with the Monet database system on three different hardware platforms. Finally, we investigate the effect of implementation techniques that optimize CPU resource usage. Our experiments show that large joins can be accelerated almost an order of magnitude on modern RISC hardware when both memory and CPU resources are optimized.
Splicing systems on graphs
Authors: R. Freund
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

The notion of splicing systems has been introduced by Tom Head (1987) in order to model the recombinational behaviors of double-stranded DNA molecules under the simultaneous influence of specified classes of restriction enzymes. Yet for modelling complex: (bio)chemical processes of three-dimensional (macro)molecules in the three-dimensional space strings turn out to be more or less inadequate objects. Hence in this paper the author suggests graphs as more suitable objects for modelling such processes and introduces graph splicing systems. An illustrating example from the area of DNA splicing is elaborated in order to show the suitability of the new approach. The author exhibits the relation between regular graph splicing systems on graphs and splicing systems on strings and shows that his new model allows him to describe splicing systems on strings as well as on circular strings within a uniform framework.
Solaris 9 System Administrator Exam Cram 2 (Exam Cram 310-014, Exam Cram 310-015)
Authors: Darrell Ambro, Ed Tittel
Venue:  (2002)

:The perfect study companion for UNIX system professionals preparing for both Solaris 9 System Administrator exams (310-014 and 310-015). The book contains accurate and efficient coverage of the many new features of the Solaris 9 system. Readers preparing for this exam find the best-selling Exam Cram2 series to be the smartest, most efficient way to become certified. This book focuses on exactly what readers need to get certified now - featuring test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers that are not available anywhere else. ExamCram2 also features PrepLogic Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam and full, detailed explanations of the correct and incorrect answers.
Several necessary conditions for the evolution of complex forms of life in an artificial environment
Authors: Hideaki Suzuki, Naoaki Ono, Kikuo Yuta
Venue: Artificial Life (2003)

In order for an artificial life (Alife) system to evolve complex creatures, an artificial environment prepared by a designer has to satisfy several conditions. To clarify this requirement, we first assume that an artificial environment implemented in the computational medium is composed of an information space in which elementary symbols move around and react with each other according to human-prepared elementary rules. As fundamental properties of these factors (space, symbols, transportation, and reaction), we present ten criteria from a comparison with the biochemical reaction space in the real world. Then, in the latter half of the article, we take several computational Alife systems one by one, and assess them in terms of the proposed criteria. The assessment can be used not only for improving previous Alife systems but also for devising new Alife models in which complex forms of artificial creatures can be expected to evolve.
Wavelength Assignment in WDM Rings with Splitable Lightpaths
Authors: Gruia Galinescu, Peng-Jun Wan
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

This paper presents a new practical approximation algorithm for wavelength assignment to splitable lightpaths over WDM rings, with the objective of minimizing the number of SONET ADMs. Allowing the splitting of traffic streams can significantly reduce the number of required ADMs.Moreover, while finding the best assignment is proved to be NP-Hard, the problem seems easier to approximate than the variation when traffic streams cannot be split. In the worst case, the output of the new polynomial-time algorithm is at most 25% more than the optimum solution. This result is significantly better than the best known approximation ratio for non-splitable traffic streams.
On Predictable Operating System Protocol Processing
Authors: Clifford W. Mercer, Jim Zelenka, Ragunathan Rajkumar
Venue:  (1994)

Distributed continuous media applications that incorporate digital audio and video require predictable response from the operating system and the network. Much recent research in communication networks focuses on providing predictable service at the network level, but current operating systems do not typically provide end-to-end predictability. Our aim is to offer operating system support for predictability while still maintaining the dynamic, easy-to-use environment of a general purpose operating system. We explore the use of a resource reservation mechanism in the operating system with the idea that this mechanism can be used to support higher level quality of service management policies. We also employ a protocol software structure that uses priorities, preemptive packet servicing, and reservation enforcement to allow the reservation scheduling policy to make fine-grained scheduling decisions to control the protocol processing activities. By reserving resources such as buffers, computation time for application-level activities, and computation time for protocol processing, our system can support predictable behavior for distributed real-time application programs. We implemented our reservation mechanism using the Real-Time Mach operating system as a base, and we present performance results which demonstrate that our approach provides predictable network service to distributed multimedia applications.
Aspect-Oriented Programming with AspectJ
Authors: Ivan Kiselev
Venue:  (2002)

:In Aspect-Oriented Programming with AspectJ, expect to learn the basics of AOP, why it is useful, and how it relates to object-oriented programming. AspectJ is an aspect-oriented extension to the Java programming language. Developed by Palo Alto Research Center Incorporated with partial support by DARPA (Defense Advanced Research projects Agency) this open-source project makes aspect-oriented programming technology available to a wide audience and creates a set of tools to support the technology's everyday use. AspectJ enables you to modularize crosscutting application concerns, making the development process more robust and less expensive. The AspectJ project provides an open-source compiler, structure browser, and API documentation tool with IDE support for JBuilder, Forte, and Emacs.
Protect Your Home PC: Hackers, Viruses and Privacy
Authors: Dana Joy
Venue:  (2003)

:This introductory guide is designed to educate the non-tech savvy individual in the world of computer security threats and the application of necessary precautions to protect a PC. Subjects covered include a description of viruses, who is at risk, firewalls, and keeping unwanted files off a computer. Included is information on Norton and McAfee virus software, virus scan features, and live update features, along with a tutorial on how to respond to a virus attack and isolate and repair a computer. Internet security topics and safeguarding the Web-surfing experience are covered in detail, including parental controls, online risks, and accessing downloads. Also provided are overviews of several basic storage management techniques and system back-up procedures, such as backing up a Windows XP system and designing a personal security plan.Author Biography: Dana Joy is a member of the Gateway Training Organization. She lives in Poway, California. 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
Performance Debugging and Tuning using an Instruction-Set Simulator
Authors: Peter S. Magnusson, Johan Montelius
Venue:  (1997)

Instruction-set simulators allow programmers a detailed level of insight into, and control over, the execution of a program, including parallel programs and operating systems. In principle, instruction set simulation can model any target computer and gather any statistic. Furthermore, such simulators are usually portable, independent of compiler tools, and deterministic-allowing bugs to be recreated or measurements repeated. Though often viewed as being too slow for use as a general programming tool, in the last several years their performance has improved considerably. We describe SIMICS, an instruction set simulator of SPARC-based multiprocessors developed at SICS, in its role as a general programming tool. We discuss some of the benefits of using a tool such as SIMICS to support various tasks in software engineering, including debugging, testing, analysis, and performance tuning. We present in some detail two test cases, where we''ve used SimICS to support analysis and performance tuning of two applications, Penny and EQNTOTT. This work resulted in improved parallelism in, and understanding of, Penny, as well as a performance improvement for EQNTOTT of over a magnitude. We also present some early work on analyzing SPARC/Linux, demonstrating the ability of tools like SimICS to analyze operating systems. (NOTE: A later version of this report was published in ILPS''97)
On Deciding Granularity for Optimal Speedup for Solving Data Parallel Problems with Clustered Distributed Computing
Authors: Jung-Sing Jwo, Yu Chin Cheng, Chin-Yun Hsieh
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we show how to obtain optimal speedup in a master-slave model for solving data-parallel problems. Given the number of homogeneous workstations, their computation time for solving a basic sub-task of the problem, network transmission bandwidth and data volume per basic sub-task, the per-distribution number of basic sub-tasks sent to a slave for attaining the optimal speedup can be decided. The effectiveness of the proposed theory has been tested using a parallel computing experiment involving the Hough transformation.
Equations as a uniform framework for partial evaluation and abstract interpretation
Authors: J. Field, Jan Heering, T. B. Dinesh
Venue:  (1997)

A variety of disparate methods have traditionally been used to define the execution semantics of programming languages, to describe partial evaluation, to formalize program analysis as abstract interpretation, and to implement each of these operations in practical systems. We argue here that equational logic can serve to unify each of these aspects of language manipulation.
Combination of Multiple Classifiers Using Adaptive Fuzzy Integral
Authors: Tuan D. Pham
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

An algorithm for fusing multiple handwritten-numeral classifiers is addressed herein using the fuzzy integral in the sense of adaptive aggregation. This method includes a procedure for calculating the ¿-fuzzy measures which are adaptively adjusted depending on the interactions among individual classifiers. Based on these fuzzy measures, the fuzzy integral is then used as a nonlinear functional to search for the maximum degree of agreement between the complementary/conflicting multiple sources of evidence. Results obtained from the fuzzy integral are used for decision making in the classification problem. Experimental results on handwritten numeral recognition show that the performance of this multi-classifier fusion method outperforms that of other conventional classifier-combination techniques.
Searching with Numbers
Authors: Rakesh Agrawal
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

A large fraction of the useful web is comprised of specification documents that largely consist of \langleattribute name, numeric value\rangle pairs embedded in text. Examples include product information, classified advertisements, resumes, etc. The approach taken in the past to search these documents by first establishing correspondences between values and their names has achieved limited success because of the difficulty of extracting this information from free text. We propose a new approach that does not require this correspondence to be accurately established. Provided the data has “low reflectivity”, we can do effective search even if the values in the data have not been assigned attribute names and the user has omitted attribute names in the query. We give algorithms and indexing structures for implementing the search. We also show how hints (i.e., imprecise, partial correspondences) from automatic data extraction techniques can be incorporated into our approach for better accuracy on high reflectivity data sets. Finally, we validate our approach by showing that we get high precision in our answers on real data sets from a variety of domains.