pinecone/core-2020-05-10-deduplication huggingface dataset:
Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials

International audienceTen years ago, Ko et al. described a Diffie-Hellman like protocol based on decomposition with respect to a non-commutative semigroup law. Instantiation with braid groups had first been considered, however intense research on braid groups revealed vulnerabilities of the group structure and of the braid based DH problem itself.Recently, Boucher et al. proposed a similar scheme based on a particular non-commutative multiplication of polynomials over a finite field. These so called skew polynomials have a well-studied theory and have many applications in mathematics and coding theory, however they are quite unknown in a cryptographic application.In this paper, we show that the Diffie-Hellman problem based on skew polynomials is susceptible to a very efficient attack. This attack is in fact general in nature, it uses the availability of a one-sided notion of gcd and exact division. Given such tools, one can shift the Diffie-Hellman probllem to a linear algebra type problem
Astrophysical Probes of Fundamental Physics

The dramatic confrontation between new observations and theories of the early
and recent universe makes cosmology one of the most rapidly advancing fields in
the physical sciences. The universe is a unique laboratory in which to probe
fundamental physics, the rationale being to start from fundamental physics
inspired models and explore their consequences in sufficient quantitative
detail to be able to identify key astrophysical and cosmological tests of the
underlying theory (or developing new tests when appropriate). An unprecedented
number of such tests will be possible in the coming years, by exploiting the
ever improving observational data. In this spirit I will highlight some open
issues in cosmology and particle physics and provide some motivation for this
symposium.Comment: To appear in the proceedings of the JENAM 2010 Symposium 1, From
  Varying Couplings to Fundamental Physics (September 2010). Also summarizes
  the content of a review talk given at IAP workshop on varying constants
  (November 2010), and of seminars given in Cambridge and Garchin
Robust limit on a varying proton-to-electron mass ratio from a single H2
  system

The variation of the dimensionless fundamental physical constant mu=m_p/m_e
can be checked through observation of Lyman and Werner lines of molecular
hydrogen in the spectra of distant QSOs. Our intention is to asses the accuracy
of the investigation concerning a possible variation of mu and to provide more
robust results for QSO 0347-383. The goal in mind is to resolve the current
controversy on variation of mu and devise explanations for the different
findings. We achieve this not by another single result but by providing
alternative approaches to the problem. An analysis based on independent data
sets of QSO 0347-383 is put forward and new approaches for some of the steps
involved in the data analysis are introduced. We analyse two independent sets
of observations of the same absorption system and for the first time we apply
corrections for the observed offsets between discrete spectra Drawing on two
independent observations of a single absorption system in QSO 0347-383 our
detailed analysis yields dmu/mu = 15 +/- (9_stat + 6_sys) x 10^{-6} at
z_abs=3.025. Based on the overall goodness-of-fit we estimate the limit of
accuracy to about 300 m/s, consisting of roughly 180 m/s due to the uncertainty
of the fit and about 120 m/s allocated to systematics This work presents
alternative approaches to handle systematics and introduces methods required
for precision analysis of QSO spectra available in the near future.Comment: 9 pages, 10 figures, submitted to A&
Cosmological Birefringence: an Astrophysical test of Fundamental Physics

We review the methods used to test for the existence of cosmological
birefringence, i.e. a rotation of the plane of linear polarization for
electromagnetic radiation traveling over cosmological distances, which might
arise in a number of important contexts involving the violation of fundamental
physical principles. The main methods use: (1) the radio polarization of radio
galaxies and quasars, (2) the ultraviolet polarization of radio galaxies, and
(3) the cosmic microwave background polarization. We discuss the main results
obtained so far, the advantages and disadvantages of each method, and future
prospects.Comment: To appear in the Proceedings of the JENAM 2010 Symposium "From
  Varying Couplings to Fundamental Physics", held in Lisbon, 6-10 Sept. 201
Atomic transition frequencies, isotope shifts, and sensitivity to
  variation of the fine structure constant for studies of quasar absorption
  spectra

Theories unifying gravity with other interactions suggest spatial and
temporal variation of fundamental "constants" in the Universe. A change in the
fine structure constant, alpha, could be detected via shifts in the frequencies
of atomic transitions in quasar absorption systems. Recent studies using 140
absorption systems from the Keck telescope and 153 from the Very Large
Telescope, suggest that alpha varies spatially. That is, in one direction on
the sky alpha seems to have been smaller at the time of absorption, while in
the opposite direction it seems to have been larger.
  To continue this study we need accurate laboratory measurements of atomic
