ppxscal/embedding_network huggingface dataset:
Information Sharing Agents in a Peer Data Exchange System
Authors: Leopoldo Bertossi, Loreto Bravo
Venue: Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems (2008)

We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supplement or modify its own data source. The data exchange relationships between peers are specified by logical sentences called data exchange constraints and trust relationships, which together determine how data is moved around (in order to keep them satisfied). This process determines virtual, alternative instances for a peer that can be specified as the models of an answer set program. The peer consistent answers to a query that are returned by a peer are those that are invariant under all these instances. The logic program can be used to compute peer consistent answers.
Topic 13 High-Performance Networks
Authors: Thilo Kielmann, Pascale Primet, Tomohiro Kudoh, Bruce Lowekamp
Venue: Proceedings of the 13th European international conference on Parallel Processing (2007)

Communication networks are likely among the most crucial resources for parallel and distributed computer systems. The last couple of years has seen many significant technical improvements, ranging from advanced on-chip interconnects, via system and storage-area networks, up to dedicated, optical wide-area networks. While this technology push is bringing new opportunities, it also comes with many new research challenges.
Localized artificial diffusivity scheme for discontinuity capturing on curvilinear meshes
Authors: S. Kawai, S. K. Lele
Venue: Journal of Computational Physics (2008)

A simple and efficient localized artificial diffusivity scheme is developed for the purpose of capturing discontinuities on curvilinear and anisotropic meshes using a high-order compact differencing scheme. The artificial diffusivity is dynamically localized in space to capture different types of discontinuities such as a shock wave, contact surface or material discontinuity. The method is intended for use with large-eddy simulation of compressible transitional and turbulent flows. The method captures the discontinuities on curvilinear and anisotropic meshes with minimum impact on the smooth flow regions. The amplitude of wiggles near a discontinuity and the number of grid points used to capture the discontinuity do not depend on the mesh size. The comparisons between the proposed method and high-order shock-capturing schemes illustrate the advantage of the method for the simulation of flows involving shocks, turbulence and their interactions. The multi-dimensional formulation is tested on a variety of 1D and 2D, steady and unsteady, different types of discontinuity-related problems on curvilinear and anisotropic meshes. A simplification of the method which reduces the computational cost does not show any major detrimental effect on the discontinuity capturing under the conditions examined.
Hand Tremor Classification Using Bispectrum Analysis of Acceleration Signals and Back-Propagation Neural Network
Authors: Lingmei Ai, Jue Wang, Liyu Huang, Xuelian Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

This paper presents a new approach to classify three types of tremor, including parkinsonian, essential and physiological tremors, by using bispectrum analysis of time series of hand tremor and neural network. The acceleration signals of hand tremor from voluntary subjects were recorded and the features of diagonal slices of bispectrum were extracted. A simple BP artificial neural network classifier based on LM algorithm has been used for classification. The study indicates the accuracy rate is over 92.9%. The results show that the method has a better performance than other methods, such as time or frequency domain analysis,and provide a new approach to classify tremor for clinical neurosurgeon.
The Diver Project: Interactive Digital Video Repurposing
Authors: Roy Pea, Michael Mills, Joseph Rosen, Kenneth Dauber, Wolfgang Effelsberg, Eric Hoffert
Venue: IEEE MultiMedia (2004)

The Digital Interactive Video Exploration and Reflection (Diver) system lets users create virtual pathways through existing video content using a virtual camera and an annotation window for commentary. Users can post their Dives to the WebDiver server system to generate active collaboration, further repurposing, and discussion.
Multi-features fusion diagnosis of tremor based on artificial neural network and D-S evidence theory
Authors: Lingmei Ai, Jue Wang, Xuelian Wang
Venue: Signal Processing (2008)

