ppxscal/embedding_network huggingface dataset:
Fuzzy Model Identification for Control
Authors: Janos Abonyi
Venue:  (2002)

:"This book presents new approaches to the construction of fuzzy models for model-based control. New model structures and identification algorithms are described for the effective use of heterogeneous information in the form of numerical data, qualitative knowledge, and first principle models. The main methods and techniques are illustrated through several simulated examples and real-world applications from chemical and process engineering practice." "Supporting MATLAB and Simulink files, available at the website www.fmt.vein.hu/softcomp, create a computational platform for exploration and illustration of many concepts and algorithms presented in the book." The book is aimed primarily at researchers, practitioners, and professionals in process control and identification, but it is also accessible to graduate students in electrical, chemical, and process engineering. Technical prerequisites include an undergraduate-level knowledge of control theory and linear algebra. Additional familiarity with fuzzy systems is helpful but not required.
The Mathematica Book, 5 edition
Authors: Stephen Wolfram
Venue:  (2003)

:Mathematica has defined the state of the art in technical computing for over a decade, and has become a standard in many of the world's leading companies and universities. From simple calculator operations to large-scale programming and the preparation of interactive documents, Mathematica is the tool of choice.
A Sparse Matrix Algorithm on the Boolean Vector Machine
Authors: A R Wagner, L M Patrick
Venue:  (1984)

The Boolean Vector Machine (BVM) is a large network of extremely small processors with very small memories operating in SIMD mode using bit-serial arithmetic. Individual processors communicate via a hardware implementation of the Cube Connected Cycles (CCC) network. A prototype BVM with 2048 processing elements, each with 200 binary bits of memory, is currently being built using VLSI technology. The BVM''s bit-serial arithmetic and the small memories of individual processors are apparently a drawback to its effectiveness when applied to large numerical problems. In this paper we relate our experiences in implementing a basic matrix-vector iteration algorithm for sparse matrices on the BVM. We show that a $2^{20}$ PE BVM can deliver over 1 billion $(10^9)$ useful floating point operations per second for this problem. The algorithm is expressed in a new language (BVL) which has been defined for programming the BVM.
Java 2 Network Protocols Black Book
Authors: Al Williams
Venue:  (2002)

:Java 2 Network Protocols Black Book shows programmers how to leverage open source software, as well as source code unique to the book, to make it easy to handle HTTP, SMTP, FTP, NNTP, Telnet, and other Internet protocols. Each chapter contains background on a different protocol or family of protocols. Plus, it shows you a selection of available tools to handle that protocol. The Immediate Solutions at the end of each chapter show you specific examples that you can use to jump-start your own development. Hundreds of code examples are provided along with insider tips and techniques for developing and using protocols. This is truly a one-of-a-kind book.
Finitely Presented Algebras and the Polynomial Time Hiercharchy
Authors: Dexter Kozen
Venue:  (1977)

Let $S_{n}(V_{n})=\{ | \Gamma$ is a finite presentation of $\cal A, Q_{1} \cdots Q_{k}$ is a string of quantifiers with $n$ alterations, the outermost an $\exists (\forall), \cal A \Gamma Q_{1} v_{1} \cdots Q_{k} v_{k} s \equiv t\}$. It is shown that $S_{n} (V_{n})$ is complete for $\Sigma^{P}_{n} (\Pi^{P}_{n})$, and $\stackrel{\stackrel{\infty}{\bigcup}}{n=0} S_{n} \cup V_{n}$ is complete for PSPACE, answering a question of [1] and generalizing a result of Stockmeyer and Meyer [2].
Toward more advanced usage of instruction level parallelism by a very large data path processor architecture
Authors: H. Tanaka
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The architectural performance gain of a microprocessor is going to saturate because of the small gain of instruction level parallelism. In this paper, we discuss the design points and some tentative solutions to overcome this bottleneck and propose a processor architecture called Very Large Data Path. This architecture broadens the window of instruction analysis to extract 10 times of parallel gain compared with the conventional superscaler processors. This paper discusses the system elements and shows some preliminary evaluation results.
A Verified Integration of Imperative Parallel Programming Paradigms in an Object-Oriented Language
Authors: Paul Sivilotti
Venue:  (1993)

