ppxscal/embedding_network huggingface dataset:
Robot Mechanisms and Mechanical Devices Illustrated, 1 edition
Authors: Paul E. Sandin
Venue:  (2003)

:Both hobbyists and professionals will treasure this unique and distinctive sourcebook-the most thorough-and thoroughly explained-compendium of robot mechanisms and devices ever assembled. Written and illustrated specifically for people fascinated with mobile robots, Robot Mechanisms and Mechanical Devices Illustrated offers a one-stop source for everything needed for the mechanical design of state-of-the-art mobile 'bots.New Mechanisms, New Systems, New Devices Written by a leading robot designer-designer of robots used at the horizon of mobile robotics-this resource offers a collection of both new and classic robotic mechanisms and devices unmatched in scope, from such high-level sources as the mechanical engineers' mainstay, Mechanisms and Mechanical Devices Illustrated. Paul Sandin's superlative reference also brings you new robotic mechanisms and devices that have never before been collected! Inside you'll find: The most extensive array of mechanisms and devices for mobile robots ever compiled Innovations in high-mobility suspension systems and drivetrains A wide range of steering systems and techniques Insights and diagrams on manipulator and gripper mechanisms and geometries Details on robust mechanical sensor systems Robot motor control electronics explained with the non-EE in mind Inspiration to take you to the next level in mobile robots-and beyond Dream It and Build It-With THE Resource on High-Mobility Robots 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
Causal Analysis of the Requirements Change Process for a Large System
Authors: Khaled El Emam, Dirk Höltje, Nazim H. Madhavji
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Implementations of requirements change processes in large system projects face many difficulties. In this paper we present a method for analysing requirements change processes to identify implementation weaknesses and their causes. This method relies on prescriptive process models and tracing actual change proposals through the process model. We apply the method in the analysis of the requirements change process for a large real-time system within a Canadian government agency. This allowed us to identify the process implementation problems, and the process, organizational, and people causes of these problems. Based on that experience, we draw general conclusions about the proposed method and its applicability.
On the Accuracy of Return Path Assumption for Loop Inductance Extraction for 0.1µm Technology and Beyond
Authors: SoYoung Kim, Yehia Massoud, S. Simon Wong
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The most common assumption for chip-level inductanceextraction is to restrict the current return path to the closestpower or ground lines. This paper shows that this assumptionis not necessarily valid for technologies beyond 0.1µm.The actual inductance can exceed twice the value that is extractedfrom the model considering only the nearest currentreturn paths. Analytical formulae to predict the worst caseself inductance are proposed to deal with the errors that resultfrom this assumption. These equations can be used asmetrics to decide the size of inductance extraction windowfor future CAD tools.
Fixing Antenna Problem by Dynamic Diode Dropping and Jumper Insertion
Authors: Peter H. Chen, Sunil Malkani, Chun-Mou Peng, James Lin
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This paper describes three ways to fix antenna problems: (1) diode dropping, (2) jumper insertion, and (3)diode dropping with extension wires.Basic principles of these methods are compared and results are presented. Diode structures, SPIC simulation, and diode slicing are also discussed in this paper.
On Cost Function Synthesis for Multi-Objective Design Decisions in Complex Real-Time Systems
Authors: Carlos C. Amaro, Roman Nossal, Alexander D. Stoyen
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

Engineering of modern complex real-time systems is driven by a host of design objectives, often differing not only in nature, importance, and form, but also in dimensional units and range, and themselves interacting in complex ways. These objectives influence design decisions throughout the entire system life cycle. We consider the problem of formulating the cost of a design decision driven by multiple objectives. We start by discussing issues and relationships among non-functional objectives, their decomposition, and attribute cost functions used to quantify them. We then describe a hierarchical model, along with an equational form, for system cost function synthesis. Finally, examples are given to show how the model applies to actual multi-objective problems in the design of complex real-time systems.
Pronouns
Authors: Kelly Roach
Venue:  (1988)

No abstract available. This technical report was submitted in 1980 in partial fulfillment of the requirements for the degree of Master of Science.
Pespectives in icon design: standards, metrics, cognition and aesthetics
Authors: Siné McDougall, Oscar de Bruijn
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Covers: icon design approache; standards and metrics; cognition, context and workload in design; role of icons in the visual enhancement and commercial placement of products. Explores how contributions from each perspective can optimise icon design.
Metatheory of the $\pi$-Calculus
Authors: Sam Weber, Bard Bloom
Venue:  (1996)

