ppxscal/embedding_network huggingface dataset:
Diagnosability evaluation of systems using bipartite graph and matrix approach
Authors: M. F. Wani, O. P. Gandhi
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This paper presents a methodology for assessment of diagnosability of mechanical and hydraulic systems. The method is developed on the basis of relationships between system performance parameters and physical objects, that is, components of the system. These relationships are identified by system functional domain and are modeled in terms of a bipartite graph, called Diagnosability Bipartite Graph (DBG). A matrix called Diagnosability Matrix (DM) represents the DBG. Various diagnosability parameters of the system are derived from the DBG and the DM and these are useful in evaluation and comparison of design variants of the system. These parameters: are maximum number of set conflicts (MNS), maximum number of components in a set conflict (MNCS), diagnosability effort and cost (DEC), and average merit of diagnosability (AMD). The design having the lowest value of MNCS, AMD, and DEC; and highest value of MNS has the highest diagnosability. On the basis of these, a best design alternative is selected from diagnosability point of view. Moreover, components, which have poor diagnosability, are also identified. Maximum number of set conflicts (MNS) also guides in system fault diagnosis. The proposed procedure aids in the design and development of maintainable systems from diagnosability consideration. The method can also be used for evaluating and comparing the diagnosability of the systems. This method is illustrated with the help of two examples.
Neural Network-Based Signal Processing for Enhancing the Multi-Sensor Remote Sensing Imagery
Authors: Yuriy V. Shkvarko, José Luis Leyva Montiel, Luis Rizo, Joaquín Acosta Salas
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In this work, we intend to fill the existingmethodological-level gaps in the theory of the imagingradar (IR) for remote sensing (RS) systems byaddressing a novel look at the RS imaging as an ill-conditionedinverse problem with model uncertainties.We extend the theory presented in the previous studiesby developing the fused Bayesian-regularizationmethod for RS image formation subject to theprojection-type regularization constraints imposed onthe solution.Next, we propose to employ the neuralnetwork-based processing for efficient implementationof the developed radar image enhancing algorithmsand include some simulation examples to illustrate theoverall performances of the proposed approach.Ourstudy is intended to establish the foundation to assistin understanding the basic theoretical aspects fo themulti-level (Bayesian-regularization-neural-network-computing)optimization of the signal processingtechniques for enhancing the RS imagery.
Optimal Resource Allocation for the Quality Control Process
Authors: Pankaj Jalote, Bijendra Vishal
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Software development project employs some QualityControl (QC) process to detect and remove defects. Thefinal quality of the delivered software depends on the effortspent on all the QC stages. Given a quality goal, differentcombinations of efforts for the different QC stages may leadto the same goal. In this paper we address the problem ofallocating resources to the different QC stages, such thatthe optimal quality is obtained. We propose a model for thecost of QC process and then view the resource allocationamong different QC stages as an optimization problem. Wesolve this optimization problem using non-linear optimization technique of Sequential Quadratic Programming. Wealso give examples to show how a sub-optimal resource allocation may either increase the resource requirement significantly or lower the quality of the final software.
Measuring cohesion of packages in Ada95
Authors: Baowen Xu, Zhenqiang Chen, Jianjun Zhao
Venue: Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies (2003)

Ada95 is an object-oriented programming language. Pack-ages are basic program units in Ada 95 to support OO programming, which allow the specification of groups of logically related entities. Thus, the cohesion of a package is mainly about how tightly the entities are encapsulated in the package. This paper discusses the relationships among these entities based on dependence analysis and presents the properties to obtain these dependencies. Based on these, the paper proposes an approach to measure the package cohesion, which satisfies the properties that a good measure should have.
Reduced Cu interface diffusion by CoWP surface coating
Authors: C.-K. Hu, L. Gignac, R. Rosenberg, E. Liniger, J. Rubino, C. Sambucetti, A. Stamper, A. Domenicucci, X. Chen
Venue: Microelectronic Engineering (2003)

Electromigration in Cu interconnections with a 10-nm thick selective electroless CoWP coating on the top surface of Cu dual damascene lines has been investigated. The grain structures of the lines embedded in SiLK semiconductor dielectric ranged from bamboo-like to polycrystalline. CoWP coated structures exhibited a greatly improved Cu electromigration lifetime which was attributed to a reduction in Cu interface diffusion.
Conditional independence structures and graphical models
Authors: Barbara Vantaggi
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

