ppxscal/embedding_network huggingface dataset:
Establishing the broadcast efficiency of the Subset Difference Revocation Scheme
Authors: Thomas Martin, Keith M. Martin, Peter Wild
Venue: Designs, Codes and Cryptography (2009)

When an organisation chooses a system to make regular broadcasts to a changing user base, there is an inevitable trade off between the number of keys a user must store and the number of keys used in the broadcast. The Complete Subtree and Subset Difference Revocation Schemes were proposed as efficient solutions to this problem. However, all measurements of the broadcast size have been in terms of upper bounds on the worst-case. Also, the bound on the latter scheme is only relevant for small numbers of revoked users, despite the fact that both schemes allow any number of such users. Since the broadcast size can be critical for limited memory devices, we aid comparative analysis of these important techniques by establishing the worst-case broadcast size for both revocation schemes.
Knowledge, Games and Tales from the East
Authors: Rohit Parikh
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

We introduce some basic concepts from Game Theory and related areas and show how various insights for which we thank game theory have already occurred in the past in some tales from ancient literature, both Indian and otherwise.
CSM-SD: Methodology for contrast set mining through subgroup discovery
Authors: Petra Kralj Novak, Nada Lavrač, Dragan Gamberger, Antonija Krstačić
Venue: Journal of Biomedical Informatics (2009)

This paper addresses a data analysis task, known as contrast set mining, whose goal is to find differences between contrasting groups. As a methodological novelty, it is shown that this task can be effectively solved by transforming it to a more common and well-understood subgroup discovery task. The transformation is studied in two learning settings, a one-versus-all and a pairwise contrast set mining setting, uncovering the conditions for each of the two choices. Moreover, the paper shows that the explanatory potential of discovered contrast sets can be improved by offering additional contrast set descriptors, called the supporting factors. The proposed methodology has been applied to uncover distinguishing characteristics of two groups of brain stroke patients, both with rapidly developing loss of brain function due to ischemia:those with ischemia caused by thrombosis and by embolism, respectively.
Single machine parallel-batch scheduling with deteriorating jobs
Authors: Xianglai Qi, Shiguo Zhou, Jinjiang Yuan
Venue: Theoretical Computer Science (2009)

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n5) time algorithm for minimizing the number of tardy jobs, and an O(n2) time algorithm for minimizing the total weighted completion time. Furthermore, we prove that the problem for minimizing the weighted number of tardy jobs is binary NP-hard.
Biometric Face Recognition with Different Training and Testing Databases
Authors: Joan Fabregas, Marcos Faundez-Zanuy
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

Biometric face recognition presents a wide range of variability sources, such as make up, illumination, pose, facial expression, etc. Although some public available databases include these phenomena, it is a laboratory condition far away from real biometric system scenarios. In this paper we perform a set of experiments training and testing with different face databases in order to reduce the wide range of problems present in face images from different users (make up, facial expression, rotations, etc.). We use a novel dispersion matcher, which opposite to classical biometric systems, does not need to be trained with the whole set of users. It can recognize if two photos are of the same person, even if the photos of that person were not used in training the classifier.
Lay persons' and professionals' nutrition-related vocabularies and their matching to a general and a specific thesaurus
Authors: Tuula Poikonen, Pertti Vakkari
Venue: Journal of Information Science (2009)

This study examines the differences between expressions used by lay persons and professionals in nutrition-related questions and answers, and to what degree General Finnish Ontology (GFO) and a medical thesaurus (FinMeSH) cover these expressions. Fifty question - answer pairs were collected in an electronic answering service. Nutrition-related concepts and their expressions with their semantic relations were identified. The vocabularies of lay persons and professionals were found to be quite similar. This hints that a special consumer health vocabulary in the field of nutrition is not needed. GFO covered 32% of all expressions in questions and 37% of expressions in answers. FinMeSH covered 33% of expressions in both groups. The overlapping match of the thesauri was low, 25% in both questions and in answers. GFO and FinMeSH were found to be poor tools for supporting users in expressing nutrition-related information needs. GFO seemed not to form a covering bridge to FinMeSH.
Virtual 3D Interactions between 2D Real Multi-Views
Authors: Katia Fintzel, Jean-Luc Dugelay
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we introduce an image processing tool, Video Spatialization, as a new approach to navigate through a "virtualized" scene, only known by a limited set of 2D uncalibrated images (i.e without a 3D CAD model). We develop this approach in the context of an interactive application: a multipoint teleconferencing system for very low bit rate links (internet, mobile communications), based on the immer- sion of the 3D virtual models of all the participants, in a common virtualized meeting place controlled by video spatia- lization. This article contains (i) the recall of an efficient "mesh-oriented" algorithm for the reconstruction of real views and the synthesis of virtual ones from a triplet of uncalibrated views; (ii) some extensions of the original approach from one to n triplets of views to simulate 3D navigation and (iii) preliminary investigations using video spatialization for background control within the context of our virtual teleconferencing application.
Approach to Evidence Combination Based on Rough Set
Authors: Li Han, Li-ping Shi
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

