ppxscal/embedding_network huggingface dataset:
Non-interactive Proofs for Integer Multiplication
Authors: Ivan Damgård, Rune Thorbek
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Moreover, at small extra cost and using a distributed verifier proof, it can be shown in zero-knowledge that three shared integers a,b,c satisfy ab = c. This implies by known reductions non-interactive zero-knowledge proofs that a shared integer is in a given interval, or that one secret integer is larger than another. Such primitives are useful, e.g., for supplying inputs to a multiparty computation protocol, such as an auction or an election. The protocols use various set-up assumptions, but do not require the random oracle model.
An Incremental Fuzzy Decision Tree Classification Method for Mining Data Streams
Authors: Tao Wang, Zhoujun Li, Yuejin Yan, Huowang Chen
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

One of most important algorithms for mining data streams is VFDT. It uses Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed. Gama et al. have extended VFDT in two directions. Their system VFDTc can deal with continuous data and use more powerful classification techniques at tree leaves. In this paper, we revisit this problem and implemented a system fVFDT on top of VFDT and VFDTc. We make the following four contributions: 1) we present a threaded binary search trees (TBST) approach for efficiently handling continuous attributes. It builds a threaded binary search tree, and its processing time for values inserting is O(nlogn), while VFDT`s processing time is O(n 2 ). When a new example arrives, VFDTc need update O(logn) attribute tree nodes, but fVFDT just need update one necessary node.2) we improve the method of getting the best split-test point of a given continuous attribute. Comparing to the method used in VFDTc, it improves fromO(nlogn) to O (n) in processing time. 3) Comparing to VFDTc, fVFDT`s candidate split-test number decrease fromO(n) to O(logn).4)Improve the soft discretization method to be used in data streams mining, it overcomes the problem of noise data and improve the classification accuracy.
Optimization of linear objective function under max-product fuzzy relational constraint
Authors: Ketty Peeva, Zlatko Zahariev, Ivajlo Atanasov
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

This paper presents optimization problem with a linear objective function subject to constraint - fuzzy linear system of equations or fuzzy linear system of inequalities, with max-product composition. Methods that provide algorithm for computing the maximum solution and all minimal solutions, when the fuzzy linear system is consistent, are developed for constraint resolution. A software is developed in MATLAB and Java.
Modernization, public innovation and information and communication technologies: The emperor's new clothes?
Authors: Victor Bekkers
Venue: Information Polity (2007)

In this introductory article, innovation is defined as a necessary condition for the modernization of public administration. The nature of innovation and the innovative potential of ICT will be explored. However, it is argued that the up to now this potential has not been fully exploited, due to the one-sidedness or internal orientation of the ICT-driven public innovation agenda.
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
Authors: Nicolas Ollinger
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Thanks to a careful study of elementary properties of two-by-two substitution systems, we give a complete self-contained elementary construction of an aperiodic tile set and sketch how to use this tile set to elementary prove the undecidability of the classical Domino Problem.
Is WiMax's Future Up in the Air?
Authors: Greg Goth
Venue: IEEE Internet Computing (2007)

When the IEEE 802.16 WiMax technology standard emerged from its working group in 2004, it was greeted with great anticipation as a key building block in future network infrastructure.
Efficient AUC Optimization for Classification
Authors: Toon Calders, Szymon Jaroszewicz
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In this paper we show an efficient method for inducing classifiers that directly optimize the area under the ROC curve. Recently, AUC gained importance in the classification community as a mean to compare the performance of classifiers. Because most classification methods do not optimize this measure directly, several classification learning methods are emerging that directly optimize the AUC. These methods, however, require many costly computations of the AUC, and hence, do not scale well to large datasets. In this paper, we develop a method to increase the efficiency of computing AUC based on a polynomial approximation of the AUC. As a proof of concept, the approximation is plugged into the construction of a scalable linear classifier that directly optimizes AUC using a gradient descent method. Experiments on real-life datasets show a high accuracy and efficiency of the polynomial approximation.
Design of a System for Automated Generation of Problem Fields
Authors: Ildikó Pelczer, Fernando Gamboa Rodríguez
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We describe the design of a computer system for problem field generation in mathematics. The concept of problem field refers to a sequence of related problems. The relationship between the problems assures that their successive solution promotes deep learning of the topic (sequence problems). We define four relations between the field's problems: difficulty and rule, question or property preservation. The problem's difficulty is given by problem-type, algebraic complexity and difficulties of the problem's question and rule used for solution. A problem field based on difficulty will modify one of the above elements in order to get new problems from existing ones. In rule- and property-preserving generation the field's problems differ in their type or difficulty level. In question preserving generation the problems maintain the initial problem's unknown. Once the details of the change are established the new problem will be generated using templates, rules and examples.
Global asymptotic stability of a family of difference equations
Authors: Xiaofan Yang, Yuan Yan Tang, Jianqiu Cao
Venue: Computers Mathematics with Applications (2008)