CC++ is a parallel object-oriented programming language that uses parallel composition, atomic functions, and single- assignment variables to express concurrency. We show that this programming paradigm is equivalent to several traditional imperative communication and synchronization models, namely: semaphores, monitors, and asynchronous channels. A collection of libraries which integrates these traditional models with CC++ is specified, implemented, and formally verified.
Real-Time Mutable Broadcast Disks
Authors: Sanjoy Baruah, Azer Bestavros
Venue:  (1997)

Abstract There is an increased interest in using broadcast disks to support mobile access to real-time databases. However, previous work has only considered the design of real-time immutable broadcast disks, the contents of which do not change over time. This paper considers the design of programs for real-time mutable broadcast disks --- broadcast disks whose contents are occasionally updated. Recent scheduling-theoretic results relating to pinwheel scheduling and pfair scheduling are used to design algorithms for the efficient generation of real-time mutable broadcast disk programs.
Multiple Kinds of Paper Currency Recognition Using Neural Network and Application for Euro Currency
Authors: Fumiaki Takeda, Toshihiro Nishikage
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Up until now, we have developed banking machines for various kinds of paper currency using neural networks (NNs). In this paper, we report an enhanced neuro-recognition system to increase the more number of recognition patterns using axis-symmetrical mask and two image sensors. One sensor's purpose is discrimination for a known image and another one is exclusion for an unknown image. Concretely, we implement the proposed method to an experimental system, which has two sensors. In addition, they are arranged on the up side and down side of the aisle, respectively. Finally, we apply this proposed method to Euro currency, which will be delivered in 2002 year, using its dummy. The effectiveness of the proposed method is shown, numerically.
Overview of the X Window System
Authors: Cherri M. Pancake
Venue:  (1990)

The X Window System was developed at MIT to provide portable support for graphical interfaces. Released publicly only four years ago, X has enjoyed a meteoric rise in popularity. Today, the X user can access programs running on remote machines and display graphical output as though all work were being carried out on a local computer. Because the system is hardware-independent, the user can have access to a personalized computing environment even when he or she moves from one machine to another. This article explores the structure of the X Window System, focusing on the unique capabilities which have made it the graphical lingua franca for software developers and users. 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
Wearable Computers for the Fire Service and Police Force: Technological and Human Factors
Authors: David J. Haniff, Chris Baber
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Wearable computer applications can be defined broadly as situationally-aware and situationally-unaware. A situationally-aware fire-fighter application which is under development is described and a situationally-unaware police force application is presented. However, underlying these developments is the issue of the appropriateness of the user interface for these applications.
Smart Card Manufacturing: A Practical Guide
Authors: Yahya Haghiri, Thomas Tarantino
Venue:  (2002)

:The smart card industry is booming as demand for data protection increases. From secure e-commerce and mobile communications to electronic tracking and ticketing systems, smart card technology facilitates a broad array of applications. This practical guide bridges the gap between smart card applications and software, providing an accessible introduction to a versatile technology.Featuring:Step-by-step descriptions of the production processes for chip modules, traditional, contactless and dual-interface smart cards.Guidance on the choice of materials for use in each smart card component.Coverage of all the major reliability testing methods and test criteria for chip modules and smart cards.The architecture and functionality of the full range of available smart cards along with outlines of the related standards.An examination of future smart card applications and an overview of chips currently on the market.Contact details and relevant web sites for all the major smart card manufacturers and materials suppliers.With coverage ranging from the production of card bodies and chip modules to state-of-the-art personalization technologies, this timely publication will appeal to personnel at every level of the smart card industry.
A correlation inequality for connection events in percolation
Authors: J. Berg, J. Kahn
Venue:  (1999)

It is well-known in percolation theory (and intuitively plausible) that two events of the form ``there is an open path from $s$ to $a$" are positively correlated. We prove the (not intuitively obvious) fact that this is still true if we condition on an event of the form ``there is no open path from $s$ to $t$".
Modeling and analysis of channel transferability in mobile computing environments
Authors: R. Prakash, M. Singhal
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Mobile computers use wireless channels to communicate with other computers. The finite number of channels should be efficiently allocated to maximize throughput and to avoid co-channel interference. Temporal variations in, channel demand (load) require channel allocation to adapt dynamically to the changing demand. The presence of load imbalance does not automatically imply the usefulness of channel transfer. In this paper we present a probabilistic analysis of the temporal imbalance in channel demand. The effectiveness of channel transfer decisions depends on the probability distribution of the duration for which the imbalance persists. The results of our analysis provide guidelines for the design of dynamic distributed channel allocation strategies.
The wavelet element method. Part I: Construction and analysis.
Authors: Claudio Canuto, Anita Tabacco, Karsten Urban
Venue:  (1997)

