ppxscal/embedding_network huggingface dataset:
The Complexity of Distinguishing Markov Random Fields
Authors: Andrej Bogdanov, Elchanan Mossel, Salil Vadhan
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bounded degree from independent samples from the Markov random field. These results require observing samples of the distribution at all nodes of the graph. It was heuristically recognized that the problem of reconstructing the model where there are hidden variables (some of the variables are not observed) is much harder.Here we prove that the problem of reconstructing bounded-degree models with hidden nodes is hard. Specifically, we show that unless NP = RP, It is impossible to decide in randomized polynomial time if two models generate distributions whose statistical distance is at most 1/3 or at least 2/3. Given two generating models whose statistical distance is promised to be at least 1/3, and oracle access to independent samples from one of the models, it is impossible to decide in randomized polynomial time which of the two samples is consistent with the model. The second problem remains hard even if the samples are generated efficiently, albeit under a stronger assumption.
The Carry Leakage on the Randomized Exponent Countermeasure
Authors: Pierre-Alain Fouque, Denis Réal, Frédéric Valette, Mhamed Drissi
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

In this paper, we describe a new attack against a classical differential power analysis resistant countermeasure in public key implementations. This countermeasure has been suggested by Coron since 1999 and is known as the exponent randomization.Here, we show that even though the binary exponentiation, or the scalar product on elliptic curves implementation, does not leak information on the secret key, the computation of the randomized secret exponent, or scalar, can leak useful information for an attacker. Such part of the algorithm can be not well-protected since its goal is to avoid attack during the exponentiation. Consequently, our attack can be mounted against any kind of exponentiation, even very resistant as soon as the exponent randomization countermeasure is used. We target an ¿-bit adder which adds ¿-bit words of the secret exponent and of a random value. We show that if the carry leaks during the addition, then we can almost learn the high order bits of each word of the secret exponent. Finally, such information can be then used to recover the entire secret key of RSA or ECC based cryptosystems.
Investment decisions: influence of an internet stock message board
Authors: Alan G. Mayper
Venue:  (2007)

The Internet provides many sources of financial information that investors can use to help with investment decisions and in interpreting companies&rsquo; accounting information. One source of information is Internet stock message boards such as those at Yahoo! Finance. This source allows for anonymous postings and information exchange. Despite the possibility of the information being incorrect many individuals visit these message boards. The purpose of this study is to investigate Internet stock message boards and address the primary question: From an individual investor perspective, do message boards, which contain accounting information, influence investment decisions?The question is addressed using psychology rumor literature and attitude theories. Message board postings are a type of rumor, since not all the information is verified and is usually intended to persuade a belief or influence a decision. Further, the messages may influence an investor by causing a change in attitude about the investment.Using an experiment, message board influence on an investment decision and attitude was tested. The results indicated that individuals that received negative message board postings did have a significantly higher change in investment amount as compared to a control group that did not receive any message postings. The positive message board group and the control group were not significantly different in their amount of investment change. The results of the study also show that message board postings influenced attitude, those that received negative (positive) postings had a negative (positive) attitude about the investment. It was further found that those with a negative (positive) attitude decreased (increased) their investment. Finally, contrary to expectations, investment experience did not lead to an individual being less influenced by message board postings.This study contributes to the accounting literature by investigating an additional source of Internet financial reporting that may or may not contain correct information. The SEC is concerned over the manipulative opportunities that are available within these message boards and many investors are exploring these new sources of information instead of relying on traditional accounting information. This study finds that negative postings have an influence on investment decision and possibly should be investigated as manipulative techniques.
A Comparative Evaluation of User Preferences for Mobile Chat Usable Interface
Authors: Daniel Kuen Su, Victoria Siew Yee
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

