ppxscal/embedding_network huggingface dataset:
Applying Adaptive Safety Analysis Techniques
Authors: Robyn R. Lutz, Hui-Yin Shaw
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Current needs for high-reliability, reusable software; rapid, evolutionary development; and verification of innovative software architectures have focused attention on improving techniques for analyzing the safety and reliability of embedded software. The work reported here integrates two successful safety analysis techniques which have been used separately on software and hardware into the system hazard analysis. This process combines Software Failure Modes and Effects Criticality Analysis (SFMECA) and Software Fault Tree Analysis (SFTA) in a way that can be readily adapted to a particular project's evolving system needs. The technique was used on two recent space instruments: the Mars Microprobe Project and the Earth Orbiting System's Microwave Limb Sounder. The main lessons learned from this experience are discussed: (1) flexible use, (2) a risk-driven rather than sequential approach, (3) "zoom-in/zoom-out" use, (4) SFMECA and SFTA as complementary techniques, (5) preserving traceability, and (6) applicability to fault protection software.
Steady-state analysis of a queue with varying service rate
Authors: Rudesindo N\''{u}\~{n}ez Queija
Venue:  (1997)

In this paper we study a queueing model with a server that changes its service rate according to a finite birth and death process. The object of interest is the simultaneous distribution of the number of customers in the system and the state of the server in steady-state. The model can be applied to the performance analysis of (low priority) Available Bit Rate (ABR) traffic at an ATM switch in the presence of traffic with a higher priority such as Variable Bit Rate (VBR) traffic and Constant Bit Rate (CBR) traffic. For a specific example we illustrate by numerical experiments the influence of the latter traffic types on the ABR service.
SQL Server Security, 1 edition
Authors: David Litchfield
Venue:  (2003)

Addresses SQL Server vulnerabilities and provides security solutions. Covers installation, administration, and programming--plus security issues such as authentication, encryption, intrusion detection, and more. Written for IT professionals administering or programming any SQL Server-based application--includes coverage of SQL Server 7, SQL Server 2000, and SQL Server (Yukon). Table of contents 1: SQL Server Security: The Basics 2: Under Siege: How SQL Server Is Hacked 3: SQL Server Installation Tips 4: The Network-Libraries and Secure Connectivity 5: Authentication and Authorization 6: SQL Server in the Enterprise 7: Auditing and Intrusion Detection 8: Data Encryption 9: SQL Injection: When Firewalls Offer No Protection 10: Secure Architectures Appendix A: System and Extended Stored Procedure Reference Appendix B: Additional Technologies that Impact SQL Server Security Appendix C: Connection Strings Appendix D: Security Checklists
A Practical Constructive Scheme for Deterministic Shared-Memory Acess
Authors: A. Pietracaprina, F. P. Preparata
Venue:  (1993)

We present an explicit memory organization scheme for distributing $M$ data items among $N$ memory modules where $M \in \Theta(N^{1.5-O(1/\log N)})$. Each datum is replicated into a constant number of copies assigned to distinct modules. Assuming that $N$ processors are connected to the memories through a complete graph, we provide an access protocol so that the processors can read/write any set of $N'' \leq N$ distinct data in $O((N'')^{1/3} \log^{*} N''+\log N)$ worst-case time. The address computation can be carried out efficiently without resort to a complete memory map and using $O(1)$ internal storage per processor.
A constructive method for building fuzzy rule-based systems
Authors: Ignacio Requena, Armando Blanco, Miguel Delgado
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

This paper proposes a new method for identifying unknown systems with Fuzzy Rule-Based Systems (FRBSs). The method employs different methodologies from the discipline of Soft Computing (Artificial Neural Networks, Fuzzy Clustering) and follows a three-stage process. Firstly, the structure of the FRBS rules is determined using a feature selection process. A fuzzy clustering procedure is then used to establish the number of fuzzy rules. In the third step, the fuzzy membership functions are constructed for the linguistic labels. Finally, the empirical performance of the algorithm is studied by applying it to a number of classification and approximation problems.
Enhanced Techniques for Current Balanced Logic in Mixed-Signal ICs
Authors: Li Yang, J. S. Yuan
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In this paper, dual-VT an negative fee back are propose toreduce the noise of the current-balance logic for mixed-signalICs. Based on the circuit analysis and SPICE simulation, thedual-VT technique shows advantages over the conventionalcurrent-balanced logic design in gate area, delay, powerdissipation, and switching noise. The negative feedback furtherreduces the noise spike.
Optimal Sequencing Energy Allocation for CMOS Integrated Systems
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

