ppxscal/embedding_network huggingface dataset:
Applying Knowledge Management: Techniques for Building Corporate Memories
Authors: Ian Watson
Venue:  (2002)

:Applying Knowledge Management: Techniques for Building Corporate Memories is very readable and follows a logical order, sticking to the facts without burdening the reader with a lot of irrelevant detail. Most existing texts on artificial intelligence applications or knowledge management tend to deal with isolated examples of CBR applications. In contrast, this text has the virtue of dealing with CBR exclusively, and in doing so shows a diversity of problems addressable by the CBR approach. This book will really be read, and not just consigned to some dusty shelf after reading the first few pages.-Rick Magaldi, Senior Technical Consultant (Artificial Intelligence), British Airways"This book is written in a clear and friendly style that presupposes no specialized technical knowledge. It is full of practical wisdom about what works, why it works, how to make it work, and what it looks like when it works. This would be a great book to give to every member of a knowledge-system development team.-Alexander P. Morgan, Principal Research Scientist, General MotorsThe wholesale capture and distribution of knowledge over the last thirty years has created an unprecedented need for organizations to manage their knowledge assets. Knowledge Management (KM) addresses this need by helping an organization to leverage its information resources and knowledge assets by "remembering" and applying its experience. KM involves the acquisition, storage, retrieval, application, generation, and review of the knowledge assets of an organization in a controlled way. Today, organizations are applying KM throughout their systems, from information management to marketing to human resources. Applying Knowledge Management: Techniques for Building Corporate Memories examines why case-based reasoning (CBR) is so well suited for KM. CBR can be used to adapt solutions originally designed to solve problems in the past, to address new problems faced by the organization. This book clearly demonstrates how CBR can be successfully applied to KM problems by presenting several in-depth case-studies. Ian Watson, a well-known researcher in case-based reasoning and author of the introductory book, Applying CBR: Techniques for Enterprise Systems has written this book specifically for IT managers and knowledge management system developers. Features·Provides 7 real-world applications of knowledge management systems that use case-based reasoning techniques·Highlights working applications from National Semiconductor, General Electric, Kaye (Presteigne) Ltd., Burdon & Miles Ltd., Morris Ashby Casting, Deloitte Touche Tohmatsu, Analog Devices, Western Air·Presents the technical information needed to implement a knowledge management system.·Offers insights into the development of commercial KM CBR applications·Includes information on CBR software vendors, CBR consultants and value added resellers
Petri Net Representation of Fuzzy Reasoning Under Incomplete Information
Authors: A. Bugarin, P. Cari F1ena, M. F. Delgado, S. Barro
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

In this paper we present an algorithm that performs reasoning processes on Fuzzy Knowledge Bases with chaining between rules. The algorithm we propose permits obtaining valid inferences even in situations where part of the variables in the Knowledge Base are unknown. The support for the description of the execution algorithm is provided by the Petri Net formalism, which organizes in a convenient way all the information in the Base, and expresses in a simple way this and other processes performed onto it. This simplicity is achieved also because the execution of the Fuzzy Knowledge Base is carried out in the truth space and the linguistic truth values used in the process are described through numerical parameters. For the parameterized family of truth values we use, the basic operations in this execution methodology (conjunction, inference, chaining and aggregation) are closed when the most common operators are used, which reduces the computational cost of the process and makes easier its mapping onto the Petri Net formalism. Although some other parameterized descriptions of truth values exist, the one we chose is easier to describe and permits a better adequation with other models that describe the execution of Fuzzy Knowledge Bases with chaining in the field of control systems.
Dependable Computing for National Security: A Position Paper
Authors: Bhavani Thuraisingham
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper examines various security threats and then discusses the applications of dependable computing for national security. By a dependable computing system we mean a flexible system that enforces quality of service policies between security, real-time processing, integrity and fault tolerance. We also discuss infrastructures and business objects for counter-terrorism.
The Specification and Implementation of a Virtual University Software System
Authors: Timothy K. Shih, Anthony Y. Chang, Yemoz-Huei Chen, Jianhua Ma, Runhe Huang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Distance Learning is one of the interesting research topics of distributed computing. This paper discusses a joint research project between the University of Aizu in Japan and Tamkang University in Taiwan. A software system supports virtual university operations is proposed. The software architecture is designed based on three criteria of virtual university operations: administration, awareness, and assessment. Specifications of each tools in the system are proposed, with some implementation details and solutions discussed. We also point out some interesting research directions in the realization of virtual university.
Finding Minimal Perfect Hash Functions
Authors: Kevin Karplus, Gary Haggard
Venue:  (1984)

