ppxscal/embedding_network huggingface dataset:
Fault Diagnosis of Digital Systems - a Review
Authors: R. G. Bennetts, D. W. Lewin
Venue: Computer (1971)

The increasing complexity of digital systems over the past decade has been accompanied by a growing awareness of the need for efficient fault diagnosis, as proved by the ever increasing literature published on the subject. The paper is based on 86 referenced sources and its main function is to review the published methods of deriving diagnostic test sequences, indicating the advantages and disadvantages of each technique. In so doing, it traces the interaction between the diagnostic techniques that have evolved and their influence on the design philosophy of digital systems at all levels. It is apparent from the review that there exists a requirement for a unified theory of diagnosis compatible with, and complementary to current design techniques based on switching theory and ways are suggested in which this might be achieved.
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
Authors: Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

A synchronizer with a phase counter (sometimes called asynchronous phase clock) is an asynchronous distributed algorithm, where each node maintains a local ‘pulse counter’ that simulates the global clock in a synchronous network. In this paper we present a time optimal self-stabilizing scheme for such a synchronizer, assuming unbounded counters. We give a simple rule by which each node can compute its pulse number as a function of its neighbors’ pulse numbers. We also show that some of the popular correction functions for phase clock synchronization are not self-stabilizing in asynchronous networks. Using our rule, the counters stabilize in time bounded by the diameter of the network, without invoking global operations. We argue that the use of unbounded counters can be justified by the availability of memory for counters that are large enough to be practically unbounded, and by the existence of reset protocols that can be used to restart the counters in some rare cases where faults will make this necessary.
Generation of a Clock Pulse for Asynchronous Sequential Machines to Eliminate Critical Races
Authors: J. G. Bredeson, P. T. Hulina
Venue: IEEE Transactions on Computers (1971)

A circuit for generating a clock pulse for asynchronous circuits is given, and when used with transition sensitive flip-flops eliminates critical races for an arbitrary state assignment. Thus the minimum number of internal variables may be used. Furthermore, logic and sequential hazards will not affect the circuit performance.
Convex optimization of error probability of multi-antenna broadcast channel
Authors: Haibo Wang, Abhijit Sinha, Thia Kirubarajan
Venue: Signal Processing (2008)

In this paper, we propose a nonlinear convex optimization problem to minimize the average probability of error of all the users, subject to the peak or the average power constraints in the multi-input-multi-output broadcast channel. The proposed transmitter represents a nonlinear one-to-one mapping between the transmitted data vector and the symbol vector. The transmitted data vector going through the base station antennas is obtained as a solution to the proposed convex error probability optimization problem that can be solved using computationally efficient interior point algorithms. It is proved that the proposed transmitter is always optimal unless the signal-to-noise ratio (SNR) is too low or the channel is nearly singular. Simulation results demonstrate that the proposed transmission scheme significantly improves the probability of error as compared to several earlier approaches to multi-antenna broadcast transmitter design.
Graphical Representations of Message Exchange in Online Collaborative Environments: Uncovering Implicit Knowledge
Authors: Rita de Cássia Romeiro Paulino, Vínicius Medina Kern
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Communication in online collaborative environments such as communities of practice, discussion lists, or institutional e-mail repositories hide information and knowledge that is imperceptible to the individual, despite the effort made in the storage of messages. This paper presents and ongoing work on the graphical representation of aspects of communication in online collaborative environments, aimed at uncovering the implicit knowledge hidden in the archived messages. We review the literature on graphical representation of information in online collaborative environments, followed by a pilot study on the extraction and filtering of messages of a community of practice, with rules for the graphical representation of frequent terms used in the messages and of the evolution of those frequencies in time. The graphical representation allows for the understanding of qualitative aspects of communication, such as the identification of hot topics and trends, and the forming of social networks among the participants. Keywords : Visualization, implicit knowledge, social networks, asynchronous communication, communities of practice, knowledge management
Formal Verification of Consistency between Feature Model and Software Architecture in Software Product Line
Authors: Tonny Kurniadi Satyananda, Danhyung Lee, Sungwon Kang
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