All synchronous CMOS integrated systems have to pay some sequencing overhead. This overhead includes the skew and the jitter of the clock. It also includes the setup time and the clock-to-output delay of the flip-flops. This paper discusses how much energy should be allocated for sequencing in these systems. It is pointed out that providing too little energy is just as bad as providing too much. It is also argued that tying to minimize the energy-delay product of the sequencing subsystem is practically not the right thing to do. A model for the relationship between supply voltage, clock frequency, and power dissipation is developed and empirically verified for a SPARC V9 microprocessor. An expression for the optimal energy allocation in a system is derived. Then, based on this optimum, a methodology to design energy-efficient systems is proposed.
Foundation Macromedia Flash MX, 1 edition
Authors: Kris Besley, Amanda Farr, Sham Bhangal
Venue:  (2002)

:This book caters for web designers for who are adopting Flash for the first time with Flash MX. It's based on the highly-successful and much-acclaimed Foundation Flash 5, and uses the same heavy-duty, sequential, detailed and thorough tutorial method, but it's fully updated to cover the new and enhanced features in MX. If you coming to Flash completely from scratch, this book will give you the broad and solid foundation for exploring MX's higher-end features.Author Biography: Kris Besley is a dedicated Flasher and freelance developer/author. Sham Bhangal is a renowned Flash author, with a list of acclaimed titles to his credit. Amanda Farr is a long-time Flash user and evangelist, and was the founder and webmaster for one of the most popular Flash resource sites.
Boosting the Network Performance via Traffic Reshaping
Authors: Sergey Gorinsky, Sanjoy Baruah, Alexander Stoyen
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Traffic reshaping and its impact on providing deterministic guarantees of timely data delivery in a packet-switched virtual-circuit fixed-packet network are investigated. Two types of traffic smoothing are considered: global reshaping (when traffic on all network connections is smoothed) and local reshaping (when the traffic specification is changed only for a single connection). The conditions when reshaping is beneficial are derived and the optimal values of traffic model parameters are obtained. In particular, it is shown that, when one tries to minimize end-to-end delay bounds for leaky bucket constrained traffic, the traffic either should be made Constant Bit Rate (CBR) or should not be reshaped at all. It is proven that changing the leaky bucket specification to the dual leaky bucket specification is always able to yield better timeliness guarantees and utilization of network resources. Finally, local reshaping for the dual leaky bucket model is studied.
ProtectOS: Operating System and Hardware Support for Small Objects
Authors: John Holford, George Mohay
Venue:  (1996)

The goal of the Computer Architecture for Secure Systems (CASS) project (Mohay et al., 1993) is to develop an architecture and tools to ensure the security and integrity of software in distributed systems. As part of that work -we have been investigating the use of the Intel 80286'' segmentation hardware to enhance the security and integrity of small objects. Object oriented design and programming are considered by their proponents to facilitate the development of quality software. None the less the static semantics of an OOP language cannot, of its own nor even when combined with systematic and comprehensive testing, guarantee the correctness of a program. In this paper, we outline a novel way of combining object oriented programming with the under-exploited hardware level security mechanisms provided by the Intel 80286@'' processor family to provide additional integrity for such programs and to assist with program debugging. The hardware protection mechanisms which are intended to provide process isolation are used at a lower level of granularity to isolate the objects that exist within a process.
Mechanical Verification of Transaction Processing Systems
Authors: Dmitri Chkliaev, Jozef Hooman, Peter van der Stok
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

