ppxscal/embedding_network huggingface dataset:
The GPU Enters Computing's Mainstream
Authors: Michael Macedonia
Venue: Computer (2003)

The Siggraph/Eurographics Graphics Hardware 2003 workshop (graphicshardware.org), held in San Diego, will likely be remembered as a turning point in modern computing. In one of those rare moments when a new paradigm visibly begins changing general-purpose computing's course, what has traditionally been a graphics-centric workshop shifted its attention to the nongraphics applications of the graphics processing unit.
Image Affine Inpainting
Authors: Zhaozhong Wang
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Exemplar-based inpainting techniques demonstrate some advantages in filling both textural and structural images, based upon the simple process of patch sampling and copying. An implicit assumption of such methods is that an exemplar patch could be found for copying. But the assumption might be false for images with complex structures, resulting in inpainting artefact. To inpaint structure and texture more efficiently, this paper adopts a weak assumption that affine transformed patches could be found for filling unknown regions. The algorithm based on this assumption firstly establishes the affine relation between the unknown region and a source patch, then transform the source pixels to fill the unknowns. This algorithm generates more satisfying inpainting results, as illustrated by the provided experiments.
Web document classification and its performance evaluation
Authors: Ioan Pop
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

The Web Mining applications have need to be improved with the specific algorithms for the document classification. This paper emphasizes the importance of using appropriate measures and methods for the evaluate of the Web document classification performance. We focus on methods that evaluate how well a classifier performs. The effect of transformations on the confusion matrix are considered for eleven well-known and recently introduced classification measures. We analyze the measure's ability to retain its value under changes in a confusion matrix. We discuss benefits from the use of the invariant and non-invariant measures with respect to characteristics of data classes.
Zero Knowledge and Soundness Are Symmetric
Authors: Shien Jin Ong, Salil Vadhan
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the zero knowledge and the soundness conditions, and thus we deduce that the class of problems in NP ¿ coNP having zero-knowledge arguments is closed under complement. Furthermore, we show that a problem in NP has a statistical zero-knowledge argument system if and only if its complement has a computational zero-knowledge proof system. What is novel about these results is that they are unconditional, i.e., do not rely on unproven complexity assumptions such as the existence of one-way functions.Our characterization of zero-knowledge arguments also enables us to prove a variety of other unconditional results about the class of problems in NP having zero-knowledge arguments, such as equivalences between honest-verifier and malicious-verifier zero knowledge, private coins and public coins, inefficient provers and efficient provers, and non-black-box simulation and black-box simulation. Previously, such results were only known unconditionally for zero-knowledge proof systems, or under the assumption that one-way functions exist for zero-knowledge argument systems.
Six Patterns for Persuasion in Online Social Networks
Authors: G. Michael Weiksner, B. J. Fogg, Xingxin Liu
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

Social psychology research has shown that persuasion happens in predictable ways. To identify patterns of persuasion in online social networks, we studied Facebook as a persuasive technology. Using a Grounded Theory approach, we found and named six persuasion patterns. Four patterns that led to large-scale viral adoption--Provoke and Retaliate, Reveal and Compare, Expression, and Group Exchange--are native to Facebook. Two patterns--Competition and Deception--are adapted to Facebook. We describe these native and adapted patterns and offer psychological explanations for each. We conclude that persuasion in online social networks follows regular, observable patterns, and we suggest promising avenues for future research.
Using Artificial Boundaries in the Game of Go
Authors: Ling Zhao, Martin Müller
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

Local search in the game of Go is easier if local areas have well-defined boundaries. An artificial boundary consists of temporarily added stones that close off an area. This paper describes a new general framework for finding boundaries in a way such that existing local search methods can be used. Furthermore, by using a revised local UCT search method, it is shown experimentally that this framework increases performance on local Go problems with open boundaries.
The Edge Connectivity of Circuit Graphs of Matroids
Authors: Ping Li, Guizhen Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Let G be the circuit graph of any connected matroid and let ¿¿(G) and ¿(G) be the edge connectivity and minimum degree of G. It is proved that ¿¿(G) = ¿(G).
Goals in agent systems: a unifying framework
Authors: M. Birna van Riemsdijk, Mehdi Dastani, Michael Winikoff
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal types and propose a simple and general definition of goal, which unifies these goal types. We then give a formal and generic operationalization of goals by defining an abstract goal architecture, which describes the adoption, pursuit, and dropping of goals in a generic way. This operationalization is used to characterize the discussed goal types.
Benchmarking temporal database models with interval-based and temporal element-based timestamping
Authors: Seo-Young Noh, Shashi K. Gadia
Venue: Journal of Systems and Software (2008)