transition frequencies. The aim of this paper is to provide a compilation of
transitions of importance to the search for alpha variation. They are E1
transitions to the ground state in several different atoms and ions, with
wavelengths ranging from around 900 - 6000 A, and require an accuracy of better
than 10^{-4} A. We discuss isotope shift measurements that are needed in order
to resolve systematic effects in the study. The coefficients of sensitivity to
alpha-variation (q) are also presented.Comment: Includes updated version of the "alpha line" lis
A Quantitative Evaluation of Global Word Sense Induction

International audienceWord sense induction (WSI) is the task aimed at automatically identifying the senses of words in texts, without the need for handcrafted resources or annotated data. Up till now, most WSI algorithms extract the different senses of a word 'locally' on a per-word basis, i.e. the different senses for each word are determined separately. In this paper, we compare the performance of such algorithms to an algorithm that uses a 'global' approach, i.e. the different senses of a particular word are determined by comparing them to, and demarcating them from, the senses of other words in a full-blown word space model. We adopt the evaluation framework proposed in the SemEval-2010 Word Sense Induction \& Disambiguation task. All systems that participated in this task use a local scheme for determining the different senses of a word. We compare their results to the ones obtained by the global approach, and discuss the advantages and weaknesses of both approaches
A posteriori agreement as a quality measure for readability prediction systems

All readability research is ultimately concerned with the research question whether it is possible for a prediction system to automatically determine the level of readability of an unseen text. A significant problem for such a system is that readability might depend in part on the reader. If different readers assess the readability of texts in fundamentally different ways, there is insufficient a priori agreement to justify the correctness of a readability prediction system based on the texts assessed by those readers. We built a data set of readability assessments by expert readers. We clustered the experts into groups with greater a priori agreement and then measured for each group whether classifiers trained only on data from this group exhibited a classification bias. As this was found to be the case, the classification mechanism cannot be unproblematically generalized to a different user group
Towards lifelong navigation and mapping in an office environment

This paper addresses the challenge of developing robots that map and navigate autonomously in real world, dynamic environments throughout the robot’s entire lifetime – the problem of lifelong navigation. Static mapping algorithms can produce highly accurate maps, but have found few applications in real environments that are in constant flux. Environments change in many ways: both rapidly and gradually, transiently and permanently, geometrically and in appearance. This paper demonstrates a biologically inspired navigation algorithm, RatSLAM, that uses principles found in rodent neural circuits. The algorithm is demonstrated in an office delivery challenge where the robot was required to perform mock deliveries to goal locations in two different buildings. The robot successfully completed 1177 out of 1178 navigation trials over 37 hours of around the clock operation spread over 11 days
From plasma to beefarm: Design experience of an FPGA-based multicore prototype