This paper concerns the formal specification and mechanical verification of transaction processing systems aimed at distributed databases. In such systems, a standard set of ACID properties must be ensured by a combination of concurrency control and recovery protocols. In the existing literature, these protocols are often studied in isolation, making strong assumptions about each other. The problem of combining them in a formal way is largely ignored. To study the formal verification of combined protocols, we specify a transaction processing system, integrating strict two-phase locking, undo/redo recovery and two-phase commit. In our method, state machines define the locking and undo/redo mechanism at distributed sites, whereas the interaction between sites according to the two-phase commit protocol is specified by assertions. We proved with the interactive proof checker of PVS that our system satisfies atomicity, durability and serializability properties.
Extending WebCom: A Proposed Framework for Web Based Distributed Computing
Authors: John P. Morrison, James J. Kennedy, David A. Power
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The introduction of Java in the mid nineties has revolutionized and revitalized interest in the construction of ¿super computers¿ from ¿off the shelf¿ components. Much of the research spawned by the introduction of Java is in the area of metacomputing, where projects that utilize the distributed capabilities of the World Wide Web are becoming more frequent. WebCom is one such system that implements a framework to harness these distributed resources. Although WebCom supports different models of computation, by incorporating them as distinct modular components, an implicitly parallel graph-based model is used. Visual programming tools for simulation steering are employed allowing the creation, submission and dynamic manipulation of programs.
Enhancing Intellectual Power of Recognition Systems Based on New Pattern Recognition Theory
Authors: Nikolay G. Fedotov, Lyudmila A. Shulga
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Application of stochastic geometry methods to pattern recognition is analyzed. The discourse is based on Trace-transformations of original images introduced by [1] into images on the Möbius band. Based on the new geometric transformation, a new approach towards the construction of features, independent of images' motions or their linear transformations, is put forward. A prominent characteristics of the group of features under consideration is representing each of them as a consecutive composition of three functionals. Such a structure of features helps automatically generate a greater number of new constructive signs of recognition. Such a powerful shift of stress from the decision procedures onto features' mass application, accounts for speaking about a new interpretation of images, and enhancing intellectual power of recognition systems.
Document Skew Detection Using Minimum-Area Bounding Rectangle
Authors: Reza Safabakhsh, Shahram Khadivi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Detection of document skew is an important step in document image analysis. This paper presents a new method for calculation of document skew. This method forms large connected components by a smoothing algorithm and calculates the document skew by finding the orientation of the minimum-area bounding rectangle of one or several connected components. Connection of text to non-text in the smoothing step does not degrade the performance of the method. The smoothing parameters are determined automatically and no manual adjustment is necessary. The method is not limited in the range of detectable skew angles and the achievable accuracy. Experimental results show the high performance of the algorithm in detecting document skew for a variety of documents with different levels of complexity.
Learning at the crossroads of biology and computation
Authors: J. Paredis
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Discusses various avenues for exploiting biological learning mechanisms within machine learning. Special attention is given to the following issues: (a) the reasons for the wide variety of biological learning mechanisms; (b) the relation between lifetime and genetic learning; (c) a description of the driving forces of genetic learning and their use in evolutionary computation. Various symbolic machine learning and reasoning techniques can be used to complement (genetic and/or neural) sub-symbolic learning. A first approach uses symbolic induction for explaining the behavior of (genetically evolved) neural nets. Next, a general framework for the use of (symbolic) domain knowledge during genetic learning is introduced.
An investigation of broad coverage automatic pronoun resolution for information retrieval
Authors: Richard J. Edens, Helen L. Gaylard, Gareth J. F. Jones, Adenike M. Lam-Adesina
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Term weighting methods have been shown to give significant increases in information retrieval performance. The presence of pronomial references in documents reduces the term frequencies of associated words with a consequent effect on term weights and information retrieval behaviour. This investigation explores the impact on information retrieval performance of broad coverage automatic pronoun resolution. Results indicate that this approach has potential to improve both precision at fixed cutoff levels and average precision.
The SOLID Interface Manual
Authors: P. A. D. DeMaine, D. M. Head
Venue:  (1989)

This two part report contains the User and System Manuals for the application of the SOLID systems that validate and retrieve information about VLSI.
Distributed algorithm engineering
Authors: Paul G. Spirakis, Christos D. Zaroliagis
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

When one engineers distributed algorithms, some special characteristics arise that are different from conventional (sequential or parallel) computing paradigms. These characteristics include: the need for either a scalable real network environment or a platform supporting a simulated distributed environment; the need to incorporate asynchrony, where arbitrary asynchrony is hard, if not impossible, to implement; and the generation of "difficult" input instances which is a particular challenge. In this work, we identify some of the methodological issues required to address the above characteristics in distributed algorithm engineering and illustrate certain approaches to tackle them via case studies. Our discussion begins by addressing the need of a simulation environment and how asynchrony is incorporated when experimenting with distributed algorithms. We then proceed by suggesting two methods for generating difficult input instances for distributed experiments, namely a game-theoretic one and another based on simulations of adversarial arguments or lower bound proofs. We give examples of the experimental analysis of a pursuit-evasion protocol and of a shared memory problem in order to demonstrate these ideas. We then address a particularly interesting case of conducting experiments with algorithms for mobile computing and tackle the important issue of motion of processes in this context. We discuss the two-tier principle as well as a concurrent random walks approach on an explicit representation of motions in ad-hoc mobile networks, which allow at least for averagecase analysis and measurements and may give worst-case inputs in some cases. Finally, we discuss a useful interplay between theory and practice that arise in modeling attack propagation in networks.
The Macintosh Digital Hub: An Interactive Guide to iTunes, iPhoto, iMovie, and iDVD
Authors: Jim Heid
Venue:  (2002)