In this paper we study conditional independence structures arising from conditional probabilities and lower conditional probabilities. Such models are based on notions of stochastic independence apt to manage also those situations where zero evaluations on possible events are present: this is particularly crucial for lower probability.The "graphoid" properties of such models are investigated, and the representation problem of conditional independence structures is dealt with by generalizing the well-known classic separation criteria for undirected and directed acyclic graphs. Our graphical models describe the independence statements and the possible logical dependencies among the random variables.
Agent Services Matchmaking for Cooperation
Authors: Hongen Lu
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

To form agent cooperation in an open environment, suchas the Internet, is extremely difficult, despite agent serviceis one of the main forces to drive the Web into a growingmarketplace of services. In this paper, a method to combineagent services matchmaking and cooperation is proposed.For flexible and semantic matchmaking, multiple strategiesare provided; and based on the results of matchmaking, aNaive Bayesian model is given for agents to form cooperation.This approach, which considers matchmaking andcooperation formation as one process, brings a new anglefor us to solve the connection problem for agents to workcollaboratively in a dynamic and open environment, suchas the World Wide Web.
Using usability factors to predict the e-commerce user experience
Authors: Adrie Stander, Nata van der Merwe
Venue: Computing information technology: the human side (2003)

This chapter introduces the use of usability factors as a means of predicting the e-commerce user experience. It argues objectively measurable usability factors, such as page layout, navigation techniques, privacy statements and color can be used to predict how a user of an e-commerce Website will experience the interaction with the site. In support for this argument, it reports on the results of a small pilot study that was done to determine the feasibility of a more extensive study aimed at building a model for the prediction of the user experience. The authors hope a better understanding of the intricate relationship between usability factors and the subjective user experience will lead to the design of more successful e-commerce Websites.
Self-stabilizing timestamps
Authors: Uri Abraham
Venue: Theoretical Computer Science (2003)

The problem of implementing self-stabilizing timestamps with bounded values is investigated and a solution is found which is applied to the l-exclusion problem and to the Multiwriter Atomic Register problem. Thus we get self-stabilizing solutions to these two well-known problems. A new type of weak timestamps is identified here, and some evidence is brought to show its usefulness.
An automatic decision-logic-table processor
Authors: Donald J. Lemoine
Venue: ACM SIGPLAN Notices (1971)

The value of decision-logic-tables as a tool for computer programming has been brought forth by the development of several programming languages. The well-known decision-logic-table programming languages are designed as input to translators. Instead of converting the input decision-logic tables to an executable form, these translators convert the source program to some other well-known language, such as Fortran. The appropriate compiler then converts the resulting source-language program to an executable form.The DEcision Logic TAble programming language, Delta, described here, is an automatic decision table processor, eliminating the need to translate the input into some intermediate source language. Basic features of decision-logic tables are used as a foundation for Delta. The syntax of Delta is similar to that of PL/I. Although Delta is limited in scope, it is expandable. Derived from the Purdue University Fast Fortran Translator, Pufft, the Delta processor performs both a syntax analysis and generates code, in one pass. The code generated is not machine language, but is an internal representation of the object language program.
Polynomial algorithm for finding the largest independent sets in graphs without forks
Authors: V. E. Alekseev
Venue: Discrete Applied Mathematics (2004)

A fork is a graph that is obtained from K1,3 by subdividing one edge. It is known [6-8] that for K1,3-free graphs the problem of finding the largest independent set can be solved in a polynomial time. In this paper, we prove that this is also true for the wider class of fork-free graphs.
Sylvester equations and projection-based model reduction
Authors: K. Gallivan, A. Vandendorpe, P. Van Dooren
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper, we establish a connection between Krylov subspace techniques for Multipoint Padé interpolation, and the use of Sylvester equations for constructing reduced-order models. We also briefly point Out that this connection partly extends to ADI-type techniques and to the Smith iteration for computing approximate solutions of Lyapunov equations.
Biometrics and Network Security
Authors: Paul Reid
Venue:  (2003)

The complete guide to implementing biometric security solutions for your networkNetwork security has become the latter-day equivalent of oxymoronic terms like "jumbo shrimp" and "exact estimate." Newspaper headlines are routinely peppered with incidents of hackers thwarting the security put forth by the government and the private sector. As with any new technology, the next evolution of network security has long languished in the realm of science fiction and spy novels. It is now ready to step into the reality of practical application.In Biometrics for Network Security, biometrics security expert Paul Reid covers a variety of biometric options, ranging from fingerprint identification to voice verification to hand, face, and eye scanning. Approaching the subject from a practitioner's point of view, Reid describes guidelines, applications, and procedures for implementing biometric solutions for your network security systems.Coverage includes: An introduction to authentication technologies and biometrics Dealing with privacy issues Biometric technologies, including finger, hand geometry, handwriting, iris, retina, voice, and face Security concerns related to biometrics, including attempts to spoof or fake results Deployment of biometric security systems, including vendor selection and roll out procedures Real-life case studiesFor security, system, and network administrators and managers, as well as anyone who is interested in the application of cutting-edge biometric technology, Biometrics for Network Security will prove an indispensable addition to your library!
Nodes of topicality: modeling user notions of on topic documents
Authors: Howard Greisdorf, Brian O'Connor
Venue: Journal of the American Society for Information Science and Technology (2003)

