ppxscal/embedding_network huggingface dataset:
UJM at INEX 2007: Document Model Integrating XML Tags
Authors: Mathias Géry, Christine Largeron, Franck Thollard
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

Different approaches have been used to represent textual documents, based on boolean model, vector space model or probabilistic models. In text mining as in information retrieval (IR), these models have shown good results about textual documents modeling. They nevertheless do not take into account documents structure. In many applications however, documents are inherently structured (e.g. XML documents).In this article, we propose an extended probabilistic representation of documents in order to take into account a certain kind of structural information: logical tags that represent the different parts of the document and formatting tags used to emphasized text. Our approach includes a learning step that estimates the weight of each tag. This weight is related to the probability for a given tag to distinguish the relevant terms.
Human Motion Analysis Using Eroded and Restored Skeletons
Authors: Rong Hu, Chucai Yi, Hongyuan Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Skeleton has been found a very useful feature in human motion analysis and gait recognition. However, it is usually hard to obtain the right feature skeleton because of shape variance of human silhouette and noise. Due to those reasons, unexpected skeleton branches will exist together with the main components of human body. To delete the unexpected branches, a silhouette reconstruction method is proposed to cope with the shadow problem in foot area, while a skeleton pruning technique using skeleton erosion and restoration is proposed to extract the main body parts. The final skeleton can be used as a high level gait feature to carry out further motion type analysis.
Tracking the Swimming Motions of C. elegans Worms with Applications in Aging Studies
Authors: Christophe Restif, Dimitris Metaxas
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Quantitative analysis of the swimming motions of C. elegans worms are of critical importance for many gene-related studies on aging. However no automated methods are currently in use. We present a novel training-based method that automatically tracks and segments multiple swimming worms, in challenging imaging conditions. The position of each worm is predicted by comparing its latest motion with a set of previous observations, and then adjusted laterally and longitudinally to fit the image. After segmentation, a variety of measures can be used to assess the evolution of swimming patterns over time, allowing a quantitative comparison of worm populations over their lifetime. The complete software is being evaluated for mass processing in biology laboratories.
Back-to-Front Display of Voxel Based Objects
Authors: Gideon Frieder, Dan Gordon, R. Reynolds
Venue: IEEE Computer Graphics and Applications (1985)

This straightforward 3-D display algorithm traverses voxels slice by slice to project each voxel on the screen. No surface detection or z-buffer is needed.
A Bounded Index for Cluster Validity
Authors: Sandro Saitta, Benny Raphael, Ian F. Smith
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Clustering is one of the most well known types of unsupervised learning. Evaluating the quality of results and determining the number of clusters in data is an important issue. Most current validity indices only cover a subset of important aspects of clusters. Moreover, these indices are relevant only for data sets containing at least two clusters. In this paper, a new bounded index for cluster validity, called the score function (SF), is introduced. The score function is based on standard cluster properties. Several artificial and real-life data sets are used to evaluate the performance of the score function. The score function is tested against four existing validity indices. The index proposed in this paper is found to be always as good or better than these indices in the case of hyperspheroidal clusters. It is shown to work well on multi-dimensional data sets and is able to accommodate unique and sub-cluster cases.
Modelling the CoCoME with DisCComp
Authors: André Appel, Sebastian Herold, Holger Klus, Andreas Rausch
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Most large-scaled software systems are logically structured in subsystems resp. components to cope with complexity. These components are deployed and executed within an distributed system infrastructure. Consequently, for many reasons, like for instance multi-user support or performance issues, the components are to some extent concurrently executed within an distributed environement. Note, this also holds for the Common Component Modelling Example (CoCoME).
PrintMonkey: giving users a grip on printing the web
Authors: Jennifer Baldwin, James A. Rowson, Yvonne Coady
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Web content is notoriously difficult to capture on a printed page due to inconsistent and undesired results. Items that users may not want to print, such as media, navigation menus and more show up on their page. Other items that they may care about are truncated or spread across several pages. Some tools exist to help users with what is printed, but they often are cumbersome to use or are costly for a company to maintain. Therefore, we introduce PrintMonkey, which allows users to write their own printing templates and share them with others on the web. No modifications to the original webpages are required and users with less development experience can use and develop templates. A comparison with four alternative solutions reveals the concrete ways in which PrintMonkey improves upon existing approaches in terms of functionality, customizability and scalability.
Guest Editors' Introduction: Interaction of Many-Core Computer Architecture and Operating Systems
Authors: Sangyeun Cho, Tao Li, Onur Mutlu
Venue: IEEE Micro (2008)