:In the Macintosh world, Apple's free digital hub tools--iTunes, iPhoto, iMovie, iDVD, iPod, and iTools--are the driving force behind the convergence of digital media and digital devices. You can use these tools to entertain, educate, persuade, and inspire your audiences at home, school, and work. To help you master this elegant and fun desktop studio, there's no better place to turn than The Macintosh Digital Hub.The Macintosh Digital Hub is a unique book-DVD hybrid that provides an interactive tour of the digital hub. Written by noted digital media expertJim Heid, a contributing editor of Macworld since 1984 and a Macintosh columnist for the Los Angeles Times, it uses clear, to-the-point text, gorgeous illustrations, and interactive video to do justice to the digital hub's enormous capabilities. The book-DVD combo addresses the basic concepts behind the digital hub, like how to balance file size and image quality in digital photography and how to create effective DVD menus. It also tackles more advanced concepts, like how to record Internet radio for later playback, prepare video for Web distribution, and get digital photos printed onto mugs and mousepads.The accompanying DVD-Video disc contains two hours of entertaining instruction covering all of Apple's i-programs. You'll see how to produce professional-looking digital media, and you'll see hardware add-ons that will round out your digital studio. Beautiful to look at and enjoyable to watch, The Macintosh Digital Hub is your user manual for the digital lifestyle!
Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation
Authors: Tuomas Sandholm
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent really is motivated to follow the strategies that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes:1. OCSM-contracts in marginal cost based contracting, 2. leveled commitment contracts, 3. anytime coalition structure generation with worst case guarantees, 4. trading off computation cost against optimization quality within each coalition, 5. distributing search among insincere agents, and 6. unenforced contract execution. Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multiagent systems move into large scale open settings.
The Anatomy of a Robot, 1 edition
Authors: Chalres M. Bergren
Venue:  (2003)

:This work looks under the hood of all robotic projects, stimulating teachers, students, and hobbyists to learn more about the gamut of areas associated with control systems and robotics. It offers a unique presentation in providing both theory and philosophy in a technical yet entertaining way. 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
From the Many to the One - One Company's Path to Standardization
Authors: Thomas Cromer, John Horch
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

With approximately 75 people working in software development, COLSA Corporation, primarily systems integration, engineering, and development firm, decided to pursue IS0 9001 registration and Capability Maturity Model (CMM) Level 3 assessment. Management reviewed the difficulties and rewards of attaining registration and assessment and made the resource commitments to achieve them. The corporate intent was to establish a single, common process based on appropriate, available software engineering standards. We saw that in achieving this goal we would improve our practices and resulting software. But, it was not a simple matter of starting at one point and marching toward the destination. The end point was clear, but we had multiple starting points.Our developers did, and do, work on varied types of systems (e.g. real-time embedded, database applications and simulations) using differing practices and standards (government, industry, international, and in-house). We have stabilized our process and we are now at the real starting point on our quest for actual software quality improvement, increased developer and customer satisfaction and even better profits. This paper discusses the approach we chose, our experiences along the way and what we might suggest to others based on our newly gained hindsight.
A stress-based speciation model in lifedrop
Authors: Marc Métivier, Claude Lattaud, Jean-Claude Heudin
Venue: Proceedings of the eighth international conference on Artificial life (2002)

This paper presents a stress-based speciation model implemented within LifeDrop, a virtual world with bioinspired agents. In this model, individuals are distributed among species separated by a "barrier" mechanism preventing the reproduction between individuals of different species. An analysis of species dynamics in relation to stress is presented. Results show diversity maintenance and a reactive capacity during crisis situations favoring the emergence of new species.
Dual Threshold Voltage Circuits in the Presence of Resistive Interconnects
Authors: Per Larsson-Edefors, Daniel Eckerbert, Henrik Eriksson
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

We consider the power-optimal design of dual-VT CMOScircuits under challenging delay constraints, with thresholdvoltages and device sizes as design variables. We show thatthe presence of interconnect resistance affects the optimumchoices of VT and device sizes, and that ignoring the resistance can lead to highly suboptimal results. We also presentcriteria for deciding when interconnect resistance should betaken into account.