With respect to three kinds of familiar tremor, including essential tremor (ET), Parkinsonian disease (PD) tremor, and physiological tremor (PT), which are subjected to frequent clinical misdiagnosis, a new fusion diagnosis method for tremor based on multi-features extraction, back-propagation neural network (BPNN), and Dempster-Shafer (D-S) evidence theory is proposed to overcome the clinical misdiagnosis. First the features of hand acceleration signals of subjects with ET, PD, and PT were extracted using bispectrum, empirical mode decomposition (EMD) and discrete wavelet transform (DWT) analysis methods, respectively. Second the resulting features were subsequently recognized by three independent BPNNs, respectively, the outputs of which were further processed and acted as basic probability assignments for tremor. Finally, the basic probability assignments were fused by the D-S evidence theory and decision-making analysis was performed. The experimental analysis results indicate that the accuracy of fusion results of the D-S evidence theory is markedly higher than the independent diagnosis of BPNN. The method proposed in this paper is able to adequately utilize the complementary multi-features information for accurately recognizing tremor types, thus providing practical guiding significance for diagnosing tremor types in clinic.
Optimal combinatorial electricity markets
Authors: Yoseba K. Penya, Nicholas R. Jennings
Venue: Web Intelligence and Agent Systems (2008)

The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage and meet their energy needs. To this end, this paper develops a new model for electricity retail where end-use customers choose their supplier from competing electricity retailers. The model is based on simultaneous reverse combinatorial auctions, designed as a second-price sealed-bid multi-item auction with supply function bidding. This model prevents strategic bidding and allows the auctioneer to maximise its pay-off. Furthermore, we develop optimal single-item and multi-item algorithms for winner determination in such auctions that are significantly less complex than those currently available in the literature.
Sparse Super Symmetric Tensor Factorization
Authors: Andrzej Cichocki, Marko Jankovic, Rafal Zdunek, Shun-Ichi Amari
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric Nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case: Symmetric Nonnegative Matrix Factorization (SNMF) that have many potential applications, including multi-way clustering, feature extraction, multi- sensory or multi-dimensional data analysis, and nonnegative neural sparse coding. The main advantage of the derived algorithms is relatively low complexity, and in the case of multiplicative algorithms possibility for straightforward extension of the algorithms to L-order tensors factorization due to some nice symmetric property. We also propose to use a wide class of cost functions such as Squared Euclidean, Kullback Leibler I-divergence, Alpha divergence and Beta divergence. Preliminary experimental results confirm the validity and good performance of some of these algorithms, especially when the data have sparse representations.
Computational Complexity of Constraint Satisfaction
Authors: Heribert Vollmer
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations over the appropriate domains; the question is if there is an assignment of values to the variables that satisfies all constraints. Different algorithmic tasks for CSPs (checking satisfiability, counting the number of solutions, enumerating all solutions) can be used to model many problems in areas such as computational logic, artificial intelligence, circuit design, etc. We will survey results on the complexity of these computational tasks as a function of properties of the allowed constraint relations. Particular attention is paid to the special case of Boolean constraint relations.
Question/Answer Games on Towers and Pyramids
Authors: Sarmad Abbasi, Numan Sheikh
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Question/Answer games [3] (Q/A games) are a generalization of the game introduced in [1,2]. They are motivated by the classical game of twenty questions and are a generalization of Rényi-Ulam Game. A k-round Q/A game, G = (D,(q 1, ..., q k )), is played on a rooted directed acyclic graph, D = (V,E). In the i-th round, Paul selects a set, Q i ¿ V, of at most q i non-terminal vertices. Carole responds by choosing an outgoing edge from each vertex in Q i . At the end of k rounds, Paul wins if Carole's answers define a unique path from the root to one of the terminal vertices in D. Arbitrary Q/A games are known to be PSPACE-complete [3], and k-round games are known to be Σ 2k ¿ 2-complete [4]. In this paper we study Q/A games on two classes of graphs, towers and pyramids, respectively. We completely solve the problem of determining the winner for Q/A games on towers. We also solve an open problem on Q/A games on pyramids from [1,2]. Furthermore, we give some non-trivial lower and upper bounds for the rest of the cases for Q/A games on pyramids.
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
Authors: Bin Hu, Markus Leitner, Günther R. Raidl
Venue: Journal of Heuristics (2008)

We consider the generalized version of the classical Minimum Spanning Tree problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. We present a Variable Neighborhood Search (VNS) approach which uses three different neighborhood types. Two of them work in complementary ways in order to maximize search effectivity. Both are large in the sense that they contain exponentially many candidate solutions, but efficient polynomial-time algorithms are used to identify best neighbors. For the third neighborhood type we apply Mixed Integer Programming to optimize local parts within candidate solution trees. Tests on Euclidean and random instances with up to 1280 nodes indicate especially on instances with many nodes per cluster significant advantages over previously published metaheuristic approaches.
Improving density-based methods for hierarchical clustering of web pages
Authors: Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani
Venue: Data Knowledge Engineering (2008)

