ppxscal/embedding_network huggingface dataset:
Semi-supervised Discriminant Analysis Via CCCP
Authors: Yu Zhang, Dit-Yan Yeung
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Linear discriminant analysis (LDA) is commonly used for dimensionality reduction. In real-world applications where labeled data are scarce, LDA does not work very well. However, unlabeled data are often available in large quantities. We propose a novel semi-supervised discriminant analysis algorithm called SSDA$_{\mathit{CCCP}}$. We utilize unlabeled data to maximize an optimality criterion of LDA and use the constrained concave-convex procedure to solve the optimization problem. The optimization procedure leads to estimation of the class labels for the unlabeled data. We propose a novel confidence measure for selecting those unlabeled data points with high confidence. The selected unlabeled data can then be used to augment the original labeled data set for performing LDA. We also propose a variant of SSDA$_{\mathit{CCCP}}$, called M-SSDA$_{\mathit{CCCP}}$, which adopts the manifold assumption to utilize the unlabeled data. Extensive experiments on many benchmark data sets demonstrate the effectiveness of our proposed methods.
On the History of the Minimum Spanning Tree Problem
Authors: R. L. Graham, Pavol Hell
Venue: IEEE Annals of the History of Computing (1985)

It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Prim (1957) as the sources of the problem and its first efficient solutions, despite the citation by both of Boruvka (1926) as a predecessor. In fact, there are several apparently independent sources and algorithmic solutions of the problem. They have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century. We shall explore and compare these works and their motivations, and relate them to the most recent advances on the minimum spanning tree problem.
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
Authors: Paul-Amaury Matt, Francesca Toni
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Abstract argumentation (Dung 1995) is a theory of dialectic that allows us to formalise and study various notions of argument acceptability. We depart from this standard approach and formalise a measure of argument strength by applying the concept of value of a game, as defined in Game Theory (von Neumann 1928). The measure thus obtained satisfies a number of intuitively appealing properties that can be derived mathematically from the minimax theorem.
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces
Authors: Azzurra Ragone, Umberto Straccia, Tommaso Noia, Eugenio Sciascio, Francesco M. Donini
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketplaces. In particular we mix in a formal and principled way the semantic expressiveness of DLR-lite Logic Programs, fuzzy logic and utility theory. We adopt DLR-Lite Logic Programs to obtain a reasonable compromise between expressiveness and complexity to ensure the scalability of our approach to large e-marketplaces, and Fuzzy Logic to model logical specifications as soft constraints. Furthermore, fully exploiting the peer-to-peer paradigm, we consider in the matchmaking process preferences and corresponding utilities of both parties.
Aesthetic and auditory enhancements for multi-stream information sonification
Authors: Hong Jun Song, Kirsty Beilharz
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Sonification is an emerging modality of information representation, the auditory equivalent of visualization employing non-speech sound to display attributes of form, pattern, recurrence and trends in abstract data. Like data-art or visual and auditory art-forms driven by data content directly mapped to their rendering, sonification shares the goal of aesthetic representation (auditory graphing) in a way to better and more accessibly convey the message to broader consumer audiences. Often, the simple re-contextualization of dense abstract data in an auditory graph (or sonification) is sufficient to highlight long-term trends, to hear regularities (patterns) and anomalies in periodicity of time-series data and to assimilate very subtle and fine transformations. Sonification is also optimal for certain working or ambient situations that are visually rich or visually saturated, when we seek to command topical and peripheral attention with relevant cues. Auditory display is also an alternative to visualization for people with visual impairments. Exploring the premise that sonification should be both aesthetic and informative, i.e. listenable, attractive and engaging, this paper summarises the findings of 3 experiments conducted to determine ways to better represent and access dense information mapped on to more than one concurrent stream of information. Specifically, we show evidence that spatialization of informative events coinciding in time can be more clearly distinguished and that timbre (or tone colour / tone quality) characteristics can serve to further reinforce spatial and stream separation. These findings combine to develop comprehensible methods for representing complex data-sets. We consider human cognition, auditory perception and audio reproduction technologies that each influence the ability to display information sonically.
Search strategies in multimodal image retrieval
Authors: Stina Westman, Antti Lustila, Pirkko Oittinen
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

