ppxscal/embedding_network huggingface dataset:
Multiple-Junction Surface Tunnel Transistors for Multiple-Valued Logic Circuits
Authors: Toshio Baba, Tetsuya Uemura
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Multiple-junction surface tunnel transistors (MJ-STTs), in which gate- controlled multiple p+/n+ tunnel-junctions are connected in series between the source and drain, are proposed for application as multiple-valued logic circuits. The transistor operation with four negative-differential- resistance characteristics is confirmed by fabricating a GaAs-based four- tunnel-junction MJ-STT. In addition, to demonstrate the increased functionality of these MJ-STTs, a tri-stable circuit is constructed with an MJ-STT and a load resistor connected in series. Three output voltages (states) are controlled by a reset pulse and successive input pulses applied to the gate of the MJ-STT, confirming the success of the tri- stable operation.
Temporally adaptive networks: analysis of GasNet robot control networks
Authors: Tom Smith, Phil Husbands, Andy Philippides, Michael O'Shea
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Identification of the fundamental properties necessary for the generation of adaptive behaviour is one of the primary goals for Artificial Life. In this paper, we address the related question of whether we can identify general useful properties of a given solution class. Such an approach provides a potentially scalable framework that may enable us to identify general properties of more complex adaptive systems. We develop a methodology based on analysis of successfully evolved solutions to an evolutionary robotics shape discrimination problem, allowing us to identify properties of solution classes that are potentially useful over a wider class of problems than the original task. We propose that the evolvability of the solution class is due to the fundamental property of temporal adaptivity.
QuarkXPress Design
Authors: Michael Baumgardt
Venue:  (2003)

:Few designers have explored the intersecting worlds of design and QuarkXPress as thoroughly as best-selling author Michael Baumgardt. Luckily for us, he reveals his expertise here to show designers how they can create more effective designs using QuarkXPress. The focus in this volume is on the work, and indeed you'll find plenty of examples of other designers' work in these pages: to illustrate important concepts, serve as starting points for readers' own projects, and inspire. The first section of QuarkXPress Design focuses on desktop publishing, tackling important topics such as working with text, preparing images, and choosing colors-all from a designer's perspective. The second section shows you how you can use QuarkXPress 5's powerful new Web capabilities to design great Web sites. Along the way you'll encounter interviews with top designers, numerous practical tips, and a chapter full of design tricks: Pick an effect (drop shadow, transparency, and more), and see how it was created. Essential reading for anyone who's interested in stretching their designs-and imagination-with QuarkXPress.
On the yellow brick road to component-based product lines
Authors: G. E. Kaiser, P. D. Skopp, J. J. Yang, G. T. Heineman
Venue: Proceedings of the 10th International Software Process Workshop (1996)

We present our experience using process-centered environments to build, maintain, reengineer and develop sets of related products. A process-centered environment is itself a collection of applications, such as clients and servers, that work together to provide a set of services. We discuss the OzMarvel and EmeraldCity environments that we designed to develop the Oz process-centered environment. Oz's support for process interoperability played a key role in constructing a component-based product line process.
Start!: The No Nonsense Guide to Windows XP, 1 edition
Authors: Wallace Wang
Venue:  (2003)

:This inexpensive primer is light on idle chat and heavy on practical advice. Lean and mean, it's packed with just what you need to know to get up and running with Windows XP. Designed to deliver regardless of your experience with computers or operating systems. 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
Usability engineering in Germany: situation, current practice and networking strategies
Authors: Matthias Peissner, Kzerstin Röse
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Reviews the current status of the usability profession in Germany, illustrated by examples. Possible initiatives and ongoing activites of the recently formed UPA German chapter in order to support usability will be discussed.
Higher weights and graded rings for binary self-dual codes
Authors: Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura
Venue: Discrete Applied Mathematics (2003)

The theory of higher weights is applied to binary self-dual codes. Bounds are given for the second minimum higher weight and a Gleason-type theorem is derived for the second higher weight enumerator. The second weight enumerator is shown to be unique for the putative [72, 36, 16] Type II code and the first three minimum weights are computed for optimal codes of length less than 32. We also determine the structures of the graded rings associated with the code polynomials of higher weights for small genera, one of which has the property that it is not Cohen-Macaulay.
KYDON, a self-organized autonomous net: learning model and failure recovery
Authors: J. S. Mertoguno, G. Bourbakis
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

