ppxscal/embedding_network huggingface dataset:
Tri-Training Based Learning from Positive and Unlabeled Data
Authors: Bangzuo Zhang, Wanli Zuo
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper studies the problem of learning text classifier using positive and unlabeled examples with tri-training algorithm, which has been brought forward for semi-supervised learning. The key feature is that there are no negative examples. This paper proposed a new tri-training algorithm for the LPU problem that combines the step 1 of the three LPU algorithms to extract a reliable negative examples set, consequently to build an initial classifier for the tri-training and replace the bootstrap sampling procedure that has not been thought as a good method, and then iteratively use the three SVM classifiers until they convergence. Experiments on the popular Reuter21578 collection show the effectiveness of our proposed technique.
Assessing Software Archives with Evolutionary Clusters
Authors: Adam Vanya, Lennart Hofland, Steven Klusener, Piërre van de Laar, Hans van Vliet
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

The way in which a system's software archive is partitioned influences the evolvability of that system. The partition of a software archive, e.g. subsystem decomposition, is mostly assessed by looking at the static (include, call) relations between the parts. In the literature history information is also taken into account to assess the partition. In this paper we describe our history-based approach to (automatically) assess the extent in which a certain partition allows its parts to evolve independently. We use the assumption that software entities which co-evolved often in the past are likely to be modified together in the near future as well. Hence, the elements of such a set should in principle belong to the same part. Our approach, therefore, identifies sets of co-evolving software entities, where each set has elements from more than one part of the archive. We illustrate our approach with a case study of a large software system that evolved during more than a decade, and has over 7 million lines of code.
Automatic disassembly system architecture for end-of-life vehicles
Authors: A. Sánchez, R. Zotovic, A. Valera, E. J. Bernabeu, C. Ricolfe, E. Olmos, A. Robertsson, Y. K. Nilsson
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Demands of society (environmental concerns, climate change, etc.) and the legal frame (European Directive 2000/53/CE, national and local laws, etc.) are forcing manufacturing industry to reuse and recycle products at the end of their life for ecological and economical reasons. Therefore, in order to fulfil these demands, the design of automatic disassembly cells for end-of-life products is an imperative issue. The aim of this paper is to design a flexible architecture (control architecture, operations definition, trajectories planning, etc.) of a robotic disassembly cell which works totally automated and performs some of the operations needed for decontaminating a vehicle. This cell is reproduced (on the laboratory scale) with robots using pneumatic tools for cutting, drilling, unscrewing and handling to carry out different operations. Furthermore, these robots have sensors (vision systems, force and torque sensors, etc.) for monitoring and controlling some of these operations.
Non-minimal State Dependent Riccati Equation and Pole Assignment Control of Nonlinear Systems
Authors: C. James Taylor, Arun Chotai
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper considers pole assignment and Riccati equation control of nonlinear dynamic systems described by State Dependent Parameter (SDP) models. The approach follows from earlier research into linear Proportional-Integral-Plus (PIP) methods but, in SDP system control, the control coefficients are updated at each sampling instant on the basis of the SDP relationships. Alternatively, algebraic solutions can be derived off-line to yield a practically useful control algorithm that is relatively straightforward to implement on a digital computer, requiring only the storage of lagged system variables, coupled with straightforward arithmetic expressions in the control software. Two examples are used to illustrate the approach. In the first instance, state space matrix analysis of a first order system shows that the expected design response is obtained for specified pole positions, including dead-beat; hence, assuming pole assignability at each sample, global stability of the nonlinear system is guaranteed at the design stage. Secondly, the paper evaluates the approach for a classical, physically-based simulation model of an inverted pendulum.
A Low-Cost Distributed Architecture for Telecommunicaion Systems
Authors: Giancarlo Micheletti, Claudio Salati
Venue: IEEE Micro (1987)

Carefully considered hardware/software trade-offs and application-tailored protocols produced a low-cost, nonstandard LAN with satisfactory performance. Its peculiarities are hidden in a standard IEEE 802 LCC layer.
Characterization of Graphs Using Degree Cores
Authors: John Healy, Jeannette Janssen, Evangelos Milios, William Aiello
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

