ppxscal/embedding_network huggingface dataset:
Generating concise association rules
Authors: Yue Xu, Yuefeng Li
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Association rule mining has made many achievements in the area of knowledge discovery. However, the quality of the extracted association rules is a big concern. One problem with the quality of the extracted association rules is the huge size of the extracted rule set. As a matter of fact, very often tens of thousands of association rules are extracted among which many are redundant thus useless. Mining non-redundant rules is a promising approach to solve this problem. The Min-max exact basis proposed by Pasquier et al [Pasquier05] has showed exciting results by generating only non-redundant rules. In this paper, we first propose a relaxing definition for redundancy under which the Min-max exact basis still contains redundant rules; then we propose a condensed representation called Reliable exact basis for exact association rules. The rules in the Reliable exact basis are not only non-redundant but also more succinct than the rules in Min-max exact basis. We prove that the redundancy eliminated by the Reliable exact basis does not reduce the belief to the Reliable exact basis. The size of the Reliable exact basis is much smaller than that of the Min-max exact basis. Moreover, we prove that all exact association rules can be deduced from the Reliable exact basis. Therefore the Reliable exact basis is a lossless representation of exact association rules. Experimental results show that the Reliable exact basis significantly reduces the number of non-redundant rules.
Place reservation: Delay analysis of a novel scheduling mechanism
Authors: S. De Vuyst, S. Wittevrongel, H. Bruneel
Venue: Computers and Operations Research (2008)

We study the delay performance of a queue with a place reservation mechanism. The objective of this discipline is to provide a better quality of service to arriving packets that are delay sensitive at the cost of allowing higher delays for the best effort packets and was first proposed by Burakowski and Tarasiuk. In our model, we consider a discrete-time queue with arrivals of type 1 (delay sensitive) and type 2 (best-effort). Whenever a packet of type 1 enters the queue, it takes the position of the reservation that was created there by a previous arrival of type 1 and creates a new reservation at the end of the queue. Type 2 arrivals always take place at the end of the queue in the usual way. We present the analysis of this model based on the use of generating functions and provide results for the mean value, variance and tail behaviour of the delay experienced by both the delay-sensitive and the best-effort traffic. For a specific example, we compare the delay performance of this reservation discipline to the performance of an absolute priority discipline on the one hand, and to the reference discipline first-in first-out on the other.
Building Blocks for Variational Bayesian Learning of Latent Variable Models
Authors: Tapani Raiko, Harri Valpola, Markus Harva, Juha Karhunen
Venue: The Journal of Machine Learning Research (2007)

We introduce standardised building blocks designed to be used with variational Bayesian learning. The blocks include Gaussian variables, summation, multiplication, nonlinearity, and delay. A large variety of latent variable models can be constructed from these blocks, including nonlinear and variance models, which are lacking from most existing variational systems. The introduced blocks are designed to fit together and to yield efficient update rules. Practical implementation of various models is easy thanks to an associated software package which derives the learning formulas automatically once a specific model structure has been fixed. Variational Bayesian learning provides a cost function which is used both for updating the variables of the model and for optimising the model structure. All the computations can be carried out locally, resulting in linear computational complexity. We present experimental results on several structures, including a new hierarchical nonlinear model for variances and means. The test results demonstrate the good performance and usefulness of the introduced method.
A Resource Trade Model Based on Trust Evaluation for Grid Computing
Authors: Lulai Yuan, Zongjian He, Guosun Zeng
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

We face increasing uncertainty, cheat and risk when executing Grid resource trades, which is taken as a prominent feature of the market-oriented Grid. As participants of Grid, we cope with these complexities and uncertainties by relying trust for lacking of enforceable and globally uniform laws for Grid. So we propose a Grid resource trade model based on evaluation of trust to assist Grid participants to avoid cheating. The model allows Grid resource consumers (GRCs) to dynamically pay Grid resource providers (GRPs) for resource use of each step by dividing one trade into many steps, that is, "pay as you use". Theoretical analysis and simulations prove that our proposed model can tackle Grid resource trades in a secure and effective way.
Palmprint Verification for Controlling Access to Shared Computing Resources
Authors: Maylor K. H. Leung, A. C. M. Fong, Siu Cheung Hui
Venue: IEEE Pervasive Computing (2007)

