ppxscal/embedding_network huggingface dataset:
Efficient approximation of optimization queries under parametric aggregation constraints
Authors: Sudipto Guha, Dimitrios Gunopoulos, Nick Koudas, Divesh Srivastava, Michail Vlachos
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We introduce and study a new class of queries that we refer to as OPAC (optimization under parametric aggregation constraints) queries. Such queries aim to identify sets of database tuples that constitute solutions of a large class of optimization problems involving the database tuples. The constraints and the objective function are specified in terms of aggregate functions of relational attributes, and the parameter values identify the constants used in the aggregation constraints. We develop algorithms that preprocess relations and construct indices to efficiently provide answers to OPAC queries. The answers returned by our indices are approximate, not exact, and provide guarantees for their accuracy. Moreover, the indices can be tuned easily to meet desired accuracy levels, providing a graceful tradeoff between answer accuracy and index space. We present the results of a thorough experimental evaluation analyzing the impact of several parameters on the accuracy and performance of our techniques. Our results indicate that our methodology is effective and can be deployed easily, utilizing index structures such as R-trees.
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Authors: Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai Xing, Min Song
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a virgin land. In this paper, we propose to protect location privacy via a flooding backbone, which is modeled by a minimum connected dominating set (MCDS) in unit-disk graphs. We design an efficient and localized algorithm to compute an approximate MCDS. Theoretical analysis indicates that our algorithm generates a connected dominating set (CDS) with a size at most 148 · opt + 37, where opt is the cardinality of a MCDS. To our best knowledge, this algorithm is the first localized algorithm with a constant performance ratio for CDS construction in unit-disk graphs.
Real-Time and Multi-Video-Object Segmentation for Compressed Video Sequences
Authors: Fu Wenxiu, Wang Bin, Liu Ming
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

We propose a real-time object segmentation method based on Gaussian Mixture Model(GMM) for MPEG compressed video. Computational superiority and multi video objects are the main advantages of compressed domain processing. In the paper, first, we introduce the macro-block structure of the MPEG encoded video and the preprocession of video vectors, then we build a GMM of motion vectors and adopt the genetic-based expectation-maximization algorithm (GA-EM) to compute its multivariate parameters. It is able to estimate automatically the number of objects of the motion model using the minimum description length (MDL) criterion. At last, we give the steps of objects extraction. It is proved that the algorithm is real-time and effective from the experiment results.
Casual Information Visualization: Depictions of Data in Everyday Life
Authors: Zachary Pousman John Stasko
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Information visualization has often focused on providing deep insight for expert user populations and on techniques for amplifying cognition through complicated interactive visual models. This paper proposes a new subdomain for infovis research that complements the focus on analytic tasks and expert use. Instead of work-related and analytically driven infovis, we propose Casual Information Visualization (or Casual Infovis) as a complement to more traditional infovis domains. Traditional infovis systems, techniques, and methods do not easily lend themselves to the broad range of user populations, from expert to novices, or from work tasks to more everyday situations. We propose definitions, perspectives, and research directions for further investigations of this emerging subfield. These perspectives build from ambient information visualization [32], social visualization, and also from artistic work that visualizes information [41]. We seek to provide a perspective on infovis that integrates these research agendas under a coherent vocabulary and framework for design. We enumerate the following contributions. First, we demonstrate how blurry the boundary of infovis is by examining systems that exhibit many of the putative proper ties of infovis systems, but perhaps would not be considered so. Second, we explore the notion of insight and how, instead of a monolithic definition of insight, there may be multiple types, each with particular characteristics. Third, we discuss design challenges for systems intended for casual audiences. Finally we conclude with challenges for system evaluation in this emerging subfield.
Obtaining Fuzzy Control Query Table by Data Mining
Authors: Gao Jun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The key to a good fuzzy control system is its fuzzy control query table, and the system's performance mainly depends on the quality of the table. Based on analyzing fully the principles of a typical fuzzy control systems and the procedures of building a fuzzy control table, this paper presents a new method of applying the boolean association rule data mining techniques to mining of fuzzy control query table directly from the database of manual operating records.
Tools and Products
Authors: Carl Machover David J. Kasik
Venue: IEEE Computer Graphics and Applications (2007)

