ppxscal/embedding_network huggingface dataset:
An Algebraic Model of Arithmetic Codes
Authors: Chung Ho Chen
Venue: IEEE Transactions on Computers (1982)

Arithmetic codes use a structured redundancy technique for binary number representation such that errors in an arithmetic operation of a digital computer can be detected or corrected. This correspondence studies the code structures by treating the set of redundant coded binary representations as a finite Abelian group. An algebraic model of arithmetic codes is developed, which shows that an arithmetic code is a pair of cyclic group isomorphisms. Two theorems are derived which describe the necessary and sufficient conditions for the existence of an arithmetic code. It is also shown that the group of redundant coded binary numbers is isomorphic to a cyclic group, or the direct sum of two cyclic groups. For a given code generator A and the information cardinality m, the two theorems may be applied to find all existing arithmetic codes up to an isomorphism. The algebraic structures of all codes published to date are covered by the mathematical model described in this correspondence.
ApproxMGMSP: A Scalable Method of Mining Approximate Multidimensional Sequential Patterns on Distributed System
Authors: Changhai Zhang, Kongfa Hu, Zhuxi Chen, Ling Chen, Yisheng Dong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

We present a scalable and effective algorithm called ApproxMGMSP (Approximate Mining of Global Multidimensional Sequential Patterns) to solve the problem of mining the multidimensional sequential patterns for large databases in the distributed environment. Our method differs from previous related works of mining multidimensional patterns on distributed system. The main difference is that an approximate mining method is used in large multidimensional sequence database firstly. In this paper, to convert the mining on the multidimensional sequential patterns to sequential patterns, the multidimensional information is embedded into the corresponding sequences. Then the sequences are clustered, summarized, and analyzed on the distributed sites, and the local patterns could be obtained by the effective approximate sequential pattern mining method. Finally, the global multidimensional sequential patterns could be quickly mined by high vote sequential pattern model after collecting all the local patterns on one site. Both the theories and the experiments indicate that this method could simplify the problem of mining the multidimensional sequential patterns and avoid mining the redundant information. The global sequential patterns could be obtained effectively by the scalable method after reducing the cost of communication.
Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes
Authors: Dong Xiang, Yueli Zhang, Yi Pan, Jie Wu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

A new deadlock-free adaptive routing algorithm is proposed for n-dimensional meshes with only two virtual channels, where a virtual channel can be shared by two consecutive planes without any cyclic channel dependency. A message is routed along a series of planes. The proposed planar adaptive routing algorithm is enhanced to a fully adaptive routing version for 3-dimensional meshes using the idle virtual channels along the last dimension. Another deadlock avoidance technique is proposed for 3- dimensional meshes using a new virtual network partitioning scheme with only two virtual channels. Two virtual networks can share some common virtual channel based on the virtual network partitioning scheme. The deadlock-free adaptive routing scheme is then modified to a deadlock-free adaptive fault-tolerant routing scheme based on a planarly constructed MCC fault model. Sufficient simulation results are presented to demonstrate the effectiveness of the proposed algorithm.
A comprehensive analytical model of interconnection networks in large-scale cluster systems: Research Articles
Authors: Bahman Javadi, Jemal H. Abawajy, Mohammad K. Akbari
Venue: Concurrency and Computation: Practice Experience (2008)

The trends in parallel processing system design and deployment have been toward networked distributed systems such as cluster computing systems. Since the overall performance of such distributed systems often depends on the efficiency of their communication networks, performance analysis of the interconnection networks for such distributed systems is paramount. In this paper, we develop an analytical model, under non-uniform traffic and in the presence of communication locality, for the m-port n-tree family interconnection networks commonly employed in large-scale cluster computing systems. We use the proposed model to study two widely used interconnection networks flow control mechanism namely the wormhole and store&forward. The proposed analytical model is validated through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Using alternative views for layout, comparison and context switching tasks in wall displays
Authors: Anastasia Bezerianos
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