Access security is an important aspect of pervasive computing systems. It offers the system developer and end users a certain degree of trust in the use of shared computing resources. Biometrics offers many advantages over the username-plus-password approach for access security control. Palmprint-based personal identification has seen less research than identification using fingerprints, irises, and faces. A proposed personal verification system employs palmprint images stored as 8-bit grayscale TIFF files. The system components include mechanisms for locating and aligning, extracting, and matching palmprints. The system first detects a human hand's interfinger key points and locates the palmprint on the basis of those points. Next, the system generates a line-edge-map representation of palmprint features. Finally, it performs feature matching based on the line segment Hausdorff distance. The LHD matching score provides the basis for verification decisions. Experimental results demonstrate that the key-point-detection technique is effective and that the palmprint line edge map has high discriminative power. This article is part of a special issue on security and privacy.
Probabilistic neural networks employing Lyapunov exponents for analysis of Doppler ultrasound signals
Authors: Elif Derya íbeyli
Venue: Computers in Biology and Medicine (2008)

The implementation of probabilistic neural networks (PNNs) with the Lyapunov exponents for Doppler ultrasound signals classification is presented. This study is directly based on the consideration that Doppler ultrasound signals are chaotic signals. This consideration was tested successfully using the nonlinear dynamics tools, like the computation of Lyapunov exponents. Decision making was performed in two stages: computation of Lyapunov exponents as representative features of the Doppler ultrasound signals and classification using the PNNs trained on the extracted features. The present research demonstrated that the Lyapunov exponents are the features which well represent the Doppler ultrasound signals and the PNNs trained on these features achieved high classification accuracies.
Incremental In-Network RNN Search in Wireless Sensor Networks
Authors: Yung-Chiao Tseng, Chao-Chun Chen, Chiang Lee, Yuan-Ko Huang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

With the rapid advances of wireless communication and sensor technologies, spatial queries on moving objects are increasingly important in many sensor applications. One of the most frequently used spatial queries is the reverse nearest neighbor (RNN) query that returns the objects whose nearest neighbor is the query object. RNN answers are particularly essential to the users who are under emergency circumstances. In this paper, we propose an incremental RNN search (IRS) method to answer RNN queries for moving objects in sensor networks. IRS employs a filter-verification framework to achieve the energy-efficient query processing by filtering out most objects irrelevant to the query results. To support the execution of IRS, we also design a distributed object location management scheme to reduce the amount of communication in managing moving objects. Our experimental results reveal that IRS is indeed quite promising, as it requires only a moderate amount of communications for managing moving objects as well as for processing RNN queries.
A Mutual Information Based Sequence Distance For Vertebrate Phylogeny Using Complete Mitochondrial Genomes
Authors: Z. G. Yu, Z. Mao, L. Q. Zhou, V. V. Anh
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Traditional sequence distances require alignment. A new mutual information based sequence distance without alignment is defined in this paper. This distance is based on compositional vectors of DNA sequences or protein sequences from complete genomes. First we establish the mathematical foundation of this distance. Then this distance is applied to analyze the phylogenetic relationship of 64 vertebrates using complete mitochondrial genomes. The phylogenetic tree shows that the mitochondrial genomes are separated into three major groups. One group corresponds to mammals; one group corresponds to fish; and the last one is Archosauria (including birds and reptiles). The structure of the tree based on our new distance is roughly in agreement in topology with the current known phylogenies of vertebrates.
Temporal slicing in the evaluation of XML queries
Authors: Dengfeng Gao, Richard T. Snodgrass
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

As with relational data, XML data changes over time with the creation, modification, and deletion of XML documents. Expressing queries on time-varying (relational or XML) data is more difficult than writing queries on nontemporal data. In this paper, we present a temporal XML query language, τXQuery, in which we add valid time support to XQuery by minimally extending the syntax and semantics of XQuery. We adopt a stratum approach which maps a τXQuery query to a conventional XQuery. The paper focuses on how to perform this mapping, in particular, on mapping sequenced queries, which are by far the most challenging. The critical issue of supporting sequenced queries (in any query language) is time-slicing the input data while retaining period timestamping. Timestamps are distributed throughout an XML document, rather than uniformly in tuples, complicating the temporal slicing while also providing opportunities for optimization. We propose four optimizations of our initial maximally-fragmented time-slicing approach: selected node slicing, copy-based per-expression slicing, in-place per-expression slicing, and idiomatic slicing, each of which reduces the number of constant periods over which the query is evaluated. While performance tradeoffs clearly depend on the underlying XQuery engine, we argue that there are queries that favor each of the five approaches.
VIPAS: virtual link powered authority search in the web
Authors: Chi-Chun Lin, Ming-Syan Chen
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

