ppxscal/embedding_network huggingface dataset:
A feedback linearization technique by using neural networks: application to bioprocess control
Authors: Y. S. Boutalis, O. I. Kosmidou
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Most physical systems operations are nonlinear in nature and hence they should be described by means of nonlinear mathematical models. Since nonlinear models are not convenient for control purposes, due to both theoretical and computational reasons, they are often linearized by using appropriate exact or approximate linearization techniques [5], [4]. Among them, feedback linearization [5] is the most theoretically rigorous method; it consists in finding a feedback control law and a state variable transformation (diffeomorphism) such that the closed loop system model becomes linear, in the new coordinate variables. However, feedback linearization requires some strong constraints to be satisfied by the original nonlinear system, and thus its applicability is quite restricted. If, in addition, the original system is characterized by uncertain parameters, external disturbances and unmeasured state variables, as is the case of bioprocess control systems, the linearization problem becomes particularly complex and almost inextricable.
Efficient evaluation of Boolean expressions
Authors: V. Sinha, K. Vinod Kumar
Venue: ACM SIGPLAN Notices (1978)

An algorithm for the generation of an optimal code applicable to a parsed Boolean expression is presented. The algorithm generates the code during parsing itself.
Socharis: The instantiation of a strategy for conceptual manufacturing planning
Authors: Oleg Lukibanov, Iliana Martinez, Timothy J. Lenz, James K. McDowell, Clark Radcliffe, Jon Sticklen
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Considering manufacturing expertise during the early stages of design can be of great benefit. Such information can greatly improve not only the quality of a design, but it can also ensure the generation of an easily manufactured design. This, in turn, can lower the final cost of the designed product. By evaluating how easily an evolving conceptual design can be made, potential hazards can be avoided before any detailed design efforts commence. The conceptual manufacturing planning requisite to such an evaluation is the focus of this paper. A domain-independent strategy for conceptual manufacturing planning is presented. A task-structure analysis of this strategy shows its domain independence. A specific implementation of this strategy for polymer composites manufacturing planning (Socharis) is discussed. The high-level implementation details of Socharis are presented as instantiations of the conceptual manufacturing planning strategy. Finally, the validity of the planning strategy and the utility of Socharis are assessed.
Statistical Character Structure Modeling and Its Application to Handwritten Chinese Character Recognition
Authors: In-Jung Kim, Jin-Hyung Kim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

This paper proposes a statistical character structure modeling method. It represents each stroke by the distribution of the feature points. The character structure is represented by the joint distribution of the component strokes. In the proposed model, the stroke relationship is effectively reflected by the statistical dependency. It can represent all kinds of stroke relationship effectively in a systematic way. Based on the character representation, a stroke neighbor selection method is also proposed. It measures the importance of a stroke relationship by the mutual information among the strokes. With such a measure, the important neighbor relationships are selected by the nth order probability approximation method. The neighbor selection algorithm reduces the complexity significantly because we can reflect only some important relationships instead of all existing relationships. The proposed character modeling method was applied to a handwritten Chinese character recognition system. Applying a model-driven stroke extraction algorithm that cooperates with a selective matching algorithm, the proposed system is better than conventional structural recognition systems in analyzing degraded images.The effectiveness of the proposed methods was visualized by the experiments. The proposed method successfully detected and reflected the stroke relationships that seemed intuitively important. The overall recognition rate was 98.45 percent, which confirms the effectiveness of the proposed methods.
What Lurkers and Posters Think of Each Other
Authors: Blair Nonnecke, Jenny Preece, Dorine Andrews
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This study reports the results of an online survey that generated 1188 responses from 375 online MSN communities. The survey examined the behavior and attitudes of participants who post (i.e., posters) and those who read but do not post (i.e., lurkers). The results of the analysis indicate that posters and lurkers go online for similar reasons. While lurkers did not publicly askquestions, they wanted answers to questions (62.1% vs. 70.3% for posters). However, lurkerswere less enthusiastic about the benefits of community membership, with 41.8% indicating they received less than the expected benefit. In contrast, 36.6% of posters perceived a greater than expected benefit.
Scalable Cache Invalidation Algorithms for Mobile Data Access
Authors: Ahmed Elmagarmid, Jin Jing, Abdelsalam (Sumi) Helal, Choonhwa Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In this paper, we address the problem of cache invalidation in mobile and wireless client/server environments. We present cache invalidation techniques that can scale not only to a large number of mobile clients, but also to a large number of data items that can be cached in the mobile clients. We propose two scalable algorithms: the Multidimensional Bit-Sequence (MD-BS) algorithm and the Multilevel Bit-Sequence (ML-BS) algorithm. Both algorithms are based on our prior work on the Basic Bit-Sequences (BS) algorithm. Our study shows that the proposed algorithms are effective for a large number of cached data items with low update rates. The study also illustrates that the algorithms can be used with other complementary techniques to address the problem of cache invalidation for data items with varied update and access rates.
Conceptual modeling of semantic navigation structures: the MoSeNa-approach
Authors: Jörg Becker, Christian Brelage, Karsten Klose, Michael Thygs
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