This paper aims to investigate user preferences for mobile chat usable interfaces. We have designed graphical-based usable interfaces for mobile chat to ease the navigation control for efficient tracking of specific messages in a long chat archive We have conducted a comparative evaluation between text-based and graphical-based usable interfaces for mobile chat systems. The statistical research outcomes exemplified that there were significant differences on user preferences between text-based and graphical-based systems with regards to gender, education level, and usage frequency of one-to-one mobile chat systems. Additionally, the experimental evaluation results have highlighted the potential use of graphical-based usable interfaces for mobile chat systems that have significantly gained user preferences and were well perceived as usable interfaces among the test subjects.
A Framework for Sensitivity Analysis in Spatial Multiple Criteria Evaluation
Authors: Arika Ligmann-Zielinska, Piotr Jankowski
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

The paper presents a framework for sensitivity analysis (SA) in spatial multiple criteria evaluation (S-MCE). The framework focuses on three aspects of S-MCE: spatiality, scope, and cardinality. Spatiality stresses the importance of spatial criteria and spatial weights that should be explicitly considered in GIS-based MCE. Scope relates to the extent of SA, ranging from local one-at-a-time criterion examination to global testing of interdependencies among the multiple criteria model components. Cardinality addresses the duality of motivation for performing SA, namely, single-user learning and group consensus building. The framework organizes the existing SA techniques according to spatiality and scope and can be used as a conceptual guide in selecting SA techniques fitting a task at hand.
The configuration data caching pattern
Authors: Leon Welicki
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

The CONFIGURATION DATA CACHING pattern describes how an application can consume efficiently configuration data stored in external repositories (databases, files, etc.). This is achieved by avoiding reacquisition of the parameters, holding the retrieved parameters in memory in a cache.
Good Variants of HB + Are Hard to Find
Authors: Henri Gilbert, Matthew J. Robshaw, Yannick Seurin
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

The strikingly simple HB + protocol of Juels and Weis [11] has been proposed for the authentication of low-cost RFID tags. As well as being computationally efficient, the protocol is accompanied by an elegant proof of security. After its publication, Gilbert et al. [8] demonstrated a simple man-in-the-middle attack that allowed an attacker to recover the secret authentication keys. (The attack does not contradict the proof of security since the attacker lies outside the adversarial model.) Since then a range of schemes closely related to HB + have been proposed and these are intended to build on the security of HB + while offering resistance to the attack of [8]. In this paper we show that many of these variants can still be attacked using the techniques of [8] and the original HB + protocol remains the most attractive member of the HB + family.
An Improved Multiple-Instance Learning Algorithm
Authors: Fengqing Han, Dacheng Wang, Xiaofeng Liao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Multiple-instance learning (MIL) is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. In this paper a novel algorithm has been introduced for multiple-instance learning. This method was inspired by both diverse density (DD) and its expectation maximization version (EM-DD). It converts MIL problem to a single-instance setting. This improved method has better accuracy and time complexity than DD and EM-DD. We apply it to drug activity prediction and image retrieval. The experiments show it has competitive accuracy values compared with other previous approaches.
Tsinghua Face Detection and Tracking for CLEAR 2007 Evaluation
Authors: Yuan Li, Chang Huang, Haizhou Ai
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper presents the algorithm and evaluation results of a face detection and tracking system. A tree-structured multi-view face detector trained by Vector Boosting is used as the basic detection module. Once a new face are detected, a track is initialized and maintained by detection confidence and Lucas-Kanade features, which are fused by particle filter. Additionally, a post process is adopted to eliminate low confidence tracks and connect track fragments which are likely to belong to the same target. Evaluation results are given on video data of CLEAR 2007 test set.
Additive noise and multiplicative bias as disclosure limitation techniques for continuous microdata: A simulation study
Authors: M. Trottini, S. E. Fienberg, U. E. Makov, M. M. Meyer
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

This paper focuses on a combination of two disclosure limitation techniques, additive noise and multiplicative bias, and studies their efficacy in protecting confidentiality of continuous microdata. A Bayesian intruder model is extensively simulated in order to assess the performance of these disclosure limitation techniques as a function of key parameters like the variability amongst profiles in the original data, the amount of users prior information, the amount of bias and noise introduced in the data. The results of the simulation offer insight into the degree of vulnerability of data on continuous random variables and suggests some guidelines for effective protection measures.
Proof Identity for Classical Logic: Generalizing to Normality
Authors: Roman Kuznets
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

