ppxscal/embedding_network huggingface dataset:
Classification of Multi-labeled Data: A Generative Approach
Authors: Andreas P. Streich, Joachim M. Buhmann
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Multi-label classification assigns a data item to one or several classes. This problem of multiple labels arises in fields like acoustic and visual scene analysis, news reports and medical diagnosis. In a generative framework, data with multiple labels can be interpreted as additive mixtures of emissions of the individual sources. We propose a deconvolution approach to estimate the individual contributions of each source to a given data item. Similarly, the distributions of multi-label data are computed based on the source distributions. In experiments with synthetic data, the novel approach is compared to existing models and yields more accurate parameter estimates, higher classification accuracy and ameliorated generalization to previously unseen label sets. These improvements are most pronounced on small training data sets. Also on real world acoustic data, the algorithm outperforms other generative models, in particular on small training data sets.
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
Authors: Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from the source node to all destination nodes. The goal is to minimize the total cost of these routing trees. An improved approximation algorithm is presented, which has a worst case performance ratio of $\frac 85 + \frac 54\rho$. Here ρ denotes the best approximation ratio for the Steiner Minimum Tree problem, and it is about 1.55 at the writing of the paper. This improves upon the previous best having a performance ratio of 2 + ρ.
Approximate Information Filtering in Peer-to-Peer Networks
Authors: Christian Zimmer, Christos Tryfonopoulos, Klaus Berberich, Manolis Koubarakis, Gerhard Weikum
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscribers. This exact publish/subscribe model creates an efficiency and scalability bottleneck, and might not even be desirable in certain applications. The work presented here puts forward MAPS, a novel approach to support approximate information filtering in a peer-to-peer environment. In MAPS a user subscribes to and monitors only carefully selected data sources, and receives notifications about interesting events from these sources only. This way scalability is enhanced by trading recall for lower message traffic. We define the protocols of a peer-to-peer architecture especially designed for approximate information filtering, and introduce new node selection strategies based on time series analysis techniques to improve data source selection. Our experimental evaluation shows that MAPS is scalable; it achieves high recall by monitoring only few data sources.
Wavelet-Based Image Interpolation Using a Three-Component Exponential Mixture Model
Authors: Jing Tian, Wei-Yu Yu, Sheng-Li Xie
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Wavelet-based image interpolation typically treats the input image as the low-pass filtered subbands of an unknown wavelet-transformed high-resolution image, and then produces the unknown high-resolution image by estimating the wavelet coefficients of the high-pass filtered subbands. The major challenge is to exploit the inter-scale correlation among the wavelet coefficients. In contrast to that the conventional Gaussian mixture (GM) model only exploits the magnitude information of the wavelet coefficients, a three-component exponential mixture (TCEM) model is proposed in this paper to investigate both the magnitude information and the sign information of the wavelet coefficients. The proposed TCEM model consists of a Gaussian component, a positive exponential component and a negative exponential component. Furthermore, the proposed TCEM model is exploited to develop an image interpolation approach. Experiments are conducted to demonstrate the superior performance of the proposed approach.
Introducing Aspects to the Implementation of a Java Fork/Join Framework
Authors: Chrysoulis Zambas, Mikel Luján
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