Topicality, while demonstrably an empirically manageable variable of investigation, engenders aspects of cognitive complexity that may, or may not, be easily managed during user interactions with IR systems. If an item retrieved from an IR system is considered to be on topic by a user, the meaning of that judgment may imply other underlying criteria. What makes an item on topic for users is the subject of this investigation. Although topicality has served to generate a great deal of attention in the body of information science literature, the meaning of topicality to IR system users has suffered from a lack of full understanding in designing more effective approaches to information search and retrieval. This investigation takes an inductive approach to the deductive extraction of characteristics that describe and explain how items retrieved from interactions with IR systems can be considered as on topic.
Knowledge base for finite-element mesh design learned by inductive logic programming
Authors: Bojan Dolšak, Ivan Bratko, Anton Jezernik
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This paper addresses an important application of machine learning (ML) in design. One of the major bottlenecks in the process of engineering analysis by using the finite-element method&mdash;a design of the finite-element mesh&mdash;was a subject of improvement. Defining an appropriate geometric mesh model that ensures low approximation errors and avoids unnecessary computational overhead is a very difficult and time-consuming task based mainly on the user's experience. A knowledge base for finite-element mesh design has been constructed using the ML techniques. Ten mesh models have been used as a source of training examples. The mesh dataset was probably the first real-world relational dataset and became one of the most widely used training set for experimenting with inductive logic programming (ILP) systems. After several experiments with different ML systems in the last few years, the ILP system CLAUDIEN was chosen to construct the rules for determining the appropriate mesh resolution values. The ILP has been found to be an effective approach to the problem of mesh design. An evaluation of the resulting knowledge base shows that the mesh design patterns are captured well by the induced rules and represent a solid basis for practical application. The aim of this paper is not only to present the real-life ML application to design, but also to describe and discuss a relation of the work being done to the topic of this special issue: the proposed &ldquo;dimensions&rdquo; of ML in design.
Pushout complements for partly total algebras
Authors: Peter Burmeister, Mercè Llabrés, Francesc Rosselló
Venue: Mathematical Structures in Computer Science (2002)

Let &Sigma; be an arbitrary signature and &Upsi; be a non-empty set of operation symbols within it. A (partial) &Sigma;-algebra is &Upsi;-total when all its operations in &Upsi; are total: these are the partly total algebras in the title, and they include total algebras and attributed graphs. In this paper we establish a necessary and sufficient condition on a pair of homomorphisms of &Upsi;-total &Sigma;-algebras for the existence of a pushout complement of them. This solves the application problem for the double-pushout transformation of these kinds of structure.
Secure data storing in a pool of vulnerable servers
Authors: Marcin Gogolewski, Mirosław Kutyłowski
Venue: Artificial intelligence and security in computing systems (2003)

Secure storing of data is a much more challenging task than encryption with a secret key. These data can be destroyed (for instance through overwriting) either by an external adversary or by the administrator of the data server. If such an attack is deployed only occasionally, for a well chosen data, then a hardware fault can be blamed for the loss of data. Therefore effective countermeasures are to be deployed.In order to elude the threat described one may store multiple copies of data in a pool of data servers. However, in order to limit the costs, the number of copies must be limited. Again, this provides a chance for an adversary to attack only the few servers actually storing the copies of data relevant for him.In this paper we design a simple and elegant method for secure storing of encrypted data based on Rackoff-Simon onion protocol used previously against traffic analysis. Our protocol works in an environment where the servers and the clients communicate through a shared communication channel which provides anonymity of the sender (such as an Ethernet bus). The protocol uses only standard symmetric and asymmetric encryption schemes. The protocol presented in this paper guarantees that (a) the user alone chooses where the data is stored, the number of copies can be determined immediately before storing the data, (b) the server storing the data has no knowledge about other servers storing the same data, (c) consistency: either all or no copy of the data is stored by the honest servers (i.e. the servers not overrun by an adversary), (d) the client and each server that has to store the data sends exactly one message, (e) with high probability the system is immune against adversaries that may gain control over a limited number of servers.
Weaknesses of Lee-Li-Hwang's hash-based password authentication scheme
Authors: Wei-Chi Ku, Chien-Ming Chen, Hui-Lung Lee
Venue: ACM SIGOPS Operating Systems Review (2003)