A look at new products on the market, including the BOXX Technologies' Apexx 4 Super-Workstation and renderBOXX Classic 7500, Dimension 3D Printers from Tekpro Group, Micronas' VCT-Premium single-chip flat panel TV processors, Cyberware Head and Face Color 3D Scanner, eRacks/Suite, Visidec Focus Micro, Visidec Focus Wall, Design Science MathPlayer 2.1, MaPZone 2.6, MyRapidMD's ESP, Bunkspeed HyperShot,
PEACE-VO: A Secure Policy-Enabled Collaboration Framework for Virtual Organizations
Authors: Jianxin Li, Jinpeng Huai, Chunming Hu
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

The increasing complexity and dynamics of grid environments have posed great challenges for secure and privacy-preserving collaboration in a virtual organization. In this paper, we propose PEACE-VO, a secure policy-enabled collaboration framework for virtual organizations. PEACE-VO employs role mapping to define trust relationships across autonomous domains. Nevertheless, a critical issue emerges when the system applies role mapping, which is potential policy conflict in a local domain. We first develop two concepts to depict such possible conflicts within the collaboration policy. Next, we propose a fully distributed evaluation algorithm to detect potential policy conflicts, which does not require domains to disclose their full local security policies and therefore preserves critical domain privacy. Finally, we design two dedicated protocols for virtual organization management and authorization services, respectively. We have successfully implemented the PEACE-VO framework with two fundamental protocols, i.e., VO management protocol and service authorization protocol, in the CROWN Grid. Comprehensive experimental study shows our approach is scalable and efficient.
Deciphering Trends in Mobile Search
Authors: Maryam Kamvar, Shumeet Baluja
Venue: Computer (2007)

Understanding mobile search needs will help improve the user experience and increase the service's usage. Analysis of search data from a large US carrier showed that cell-phone subscribers are typing longer queries in less time and clicking on more results.
New Application
Authors: D. A. Michalopoulos
Venue: Computer (1975)

University of Washington scientists are using high-speed electrostatic printer/plotters for on-the-spot analysis of oceanographic data. The Gould 5000 units are part of the $3 million computer system on the university research ship Thomas G. Thompson
Discovering and Mining Use Case Model in Reverse Engineering
Authors: Qingshan Li, Shengming Hu, Ping Chen, Lihong Wu, Wei Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Use case model is normally used to model software requirement. Reverse engineering of the high-level requirement model from the source code of target system is an important way to promote the program comprehension. In this paper, an approach of discovering and mining the use case model from the source code of object-oriented software is presented. Based on dynamic information, which could be obtained based on instrumentation techniques during the execution of target system, the approach discovers the basic use cases by specifying the beginning methods of method calling sequences of the dynamic information, and then utilizes some rules to mine the relations among basic use cases to build the whole use case model. This approach has been implemented in the XDRE (XiDian Reverse Engineering) tool. At the end a case study is provided to show the accuracy and usefulness of discovered use case model.
Semantic Information Extraction of Video Based on Ontology and Inference
Authors: Jie Ma, Jing Zhang, Hong Lu, Xiangyang Xue
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper, a new ontology-based composite concept detection method is proposed, which adopts Bayesian network to construct the ontology and uses the inference rules to perform the composite concept detection providing the concrete concepts in a phrase of video. Furthermore, the probability instead of binary value is gained through the inference pattern of Bayesian network, which can obtain more precise results. The main contribution of this paper is that semantic concept ontology is constructed using Bayesian network and the constructed ontology represents the hierarchical relationship between the concepts which can be used for inference. The method narrows the influence of "Semantic Gap" in some extent and achieves good performance in composite concept detection.
A Comparison of Collaborative-Filtering Recommendation Algorithms for E-commerce
Authors: Zan Huang, Daniel Zeng, Hsinchun Chen
Venue: IEEE Intelligent Systems (2007)

An evaluation of six recommendation algorithms on e-commerce-related data sets is an initial step toward a metalevel guideline for choosing the best algorithm for a given application with certain data characteristics. Two of the evaluated algorithms are the popular user-based and item-based correlation/similarity algorithms. The other four algorithms attempt to meet the challenge of data sparsity through dimensionality reduction, generative models, spreading activation, or link analysis. Initial experimental comparisons indicate that the link-analysis algorithm achieves the best overall performance across several e-commerce data sets.
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Authors: Peter Kemper, Carsten Tepper
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In this paper, we describe a novel technique that helps a modeler to gain insight in the dynamic behavior of a complex stochastic discrete event simulation model based on trace analysis. We propose algorithms to distinguish progressive from repetitive behavior in a trace and to extract a minimal progressive fragment of a trace. The implied combinatorial optimization problem for trace reduction is solved in linear time with dynamic programming. We present and compare several approximate and one exact solution method. Information on the reduction operation as well as the reduced trace itself helps a modeler to recognize the presence of certain errors and to identify their cause. We track down a subtle modeling error in a dependability model of a multi-class server system to illustrate the effectiveness of our approach in revealing the cause of an observed effect. The proposed technique has been implemented and integrated in Traviando, a trace analyzer to debug stochastic simulation models.
Review of “Grid Computing Security by Anirban Chakrabarti”, Springer, 2007, $69.95, ISBN: 3540444920
Authors: Diego R. Llanos
Venue: Queue (2007)