When faced with the question of how will a program exploit the current and upcoming chip multiprocessors, many answers can be produced. Two of the most promising answers are: (1) frameworks or libraries where experts have encapsulated the parallelism, and (2) work stealing as a means of load balancing the work. This paper presents a study of whether aspect-oriented programming can benefit the implementation of a well-known Java framework for divide-and-conquer applications that relies on random work stealing. Despite different kinds of aspects being introduced, the performance evaluation shows no significant overhead due to their inclusion.
Game Model Based Co-evolutionary Algorithm and Its Application for Multiobjective Nutrition Decision Making Optimization Problems
Authors: Gaoping Wang, Liyuan Bai
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Sefrioui introduced the Nash Genetic Algorithm in 1998.This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm.We present A Game model based co-evolutionary algorithm (GMBCA) to solve this class of problems and its performance is analyzed in comparing its results with those obtained with four others algorithms. Finally, the GMBCA is applied to solve the nutrition decision making problem to map the Pareto-optimum front. The results in the problem show its effectiveness.
HomeAway's Transition to Software Product Line Practice: Engineering and Business Results in 60 Days
Authors: Charles W. Krueger, Dale Churchett, Ross Buhrdorf
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The genesis of HomeAway, Inc. was startup by accretion – eight companies in the web-based vacation home rental market were acquired and merged. The technical solution during the merger and acquisition phase was to assimilate the software functionality of each of the eight companies into a one-size-fits-all application that could be configured with runtime settings to support the look-and-feel of the original eight. When rapid growth and an aggressive business plan pushed the one-size-fits-all approach beyond its limits, HomeAway decisively applied the 3-Tiered Software Product Line (SPL) Methodology and the Gears Unified SPL Framework to transition to a Software Product Line practice. This case study explores how HomeAway leveraged the 3-Tiered Methodology and Gears to make their transition, accelerate software development, reduce defect density, lower development overhead, and extend the scalability of its portfolio to better achieve its aggressive business goals – all within 60 days.
Quantum Logical Neural Networks
Authors: Wilson R. de Oliveira, Adenilton J. Silva, Teresa B. Ludermir, Amanda Leonel, Wilson R. Galindo, Jefferson C. C. Pereira
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Quantum analogues of the (classical) Logical Neural Networks (LNN) models are proposed in (q-LNN for short). We shall here further develop and investigate the q-LNN composed of the quantum analogue of the Probabilistic Logic Node (PLN) and the multiple-valued PLN (MPLN) variations, dubbed q-PLN and q-MPLN respectively. Besides a clearer mathematical description, we present a computationally efficient and simply described quantum learning algorithm in contrast to what has been proposed to the quantum weighted version.
IKNN: Informative K-Nearest Neighbor Pattern Classification
Authors: Yang Song, Jian Huang, Ding Zhou, Hongyuan Zha, C. Lee Giles
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

The K-nearest neighbor (KNN) decision rule has been a ubiquitous classification tool with good scalability. Past experience has shown that the optimal choice of K depends upon the data, making it laborious to tune the parameter for different applications. We introduce a new metric that measures the informativeness of objects to be classified. When applied as a query-based distance metric to measure the closeness between objects, two novel KNN procedures, Locally Informative-KNN (LI-KNN) and Globally Informative-KNN (GI-KNN), are proposed. By selecting a subset of most informative objects from neighborhoods, our methods exhibit stability to the change of input parameters, number of neighbors(K) and informative points (I). Experiments on UCI benchmark data and diverse real-world data sets indicate that our approaches are application-independent and can generally outperform several popular KNN extensions, as well as SVM and Boosting methods.
A Web Based Mashup Platform for Enterprise 2.0
Authors: Rama Gurram, Brian Mo, Ralf Gueldemeister
Venue: Proceedings of the 2008 international workshops on Web Information Systems Engineering (2008)

Traditionally, enterprise applications are complex and monolithic. Business operation has become one of the most important factors to determine the efficiency of an organization. Therefore, great amount of customization has to be made with enterprise applications. An organization will have a big competitive advantage if it can adopt new business requirements and processes faster. Today, customization and extension of enterprise applications are hard, time consuming, and require expert knowledge. By means of extending mashup concepts which are popular in consumer space into enterprise applications space, it is possible to make an enterprise platform friendlier for a new generation of developers and users.Enterprise Mashup Application Platform (EMAP) is a browser-based appli-cation composition environment and run-time, which simplifies application development on top of existing, complex enterprise platforms and services. The lightweight platform provides tools to realize mashup applications from conceptualization to deployment with a focus on extensibility, open standards and integration of 3rd party components. EMAP allows the user to create faster time to market, Do It Yourself (DIY) applications quickly and helps the users to create a variety of useful enterprise solutions.
Multiple-Objective Compression of Data Cubes in Cooperative OLAP Environments
Authors: Alfredo Cuzzocrea
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

