ppxscal/embedding_network huggingface dataset:
Exploiting the synergy between gossiping and structured overlays
Authors: Ali Ghodsi, Seif Haridi, Hakim Weatherspoon
Venue: ACM SIGOPS Operating Systems Review (2007)

In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes.
Approximate Query Processing in Cube Streams
Authors: Ming-Jyh Hsieh Ming-Syan Chen, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Data cubes have become important components in most data warehouse systems and Decision-Support-Systems. In such systems, users usually pose very complex queries to the Online Analytical Processing (OLAP) system, and systems usually have to deal with a huge amounts of data because of the large dimensionality of the sets; thus approximating query processing has emerged as a viable solution. Specifically, the applications of cube streams handle multidimensional data sets in a continuous manner in contrast to traditional cube approximation. Such an application collects data events for cube streams on-line and generates snapshots with limited resources and keeps the approximated information in a synopsis memory for further analysis. Compared to OLAP applications, applications of cube streams are subject to many more resource constraints on both the processing time and the memory and cannot be dealt with by existing methods due to the limited resources. In this paper, we propose the DAWA algorithm, which is a hybrid algorithm of Dct for Data and the discrete WAvelet transform, to approximate cube streams. Our algorithm combines the advantages of the high compression rate of DWT and the low memory cost of DCT. Consequently, DAWA requires much smaller working buffer and outperforms both DWT-based and DCT-based methods in execution efficiency. Also, it is shown that DAWA provides a good solution for approximate query processing of cube streams with a small working buffer and a short execution time. The optimality of the DAWA algorithm is theoretically proved and empirically demonstrated by our experiments.
Single-bit re-encryption with applications to distributed proof systems
Authors: Nikita Borisov, Kazuhiro Minami
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

We examine the implementation of the distributed proof system designed by Minami and Kotz [17]. We find that, although a high-level analysis shows that it preserves confidentiality, the implementation of the cryptographic primitives contains a covert channel that can leak information. Moreover, this channel is present with any traditional choice of public key encryption functions. To remedy this problem, we use the Goldwasser-Micali cryptosystem to implement single-bit re-encryption and show how to make it free of covert channels. We then extend the primitive to support commutative encryption as well. Using this primitive, we design a variant of the Minami-Kotz algorithm that not only is free of covert channels, but also has additional proving power over the original design.
The Counting Recursive Digital Filter
Authors: S. Zohar
Venue: IEEE Transactions on Computers (1973)

Analysis of the bit-level operations involved in the convolutions realizing recursive digital filters leads to hardware designs of such filters based on the operation of counting. Various designs realizing both the canonic and "direct" forms are presented with particular emphasis on low-cost low-speed high-flexibility machines.
Low-pressure H2/N2 annealing on indium tin oxide film
Authors: Shang-Chou Chang
Venue: Microelectronics Journal (2007)

Annealing of indium tin oxide (ITO) film in low-pressure H"2/N"2 was investigated. On carefully selecting the annealing process window, apparent electrical property improvement as well as good optical property can be obtained. It was found that ITO annealed with 2Pa, H"2/N"2:6/6sccm, at 500^oC for an hour can increase its electrical conductivity 60% more than ITO without annealing, 58% more than ITO annealed with pure H"2. An annealed ITO without specially selected recipe can easily possess worse electrical and optical properties than that without annealing. It can be explained that annealing ITO in a hydrogen-contained environment can lead to hydrogen reduction-oxygen vacancy playing a donor role in ITO; however, annealing also provides the energy to remove ITO material defects including donors.
B74-22 Software Engineering: International Computer State of the Art Report
Authors: D. B. Lomet
Venue: IEEE Transactions on Computers (1974)

This volume is one of a series of state of the art reports by Infotech. In some respects it is reminiscent of the software which is discussed within it. Its organization is a good example of top down specification via the method of successive refinement. There are other analogies too which shall be pointed out later.
Entropy-Based Symbolic Representation for Time Series Classification
Authors: Xiao-yun Chen, Dong-yi Ye, Xiao-Lin Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In order to improve the performance of time-series classification, we introduce a new approach of time series classification. The first basic idea of the approach is to use entropy impurity measure to discretize and symbolize time series, which discretize the original time series into disjoint intervals using entropy impurity measure and then transform the time series into symbolic representations. The second idea of the approach is to combine symbolic representation of time series and k nearest neighbor to classify time series. The proposed approach is compared with a number of known pattern classifiers by benchmarking with the use of artificial and real-world data sets. The experimental results show it can reduce the error rates of time series classification, so it is highly competitive with previous approaches.
Dialogue Cells: A Method for Defining Interactions
Authors: H. G. Borufka
Venue: IEEE Computer Graphics and Applications (1982)