This paper reports on a study on search strategies in multimodal image retrieval. We analyzed the queries and search tactics employed by image journalism professionals and non-professionals in a user test. Transaction log data show that searchers are able to combine up to four query modes into a query. Most queries combined at least two of the modes (text, color, sketch, quality, and category). Task type was shown to affect the choice of which modes to employ. Known item and data search tasks led to queries combining text, color and category modes. Visually cued tasks resulted in searches combining several content-based and textual modes. Conceptual tasks led to a large number of queries by text and category only. User background also significantly affected the types of queries constructed. Professionals used the color mode more whereas non-professionals drew more sketches. Non-professionals were more likely to switch query modes whereas professionals edited the content of their queries. We described the search processes with Markov models and maximal repeating patterns. Common patterns and probable transitions dealt with querying, inspecting result images and saving them into the workspace or iterating queries of the same type. The results indicate a need to support multimodal image query formulation.
Semantic Tolerance-Based Image Representation for Large Image/Video Retrieval
Authors: Ying Dai
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The nature of the concepts regarding multimedia in many domains is imprecise, and the interpretation of finding similar media is also ambiguous and subjective on the level of human perception. To solve these problems, in this paper, semantic categories of images or key frames which are extracted for representing the segments of a video, and the tolerance degree between the categories are defined systematically, and the approach of modeling tolerance relations between the semantic classes is proposed. Furthermore, for removing the induced false tolerance in the produce of using semantic tolerance relation model, the method of un-tolerating is introduced in image/key frame representation. On the other hand, a diagram of semantic tolerance-based image/video automatic representation is described, and the structure of large image/video retrieval using image/video semantic representation is proposed. We apply the proposed approach to the representations of images regarding the nature vs. man-made domain, human vs. non-human domain, and temporal domain, and show the categorization results of using and not using semantic tolerance relation model. Furthermore, the mechanism of the semantic representation and retrieval for large image/video data proposed in this paper is compared with the state-of-the-art methods. The results show the effectiveness of proposed method. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Sound 3-Query PCPPs Are Long
Authors: Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We initiate the study of the tradeoff between the length of a probabilistically checkable proof of proximity (PCPP) and the maximal soundness that can be guaranteed by a 3-query verifier with oracle access to the proof. Our main observation is that a verifier limited to querying a short proof cannot obtain the same soundness as that obtained by a verifier querying a long proof. Moreover, we quantify the soundness deficiency as a function of the proof-length and show that any verifier obtaining "best possible" soundness must query an exponentially long proof.
Deterministic Models of Communication Faults
Authors: Rastislav Královič, Richard Královič
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms.
A Caller-Side Inline Reference Monitor for an Object-Oriented Intermediate Language
Authors: Dries Vanoverberghe, Frank Piessens
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

Runtime security policy enforcement systems are crucial to limit the risks associated with running untrustworthy (malicious or buggy) code. The inlined reference monitor approach to policy enforcement, pioneered by Erlingsson and Schneider, implements runtime enforcement through program rewriting: security checks are inserted inside untrusted programs.Ensuring complete mediation --- the guarantee that every security-relevant event is actually intercepted by the monitor --- is non-trivial when the program rewriter operates on an object-oriented intermediate language with state-of-the-art features such as virtual methods and delegates.This paper proposes a caller-side rewriting algorithm for MSIL --- the bytecode of the .NET virtual machine --- where security checks are inserted around calls to security-relevant methods. We prove that this algorithm achieves sound and complete mediation and transparency for a simplified model of MSIL, and we report on our experiences with the implementation of the algorithm for full MSIL.
Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
Authors: S. K. Sen, H. Agarwal, T. Samanta
Venue: Computers Mathematics with Applications (2006)