Traditional data cube compression techniques do not consider the yet relevant problem of compressing data cubes in the presence of multiple objectives rather than only one (e.g., a given space bound). Starting from next-generation OLAP scenarios where this problem makes sense, such as those drawn by cooperative OLAP environments, in this paper we fulfill this lack via (i) introducing and rigorously formalizing the novel multiple-objective data cube compression paradigm, and (ii) providing an effective solution to this problem by means of a greedy algorithm able to find a sub-optimal solution and, as a consequence, an "intermediate" data cube compressed representation that accommodates a large family of even different OLAP queries, which model the multiple requirements in our proposed framework. Finally, we complete our analytical contribution with a wide experimental analysis on benchmark data cubes.
Automating Side Conditions in Formalized Partial Functions
Authors: Cezary Kaliszyk
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions they tend not to explicitly write the side conditions. We present an approach to formalizing partiality in real and complex analysis in total frameworks that allows keeping the side conditions hidden from the user as long as they can be computed and simplified automatically. This framework simplifies defining and operating on partial functions in formalized real analysis in HOL Light. Our framework allows simplifying expressions under partiality conditions in a proof assistant in a manner that resembles computer algebra systems.
Understanding BitTorrent's Suitability in Various Applications and Environments
Authors: Sebastian Kaune, Jan Stolzenburg, Aleksandra Kovacevic, Ralf Steinmetz
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Peer-to-peer systems have recently emerged as an attractive alternative to client/server approaches, especially in the area of content distribution. By efficiently leveraging the available upload bandwidth of the end users, BitTorrent becomes a de facto standard for scalable content distribution. Inspired by its success, many companies try to shift the major upload burden from their rented source servers to end users by using this protocol, since many hosting sites charge them based on the used egress capacity. In this paper, we perform an in-depth study of the overall performance of BitTorrent in its entirety, in order to get a broader understanding of its suitability for different applications domains. We analyze its performance from a bifocal perspective, namely that of the content providers and that of the end users. In this context, we find that the decrease of the source server's upload capacity has a highly negative impact on the overall protocol performance. In addition, it is shown that giving incentives to peers to stay online after completing downloading does not pay off.
Approaches for consistency-preserving simulation through correct detection of update dependency in distributed and parallel real-time simulation
Authors: K. H. Kim
Venue:  (2008)

Ignoring update-dependency relations among simulated items can lead simulation systems into inconsistent states. This becomes a particularly serious issue in distributed and parallel real-time simulation (DPRTS) requiring both high-performance simulation execution and real-time simulation support. An inadequate decomposition of simulation models for distributed execution can result in very high computational cost for detecting update dependencies among simulated items handled by distributed simulators executing on different nodes. In real-time simulation, all the simulation activities including such detection of update dependencies should be completed in a bounded time at every simulation step, and such a time bound can be a safe simulation step-size for all distributed simulators in DPRTS. Therefore, establishment of sound technical foundations for consistency-preserving simulation (CPS) through correct and timely detection of update dependency in DPRTS is an important task. The update dependency and consistency properties are highly application-dependent. Thus, a domain-specific study of DPRTS of moving items in various dimensional spaces has been made in this dissertation to identify critical issues for realizing CPS in DPRTS. The identified issues are correct identification of all update dependency in the system, efficient state update of simulated items that are update-dependent upon each other, and derivation of a tight bound for the safe simulation step size. The main contribution of this research work is a set of effective solutions for the above issues; specifically: (1) a fine-grain space-management method to minimize the search space for update dependency per simulated item, (2) a hierarchical territory-expansion technique to identify update dependency among the moving items under distributed simulation, (3) an ordered state-update method to avoid unnecessary re-simulation of simulated items, and (4) an iterative method to derive an analytical bound on the safe simulation step-size by analyzing three core activities of each simulation step. Moreover, two approaches, which incorporate the proposed solutions, have been formulated for simulating moving items in one-dimensional (1D), two-dimensional (2D), and three-dimensional (3D) space. In order to empirically evaluate their performance, both approaches have been implemented in a DPRTS testbed for simulating flying items in 3D space and the experimental results are discussed in this dissertation. Fault-tolerance support is another important requirement for DPRTS. A typical design template for introducing real-time fault-tolerance support in an existing DPRTS system without any modifications to the original logic of the simulation system has been proposed through an exercise of rapid prototyping of a fault-tolerant DPRTS system. The real-time fault-tolerance capability of the prototype system has been empirically validated.
Production Planning in a Software Product Line Organization
Authors: Gary J. Chastek, John D. McGregor
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Most software product line organizations recognize the need for two roles: core asset developers and product builders. These roles may both be assumed by an individual or each may be assumed by persons who are in different administrative units, in different geographic locations, or of vastly different skill levels.
Direct haptic rendering for large data sets with high gradients
Authors: Bob Ménélas, Nicolas Fauvet, Mehdi Ammi, Patrick Bourdot
Venue: Proceedings of the 2008 Ambi-Sys workshop on Haptic user interfaces in ambient media systems (2008)