During software development process, software artifacts are produced. Consistency among these artifacts should be verified to ensure error-free product. In software product line development, consistency becomes more important because commonalities and variabilities increase the complexity of relationship among artifacts. In this paper, we present a formal approach to verification of consistency between feature model and component and connector view of software architecture. By utilizing Prototype Verification System (PVS), we introduce our model of feature description and architecture description, and illustrate the consistency verification approach using a digital watch product line example.
On Broadcasting in Wireless Sensor Networks with Irregular and Dynamic Radio Coverage
Authors: Li-Chun Hsu, Chung-Ta King, Amit Banerjee
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Broadcast in radio-based wireless networks has been a difficult problem. When a node broadcasts, all nodes within its radio coverage will attempt to relay the message by rebroadcasting, causing excessive radio communication in the region that leads to the broadcast storm problem. Most previous solutions assumed a perfect radio condition with a static, circular coverage. However, in real situations, radio signals are very dynamic and irregular in their coverage. This is especially true for wireless sensor networks, which usually employ low quality radio modules to reduce the cost. Assuming no location information is available, we approach the problem in this paper from two aspects: space and time. To solve the irregularity in space in radio coverage, we propose a scheme that is able to find the neighbors on the rim of the irregular radio coverage region to narrow down the choices of the forwarders. To solve the dynamic in radio coverage, we consider an on-demand, stateless strategy to reduce the overhead of maintaining the state information. Through simulation, we compare the resultant algorithm, called RIM, with Double-Covered Broadcast (DCB) [10], one of the best algorithms proposed so far. The results show that under dense deployment and irregular and dynamic radio coverage, our algorithm performs better.
Knowledge discovery in financial investment for forecasting and trading strategy through wavelet-based SOM networks
Authors: Sheng-Tun Li, Shu-Ching Kuo
Venue: Expert Systems with Applications: An International Journal (2008)

The stock market has been a popular financial investment channel in the recent era of low interest rates. How to maximize profits is always the main concern for investors; and different investors have different preferences about the holding periods of their investments. In this study, in contrast to other related studies, we propose a hybrid approach on the basis of the knowledge discovery methodology by integrating K-chart technical analysis for feature representation of stock price movements, discrete wavelet transform for feature extraction to overcome the multi-resolution obstacle, and a novel two-level self-organizing map network for the underlying forecasting model. In particular, a visual trajectory analysis is conducted to reveal the relationship of movements between primary bull and bear markets and help determine appropriate trading strategies for short-term investors and trend followers. The forecasting accuracy and trading profitability of the proposed decision model is validated by performing experiments using the Taiwan Weighted Stock Index (TAIEX) from 1991 to 2002 as the target dataset. The resultant intelligent investment model can help investors, fund managers and investment decision-makers of national stabilization funds make profitable decisions.
Semi-Automatic Region-Based Memory Management for Real-Time Java Embedded Systems
Authors: Guillaume Salagnac, Christophe Rippert, Sergio Yovine
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper we address the problem of dynamic memory management in real-time Java embedded systems. Our work aims at suppressing the need for garbage collection in order to avoid unpredictable pause times. For that we use a simple static analysis algorithm coupled with region-based memory management as presented in [15]. To overcome the well-known limitations of region inference, we propose in this paper to involve the developer in the analysis process by providing feedback on programming constructs likely to produce memory leaks. Experiments show that for most programming patterns, our system behaves as efficiently as a garbage collector in terms of memory consumption. Our analysis tool is furthermore able to provide useful feedback to the programmer to pinpoint problematic constructs.
The RAM Enhanced Disk Cache Project (REDCAP)
Authors: Pilar Gonzalez-Ferez, Juan Piernas, Toni Cortes
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

This paper presents the RAM Enhanced Disk Cache Project, REDCAP, a new cache of disk blocks which reduces the read I/O time by using a small portion of the main memory. The essential ideas behind REDCAP are to enlarge the built-in cache of the disk drive, imitate its behavior, and take advantage of its read-ahead mechanism by prefetching disk blocks. REDCAP is intended to be I/O- time efficient, and implements an activation-deactivation algorithm which turns its cache on and off dynamically depending on the I/O time improvement achieved. REDCAP has been implemented in the Linux kernel. The experimental results show that our proposal reduces the application time by up to 80%for workloads which exhibit some spatial locality, while it has the same performance as a traditional system for those workloads which have a random access pattern, or perform large sequential reads.
An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks
Authors: D. C. Schmidt
Venue: IEEE Transactions on Computers (1974)

