ppxscal/embedding_network huggingface dataset:
A Framework for Efficient and Composable Oblivious Transfer
Authors: Chris Peikert, Vinod Vaikuntanathan, Brent Waters
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally composable, and generally realizable under any one of a variety of standard number-theoretic assumptions, including the decisional Diffie-Hellman assumption, the quadratic residuosity and decisional composite residuosity assumptions, and worst-case lattice assumptions.Our OT protocols are round-optimal (one message each way), quite efficient in computation and communication, and can use a single common string for an unbounded number of executions between the same sender and receiver. Furthermore, the protocols can provide statistical security to either the sender or the receiver, simply by changing the distribution of the common string. For certain instantiations of the protocol, even a common uniformly random string suffices.Our key technical contribution is a simple abstraction that we call a dual-mode cryptosystem. We implement dual-mode cryptosystems by taking a unified view of several cryptosystems that have what we call "messy" public keys, whose defining property is that a ciphertext encrypted under such a key carries no information (statistically) about the encrypted message.As a contribution of independent interest, we also provide a multi-bit amortized version of Regev's lattice-based cryptosystem (STOC 2005) whose time and space complexity are improved by a linear factor in the security parameter n. The resulting amortized encryption and decryption times are only $\tilde{O}(n)$ bit operations per message bit, and the ciphertext expansion can be made as small as a constant; the public key size and underlying lattice assumption remain essentially the same.
PAR: Payment for Anonymous Routing
Authors: Elli Androulaki, Mariana Raykova, Shreyas Srivatsan, Angelos Stavrou, Steven M. Bellovin
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

Despite the growth of the Internet and the increasing concern for privacy of online communications, current deployments of anonymization networks depend on a very small set of nodes that volunteer their bandwidth. We believe that the main reason is not disbelief in their ability to protect anonymity, but rather the practical limitations in bandwidth and latency that stem from limited participation. This limited participation, in turn, is due to a lack of incentives to participate. We propose providing economic incentives, which historically have worked very well.In this paper, we demonstrate a payment scheme that can be used to compensate nodes which provide anonymity in Tor, an existing onion routing, anonymizing network. We show that current anonymous payment schemes are not suitable and introduce a hybrid payment system based on a combination of the Peppercoin Micropayment system and a new type of "one use" electronic cash. Our system claims to maintain users' anonymity, although payment techniques mentioned previously --- when adopted individually --- provably fail.
Biosignals Offer Potential for Direct Interfaces and Health Monitoring
Authors: Vince Stanford
Venue: IEEE Pervasive Computing (2004)

This Applications department looks into an emerging class of user interfaces. We'll examine efforts to harness biosignals to enable enhanced computer interfaces. Though still early in the cycle, theirgreat potential for enhanced assistive technologies suggests they will become important, as moretechnical issues resolve themselves. In particular, biosignals can serve for passive health monitoring for the elderly who want to remain at home but need some level of support as they age.
Towards an Epistemic Logic for Uncertain Agents
Authors: Zining Cao
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

In this paper, we propose a logic for reasoning about probabilistic belief, called PBL r . Our language introduces formulas that express "agent i believes that the probability of φ is at least p". We first provide an inference system of PBL r , and then introduce a probabilistic semantics for PBL r . The soundness and finite model property of PBL r are proved, which ensure the weak completeness and decidability of PBL r . 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
A Probabilistic Approach to Feature Selection for Multi-class Text Categorization
Authors: Ke Wu, Bao-Liang Lu, Masao Uchiyama, Hitoshi Isahara
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, we propose a probabilistic approach to feature selection for multi-class text categorization. Specifically, we regard document class and occurrence of each feature as events, calculate the probability of occurrence of each feature by the theorem on the total probability and utilize the values as a ranking criterion. Experiments on Reuters-2000 collection show that the proposed method can yield better performance than information gain and ¿-square, which are two well-known feature selection methods.
Induction of Fuzzy and Annotated Logic Programs
Authors: Tomáš Horváth, Peter Vojtáš
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