In this paper, a learning model and a failure recovery approach of an autonomous vision system multi-layer architecture, called KYDON, are presented. The KYDON architecture consists of "k" layers array processors. The lowest layers compose the KYDON's low level processing group, and the rest compose the higher level processing groups. The interconnectivity of the processors in each array is based on a full hexagonal mesh structure. The lowest layer array processors captures images from the environment by employing a 2-D photoarray. The top most layer deals with the image interpretation and understanding. The intermediate layers perform learning and pattern recognition processes to bridge the image information flow from the bottom most layer to the top most one. KYDON uses graph models to represent and process the knowledge, extracted from the image. An important feature of KYDON is that it does not need any host computer or control processor to handle I/O and other miscellaneous tasks. A novel learning model has been developed for the KYDON's distributed knowledge base.
Real-Time Communication in Autonomous Robot Systems
Authors: Michael Mock, Edgar Nett
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Designing control and robotic systems as autonomous decentralized systems introduces a new degree of flexibility in the manufacturing and in the application of such systems. This flexibility is required for the systems to work in environments that are not totally predictable and that can change dynamically. In this paper, we present a new concept for real-time communication that supports this flexibility while still preserving real-time guarantees for hard real-time communication. The concept is designed to work on multiple-access busses. In particular, we consider its application on wireless local area networks and field-busses. The concept addresses requirements of hard-real time, soft real-time and non real-time communication. For this, we extend the TDMA (time-division multiple-access) approach for time-triggered hard-real time communication by the concept of shared channels that support event-triggered communication and coexist with hard real-time channels. A first implementation of concept has been carried out in the context of the CAN-bus.
The Use of Extended Boolean Logic in Information Retrieval
Authors: Gerard Salton
Venue:  (1984)

An extended Boolean retrieval strategy has previously been introduced in which the individual Boolean operators can be treated more or less strictly, depending on the perceived strength of association of the query terms. The extended Boolean system is illustrated by examples and evaluation output is used to demonstrate the effectiveness of the operations.
The Systems-Toolkit: An Overview
Authors: Doug Elias
Venue:  (1987)

The Systems-Toolkit (Elias, 1986) is an integrated collection of Sytems-problem solving procedures, which currently implements a major portion of the "General Systems Problem Solver" (GSPS) developed by Klir et al (Cavallo and Klir, 1978; Klir, 1979; Klir, 1985). It represents both a conceptual statement and a software base for the realization of that statement. The concept is based on the assumption that research interests would benefit from the development of a single investigative framework capable of incorporating many different forms of Systems methodologies and analysis strategies. The software base is designed to aid in both the development of new methodologies and in the investigation of relationships among them. 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
Legacy to the extreme
Authors: Arie Deursen, Tobias Kuipers, Leon M.F. Moonen
Venue:  (2000)

We explore the differences between developing a system using extreme programming techniques, and maintaining a legacy system. We investigate whether applying extreme programming techniques to legacy maintenance is useful and feasible.
Lower bounds for the complexity of the Hausdorff distance
Authors: William J. Rucklidge
Venue:  (1994)

The Hausdorff distance is a similarity measure defined between sets in the plane. Algorithms to find the minimum distance as one set is transformed have been described, but few lower bounds are known. We describe new lower bounds for the complexity of the directed Hausddorff distance. We exhibit lower boundconstructions for both sets of points and sets of points and line segments, under translation, rigid motion, translation and scaling, and affine transformation. The results for point sets can also be extended to the undirected Hausdorff distance. As these lower bounds are for the complexity of the graph of the Hausdorff distance as a function of transformation, they do not necessarily bound functions which search this graph, but do give an indication of how complex the search may be. 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
The Digital Doctor: An Experiment in Wearable Telemedicine
Authors: A. P. Pentland, M. Petrazzuoli, A. Gerega, T. Starner
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Consultation with various specialists and review of medical literature are key elements in superior, modern medical care. Because this information can be expensive and inconvenient to access, physicians and patients must typically compromise ideal care practices with practical realities. A wearable computer with the ability to transmit and receive text and image data without a direct connection during an examination can remove the need for such compromise, potentially allowing both better care and lower cost. In this paper we report on experiments conducted at the University of Rochester's Strong Hospital in which a wearable computer is used to create patient records and provide remote consultations during dermatological examinations.
Reuse-Driven Interprocedural Slicing in the Presence of Pointers and Recursions
Authors: Donglin Liang, Mary Jean Harrold
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to support maintenance activities. To be useful for supporting these activities, a slicing technique must be sufficiently precise and efficient. Harrold and Ci propose a method for improving the efficiency of slicing by reusing slicing information for subsequent slicing. This paper presents an interprocedural slicing algorithm that improves the efficiency and precision of Harrold and Ci's algorithm for programs with pointer variables and recursion. Our empirical results show that our improvements can effectively achieve more reuse in slice computation, for programs with pointers, and can significantly reduce the sizes of slices, for programs with recursion.
Generalized variational inequalities with fuzzy relation
Authors: Cheng-Feng Hu
Venue: Journal of Computational and Applied Mathematics (2002)