There are a number of methods which use a clause table to generate the prime implicants of a switching function. This paper describes a technique for extending the clause table approach to the minimization of multi-terminal networks. The specific extension described here extends the algorithm of Slagle et al. to generate the important implicants of a set of switching functions and to determine a minimum realization.
Traffic grooming, routing, and wavelength assignment in WDM transport networks with sparse grooming resources
Authors: Osama Awwad, Ala I. Al-Fuqaha, Ammar Rayes
Venue: Computer Communications (2007)

While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-per-second transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NP-Complete since it is a generalization of the RWA problem which is known to be NP-Complete. We propose an integer linear programming (ILP) model that accurately depicts the GRWA problem. Because it is very hard to find a solution for large networks using ILP, we solve the GRWA problem by proposing two novel heuristics. The strength of the proposed heuristics stems from their simplicity, efficiency, and applicability to large-scale networks. Our simulation results demonstrate that deploying traffic grooming resources on the edge of optical networks is more cost effective and results in a similar blocking performance to that obtained when distributing the grooming resources throughout the optical network domain.
A PSO-Based Multicast Routing Algorithm
Authors: Ziqiang Wang, Xia Sun, Dexian Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Multicast routing problem arises in many multimedia communication applications, computing the band-width-delay constrained least cost multicast routing tree is an NP-complete problem. In this paper, a novel multicast routing algorithm based on the particle swarm optimization (PSO) algorithm is proposed. The experimental results show that this algorithm has better performance and efficiency.
An meg study of silent meaning
Authors: Liina Pylkkänen, Brian McElree
Venue: Journal of Cognitive Neuroscience (2007)

Although research on the neural bases of language has made significant progress on how the brain accesses the meanings of words, our understanding of sentence-level semantic composition remains limited. We studied the magnetoencephalography (MEG) responses elicited by expressions whose meanings involved an element not expressed in the syntax, which enabled us to investigate the brain correlates of semantic composition without confounds from syntactic composition. Sentences such as the author began the book, which asserts that an activity was begun although no activity is mentioned in the syntax, were contrasted with control sentences such as the author wrote the book, which involved no implicit meaning. These conditions were further compared with a semantically anomalous condition (the author disgusted the book). MEG responses to the object noun showed that silent meaning and anomaly are associated with distinct effects, silent meaning, but not anomaly, eliciting increased amplitudes in the anterior midline field (AMF) at 350--450 msec. The AMF was generated in ventromedial prefrontal areas, usually implicated for social cognition and theory of mind. Our results raise the possibility that silent meaning interpretation may share mechanisms with these neighboring domains of cognition.
The Noisy Substring Matching Problem
Authors: R. L. Kashyap
Venue: IEEE Transactions on Software Engineering (1983)

Let T(U) be the set of words in the dictionary H which contains U as a substring. The problem considered here is the estimation of the set T(U) when U is not known, but Y, a noisy version of U is available. The suggested set estimate S*(Y) of T(U) is a proper subset of H such that its every element contains at least one substring which resembles Y most according to the Levenshtein metric. The proposed algorithm for-the computation of S*(Y) requires cubic time. The algorithm uses the recursively computable dissimilarity measure Dk(X, Y), termed as the kth distance between two strings X and Y which is a dissimilarity measure between Y and a certain subset of the set of contiguous substrings of X. Another estimate of T(U), namely SM(Y) is also suggested. The accuracy of SM(Y) is only slightly less than that of S*(Y), but the computation time of SM(Y) is substantially less than that of S*(Y). Experimental results involving 1900 noisy substrings and dictionaries which are subsets of 1023 most common English words [11] indicate that the accuracy of the estimate S*(Y) is around 99 percent and that of SM(Y) is about 98 percent.
Ensemble Neural Networks Using Interval Neutrosophic Sets and Bagging
Authors: Pawalai Kraipeerapun, Chun Che Fung, Kok Wai Wong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper presents an approach to the problem of binary classification using ensemble neural networks based on interval neutrosophic sets and bagging technique. Each component in the ensemble consists of a pair of neural networks trained to predict the degree of truth and false membership values. Uncertainties in the prediction are also estimated and represented using the indeterminacy membership values. These three membership values collectively form an interval neutrosophic set. In order to combine and classify outputs from components in the ensemble, the outputs of an ensemble are dynamically weighted and summed. The proposed approach has been tested with three benchmarking UCI data sets, which are ionosphere, pima, and liver. The proposed ensemble method improves the classification performance as compared to the simple majority vote and averaging methods which were applied only to the truth membership value. Furthermore, the results obtained from the proposed ensemble method also outperform the results obtained from a single pair of networks and the results obtained from a single truth network.
Experience with Modular Concurrent Programming
Authors: P. B. Hansen
Venue: IEEE Transactions on Software Engineering (1977)