The new direction of the research in the field of data mining is the development of methods to handle imperfection (uncertainty, vagueness, imprecision,...). The main interest in this research is focused on probability models. Besides these there is an extensive study of the phenomena of imperfection in fuzzy logic. In this paper we concentrate especially on fuzzy logic programs (FLP) and Generalized Annotated Programs (GAP). The lack of the present research in the field of fuzzy inductive logic programming (FILP) is that every approach has its own formulation of the proof-theoretic part (often dealing with linguistic hedges) and lack sound and compete formulation of semantics. Our aim in this paper is to propose a formal model of FILP and induction of GAP programs (IGAP) based on sound and complete model of FLP (without linguistic hedges) and its equivalence with GAP. We focus on learning from entailment setting in this paper. We describe our approach to IGAP and show its consistency and equivalence to FILP. Our inductive method is used for detection of user preferences in a web search application. Finally, we compare our approach to several fuzzy ILP approaches.
On (s, t)-Supereulerian Locally Connected Graphs
Authors: Lan Lei, Xiao-Min Li, Bin Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

For two integers s ¿ 0,t ¿ 0, a graph G is (s, t)-supereulerian, if ¿ X,Y ¿ E(G), with X ¿ Y = ¿ ,|X| ≤ s,|Y| ≤ t, G has a spanning eulerian subgraph H with X ¿ E(H) and Y ¿ E(H) = ¿. We prove that if G is (t + 2)-edge-connected and locally connected, then G is (2, t)-supereulerian, or G belongs to a well characterized class of graphs.
Discovery, Verification and Conformance of Workflows with Cancellation
Authors: W. M. Aalst
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Petri nets are frequently used for the modeling and analysis of workflows. Their graphical nature, well-defined semantics, and analysis techniques are attractive as information systems become more "process-aware". Unfortunately, the classical Petri net has problems modeling cancellation in a succinct and direct manner. Modeling cancellation regions in a classical net is impossible or results in a "spaghetti-like" net. Cancellation regions are supported by many workflow management systems, but these systems do not support advanced analysis techniques (process mining, verification, performance analysis, etc.). This paper proposes to use reset workflow nets (RWF-nets) and discusses (1) the discovery of RWF-nets (i.e., extracting information from event logs to construct such models), (2) the verification of RWF-nets (i.e., checking whether a workflow process has deadlocks, livelocks, etc.), and (3) the conformance of an event log with respect to a RWF-net (i.e., comparing real with modeled behavior).
A Comparison of Genetic Algorithms for Optimizing Linguistically Informed IR in Question Answering
Authors: Jörg Tiedemann
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper we compare four selection strategies in evolutionary optimization of information retrieval (IR) in a question answering setting. The IR index has been augmented by linguistic features to improve the retrieval performance of potential answer passages using queries generated from natural language questions. We use a genetic algorithm to optimize the selection of features and their weights when querying the IR database. With our experiments, we can show that the genetic algorithm applied is robust to strategy changes used for selecting individuals. All experiments yield query settings with improved retrieval performance when applied to unseen data. However, we can observe significant runtime differences when applying the various selection approaches which should be considered when choosing one of these approaches.
An Empirical Study of Process and Product Metrics Based on In-process Measurements of a Standardized Requirements Definition Phase
Authors: Yoshiki Mitani, Tomoko Matsumura, Mike Barker, Seishiro Tsuruho, Katsuro Inoue, Ken-Ichi Matsumoto
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

This paper focuses on in-process project measurement in the requirements definition phase based on progress with standardization of this phase. The authors have verified the utility of in-process project measurement in a real mid-scale multi-vendor distributed project. This trial was successful, but limited to a part of the total development process. The project measurement target was limited to later processes such as the coding and testing phases where the output products were easy to acquire. The requirements definition phase where process and product were not standardized was difficult to measure. However, a newly provided governmental process guideline standardizes the process and product for the requirements definition phase, and the authors had an opportunity to measure such a requirements definition effort. This paper presents an empirical study of in-process project measurement in the standardized requirements definition phase, verifies the usefulness of this measurement for project management, and reveals the possibility of creating a new software metrics field using these measurements.
A Semantic Framework for Spatiotemporal Data Representation
Authors: Peiquan Jin, Shouhong Wan, Lihua Yue
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Spatiotemporal databases have received much attention since more and more applications, such as environment management and land management, have shown urgent requirements on the management of spatiotemporal information. But different applications have different requirements on describing spatiotemporal objects and spatiotemporal changes, and there is no systematic foundation for the modeling of spatiotemporal data. In this paper, we first study the characteristics of spatiotemporal changes. And then we build a semantic framework for the representation of spatiotemporal data. Spatiotemporal changes are classified into six types. We use three elements to represent these spatiotemporal changes, which are called lifecycle, descriptor and transformation. Through the three elements, a fundamental framework to model spatiotemporal data is achieved.
The method of correction for industrial digital radiographic testing system
Authors: Yaoyu Cheng, Yan Hu, Yu Wang, Yanhua Liu
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