In this paper we first present a set of tasks that are relevant to wall display interaction. Among these, layout management, context switching and comparison tasks could benefit from the use of interactive shortcut views of remote areas of a wall display, presented close to the user. Such a shortcut view technique, the ScaleView portals, is evaluated against using a simple magnification lens and walking when performing these tasks. We observed that for a layout and comparison task with frequent context switching, users preferred ScaleView portals. But for simpler tasks, such as searching, regular magnification lenses and walking were preferred. General observations on how the display was used as a peripheral reference by different participants highlighted one of the benefits of using wall sized displays: users may visually refer to the large, spread out content on the wall display, even if they prefer to interact with it close to their location.
Single-Issue 1500MIPS Embedded DSP with Ultra Compact Codes
Authors: Li-Chun Lin, Shih-Hao Ou, Tay-Jyi Lin, Siang-Den Deng, Chih-Wei Liu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The performance of single-issue RISC cores can be improved significantly with multi-issue architectures (i.e. superscalar or VLIW) by activating the parallel functional units concurrently. However, they suffer high complexity or huge code sizes. In this paper, we borrow some ideas from old vector machines and propose a novel DSP architecture with very compact codes. In our simulations, the DSP has comparable performance to a 5-issue VLIW core with identical computing resources. However, its code sizes are greatly reduced. The DSP core has been implemented in the TSMC 0.13um CMOS technology, where the operating frequency is 305MHz and the core size is 1.45×1.4 mm2 including 12KB on-chip memory.
Memory exploitation in learning classifier systems
Authors: Robert E. Smith
Venue: Evolutionary Computation (1994)

Learning classifier systms (LCSs) offer a unique opportunity to study the adaptive exploitation of memory. Because memory is manipulated in the form of simple internal messages in the LCS, one can easily and carefully examine the development of a system of internal memory symbols. This study examines the LCS applied to a problem whose only performance goal is the effective exploitation of memory. Experimental results show that the genetic algorithm forms a relatively effective set of internal memory symbols, but that this effectiveness is directly limited by the emergence of parasite rules. The results indicate that the emergence of parasites may be an inevitable consequence in a system that must evolve its own set of internal memory symbols. The paper's primary conclusion is that the emergence of parasites is a fundamental obstacle in such problems. To overcome this obstacle, it is suggested that the LCS must form larger, multirule structures. In such structures, parasites can be more accurately evaluated and thus eliminated. This effect is demonstrated through a preliminary evaluation of a classifier corporation scheme. Final comments present future directions for research on memory exploitation in the LCS and similar evolutionary computing systems.
Computing Degree of Association Based on Different Semantic Relationships
Authors: Xuan Tian, Xiaoyong Du, Haihua Li
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In domain ontologies, there is usually no weight assigned to the link between two concepts. This has been considered as one of main obstacles in using ontologies. Semantic Association (SA) is to depict the correlation of two concepts, and can be measured as the weight of the link. In this paper, we defined Degree of Association (DOA) to measure SA from a concept to its direct-related concept in domain ontology, and proposed a Language-Model-Based Method (LMBM) to compute DOA. Our idea comes from the intuition that the semantic relationship between two concepts implies certain semantic association of them. We took probabilistic model for computing DOA, and used Maximum Likelihood Estimation to estimate parameters. We tested the proposed method on two different domain ontologies, and applied it in experiments of semantic query expansion. Experimental results show the benefit of our approach and demonstrate the promising effectiveness over semantic query expansion.
Particle Swarm Optimization with Diversity-Controlled Acceleration Coefficients
Authors: Jing Jie, Jianchao Zeng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In order to overcome the premature convergence, the paper introduced a negative feedback mechanism into particle swarm optimization and developed an adaptive PSO. The improved method takes advantage of the swarm-diversity to control the tuning of the acceleration coefficients (PSO-DCAC). Through the feedback control of the diversity, PSO-DCAC can manipulate the weight of the cognitive part and the social part to fluctuate with the search state, which in turn can adjust the exploration and exploitation adaptively and contributes to a successful global search. The proposed PSO-DCAC was applied to some well-known benchmarks and compared with the other notable improved PSO. Experimental results show diversity-controlled acceleration coefficients is a feasible technique to improve the global performance of PSO and performs very well on the complex optimization problems.
Frequent Pattern Mining using Bipartite Graph
Authors: Duck Jin Chai, Long Jin, Buhyun Hwang, Keun Ho Ryu
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, we propose an efficient ALIB algorithm that can find frequent patterns by only onetime database scan. Frequent patterns are found without generation of candidate sets using LIB-graph. LIB-graph is generated simultaneously when the database is scanned for 1-frequent items generation. LIB-graph represents the relation between 1-frequent items and transactions including the 1-frequent items. That is, LIB-graph compresses database information into a much smaller data structure. We can quickly find frequent patterns because the proposed method conducts only onetime database scan and avoids the generation of candidate sets. Our performance study shows that the ALIB algorithm is efficient for mining frequent patterns, and is faster than the FP-growth.
Controlled propagation in molecular communication using tagged liposome containers
Authors: Y. Sasaki, M. Hashizume, K. Maruo, N. Yamasaki, J. Kikuchi, Y. Moritani, S. Hiyama, T. Suda
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Molecular communication is an emerging research area in the bio and nano science [1]. Molecular communication uses molecules as a communication medium and allows nanomachines (e.g. nano-scale biological or artificially-created devices) to communicate over a short distance. A key design challenge in molecular communication is controlling the propagation direction of information-carrying molecules towards their destination. This paper presents results of the experiment for transporting liposome containers to the designated receivers. In the experiments, molecular tags were used to identify the destination of the liposome containers.
A discretization algorithm based on Class-Attribute Contingency Coefficient
Authors: Cheng-Jung Tsai, Chien-I. Lee, Wei-Pang Yang
Venue: Information Sciences: an International Journal (2008)