In this paper, we study the difference equation {x"n=[f"1f"2f"3+f"1+f"2+f"3+hf"1f"2+f"1f"3+f"2f"3+g+h](x"n"-"1,...,x"n"-"r),n=1,2,...x"1"-"r,x"2"-"r,...,x"0>0, where f"1,f"2,f"3,g:(R"+)^r->R"+ and h:(R"+)^r->[0,+~) are all continuous functions. We present a sufficient condition for this difference equation to have a globally asymptotically stable equilibrium c=1. This condition generalizes some previous results.
A framework for command processing in Java/Swing programs based on the MVC pattern
Authors: Andreas Naderlinger, Josef Templ
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

We present a framework for command processing in Java/Swing programs based on the model-view-controller (MVC) pattern. In addition to standard approaches our framework supports (1) centralized exception handling, (2) premature command termination, (3) pre- and postprocessing of commands, (4) undo/redo based on event objects and model listeners, and (5) generic undo/redo commands. The framework has been applied successfully in a number of graphical editors as part of a tool chain for real time programming. It proved to increase the quality of the software by eliminating local exception handlers and by confining the impact of undo/redo to a small add-on to the model part of the application.
Achieving Global End-to-End Maxmin in Multihop Wireless Networks
Authors: Liang Zhang, Shigang Chen, Ying Jian
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Following the huge commercial success of WLAN, multihop wireless networks are expected to lead in the next wave of deployment. Fundamental methods for traffic engineering must be developed to support diverse application requirements in these networks. This paper studies the problem of how to support weighted bandwidth allocation among all end-to-end flows in a multihop wireless network. Our goal is to enable the network to adapt the flow rates such that global maxmin can be achieved. Our approach is to transform the global maxmin objective into four local conditions and design a distributed rate adaptation protocol based on those local conditions. Comparing with the prior art, our protocol has a number of advantages. It is designed for the popular IEEE 802.11 DCF. It replaces per-flow queueing with per-destination queueing. It achieves far better fairness (or weighted fairness) among end-to-end flows.
Peer clustering: a hybrid architecture for massively scaled distributed virtual environments
Authors: Richard R. Muntz
Venue:  (2007)

This research proposes a hybrid architecture for distributed virtual environments, utilizing servers alongside peer-to-peer components. Distributed virtual environments allow massive numbers of users to interact in immersive simulations. While originally a military domain, commercial massively multiplayer games now have user bases larger than 8.5 million, but scalability problems limit them to discrete instantiations of only a few thousand concurrent users. Current research into peer-based systems seeks to alleviate resource constraints, but it largely ignores a number of difficult problems, from bootstrapping and persistence of state to user authentication and system security (i.e., cheat resistance). This work proposes a hybrid architecture that turns the massive scale of the system from a problem into an asset, while still providing the features essential to a distributed virtual environment. Peers work together to distribute the workload, allowing redundant peer clusters to overcome failures and detect unacceptable behavior. The goal is to reduce cost and significantly increase the size of the concurrent user base while providing equivalent levels of robustness, persistence, and security. Simulations show that the hybrid architecture can handle massive populations, given the characteristics of modern computer systems.
MU-Sync: a time synchronization protocol for underwater mobile networks
Authors: Nitthita Chirdchoo, Wee-Seng Soh, Kee Chaing Chua
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Although there are numerous time synchronization algorithms recently proposed for terrestrial wireless sensor networks, none of these could be directly applied to underwater acoustic sensor networks. This is because they typically assume that the propagation delay is negligible, which is not the case in underwater. Furthermore, the sensor nodes in underwater tend to have some degree of mobility due to wind or ocean current, which complicates the problem even more by introducing time-varying delay. In this paper, we propose a cluster-based synchronization algorithm for underwater acoustic mobile networks, called "MU-Sync". Our design avoids frequent re-synchronization by estimating both the clock skew and offset. As underwater mobile networks experience both time-varying and long propagation delay, previous works that estimate the clock skew using a single least square error linear regression tend to be inaccurate. In the MU-Sync, the clock skew is estimated by performing the linear regression twice over a set of local time information gathered through message exchanges. The first linear regression enables the cluster head to offset the effect of long and varying propagation delay; the second regression in turn obtains the estimated skew and offset. With the help of MAC-level time stamping, we can further reduce the nondeterministic errors that are commonly encountered by those synchronization algorithms that rely on message exchanges.
The importance of negative associations and the discovery of association rule pairs
Authors: Alex Tze Hiang Sim, Maria Indrawan, Bala Srinivasan
Venue: International Journal of Business Intelligence and Data Mining (2008)