How Should One Approach the Design of an Interactive Interface? This Method Provides Both a Basic Approach and Some Powerful New Tools to Aid in Dialogue Programming.
High-speed recursion architectures for MAP-based turbo decoders
Authors: Zhongfeng Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The maximum a posterior probability (MAP) algorithm has been widely used in Turbo decoding for its outstanding performance. However, it is very challenging to design high-speed MAP decoders because of inherent recursive computations. This paper presents two novel high-speed recursion architectures for MAP-based Turbo decoders. Algorithmic transformation, approximation, and architectural optimization are incorporated in the proposed designs to reduce the critical path. Simulations show that neither of the proposed designs has observable decoding performance loss compared to the true MAP algorithm when applied in Turbo decoding. Synthesis results show that the proposed Radix-2 recursion architecture can achieve comparable processing speed to that of the state-of-the-art recursion (Radix-4) architecture with significantly lower complexity while the proposed Radix-4 architecture is 32% faster than the best existing design.
The Conditions for Isomorphism of Two Graphs and Some Results on Four-Colorable Conjecture
Authors: Fugui Liu, Kaisheng Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper gives a necessary condition for isomorphism of two graphs, and puts forward a new method about judging non-isomorphism of them. Besides, it presents a necessary and sufficient condition for isomorphism of two graphs by using a conclusion known in the reconstruction graph, and a new method for judging isomorphism of two graphs. It also proves the theorem; Let G be the planar graph of order p, then G is at most four colorable when 2 \leqslant p \leqslant 11 .
Second-LSB-Dependent Robust Watermarking for Relational Database
Authors: Xiangrong Xiao, Xingming Sun, Minggang Chen
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

A novel robust watermarking algorithm based on the second-LSB (Least Significant Bit) is proposed. The algorithm first groups the data by the hash value of the primary key and positions with the second-LSB of the data in every group. The watermark is not directly embedded in one single item, but one bit is embedded into one group by setting a pseudo-random number to the LSB of the data. A threshold, which is used for detection to be compared with the occurrence frequency of LSB positioned in embedding, and set according to the distribution probabilities of the data. Without affecting the usability of the data, the watermark is scattered in the databases evenly and hard to be detected. What's more, it keeps the distribution of the data. Experiments have shown that the algorithm is robust against various forms of attacks.
B74-24 Computer Simulation of Dynamic Systems
Authors: R. Vichnevetsky
Venue: IEEE Transactions on Computers (1974)

As reflected by this list of headings, a major part of the book is devoted to a description of analog/hybrid computer components and simulation techniques. In this respect, the book repeats material which is amply available in much older textbooks. The author then proceeds to extend those analog/hybrid techniques to the field of numerical algorithms. This is done specifically in chapter 3, and integrated in most of the other chapters along with the description of analog/hybrid methods of implementation.
Letters: Compact multi-class support vector machine
Authors: A. Navia-Vázquez
Venue: Neurocomputing (2007)

Multiclass support vector machines (MSVMs) have become a very appealing machine learning approach due to their good results in many classification problems. The resulting machines, though, are usually too large for being usable in many real world applications, especially when fast real-time response is needed. Some approaches aim at decreasing the complexity of the resulting full-size SVM classifiers. The most successful methods follow the ''reduced-set'' procedure, but they have to start from a full SVM solution, and then solve a pre-image problem, prone to fall in local minima. We propose here a compact multiclass SVM (CMSVM) method, that does not need the full SVM solution as a starting point (and hence scales potentially better), and does not need to address the pre-image problem. We evaluate the performance of the proposed scheme by means of real world data sets, and we compare it against other state-of-the-art MSVM techniques.
Near-field performance analysis of locally-conformal perfectly matched absorbers via Monte Carlo simulations
Authors: Ozlem Ozgun, Mustafa Kuzuoglu
Venue: Journal of Computational Physics (2007)