At the present time, several shortcomings prevent the more effective use and more intense application of web information systems. Recent developments that are subsumed by the term Semantic Web aim to solve these problems. The inherent idea behind these approaches is the annotation of data with metadata, in order to enhance automated processing and the use of ontologies to describe data semantically. However, the emergence of the Semantic Web raises new issues (e.g. significantly higher complexity) for web information system engineers. From an information system engineering perspective, conceptual modeling is an approach for dealing with high complexity and diversified project teams. On the one hand, conceptual models facilitate the (semi)automated generation of information systems. On the other, they foster communication between project team members and provide a sound basis for information system development.In this paper, we present an approach to modeling semantic navigation structures. This approach aims at modeling complex, role-based and integrated navigation structures for structured and semi-structured data. Since navigation via links is the only way for users to interact with the web information system and, to a large extent, determines their ability to retrieve the desired information, a proper definition of these navigation structures is essential for a successful web information system. Comprehensible and useful navigation structures can be derived from existing structures and hierarchies in organizations. Thus, an alignment of information systems with the information needs of users, can be achieved. Furthermore, our approach supports emergent technologies for the Semantic Web.
UCTx: A Multi-Agent System to Assist a Transplant Coordination Unit
Authors: U. Cortés, J. Vázquez-Salceda, A. López-Navidad, F. Caballero
Venue: Applied Intelligence (2004)

We present a system called UCTx designed to model and automate some of the tasks performed by a Transplant Coordination Unit (UCTx) inside a Hospital. The aim of this work is to show how a multi-agent approach allows us to describe and implement the model, and how UCTx is capable of dealing with another multi-agent system (Carrel, an Agent Mediated Institution for the Exchange of Human Tissues among Hospitals for Transplantation) in order to meet its own goals, acting as the representative of the hospital in the negotiation. As an example we introduce the use of this Agency in the case of Cornea Transplantation.
Watermarking relational data: framework, algorithms and analysis
Authors: Rakesh Agrawal, Peter J. Haas, Jerry Kiernan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and delineate desirable properties of a watermarking system for relational data. We then present an effective watermarking technique geared for relational data. This technique ensures that some bit positions of some of the attributes of some of the tuples contain specific values. The specific bit locations and values are algorithmically determined under the control of a secret key known only to the owner of the data. This bit pattern constitutes the watermark. Only if one has access to the secret key can the watermark be detected with high probability. Detecting the watermark requires access neither to the original data nor the watermark, and the watermark can be easily and efficiently maintained in the presence of insertions, updates, and deletions. Our analysis shows that the proposed technique is robust against various forms of malicious attacks as well as benign updates to the data. Using an implementation running on DB2, we also show that the algorithms perform well enough to be used in real-world applications.
NESTMOD simulation of DQDB metropolitan networks
Authors: Gerald A. Winters, David W. Bachmann, Toby J. Teorey
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

Local area computer networks are well-established, and highly interconnected heterogeneous local networks are coming into prominence. NESTMOD is a combined analytical modeling and simulation tool, based on the existing tools NetMod and NEST, which is responsible for representing the topology of interconnected networks as well as providing library routines which describe the behavior of the interconnected networks. As an example of current technology, the metropolitan area network, DQDB(distributed queue dual bus), has been added to NESTMOD. The purpose of this paper is to describe the DQDB simulation and compare the simulation results with well known analytical results.
Algorithms and codes for the Macdonald function: recent progress and comparisons
Authors: B. R. Fabijonas, D. W. Lozier, J. M. Rappoport
Venue: Journal of Computational and Applied Mathematics (2003)

The modified Bessel function Kiv(x), also known as the Macdonald function, finds application in the Kontorovich-Lebedev integral transform when x and v are real and positive. In this paper, a comparison of three codes for computing this function is made. These codes differ in algorithmic approach, timing, and regions of validity. One of them can be tested independent of the other two through Wronskian checks, and therefore is used as a standard against which the others are compared.
Simulation for the complex Bingham distribution
Authors: John T. Kent, Patrick D. L. Constable, Fikret Er
Venue: Statistics and Computing (2004)

