ppxscal/embedding_network huggingface dataset:
Real Algebraic Numbers: Complexity Analysis and Experimentation
Authors: Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size ≤ ¿, using Sturm (-Habicht) sequences and the Bernstein subdivision solver. In particular, we unify and simplify the analysis of both methods and we give an asymptotic complexity bound of $\mathcal{\tilde O}_B(d^4 \tau^2)$. This matches the best known bounds for binary subdivision solvers. Moreover, we generalize this to cover the non square-free polynomials and show that within the same complexity we can also compute the multiplicities of the roots. We also consider algorithms for sign evaluation, comparison of real algebraic numbers and simultaneous inequalities, and we improve the known bounds at least by a factor of d.Finally, we present our C++ implementation in synaps and some preliminary experiments on various data sets.
An application of singularity theory to robust geometric calculation of interactions among dynamically deforming geometric objects
Authors: Xianming Chen
Venue:  (2008)

This dissertation presents a general mathematical framework for geometric inquiries and geometric operations on dynamically deforming models, performing the efficient and robust computation of these events: (1) Evolution of an existing solution to a nearby one under small perturbation; (2) Detection of transition events; (3) Identification of the set of transition points where a structural change of solutions, i.e., a transition event, occurs; (4) Classification of transition type such as creation, annihilation etc.; (5) Computation of the actual geometry that realizes the structural change of a detected and classified transition event. The general mathematical framework starts with formulating the problem in a solution space that is the product of the parametric space in which curves or surfaces are defined and the control space in which deformation is defined. The entire solution is encoded as a manifold in this solution space. Then, independent tangent vector fields are constructed on this solution manifold, and are used to define the differential of the projection map from the solution manifold to the control space. If this projection map is locally nonsingular, it can be used to associate the perturbation in the control space to the incremental change in the solution space that is required to evolve the existing solution to the nearby one under the specific perturbation. On the other hand, at a critical point of the projection map, a Morse function is constructed and its Hessian function is computed from covariant derivatives of the tangent vector fields. Consequently, the transition event, i.e., the structural change between nearby solutions, is computed by the local shape approximation to the manifold at the critical point. This dissertation also significantly advances the state-of-the-art regarding efficient symbolic computation on B-spline curves, which is one of the most fundamental operations in geometric modeling and is also essential to an efficient and robust tracking of point-curve distances. 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
Some Novel Results of p-Adic Component of Primitive Sequences over Z/(pd)
Authors: Yuewen Tang, Dongyang Long
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Some novel results of the p-adic components of primitive sequences over ring Z mod p d (Z/(p d )) are given. An improving result of Dai Zongdao formula is presented. Moreover, we characterize the minimal polynomials and trace expressions for 0, 1 level components of primitive sequences over Z/(p d ) for any prime number p.
Smoothening the integrands to increase the quality of fluctuationlessness approximation in numerical integration
Authors: Berfin Kalay, Metin Demiralp
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

Recent years brought a new approach which seems to be quite powerful and utilizable with ease in numerical analysis. It is the fluctuationlessness approximation and, univariate or multivariate, an integral can be approximated through its kernel function's matrix representation by using not it but the image of the matrix representations of the independent variables under that integrand function. Method works well by giving good approximation qualities as long as the integrand behaves sufficiently smooth. Although the method seems to be superior to a lot of existing methods this smoothness related issue stands a problematic agent as in other methods. This work is devoted to the investigation of smoothening possibilities to the integrand.
A Performance Comparison of Three Contemporary 16-bit Microprocessors
Authors: Martin Prycker
Venue: IEEE Micro (1983)

The performance of two addressing mechanisms on three different microprocessors is examined. One of the mechanisms-and one of the micros-provided superior performance. 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
Anticipating Rewards in Continuous Time and Space: A Case Study in Developmental Robotics
Authors: Arnaud J. Blanchard, Lola Cañamero
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

This paper presents the first basic principles, implementation and experimental results of what could be regarded as a new approach to reinforcement learning, where agents--physical robots interacting with objects and other agents in the real world--can learn to anticipate rewards using their sensory inputs. Our approach does not need discretization, notion of events, or classification, and instead of learning rewards for the different possible actions of an agent in all the situations, we propose to make agents learn only the main situations worth avoiding and reaching. However, the main focus of our work is not reinforcement learning as such, but modeling cognitive development on a small autonomous robot interacting with an "adult" caretaker, typically a human, in the real world; the control architecture follows a Perception-Action approach incorporating a basic homeostatic principle. This interaction occurs in very close proximity, uses very coarse and limited sensory-motor capabilities, and affects the "well-being" and affective state of the robot. The type of anticipatory behavior we are concerned with in this context relates to both sensory and reward anticipation. We have applied and tested our model on a real robot.
Results on the Crosscorrelation and Autocorrelation of Sequences
Authors: Faruk Göloğlu, Alexander Pott
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