Rapid changes in platform hardware resources with the evolution of many-core architectures will require a fundamental reexamination of mainstream system-software design decisions to support multiple cores and to efficiently manage on-chip hardware resources shared among the multiple cores. In turn, the evolution of many-core processor architectures will be successfully sustained by the new capabilities and features added to the system software, perhaps while requiring substantial support from hardware. The guest editors introduce five articles on the interaction of computer architecture and operating systems for this special issue of IEEE Micro.
Estimating the Detectability of Small Lesions in High Resolution MR Compressed Images
Authors: Juan Paz, Marlen Pérez, Iroel Miranda, Peter Schelkens
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Quality degradation in high resolution magnetic resonance (MR) images compressed with JPEG2000 is studied. The present study combines the results of ten quantitative quality criteria with four mathematical observer models to estimate the maximum achievable compression rate (CR) that does not affect an effective diagnosis of specific pathologies related with small lesions detection such as Multiple Sclerosis or Virchow Robins disease. The graphical behavior of metrics employed is presented. At bitrate = 0.062 bpp (CR=160:1) the most compression is achieved while images still preserve the information needed for a safe diagnosis. Images compressed using smaller values than this would be no longer useful for diagnosis tasks. This result facilitates a safer use of the JPEG 2000 codec when compressing high resolution images like the images tested, and assures a safer diagnosis task when dealing with small size lesions that define certain pathology.
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
Authors: Tomáš Skopal, Jakub Lokoč
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric properties (reflexivity, non-negativity, symmetry, triangle inequality). Recently, the introduction of TriGen algorithm (turning any nonmetric into metric) enabled MAMs to perform also nonmetric similarity search. Moreover, it simultaneously enabled faster approximate search (either metric or nonmetric). However, a simple application of TriGen as the first step before MAMs' indexing assumes a fixed "approximation level", that is, a user-defined tolerance of retrieval precision is preset for the whole index lifetime. In this paper, we push the similarity search forward; we propose the NM-tree (nonmetric tree) --- a modification of M-tree which natively aggregates the TriGen algorithm to support flexible approximate nonmetric or metric search. Specifically, at query time the NM-tree provides a user-defined level of retrieval efficiency/precision trade-off. We show the NM-tree could be used for general (non)metric search, while the desired retrieval precision can be flexibly tuned on-demand.
A Cellular Structure for Online Routing of Digital Spiking Neuron Axons and Dendrites on FPGAs
Authors: Hooman Shayani, Peter Bentley, Andy M. Tyrrell
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

As a step towards creating evolutionary developmental neural networks on FPGAs, a bio-inspired cellular structure suitable for online routing of axons and dendrites on FPGAs based on a new digital spiking neuron model (introduced previously by the authors) is proposed here. This structure is designed to allow changing the routing of the dendrites and axons and formation/elimination of synapses on the fly by dynamic partial reconfiguration of the LUTs. The feasibility and techniques for implementing this structure on a Xilinx Virtex-5 FPGA are also studied.
Bipartite Graph Based Dynamic Spectrum Allocation for Wireless Mesh Networks
Authors: Jianjun Yang, Zongming Fei
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

The capacity of a wireless mesh network can be improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. By letting these nodes utilize the available spectrum opportunistically, we can increase the utilization of the available bandwidth in the spectrum space. The key problem is how to allocate the spectrum to these multi-radio nodes, especially when they are heterogeneous with diverse transmission types and bandwidth. Most of current work has been based on the conflict-graph model and given solutions that focused on either increasing bandwidth utilization or minimizing starvation. In this paper, we propose a new bipartite-graph based model and design an channel allocation algorithm that considers both bandwidth utilization and starvation problems. Our solution is based on using augmenting path to find a matching in the bipartite-graph and can minimize starvation and then maximize the bandwidth utilization. The simulations demonstrate that our algorithm can reduce the starvation ratio and improve the bandwidth utilization, compared with previous conflict-graph based algorithms.
Algorithms for String Pattern Discovery
Authors: Hideo Bannai
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