In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation, a popular research topic of the last few years both in the FPGA and the computer architecture communities. We discuss various design tradeoffs and we demonstrate superior scalability through experimental results compared to traditional software instruction set simulators. Based on our experience of designing and building a complete FPGA-based multiprocessor emulation system that supports run-time and compiler infrastructure and on the actual executions of our experiments running Software Transactional Memory (STM) benchmarks, we comment on the pros, cons and future trends of using hardware-based emulation for research.Peer ReviewedPostprint (author's final draft
Performance evaluation in open-set speaker identification

This document is the Accepted Manuscript version of the following paper: Malegaonkar A., Ariyaeeinia A. (2011) Performance Evaluation in Open-Set Speaker Identification. In: Vielhauer C., Dittmann J., Drygajlo A., Juul N.C., Fairhurst M.C. (eds) Biometrics and ID Management. BioID 2011. Lecture Notes in Computer Science, vol 6583. Springer, Berlin, Heidelberg. The Version of Record is available online at doi: https://doi.org/10.1007/978-3-642-19530-3_10. ?? Springer-Verlag Berlin Heidelberg 2011.The concern in this study is the approach to evaluating the performance of the open-set speaker identification process. In essence, such a process involves first identifying the speaker model in the database that best matches the given test utterance, and then determining if the test utterance has actually been produced by the speaker associated with the best-matched model. Whilst, conventionally, the performance of each of these two sub-processes is evaluated independently, it is argued that the use of a measure of performance for the complete process can provide a more useful basis for comparing the effectiveness of different systems. Based on this argument, an approach to assessing the performance of open-set speaker identification is considered in this paper, which is in principle similar to the method used for computing the diarisation error rate. The paper details the above approach for assessing the performance of open-set speaker identification and presents an analysis of its characteristics
On Using High-Definition Body Worn Cameras for Face Recognition from a Distance

Recognition of human faces from a distance is highly desirable for law-enforcement. This paper evaluates the use of low-cost, high-definition (HD) body worn video cameras for face recognition from a distance. A comparison of HD vs. Standard-definition (SD) video for face recognition from a distance is presented. HD and SD videos of 20 subjects were acquired in different conditions and at varying distances. The evaluation uses three benchmark algorithms: Eigenfaces, Fisherfaces and Wavelet Transforms. The study indicates when gallery and probe images consist of faces captured from a distance, HD video result in better recognition accuracy, compared to SD video. This scenario resembles real-life conditions of video surveillance and law-enforcement activities. However, at a close range, face data obtained from SD video result in similar, if not better recognition accuracy than using HD face data of the same range
Hill-climbing attack based on the uphill simplex algorithm and its application to signature verification

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-19530-3_8Proceedings of COST 2101 European Workshop (BioID) held in Brandenburg (Germany) on 2011A general hill-climbing attack to biometric systems based on a modification of the downhill simplex algorithm is presented. The scores provided by the matcher are used in this approach to adapt iteratively an initial estimate of the attacked template to the specificities of the client being attacked. The proposed attack is evaluated on a competitive feature-based signature verification system over both the MCYT and the BiosecurID databases (comprising 330 and 400 users, respectively). The results show a very high efficiency of the hill-climbing algorithm, which successfully bypassed the system for over 90% of the attacks with a remarkably low number of scores needed.This work has been partially supported by projects Contexts (S2009/TIC-1485) from CAM, Bio-Challenge (TEC2009-11186) from Spanish MICINN, TABULA RASA (FP7-ICT-257289) from EU, and Cátedra UAM-Telefónica
Optimal controller gain tuning for robust stability of spacecraft formation

The spacecraft formation control problem sets high demands to the performance, especially with respect to positional accuracy. The problem is further complicated due to scarce fuel resources and limited actuation effects, in addition to the many sources of disturbances. This paper addresses the problem of finding the optimal gains of spacecraft formation controllers. By optimal, we mean the gains that minimizes a cost functional which penalizes both the control efforts and the state deviation, while still guaranteeing stability of the closed-loop systems in the presence of disturbances
Tight bounds for classical and quantum coin flipping

Coin flipping is a cryptographic primitive for which strictly better
protocols exist if the players are not only allowed to exchange classical, but
also quantum messages. During the past few years, several results have appeared
which give a tight bound on the range of implementable unconditionally secure
coin flips, both in the classical as well as in the quantum setting and for
both weak as well as strong coin flipping. But the picture is still incomplete:
in the quantum setting, all results consider only protocols with perfect
correctness, and in the classical setting tight bounds for strong coin flipping
are still missing. We give a general definition of coin flipping which unifies
the notion of strong and weak coin flipping (it contains both of them as
special cases) and allows the honest players to abort with a certain
probability. We give tight bounds on the achievable range of parameters both in
the classical and in the quantum setting.Comment: 18 pages, 2 figures; v2: published versio
A zero knowledge identification scheme based on the q-ary SD problem

International audienceAt CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography
Simplified computation and generalization of the refined process structure tree

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs
Automatic Wrapper Adaptation by Tree Edit Distance Matching

Information distributed through the Web keeps growing faster day by day, and
for this reason, several techniques for extracting Web data have been suggested
during last years. Often, extraction tasks are performed through so called
wrappers, procedures extracting information from Web pages, e.g. implementing
logic-based techniques. Many fields of application today require a strong
degree of robustness of wrappers, in order not to compromise assets of
information or reliability of data extracted. Unfortunately, wrappers may fail
in the task of extracting data from a Web page, if its structure changes,
sometimes even slightly, thus requiring the exploiting of new techniques to be
automatically held so as to adapt the wrapper to the new structure of the page,
in case of failure. In this work we present a novel approach of automatic
wrapper adaptation based on the measurement of similarity of trees through
improved tree edit distance matching techniques.Comment: 7 pages, 3 figures, In Proceedings of the 2nd International Workshop
  on Combinations of Intelligent Methods and Applications (CIMA 2010
Shopping center tracking and recommendation systems

Anacleto R., Luz N., Almeida A., Figueiredo L., Novais P., Shopping Center Tracking and Recommendation Systems, in Soft Computing Models in Industrial and Environmental Applications, 6th International Conference SOCO 2011, Corchado E.; Snasel V., Sedano J., Hassanien A.E.; Calvo J.L., Slezak D. (Eds.), Springer - Series Advances in Intelligent and Soft Computing, vol. 87, ISBN 978-3-642-19643-0, pp 299-308, 2011.Shopping centers present a rich and heterogeneous environment, where IT systems can be implemented in order to support the needs of its actors. However, due to the environment complexity, several feasibility issues emerge when designing both the logical and physical architecture of such systems. Additionally, the system must be able to cope with the individual needs of each actor, and provide services that are easily adopted by them, taking into account several sociological and economical aspects. In this sense, we present an overview of current support systems for shopping center environments. From this overview, a high-level model of the domain (involving actors and services) is described along with challenges and possible features in the context of current Semantic Web, mobile device and sensor technologies
Role playing games and emotions in dispute resolution environments

Electronic contracting, mostly through software agents, led to an impressive growth in electronic transactions, but also in the number of disputes arising out of these transactions. Paper-based courts are however unable to efficiently deal with this increase in disputes. On the other hand, current Online Dispute Resolution methodologies are impersonal and cold, leaving aside important information such as the disputants’ body language and emotions. In that sense, in this paper we propose the creation of environments for dispute resolution that can complement the existing tools with important context information. This, we believe, will lead to dispute resolution tools that will more efficiently achieve mutually satisfactory outcomes.The work described in this paper is included in TIARAC - Telematics and Artificial Intelligence in Alternative Conflict Resolution Project (PTDC/JUR/71354/2006), which is a research project supported by FCT (Science & Technology Foundation), Portugal
Soft Computing Models for the Development of Commercial Conversational Agents

Proceedings of: 6th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2011). Salamanca, April 6-8, 2011In this paper we present a proposal for the development of conversational agents that, on the one hand, takes into account the benefits of using standards like VoiceXML, whilst on the other, includes a module with a soft computing model that avoids the effort of manually defining the dialog strategy. This module is trained using a labeled dialog corpus, and selects the next system response considering a classification process based on neural networks that takes into account the dialog history. Thus, system developers only need to define a set of VoiceXML files, each including a system prompt and the associated grammar to recognize the users responses to the prompt. We have applied this technique to develop a conversational agent in VoiceXML that provides railway information in Spanish.Funded by projects CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-
02/TEC, CAM CONTEXTS (S2009/TIC-1485), and DPS2008-07029-C02-02.Publicad
Regulatory Model for AAL

Proceedings of: 6th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2011). Salamanca, April 6-8, 2011Abstract: In this work, authors define a set of principles that should be contained in context-aware applications (including biometric sensors) to accomplish the legal aspect in Europe and USA. Paper presents the necessity to consider legal aspect, related with pri-vacy or human rights, into the development of the incipient context based services. Clearly, context based services and Ambient Intelligence (and the most promising work area in Europe that is Ambient Assisted Living, ALL) needs a great effort in research new identification procedures.Publicad
Credit scoring data for information asset analysis

Risk assessment is an important topic for financial institution nowadays, especially in the context of loan applications. Some of these institutions have already implemented their own credit scoring mechanisms to evaluate their clients’ risk and decide based in this indicator. In fact, the information gathered by financial institutions constitutes a valuable source of data for the creation of information assets from which credit scoring mechanisms can be developed. The purpose of this paper is to, from information assets, create a decision mechanism that is able to evaluate a client’s risk. Furthermore, upon this decision mechanism, a suggestive algorithm is presented to better explain and give insights on how the decision mechanism values attributes.The work described in this paper is part of TIARAC -Telematics and Artificial Intelligence in Alternative Conflict Resolution Project (PTDC/JUR/71354/2006), research project supported by FCT (Science & Technology Foundation), Portuga