A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this function relies on a backtracking algorithm for numbering the vertices of the graph. Careful selection of the graph model limits the time spent searching. Good results have been obtained for dictionaries of up to 181 words. Using the same techniques, non-minimal perfect hash functions have been found for sets of up to 667 words.
Test Generation and Fault Modeling for Stress Testing
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Voltage stress testing has long been used as a reliability screen. Significant effort has been devoted in the reliability physics literature to setting of stress voltages. Chang and McCluskey formalized the test aspects of voltage stressing in their works on "SHOVE (SHort VOltage Elevation)" testing [1]. Their work deals with 3.3V and 5V technologies where Fowler-Nordheim tunneling is dominant and suggests a stress energy of about 6MV/cm. In current generation technologies, Fowler-Nordheim tunneling is replaced by standard tunneling currents and operating energies are in the suggested stress range (e.g. 1.2V power supply with a 20Å oxide is 6MV/cm). Modified methods are developed to support this new situation, and a test generation technique is introduced that enables substantial reduction in the number of stress vectors. 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
Dynamic Expression Trees
Authors: Robert F. Cohen, Roberto Tamassia
Venue:  (1990)

We present a technique for dynamically maintaining a collection of arithmetic expressions represented by binary trees (whose leaves are variables and whose internal nodes are operators). A query operation asks for the value of an expression (associated with the root of a tree). Update operations include chaining the value of a variable and combining or decomposing expressions by linking or cutting the corresponding trees. Our dynamic data structure uses linear space and supports queries and updates in logarithmic time. An important application is the dynamic maintenance of maximum flow and shortest path in series-parallel digraphs under a sequence of vertex and edge insertions, series and parallel compositions, and their respective inverses. Queries include reporting the maximum flow or shortest {\em st}-path in a series-parallel subgraph.
A new formula for the busy period of a non-empty multiserver queueing system
Authors: A. M. K. Tarabia
Venue: Applied Mathematics and Computation (2003)

In a recent paper Sharma and Tarabia [Sankhyâ 62 (2) (2000) 273-281] obtain a density function of a busy period for an empty multichannel Markovian queue in series form. In this paper a simple approach is applied to obtain the busy period density function by taking an arbitrary number (say i) of customers present in the system initially. Also a general form for the kth order moment of the busy period distribution is given.
Holographic imaging of lines: a texture based approach
Authors: A. Ritter, O. Deussen, H. Wagener, T. Strothotte
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Holography is a method for three dimensional imaging of objects. We present an approach for the generation of holograms, exploiting standard graphics rendering methods and hardware. We focus on the visualization of objects composed of line segments, which allow for certain simplifications, and thus hologram generation speedup. Our method is based on the derivation of a holographic geometric equivalent of the object to be imaged. In this equivalent, the object is represented as a set of geometric primitives combined with precomputed textures. The equivalent is built up under prescribed conditions, thus simulating certain wave characteristics. The hologram of the object to be imaged is gained just by rendering its holographic geometric equivalent. Problems of achieving the necessary resolution of the output hologram are addressed.
TreadMill Ink " Enabling Continuous Pen Input on Small Devices
Authors: Giovanni Seni
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents a novel handwriting input user interface (UI) for small portable devices with a touch-enabled screen. This UI includes a writing area on the screen that behaves as a "treadmill" such that electronic ink input is immediately moved from right to left while it is being entered, giving the user the feeling of writing text on a virtual "ticker-tape". This method allows the user to write continuously without running out of writing space, and takes up very little screen real-estate to implement. The UI communicates with a recognition engine capable of recognizing continuously input handwritten text and that can buffer incomplete ink entries. The UI technique described, unlike prior interfaces in which space constraints limit the abilityto continuously write on the device screen and thus slow text input, allows the full throughput benefit of continuous text input to be realized within a very small writing space.
Oblique Procrustes Rotations in Factor Analysis
Authors: Franklin T. Luk
Venue:  (1982)

