ppxscal/embedding_network huggingface dataset:
A Simple and Efficient Randomized Byzantine Agreement Algorithm
Authors: B. Chor
Venue: IEEE Transactions on Software Engineering (1985)

A new randomized Byzantine agreement algorithm is presented. This algorithm operates in a synchronous system of n processors, at most t of which can fail. The algorithm reaches agreement in 0(t/log n) expected rounds and O(n2tf/log n) expected message bits independent of the distribution of processor failures. This performance is further improved to a constant expected number of rounds and O(n2) message bits if the distribution of processor failures is assumed to be uniform. In either event, the algorithm improves on the known lower bound on rounds for deterministic algorithms. Some other advantages of the algorithm are that it requires no cryptographic techniques, that the amount of local computation is small, and that the expected number of random bits used per processor is only one. It is argued that in many practical applications of Byzantine agreement, the randomized algorithm of this paper achieves superior performance.
Active learning for microarray data
Authors: D. Vogiatzis, N. Tsapatsoulis
Venue: International Journal of Approximate Reasoning (2008)

In supervised learning it is assumed that it is straightforward to obtain labeled data. However, in reality labeled data can be scarce or expensive to obtain. Active learning (AL) is a way to deal with the above problem by asking for the labels of the most ''informative'' data points. We propose an AL method based on a metric of classification confidence computed on a feature subset of the original feature space which pertains especially to the large number of dimensions (i.e. examined genes) of microarray experiments. DNA microarray expression experiments permit the systematic study of the correlation of the expression of thousands of genes. Feature selection is critical in the algorithm because it enables faster and more robust retraining of the classifier. The approach that is followed for feature selection is a combination of a variance measure and a genetic algorithm. We have applied the proposed method on DNA microarray data sets with encouraging results. In particular we studied data sets concerning: small round blue cell tumours (4 types), Leukemia (2 types), lung cancer (2 types) and prostate cancer (healthy, unhealthy)
BFALCON Generalization Capability Improvement Based on PCA Initialization
Authors: Jie Xing, Deyun Xiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Fuzzy Adaptive Learning Control Network (FALCON) may lack in generalization capability for the typical initialization based on Adaptive Resonance Theory (ART). Aiming at this problem, a new initialization of FALCON based on the Principle Component Analysis (PCA) is proposed in this paper. After specific analysis of topological structure of FALCON and the existing initialization based on the ART, FALCON is initialized based on the statistical results of PCA. Subsequently, a set of complete computation algorithm, which can improve the generalization capability of FALCON, is provided with term neuron distribution, pretreatment and post-treatment. Then, a Metropolis learning coefficient is introduced into the supervised learning algorithm of FALCON. Eventually, being applied to real problem, the FALCON initialized based on PCA is prove to have a better generalization capability than the typical neural networks.
Generating Java Compiler Optimizers Using Bidirectional CTL
Authors: Ling Fang, Masataka Sassa
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementations has been done for any real programming language. In this paper, we present a system that generates a Java optimizer from specifications in temporal logic. The specification is simpler, and the generated optimizers run more efficiently than previously reported work. We implemented a new model checker for a bidirectional CTL (computational tree logic) called CTL"b"d, which is equivalent to CTL-FV [Lacey, D., Jones, N.D., Van Wyk, E. and Frederiksen, C.C.: Compiler optimization correctness by temporal logic. Higher-Order and Symbolic Computation, Vol. 17, No. 3, pp. 173-206, 2004] after removing free variables. The model checker can check future and past temporal CTL operators symmetrically without any conversion. We also present a new specification language based on the bidirectional CTL that can express typical optimization rules very naturally. By adding rewriting conditions to allow for temporary variables and considering real-world language features such as exceptions, the system can perform optimization of Java programs. So far, a compiler optimizer using temporal logic was assumed to be impractical, because it consumes too much time. However, with our method, the generated Java compiler optimizer can compile seven of the SPECjvm98 benchmarks with a compile time from 4 seconds to 4 minutes.
Analysis of Fault Tolerance of Cellular Neural Networks and Applications to Image Processing
Authors: Lidan Wang, Xiaofan Yang, Shukai Duan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper initiates the study of fault tolerant properties of faulty cellular neural networks (CNNs). A class of CNNs with single faulty cell is established, which is successfully applied to image processing: noise removing and image reversion. A series of computer simulations demonstrate CNNs have satisfied fault tolerant properties for image processing.
Task Partitioning in Programmable Logic Systems
Authors: K. Rothmuller
Venue: Computer (1976)