A new type industrial digital radiographic imaging system of high performance developed by author is introduced, the influence factors for the imaging quality are analyzed detailedly, including ray source, ray conversion screen, lens, scientific grade CCD camera, the correction method of nonuniformity for total testing system is studied, and the methods of reducing circuit random noise and the noise produced by scatter ray are illuminated. The correction image and the one that don't be corrected are given, the merits of this system and problem need to be more studied are illuminated.
On the MIR Closure of Polyhedra
Authors: Sanjeeb Dash, Oktay Günlük, Andrea Lodi
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We study the mixed-integer rounding (MIR) closure of polyhedra. The MIR closure of a polyhedron is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objective using additional variables to produce a linear MIP model that solves the separation problem approximately, with an accuracy that depends on the number of additional variables used. Our analysis yields a short proof of the result of Cook, Kannan and Schrijver (1990) that the split closure of a polyhedron is again a polyhedron. We also present some computational results with our approximate separation model.
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
Authors: Detlef Kähler, Thomas Wilke
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We present a uniform framework for (1) complementing Büchi automata, (2) turning Büchi automata into equivalent unambiguous Büchi automata, and (3) turning Büchi automata into equivalent deterministic automata. We present the first solution to (2) which does not make use of McNaughton's theorem (determinization) and an intuitive and conceptually simple solution to (3).Our results are based on Muller and Schupp's procedure for turning alternating tree automata into non-deterministic ones.
The human thalamus is crucially involved in executive control operations
Authors: Frank Marzinzik, Michael Wahl, Gerd-Helge Schneider, Andreas Kupsch, Gabriel Curio, Fabian Klostermann
Venue: Journal of Cognitive Neuroscience (2008)

The processing of executive control is thought to involve cortical as well as thalamic brain areas. However, the questions of how thalamic structures contribute to the control of behavior and how cortical versus thalamic processing is coordinated remain to be settled. We therefore aimed at specifying respective activations during the performance of a go/no-go task. To this end, an electroencephalogram was recorded simultaneously from scalp and thalamic electrodes in seven patients undergoing deep brain stimulation. Meanwhile, left-or right-directed precues were presented indicating with which index finger a button press should be putatively executed. Thereafter, 2 sec elapsed until a go or no-go stimulus determined if the prepared movement had to be performed or withheld. In fronto-central scalp as well as in thalamic recordings, event-related potentials upon go versus no-go instructions were expressed differentially. This task effect was unrelated to motor processes and emerged significantly prior at thalamic than at scalp level. Amplitude fluctuations of depth and scalp responses showed site-and task-dependent correlations, particularly between thalamic and no-go-related activities at frontal recording sites. We conclude that an early classification of go and no-go instructions is performed already thalamically. It further appears that this information is subsequently utilized by cortical areas engaged in the definite inhibition of the prepared action.
A Computational Model of Bistable Perception- Attention Dynamics with Long Range Correlations
Authors: Norbert Fürstenau
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Simulation results of bistable perception due to ambiguous visual stimuli are presented which are obtained with a nonlinear dynamics model using perception---attention---memory coupling. Percept reversals are induced by attention fatigue and noise, with an attention bias which balances the relative percept duration. The dynamics of the attention parameter exhibits qualitative agreement with the eye blink rate variation [4]. Coupling of an attention bias to the perception state introduces memory effects leading to significant long range correlations of perceptual duration times as quantified by the Hurst parameter (H > 0.5). This prediction is in agreement with recent experimental results [1]. Deviations of the reversal time statistics from the Γ-distribution increase with decreasing memory time constant and attention noise. Mean perceptual duration times of 2 --- 5 s are predicted in agreement with experimental results [7] if a feedback delay of ca. 40 ms is assumed which is typical for cortical reentrant loops.
ANP application for evaluating Turkish mobile communication operators
Authors: Onur Kemal Tosun, Anıl Gungor, Y. Ilker Topcu
Venue: Journal of Global Optimization (2008)