In this paper we investigate some properties of the crosscorrelation spectrum of an m-sequence a with period 2 m ¿ 1 and a d-decimation b. Recently, Lahtonen et. al. [1] calculated the crosscorrelation value ¿ d (1) for specific exponents (i.e. for Gold and Kasami type). In this paper we generalize this result to all known almost bent exponents. In [1], the authors also prove that Gold functions are bent on some hyperplanes with respect to the base field $\mathbb{F}{2}$. We also generalize this result and show that Gold functions are bent on all hyperplanes with respect to any subfield $\mathbb{F}{2^k}$. We also show that $\Theta_d(1) \ne 0$ for many exponents d, and conclude that many sequences of type a + b (including m-sequences added to an almost bent decimation) do not have perfect autocorrelation.
Fuzzy Information Granulation Based Decision Support Applications
Authors: Jianhong Luo, Dezhao Chen
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Due to the learning problem on skewed distribution datasets, which tend to produce high accuracy over the majority class but poor predictive accuracy over the minority class by traditional machine learning algorithms, fuzzy information granulation based knowledge discovery and decision support model called FIG mode is proposed in this paper to improve classification performance and make effective decision support. It uses an index called “SIG” to select the suitable level of granularity and two membership functions to describe the features of information granules, then knowledge rules abstracted from the information granules are used to predict unknown patterns. The experimental results show that the FIG model can improve classification performance, and the performance indexes, such as G-mean, also show its better performance on skewed datasets than C4.5.
Neuromolecularware --- A Bio-inspired Evolvable Hardware and Its Application to Medical Diagnosis
Authors: Yo-Hsien Lin, Jong-Chen Chen
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Computer systems have powerful computational capability. However, it is brittle in that a slight program modification can inadvertently change the system functions. Biological systems demonstrate better adaptability than computer systems. An evolvable neuromolecular hardware motivated from some biological evidence is proposed. The hardware was further applied to medical diagnosis with a clinical database of premature babies who are given total parental nutrition (TPN). Experimental results show that the neuromolecular hardware was capable of learning to differentiate data in an autonomous manner.
Babbage's Letter to Quetelet, May 1835
Authors: Alfred W. Van Sinderen
Venue: IEEE Annals of the History of Computing (1983)

This article discusses the significance of a letter from Charles Babbage to L. A. J. Quetelet, the Belgian statistician and astronomer, written in the spring of 1835, describing the earliest concept of the Analytical Engine. Quetelet caused the major portion of the letter to be printed, but it has never been fully translated into English. The article includes a modern translation of the full letter and compares it, where appropriate, with the partial translation printed in Taylor's "Scientific Memoirs" in 1843.
Formal reasoning with rough sets in multiple-source approximation systems
Authors: Md. Aquil Khan, Mohua Banerjee
Venue: International Journal of Approximate Reasoning (2008)

We focus on families of Pawlak approximation spaces, called multiple-source approximation systems (MSASs). These reflect the situation where information arrives from multiple sources. The behaviour of rough sets in MSASs is investigated - different notions of lower and upper approximations, and definability of a set in a MSAS are introduced. In this context, a generalized version of an information system, viz. multiple-source knowledge representation (KR)-system, is discussed. Apart from the indiscernibility relation which can be defined on a multiple-source KR-system, two other relations, viz. similarity and inclusion are considered. To facilitate formal reasoning with rough sets in MSASs, a quantified propositional modal logic LMSAS is proposed. Interpretations for sets of well-formed formulae (wffs) of LMSAS are defined on MSASs, and the various properties of rough sets in MSASs translate into logically valid wffs of the system. LMSAS is shown to be sound and complete with respect to this semantics. Some decidable problems are addressed. In particular, it is shown that for any LMSAS-wff @a, it is possible to check whether @a is satisfiable in a certain class of interpretations with MSASs of a given finite cardinality. Moreover, it is also decidable whether any wff @a is satisfiable in the class of all interpretations with MSASs having domain of a given finite cardinality.
Analyzing the Basic Elements of Mobile Viral Marketing-An Empirical Study
Authors: Dietmar G. Wiedemann, Tobias Haunstetter, Key Pousttchi
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