Milner''s {$\pi$}-calculus is a very influential process algebra in which communication channels are first-class objects. One of the basic concepts in the language is the transmission of one channel along another. This leads to immensely powerful programming techniques, which have been used for modelling things from cellular telephones to object-oriented languages. However, the {$\pi$}-calculus lacks many operations, such as broadcasting a value to many processes, interrupting processes, checkpointing, and even such basics as sequencing and \t{while}-loops in full generality. Adding all useful operations to the {$\pi$}-calculus would make it unusably large and complex. We thus propose a \e{rule format}, called \metapi. The {$\pi$}-calculus, and a vast range of other calculi treating channels as first-class data, can be expressed with {\metapi} rules. Any operations defined by {\metapi} rules have the same essential theory as the {$\pi$}-calculus. For example, all such operations respect the appropriate notion of strong bisimulation. Furthermore, the {$\pi$}-calculus, and all the operations in the previous paragraph, have {\metapi} equivalents. {\metapi} describes the heart of the {$\pi$}-calculus without prejudice towards the particular communication mechanisms of the calculus, and thus gives a general framework for working with {$\pi$}-like calculi. Further, it can be argued that the {\metapi} rule format is the most general of its kind, in the sense that any obvious extensions to the format would cause important language properties to be violated.
A Test Time Reduction Algorithm for Test Architecture Design for Core-Based System Chips
Authors: Sandeep Kumar Goel, Erik Jan Marinissen
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper deals with the design of SOC test architectures which are efficient with respect to required ATE vector memory depth and test application time. We advocate the usage of a TestRail Architecture, as this architecture, unlike others, allows not only for efficient core-internal testing, but also for efficient testing of the circuitry external to the cores. We present a novel heuristic algorithm that effectively optimizes the TestRail Architecture for a given SOC by efficiently determining the number of TestRails and their widths, the assignment of cores to the TestRails, and the wrapper design per core. Experimental results for four benchmark SOCs show that, compared to previously published algorithms, we obtain comparable or better test times at negligible compute time.
Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion
Authors: J. Garloff, C. Jansson, A. P. Smith
Venue: Computing (2003)

In this paper the expansion of a polynomial into Bernstein polynomials over an interval I is considered. The convex hull of the control points associated with the coefficients of this expansion encloses the graph of the polynomial over I. By a simple proof it is shown that this convex hull is inclusion isotonic, i.e. if one shrinks I then the convex hull of the control points on the smaller interval is contained in the convex hull of the control points on I. From this property it follows that the so-called Bernstein form is inclusion isotone, which was shown by a longish proof in 1995 in this journal by Hong and Stahl. Inclusion isotonicity also holds for multivariate polynomials on boxes. Examples are presented which document that two simpler enclosures based on only a few control points are in general not inclusion isotonic.
Self-Organizing Maps of Massive Document Collections
Authors: Teuvo Kohonen
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Huge document collections can be organized according to textual similarities by the Self-Organizing Map (SOM) algorithm, when statistical representations of the textual contents are used as the feature vectors of the documents. In a practical experiment, we mapped 6,840,568 patent abstracts onto a 1,002,240-node SOM. For the feature vectors, we selected 500-dimensional random projections of the weighted word histograms.
Introducing Microsoft Windows Server 2003
Authors: Jerry Honeycutt
Venue:  (2003)

:Your detailed, official first look at the features and improvements in Windows Server 2003. Microsoft&reg; Windows&reg; Server 2003 provides significant improvements in performance, productivity, and security over previous versions. This official first-look guide shows you exactly whats new and improved in this powerful network operating systemincluding advanced technologies for Web services and components, security, networking, Active Directory&reg; directory service, Microsoft Internet Information Services, support for IPv6, and more. It gives you all the information and tools you need to understand, evaluate, and begin deployment planning for Windows Server 2003, whether youre upgrading from Microsoft Windows NT&reg; Server or Windows 2000 Server.Topics covered include: Introducing the Microsoft Windows Server 2003 family, including features, benefits, and requirements How to get started:Deploying Windows Server 2003Upgrading from Windows NT 4.0 ServerUpgrading from Windows 2000 ServerTesting for application compatibility Details about new and improved features:Microsoft Active Directory serviceManagement services and the Group Policy Management ConsoleSecurity-enhancing servicesNetworking and communicationsTerminal servicesMicrosoft Internet Information ServicesApplication and XML Web servicesWindows Media&reg; servicesFile services and storage managementPrint servicesClustering servicesMultilingual support
A Framework for Local Anonymity in the Internet
Authors: David M. Martin
Venue:  (1997)