Starting from mid 1980s, there has been a debate about what data model is most appropriate for temporal databases. A fundamental choice one has to make is whether to use intervals of time or temporal elements to timestamp objects and events with the periods of validity. The advantage of using interval timestamps is that Start and End columns can be added to relations for treating them within the framework of classical databases, leading to quick implementation. Temporal elements are finite unions of intervals. The advantage of temporal elements is that timestamps become implicitly associated with values, tuples, and relations. Furthermore, since temporal elements, by design, are closed under set theoretical operations such as union, intersection and complementation, they lead to query languages that are natural. Here, we investigate the ease of use as well as system performance for the two approaches to help settle the debate.
Inferring Congruence Equations Using SAT
Authors: Andy King, Harald Søndergaard
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, where a propositional formula is used to encode the semantics of a basic block, and abstraction, where the solutions to the formula are systematically combined and summarised as a system of congruence equations. The resulting technique is more precise than existing congruence analyses since a single optimal transfer function is derived for a basic block as a whole.
Energy-efficient route selection strategies for wireless sensor networks
Authors: Dimitrios J. Vergados, Nikolaos A. Pantazis, Dimitrios D. Vergados
Venue: Mobile Networks and Applications (2008)

Wireless Sensor Networks (WSNs) facilitate monitoring and controlling of physical environments from remote locations with the best possible accuracy. Sensor networks are wireless networks consisting of groups of small, inexpensive nodes, which collect and disseminate critical data. Also, sensor nodes have various energy and computational constraints due to their inexpensive nature and ad hoc method of deployment. Considerable research has been focused on overcoming these deficiencies through low-energy consumption schemes. Among other factors, the route selection strategy may have an impact on the sensors lifetime, and following on the network lifetime. In this paper, we study various route selection strategies that aim at prolonging the lifetime of WSNs. Also, a new route selection scheme is proposed, that increases further the network lifetime. The performance of these schemes is analyzed through simulation.
Robust team-play in highly uncertain environments
Authors: Henry Work, Eric Chown
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Effective teamwork in highly dynamic environments requires a delicate balance between giving agents the autonomy to act and react on their own and restricting that autonomy so that the agents do not work at cross purposes. In this article we describe the problems involved in coordinating behavior based upon a highly dynamic object, a soccer ball, for agents with sensing and communications limitations. We then present a system for coping with these problems and examine its success in light of its performance at the RoboCup 2007 championship.
Evolutionary Algorithms for Dynamic Environments: Prediction Using Linear Regression and Markov Chains
Authors: Anabela Simões, Ernesto Costa
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

In this work we investigate the use of prediction mechanisms in Evolutionary Algorithms for dynamic environments. These mechanisms, linear regression and Markov chains, are used to estimate the generation when a change in the environment will occur, and also to predict to which state (or states) the environment may change, respectively. Different types of environmental changes were studied. A memory-based evolutionary algorithm empowered by these two techniques was successfully applied to several instances of the dynamic bit matching problem.
Stacking Dynamic Time Warping for the Diagnosis of Dynamic Systems
Authors: Carlos J. Alonso, Oscar J. Prieto, Juan J. Rodríguez, Aníbal Bregón, Belarmino Pulido
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

This paper explores an integrated approach to diagnosis of complex dynamic systems. Consistency-based diagnosis is capable of performing automatic fault detection and localization using just correct behaviour models. Nevertheless, it may exhibit low discriminative power among fault candidates. Hence, we combined the consistency based approach with machine learning techniques specially developed for fault identification of dynamic systems. In this work, we apply Stacking to generate time series classifiers from classifiers of its univariate time series components. The Stacking scheme proposed uses K-NN with Dynamic Time Warping as a dissimilarity measure for the level 0 learners and Naïve Bayes at level 1. The method has been tested in a fault identification problem for a laboratory scale continuous process plant. Experimental results show that, for the available data set, the former Stacking configuration is quite competitive, compare to other methods like tree induction, Support Vector Machines or even K-NN and Naïve Bayes as stand alone methods.
Thanks to IEEE MultiMedia's Reviewers
Venue: IEEE MultiMedia (2004)