This paper studies generalized variational inequalities with fuzzy relation. It is shown that such problem can be reduced to a regular optimization problem with variational inequality constraints. A penalty function algorithm is introduced with a convergence proof, and a numerical example is included to illustrate the solution procedure.
Two Positions on Licensing
Authors: David Lorge Pamas
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

This paper is a parody of http://www.acm.org/serving/se_policy 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
EFFICIENT SOLVER FOR MIXED AND CONTROL-VOLUME MIXED FINITE ELEMENT METHODSIN THREE DIMENSIONS
Authors: John D. Wilson, Thomas F. Russell
Venue:  (2000)

In simulations of groundwater flow in heterogeneous aquifers, accuracy of velocities can be substantially enhanced by discretizations based on mixed or control-volume mixed finite element methods. A potential side benefit is improved accuracy of transport calculations that depend on the flow field. A practical difficulty, especially acute in 3-D, is that these methods lead to discrete linear systems that are not positive definite and cannot be solved by straightforward applications of well-known iterative solvers. We present a specialized iterative solver for mixed methods in 3-D, built around a decomposition of the discrete velocity space that leads to a symmetric positive definite system (the pressure variable is eliminated). The decomposition relies on a local basis for the the divergence-free subspace of the velocity space. The positive definite system is then solved using a preconditioned conjugate gradient method. The unpreconditioned system is ill-conditioned with respect to the dimension of the discrete velocity space, but a preconditioner based on additive or multiplicative domain decomposition makes the condition number independent of this dimension. Numerical results verify uniform convergence of the additive preconditioned conjugate gradient method. We also study numerically the effects of heterogeneity and anisotropy of the conductivity coefficients on the convergence rate. For distorted hexahedral elements, which are trilinear images of cubes that can represent irregular subsurface geology, we consider a control-volume mixed discretization. A similar decomposition of the velocity space is used, hoping to obtain a positive definite system, although the system is not, in general, symmetric. We also present numerical results for the convergence of the preconditioned conjugate gradient method applied to this system.
Reuse Economics: A Comparison of Seventeen Models and Directions for Future Research
Authors: Wayne C. Lim
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

This paper baselines the state-of-the-art in reuse economic modeling by surveying and comparing seventeen economic models and presenting conclusions and recommendations for further research. The analyses indicate a great deal of commonality among the set of models. While this may indicate that researchers are arriving at similar models independently, it may also suggest that we should direct our efforts at forging new ground in reuse economics. Five areas for further research in reuse economics are recommended, and general guidelines for helping organizations decide on a suitable economic model are discussed.
Analysis of Pointers and Structures
Authors: David R. Chase, Mark Wegman, F. K Zadeck
Venue:  (1990)

Compilers can make good use of knowledge about the shape of data structures and the values that pointers assume during execution. We present results which show how a compiler can automatically determine some of this information. We believe that practical analyses based on this work can be used in compilers for languages that provide linked data structures. The analysis we present obtains useful information about linked data structures. We summarize unbounded data structures by taking advantage of structure present in the original program. The worst-case time bounds for a naive algorithm are high-degree polynomial, but for the expected (sparse) case we have an efficient algorithm. Previous work has addressed time bounds rarely, and efficient algorithms not at all. The quality of information obtained by this analysis appears to be (generally) an improvement on what is obtained by existing techniques. A simple extension obtains aliasing information for entire data structures that previously was obtained only through declarations. Previous work has shown that this information, however obtained, allows worthwhile optimization.
A framework for analogy based estimation in building services
Authors: K. Rintala, B. Kumar, I. MacLeod
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper addresses the problems faced by the construction industry in developing an effective methodology for estimating the whole life-cycle costing of buildings in general and building services, in particular. The introduction of Private Finance Initiative (PFI) has triggered for such a need. Under the PFI, projects are bid for the entire life cycle rather than simply the initial construction capital costs. This has prompted the need to estimate the maintenance costs with as much precision as possible. As data on maintenance costs is not readily available, it is extremely difficult to estimate the whole life-cycle costs of any facility. This paper describes the development of a framework for estimating of whole life cycle costing of building services. The framework utilizes techniques from Artificial intelligence (AI). The framework is called Analogy-based Estimation (ABE). It uses estimates from similar past projects to estimate the costs for anew project.
PhotoShop 7: The Complete Reference, 1 edition
Authors: Laurie Ann Ulrich
Venue:  (2002)