The problem of the identity criteria for proofs can be traced to Hilbert and Prawitz. One of the approaches, which uses the concept of generality of proofs, was suggested in 1968 by Lambek. Following his ideas, we propose a language and a logic to represent Hilbert-style proofs for classical propositional logic by adapting the Logic of Proofs (LP) introduced by Artemov in 1994. We prove that proof polynomials, the objects representing Hilbert derivations in LP, are sufficient to realize all propositional derivations, with or without hypotheses. We also show that proof polynomials respect the ideas of generality and provide an algorithm for determining whether two given proof polynomials represent the same proof. These results naturally extend similar properties of combinatory logic demonstrated by Hindley. The language of LP allows us to formally capture more structure of Hilbert-style proofs. In particular, we show how the well-known phenomenon of proof composition in classical logic manifests itself in the case of Hilbert proofs.
On the Acyclic Chromatic Number of Hamming Graphs
Authors: Robert E. Jamison, Gretchen L. Matthews
Venue: Graphs and Combinatorics (2008)

An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered. Upper and lower bounds on the acyclic chromatic number of Hamming graphs are given.
The threshold voltage of MOSFET and its influence on digital circuits
Authors: Milaim Zabeli, Nebi Caka, Myzafere Limani, Qamil Kabashi
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

The aim of this paper is to research the impact of physical parameters which characterize the MOSFET transistors structure on the threshold voltage value. The MOSFET threshold voltage value will have influence in behaviour of electronic device which contain MOSFET transistors. The results obtained emphasize the impact of each single physical parameter on the total value of the threshold voltage. Moreover, all of these parameters will have significant and small impact on the threshold voltage. Hence, by adjusting the values of MOSFET physical parameters the accepted threshold voltage can be achieved. As the threshold voltage will have influence on critical voltage values which characterise MOSFET digital circuits and delays during transfer logic states, it must be taken into consideration during design phase of logic gates.
Iterative Learning of Simple External Contextual Languages
Authors: Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the class admits, for all values of q, polynomial time learnability provided an adequate choice of the hypothesis space is given. On the other hand, additional constraints like consistency and conservativeness or the use of a one-one hypothesis space changes the picture -- iterative learning limits the long term memory of the learner to the current hypothesis and these constraints further hinder storage of information via padding of this hypothesis. It is shown that if q > 3, then simple external contextual languages are not iteratively learnable using a class preserving one-one hypothesis space, while for q = 1 it is iteratively learnable, even in polynomial time. For the intermediate levels, there is some indication that iterative learnability using a class preserving one-one hypothesis space might depend on the size of the alphabet. It is also investigated for which choice of the parameters, the simple external contextual languages can be learnt by a consistent and conservative iterative learner.
Natural Language Descriptions of Human Behavior from Video Sequences
Authors: Carles Fernández Tena, Pau Baiget, Xavier Roca, Jordi Gonzàlez
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

This contribution addresses the generation of textual descriptions in several natural languages for evaluation of human behavior in video sequences. The problem is tackled by converting geometrical information extracted from videos of the scenario into predicates in fuzzy logic formalism, which facilitates the internal representations of the conceptual data and allows the temporal analysis of situations in a deterministic fashion, by means of Situation Graph Trees (SGTs). The results of the analysis are stored in structures proposed by the Discourse Representation Theory (DRT), which facilitate a subsequent generation of natural language text. This set of tools has been proved to be perfectly suitable for the specified purpose.
Selecting the Right Features for Bipartite-Based Text Clustering
Authors: Chao Qu, Yong Li, Jie Zhang, Tianming Hu, Qian Chen
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Document datasets can be described with a bipartite graph where terms and documents are modeled as vertices on two sides respectively. Partitioning such a graph yields a co-clustering of words and documents, in the hope that the cluster topic can be captured by the top terms and documents in the same cluster. However, single terms alone are often not enough to capture the semantics of documents. To that end, in this paper, we propose to employ hyperclique patterns of terms as additional features for document representation. Then we use F-score to select the top discriminative features to construct the bipartite. Finally, the extensive experiments indicated that compared to the standard bipartite formulation, our approach is able to achieve better clustering performance at a smaller graph size.
Contained Rewritings of XPath Queries Using Views Revisited
Authors: Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