This paper addresses the problem of rotating a factor matrix obliquely to a least squares fit to a target matrix. The target may be fully or partially specified. An iterative computing procedure is presented. Keywords: oblique rotations, procrustes problem, factor analysis, least squares.
Systems Research in the Age of On-Line Coffee Houses
Authors: Richard Zippel
Venue:  (1994)

For years, we have spoken of a golden era where high performance ``super-computers'''' will be available in local department stores and we will be able to communicate with anyone and any organization we want via computer networks. In the past, we have whimsically said that in this era, computing systems will be used in dramatically different fashion than they are today. That era is here now, with 60-80Mips computers available in local computer shops, ``on-line'''' coffee houses springing up in trendy neighborhoods and National Public Radio broadcasting on the Internet for almost a year. And yet, the way we used computers has not changed dramatically. Clearly, improved speech understanding and generation systems, vision systems and other sophisticated I/O technologies will change our interaction with computers. What will change the content of our interaction with computers? What type of systems research will enable revolutionary changes in the use of computers? In an attempt to provoke discussion about these topics, a talk was presented several times during the spring semester 1994. A slightly different approach to systems research was presented as well as a few new directions that are being undertaken at Cornell. Hopefully, the ideas and questions raised by this presentation will be of use to others. This technical report is rather rough and disorganized, consisting as it does of slides from those talks and textual commentary. I felt it more valuable to make the material available in a timely manner than to wait until the details had been worked out, and the prose polished. It is an experiment and I am interested in the reaction any readers have to this form of presentation. You can also view a World Wide Web version of this document in: http://simlab.cs/cornell.edu/slides/systems/overview/html I am interested in any comments you might have, both on the content of this report and how it is presented. Please send them to: rz@cs.cornell.edu.
Trellis-coded M-ary orthogonal modulation
Authors: Hae-Geun Kim
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

We have introduced the trellis-coded M-ary (M=32) 4-dimensional (4-D) orthogonal modulation scheme. Here, a rate 4/5 convolutional encoder generates one of 32 possible symbols every T seconds. Then the signal mapping for 32 symbols is performed by a M-ary 4-D orthogonal modulator. The M-ary 4-D modulator employs the vectors which is derived by the optimization technique of signal waveforms in a 4-D sphere. The technique is used in maximizing the minimum Euclidean distance between a set of signal points on a multidimensional sphere. After combining coding with M-ary 4-D modulation, we have obtained a considerable improvement in the free minimum distance of the system. The new system achieves asymptotic coding gains up to 6.4 dB over the uncoded two-independent QPSK scheme and 3.4 dB over the two-independent 2-D TCM scheme.
A Layout Approach for Electrical and Physical Design Integration of High-Performance Analog Circuits
Authors: Mohamed Dessouky, Marie-Minerve Louerat
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This paper presents a layout generation tool that aims to reduce the gap between electrical sizing and physical realization of high performance analog circuits. The procedural layout approach is shown to be best suited for this kind of methodologies. Once captured, the procedural description can be used several times to calculate both rapidly and accurately all parasitics that appear during physical realizations without layout generation. Efficient algorithms are developed to take into account analog layout constraints such as matching, parasitic control, shape and reliability considerations. This allows accounting for these effects early in the design, which guarantees the fulfillment of the required performance specifications, %in the presence of layout parasitics, permits to optimize various design aspects in the presence of parasitics and shortens the overall design time by avoiding laborious sizing-layout iterations. An example of a high performance OTA is presented at the end to illustrate the effectiveness of the approach.
Control in a 3D Reconstruction System using Selective Perception
Authors: Maurício Marengoni, Allen Hanson, Shlomo Zilberstein, Edward Riseman
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper presents a control structure for general purpose image understanding that addresses both the high level of uncertainty in local hypotheses and the computational complexity of image interpretation. The control of vision algorithms is performed by an independent subsystem that uses Bayesian networks and utility theory to compute the marginal value of information provided by alternative operators and selects the ones with the highest value.We have implemented and tested this control structure with several aerial image data-sets. The results show that the knowledge base used by the system can be acquired using standard learning techniques and that the value-driven approach to the selection of vision algorithms leads to performance gains. Moreover, the modular system architecture simplifies the addition of both control knowledge and new vision algorithms.
Architectural Level Hypothesis Testing through Reverse Engineering of Object-Oriented Software
Authors: S. Counsell, P. Newson, E. Mendes
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Comprehension of an Object-Oriented (OO) system, its architecture and use of OO features such as aggregation, generalization and other forms of association is a difficult task to undertake without the original design documentation for reference. In this paper, a reverse engineering tool was used to reproduce the UML design documentation from code of three industrial-sized systems. High-level class metrics were then collected directly from the design documents. Three hypotheses were tested to establish relationships between these high-level features and the low-level class features of number of class methods and attributes. A further hypothesis was tested to determine features of key classes in a system.Results indicated that, whilst no clear patterns emerged for hypotheses relating to generalization, there was a clear (positive) statistical significance for all three systems studied between aggregation, other types of association and the number of method and attributes in a class. The final hypothesis tested supported the view that key classes in each of the three systems tended to contain a large number of methods, attributes, and associations, significant amounts of aggregation but very little inheritance. An important factor in the comprehension of a systems' architecture is therefore an understanding of the systems' key classes and the coupling patterns (due to aggregation and association) of those classes.
The effect of cost distributions on evolutionary optimization algorithms
Authors: Florian Waas, Cesar A. Galindo-Legaria
Venue:  (2000)