Generative models are often used in modeling real world graphs such as the Web graph in order to better understand the processes through which these graphs are formed. In order to determine if a graph might have been generated by a given model one must compare the features of that graph with those generated by the model. We introduce the concept of a hierarchical degree core tree as a novel way of summarizing the structure of massive graphs. The degree core of level k is the unique subgraph of minimal degree k. Hierarchical degree core trees are representations of the subgraph relationships between the components of the degree core of the graph, ranging over all possible values of k. We extract features related to the graph's local structure from these hierarchical trees. Using these features, we compare four real world graphs (a web graph, a patent citation graph, a co-authorship graph and an email graph) against a number of generative models.
Improvement of Fusion Algorithm Based on Evidence Theory
Authors: Yi Chen, Gai-yun Wang, Bing Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The relationship between basic probability assignment (BPA) and belief function in evidence theory is studied. The idea that belief function is regarded as BPA in data fusion is firstly introduced in this paper. An improved fusion algorithm based on distributed fusion method is put forward using this idea. The improved algorithm is called 'distributed fusion algorithm based on belief function assignment'. Through the experimental simulations to the traditional distributed fusion algorithm and the improved algorithm, the results show that the two algorithms are both valid in property identification.
Tactile chart generation tool
Authors: Cagatay Goncu, Kim Marriott
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

We have implemented a Java application that automatically generates tactile bar and pie charts from data values given in a formatted text file. The tool is designed to semi-automate the construction of tactile versions of bar and pie charts in educational material. The tool provides a wide variety of layout styles. While the tool allows the user to fine tune the layout, the generated SVG diagram can also be modified in a standard diagram editor.
Learning Bidirectional Similarity for Collaborative Filtering
Authors: Bin Cao, Jian-Tao Sun, Jianmin Wu, Qiang Yang, Zheng Chen
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Memory-based collaborative filtering aims at predicting the utility of a certain item for a particular user based on the previous ratings from similar users and similar items. Previous studies in finding similar users and items are based on user-defined similarity metrics such as Pearson Correlation Coefficient or Vector Space Similarity which are not adaptive and optimized for different applications and datasets. Moreover, previous studies have treated the similarity function calculation between users and items separately. In this paper, we propose a novel adaptive bidirectional similarity metric for collaborative filtering. We automatically learn similarities between users and items simultaneously through matrix factorization. We show that our model naturally extends the memory based approaches. Theoretical analysis shows our model to be a novel generalization of the SVD model. We evaluate our method using three benchmark datasets, including MovieLens, EachMovie and Netflix, through which we show that our methods outperform many previous baselines.
A new method for real time control of actuators in continuous flux
Authors: Luige Vladareanu, Ion Ion, Lucian M. Velea, Mihai S. Munteanu, Octavian Melinte, Alexandru Gal
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper presents a new real time control method in actuators continuous flux and their implementation using complex automations, aimed at determining the behaviour, functional parameters and performances, with direct application to constructing electrical motors trial stands. There are presented theoretic considerations, the actuators real time control system architecture, mathematic modelling, experimental results and comparative measurement graphs related to the method's performances. These lead to the possibility of predicting actuator performances through indirect measurements without the measurement signals being generated by the tested actuator as they are in the case of direct measurement methods. Thus, it allows for development of complex systems while reducing the trial time and increasing the measurement precision. Theoretic and experimental results have shown that the behaviour errors of the actuators that have been tested through the proposed method are less than 1% while the testing duration is over 30 times less.
Reducing Internet-Based Intrusions: Effective Security Patch Management
Authors: Bill Brykczynski, Robert A. Small
Venue: IEEE Software (2003)

Effective security patch management is critical to defending against Internet-based attacks. Despite its importance, surprisingly little has been written on the processes that organizations use to implement patch management. This article examines eight key practices intrinsic to effective, systematic, and repeatable patch management and proposes performance measures for evaluating it. The authors derived these key practices from industry pilot projects for improving patch management.
Towards Inferring Sequential-Global Dimension of Learning Styles from Mouse Movement Patterns
Authors: Danilo Spada, Manuel Sánchez-Montañés, Pedro Paredes, Rosa M. Carro
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