The advent of low-cost microcomputer chip sets is having a dramatic impact on the direction of digital design. Except for very cost-sensitive products, most new designs are constructed utilizing programmable logic to replace more conventional random logic designs. The premise of this new logic form is based on the cost savings exhibited by solutions consisting of a small number of different LSI parts over those with many SSI/MSI parts performing the same functions. Low LSI parts costs are achieved by producing functions (e.g., RAM, ROM, processor, and I/O parts) with general utility so that each chip can be manufactured in very high volume. Logic functions are realized by specifying a set of step-by-step instructions which are executed sequentially by the processor. 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
An Extension of Norton's Theorem for Queueing Networks
Authors: S. Balsamo
Venue: IEEE Transactions on Software Engineering (1982)

Given a closed BCMP queueing network, the problem is considered of studying the behavior of any subsystem a without solving for the entire system. This paper proves that this is possible for a consisting of any number of queues, arbitrarily interfacing the rest of the system, thus generalizing the classic CHW theorem, also known as Norton's theorem. A general flow-equivalent solution procedure is given and its computational complexity is compared with that of the product-form and the exact aggregation procedure. The relative merits of these procedures are also expressed in terms of a's cardinality.
On Proving Sequential Machine Designs
Authors: S. K. Abdali
Venue: IEEE Transactions on Computers (1971)

Based on a program-proving technique, a method for proving sequential machine designs is presented. The method associates with each state of the machine an assertion about the sequences taking the machine into that state. The design is proved by: showing all assertions true irrespective of state changes; and deriving the design specifications from the assertions at final states. The method is illustrated' on two finite automata.
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols
Authors: Srečko Brlek, Sardaouna Hamadou, John Mullins
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

When modelling cryto-protocols by means of process calculi which express both nondeterministic and probabilistic behavior, it is customary to view the scheduler as an intruder. It has been established that the traditional scheduler needs to be carefully calibrated in order to more accurately reflect the intruder's capabilities for controlling communication channels. We propose such a class of schedulers through a semantic variant called PPC"@n"@s, of the Probabilistic Poly-time Calculus (PPC) of Mitchell et al. [J.C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 353:118-164, 2006] and we illustrate the pertinence of our approach by an extensive study of the Dining Cryptographers (DCP) [David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology, 1(1):65-75, 1988] protocol. Along these lines, we define a new characterization of Mitchell et al.'s observational equivalence [J.C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 353:118-164, 2006] more suited for taking into account any observable trace instead of just a single action as required in the analysis of the DCP.
Managing Software Development in Microprocessor Projects
Authors: C. S. Magers
Venue: Computer (1978)

Careful management of firmware development effort and selection of appropriate design tools can improve programmer productivity. 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
Andante
Authors: Richard E. Smith, Simon C. Lovell, David F. Burke, Rinaldo W. Montalvao, Tom L. Blundell
Venue: Bioinformatics (2007)

Motivation: The accurate placement of side chains in computational protein modeling and design involves the searching of vast numbers of rotamer combinations. Results: We have applied the information contained within structurally aligned homologous families, in the form of conserved χ angle conservation rules, to the problem of the comparative modeling. This allows the accurate borrowing of entire side-chain conformations and/or the restriction to high probability rotamer bins. The application of these rules consistently reduces the number of rotamer combinations that need to be searched to trivial values and also reduces the overall side-chain root mean square deviation (rmsd) of the final model. The approach is complementary to current side-chain placement algorithms that use the decomposition of interacting clusters to increase the speed of the placement process. Contact: res50@mole.bio.cam.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
Grid-based subspace clustering over data streams
Authors: Nam Hun Park, Won Suk Lee
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

A real-life data stream usually contains many dimensions and some dimensional values of its data elements may be missing. In order to effectively extract the on-going change of a data stream with respect to all the subsets of the dimensions of the data stream, a grid-based subspace clustering algorithm is proposed in this paper. Given an n-dimensional data stream, the on-going distribution statistics of data elements in each one-dimension data space is firstly monitored by a list of grid-cells called a sibling list. Once a dense grid-cell of a first-level sibling list becomes a dense unit grid-cell, new second-level sibling lists are created as its child nodes in order to trace any cluster in all possible two-dimensional rectangular subspaces. In such a way, a sibling tree grows up to the nth level at most and a k-dimensional subcluster can be found in the kth level of the sibling tree. The proposed method is comparatively analyzed by a series of experiments to identify its various characteristics.
Is the World Still Flat? An Update
Authors: Stephen Ruth, Anne Pizzato
Venue: IEEE Internet Computing (2007)