According to the No-Free-Lunch theorems of Wolpert and Macready, we cannot expect one generic optimization technique to outperform others on average. For every optimization technique there exist ``easy'''' and ``hard'''' problems. However, only little is known as to what criteria determine the particular difficulty of a problem. In this paper, we address this question from an evolutionary computing point of view. We use cost distributions, i.e., the frequencies of the objective function''s values occurring in the search spaces, to devise a classification of optimization problems. We scrutinize the influence of cost distributions on the single algorithmic components of evolutionary computing. Our analysis helps identifying (1) problems where evolutionary algorithms are overhead, (2) problems where evolutionary algorithms are highly suitable optimization algorithms, as well as (3) problems that pose difficulties for evolutionary techniques.
The Dirichlet problem for generalized mean curvature flows
Authors: Annalisa Buffa
Venue:  (1997)

We study the existence and uniqueness of viscosity solutions for the Dirichlet problem associated to generalized mean curvature flow equations under some assumptions on the data and the shape of domain. The data is constant in time and Lipschitz-continuous in space. We first provide the result on a smooth strictly convex domain and then we generalize it to non-strictly convex set whose boundary is piecewise $C^2$ with a finite number of corners. At the end an easy example shows that the existence result c an not be extended to more general domains without further a ssumptions on the data. The main idea we use is to contruct viscosity sub-solutions and super-solutions under hypoteses of Perron''s Method whose validity for such equations is set in [3]. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: viscosity solutions, fully non-linear PDEs, Dirichlet problems, barriers
Heuristics for Efficient Clasification
Authors: Kathryn Fraughnaugh, Jennifer Ryan, Holly Zullo, L. A. Cox
Venue:  (1993)

The classification problem is to determine the class of an object when it is costly to observe the values of its attributes. This type of problem arises in fault diagnosis, in the design of interactive expert systems, in reliability analysis of coherent systems, in discriminant analysis of test data, and in many other applications. We introduce a generic decision rule that specifies the next attribute to test at any location in a decision tree. Random searches and tabu searches are applied to determine the best specific from of the rule. The most successful heuristics that we developed are based on the tabu search paradigm. We present computational results for problems with a variety of characteristics and compare our heuristics to an exact dynamic programming algorithm.
A computer algebra approach to biological systems
Authors: Reinhard Laubenbacher
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

This paper focuses on dynamic networks over finite fields and applications to the modeling and analysis of biological networks using tools from computer algebra, in particular gene regulatory networks, and agent-based simulations of processes in computational immunology.
Modeling Manufacturing Resources base on Agent Model
Authors: Masahiro Hiji, Masaru Tezuka
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In order to improve the responsiveness to changes and uncertainties around production activity, we should have the integrated methodology which allows us to uniformly model and design the total system including production and planning resource and related information exchanged among resources. We propose the agent model and the modeling methodology. There are two types of the agent in our model. One is a service agents that offers some processing functions. The other is a mobile agent that moves among service agents. A manufacturing resource is modeled as one of the service agents since it provides manufacturing functions. On the other hand, each lot or production instruction information controlling production progress can be model as one of the mobile agents.