Pattern discovery from string data is an important problem with many applications. In this paper, we give a brief overview of our work on the optimal correlated pattern discovery problem, which integrates numerical attribute information into the string pattern discovery process.
The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms
Authors: Reza Moraveji, Hamid Sarbazi-Azad, Arash Tavakkol
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Designing an efficient deadlock-free routing is a point of concern for irregular topologies. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms in the content of a new family of algorithms called label-based routing algorithms for irregular topologies. In addition, the newly proposed family covers three previously reported routing algorithms [2, 3]. Moreover, by simulating and comparing the newly and traditional proposed routing methods, it is shown that the performance of this family highly depends on the network topology and channel labeling process.
Non-uniform Gradient Prescription for Precise Angular Measurements Using DTI
Authors: Nathan Yanasak, Jerry D. Allison, Qun Zhao, Tom C. Hu, Krishnan Dhandapani
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Diffusion Tensor Imaging (DTI) calculates a tensor for each voxel, representing the mean diffusive characteristics in volume-averaged tissue. Gradients that phase-encode spins according to the amount of their diffusion are usually applied uniformly over a sphere during a DTI procedure for minimal bias of tensor information. If prior knowledge of diffusion direction exists, the angular precision for determining the principle eigenvector of cylindrically-symmetric ("prolate") tensors can be improved by specifying gradients non-uniformly. Improvements in precision of 30-40% can be achieved using a restricted band of zenith angle values for gradient directions. Sensitivity to the a priori angular range of the principle eigenvector can be adjusted with the width of the band. Simulations and phantom data are in agreement; a preliminary validation is presented.
Binary Optimization: On the Probability of a Local Minimum Detection in Random Search
Authors: Boris Kryzhanovsky, Vladimir Kryzhanovsky
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The problem of binary optimization of a quadratic functional is discussed. By analyzing the generalized Hopfield model we obtain expressions describing the relationship between the depth of a local minimum and the size of the basin of attraction. Based on this, we present the probability of finding a local minimum as a function of the depth of the minimum. Such a relation can be used in optimization applications: it allows one, basing on a series of already found minima, to estimate the probability of finding a deeper minimum, and to decide in favor of or against further running the program. The iterative algorithm that allows us to represent any symmetric N ×N matrix as a weighted Hebbian series of bipolar vectors with a given accuracy is proposed. It so proves that all conclusions about neural networks and optimization algorithms that are based on Hebbian matrices are true for any other type of matrix. The theory is in a good agreement with experimental results.
Sensor node localization using SIFT algorithm
Authors: Daniela Fuiorea, Vasile Gui, Dan Pescaru, Petronela Paraschiv, Istin Codruta, Daniel Curiac, Constantin Volosencu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Sensor localization is required by most Wireless Sensor Networks applications. Considering application for video surveillance, localization includes not only spatial coordination but also cameras direction and videofield overlap estimation. This paper presents a novel technique for localization in a Video-based Wireless Sensor Network using image registration that involves SIFT algorithm for automatic features selection. Experimental results show the estimation accuracy and time efficiency comparing with manual solution.
Effectively Managing Proposal Development in the IT Services World
Authors: Vikas Dewangan
Venue: IT Professional (2008)

This best-practices framework is designed to help managers develop successful IT services proposals in today's challenging and highly competitive globalized environment.
Biomedical knowledge discovery using the gene ontology database
Authors: James Z. Wang
Venue:  (2008)