Association Rule Mining (ARM) technique is one of the popular data mining techniques used to discover knowledge from a database. In this paper, we highlight the subsequent drawbacks to association rule mining without considering the absence of items. We propose a novel approach to mine both positive and negative association rules as rule pairs. Our approach ensures that impacts of negative associations are considered so that the drawbacks identified can be avoided. Our initial experiment results show that mining pairs of association rules invoking negative associations are small in number and easy to be appreciated for its implications for decision-making.
Big Improvements with Small Changes: Improving the Processes of a Small Software Company
Authors: Anu Valtanen, Jarmo J. Ahonen
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Majority of software companies are small. They have understood that it is crucial for their business to improve their software processes but they often do not have the knowledge and resources to do it. In this paper one way of introducing a process culture and improving the processes of a small company is presented. The problems that a small company has with its efforts towards better processes are also discussed and simple but working solutions to them are introduced.
Stable and accurate wave-propagation in discontinuous media
Authors: Ken Mattsson, Frank Ham, Gianluca Iaccarino
Venue: Journal of Computational Physics (2008)

A time stable discretization is derived for the second-order wave equation with discontinuous coefficients. The discontinuity corresponds to inhomogeneity in the underlying medium and is treated by splitting the domain. Each (homogeneous) sub domain is discretized using narrow-diagonal summation by parts operators and, then, patched to its neighbors by using a penalty method, leading to fully explicit time integration. This discretization yields a time stable and efficient scheme. The analysis is verified by numerical simulations in one-dimension using high-order finite difference discretizations, and in three-dimensions using an unstructured finite volume discretization.
Automatic Dialect Identification: A Study of British English
Authors: Emmanuel Ferragne, François Pellegrino
Venue: Speaker Classification II: Selected Projects (2007)

This contribution deals with the automatic identification of the dialects of the British Isles. Several methods based on the linguistic study of dialect-specific vowel systems are proposed and compared using the Accents of the British Isles (ABI) corpus. The first method examines differences in diphthongization for the face lexical set. Discrimination scores in a two-dialect discrimination task range from chance to ca. 98% of correct decision depending on the pair of dialects under test. Thanks to the ACCDIST method (developed in [1,2]), the second and third experiments take dialectal differences in the structure of vowel systems into consideration; evaluation is performed on a 13-dialect closed set identification task. Correct identification reaches up to 90% with two subsets of the ABI corpus (/hVd/ set and read passages). All these experiments rely on a front-end automatic phonetic alignment and are therefore text-dependent. Results and possible improvements are discussed in the light of British dialectology.
Effects of haptic feedback, stereoscopy, and image resolution on performance and presence in remote navigation
Authors: Sangyoon Lee, Gerard Jounghyun Kim
Venue: International Journal of Human-Computer Studies (2008)