Many colleagues have assisted the IEEE MultiMedia Editorial Board in the article review and selection process. By offering their time and talent, reviewers provide a valuable service to this publication. The Editor in Chief realizes that this type of professional service, while absolutely necessary, doesn't receive much recognition. Whereas reviewers' efforts on individual articles are performed under the cover of confidentiality, I thank them all here publicly for their efforts during 2003.Forouzan Golshani, Editor in Chief 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
Windows® based general PBPK/PD modeling software
Authors: Richard H. Luecke, Bruce A. Pearce, Walter D. Wosilait, Daniel R. Doerge, William Slikker,  Jr., John F. Young
Venue: Computers in Biology and Medicine (2008)

A physiologically based pharmacokinetic (PBPK) model and program (called PostNatal) was developed which focuses on postnatal growth. Algorithms defining organ/tissue growth curves from birth through adulthood for male and female humans, dogs, rats, and mice are utilized to calculate the appropriate weight and blood flow for the internal organs/tissues. This Windows^(R) based program is actually four linked PBPK models with each PBPK model acting independently or totally integrated with the others through metabolism by first order or Michaelis-Menten kinetics. Data fitting is accomplished by a weighted least square regression algorithm. The model includes linkages for the simulation of pharmacodynamic (PD) effects.
J.C.R. Licklider's Vision for the IPTO
Authors: Chigusa Ishikawa Kita
Venue: IEEE Annals of the History of Computing (2003)

The Information Processing Techniques Office of the Advanced Research Projects Agency (IPTO/ARPA) was founded in 1962 as a step toward realizing a flexible military command and control system. In setting the IPTO's research agenda for funding, its first director, J.C.R. Licklider, emphasized the development of time-sharing systems. This article looks at how Licklider's early vision of "a network of thinking centers" helped set the stage for the IPTO's most famous project: the Arpanet.
Understanding Large Volumes of Interconnected Individuals by Visual Exploration
Authors: Olaf Noppens, Thorsten Liebig
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Ontologies are now used within an increasing number of real-world applications. So far, significant effort has been spend in building tools to support users in creating, maintaining, and browsing the terminological part of an ontology. On the other hand, only little work has been done in supporting the user to explore the manifold interconnected assertional knowledge in order to analyze, visualize, and understand this network of individuals. In this paper, we present a new efficient visualization and editing approach which allows to investigate relationships within large volumes of interlinked individuals in order to grasp the structure of the assertional knowledge more easily.
Mixture of Expert Used to Learn Game Play
Authors: Peter Lacko, Vladimír Kvasnička
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this paper, we study an emergence of game strategy in multiagent systems. Symbolic and subsymbolic approaches are compared. Symbolic approach is represented by a backtrack algorithm with specified search depth, whereas the subsymbolic approach is represented by feed-forward neural networks that are adapted by reinforcement temporal difference TD(¿) technique. We study standard feed-forward networks and mixture of adaptive experts networks. As a test game, we used the game of simplified checkers. It is demonstrated that both networks are capable of game strategy emergence.
Finite Size Stability Analysis for Stochastic Cellular Automata
Authors: Yukio Sakisaka, Yukio Iwamura, Nariyuki Nakagiri, Jin Yoshimura, Kei-Ichi Tainaka
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Real simulations are performed on a finite size of lattice. It is therefore very difficult to predict a phase diagram on an infinitely large lattice. Here, we present a Finite Size Stability Analysis (FSSA) to know whether the phase is sustainable or not. Although this analysis is a hypothesis, it enables us to determine the boundary of phase diagram. We apply FSSA to multi-state system. For example we study ten-species system in ecology. From computer simulations on various sizes of lattices, we obtain the waiting time ¿ to extinction. The system is found to have two phases: the coexistence of all species is either unstable or marginally (neutrally) stable. In the latter case, ¿ diverges on a power law with the increase of lattice size.
Rate Control Algorithm for MPEG-2 to H.264/AVC Transcoding
Authors: Gao Chen, Shouxun Lin, Yongdong Zhang
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