With the exponential growth of the World Wide Web, looking for pages with high quality and relevance in the Web has become an important research field. There have been many keyword-based search engines built for this purpose. However, these search engines usually suffer from the problem that a relevant Web page may not contain the keyword in its page text. Algorithms exploiting the link structure of Web documents, such as HITS, have also been proposed to overcome the problems of traditional search engines. Though these algorithms perform better than keyword-based search engines, they still have some defects. Among others, one major problem is that links in Web pages are only able to reflect the view of the page authors on the topic of those pages but not that of the page readers. In this paper, we propose a new algorithm with the idea of using virtual links which are created according to what the user behaves in browsing the output list of the query result. These virtual links are then employed to identify authoritative resources in the Web. Speci fically, the algorithm, referred to as algorithm VIPAS (standing for virtual link powered authority search), is divided into three phases. The first phase performs basic link analysis. The second phase collects statistics by observing the user behavior in browsing pages listed in the query result, and virtual links are then created according to what observed. In the third phase, these virtual links as well as real ones are taken together to produce an updated list of authoritative pages that will be presented to the user when the query with similar keywords is encountered next time. A Web warehouse is built and the algorithm is integrated into the system. By conducting experiments on the system, we have shown that VIPAS is not only very effective but also very adaptive in providing much more valuable information to users.
Tidy Drawings of Trees
Authors: C. Wetherell
Venue: IEEE Transactions on Software Engineering (1979)

Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey two naive tree drawers, formalize aesthetics for tidy trees, and descnbe two algorithms which draw tidy trees. One of the algorithms may be shown to require the minimum possible paper width. Along with the algorithms proper, we discuss the reasoning behind the algorithm development.
Ruler: high-speed packet matching and rewriting on NPUs
Authors: Tomas Hruby, Kees van Reeuwijk, Herbert Bos
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide most of the complexities of efficient program execution, programmers of NPUs face a 'bare-metal' view of the architecture. They have to deal with a multithreaded environment with a high degree of parallelism, pipelining and multiple, heterogeneous, execution units and memory banks. Software development on such architectures is expensive. Moreover, different NPUs, even within the same family, differ considerably in their architecture, making portability of the software a major concern. At the same time expensive network processing applications based on deep packet inspection are both in-creasingly important and increasingly difficult to realize due to high link rates. They could potentially benefit greatly from the hardware features offered by NPUs, provided they were easy to use. We therefore propose to use more abstract programming models that hide much of the complexity of 'bare-metal' architectures from the programmer. In this paper, we present one such programming model: Ruler, a flexible high-level language for deep packet in-spection (DPI) and packet rewriting that is easy to learn, platform independent and lets the programmer concentrate on the functionality of the application. Ruler provides packet matching and rewrit-ing based on regular expressions. We describe our implementa-tion on the Intel IXP2xxx NPU and show how it provides versatile packet processing at gigabit line rates.
Block DCT Vectors Construction for Face Retrieval Based on Genetic Algorithm
Authors: Yonghua Xie, Lokesh Setia, Hans Burkhardt
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Effective feature extraction is one of the most important steps in Content-based face image retrieval applications. A vectors construction method for face retrieval based on block DCT and genetic algorithm is proposed in this paper. According to this method, the block DCT coefficients are firstly selected according to the histogram of each block image, and then genetic algorithm is used to select and construct ultimate discriminative vectors for image retrieval. The experimental results on AR gray face database show that the proposed method is robust to facial situations of pose, expression, illumination and partial occlusion, and can get better performance of retrieval accuracy and speed simultaneously.
Formgraphics: A Form-Based Graphics Architecture Providing a Database Workbench
Authors: Hiroyuki Kitagawa, Tosiyasu Kunii, Motoei Azuma, Sohei Misaki
Venue: IEEE Computer Graphics and Applications (1984)

Complex combinations of text, graphics, and alphanumeric strings can be manipulated easily and rapidly when displayed in screen formats similar to conventional hard-copy forms.
Association rule mining through the ant colony system for National Health Insurance Research Database in Taiwan
Authors: R. J. Kuo, C. W. Shih
Venue: Computers Mathematics with Applications (2007)