The complex Bingham distribution is relevant for the shape analysis of landmark data in two dimensions. In this paper it is shown that the problem of simulating from this distribution reduces to simulation from a truncated multivariate exponential distribution. Several simulation methods are described and their efficiencies are compared.
Minimum degree algorithms for stability number
Authors: Igor É. Zverovich
Venue: Discrete Applied Mathematics (2003)

Mahadev and Reed (J. Graph Theory 30(2) (1999) 113) found a finite forbidden induced subgraph characterization for the maximal hereditary class of graphs where a minimum degree greedy algorithm produces a maximum stable set. We extend this class.
A microcomputer-based control and communication system for the severely disabled
Authors: James A. Doubler, Dudley S. Childress, John S. Strysik
Venue: Issue 24 (October 1978) (1978)

A microcomputer-based environmental control and communication system for the severely disabled has been developed. By puffing and sipping on a tube the user can store messages in computer memory and control a number of peripheral devices. A scanning method of operation is employed in which characters are selected for message building or control purposes from lists displayed on a CRT. An interface system is presently being developed to allow the computer to control peripheral devices by transmitting coded signals over the power mains.
Towards a global solution to high level synthesis problems
Authors: Abdelhakim Safir, Bertrand Zavidovique
Venue: Proceedings of the conference on European design automation (1990)

Since the various tasks as scheduling, operator allocation and module selection involved in the high level synthesis are strongly interdependent, a global solution to the high level synthesis problems becomes necessary. Therefore, a global optimization process which simultaneously performs scheduling, operators allocation and module selection, is presented in this paper. The search for a good solution in a "realistic enough" design space is made possible thanks to a global optimization algorithm which is simulated-annealing-based and improved by a pseudo-deterministic control. In the absence of other challenging global methods for both scheduling-operator allocation and module selection, the proposed global optimization algorithm is compared to a regular simulated annealing. Experimental results are shown in this paper and highlight a significant speed-up over a regular simulated annealing.- ranging from 45% to 73% on medium size problems (for instance the fifth order elliptic digital wave filter).- ranging from 82% to 235% on small size problems (the radix-2 FFT example (pipelined architecture)).- A much more complex example (from line-detection algorithm of [Danielson]) is briefly exposed and used to test the "capability" of the proposed method for processing such level of complexity.
Global MINMAX Interframe Bit Allocation for Embedded Video Coding
Authors: Michael F. Ringenburg, Richard E. Ladner, Eve A. Riskin
Venue: Proceedings of the Conference on Data Compression (2004)

We present three new bit allocation techniques, the MultiStage algorithm,the Ratio algorithm, and the Pseudo I-frame method. The MultiStage andRatio algorithms are global interframe bit allocation algorithms for embeddedvideo coders, which attempt to minimize the maximum distortion of any frame.The Pseudo I-frame method breaks a video into segments where bit allocationalgorithms should be run, and segments where constant rate bit allocation willsource. We present experiments, using the Group Testing for Video coder,that compare our techniques to constant rate allocation and to a bit allocationalgorithm due to Yang and Hemami.
A new approach to layout of custom analog cells
Authors: Louis-Oliver Donzelle, Pierre-François Dubois
Venue: Proceedings of the conference on European design automation (1991)

A new layout system for analog cells is presented. Unlike most other systems, the problem of interaction is addressed: Our goal is to enable an analog expert to achieve the layout of common analog cells, in less than half a day, the final result being as good as a totally handcrafted layout.The system is divided into two main parts:First, the primitives which are necessary to generate the layout of analog cells: generation of devices, associations and symmetries of basic elements, interactive routing.Second, an easy to use graphic environment, which provides enough interaction in the manipulation of basic structures to enable the designer to reach the layout he desires.Many real cells have been laid out using this tool. Some final results on silicon are reported.
Parallel Implementation of a Lattice-Gauge-Theory Code: Studying Quark Confinement on PC Clusters
Authors: Attilio Cucchieri, Tereza Mendes, Gonzalo Travieso, Andre R. Taurines
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

We consider the implementation of a parallel Monte Carlo code for high-performance simulations on PC clusters with MPI. We carry out tests of speedup and efficiency. The code is used for numerical simulations of pure SU (2) lattice gauge theory at very large lattice volumes, in order to study the infrared behavior of gluon and ghost propagators. This problem is directly related to the confinement of quarks and gluons in the physics of strong interactions.
Experimentation and Learning in Repeated Cooperation
Authors: Rudolf Vetschera
Venue: Computational Mathematical Organization Theory (2003)