This paper addresses haptic rendering for large data sets resulting from CFD (Computational Fluid Dynamics) applications. We present a new haptic interaction technique for volume rendering of isosurfaces. This method is based on an existing process [1]. This contribution makes it possible to take into account 3D regions presenting high frequency data. In addition, with this technique we can explore and understand complex data fields without having any intermediate geometrical representation (such as the polyhedral mesh provided by Marching Cubes [14]), thus having a very fast haptic rendering loop. Lastly, we led several psychophysical studies to assess the interest of this method for isosurface haptization.
Analysis of the energy dissipation capacity in case of neoprene vibration isolators modelled as high performance rheological systems
Authors: Polidor Bratu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper deals with the vibration isolators having suitable three-dimension distribution for the materials consisting of rubber and/or neoprene with different rheological characteristics. Thus, the method to realize neoprene elements having symmetrical geometric distribution in various volumes is used so that when curing the used materials have influence upon the global dissipation of the vibratory energy. During the research there were analyzed rheological models such as: Voigt-Kelvin and Hooke-Maxwell, so that finally the product is characterized by a complex model able to assure the necessary elasticity and beside this the global dissipation at values of about 40-50 %.
Independence of Perception and Action for Grasping Positions
Authors: Takahiro Fujita, Yoshinobu Maeda, Masazumi Katayama
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper, we investigate the independence between perception and action that has been reported in the previous psychophysical studies. The independence, however, might not be directly investigated because illusion tasks, such as the Ebbinghaus illusion, are used in those studies, although those findings are quite attractive. Thus, the independence may include specific characteristics in the illusion tasks. From this point of view, we focuses on grasping positions when grasping an object, such as a tool, which is used in our daily life. In the first experiment, we investigate the independence of the grasping positions by using the following measurement tasks: 1) a visual-estimation task that the grasping positions are visually estimated, 2) a pinch task that only grasps an object without lifting-up its grasped object and 3) a lift-up task that grasps an object and lifts it up. As a result, both the grasping positions of the visual-estimation and lift-up tasks are significantly different. Thus, these results indicate the independence of perception and action for grasping movement in daily life. In addition, those of the pinch and lift-up tasks are significantly different amazingly, although both the tasks can be considered as an action task. In the second experiment, for the pinch and lift-up tasks, we examine the difference of both the trajectories of the finger tip and moreover the influence of visual feedback for the grasping positions. As a result, we confirmed that the above results are not affected by the visual information perceived from own hand and arm during the movement. Moreover, these results indicate that grasping positions are determined before movement because both the trajectories are different just after movement onset. Finally, our findings are quit attractive because the difference of the grasping positions may be explained based on the Goodale's hypothesis ("how system" and "what system").
Performance analysis of three step positive input shaping
Authors: Sirri Sunay Gürleyük, Özgür Bahadir, Yunus Türkkan, Hakan Üsenti
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Input shaping is a residual vibration reducing technique for flexible structures. The desired command is convolved by a sequence of impulses to generate an input shaper so that the system reaches the set point in a minimum duration. Zero Vibration (ZV) shaper is the first form of input shaping technique. Zero Vibration and Derivative (ZVD) and Extra Insensitive (EI) are the most preferred shapers. These shapers are developed to improve the robustness respect to modeling errors. Solution of the parameters requires the derivation of constraint equations. Therefore, these shapers can only be used for linear systems. This paper presents that ZVD and EI shapers are the special solutions of Three-Step (TS) input shaping space. By using TS technique, infinite number of three impulse shaper solution can be generated for both positive and negative impulse amplitudes including ZVD and EI. The duration of the shaper is between ZV and ZVD. Some of them are better in robustness somewhat. Analyses and results of some specific points are given for the time-robustness compromise.