Abstract We describe and evaluate options for providing anonymous IP service, argue for the further investigation of local anonymity, and sketch a framework for the implementation of locally anonymous networks.
Assembler to C Migration Using the FermaT Transformation System
Authors: Martin Ward
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The FermaT transformation system, based on research carried out over the last twelve years at Durham University and Software Migrations Ltd., is an industrial_strength formal transformation engine with many applications in program comprehension and language migration. This paper describes one application of the system: the migration of IBM 370 Assembler code to equivalent, maintainable C code. We present an example of using the tool to migrate a small, but complex, assembler module to C with no manual intervention required. We briefly discuss a mass migration exercise where 1,925 assembler modules were sucessfully migrated to C code.
A market-driven architecture for software engineering standards
Authors: L. L. Tripp, P. Voldner
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The development and maintenance of quality software involves the effective use of software engineering standards. The development of national and international software engineering standards began in the early 1970s. Since that time more than 300 standards have been developed. From a user's perspective, there is duplication, inconsistencies, overlap and omissions. In the 1980s the two major international standards organizations formed a joint technical committee on information technology to deal with a range of standards including those for software. A market-driven architecture for software engineering standards has been developed to: guide the development and organization of international software engineering standards; position those standards in relation to standards for quality systems (ISO 9000 series) and system-related standards dependability (IEC TC56), safety-critical (IEC SC65A), and security (ISO/IEC JTC1/SC27); and promote the adoption of software engineering standards in the marketplace.
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING
Authors: Philip N. Klein, Hsueh Lu
Venue:  (1996)

The best known approximation algorithm for graph MAX CUT, due to Goemans and Williamson, first finds the optimal solution a semidefinite program and then derives a graph cut from that solution. Building on this result, Karger, Motwani, and Sudan gave an approximation algorithm for graph coloring that also involves solving a semidefinite program. Solving these semidefinite programs using known methods (ellipsoid, interior-point), though polynomial-time, is quite expensive. We show how they can be approximately solved in $\tilde O(nm)$ time for graphs with $n$ nodes and $m$ edges.
Designing Conversation Policies using Joint Intention Theory
Authors: I. Smith, P. Cohen, J. Bradshaw, M. Greaves, H. Holmback
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

In this paper we apply the semantics sketched by Smith and Cohen {SmithCohen96} to the system of conversational policies developedfor KAoS {Bradshaw97}. We show that the compositional nature of the speech-acts and their semantics allows us to provide a comprehensive semantics for the conversational policies; and that we can use the generated semantics to analyze policies, to alter policies, and to show how the policies can be combined to form complete dialogues and protocol control strategies. We also show that the semantics provides us with a valuable tool to analyze and to suggest corrections for the conversational policies.
An application of wavelet-based vector quantization in target recognition
Authors: L. A. Chan, N. M. Nasrabadi
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

An automatic target recognition (ATR) classifier is constructed that uses a set of dedicated vector quantizers (VQs). The background pixels in each input image are properly clipped out by a set of aspect windows. The extracted target area for each aspect window is then enlarged to a fixed size, after which a wavelet decomposition splits the enlarged extraction into several subbands. A dedicated VQ codebook is generated for each subband of a particular target class at a specific range of aspects. Thus, each codebook consists of a set of feature templates that are iteratively adapted to represent a particular subband of a given target class at a specific range of aspects. These templates are then further trained by a modified learning vector quantization algorithm that enhances their discriminatory characteristics.
A Methodology for Detection and Estimation of Software Aging
Authors: S. Garg, A. Van Moorsel, K. Vaidyanathan, K. S. Trivedi
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