There is strong need for research in transcoding technologies to enable smooth displacement from MPEG-2 to H.264/AVC since H.264/AVC has been standardized as international standard. In this paper, a novel rate control algorithm for MPEG-2 to H.264/AVC transcoding, which adopting a new block activity measurement, is proposed. Specifically, the standard deviation of the residual error is introduced into the quadratic rate distortion (R-D) model adopted in JVT-G012 instead of the mean of absolute difference (MAD) to measure macroblock (MB) complexity. Meanwhile, based on the fact that the mean square of AC coefficients in an 8×8 DCT block is equal to the variance of an 8×8 block before DCT, we derive a close-form formulation to calculate the variance of a residual MB using the DCT coefficients rather the pixel values. Obviously, this rate control method can be used for MPEG-2 to H.264/AVC transcoder in both pixel domain and transform domain. Experiments show that our proposed algorithm can meet the target bit-rate accurately and achieves a better performance than the JVT-G012.
Coping with revenue recognition in the loyalty reward programs industry: a stochastic modeling approach
Authors: Moustapha Diaby, Aaron L. Nsakanda
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this paper, we propose a quantitative methodology for determining the breakage rate in a Loyalty Reward Program (LRP). The proposed methodology is a simulation-based approach in which the accumulation and redemption of "points" is modeled as a stochastic process. An illustrative example is discussed.
bicACO: An Ant Colony Inspired Biclustering Algorithm
Authors: Fabrício O. França, Guilherme P. Coelho, Fernando J. Zuben
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

A recent proposal developed to avoid some of the drawbacks presented by standard clustering algorithms is the so-called biclustering technique [1], which performs clustering of rows and columns of the data matrix simultaneously, allowing the extraction of additional information from the dataset. Since the biclustering problem is combinatorial, and ant-based systems present several advantages when dealing with this kind of problems [2], in this work we propose an antinspired algorithm for biclustering, which was named bicACO.
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
Authors: Seok-Hee Hong, Hiroshi Nagamochi
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

A star-shaped drawing of a graph is a straight-line drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. In this paper, given a biconnected planar graph G with fixed plane embedding and a subset A of corners of G, we consider the problem of finding a star-shaped drawing D of G such that only corners in A are allowed to become concave corners in D. We first characterize a necessary and sufficient condition for a subset A of corners to admit such a star-shaped drawing D. Then we present a linear time algorithm for finding such a star-shaped drawing D. Our characterization includes Thomassen's classical characterization of biconnected plane graphs with a prescribed boundary that have convex drawings.
A Temporal Dominant Relationship Analysis Method
Authors: Jing Yang, Yuanxi Wu, Cuiping Li, Hong Chen, Bo Qu
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Recent research on skyline queries has attracted much interest in the database and data mining community. The concept of dominant relationship analysis has commonly used in the context of skyline computation, due to its importance in many applications. Current methods have only considered so-called min/max hard attributes like price and quality which a user wants to minimize or maximize. However, objects can also have temporal attribute which can be used to represent relevant constraints on the query results. In this paper, we introduce novel skyline query types taking into account not only min/max hard attributes but also temporal attribute and the relationships between these different attribute types. We find the interrelated connection between the time-evolving attributes and the dominant relationship. Based on this discovery, we define the novel dominant relationship based on temporal aggregation and use it to analyze the problem of positioning a product in a competitive market while the time frame is required. We propose a new and efficient method to process temporal aggregation dominant relationship queries using corner transformation. Our experimental evaluation using a real dataset and various synthetic datasets demonstrates that the new query types are indeed meaningful and the proposed algorithms are efficient and scalable.
On Improving the Precision of Localization with Gross Error Removal
Authors: Chongming Zhang, Xi Zhou, Chuanshan Gao, Chunmei Wang
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Location information is always useful in Wireless Sensor Networks (WSN). The precision of localization is crucialfor some specific applications. Methods for node localization in WSN usually rely on the measurements of receivedstrength or time-of-flight of an incoming signal. The quality of these measurements always has great influence on theprecision of localization. In this paper, special emphasis is put on the error analysis for distance measurement betweenWSN nodes. Error is broken down into three parts, namely, systematic error, random error, and gross error. Gross erroris highlighted and methods for removing gross error are discussed. Dixon test is recommended for gross error removalin data preprocessing phase before localization computation in WSN.