The rapid increase of information on the web makes it necessary to improve information management techniques. One of the most important techniques is clustering web data. In this paper, we propose a new 3-phase clustering method that finds dense units in a data set using density-based algorithms. The distances in the dense units are stored in order in structures such as a min heap. In the extraction stage, these distances are extracted one by one, and their effects on the clustering process are examined. Finally, in the combination stage, clustering is completed using improved versions of well-known single and average linkage methods. All steps of the methods are performed in O(nlogn) time complexity. The proposed methods have the benefit of low complexity, and experimental results show they generate clusters with high quality. Other experiments also show that they provide additional advantages, such as clustering by sampling.
Evaluating Information Visualizations
Authors: Sheelagh Carpendale
Venue: Information Visualization: Human-Centered Issues and Perspectives (2008)

Information visualization research is becoming more established, and as a result, it is becoming increasingly important that research in this field is validated. With the general increase in information visualization research there has also been an increase, albeit disproportionately small, in the amount of empirical work directly focused on information visualization. The purpose of this chapter is to increase awareness of empirical research in general, of its relationship to information visualization in particular; to emphasize its importance; and to encourage thoughtful application of a greater variety of evaluative research methodologies in information visualization.
Haptography: capturing the feel of real objects to enable authentic haptic rendering (invited paper)
Authors: Katherine J. Kuchenbecker
Venue: Proceedings of the 2008 Ambi-Sys workshop on Haptic user interfaces in ambient media systems (2008)

Haptic interfaces are designed to allow humans to touch virtual objects as though they were real. Unfortunately, virtual surface models currently require extensive hand tuning and do not feel authentic, which limits the usefulness and applicability of such systems. The proposed approach of haptography seeks to address this deficiency by basing models on haptic data recorded from real interactions between a human and a target object. The studio haptographer uses a fully instrumented stylus to tap, press, and stroke an item in a controlled environment while a computer system records positions, orientations, velocities, accelerations, and forces. The point-and-touch haptographer carries a simply instrumented stylus around during daily life, using it to capture interesting haptic properties of items in the real world. Recorded data is distilled into a haptograph, the haptic impression of the object or surface patch, including properties such as local shape, stiffness, friction, and texture. Finally, the feel of the probed object is recreated via a haptic interface by accounting for the device's natural dynamics and focusing on the feedback of high-frequency accelerations.
Biometrics --- How to Put to Use and How Not at All?
Authors: Andreas Pfitzmann
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

After a short introduction to biometrics w.r.t. IT security, we derive conclusions on how biometrics should be put to use and how not at all. In particular, we show how to handle security problems of biometrics and how to handle security and privacy problems caused by biometrics in an appropriate way. The main conclusion is that biometrics should be used between human being and his/her personal devices only.
Logic of Discovery and Knowledge: Decision Algorithm
Authors: Sergey Babenyshev, Vladimir Rybakov
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The logic of Chance Discovery (CD) as well as mathematical models for CD, by the very nature of the term chance, are hard to formalize, which poses challenging problems for mathematization of the area. It does not completely prevent us though from studying the logical laws which chance discovery and related notions should abide, especially in a carefully chosen and reasonably expressive mathematical formalism. The framework, the authors suggest in this paper, is based on a well-developed area of modal logic, more precisely on Kripke-Hintikka semantics, with a notable distinction: unlike some other hybridization schemes, it leads to decidable logics, while still preserving high expressive power. We demonstrate our approach by an example of the Logic of Discovery and Knowledge, where a regular modal language is augmented with higher level operators intended to model some contrasting aspects of Chance Discovery: uncertain necessity of discovery and local common knowledge within contexts admitting branching time.
Toward more comprehensive performance testing using simulation
Authors: Cynthia Hood
Venue:  (2007)