The phenomenon of software aging refers to the accumulation of errors during the execution of the software which eventually results in it's crash/hang failure. A gradual performance degradation may also accompany software aging. Pro-active fault management techniques such as ``Software rejuvenation'' [1] may be used to counteract aging if it exists. In this paper, we propose a methodology for detection and estimation of aging in the UNIX operating system. First, we present the design and implementation of an SNMP based, distributed monitoring tool used to collect operating system resource usage and system activity data from networked UNIX workstations at regular intervals. Statistical trend detection techniques are applied to this data to detect/validate the existence of aging. For quantifying the effect of aging in operating system resources, we propose the metric ``Estimated time to exhaustion'' which is calculated using well known slope estimation techniques. Although the distributed data collection tool is specific to UNIX, the statistical techniques can be used for detection and estimation of aging in other software as well.
An Engine for Cursive Handwriting Interpretation
Authors: Gaofeng Qian
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper describes an interpretation system for on-line cursive handwriting that requires very little initial training and that rapidly learns, and thus adapts to, the handwriting style of a user. Key features are a shape analysis algorithm that efficiently determines shapes in the handwritten word, a linear segmentation algorithm that optimally matches characters identified in the handwritten word to characters of candidate words, and a learning algorithm that adds, adjusts, or replaces character templates to adapt to the user writing style. In tests, the system was trained on four samples of each character of the alphabet. These samples were written in isolation by one writer. Using a lexicon with 10,000 words, the system achieved for four additional writers an average recognition rate of 81.3% for top choice and 91.7% for the top three choices. The average response time of the system was 1.2 seconds per handwritten word on a SUN SPARC 10 (42 mips).
Combination of Local and Global Vision Modelling for Arabic Handwritten Words Recognition
Authors: S. Snoussi Maddouri, H. Amiri, A. Belaïd, Ch. Choisy
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We propose in this paper a recognition system of Arabic hand-written words issued from literal amounts of Arabic checks. This system is based on the idea of the PERCEPTRO system developed by M. Côté for Latin word recognition. It is a specific NN, named TransparentNeural Network (TNN), combining a global and a local vision modeling (GVM - LVM) of the word. In the forward propagation movement, the former (GVM) proposes a list of structural features characterizing the presence of some letters in the word. GVM proposes a list of possible letters and words containing these characteristics. Then, in the back-propagation movement, these letters are confirmed or not according to their proximity with corresponding printed letters. The correspondence between the letter shapes and the corresponding printed letters is performed by LVM using the correspondence of their Fourier descriptors (FD), playing the role of a letter shape normalizer.
Focus on Photon Mapping
Authors: John Marlon, Marlon John
Venue:  (2003)

:From the basics of the nature of light to ray tracing and photon rendering, you'll learn how to bring a new dimension of reality to the graphics in your games. By beginning with the standard foundations of ray tracing and radiosity, you'll quickly learn how photon mapping has been able to combine the positive aspects of each while eliminating their inherent drawbacks. As your skills advance through the book, you'll learn how to effectively apply natural lighting effects. Focus On Photon Mapping deals with a number of complex 3D graphics concepts and shows you how to develop photon mapping from the ground up. In order to attain maximum benefit from the concepts that are discussed, it is recommended that you have some experience in 2D and 3D graphics.
A fuzzy web intelligence application: web-based fuzzy expert agents for online learning evaluation
Authors: Ramdane Issolah, Yan-Qing Zhang
Venue: Neural, Parallel Scientific Computations (2003)

Fuzzy Expert Agents (FEAs) are used in different applications based on soft reasoning (not classical hard decision) methods similar to human approximate reasoning. Fuzzy Web Intelligence (FWI) techniques are introduced based on fuzzy theory and Web technology. The Web-based FEA using FWI techniques can assist in determination of whether a child has a learning problem. Javaservlets, JDBC, and Oracle are used to implement the Web-based FEA successfully.
Java Database Programming Bible, 1 edition
Authors: John O'Donahue, John O' Donahue
Venue:  (2002)

:Java delivers powerful tools for creating today's multi-tier database applications. Packed with lucid explanations and lots of real-world examples, this comprehensive guide gives you everything you need to master Java database programming techniques. Starting with an insightful look into RDBMS, SQL, and JDBC fundamentals, veteran developer John O'Donahue walks you through the development process for both two-tier and three-tier applications, providing detailed coverage of Java database applications, using Swing components, servlets, JSP, XML, and EJB persistence.
System Level Modeling of Microsystems Using Order Reduction Methods
Authors: Sven Reitz, Jens Bastian, Joachim Haase, Peter Schneider, Peter Schwarz
Venue: Analog Integrated Circuits and Signal Processing (2003)

In the development of microsystems, Finite Element Method (FEM) simulators are used to investigate the behavior of system components with high accuracy. Generally, FEM simulations are time consuming. System-level models of all components are needed to allow a fast but sufficiently exact investigation of the system behavior to simulate entire microsystems. Typically, microsystems consist of nonelectrical components and electronic circuits. Providing models for electronic components and languages to describe the behavior of nonelectrical subsystems, simulators like Eldo, Saber, and VHDL-AMS simulators become more and more popular in the development of microsystems. For simple structures such as mechanical beams, models of microsystem components can be derived from analytical descriptions. Another possibility to consider more complex structures is to use FEM descriptions to generate models for system simulation. Some FEM simulators like ANSYS allow one to access the numerical values of the system matrices. They are established based on the description of geometry and material data. Usually, these system matrices are very large (10000 up to 100000 system variables or more). For system simulation, models with about 10 up to 100 variables are often required. Therefore, methods for order reduction are applied to derive smaller system matrices. An improvement of an order reduction method based on a projection method is introduced in the paper. Using the reduced systems, behavioral models in languages like MAST, HDL-A or VHDL-AMS can be generated automatically. The method described here was applied successfully to simulate mechanical microsystem components on system level.