The Wavelet Element Method (WEM) combines biorthogonal wavelet systems with the philosophy of Spectral Element Methods in order to obtain a biorthogonal wavelet system on fairly general bounded domains in some $\er^n$. The domain of interest is split into subdomains which are mapped to a simple reference domain, here $n$--dimensional cubes. Thus, one has to construct appropriate biorthogonal wavelets on the reference domain such that mapping them to each subdomain and matching along the interfaces leads to a wavelet system on the domain. In this paper we use adapted biorthogonal wavelet systems on the interval in such a way, that tensor products of these functions can be used for the construction of wavelet bases on the reference domain. We describe the matching procedure in any dimension $n$ in order to impose continuity and prove that it leads to a construction of a biorthogonal wavelet system on the domain. These wavelet systems characterize Sobolev spaces measuring both piecewise and global regularity. The construction is detailed for a bivariate example and an application to the numerical solution of second order partial differential equations is given. EMAIL:: ian@microian.ian.pv.cnr.it
Mod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Authors: Harald Sack, Christoph Meinel, Elena Dubrova
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than the variables obtained by a binary encoding. We present a more general class of MDDs, containing not only branching nodes but also functional nodes, labeled by addition modulo p operation, p - prime, and give algorithms for their manipulation. Such decision diagrams have a potential of being more space-efficient than MDDs. However, they are not a canonical representation of multiple-valued functions and thus the equivalence test of two Mod-p-DDs is more difficult then the test of two MDDs. To overcome this problem, we design a fast probabilistic equivalence test for Mod-p-DDs that requires time linear in the number of nodes.
On-Line Current Testing for a Microprocessor Based Application with an Off-Chip Sensor
Authors: B. Alorda, I. de Paul, J. Segura, T. Miller
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This work presents a prototype architecture that provides on-line IDDQ measurement for a microprocessor based on system. It has been implemented using an IDDQ testable microprocessor (the Intel386TM EX embedded microprocessor) and an off-chip current sensor. Three current test activation modes are supported. A direct test mode through a sensor dedicated pin, a test mode where the microprocessor controls the off-chip sensor, and a P1149.1 driven test. Measurements and architecture operation are detailed.
A robust transport protocol for run-time fault detection
Authors: G. Noubir, K. Vijayananda, H. J. Nussbaumer
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Run-time fault detection in communication protocols is essential to detect faults that cannot be detected during the testing phase. We propose a signature-based method to detect run-time faults. A polynomial using the state and event information as coefficients is used to transform a sequence of states and events into a number (signature). The static signature corresponding to the correct execution of the protocol is compared with the run-time signature. This technique is more reliable, faster, and efficient compared to existing techniques. The states and events are assigned values such that multiple paths leading to the same state result in a unique signature. This reduces the number of comparisons required to verify the correct execution of the protocol. In this paper, we present eXTP4, an extended transport layer protocol that facilitate run-time fault detection
Downlink scheduling in CDMA data networks
Authors: A. Bedekar, Simon C. Borst, K. Ramanan, P. A. Whiting, E. M. Yeh
Venue:  (1999)

We identify optimality properties for scheduling downlink transmissions to data users in CDMA networks. For arbitrary-topology networks, we show that under certain idealizing assumptions it is optimal for a base station to transmit to only one data user at a time. Moreover, for data-only networks, we prove that a base station, when on, should transmit at maximum power for optimality. We use these two properties to obtain a mathematical programming formulation for determining the optimal transmission schedule in linear data-only networks, with time allocations playing the role of decision variables. The optimality conditions imply that there exist (i) subsets of outer users on either side of the cell that should be served when only the neighboring base station on the opposite side is on; (ii) a subset of inner users in the center of the cell that should be served when both neighbors are on; (iii) a subset of users in the intermediate regions that should receive transmissions when both neighbors are off. Exploiting these structural properties, we derive a simple search algorithm for finding the optimal transmission schedule in symmetric scenarios. Numerical experiments illustrate that scheduling achieves significant capacity gains over conventional CDMA.
Improved Lightpath (Wavelength) Routing in Large WDM Networks
Authors: Weifa Liang, George Havas, Xiaojun Shen
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining several lightpaths together, using wavelength conversion at their junctions. The problem thus is to find an optimal lightpath/semilightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. We first present fast, efficient algorithms both for the general problem and for a natural restricted version. The new algorithms outperform earlier work, providing time improvements amounting to an almost linear time factor in most cases. Also, all our algorithms can be implemented on the network in a distributed way.
Solution Selling: Creating Buyers in Difficult Selling Markets
Authors: Michael T. Bosworth
Venue:  (2002)