Writer Thomas L. Friedman sees "flatness" as a metaphor for innumerable global partnerships and greater leveraging of IT's immense potential. But his "dirty little secrets" suggest that the US needs to anticipate some serious internal challenges that could reduce long-term competitiveness.
What can identity-based cryptography offer to web services?
Authors: Jason Crampton, Hoon Wei Lim, Kenneth G. Paterson
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

Web services are seen as the enabler of service-oriented computing, a promising next generation distributed computing technology. Independently, identity-based cryptography is emerging as a serious contender to more conventional certificate-based public key cryptography. However, the application of identity-based cryptography in web services appears largely unexplored. This paper sets out to examine how identity-based cryptography might be used to secure web services. We show that identity-based cryptography has some attractive properties which naturally suit the message-level security needed by web services.
Guest Editors' Introduction: Tablet PC Technology--The Next Generation
Authors: Jane Prey, Alf Weaver
Venue: Computer (2007)

Early adopters in higher education have developed Tablet PC teaching platforms that incorporate active learning techniques and support in-class collaborations.
Estimating the Quality of Widely Used Software Products Using Software Reliability Growth Modeling: Case Study of an IBM Federated Database Project
Authors: Paul Luo Li, Randy Nakagawa, Rob Montroy
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Software producers can better manage the quality of their deployed software products using estimates of quality. Current best practices for making estimates are to use software reliability growth modeling (SRGM), which assumes that testing environments approximate deployment environments. This important assumption does not hold for widely used software products, which are operated in a wide variety of configurations under many different usage scenarios. However, the literature contains little empirical data on the impact of this violation of assumptions on the accuracy and the usefulness of predictions. In this paper, we report results and experiences using SRGM on an IBM federated database project. We examine defect data from 3 releases spanning approximately 9 years. We find SRGM to be of limited use to the project: absolute relative errors are at least 34%, and predictions are, at times, implausible. We discuss alternative approaches for estimating quality of widely used software products.
The unpredictable mobile phone
Authors: D. Miller
Venue: BT Technology Journal (2007)

A year-long ethnographic study of the use of mobile phones in Jamaica was conducted during 2004. Our findings, which are almost the exact opposite of the expectations that appear in The Economist and other sources in early 2005, are that, in Jamaica at least, the phones are not used to obtain jobs or to help individuals become entrepreneurs. For quite different reasons, however, mobile phones have become central to the survival strategies of the lowest income population. To understand why this should be, we need to examine how the phone fits within other forms of communication, and how both the phone and the phone call are evaluated. This is tantamount to asking how one person values their communication with another and under what conditions does communication become an end in itself?
Computing Point Enclosures
Authors: V. K. Vaishnavi
Venue: IEEE Transactions on Computers (1982)

Given a set of n rectangles in the plane, the point enclosure query is the question to determine for any point p which rectangles of the set it is contained in. It is the "dual" of the well-known range query in computational geometry. It is shown that the point enclosure query in the plane can be answered in 0(log n + k) time, where k is the number of rectangles reported. The solution makes use of a new data structure, called the S-tree. The data structure can be generalized to obtain an efficient algorithm for the point enclosure problem in d-dimensional space d = 2.
Software Standards
Authors: R. M. Poston
Venue: IEEE Software (1984)

Programmers often complain that standards are used to force everyone to do things just one way, foregoing all options. So just how necessary are these prescriptions?
Performance Measures for Evaluating Algorithms for SIMD Machines
Authors: L. J. Siegel
Venue: IEEE Transactions on Software Engineering (1982)

This paper examines measures for evaluating the performance of algorithms for single instruction stream-multiple data stream (SIMD) machines. The SIMD mode of parallelism involves using a large number of processors synchronized together. All processors execute the same instruction at the same time; however, each processor operates on a different data item. The complexity of parallel algorithms is, in general, a function of the machine size (number of processors), problem size, and type of interconnection network used to provide communications among the processors. Measures which quantify the effect of changing the machine-size/problem-size/network-type relationships are therefore needed. A number of such measures are presented and are applied to an example SIMD algorithm from the image processing problem domain. The measures discussed and compared include execution time, speed, parallel efficiency, overhead ratio, processor utilization, redundancy, cost effectiveness, speed-up of the parallel algorithm over the corresponding serial algorithm, and an additive measure called "sprice" which assigns a weighted value to computations and processors.
Efficient Analysis of DynAlloy Specifications
Authors: Marcelo F. Frias, Carlos G. Lopez Pombo, Juan P. Galeotti, Nazareno M. Aguirre
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2007)