:Not only will you get amazingly thorough coverage of Photoshop  from its use as a tool for photograph retouching to a powerful application for creating artwork for print and electronic media  but you will also find realistic examples, beautiful artwork, and ideas to inspire everyone from amateur photographers to Web designers.
Porting the Distributed Array Query and Visualization Tool for High Performance Fortran to the SP2
Authors: David Presberg, Christopher Jaeger
Venue:  (1996)

Distributed Array Query and Visualization (DAQV) is a Parallel Tools Consortium sponsored project to create a tool for visualizing distributed data in High Performance Fortran (HPF). The DAQV tool is currently maintained at the University of Oregon, and our goals here at the Cornell Theory Center (CTC) are to verify the work done by the people there, and port the DAQV tool and its associated visualization clients to our IBM SP2 and IBM''s HPF compiler, XL HPF. We describe in this paper the installation of the DAQV tool first on an SGI Onyx, using Portland Group Inc.''s HPF compiler, pghpf, which was already supported by DAQV. We make various modifications to the distribution to generalize the installation, and then port the DAQV tool to the IBM SP2, also using the pghpf compiler. Finally, we accomplish the port of DAQV to IBM''s XL HPF compiler. We describe our approaches to overcoming various obstacles encountered in the porting process. These include re-analyzing the DAQV design to accommodate distinctions between the pghpf and XL HPF compiler run time implementations. The end result is not a single portable reference implementation of the DAQV tool, as was originally planned, but rather two different portable implmentations that demonstrate different ways in which a vendor may choose to perform the gathering of distributed data from HPF programs in a DAQV-like tool. Keywords: multiprocessors, parallel programming tools, data access, DAQV, data distribution, data parallel, Fortran, HPF, SP2, SPMD
Broadcasts: A Paradigm for Distributed Programs
Authors: Fred B. Schneider
Venue:  (1980)

NO SUPPLIED
Numerical solution for bounding feasible point sets
Authors: Peiliang Xu
Venue: Journal of Computational and Applied Mathematics (2003)

Finding feasible points is important in optimization. There are currently two major classes of algorithms to deal with the problem of feasible points. The first class of algorithms (of local nature) is to find an approximate feasible point. Given a neighbourhood of an approximate feasible point, the second class of algorithms is to prove whether a feasible point exists inside this neighbourhood. To the best of our knowledge, no methods have been practically implemented to efficiently find the smallest boxes for bounding the feasible points defined by a system of nonlinear and nonconvex inequalities, unless the feasible set is convex. In this paper, we will present a numerical method to find the smallest boxes for bounding the feasible point sets defined by a nonlinear and nonconvex inequality and/or a system of nonlinear and nonconvex inequalities. Two examples have been synthetically constructed and used to show that the proposed numerical method can indeed correctly find all the smallest bounding boxes at any given accuracy efficiently. A brief comparison with relevant techniques will be discussed. Our method may also be thought of as the first solid theoretical basis for multisection and multisplitting in global optimization, when compared with those empirical ones in the literature.
PODEM Based on Static Testability Measures and Dynamic Testability Measures for Multiple-Valued Logic Circuits
Authors: Naotake Kamiura, Teijiro Isokawa, Nobuyuki Matsui
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

In this paper, PODEM for multiple-valued logic circuits isproposed.It consists of the D-propagation, implication and backtracingoperation.To guide the D-propagation (or backtracing operation),observability (or controllability) measures are introduced.They arecomputed by simple recursive formulas, and enable us to reduce thefrequency of backtracking.In addition, the scheme of exploiting StaticTestability Measures up to a certain stage of test generation and thenresorting to Dynamic Testability Measures is incorporated into PODEM.Theexperimental results on ternary benchmark circuits show that the abovescheme is useful in generating as many test patterns as possible whilstshortening the total time required for the test generation.