Anirban Chakrabarti, Springer, 2007, $69.95, ISBN: 3540444920. One popular aspect of grid computing is the promise of getting computing power anywhere. As with electricity, you just plug in and use it, regardless of how or from where it is being delivered. This analogy works well to understand the ultimate goal of grid computing, but of course reality is much more complex. Many advances in interoperability and performance in recent years make grid technologies an alternative to cluster computing for certain distributed applications. Now is the time to focus attention on other problems, such as security. In Grid Computing Security, Anirban Chakrabarti studies security issues related not only to grids, but also to computer networks and operating systems that may affect future development.
Poloidal-toroidal decomposition in a finite cylinder. I: Influence matrices for the magnetohydrodynamic equations
Authors: Piotr Boronski, Laurette S. Tuckerman
Venue: Journal of Computational Physics (2007)

The Navier-Stokes equations and magnetohydrodynamics equations are written in terms of poloidal and toroidal potentials in a finite cylinder. This formulation insures that the velocity and magnetic fields are divergence-free by construction, but leads to systems of partial differential equations of higher order, whose boundary conditions are coupled. The influence matrix technique is used to transform these systems into decoupled parabolic and elliptic problems. The magnetic field in the induction equation is matched to that in an exterior vacuum by means of the Dirichlet-to-Neumann mapping, thus eliminating the need to discretize the exterior. The influence matrix is scaled in order to attain an acceptable condition number.
Proceedings of the 9th annual ACM international workshop on Web information and data management
Venue: Workshop On Web Information And Data Management (2007)

The ACM CIKM07 Workshop on Web Information and Data Management (WIDM 2007) is the ninth in a series of workshops on Web Information and Data Management held in conjunction with the International Conference on Information and Knowledge Management (CIKM). The objective of the workshop is to bring together researchers, industrial practitioners, and developers to study how Web information can be extracted, stored, analyzed, and processed to provide useful knowledge to the end users for various advanced database applications. We hope that these proceedings will serve as a valuable reference for all experts in the field. The call for papers resulted in the submission of 80 papers from 32 countries: Australia, Austria, Belgium, Brazil, Canada, Chile, China, Cuba, Cyprus, Czech Republic, France, Germany, Greece, India, Iran, Israel, Italy, Japan, Mauritius, Mexico, Netherlands, Norway, Pakistan, Poland, Portugal, Singapore, South Korea, Sweden, Switzerland, Taiwan, United Kingdom and the United States. Starting from 2005, the workshop has a one-day schedule. All papers were thoroughly reviewed by the program committee and external reviewers. This year, the program committee accepted 20 papers, resulting in a competitive 25% acceptance rate. The 20 accepted papers were divided into five sessions: "XML and Semi-Structured Data", "P2P and System Design Issues", "Personalization", "Mining Knowledge from Web Data" and "Web Metadata and Search".
Alternating-time temporal logic with explicit strategies
Authors: Dirk Walther, Wiebe van der Hoek, Michael Wooldridge
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We introduce ATLES - a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences of path quantifiers, and, as a consequence, it possible to express in ATLES some properties that cannot be expressed even in ATL*. We present a complete axiomatic system for ATLES. Moreover, we show that satisfiability problem for ATLES is no more complex than for ATL: it is ExpTime-complete. We identify two variants of the model-checking problem for ATLES and investigate their computational complexity. Finally, we show how ATLES can be used to reason about extensive games.
A Hybrid Content-Collaborative Recommender System Integrated into an Electronic Performance Support System
Authors: Leo Iaquinta, Anna Lisa Gentile, Pasquale Lops, Marco de Gemmis, Giovanni Semeraro
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