This thesis presents research involving testing TCP performance testing in the simulation environments. As computer networks become more complex and involve a variety of network protocols, network simulations become more important because the simulation tools provide easy collection of data about a large set of scenarios, experiment on large scale networks, and examine what-if situations. There are issues to obtain trustable simulation results. In particular, three issues are explored: how details of the lower layer models impact TCP performance, the use of easily configurable general purpose simulation tools for TCP performance testing, and how to test and understand the assumptions and implications of these TCP internal mechanisms under a wide range of error situations. This thesis proposes methods to analyze these issues. For the first issue, two different microwave oven models are developed and the impact of modeling assumptions made at the IEEE 802.11 physical layer and MAC protocols are analyzed. For the second issue, a tracing method is developed to quantify the impact of subtle implementation differences on TCP performance results. For the third issue, two different positions for the packet loss model in a wireless IEEE 802.11 LAN network are compared to identify the impact of lower layer implementation on TCP performance result and develop effective testing strategies. Insights gained can be used to improve error modeling in general and specifically interference modeling in wireless networks. This research also can be used to develop a comprehensive protocol testing strategy.
Evaluation of capture-recapture models for estimating the abundance of naturally-occurring defects
Authors: Gursimran Singh Walia, Jeffrey C. Carver
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Project managers can use capture-recapture models to manage the inspection process by estimating the number of defects present in an artifact and determining whether a reinspection is necessary. Researchers have previously evaluated capture-recapture models on artifacts with a known number of defects. Before applying capture-recapture models in real development, an evaluation of those models on naturally-occurring defects is imperative. The data in this study is drawn from two inspections of real requirements documents (that later guided implementation) created as part of a capstone course (i.e. with naturally occurring defects). The major results show that: a) estimators improve from being negatively biased after one inspection to being positively biased after two inspections, b) the results contradict the earlier result that a model that includes two sources of variation is a significant improvement over models with one source of variation, and c) estimates are useful in determining the need for artifact reinspection.
Towards a Platform for Cooperative Creation of Scientific Publications
Authors: Guilherme Saraiva, Orlando Carvalho, Benjamim Fonseca, Hugo Paredes
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

Writing scientific publications is usually a challenging and complex activity, involving several authors. Despite the different natures of their contributions, this activity is clearly collaborative and the collaboration is usually achieved through face-to-face meetings and using email to exchange the documents. More recently the availability of collaborative editors introduced a further step in the collaboration, but none of the existing solutions contemplate some specific issues like referencing and publishing adequately. This fact motivated us to conduct a study to evaluate the requirements for a platform that integrates in a single solution the three main functionalities required: a text editor, a reference manager and a connector to scientific digital repositories.
Constraint based optimization of stationary fields
Authors: Ian Rogers, Jisheng Zhao, Chris Kirkham, Ian Watson
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

In many scenarios a field holds a value that is constant beyond a certain point in the execution of the program. However, Java only allows it to be marked as being final in relation to the control-flow of the program. We present a language extension whereby the programmer can express that a field will have an unchanging value once it satisfies a given constraint. That is the constraint is the guarantee of finality as opposed to the particular code region. A field holding an unchanging value is said to be stationary. The resulting change of the language has similar pitfalls to keywords that express immutability in a dynamic system. However, it provides a number of advantages: ability for improved partial evaluation and specialisation in dynamic compilation, simple inspection to show thread safety and richer information to the runtime environment. We present an implementation of our proposed language extension to Java in the Jikes Research Virtual Machine (RVM). We use class loading as a case study of where lazy initialisation occurs. In code that is frequently executed the probability of a referenced class being uninitialised is less than 1% for method accesses and for fields typically 0%. We create an optimization framework that uses this information to perform specialisation and partial evaluation. We demonstrate that on average 61.32% of accesses occur to fields in their stationary state. We demonstrate that stationary information allows optimizations achieving a best case 3.90% speedup of benchmark applications, and 1.67% speedup on average.
An study to increase the critical thinking and problem solving abilities by web-based learning
Authors: Rong-Jyue Fang, Chien-Chung Lin, Hung-Jen Yang, Chi-Jen Lee, Hua-Lin Tsai, Tien-Sheng Tsai
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

The purpose of this study is to understand the experimental effects of web-based critical thinking instruction program for promoting students' abilities. The methodology is experiment instruction with two tools: "The test of critical thinking skills for k-9 students" and "The test of problem-solving abilities for primary school students". It found that students' critical thinking and problem-solving abilities has been promoted after performing web-based critical thinking instruction. The results can be given reference for teachers to innovative instruction and performance in web-based instruction.