The proposed decision model, based on Analytic Network Process (ANP), has been developed in order to determine the dynamics of the Global System for Mobile Communications (GSM) market. In accordance with the sequence of ANP, first of all, the problem was structured and modeled. At the next step, a quantitative analysis was conducted with the customers in order to assess the importance of the related factors and forecast the market shares of the Turkish mobile communication operators. The forecasted market share values were compared with actual ones for the validation of the decision model. The assessed importance of the factors in a valid model would be a potential competitive advantage for the mobile operators.
Quantitative Revision of Scientific Models
Authors: Kazumi Saito, Pat Langley
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

Research on the computational discovery of numeric equations has focused on constructing laws from scratch, whereas work on theory revision has emphasized qualitative knowledge. In this chapter, we describe an approach to improving scientific models that are cast as sets of equations. We review one such model for aspects of the Earth ecosystem, then recount its application to revising parameter values, intrinsic properties, and functional forms, in each case achieving reduction in error on Earth science data while retaining the communicability of the original model. After this, we consider earlier work on computational scientific discovery and theory revision, then close with suggestions for future research on this topic.
On the Classification of 4 Bit S-Boxes
Authors: G. Leander, A. Poschmann
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

In this paper we classify all optimal 4 bit S-boxes. Remarkably, up to affine equivalence, there are only 16 different optimal S-boxes. This observation can be used to efficiently generate optimal S-boxes fulfilling additional criteria. One result is that an S-box which is optimal against differential and linear attacks is always optimal with respect to algebraic attacks as well. We also classify all optimal S-boxes up to the so called CCZ equivalence. We furthermore generated all S-boxes fulfilling the conditions on nonlinearity and uniformity for S-boxes used in the block cipher Serpent. Up to a slightly modified notion of equivalence, there are only 14 different S-boxes. Due to this small number it is not surprising that some of the S-boxes of the Serpent cipher are linear equivalent. Another advantage of our characterization is that it eases the highly non-trivial task of choosing good S-boxes for hardware dedicated ciphers a lot.
SINAI System: Combining IR Systems at ImageCLEFPhoto 2007
Authors: M. Á. García-Cumbreras, M. C. Díaz-Galiano, M. T. Martín-Valdivia, A. Montejo-Ráez, L. A. Ureña-López
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper describes the SINAI team participation in the ImageCLEFPhoto 2007 campaign. This year we have developed a system that combines the document lists retrieved by two Information Retrieval systems (Lemur and JIRS). Online machine translators have been used for the bilingual experiments. The results obtained show that if we only use title text our system works bad. Because of the low MAP values fusion method does not improve the results.
Protection of database security via collaborative inference detection
Authors: Wesley W. Chu
Venue:  (2007)

Malicious users can infer sensitive information from a series of seemingly innocuous data access. To protect the sensitive data content, we proposed a probabilistic inference approach to treat the query-time inference detection problem. Based on data dependency, database schema and semantic knowledge, we construct a semantic inference model (SIM) that represents the possible inference channels from any attribute to the pre-assigned security attributes. To reduce inference computation complexity, the instantiated SIM can he mapped into a Bayesian network. Thus, we can use available Bayesian network tools (e.g. Samlam) to evaluate the inference probability along the inference channels. For a single user, when the user poses a query, the detection system will examine his/her past query log and calculate the probability of inferring the security information. The query request will be denied if the inference probability exceeds the pre-specified threshold. For multi-user, the users may collaborate with their query answers to increase the probability of inferring sensitive information. Therefore, we develop a model to evaluate collaborative inference based on the query sequences of collaborators and their task-sensitive collaboration levels. Experimental studies reveal that information authoritativeness, communication fidelity and honesty in collaboration are three key factors that affect the level of collaboration effectiveness. Sensitivity analysis of attributes in the Bayesian network can be used to study the sensitivity of the inference channels. Our study reveals that the nodes closer to the security node have stronger inference effect on the security node. Thus sensitivity analysis of these close nodes can assist domain experts to specify the threshold of the security node to ensure its robustness. In summary, we develop a technique that prevents users from inferring sensitive information from a series of seemingly innocuous queries. The contribution of this research consists of (1) Derive probabilistic data dependency, relational database schema and domain-specific semantic knowledge and represent them as probabilistic inference channels in a Semantic Inference Model. (2) Map the instantiated Semantic Inference Model into a Bayesian network for efficient and scalable inference computation. (3) Propose an inference detection framework for multiple collaborative users and study the collaboration level between collaborators.