The Gene Ontology (GO) is a large public database that not only provides a set of controlled biological and biochemical vocabularies (terms) to describe gene products based upon their functions in the cell, but also contains gene annotation data from heterogeneous data sources. Although the controlled biochemical or biological vocabularies in the GO database address the need for consistent descriptions of genes in different data sources, there is still not an accurate and effective method to quantitatively determine the functional similarities of genes or gene products based on gene annotation information from heterogeneous data sources. To address this critical need, a novel method to decode a GO term's semantics (biological meanings) into a numeric value by aggregating the semantic contributions of its ancestor terms including this term in the GO graph is proposed. In turn, a family of new algorithms for calculating the similarity of GO terms is proposed. Based on the semantic similarities of GO terms used for annotating genes, new algorithms to measure the functional similarities of genes are designed. Our methods, which are capable of finding functionally equivalent or functionally related proteins that are not homologous, are independent of their sequence similarities. The results of using one of these algorithms to measure the functional similarities of genes in pathways retrieved from the Saccharomyces Genome Database (SGD) and the outcomes of clustering these genes based on the similarity values obtained by the algorithm are shown to be consistent with the existing biological experiments. Furthermore, a set of online tools for GO similarity measurement, gene similarity measurement and knowledge discovery have been developed. Formal analysis demonstrate the correctness of algorithms on which these tools base, and experimental studies show the efficiency of these tools. These tools have been widely used by biomedical researchers all over the world.
Infinite Computations and a Hierarchy in Δ3
Authors: Branislav Rovan, L'Uboš Steskal
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We present a hierarchy of families between the Σ 2 and Δ 3 levels of the arithmetic hierarchy. The structure of the top five levels of this hierarchy is in some sense similar to the structure of the Chomsky hierarchy, while the bottom levels are reminiscent of the bounded oracle query hierarchy.
Games, Automata and Matching
Authors: Colin Stirling
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Higher-order matching is the problem given t = u where t, u are terms of simply typed ¿-calculus and u is closed, is there a substitution ¿ such that t ¿ and u have the same normal form with respect to β¿-equality: can t be pattern matched to u? The problem was conjectured to be decidable by Huet [4]. Loader showed that it is undecidable when β-equality is the same normal form by encoding ¿-definability as matching [6].
Complementing Visual Data Mining with the Sound Dimension: Sonification of Time Dependent Data
Authors: Monique Noirhomme-Fraiture, Olivier Schöller, Christophe Demoulin, Simeon J. Simoff
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

This chapter explores the extension of visual data mining by adding a sound dimension to the data representation. It presents the results of an early 2001 experiments with sonification of 2D and 3D time series data. A number of sonification means for these experiments have been implemented. The goal of these experiments was to determine how sonification of two and three-dimensional graphs can support and complement or even be an alternative to visually displayed graphs. The research methodology used the triangulation method, combining the automated generation of the sound patterns with two evaluation techniques. The first one included the assessment and evaluation of the sound sequences of the sonified data by the participants in the experiment via a dedicated server. The second one was based on the analysis of an evaluation questionnaire, filled by each participant that performed the tests. The chapter presents the results and the issues raised by the experiments.
Privacy-Preserving Collaborative E-Voting
Authors: Gary Blosser, Justin Zhan
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

We propose a cooperative multi-party system where unrelated entities can both both vote and change their vote with continual accurate tabulation results while retaining vote privacy. The voting protocol presented uses homomorphic encryption, digital envelopes, Hamming weights, multiple parties to fulfill the needs of an e-voting system. The protocol is presented and limitations are explored.
Find Key m/z Values in Predication of Mass Spectrometry Cancer Data
Authors: Yihui Liu, Li Bai
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

To find the significant biomarker is very important in detecting protein patterns associated with diseases. In this study multilevel wavelet analysis is performed on high dimensional mass spectrometry data to extract the detail coefficients, which are used to detect the difference between cancer tissue and normal tissue. In order to find the key m/z values of mass spectra, wavelet detail information is reconstructed based on orthogonal wavelet detail coefficients, and genetic algorithm is further employed to select best features from the reconstructed detail information. Finally the corresponding significant m/z values of mass spectra are identified using the optimized detail features.
Active capture of wireless traces: overcome the lack in protocol analysis
Authors: Jae-Yong Yoo, Thomas Heuhn, JongWon Kim
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Even though hot spots and mesh networks increasingly realize the long-standing vision of ubiquitous Internet access, our understanding of wireless protocols and system is still in its infancy. To analyze and debug the current and new protocols, packet-level accurate information of protocol status is crucially needed. Thus, this paper introduces PaPMo (Packet accurate Protocol Monitor), an active monitoring tool that captures snapshots of the protocol status as packets pass through the different layers and over distributed nodes. By merging and correlating the captured information, PaPMo is able to provide packet-level accurate information of deployed wireless network behavior that is currently available only via simulations. We show that PaPMo is able to correlate MAC-layer events, such as packet loss due to queue overflow, with TCP congestion control behavior at the accuracy of microseconds and with high fidelity.
Tornado: A Data-Base Management System for Graphics Applications
Authors: S. Ulfsby
Venue: IEEE Computer Graphics and Applications (1982)

Designed to handle complex network data structures, this DBMS is at work in solid and surface modeling, drafting, and part-coding applications.