In the field of data mining, an important issue for association rules generation is frequent itemset discovery, which is the key factor in implementing association rule mining. Therefore, this study considers the user's assigned constraints in the mining process. Constraint-based mining enables users to concentrate on mining itemsets that are interesting to themselves, which improves the efficiency of mining tasks. In addition, in the real world, users may prefer recording more than one attribute and setting multi-dimensional constraints. Thus, this study intends to solve the multi-dimensional constraints problem for association rules generation. The ant colony system (ACS) is one of the newest meta-heuristics for combinatorial optimization problems, and this study uses the ant colony system to mine a large database to find the association rules effectively. If this system can consider multi-dimensional constraints, the association rules will be generated more effectively. Therefore, this study proposes a novel approach of applying the ant colony system for extracting the association rules from the database. In addition, the multi-dimensional constraints are taken into account. The results using a real case, the National Health Insurance Research Database, show that the proposed method is able to provide more condensed rules than the Apriori method. The computational time is also reduced.
Interoperability for Semantic Annotations
Authors: Stefano Paolozzi, Paolo Atzeni
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Semantic annotations represent a basic technology for the creation of meaningful content for the Semantic Web. Many tools have been developed to realize semantic annotations platforms also using ontologies. An important characteristic such tools should satisfy is the semantic interoperability with other systems or tools. In this paper we examine problems of interoperability between different semantic annotations systems proposing solutions based on Model Management technique, with particular attention to the ModelGen operator.
Score-level fusion of fingerprint and face matchers for personal verification under "stress" conditions
Authors: Gian Luca Marcialis, Fabio Roli
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Fusion of multiple face and fingerprint matchers based on different biometrics for personal authentication has been investigated in the last years. However, the performance achievable when the expected subject cooperation degree is different from the real one has not yet been sufficiently studied. In this paper, we investigate the performance of several score-level fusion rules when the test set is taken under non-cooperative ("stress") conditions. Results show that fusion allows to increase the robustness of the system under strong changes of the subject's cooperation degree.
Experiments in the Contextual Recognition of Cursive Script
Authors: R. W. Ehrich
Venue: IEEE Transactions on Computers (1975)

In this paper a structure for a contextual cursive script recognition system is presented. This system makes use of letter context to determine word length, letter segmentation, and character identity to achieve contextual recognition at the word level. The system consists of a character recognizer that presents a set of best alternatives for each character to a contextual postprocessor whose task it is to determine the correct word.
An Inverse Analysis to Estimate Thermal Conductivity Components of an Orthotropic Medium
Authors: Chen Yang, Siyun Gao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Several inverse analysis methods are used to estimate temperature dependent thermal conductivity components of orthotropic solid. Solutions of inverse heat conduction problems using Bayesian approach, Genetic algorithms and Levenberg-Marquardt algorithm are compared. The inverse solution of estimation for thermal conductivity components are obtained by computing the expectations of the posterior probability density functions of the thermal conductivity components. Genetic Algorithms are relatively new techniques for optimization and estimation. This technique can also be applied to the solution of inverse problems. Levenberg-Marquardt algorithm also can be used to solve nonlinear inverse problem of the parameter estimation.
Logic and Layout Aware Voltage Island Generation for Low Power Design
Authors: Liangpeng Guo, Yici Cai, Qiang Zhou, Xianlong Hong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Multiple supply voltage (MSV) is one of the most effective schemes to achieve low power, but most works are based on logic level. A few recent works are based on physical level but all of them do not consider level converters which have an important effect in dual-vdd design. In this work we propose a logic and layout aware approach for voltage assignment and voltage island generation in placement process to minimize the number of level converters and to implement voltage islands with minimal overheads. Experimental results show that our approach uses much less level converters than the approach in [1] (reduced by 59.50% on average) when achieving the same power savings. The approach is able to produce feasible placement with a small impact to traditional placement goals.
Schema-Aware Keyword Search over XML Streams
Authors: Weidong Yang, Baile Shi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, we present an approach to process XML stream based on keyword search. We define the keyword search semantic as Meaning Independent Smallest Lowest Common Ancestors (MISLCAs) and query results as Meaning Independent Minimum Connecting Trees (MIMCTs), provide a user-friendly query interface based on keywords and a little XML schema knowledge, refine keyword search to Query Graph based on DTD of XML documents, and give an algorithm to process XML stream and manage the buffer of search results in a single pass efficiently.
Using Types and Inheritance in Object-Oriented Programming
Authors: D. C. Halbert
Venue: IEEE Software (1987)

To be a good object-oriented programmer, you should use types and inheritance wisely. ThiS tutorial will help you do so.