In the numerical solution of some boundary value problems by the finite element method (FEM), the unbounded domain must be truncated by an artificial absorbing boundary or layer to have a bounded computational domain. The perfectly matched layer (PML) approach is based on the truncation of the computational domain by a reflectionless artificial layer which absorbs outgoing waves regardless of their frequency and angle of incidence. In this paper, we present the near-field numerical performance analysis of our new PML approach, which we call as locally-conformal PML, using Monte Carlo simulations. The locally-conformal PML method is an easily implementable conformal PML implementation, to the problem of mesh truncation in the FEM. The most distinguished feature of the method is its simplicity and flexibility to design conformal PMLs over challenging geometries, especially those with curvature discontinuities, in a straightforward way without using artificial absorbers. The method is based on a special complex coordinate transformation which is 'locally-defined' for each point inside the PML region. The method can be implemented in an existing FEM software by just replacing the nodal coordinates inside the PML region by their complex counterparts obtained via complex coordinate transformation. We first introduce the analytical derivation of the locally-conformal PML method for the FEM solution of the two-dimensional scalar Helmholtz equation arising in the mathematical modeling of various steady-state (or, time-harmonic) wave phenomena. Then, we carry out its numerical performance analysis by means of some Monte Carlo simulations which consider both the problem of constructing the two-dimensional Green's function, and some specific cases of electromagnetic scattering.
STEAC: a platform for automatic SOC test integration
Authors: Chih-Yen Lo, Chen-Hsing Wang, Kuo-Liang Cheng, Jing-Reng Huang, Chih-Wea Wang, Shin-Moe Wang, Cheng-Wen Wu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The lack of electronic design automation tools for system-on-chip (SOC) test integration increases SOC development time and cost, so SOC test integration tools are important in the success of promoting SOC. We have stressed practical SOC test integration issues, including real problems found in test scheduling, test input/output (I/O) reduction, timing of functional test, scan I/O sharing, etc. In this paper, we further consider the requirement of integrating at-speed testing of embedded cores--to detect timing-related defects, our test architecture is equipped with at-speed test capability. Test scheduling is done based on our test architecture and test access mechanism, considering I/O resource constraints. Detailed scheduling further reduces the overall test time of the system chip. All these techniques arc integrated into an automatic flow to facilitate SOC test integration. The test integration platform has been applied to both academic and industrial SOC cases. The chips have been designed and fabricated. The measurement results justify the approach---simple and efficient, i.e., short test integration cost, short test time, and small hardware and pin overhead.
Precompilation of Fortran Programs to Facilitate Array Processing
Authors: B. Brode
Venue: Computer (1981)

The automatic recognition of array operations in Fortran programs can now be applied to attached array processors using vectorizing precompiler software. 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 Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas
Authors: Chun Zhang, Jim Kurose, Yong Liu, Don Towsley, Michael Zink
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

In many energy-rechargeable wireless sensor net-works, sensor nodes must both sense data from the environment, and cooperativelyforward sensed data to data sinks. Both data sensing and data forwarding (including data transmission and reception) consumeenergy at sensor nodes. We present a distributed algorithm for optimal joint allocation of energy between sensing and communicationat each node to maximize overall system utility (i.e., the aggregate amount of information received at the data sinks). Weconsider this problem in the context of wireless sensor networks with directional, non-steerable antennas. We first formulatea joint data-sensing and data-routing optimization problem with both per-node energy-expenditure constraints, and traditionalflow routing/conservation constraints. We then simplify this problem by converting it to an equivalent routing problem, andpresent a distributed gradient-based algorithm that iteratively adjusts the per-node amount of energy allocated between sensingand communication to reach the system-wide optimum. We prove that our algorithm converges to the maximum system utility. Wequantitatively demonstrate the energy balance achieved by this algorithm in a network of small, energy-constrained X-bandradars, connected via point-to-point 802.11 links with non-steerable directional antennas.
Study on Prediction of Prosodic Phrase Boundaries in Chinese TTS
Authors: Ziping Zhao, Yaoting Zhu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Hierarchical prosody structure generation is a key component for a speech synthesis system. One major feature of the prosody of Mandarin Chinese speech flow is prosodic phrase grouping. In this paper three methods are proposed to predict prosodic phrase. The first is a statistic probability model, which efficiently combines the local POS and word length information. Experiments show by choosing appropriate threshold the model can reach a high precision and high recall ratio. Secondly we use the decision tree learning algorithm combined with the pause rules of Chinese empty words to predict prosodic phrase boundary in unrestricted Chinese text. The experiments show that the approach improves overall performance. Another is an SVM-based method. The precision and recall ratio are improved after using SVM classifier.
B74-11 Abstract Automata1
Authors: A. T. Poe
Venue: IEEE Transactions on Computers (1974)