One of the main concerns of user modelling for adaptive hypermedia deals with automatic user profile acquisition. In this paper we present a new approach to predict sequential/global dimension of Felder-Silverman's learning style model that only makes use of mouse movement patterns. The results obtained in a case study with 18 students are very promising. We found a strong correlation between maximum vertical speed and sequential/global dimension score. Moreover, it was possible to predict whether students' learning styles are global or sequential with high accuracy (94.4%). This suggests that mouse movement patterns can be a powerful source of information about certain user features.
Service-Oriented Commonality Analysis Across Existing Systems
Authors: Alexander Harhurin, Judith Hartmann
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

This paper introduces an extractive approach to building-up a product line based on existing systems. Thereby, we focus on the analysis of common functionalities across different systems. Our commonality analysis is performed on the functional level which offers the highest reuse potential. We use the service diagram, a formally founded specification technique, for the functional specification. This allows us to perform the commonality analysis based on a formal definition of the system behavior. Concepts for the comparison of service diagrams and a methodology for building-up a service diagram of a product line are described in the paper. Additionally, since legacy systems rarely have an accurate functional specification, we present a methodology for extracting such a specification out of a given logical architecture.
Lipless Tracking and Emotion Estimation
Authors: Shafiq ur Réhman, Li Liu, Haibo Li
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Automatic human lip tracking is one of the key components tomany facial image analysis tasks, such as, lip-reading and emotion from lips. It has been a classical hard image analysis problem over decades. In this paper, we propose an indirect lip tracking strategy: `lipless tracking'. It is based on the observation that many of us don't have clear lips and some even don't have visible lips. The strategy is to select and localize stable lip features around the mouth for tracking. For this purpose deformable contour-segments are modelled based on lip features and tracking is done using dynamic programming and Viterbi Algorithm. The strength of proposed algorithm is demonstrated in emotion estimation domain. Finally, real-time video experiments performed on private and publicity available data set (MMI face database) have shown the robustness of our proposed lipless tracking technique.
Spatio-temporal Speckle Reduction in Ultrasound Sequences
Authors: Noura Azzabou, Nikos Paragios
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In this paper we will be concerned with speckle removal in ultrasound images. To this end, we introduce a new spatio-temporal denoising method based on a variational formulation. The regularization relies on a non parametric image model that describes the observed image structure and express inter-dependencies between pixels in space and time. Furthermore, we introduce a new data term adapted to the Rayleigh distribution of the speckle. The interaction between pixels is determined through the definition of new measure of similarity between them to better reflect image content. To compute this similarity measure, we take into consideration the spatial aspect as well as the temporal one. Experiments were carried on both synthetic and real data and the results show the potential of our method.
Comparing Rule Measures for Predictive Association Rules
Authors: Paulo J. Azevedo, Alípio M. Jorge
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We study the predictive ability of some association rule measures typically used to assess descriptive interest. Such measures, namely conviction, lift and ¿ 2 are compared with confidence, Laplace, mutual information, cosine, Jaccard and ¿-coefficient. As prediction models, we use sets of association rules. Classification is done by selecting the best rule, or by weighted voting. We performed an evaluation on 17 datasets with different characteristics and conclude that conviction is on average the best predictive measure to use in this setting. We also provide some meta-analysis insights for explaining the results.
Architectural and compiler mechanisms for accelerating single thread applications on multicore processors
Authors: Scott Mahlke
Venue:  (2008)

Multicore systems have become the dominant mainstream computing platform. One of the biggest challenges going forward is how to efficiently utilize the ever increasing computational power provided by multicore systems. Applications with large amounts of explicit thread-level parallelism naturally scale performance with the number of cores. However, single-thread applications realize little to no gains from multicore systems. This work investigates architectural and compiler mechanisms to automatically accelerate single thread applications on multicore processors by efficiently exploiting three types of parallelism across multiple cores: instruction level parallelism (ILP), fine-grain thread level parallelism (TLP), and speculative loop level parallelism (LLP). A multicore architecture called Voltron is proposed to exploit different types of parallelism. Voltron can organize the cores for execution in either coupled or decoupled mode. In coupled mode, several in-order cores are coalesced to emulate a wide-issue VLIW processor. In decoupled mode, the cores execute a set of fine-grain communicating threads extracted by the compiler. By executing fine-grain threads in parallel, Voltron provides coarse-grained out-of-order execution capability using in-order cores. Architectural mechanisms for speculative execution of loop iterations are also supported under the decoupled mode. Voltron can dynamically switch between two modes with low overhead to exploit the best form of available parallelism. This dissertation also investigates compiler techniques to exploit different types of parallelism on the proposed architecture. First, this work proposes compiler techniques to manage multiple instruction streams to collectively function as a single logical stream on a conventional VLIW to exploit ILP. Second, this work studies compiler algorithms to extract fine-grain threads. Third, this dissertation proposes a series of systematic compiler transformations and a general code generation framework to expose hidden speculative LLP hindered by register and memory dependences in the code. These transformations collectively remove inter-iteration dependences that are caused by subsets of isolatable instructions, are unwindable, or occur infrequently. Experimental results show that proposed mechanisms can achieve speedups of 1.33 and 1.14 on 4 core machines by exploiting ILP and TLP respectively. The proposed transformations increase the DOALL loop coverage in applications from 27% to 61%, resulting in a speedup of 1.84 on 4 core systems.
A Clustering Technique for Video Copy Detection
Authors: N. Guil, J. M. González-Linares, J. R. Cózar, E. L. Zapata
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this work, a new method for detecting copies of a query video in a videos database is proposed. It includes a new clustering technique that groups frames with similar visual content, maintaining their temporal order. Applying this technique, a keyframe is extracted for each cluster of the query video. Keyframe choice is carried out by selecting the frame in the cluster with maximum similarity to the rest of frames in the cluster. Then, keyframes are compared to target videos frames in order to extract similarity regions in the target video. Relaxed temporal constraints are subsequently applied to the calculated regions in order to identify the copy sequence. The reliability and performance of the method has been tested by using several videos from the MPEG-7 Content Set, encoded with different frame sizes, bit rates and frame rates. Results show that our method obtains a significant improvement with respect to previous approaches in both achieved precision and computation time.
A Watermarking Scheme Based on Principal Component Analysis Technique
Authors: Chin-Chen Chang, Chi-Shiang Chan
Venue: Informatica (2003)

In this paper, we shall propose a new method for the copyright protection of digital images. To embed the watermark, our new method partitions the original image into blocks and uses the PCA function to project these blocks onto a linear subspace. There is a watermark table, which is computed from projection points, kept in our new method. When extracting a watermark, our method projects the blocks of the modified image by using the PCA function. Both the newly projected points and the watermark table are used to reconstruct the watermark. In our experiments, we have tested our scheme to see how it works on original images modified by JPEG lossy compression, blurring, cropping, rotating and sharpening, and the experimental results show that our method is very robust and indeed workable.
Content-Based Intelligent Routing and Message Processing in Enterprise Service Bus
Authors: Gulnoza Ziyaeva, Eunmi Choi, Dugki Min
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Enterprise Service Bus (ESB) provides a layer on top of an implementation of an enterprise messaging system. The ESB provides a highly distributed, event-driven Service Oriented Architecture (SOA) that combines Message Oriented Middleware (MOM), Web services,intelligent routing based on content, and XML data transformation. ESB transmits and receives standard set of messages. When it receives a message, it routes it to the appropriate application. Content-based intelligent routing supports service selection and composition. However, current ESB software can only support fixed routing by static configuration files. This paper proposes framework to enable the content-based intelligent routing path construction and message routing. In proposed framework there are 3 main layers: Business Process, ESB and Implementation Layer to define the routing tables and mechanisms of message routings, to support service selection preferences and facilitate the service selection based on message content.
Algorithmic Aspects of Graph Connectivity, 1 edition
Authors: Hiroshi Nagamochi, Toshihide Ibaraki
Venue:  (2008)

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors comprehensively discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
Conceptual Graphs and Ontologies for Information Retrieval
Authors: Catherine Comparot, Ollivier Haemmerlé, Nathalie Hernandez
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We propose a mechanism for annotating and querying document collections based on the semantic modeling of the context of a search. We model on the one hand the topics concerned by the content of the document and on the other hand the metadata associated with the documents, by means of two ontologies expressed in the conceptual graph model. The semantic annotating mechanism is done by automatically building conceptual graphs.