Discretization algorithms have played an important role in data mining and knowledge discovery. They not only produce a concise summarization of continuous attributes to help the experts understand the data more easily, but also make learning more accurate and faster. In this paper, we propose a static, global, incremental, supervised and top-down discretization algorithm based on Class-Attribute Contingency Coefficient. Empirical evaluation of seven discretization algorithms on 13 real datasets and four artificial datasets showed that the proposed algorithm could generate a better discretization scheme that improved the accuracy of classification. As to the execution time of discretization, the number of generated rules, and the training time of C5.0, our approach also achieved promising results.
BHUNT: automatic discovery of Fuzzy algebraic constraints in relational data
Authors: Paul G. Brown, Peter J. Hass
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We present the BHUNT scheme for automatically discovering algebraic constraints between pairs of columns in relational data. The constraints may be "fuzzy" in that they hold for most, but not all, of the records, and the columns may be in the same table or different tables. Such constraints are of interest in the context of both data mining and query optimization, and the BHUNT methodology can potentially be adapted to discover fuzzy functional dependencies and other useful relationships. BHUNT first identifies candidate sets of column value pairs that are likely to satisfy an algebraic constraint. This discovery process exploits both system catalog information and data samples, and employs pruning heuristics to control processing costs. For each candidate, BHUNT constructs algebraic constraints by applying statistical histogramming, segmentation, or clustering techniques to samples of column values. Using results from the theory of tolerance intervals, the sample sizes can be chosen to control the number of "exception" records that fail to satisfy the discovered constraints. In query-optimization mode, BHUNT can automatically partition the data into normal and exception records. During subsequent query processing, queries can be modified to incorporate the constraints; the optimizer uses the constraints to identify new, more efficient access paths. The results are then combined with the results of executing the original query against the (small) set of exception records. Experiments on a very large database using a prototype implementation of BHUNT show reductions in table accesses of up to two orders of magnitude, leading to speedups in query processing by up to a factor of 6.8.
Approximation and robustness of fuzzy finite automata
Authors: Yongming Li
Venue: International Journal of Approximate Reasoning (2008)

In previous work we have shown that nondeterministic fuzzy finite automata (or NFFAs, for short) under max-* compositional inference for some t-norm * and deterministic fuzzy finite automata (or DFFAs, for short) are not necessarily equivalent. We continue to study the approximation and robustness of fuzzy finite automata in this paper. In particular, we show that we can approximate an NFFA by some DFFA with any given accuracy when the NFFA is not equivalent to any DFFA, and the related construction is also presented. Some characterizations of NFFA and DFFA are given. We study the robustness of fuzzy finite automata against imprecision of fuzzy transitions, and some interesting results are obtained.
Image classification for the quality control of watches
Authors: M. Moreira, E. Fiesler, G. Pante
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

A method is presented for the automatic time detection of watches, where the hands are classified by a neural network. In order to reduce the overall cost of data collection, strict limits were imposed on the data collection time. This constraint severely limits the available amount of images, and poses the challenge to solve the hand recognition problem with a minimum amount of training and test data. Two neural network approaches are presented, together with their performance results which show an excellent final recognition rate.
Software Component Models
Authors: Kung-Kiu Lau, Zheng Wang
Venue: IEEE Transactions on Software Engineering (2007)