Many password authentication schemes employ hash functions as their basic building blocks to achieve better efficiency. In 2000, Peyravian and Zunic proposed a hash-based password authentication scheme that is efficient and can be easily implemented. Recently, Lee, Li, and Hwang demonstrated that Peyravian-Zunic's hash-based password authentication scheme is vulnerable to the off-line guessing attack, and then proposed an improved version. In this article, we show that their improved scheme is still vulnerable to the off-line guessing attack, the denial-of-service attack, and the stolen-verifier attack.
Euclid and PASCAL
Authors: Ted Venema, Jim des Rivieres
Venue: ACM SIGPLAN Notices (1978)

The programming language Euclid was intended for writing system programs that could be verifiable by state-of-the-art verification methods. Since verification was not an explicit goal in the design of Pascal, it is not surprising that this gave rise to differences between the two languages. The Euclid designers intended to change Pascal only where it fell short of this goal. This paper examines differences in the two languages in the light of this objective. These differences are roughly grouped under the headings verification, system programming, and user-oriented changes.
An experimental multilingual speech translation system
Authors: Kenji Matsui, Yumi Wakita, Tomohiro Konuma, Kenji Mizutani, Mitsuru Endo, Masashi Murata
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

In this paper, we describe an experimental speech translation system utilizing small, PC-based hardware with multi-modal user interface. Two major problems for people using an automatic speech translation device are speech recognition errors and language translation errors. In this paper we focus on developing techniques to overcome these problems. The techniques include a new language translation approach based on example sentences, simplified expression rules, and a multi-modal user interface which shows possible speech recognition candidates retrieved from the example sentences. Combination of the proposed techniques can provide accurate language translation performance even if the speech recognition result contains some errors. We propose to use keyword classes by looking at the dependency between keywords to detect the misrecognized keywords and to search the example expressions. Then, the suitable example expression is chosen using a touch panel or by pushing buttons. The language translation picks up the expression in the other language, which should always be grammatically correct. Simplified translated expressions are realized by speech-act based simplifying rules so that the system can avoid various redundant expressions. A simple comparison study showed that the proposed method outputs almost 2 to 10 times faster than a conventional translation device.
An SM2/MSP/n/r System with Random-Service Discipline and a Common Buffer
Authors: A. V. Pechinkin, S. I. Trishechkin
Venue: Automation and Remote Control (2003)

A multi-server queueing system with a semi-Markov input flow of two types of customers, Markov service, a common buffer of finite capacity, and random-service discipline is investigated. The method of Markov imbedded chain is applied to find the stationary distribution of the main service characteristics of this system. By way of example, a system with phase-type service time distribution is given.
Control and responsiveness in Hermes
Authors: R. A. McBride, Jacob Slonim
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Hermes is a process-oriented language that supports both blocking and nonblocking communication. This paper examines some constructs that can be used to introduce time limits on interprocess communication in Hermes. Currently, exceptions can only be signaled between processes in conjunction with a blocking send. A suggestion is given for a method of decoupling exceptions from interprocess communication. Several features in Ada are used to supply guidelines for additions to the Hermes language. These new constructs could improve the responsiveness of a system of Hermes processes and would facilitate the use of Hermes as a tool for constructing real time systems.
Computers in popular literature no. 8
Venue: ACM SIGCAS Computers and Society (1975)

Computers in Popular literature will appear as a regular feature of the reviews section of computers & society if there is sufficient reader interest. Terry Kuch has volunteered to head up this function and solcits revies, brief notices, and bibliographies from all comers. 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
A Health Information System in Fiji -- Discussion on the Implementation of a National Health Number and the Methodology of Synchronizing a Number of Remote Databases
Authors: Peter G. Kerrison
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This paper is based on experience with the design and implementation of the Patient Information System (patient based) (PATIS) that is being implemented across medical facilities in Fiji with the financial assistance of the Australian Government Overseas Aid Agency (AusAID) and the Government of Fiji.The paper initially outlines the scope and technical infrastructure of the PATIS in Fiji before focusing on two fundamental areas of the system.The implementation of a National Health Number (NHN) is discussed in detail outlining the objectives, production, implementation strategies, problems encountered and solutions applied.To implement an NHN it was necessary to design a reliable, but affordable, methodology to synchronise the medical information across multiple facilities on a nightly basis. The paper discusses the innovative use of "off the shelf" products to effectively synchronise multipledatabases, how the system is structured and monitored and various issues that have arisen since implementation.