An Electronic Performance Support System (EPSS) introduces challenges on contextualized and personalized information delivery. Recommender systems aim at delivering and suggesting relevant information according to users preferences, thus EPSSs could take advantage of the recommendation algorithms that have the effect of guiding users in a large space of possible options. The JUMP project1 aims at integrating an EPSS with a hybrid recommender system. Collaborative and content-based filtering are the recommendation techniques most widely adopted to date. The main contribution of this paper is a contentcollaborative hybrid recommender which computes similarities between users relying on their contentbased profiles, in which user preferences are stored, instead of comparing their rating styles. A distinctive feature of our system is that a statistical model of the user interests is obtained by machine learning techniques integrated with linguistic knowledge contained in WordNet. This model, named "semantic user profile", is exploited by the hybrid recommender in the neighborhood formation process.
Quality Assessment of Beef Based of Computer Vision and Electronic Nose
Authors: Chen Cunshe, Li Xiaojuan, Yuan Huimei
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Current techniques for beef quality evaluations rely on sensory methods. These procedures are subjective, prone to error, and difficult to quantify. Automated evaluation of color and odor is desirable to reduce subjectivity and discrepancies and assist with the creation of standards for inspectors worldwide. The objectives of this study were to develop color machine vision techniques for visual evaluation and to test electronic nose sensors for odor raw and beef. A color machine vision system was developed to analyze the color of beef samples. The system was able to analyze the color of samples with non-uniform color surfaces, An electronic nose sensors was used to measure odors of beef and beef stored at different temperatures, with different levels of spoilage. Discriminant function analysis was used as the pattern recognition technique to differentiate samples based on odors. Results showed that the electronic nose could discriminate differences in odor due to storage time and spoilage levels for beef. Results also showed good correlation of sensor reading with sensory scores Overall. the electronic nose showed good sensitivity and accuracy. Results from this work could lead to methodologies that will assist in the objective and repeatable quality evaluation of beef. These methods have potential in industrial and regulatory application where rapid response, no sample preparation, and no need for chemicals are required.
Properties of Theta-closure in L-Spaces
Authors: Ji-shu Cheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

theta-closure is an important tool for investigation of L-Hausdorff separability, regular separability and H-sets in L-spaces. In this paper, we generalize it to L-spaces and systematically explore the properties of theta-closure, theta-interior and theta-closed sets. Constructions and some characteristic descriptions are formulated. It is proved that theta-closed sets are multiplicative, hereditary and invariant in closed continuous order homomorphism.
Toward a theory of evolution strategies: The (μ, λ)-theory
Authors: Hans-Georg Beyer
Venue: Evolutionary Computation (1994)

The multimembered evolution strategy (ES) acting on μ parents and λ offspring is analyzed for real-valued, N-dimensional parameter spaces (N 30). N-dependent progress rate formulas are derived for (1, λ) and (μ, λ) strategies on spherical models. The analytical results obtained are compared with simulation experiments for the (hyper)sphere and the inclined (hyper)plane.
Dynamic Bayesian networks for visual recognition of dynamic gestures
Authors: Héctor Hugo Avilés-Arriaga, Luis Enrique Sucar
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

Dynamic Bayesian networks are a powerful representation to describe processes that vary over time inside a stochastic framework. This paper describes an online visual recognition system to recognize a set of five dynamic gestures executed with the user's right hand using dynamic Bayesian networks for recognition. Gestures are oriented to command mobile robots. The system employs a radial scan segmentation algorithm combined with a statistical-based skin detection method to find the candidate face of the user and to track his right-hand. It uses four simple features to describe the user's right-hand movement. Our system is able to recognize these five gestures in real-time with an average recognition rate of 84.01%, better result than using hidden Markov models for recognition.
Creating, destroying, and restoring value in wikipedia
Authors: Reid Priedhorsky, Jilin Chen, Shyong (Tony) K. Lam, Katherine Panciera, Loren Terveen, John Riedl
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Wikipedia's brilliance and curse is that any user can edit any of the encyclopedia entries. We introduce the notion of the impact of an edit, measured by the number of times the edited version is viewed. Using several datasets, including recent logs of all article views, we show that an overwhelming majority of the viewed words were written by frequent editors and that this majority is increasing. Similarly, using the same impact measure, we show that the probability of a typical article view being damaged is small but increasing, and we present empirically grounded classes of damage. Finally, we make policy recommendations for Wikipedia and other wikis in light of these findings.