DynAlloy is an extension of Alloy to support the definition of actions and the specification of assertions regarding execution traces. In this article we show how we can extend the Alloy tool so that DynAlloy specifications can be automatically analyzed in an efficient way. We also demonstrate that DynAlloy's semantics allows for a sound technique that we call program atomization, which improves the analyzability of properties regarding execution traces by considering certain programs as atomic steps in a trace. We present the foundations, case studies, and empirical results indicating that the analysis of DynAlloy specifications can be performed efficiently.
The Dramatic Impact of Silicon Technology
Authors: D. F. Allison
Venue: Computer (1971)

Approximately twelve years ago the first double-diffused silicon transistor was offered to the marketplace. These first transistors sold for $70.00. Today it is possible to purchase an integrated memory circuit with several thousand transistors plus several thousand resistors and diodes for less the original selling price of this first transistor. 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
Tailoring Infrastructure Software Product Lines by Static Application Analysis
Authors: Horst Schirmeier, Olaf Spinczyk
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Besides ordinary applications, also infrastructure software such as operating systems or database management systems is being developed as a software product line. With proper tool support these systems can be configured easily by selecting features in a feature model. However, in the future multi-level architectures of layered product lines will be common practice. For humans the feature-based configuration will become increasingly complex, as the number of configurable features will be tremendous. Our goal is to reduce this complexity. The approach is based on the observation that many configuration decisions could be automated by statically analyzing the code of layers on top of an infrastructure product line. Motivated by use cases the paper presents the concepts behind our analysis tool, which is able to automate the configuration in many cases. First results in the context of a feature-oriented version of the Berkeley DB illustrate the potential of this novel approach.
On the application of CAD technology for the synthesis of spatial revolute-revolute dyads
Authors: Kevin Russell, Wen-Tzong Lee, Raj S. Sodhi
Venue: Computer-Aided Design (2007)

This work presents a method based on Computer Aided Design or CAD for facilitating the synthesis of Revolute-Revolute (R-R) dyads with adjustable moving pivots. The CAD-based method presented in this work ensures that all prescribed rigid-body parameters used to synthesize the R-R dyad satisfy particular kinematic requirements of an R-R dyad. Through the application of this CAD method, five of the six general R-R dyad constraint equations are satisfied and therefore not essential for the synthesis of the R-R dyad. By reducing the number of dyad design constraints from six to one, the user can synthesize R-R links with adjustable moving pivots for multi-phase motion and path generation applications. The example included demonstrates the use of the CAD method in the synthesis of an RRSS path generator with adjustable moving pivots.
An interpolation-based watermarking scheme
Authors: V. Martin, M. Chabert, B. Lacaze
Venue: Signal Processing (2008)

Interpolation techniques are often designed to provide a good perceptual quality from known sample values. However, interpolation is essentially considered as a source of decoding errors for watermarking schemes. Conversely, this paper proposes an informed watermarking scheme based on interpolation. This scheme takes advantage of interpolation to generate imperceptible marks in the spatial domain. It can be related to random binning schemes with particular codebook and decoding rule. Theoretical performances are derived and informed embedding strategies are proposed. Two particular implementations based on bilinear and spline interpolation are then applied to image watermarking. The good robustness of these schemes to noise and valumetric attacks is confirmed by simulations. Finally, an attack is specifically designed to check the algorithm security.
Automatic Annotation for Korean--Approach Based on the Contextual Exploration Method
Authors: Hyunzoo Chai
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We present an automatic semantic annotation system for Korean based on the Contextual Exploration Method. Creating a morphological analyzer and part-of-speech tagger for the Korean language is difficult as it is a highly agglutinative language. Accordingly, processing Korean in the same order as inflectional languages -- morphological analysis, then syntactical and then semantic -- has not yielded satisfactory results. Our new method identifies semantic information in Korean text without going through the morphological and syntactical analysis steps. Our initial system properly annotates approximately 88% of standard Korean sentences, and this annotation rate holds across text domains. Previously, the Contextual Exploration Method has been applied successfully to languages as diverse as French and Arabic. Given our success with Korean, we believe that this method can be applied to other agglutinative languages such as Japanese, Turkish and Finnish.