A successive nonextrapolatory linear interpolation is described to solve a singular two-point boundary value problem arising in circular membrane theory. The problem is associated with a second-order nonlinear ordinary differential equation for which the upper and lower bounds of the solution is analytically established/known. The importance and the scope of these bounds in solving the problem is stressed. Also depicted graphically are the lower and upper solutions as well as the true and iterated solutions. In addition, discussed are the reasons why linear interpolation, and not nonlinear interpolation or bisection which are possible procedures, has been employed.
Multiconstrained Optimization of Networks with Multicast and Unicast Traffic
Authors: Pedro Sousa, Miguel Rocha, Paulo Cortez, Miguel Rio
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

This paper presents an OSPF routing optimization framework taking into account a set of multiconstrained QoS requirements of the networking domain. The proposed optimization approach, based on Evolutionary Computation, is able to handle network scenarios with both unicast and multicast traffic, providing high quality configurations for single-topology or multi-topology routing approaches. The results clearly show the effectiveness of the devised optimization methods, allowing for the development of management tools automatically providing enhanced configurations to improve the QoS performance of the network.
Numerical Solution to Maxwell's Equations in Singular Waveguides
Authors: Franck Assous, Patrick Ciarlet,  Jr.
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper is devoted to the numerical solution of the instationary Maxwell equations in singular waveguides. The geometry is called singular, as its boundary includes reentrant corners or edges, which generate, in their neighborhood, strong electromagnetic fields. We have built a method which allows to compute the time-dependent electromagnetic field, based on a splitting of the spaces of solutions: First, the subspace of regular fields, which coincides with the whole space of solutions, in the case of convex or smooth boundary; Second, a singular subspace, defined and characterized via the singularities of the Laplace operator. Numerical results illustrate the influence of frequency of the ingoing electromagnetic waves in a L-shaped waveguide.
A Customized Class of Functions for Modeling and Clustering Gene Expression Profiles in Embryonic Stem Cells
Authors: Shenggang Li, Miguel Andrade-Navarro, David Sankoff
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

Based on the trajectories of individual genes, we address the problem of clustering time course gene expression data for embryonic stem cells (ESC) differentiation. We propose a class of functions determined by only two parameters but flexible enough to model realistic time courses. This serves as a basis for a mixed model clustering method. This method takes into account (1) genetic function profile induced or controlled by other regulators, (2) unobservable random effects producing heterogeneity within gene clusters, and (3) autoregressive components defining the stochastic and autocorrelation structures. We employ an EM algorithm to fit the mixture model and clustering follows monitoring via Bayesian posterior probabilities. Our method is applied to a mouse ESC line during the first 24 hours of differentiation period. We assess the biological credibility of the results by detecting significantly associated FatiGO Gene Ontology terms for each cluster.
Efficient Video Shot Summarization Using an Enhanced Spectral Clustering Approach
Authors: Vasileios Chasanis, Aristidis Likas, Nikolaos Galatsanos
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Video summarization is a powerful tool to handle the huge amount of data generated every day. At shot level, the key-frame extraction problem provides sufficient indexing and browsing of large video databases. In this paper we propose an approach that estimates the number of key-frames using elements of the spectral graph theory. Next, the frames of the video sequence are clustered into groups using an improved version of the spectral clustering algorithm. Experimental results show that our algorithm efficiently summarizes the content of a video shot producing unique and representative key-frames outperforming other methods.
FDBMS Application for a Survey on Educational Performance
Authors: Livia Borjas, Alejandro Fernández, Jorge Ortiz, Leonid Tineo
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Important efforts have been done in providing fuzzy querying capabilities. Nevertheless, at present time too few real life systems are taking advantage of these works. We present here an application for reviewing results of a periodical student opinion survey on educational performance of professors. This application has been developed using SQLfi Fuzzy DBMS.
On the equivalence of asynchronous control structures
Authors: J. Robert Jump, P. S. Thiagarajan
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