According to the disadvantage of D-S theory and the limitation of improved combination rule, a modified combination rule based on rough set is presented. The weight of each evidence is obtained according to its influence degree on D-S combination result. Weighted averaging the evidence in the system, the Dempster combination rule is used to realize information fusion. The numerical example shows that the new combination rule can efficiently combine the conflicts evidences.
Performance Analysis of Large Receive Offload in a Xen Virtualized System
Authors: Hitoshi Oi, Fumio Nakajima
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

System-level virtualization provides us various advantages including independent and isolated computing environments on which multiple operating systems can be executed, and improved resource utilization. These benefits come with performance overheads and network operation is one of most typical cases. In this paper, we first present the experimental results of network performance with LRO under varying message sizes and maximum transmission unit (MTU). We analyze the effectiveness of large receive offload (LRO) in a consolidated execution environment based on Xen. When SPECjbb, a CPU-intensive workload, and network receiver are executed on separated domains, LRO in physical and virtual NICs improve the throughput up to 8 and 14%, respectively.
Preconditioned AOR iterative methods for M-matrices
Authors: Li Wang, Yongzhong Song
Venue: Journal of Computational and Applied Mathematics (2009)

Linear systems with M-matrices often appear in a wide variety of areas. In this paper, we give general preconditioners for solving the systems with nonsingular M-matrix. We show that our preconditioners increase the convergence rate of AOR iterative methods. Numerical results for corresponding preconditioned GMRES methods are also given.
Embedding dimension estimation of high dimensional chaotic time series using distributed time delay neural network
Authors: Maryam Parizangeneh, Mohammad Ataei, Peyman Moallem
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In the face of a practical chaotic system whose mathematical model is not available, because of unknown input factors and unavailable dynamical equations, using time series approach can be useful. Therefore, space state reconstruction of a chaotic system by using a scalar time series from its output observations is considered for obtaining information on this system from its one-dimensional signal. In this paper a method for estimation of an appropriate embedding dimension for phase space reconstruction of underlying high dimensional system from the observed chaotic time series by a Distributed Time Delay Neural Network (DTDNN) is proposed. Various methods for embedding dimension estimation have been previously studied from which False Nearest Neighbours (FNN) is the most conventional method, however the performance of this method for the high dimensional chaotic systems is not acceptable. The proposed method is applied to high dimensional chaotic systems such as approximated Mackey-Glass time series with dimensions 7, 13 and data set D1 from the Santa Fe institute. Our method for embedding dimension estimation has been compared with the conventional estimation method, and their comparisons showed the effectiveness of the proposed methodology. The results show that this method is feasible and fit for the embedding dimension estimation of high-dimensional chaotic systems.
Design and Simulation of Interconnected Autonomous Systems
Authors: Mohammed A. Qadeer, Piyush Varshney, Najmul Huda Khan
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Autonomous Systems such as Internet Service Provider (ISP), Enterprise Networks and Academic Networks provide Internet services like internet transit, domain name registration and hosting, dial-up access, leasedline access and co-location. Simulation provides an insight into the behavior of these AS. The internal details like designing, configuring and maintaining networks through protocols that include routing, switching, etc are well understood by this paper. This paper describes how the design of Autonomous Networks can be built on a NetworkDesigner while using leased line and Ethernet technologies. Later these designs can be simulated on a Network Simulator with the use of routing and switching protocols. For this scheme to be implemented successfully different equipment like routers, switches, Ethernet and serial connection, PCs, etc are used and techniques like IP addressing schemes, CIDR and VLSM is implemented.
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Authors: Samuel Rota Bulò, Marcello Pelillo
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex Δ and the maximal/maximum cliques of G. In this work we generalize the Motzkin-Straus theorem to k-uniform hypergraphs, establishing an isomorphism between local/global minimizers of a particular function over Δ and the maximal/maximum cliques of a k-uniform hypergraph. This theoretical result opens the door to a wide range of further both practical and theoretical applications, concerning continuous-based heuristics for the maximum clique problem on hypergraphs, as well as the discover of new bounds on the clique number of hypergraphs. Moreover we show how the continuous optimization task related to our theorem, can be easily locally solved by mean of a dynamical system.
Assignment Exchanges
Authors: Paul Milgrom
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We analyze "assignment exchanges"- auction and exchange mechanisms which are tight simplifications of direct Walrasian exchange mechanisms. These simplifications are distinguished by their use of assignment messages, which parameterize certain substitutable preferences. The "basic" assignment exchanges respect integer constraints, generalizing the Shapley-Shubik mechanism for indivisible goods. Connections are reported between the assignment exchanges, ascending multi-product clock auctions, uniform price auctions for a single product, and Vickrey auctions. The exchange mechanisms accommodate bids by buyers, sellers and swappers and can support trading for certain kinds of complementary goods.
On the influence of boundary condition on stability of Hagen-Poiseuille flow
Authors: Vít Prša
Venue: Computers Mathematics with Applications (2009)