As personal communication tools mobile devices are platforms for word-of-mouth marketing. Given the assigned usefulness of mobile viral marketing, it is surprising to find relatively few studies directed at its basic elements, i.e., mobile viral content and consumers forwarding this content. The paper presents the findings of an online survey conducted to empirically investigate the consumers' intention to participate in different kinds of mobile viral marketing strategies and to identify the characteristics of mobile viral mavens in terms of their forwarding behaviour.
Qrtzgeotherm: An ActiveX component for the quartz solubility geothermometer
Authors: Mahendra P. Verma
Venue: Computers Geosciences (2008)

An ActiveX component, QrtzGeotherm, to calculate temperature and vapor fraction in a geothermal reservoir using quartz solubility geothermometry was written in Visual Basic 6.0. Four quartz solubility equations along the liquid-vapor saturation curve: (i) a quadratic equation of 1/T and pressure, (ii) a linear equation relating logSiO"2 to the inverse of absolute temperature (T), (iii) a polynomial of T including logarithmic terms and (iv) temperature as a polynomial of SiO"2 including logarithmic terms are programmed. The QrtzGeotherm has input parameters: (i) HRes-the reservoir enthalpy (kJ/kg), (ii) SiO2TD-silica concentration in total discharge (ppm), (iii) GeoEq-number of quartz solubility equation and (iv) TempGuess-a guess value of the reservoir temperature (^oC). The reservoir enthalpy H"r"e"s is assumed to be the same as the total discharge enthalpy H"R. The output parameters are (i) TempRes-reservoir temperature (^oC) and (ii) VapRes-reservoir vapor fraction. The first step is to calculate the total discharge concentration of silica SiO2TD from the concentration of silica SiO2Col of separated water, sampled after N-separations of vapor and water. To use QrtzGeotherm in MS-Excel, three functions SiO2TD, GeoResTemp and GeoResVap for an N-stage separation of geothermal reservoir fluid are written in Visual Basic for Application (VBA). Similarly, a demonstration program, QrtzGeothrm, is written in Visual Basic 6.0.
On the Security of Some Password Authentication Protocols
Authors: Bin-Tsan Hsieh, Hung-Min Sun, Tzonelih Hwang
Venue: Informatica (2003)

In an internet environment, such as UNIX, a remote user has to obtain the access right from a server before doing any job. The procedure of obtaining acess right is called a user authentication protocol. User authentication via user memorable password provides convenience without needing any auxiliary devices, such as smart card. A user authentication protocol via username and password should basically withstand the off-line password guessing attack, the stolen verifier attack, and the DoS attack. Recently, Peyravian and Zunic proposed one password transmission protocol and one password change protocol. Later, Tseng et al. (2001) pointed out that Peyravian and Zunic's protocols can not withstand the off-line password guessing attack, and therefore proposed an improved protocol to defeat the attack. Independently, Hwang and Yeh also showed that Peyravian and Zunic's protocols suffer from some secury flaws, and an improved protocol was also presented. In this paper, we show that both Peyravian and Zunic's protocols and Tseng et al.'s improved protocol are insecure against the stolen verifier attack. Moreover, we show that all Peyravian and Zunic's, Tseng et al.'s, and Hwang and Yeh's protocols are insecure against DoS attack.
A Design Pattern for Component Oriented Development of Agent Based Multithreaded Applications
Authors: A. L. Rodríguez, P. E. López-De-Teruel, A. Ruiz, G. García-Mateos, L. Fernóndez
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

We present a design pattern which allows for easy multithreaded application development, without requiring parallel programming expertise from potential users. The pattern encourages reusability considering threads as truly independent software components, or agents, while hiding the low level details about safe data sharing and synchronization. Though coarse grained, the solution is perfectly compatible with other more specific multithreading techniques, which could be used in more computationally intensive agents. The approach is based on the classical pipeline pattern, but includes also asynchronous communications and event driven responses, and implements an efficient distributed synchronization and data sharing technique, which minimizes overhead. These features make the pattern specially adequate for real time applications that possibly need to be monitored by an interactive GUI, such as computer vision or signal processing applications, among others.
An Automated Finite Polygon Division Method for 3-D Objects
Authors: Yoshimi Ota, Hiroshi Arai, Shinji Tokumasu, Toshio Ochi
Venue: IEEE Computer Graphics and Applications (1985)