We study an agency model, in which the principal has only incomplete information about the agent's preferences, in a dynamic setting. Through repeated interaction with the agent, the principal learns about the agent's preferences and can thus adjust the inventive system. In a dynamic computational model, we compare different learning strategies of the principal when facing different types of agents. The results indicate that better learning of preferences can improve the situation of both parties, but the learning process is rather sensitive to random disturbances.
A Java dialog system for use in computer-aided teaching
Authors: Irene Luque Ruiz, Gonzalo Cerruela García, Miguel Ángel Gómez-Nieto
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The present study shows the use of Java language and object-oriented paradigm to modeling of the knowledge involves in the utterances teacher-student carry out on the computer-aided teaching system. A dialog generator has been built, which permits management of the dialog as a knowledge network through a powerfull navigator tool.
Integrated approach to electrode and AIN depositions for bulk acoustic wave (BAW) devices
Authors: R. Jakkaraju, G. Henn, C. Shearer, M. Harris, N. Rimmer, P. Rich
Venue: Microelectronic Engineering (2003)

This paper investigates the (002) texture of AlN films deposited by reactive pulsed direct current sputtering on Al, Al-Cu, W and Mo metal electrodes. X-Ray diffraction and atomic force microscopy studies show that the AlN texture is dependent on the deposition conditions and nature of the underlayers. A smooth underlayer with a sharp texture represents the best combination of properties. AlN films with a full width at half maximum less than 1.5 have been deposited on the electrodes studied. It is also possible to deposit well-textured electrodes with a roughness less than 2.5 nm.
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Authors: Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch
Venue: Distributed and Parallel Databases (2004)

In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects or fraction of objects that move at any moment in time. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. A sorting based optimization is developed for significantly improving the cache hit-rate. Experimental evaluation establishes that indexing queries using the grid index yields orders of magnitude better performance than other index structures such as R*-trees.
Software architecture of universal hardware modeler
Authors: Norman F. Kelly, Holly E. Stump
Venue: Proceedings of the conference on European design automation (1990)

Hardware modeling technology allows complex VLSI devices to be modeled for logic and fault simulation in system-level design verification. The current design environment for digital electronic systems defines the need for a universal hardware modeler (i.e., one that functions with multiple hosts and multiple simulators), as well as for improving overall functionality and performance. We describe researched architectural design goals for the LM-1000 universal hardware modeler, along with implementation decisions, tradeoffs and the resultant architecture. The LM-1000 system is currently in production, and performance metrics demonstrate the extent to which project goals were fulfilled.
Using the NSDL and CITIDEL to enhance teaching
Authors: Deborah Knox, Lillian N. Cassel, John Impagliazzo
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

We present an overview of the National Science Digital Library, NSDL, and focus on one of the partner projects it supports. The computing and Information Technology Interactive Digital Educational Library (CITIDEL) harvests metadata from repositories and collections, and provides tools to customize learning with these resources. CITIDEL's integrated tools guide the user to create instructional environments that enhance the learning experience. Additional tools available from NSDL are included in this presentation to complete the picture. Information on integrating new collections and materials into CITIDEL is included.
Error Analysis of a Semidiscrete Numerical Scheme for Diffusion in Axially Symmetric Surfaces
Authors: Klaus Deckelnick, Gerhard Dziuk, Charles M. Elliott
Venue: SIAM Journal on Numerical Analysis (2003)

We analyze a semidiscrete numerical scheme for approximating the evolution of axially symmetric surfaces by surface diffusion. The fourth order equation is split into two coupled second order problems, which are approximated by linear finite elements. We prove error bounds for the resulting scheme and present numerical test calculations that confirm our analysis.
Vessel traffic optimization using a linear model with fuzzy coefficients
Authors: Waldemar Uchacz, Zbigniew Pietrzykowski
Venue: Artificial intelligence and security in computing systems (2003)

The paper presents a problem of vessel traffic optimisation with the use of fuzzy linear programming. The Swinoujscie-Szczecin fairway has been taken as a practical example. The L-R representation of fuzzy numbers was used for the model description. The interpretation of fuzzy numbers has been presented. As deviations from the fixed values of constraint coefficients have been allowed, the solutions obtained are more realistic. The approach enables a flexible and safer formulation of an optimisation task. The calculations and their results have been presented and interpreted.