Traditionally, the main goal of teleoperation has been to successfully achieve a given task as if performing the task in local space. An emerging and related requirement is to also match the subjective sensation or the user experience of the remote environment, while maintaining reasonable task performance. This concept is often called ''presence'' or ''(experiential) telepresence,'' which is informally defined as ''the sense of being in a mediated environment.'' In this paper, haptic feedback is considered as an important element for providing improved presence and reasonable task performance in remote navigation. An approach for using haptic information to ''experientially'' teleoperate a mobile robot is described. Haptic feedback is computed from the range information obtained by a sonar array attached to the robot, and delivered to a user's hand via a haptic probe. This haptic feedback is provided to the user, in addition to stereoscopic images from a forward-facing stereo camera mounted on the mobile robot. The experiment with a user population in a real-world environment showed that haptic feedback significantly improved both task performance and user-felt presence. When considering user-felt presence, no interaction among haptic feedback, image resolution, and stereoscopy was observed, that is, haptic feedback was effective, regardless of the fidelity of visual elements. Stereoscopic images also significantly improved both task performance and user-felt presence, but high-resolution images only significantly improved user-felt presence. When considering task performance, however, it was found that there was an interaction between haptic feedback and stereoscopy, that is, stereoscopic images were only effective when no force feedback was applied. According to the multiple regression analysis, haptic feedback was a higher contributing factor to the improvement in performance and presence than image resolution and stereoscopy.
Plenary lecture III: applications of neural networks in mobile robots navigation
Authors: Virgil Tiponut
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Artificial Neural Networks (ANN) and in particular cellular Neural Networks (CNN) are valuable tools, widely used today in autonomous mobile robot navigation. Obstacles detection in unknown working environment, path finding and trajectory planning, mobile robot collectivities cooperation, are the main applications where ANN and CNN have successfully proved their huge potential. In the present paper, original results in all the above mentioned fields will be presented. In the first part of the paper, a solution using ANN for obstacles detection in unstructured environment, bioinspired from the echo locator of the bats, is presented. The rest of the paper is entirely devoted to applications implemented using CNN. Different methods for path finding to the target and trajectory planning, for a single robot and mobile robot collectivities, are analyzed and the obtained results are reported.
Adventures in the Boundary between Domain-Independent Ontologies and Domain Content for CSCL
Authors: Seiji Isotani, Riichiro Mizoguchi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

One of the main problems facing the development of ontology-aware authoring systems (OAS) is to link well-designed domain-independent knowledge (ontologies) with domain content. Such a problem comes from the fact that all OAS developed to date require end-users (non-experts) to create their own domain ontologies to run the system in real scenarios. In collaborative learning (CL), this problem hinders the development of OAS that aid the design of pedagogically sound CL sessions with strong technological support. In this paper, we propose a framework that connects an ontology for CL (CL ontology) with domain content without the use of domain ontologies. To check its usability, we present an example to model a geometry drawing course demonstrating that it is feasible to instantiate the CL ontology to represent a specific domain and connect it with adequate learning objects.
Implementation of Brillouin-Active Fiber for Low Threshold Optical Logic and Memory Based Neural Networks in Smart Structures
Authors: Yong-Kab Kim, Woo-Soon Kim, Yue Soon Choi, Jong Goo Park
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper research and development are ongoing in the implementations of Brillouin-active fiber based, highly versatile active optical device for optical communication, sensing and computation. An active device in general requires the employment of nonlinearity, and possibly feedback for increased efficiency in device function. However, the presence of nonlinearity together with intrinsic delayed feedback has been repeatedly demonstrated to lead to instabilities and ultimate optical chaos. Our effort is then to exploit device function and suppress instabilities by simulation, and design for optimization based on neural networks in smart structures. Instabilities are unavoidable in optical fiber due to its intrinsic nonlinearity and feedback instabilities. The suppression of such instabilities is devoted to the exploitation of them for memory capacity. These memories can be estimated as an optical logic function used for all-optic in-line switching, channel selection, oscillation, optical logic elements in optical computation with neural network application.
Bivariate Lagrange interpolation at the Padua points: Computational aspects
Authors: Marco Caliari, Stefano De Marchi, Marco Vianello
Venue: Journal of Computational and Applied Mathematics (2008)

The so-called ''Padua points'' give a simple, geometric and explicit construction of bivariate polynomial interpolation in the square. Moreover, the associated Lebesgue constant has minimal order of growth O(log^2(n)). Here we show four families of Padua points for interpolation at any even or odd degree n, and we present a stable and efficient implementation of the corresponding Lagrange interpolation formula, based on the representation in a suitable orthogonal basis. We also discuss extension of (non-polynomial) Padua-like interpolation to other domains, such as triangles and ellipses; we give complexity and error estimates, and several numerical tests.
Gem #17: pragma no_return, part 2 (functions)
Authors: Bob Duff
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #17 -- GNAT warns about functions that might reach their "end", and sometimes these warnings are false alarms. Pragma No_Return can be used to suppress such false alarms.
Research on Emotional Vocabulary-Driven Personalized Music Retrieval
Authors: Bin Zhu, Tao Liu
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper, aimed at emotional interactive needs in music retrieval, a new retrieval method, based on dynamic characteristics of fuzzy psychological and linguistic value computing of music emotion, is putting forward. And an improved interactive genetic algorithm is designed for the emotional retrieval goal. In order to reduce users' fatigue of retrieval process, choice operator for fine breed, crossover operator holding the dominant element of emotion vector, and self-genetic operation strategy are designed.