The automatic generation of color-shading data for CAD/CAM objects can produce mass-property calculations in less time with fewer errors.
Hybrid-Mode Floating-Point FPGA CORDIC Co-processor
Authors: Jie Zhou, Yong Dou, Yuanwu Lei, Yazhuo Dong
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

This paper presents a 32-bit floating-point CORDIC co- processor on FPGA, providing all known CORDIC functions. Firstly, we propose a hybrid-mode algorithm, combining hybrid rotation angle methods with argument reduction algorithm to reduce hardware area usage and meanwhile keep unlimited convergence domain for any floating-point inputs. And according to algorithm, the hybrid-mode CORDIC co-processor is organized into three phases, argument reduction, CORDIC calculation and normalization with 34 pipeline stages for FPGA implementation. The synthesis results show the clock frequency can reach 217MHz on Xilinx Virtex5 FPGA. Comparing to general-purpose microprocessor in three scientific program kernels, the CORDIC co-processor can guarantee at least 23-bit precision and achieve a maximum speedup of 47.6 times, 35.2 times in average.
Region-Based Wavelet-Packet Adaptive Algorithm for Sparse Response Identification
Authors: Odair A. Noskoski, José C. Bermudez
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This paper proposes a new wavelet-packet-based algorithm for sparse response identification. The distinctive features of the new algorithm are a region-based strategy for adaptive weight activation and a new deactivation/activation schedule across the transform scales. The new algorithm shows improved performance when compared to existing wavelet-based algorithms with similar characteristics. The new strategies lead to a faster wavelet-packet transform construction and to improved robustness to design parameters when compared to previous solutions. Monte Carlo simulation results show good performances regarding convergence speed and robustness to design parameter choice.
A statistical relational model for trust learning
Authors: Achim Rettinger, Matthias Nickles, Volker Tresp
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several relations that exist between the agent to be trusted (trustee) and the state of the environment. Besides attributes expressing trustworthiness, additional relations might describe commitments made by the trustee with regard to the current situation, like: a seller offers a certain price for a specific product. We show how to implement and learn contextsensitive trust using statistical relational learning in form of the Infinite Hidden Relational Trust Model (IHRTM). The practicability and effectiveness of our approach is evaluated empirically on user-ratings gathered from eBay. Our results suggest that (i) the inherent clustering achieved in the algorithm allows the truster to characterize the structure of a trust-situation and provides meaningful trust assessments; (ii) utilizing the collaborative filtering effect associated with relational data does improve trust assessment performance; (iii) by learning faster and transferring knowledge more effectively we improve cold start performance and can cope better with dynamic behavior in open multiagent systems. The later is demonstrated with interactions recorded from a strategic two-player negotiation scenario.
How to Use ISO/IEC 24727-3 with Arbitrary Smart Cards
Authors: Detlef Hühnlein, Manuel Bach
Venue: Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business (2007)

The forthcoming ISO/IEC 24727 series of standards defines application programming interfaces for smart cards and is expected to provide a major contribution to the global interoperability of smart cards and card-applications. However it assumes in part 2 [8] that certain information concerning the capabilities of the card and its (cryptographic) applications is stored on the card itself. As already issued smart cards do not provide the required structures, the significance of ISO/IEC 24727 for billions (see [5]) of "legacy cards" seems to be questionable. In order to overcome this problem, the present paper introduces an alternative approach, which does not require any specific information on the card but provides the information which is necessary to map generic requests to card-specific APDUs to the middleware in form of XML-based CardInfo-files.
Kernel Density Estimation Methods for a Geostatistical Approach in Seismic Risk Analysis: The Case Study of Potenza Hilltop Town (Southern Italy)
Authors: Maria Danese, Maurizio Lazzari, Beniamino Murgante
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This paper focuses on an overview of kernel density estimation especially for what concerns the choice of bandwidth and intensity parameters according to local conditions. A case study inherent seismic risk analysis of the old town centre of Potenza hilltop town has been discussed, with particular attention to the evaluation of the possible local amplifying factors. This first integrated application of kernel density maps to analyse seismic damage scenarios with a geostatistical approach allowed to evaluate the local geological, geomorphological and 1857 earthquake macroseismic data, offering a new point of view of civil protection planning. The aim of geostatistical approach is to know seismic risk variability at local level, modelling and visualizing it.