Component-based Development (CBD) is an important emerging topic in Software Engineering, promising long sought after benefits like increased reuse, reduced time-to-market and hence software production cost. The cornerstone of a CBD technology is its underlying software component model, which defines components and their composition mechanisms. Current models use objects or architectural units as components. These are not ideal for component reuse or systematic composition. In this paper, we survey and analyze current component models, and classify them into a taxonomy based on commonly accepted desiderata for CBD. For each category in the taxonomy, we describe its key characteristics and evaluate them with respect to these desiderata.
Comparing Between Web Application Effort Estimation Methods
Authors: Majid Javid Moayed, Abdul Azim Abdul Ghani, Mojtaba Seyedzadegan
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Effort estimation consist in predict how many hours of work and how many workers are needed to develop a project. This is important in the process of project management. As far as estimation and prediction are concerned there are still a number of unsolved problems and errors. To obtain good results it is essential to take into consideration any previous projects. Estimation the project manager has not yet been solved and even the project manager has to deal with it since the beginning.Measurement can play a significant role in the effective management and development of web applications. It provides the scientific basis for web engineering to become true engineering discipline effective web project estimation is one of the most important activities in web development. Proper project planning and control is not possible without a sound and reliable estimate. Although estimating the effort required in developing web applications is a difficult task, accurate estimates of development effort have an important role to play in the successful management of web development projects. This paper is a review about web effort estimation entities, attributes, and methods from the other earlier researches and at last compare these methods to each other.
High-order kinetic flux vector splitting schemes in general coordinates for ideal quantum gas dynamics
Authors: Jaw-Yen Yang, Tse-Yang Hsieh, Yu-Hsin Shi, Kun Xu
Venue: Journal of Computational Physics (2007)

A class of high-order kinetic flux vector splitting schemes are presented for solving ideal quantum gas dynamics based on quantum statistical mechanics. The collisionless quantum Boltzmann equation approach is adopted and both Bose-Einstein and Fermi-Dirac gases are considered. The formulas for the split flux vectors are derived based on the general three-dimensional distribution function in velocity space and formulas for lower dimensions can be directly deduced. General curvilinear coordinates are introduced to treat practical problems with general geometry. High-order accurate schemes using weighted essentially non-oscillatory methods are implemented. The resulting high resolution kinetic flux splitting schemes are tested for 1D shock tube flows and shock wave diffraction by a 2D wedge and by a circular cylinder in ideal quantum gases. Excellent results have been obtained for all examples computed.
A Totally Self-Checking Checker Design for the Detection of Errors in Periodic Signals
Authors: A. M. Usas
Venue: IEEE Transactions on Computers (1975)

Periodic signals have a known behavior, and deviations in their waveforms may indicate failures in the signal source. Monitoring these signals can be a valuable technique in detecting both hardware and software failures in a computer. Schemes previously used to check for errors in these signals are reviewed and evaluated. These circuits, however, share a common weakness in that they are susceptible to undetectable internal faults. Described here is a self-checking periodic-signal checker; that is, the checker is capable of indicating the occurrence of any error in the input signal and failures in the checker itself. Applications of the checker in aspects of computer operation as well as a fail-safe circuit for communicating the detection of an error to an external observer are presented.
Hardness for Explicit State Software Model Checking Benchmarks
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their performance gains. Recent work characterizes the hardness of models used in the analysis as an estimated number of paths in the model that contain an error. This hardness metric is computed using a stateless random walk. We show that this is not a good hardness metric because models labeled hard with a stateless random walk metric have easily discoverable errors with a stateful randomized search. We present an analysis which shows that a hardness metric based on a stateful randomized search is a tighter bound for hardness in models used to benchmark explicit state directed model checking techniques. Furthermore, we convert easy models into hard models as measured by our new metric by pushing the errors deeper in the system and manipulating the number of threads that actually manifest an error.
Fault Detection in Bilateral Arrays of Combinational Cells
Authors: F. G. Gray
Venue: IEEE Transactions on Computers (1978)

Sufficient conditions are derived that make multidimensional bilateral arrays of combinational cells easily testable for single faults. These conditions are easily implemented during the initial design of the arrays. No restrictions are made on the interconnection patterns or directions of signal flow in the arrays. The conditions are equally applicable to synchronous and asynchronous arrays. No assumptions of stability are made. Any functional fault in a single cell will be detected as long as the failed cell is still combinational. The test sequence is preset and grows linearly with the size of the array.