:When products or services are hard to describe, intangible, have long sell cycles, or are expensive, chances are they're difficult to sell. In situations like this, conventional sales techniques not only don't help, they may in fact hinder success. Solution Selling is a process to take the guesswork out of difficult-to-sell, intangible products and services. It enables sellers to make the way they sell as big an advantage as their product or service. After reading this book, salespeople and sales managers will be able to use a well-tested model that guides them through the process of selling. No more smoke and mirrors, blind luck, or high-pressure selling. Just a step-by-step system that ensures a higher rate of success for salespeople and a higher probability that the buyer's expectations will be met.
Developing More Reliable Software Faster and Cheaper
Authors: John D. Musa
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

This paper will outline the nature of the standard, proven, widespread best practice of Software Reliability Engineering (SRE). It is widely applicable, low in cost, and its implementation has virtually no schedule impact. SRE helps you develop and test more reliable software faster and cheaper. We will show how it does this, and we will present some resources that will help you learn more about it. SRE can help solve the most important software development problem facing us today, making you and your organization more competitive. The principal threat to your competitiveness comes from three risks, listed in order of their impact, as perceived by most customers: 1. Unreliability or unavailability of the released product2. Missed schedules3. Cost overrunsThese problems generally lead to loss of market share and hence profitability; hence there is overwhelming pressure on software developers to prevent them from happening. Before we proceed further, let's define some of the terms we will be using. Reliability is the probability that a system functions without failure for a specified time or number of natural units in a specified environment. The concept of natural units is relatively new to reliability, and it appears to have originated in the software sphere. A natural unit is a unit other than time that is related to the output of a system or a capability of a system, such as pages of output, transactions, telephone calls or jobs. Availability is the probability at any given time that a system or a capability of a system functions satisfactorily in a specified environment. If you are given an average down time per failure, availability implies a certain reliability. Failure intensity, used particularly in the field of software reliability engineering, is simply the number of failures per natural or time unit.Some people speak of software products, but this is really incorrect, because pure software cannot function. You really have "software-based products." In discussing SRE, we should always be thinking of total systems that also contain hardware and often human components. Note that we deliberately define software reliability in the same way as hardware reliability. This is so that we can determine system reliability from hardware and software component reliabilities, even though the mechanisms of failure are different (Musa, Iannino, and Okumoto (1987)).
Conflict Management in Computer Supported Collaborative Design: The Methodology and Applications
Authors: Victor Taratoukhine
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The main goal of this paper is to describe the theory and practice of conflict management in computer supported collaborative design. An analysis of existing methods and techniques addressing the problem of mismatch control in collaborative design environment is described.The methodology of conflict management named ¿ Intelligent Distributed Mismatch Control (IDMC) is represented.The proposed general methodology consists of two sub-models: process model of IDMC and structural model ¿ conceptual multi-agent framework for IDMC development.The application of proposed methodology for aerospace collaborative design is presented.
A timing-based schema for stabilizing information exchange
Authors: A. Arora, D. M. Poduska
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The paradigm of information exchange provides a basis for nodes in a network to stay up-to-date with the recent information in the network. In this paradigm, nodes cooperate with each other to share their current information. We present a simple and uniform schema for building information exchange protocols that are stabilizing, in the following strong sense. Starting from arbitrary state, the protocols reach within bounded real-time a state from where all nodes remain up-to-date with recent information in the network. The ability to stabilize in bounded time is achieved by using timing-based actions. The timing constraints on these actions can be systematically adapted to suit a variety of network loads, delay requirements, and scheduling restrictions and to tolerate out-of-phase and drift-prone node clocks. Our schema also tolerates any number of topological changes in the network. Moreover, it accommodates information that is time-varying as well as it does information that is fixed. It is thus well-suited to dynamic high speed networks