This paper summarizes the initial experience with the programming language Concurrent Pascal in the design of three model operating systems. A Concurrent Pascal program consists of modules called processes, monitors, and classes. The compiler checks that the data structures of each module are accessed only by the operations defined in the module. The author emphasizes that the creative aspect of program construction is the initial selection of modules and the connection of them into hierarchical structures. By comparison the detailed implementation of each module is straightforward. The most important result is that it is possible to build a concurrent program of one thousand lines out of one-page modules that can be comprehended at a glance.
Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions
Authors: Vitaly Feldman
Venue: The Journal of Machine Learning Research (2007)

We consider the problems of attribute-efficient PAC learning of two well-studied concept classes: parity functions and DNF expressions over {0,1}n. We show that attribute-efficient learning of parities with respect to the uniform distribution is equivalent to decoding high-rate random linear codes from low number of errors, a long-standing open problem in coding theory. This is the first evidence that attribute-efficient learning of a natural PAC learnable concept class can be computationally hard. An algorithm is said to use membership queries (MQs) non-adaptively if the points at which the algorithm asks MQs do not depend on the target concept. Using a simple non-adaptive parity learning algorithm and a modification of Levin's algorithm for locating a weakly-correlated parity due to Bshouty et al. (1999), we give the first non-adaptive and attribute-efficient algorithm for learning DNF with respect to the uniform distribution. Our algorithm runs in time Õ(ns4/ε) and uses Õ(s4 · log2n/ε) non-adaptive MQs, where s is the number of terms in the shortest DNF representation of the target concept. The algorithm improves on the best previous algorithm for learning DNF (of Bshouty et al., 1999) and can also be easily modified to tolerate random persistent classification noise in MQs.
AQuery: query language for ordered data, optimization techniques, and experiments
Authors: Alberto Lerner, Dennis Shasha
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

An order-dependent query is one whose result (interpreted as a multiset) changes if the order of the input records is changed. In a stock-quotes database, for instance, retrieving all quotes concerning a given stock for a given day does not depend on order, because the collection of quotes does not depend on order. By contrast, finding a stock's five-price moving-average in a trades table gives a result that depends on the order of the table. Query languages based on the relational data model can handle order-dependent queries only through add-ons. SQL:1999, for instance, has a new "window" mechanism which can sort data in limited parts of a query. Add-ons make order-dependent queries di_cult to write and to optimize. In this paper we show that order can be a natural property of the underlying data model and algebra. We introduce a new query language and algebra, called AQuery, that supports order from-the-ground-up. New order-related query transformations arise in this setting. We show by experiment that this framework - language plus optimization techniques - brings orders-of-magnitude improvement over SQL:1999 systems on many natural order-dependent queries.
Comparing usability of one-way and multi-way constraints for diagram editing
Authors: Michael Wybrow, Kim Marriott, Linda Mciver, Peter J. Stuckey
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

We investigate the usability of constraint-based alignment and distribution placement tools in diagram editors. Currently one-way constraints are used to provide alignment and distribution tools in many commercial editors. We believe the limitations of these constraints lead to serious usability issues, and thus suggest that such tools be implemented using multi-way constraints. We have conducted two usability studies, the first studies we are aware of that examine the relative usefulness of interactive graphical tools based on one-way and multi-way constraints. They provide strong evidence that multi-way constraint-based alignment and distribution tools are more usable than one-way constraint-based alignment and distribution tools.
Tooth alignment of the dental cast using 3D thin plate spline
Authors: Chanjira Sinthanayothin, Wisarut Bholsithi, Wichit Tharanon
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This article has described the process for tooth alignment using 3D thin plate spline. First step is to simulate the individual tooth and its landmarks and fit it into the dental cast by geometric transformation of individual tooth. Next step is to align the simulated teeth into proper arch form. After that, record pairs the landmarks of simulated teeth before and after tooth alignment. The final step is to create the new dental cast (warping dental cast) by applying 3D thin plate spline technique through pairs of landmarks on simulated teeth as inputs. The results of the tooth alignment and the comparison with the dental cast before tooth alignment have shown that the teeth aligned along the curve while the gum was slightly deformed to show the smoothness of transformation on teeth and gum.