We revisit the problem of finding maximal contained rewritings of tree pattern queries using views, and extend previous work to the case where both the query and the view involve *, with the restriction that no *-node is incident on any //-edge, and there are no leaf *-nodes. When there is no dtd, we show how to modify the approach of useful embedding in a previous work to find the maximal contained rewriting. When there is a dtd that is represented as an acyclic schema graph G, we show how to efficiently transform the view V to an equivalent DAG-pattern V¿, and reduce the problem of finding the maximal contained rewriting of query Q using V under G to that of finding the maximal contained rewriting of Q using V¿ without dtds.
stdchk: A Checkpoint Storage System for Desktop Grid Computing
Authors: Samer Al-Kiswany, Matei Ripeanu, Sudharshan S. Vazhkudai, Abdullah Gharaibeh
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Checkpointing is an indispensable technique to provide fault tolerance for long-running high-throughput applications like those running on desktop grids. This article argues that a checkpoint storage system, optimized to operate in these environments, can offer multiple benefits: reduce the load on a traditional file system, offer high-performance through specialization, and, finally, optimize data management by taking into account checkpoint application semantics. Such a storage system can present a unifying abstraction to checkpoint operations, while hiding the fact that there are no dedicated resources to store the checkpoint data. We prototype stdchk, a checkpoint storage system that uses scavenged disk space from participating desktops to build a low-cost storage system, offering a traditional file system interface for easy integration with applications. This article presents the stdchk architecture, key performance optimizations, and its support for incremental checkpointing and increased data availability. Our evaluation confirms that the stdchk approach is viable in a desktop grid setting and offers a low cost storage system with desirable performance characteristics: high write throughput as well as reduced storage space and network effort to save checkpoint images.
3D level set anysotropic etching profile evolution simulations
Authors: Branislav Radjenovic
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

Level set method, introduced by Osher and Sethian, is a highly robust and accurate computational technique for tracking of moving interfaces in etching, deposition and photolithography processes. It originates from the idea to view the moving front as a particular level set of a higher dimensional function, so the topological merging and breaking, sharp gradients and cusps can form naturally, and the effects of curvature can be easily incorporated. The corresponding equations of motion for the propagating surfaces, which resemble Hamilton-Jacobi equations with parabolic right-hand sides, can be solved using methods for solving hyperbolic conservation laws, ensuring in that the way correct entropy-satisfying solution. In this paper we describe an application of the sparse field method for solving level set equations in 3D anisotropic wet etching of silicon with potassium hydroxide (KOH). Angular dependence of the silicon etching rate is determined on the basis of the silicon crystal symmetry properties. Some examples illustrating developed methodology are given.
A Rough Set Based Anomaly Detection Scheme Considering the Age of User Profiles
Authors: Ihn-Han Bae
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper presents an efficient rough set based anomaly detection method that can effectively identify a group of especially harmful internal attackers --- masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on this, the use pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function with the age of the user profile.
J2EE Architecture for Database Cluster-Based High Volume E-Commerce Web Applications
Authors: Vishal Batra, Wen-Syan Li, Sumit Negi
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

High volume database-driven e-commerce applications demand a cluster-based infrastructure to offers high availability, scalability and fault tolerance. The current J2EE architecture and containers restrict the transparent deployment of applications over database clusters without engineering data access logic into the applications. Our work extends the J2EE architecture to allow transparent deployment of J2EE applications on a database cluster. The key challenge is to load balance read and write queries between the master and replica database instance and yet provide the application with the most recent data in the cluster while enabling service class based query routing. We validate the applicability and effectiveness of the proposed architecture using IBM WebSphere Trade3 stock trading application.