This paper is concerned with the problem of detecting when two asynchronous control systems are equivalent. The systems investigated in the paper are first represented by means of a formal model called an asynchronous control structure (ACS). This model specifies the constraints imposed on the generation of control signals by a system by means of a simple graphical model called a marked graph. Behavioral equivalence is then characterized in terms of the set of all possible sequences of control signals that can be generated by the system. These sequences are represented by means of another (infinite) marked graph, called a behavior graph. Finally, it is shown that two control systems are equivalent if and only if their behavior graph representations have identical (finite) generating sets.
SenQ: An Embedded Query System for Streaming Data in Heterogeneous Interactive Wireless Sensor Networks
Authors: Anthony D. Wood, Leo Selavo, John A. Stankovic
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Interactive wireless sensor networks (IWSNs) manifest diverse application architectures, hardware capabilities, and user interactions that challenge existing centralized [1], or VM-based [2] query system designs. To support in-network processing of streaming sensor data in such heterogeneous environments, we created SenQ, a multi-layer embedded query system. SenQ enables user-driven and peer-to-peer in-network query issue by wearable interfaces and other resource-constrained devices. Complex virtual sensors and user-created streams can be dynamically discovered and shared, and SenQ is extensible to new sensors and processing algorithms. We evaluated SenQ's efficiency and performance in a testbed for assisted-living, and show that on-demand buffering, query caching, efficient restart and other optimizations reduce network overhead and minimize data latency.
A Smooth Concurrency Revolution with Free Objects
Authors: Rachid Guerraoui
Venue: IEEE Internet Computing (2007)

Most of the many concurrent programming models that have been invented were devised by concurrency "aristocrats" for concurrency aristocrats. To get concurrency to the masses, we need a simple way to exploit parallelism with languages that common developers are already used to. A pragmatic approach might be to explore ways to implicitly extract parallelism from current object-oriented programs by overloading OO constructs. The author proposes viewing a program as a collection of "free" objects, each of which has its own thread of control and executes its operations within atomic transactions. Such objects would communicate by asynchronous message passing with futures--objects that encapsulate the results of server invocations and let clients retrieve them while hiding the actual state of readiness from the client.
Computational approach to the reaction dynamics associated with the formation and crystallization of hydrogenated silicon clusters
Authors: Grygoriy Dolgonos, Ning Ning, Holger Vach
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The present paper focuses on the application of semiempirical quantum molecular dynamics to explore: 1) the reaction dynamics of the elementary reaction Si$^{+}(^{2}$P) + H$_{2}$, which is believed to play a significant role in the growth of thin silicon films, and 2) the dynamics of hydrogenated silicon nanoparticle growth (up to a size of about 1.1 nm) making use of predetermined parameters obtained from fluid model dynamics calculations to describe the experimentally employed silane plasma conditions. It has been shown that PM3 gives an adequate description of the silicon-hydrogen interactions that allows us to use it in conjunction with molecular dynamics simulation techniques to explore more in detail the dynamics of the Si$^{+}(^{2}$P) + H$_{2}$ reaction and even the growth and crystallization dynamics of small silicon nanoclusters. This success makes PM3 molecular dynamics a promising candidate for future in-depth explorations of chemical reactions involving silicon and hydrogen atoms.
Leveraging C-Rater's Automated Scoring Capability for Providing Instructional Feedback for Short Constructed Responses
Authors: Jana Sukkarieh, Eleanor Bolge
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Due to some progress on the natural language processing (NLP) front, researchers are able to pursue the problem of automatic content assessment for free text responses with some success. In particular, a concept-based scoring method implemented in c-rater, Educational Testing Service's (ETS) technology for content scoring of short free-text answers makes c-rater capable of giving instantaneous formative individualized feedback without going fully into a dialog-based system nor restricting itself to just canned hints and corrective prompts.
Combating P2P File Pollution with Co-alerting
Authors: Min Zuo, Ying-hua Ma, Richard Chbeir, Jian-hua Li
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Recently, serious file pollution has been identified in some popular file sharing P2P applications and addressed by several studies. Solving this issue can be done by setting up a model to describe the problem precisely and locate the vital factors aiming to enhance or annihilate file pollution. In this paper, we propose an analytical model for the study of file pollution on P2P file sharing networks and a novel anti-pollution method called "co-alerting". Results of a series of simulations based on the established model show that the user group’s slackness attribute has a remarkable influence on the time-dynamic characteristics of a P2P file pollution process. Simulation results also show that our co-alerting approach acts well as an efficient countermeasure against file pollution, because it can reshape the distribution of user group’s slackness degree and make file sharing in P2P systems more resistant to file pollution attempts.