We analyze the influence of choice of boundary condition (no-slip and Navier's slip boundary conditions) on linear stability of Hagen-Poiseuille flow. Several heuristic arguments based on detailed analysis of spectrum of the Stokes operator are given, and it is concluded that Navier's slip boundary condition should have a destabilizing effect on the flow. Finally the linear stability problem is solved by numerical means, and quantitative results confirming the heuristic prediction are obtained. It is shown that the destabilization is not strong enough to maintain an unstable disturbance, and that the significant destabilization effects of Navier's slip boundary condition are restricted to small values of the Reynolds number. As a byproduct we obtain explicit formulas for eigenfunctions of the Stokes operator subject to Navier's slip boundary condition.
Musical microtonal scales based in the quantitative measurement of the sensory dissonance of Sethares
Authors: Quintero Rincon Antonio
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

William A. Sethares of the University of Wisconsin in Madison, has developed a quantitative theory of the dissonance from the experimental curves of dissonance/consonance for two sinusoidal sounds of different frequency obtained in the sixties from R. Plomp and W. J. M. Levelt. The theory proposes that the intervals more consonants for a given instrument depend on the structure of his timbre. This document explains how you can capture a correct timbre with a computer then to apply the dissonance algorithm to create a musical microtonal scale with criteria.
Pulse Wave Propagation in a Large Number of Coupled Bistable Oscillators
Authors: Kuniyasu Shimizu, Tetsuro Endo, Daishin Ueyama
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A simple model of inductor-coupled bistable oscillators is shown to exhibit pulse wave propagation. We demonstrate numerically that there exists a pulse wave which propagates with a constant speed in comparatively wide parameter region. In particular, the propagating pulse wave can be observed in non-uniform lattice with noise. The propagating pulse wave can be observed for comparatively strong coupling case, and for weak coupling case no propagating pulse wave can be observed (propagation failure). We also demonstrate various interaction phenomena between two pulses.
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Authors: Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman
Venue: Journal of Scheduling (2009)

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the performance of five different heuristics for this well-known problem, namely, a truncated branch-and-cut method, a Lagrangian heuristic, a truncated column generation method, a large neighborhood search heuristic using truncated column generation for neighborhood evaluation, and a tabu search heuristic. The first three methods are adaptations of existing methods, while the last two are new in the context of this problem. Computational results on randomly generated instances show that the column generation heuristic performs the best when enough computational time is available and stability is required, while the large neighborhood search method is the best alternative when looking for good quality solutions in relatively fast computational times.
A nonisolated optimal solution of general linear multiplicative programming problems
Authors: Yongqiang Chen, Hongwei Jiao
Venue: Computers and Operations Research (2009)

This article presents a finite branch-and-bound algorithm for globally solving general linear multiplicative programming problems (GLMP). The proposed algorithm is based on the recently developed theory of monotonic optimization. The proposed algorithm provides a nonisolated global optimal solution, and it turns out that such an optimal solution is adequately guaranteed to be feasible and to be close to the actual optimal solution. It can be shown by the numerical results that the proposed algorithm is effective and the computational results can be gained in short time.
Solutions to the GSM Security Weaknesses
Authors: Mohsen Toorani, Ali Asghar Beheshti Shirazi
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Recently, the mobile industry has experienced an extreme increment in number of its users. The GSM network with the greatest worldwide number of users succumbs to several security vulnerabilities. Although some of its security problems are addressed in its upper generations, there are still many operators using 2G systems. This paper briefly presents the most important security flaws of the GSM network and its transport channels. It also provides some practical solutions to improve the security of currently available 2G systems.
Strategies and struggles with privacy in an online social networking community
Authors: Katherine Strater, Heather Richter Lipford
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

Online social networking communities such as Facebook and MySpace are extremely popular. These sites have changed how many people develop and maintain relationships through posting and sharing personal information. The amount and depth of these personal disclosures have raised concerns regarding online privacy. We expand upon previous research on users' under-utilization of available privacy options by examining users' current strategies for maintaining their privacy, and where those strategies fail, on the online social network site Facebook. Our results demonstrate the need for mechanisms that provide awareness of the privacy impact of users' daily interactions.
Detectability of internal bridging faults in scan chains
Authors: F. Yang, S. Chakravarty, N. Devta-Prasanna, S. M. Reddy, I. Pomeranz
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Scan chains contain a high percentage of the transistors in logic parts of VLSI designs. Nevertheless, faults inside scan cells are not directly targeted by scan based tests currently used, and they are assumed to be detected by what are called flush tests. Recently we investigated the detectability of stuck-at, stuck-on and stuck-open faults internal to scan chains using existing tests. We also proposed new flush tests and appropriate ordering of flush tests to achieve higher fault coverage. In this paper, we investigate detection of a set of scan cell internal bridging faults extracted from layout. We show that the detection of some zero-resistance non-feedback bridging faults requires two-pattern tests. Half-speed flush tests we proposed earlier to improve the coverage of stuck-at, stuck-on and stuck-open faults also detect additional bridging faults. We classify the undetectable faults based on the reasons for their undetectability. We observe that the driver strengths of the scan cell inputs can be optimized to improve the bridging fault coverage. Both zero-resistance and nonzero-resistance bridging fault models are considered in this work. A low power supply voltage based test method and IDDQ testing are examined for resistive bridging fault detection.
Emerging trends and technologies in the computer industry: keynote address Friday, April 3, 2009
Authors: Jeff Jackson
Venue: Journal of Computing Sciences in Colleges (2009)

In his keynote address, Mr. Jackson will deliver a dynamic and forward-looking talk linking together emerging/current trends/usages (ultra mobility, social networking, visualization) and emerging technologies (low power-high perf, wi-max, GPUs).
Combining named entities and tags for novel sentence detection
Authors: Yi Zhang, Flora S. Tsai
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

Novel sentence detection aims at identifying novel information from an incoming stream of sentences. Our research applies named entity recognition (NER) and part-of-speech (POS) tagging on sentence-level novelty detection and proposes a mixed method to utilize these two techniques. Furthermore, we discuss the performance when setting different history sentence sets. Experimental results of different approaches on TREC'04 Novelty Track show that our new combined method outperforms some other novelty detection methods in terms of precision and recall. The experimental observations of each approach are also discussed.
Cleansing Noisy Data Streams
Authors: Xingquan Zhu, Peng Zhang, Xindong Wu, Dan He, Chengqi Zhang, Yong Shi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this paper, we identify a new research problem on cleansing noisy data streams which contain incorrectly labeled training examples. The objective is to accurately identify and remove mislabeled data, such that the prediction models built from the cleansed streams can be more accurate than the ones trained from the raw noisy streams. For this purpose, we first use bias-variance decomposition to derive a maximum variance margin (MVM) principle for stream data cleansing. Following this principle, we further propose a local and global filtering (LgF) framework to combine the strength of local noise filtering (within one single data chunk) and global noise filtering (across a number of adjacent data chunks) to identify erroneous data. Experimental results on six data streams (including two real-world data streams) demonstrate that LgF significantly outperforms simple methods in identifying noisy examples.