With the increasing interest in automata theory, the number of books on this subject has been steadily increasing since the early 1960's. Depending on the audience, one can now choose books in the graduate level as well as in the introductory junior-senior level. Depending on the emphasis, one can also choose books that approach the subject from different angles. This book, Abstract Automata, by P. H. Starke of Germany is certainly a welcome addition to this collection. 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
Local relative location error descriptor-based fingerprint minutiae matching
Authors: Xifeng Tong, Songbo Liu, Jianhua Huang, Xianglong Tang
Venue: Pattern Recognition Letters (2008)

Minutiae matching with non-linear distortion is a challenging task in an Automatic Fingerprint Identification System. In this paper, a feature called Local Relative Location Error Descriptor (LRLED) is proposed to overcome non-linear distortion. The LRLED-based algorithm consists of three procedures. Firstly, a pairwise alignment method is proposed to achieve fingerprint alignment. Secondly, a matched minutiae-pair set is obtained with a comparatively loose threshold to reduce false non-matches, which lead not only to most of the corresponding minutiae-pairs, but also to a few non-corresponding minutiae-pairs getting matched. Finally, the LRLED-based similarity measure, which outputs a very high score for a corresponding minutiae-pair but a very low score for a non-corresponding minutiae-pair to reduce false matches, is employed to compute the similarity level between template and test fingerprints. Evaluations on FVC2002 and FVC2004 databases reveal that LRLED is good at distinguishing between corresponding and non-corresponding minutiae-pairs and works well for fingerprint minutiae matching.
An MDA-based approach for database re-engineering
Authors: Macario Polo, Ignacio García-Rodríguez, Mario Piattini
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2007)

This article presents the technical and functional descriptions of a tool specifically designed for database re-engineering. As is well known, re-engineering is the process of (1) applying reverse engineering to a software product to obtain higher-level specifications and (2) using these specifications as the starting point for the development of a new version of the system. Thus, the complete process can be seen as a sequence of transformation functions that operate on the different sets involved in the whole process. The starting point of the re-engineering process is the physical schema of the database which is translated into a vendor-independent metamodel (the logical schema) and then translated into a class diagram representing a possible conceptual schema of the database. This diagram is then taken as the starting point for the code generation process, which produces an executable application for four possible different platforms. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Morph-based speech recognition and modeling of out-of-vocabulary words across languages
Authors: Mathias Creutz, Teemu Hirsimäki, Mikko Kurimo, Antti Puurula, Janne Pylkkönen, Vesa Siivola, Matti Varjokallio, Ebru Arisoy, Murat Saraçlar, Andreas Stolcke
Venue: ACM Transactions on Speech and Language Processing (TSLP) (2007)

We explore the use of morph-based language models in large-vocabulary continuous-speech recognition systems across four so-called morphologically rich languages: Finnish, Estonian, Turkish, and Egyptian Colloquial Arabic. The morphs are subword units discovered in an unsupervised, data-driven way using the Morfessor algorithm. By estimating n-gram language models over sequences of morphs instead of words, the quality of the language model is improved through better vocabulary coverage and reduced data sparsity. Standard word models suffer from high out-of-vocabulary (OOV) rates, whereas the morph models can recognize previously unseen word forms by concatenating morphs. It is shown that the morph models do perform fairly well on OOVs without compromising the recognition accuracy on in-vocabulary words. The Arabic experiment constitutes the only exception since here the standard word model outperforms the morph model. Differences in the datasets and the amount of data are discussed as a plausible explanation.