ppxscal/embedding_network huggingface dataset:
Low-Latency Parallel Transport in Anonymous Peer-to-Peer Overlays
Authors: Igor Margasiński, Michał Pióro
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

The paper presents a design and discusses configuration aspects of an overlay transport protocol based on an idea of the peer-to-peer direct and anonymous distribution overlay (P2PRIV). We estimate a secure configuration of the protocol and examine a correlation between the P2PRIV's anonymous path lengths and latency. An increase of the path lengths speaks strongly in favor of the parallel solution's anonymity, as in classical cascade networks. In the paper we evaluate the new protocol in a scope of a trade-off between anonymity and traffic performance and show that the presented solution allows effectively increasing anonymity with relatively low impact on anonymous transport latency.
Real-Time Image Segmentation for Visual Servoing
Authors: Witold Czajewski, Maciej Staniak
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Precise and real-time segmentation of color images is a crucial aspect of many applications, where high accuracy and quick response of a system is required. There is a number of algorithms available, but they are either fast or accurate, but not both. This paper describes a modification to one of the fastest color segmentation methods based on constant thresholds. Our idea is to use variable thresholds and merge the results achieving higher precision of color segmentation, comparable with adaptive methods. Using variable thresholds requires multiple passes of the algorithm which is time consuming, but thanks to our modification the processing time can be reduced by up to 50%. The original algorithm as well as the proposed modification are described. The performance of the modified method is tested in a real-time visual servoing application.
Equivalence Knowledge Mass and Approximate Reasoning in $\mathcal{R}$---Logic $\mathbb{C}_\mathcal{R}$ (I)
Authors: Yalin Zheng, Guang Yang, Changshui Zhang, Jing Zheng, Yunpeng Xu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A ¿ and the knowledge A ¿B based on the equivalence relation $\mathcal{R}$ on formulae set $\mathcal{F(S)}$ and the corresponding equivalence classification $$ \mathcal{F(S)}/\mathcal{R}=\{ [A]_\mathcal{R}\ | A \in \mathcal{F(S)} \} $$ therefore, obtains another algorithm of approximate reasoning -- the IV-type $\mathcal{R}$---algorithm.
Two-wagons fault-tolerant ethernet networked control system
Authors: Mai Hassan, R. M. Daoud, H. H. Amer
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This paper studies the use of Gigabit Ethernet in the context of Networked Control Systems on board of trains. One Ethernet network is used to connect the sensors, actuators and controllers in two adjacent train wagons. Furthermore, entertainment traffic is added to the control load. Using OPNET simulations, it is shown that the network can meet the real-time delay deadlines in presence of mixed traffic communication load. Furthermore, it is shown that the controller reliability of interconnected two-wagon network is much higher than that of an isolated single wagon network; one controller/server can carry the control information on board of two wagons.
Technology strategy and managementThe legacy of Bill Gates
Authors: Michael Cusumano
Venue: Communications of the ACM (2009)

Assessing the pluses and minuses of the helmsmanship of Microsoft Corporation since its inception.
Negotiation of Service Level Agreements: An Architecture and a Search-Based Approach
Authors: Elisabetta Nitto, Massimiliano Penta, Alessio Gambi, Gianluca Ripa, Maria Luisa Villani
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Software systems built by composing existing services are more and more capturing the interest of researchers and practitioners. The envisaged long term scenario is that services, offered by some competing providers, are chosen by some consumers and used for their own purpose, possibly, in conjunction with other services. In the case the consumer is not anymore satisfied by the performance of some service, he can try to replace it with some other service. This implies the creation of a global market of services and poses new requirements concerning validation of exploited services, security of transactions engaged with services, trustworthiness, creation and negotiation of Service Level Agreements with these services. In this paper we focus on the last aspect and present our approach for negotiation of Service Level Agreements. Our architecture supports the actuation of various negotiation processes and offers a search-based algorithm to assist the negotiating parts in the achievement of an agreement.
Designing Virtual Players for Game Simulations in a Pedagogical Environment: A Case Study
Authors: Jean-Marc Labat
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

The development of learner' activities is a key element in the design of a pedagogy based on constructivism. A classic way to implement this pedagogy in practice consists in using simulation. When the simulation is a game, the learner is stimulated by competition with other learners. But, sometimes, there are not enough human players. In order to increase the "playability", we need to introduce virtual players. These virtual players must be defined with respect to 4 properties: (i) to play in a normal way, neither too well nor too poorly, (ii) their behaviour must be unpredictable, (iii) they must not cheat and (iv) they must not be distinguishable from human players. In this paper, we propose a methodology to define such virtual players and we illustrate it in the case of the SIMPLUS project, a business game.
A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem
Authors: Thomas Fischer, Kerstin Bauer, Peter Merz
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution quality. We find provably optimal results for previously unsolved problem instances. The distributed variant using epidemic algorithms allows to find solutions of quality comparable to the MA in less real-time.
Declarative GUI Programming in Microsoft Windows
Authors: Panagiotis Louridas
Venue: IEEE Software (2007)

A domain-specific language for building user interfaces offers a transparent way for programmers to specify interface elements. Microsoft's Extensible Application Markup Language is an XML dialect for this purpose. However, XAML isn't the only choice for programmers who wish to try a declarative approach, and some options are even open source.
Toward automatic facet analysis and need negotiation: Lessons from mediated search
Authors: Jimmy Lin, Philip Wu, Eileen Abels
Venue: ACM Transactions on Information Systems (TOIS) (2008)

This work explores the hypothesis that interactions between a trained human search intermediary and an information seeker can inform the design of interactive IR systems. We discuss results from a controlled Wizard-of-Oz case study, set in the context of the TREC 2005 HARD track evaluation, in which a trained intermediary executed an integrated search and interaction strategy based on conceptual facet analysis and informed by need negotiation techniques common in reference interviews. Having a human &ldquo;in the loop&rdquo; yielded large improvements over fully automated systems as measured by standard ranked-retrieval metrics, demonstrating the value of mediated search. We present a detailed analysis of the intermediary's actions to gain a deeper understanding of what worked and why. One contribution is a taxonomy of clarification types informed both by empirical results and existing theories in library and information science. We discuss how these findings can guide the development of future systems. Overall, this work illustrates how studying human information-seeking processes can lead to better information retrieval applications.
A Semi-automatic Approach to Photo Identification of Wild Elephants
Authors: Alessandro Ardovini, Luigi Cinque, Francesca Rocca, Enver Sangineto
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Zoologists studying elephant populations in wild environments need to recognize different individuals from photos taken in different periods of time. Individuals can be distinguished by the shape of the nicks on their ears. Nevertheless, shape comparison is not trivial due to a highly cluttered background. We propose a method for partially, non-connected curve matching able to compare photos of elephant ears.
Using structured and segmented data for improving data sharing on MANETs
Authors: L. Martin, I. Demeure
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

CDMAN (Collaborative Data Management in Ad hoc Network) is a data sharing middleware specially designed for MANETs (Mobile Ad hoc NETworks). In particular, it takes into account limited battery, memory and processing capacities of mobile devices (such as PDAs) that usually compose these networks. CDMAN uses several strategies to achieve this. One of these is the use of structured segmented data. This paper first presents the structure of CDMAN's data. Then, it analyses the benefits of this structure for sharing data on mobile nodes with limited capability devices.
Idempotent Transductions for Modal Logics
Authors: Tim French
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quantifiers. These logics are refered to as the idempotent transduction logics and are defined using the programs of propositional dynamic logic including converse and tests. This is a nontrivial extension of the decidability of the positive idempotent transduction logics which do not use converse operators in the programs (French, 2006). This extension allows us to apply bisimulation quantifiers to, for example, logics of knowledge, logics of belief and tense logics. We show the idempotent transduction logics preserve the axioms of propositional quantification and are decidable. The definition of idempotent transduction logics allows us to apply these results to a number of combined modal logics with a variety of interactions between modalities.
Exploiting Morpho-syntactic Features for Verb Sense Distinction in KorLex
Authors: Eunryoung Lee, Ae-Sun Yoon, Hyuk-Chul Kwon
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Verb sense distinction is a basic principle in lexical knowledge representation in wordnets. Starting from the results of automatic mapping of English verb WordNet to Korean verb KorLex, the present study looks for a syntactic and semantic verb sense interface using the morpho-syntactic features of Korean verb and proposes a fine-grained verb sense distinction to make up for the weak points of WordNet in NLP applications.
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
Authors: Guillem Godoy, Sophie Tison
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Computation with a term rewrite system (TRS) consists of the application of rules from a given starting term until a normal form is reached. Two natural questions arise from this the definition: whether all terms can reach at least one normal form (normalization property), and whether all terms can reach at most one normal form (unique normalization property).We study the decidability of these properties for two syntactically restricted classes of TRS: for (i) shallow right-linear TRS, and for (ii) linear right-shallow TRS.We show that the normalization property is decidable for both cases (i) and (ii), and that the unique normalization property is undecidable for case (ii), whereas for case (i) remains unknown. Nevertheless, for case (i), if the normalization property is satisfied, then the unique normalization property becomes decidable. Hence, whether all terms reach exactly one normal form for TRS of kind (i) is decidable.These results are based on known constructions of tree automata with constraints and rewrite closure, and on reducing the normalization property to normalization from a concrete finite set of terms.
Binary Edwards Curves
Authors: Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Farashahi
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formulas for binary elliptic curves, i.e., addition formulas that work for all pairs of input points, with no exceptional cases. If n ¿ 3 then the complete curves cover all isomorphism classes of ordinary elliptic curves over .This paper also presents dedicated doubling formulas for these curves using 2M + 6S + 3D, where M is the cost of a field multiplication, S is the cost of a field squaring, and D is the cost of multiplying by a curve parameter. These doubling formulas are also the first complete doubling formulas in the literature, with no exceptions for the neutral element, points of order 2, etc.Finally, this paper presents complete formulas for differential addition, i.e., addition of points with known difference. A differential addition and doubling, the basic step in a Montgomery ladder, uses 5M + 4S + 2D when the known difference is given in affine form.
Predicting Epileptic Seizure by Recurrence Quantification Analysis of Single-Channel EEG
Authors: Tianqiao Zhu, Liyu Huang, Shouhong Zhang, Yuangui Huang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper presents a promising approach, based on the combination of two different approaches, including recurrence quantification analysis(RQA) of single-channel EEG and artificial neural network (ANN), which predicts seizure onsets in 17 consenting patients with generalized epilepsy. Eight channels of EEG were collected in each patient in Epilepsy Center of Xijing Hospital. The seven measures were extracted from the raw EEGs by RQA, and then a four layer(7-6-2-1) ANN was employed for prediction, using the measures as the inputs.The performance obtained for the proposed scheme in predicting succedent seizures is: sensitivity 50~72.2%, specificity 61.9~73.8% and accuracy 58.3~70%, depending on the different EEG leads.
Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL
Authors: Eunjin Lee, Donghoon Chang, Jongsung Kim, Jaechul Sung, Seokhie Hong
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

In 1992, Zheng, Pieprzyk and Seberry proposed a one-way hashing algorithm called HAVAL, which compresses a message of arbitrary length into a digest of 128, 160, 192, 224 or 256 bits. It operates in so called passes where each pass contains 32 steps. The number of passes can be chosen equal to 3, 4 or 5. In this paper, we devise a new differential path of 3-pass HAVAL with probability 2¿ 114, which allows us to design a second preimage attack on 3-pass HAVAL and partial key recovery attacks on HMAC/NMAC-3-pass HAVAL. Our partial key-recovery attack works with 2122 oracle queries, 5·232 memory bytes and 296 3-pass HAVAL computations.
The Primary Path Selection Algorithm for Ubiquitous Multi-homing Environments
Authors: Dae Sun Kim, Choong Seon Hong
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

The multi-homing technology can provide an extended coverage area via distinct access technologies. Also, it is able to redirect a flow from one interface to another without reinitiating the flow. However, there is no suitable multi-homing technology for ubiquitous network environment at the moment. To provide multi-homing schemes into the ubiquitous environment, various related researches should be studied. Therefore, we proposed primary path selection algorithm which can provide a ubiquitous access and Flow redirection.
On the noise estimation in wideband speech by LPC prediction error and spectral ratio
Authors: Young-Hwan Song, Jong-Kuk Kim, Myung-Jin Bae
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

For wideband speech signal, if traditional noise cancelation algorithms are adjusted, it can be operated wrong way since unvoiced speech is similar as white Gaussian noise and high frequency on voiced speech that is over than MVF is also similar as noise in the presence of noise circumstance. So when speech signal is damaged by these reasons, it cannot be recognized exactly because that each phoneme is harmed and high frequency on voice speech signal is reduced even though the additive noise which is mixed with speech signal. It causes that speech signal makes like filtered by LPF. Therefore it is difficult to recognize since utterance is brushed. In this paper, we propose the noise estimation method and the detection of silence region for wideband speech signal in presence of noise by LPC analysis and spectral ratios. We compared speech signal which is mixed with additive white Gaussian noise with LPC prediction error signal, and when the value that the sum of speech signal is divided by the sum of LPC prediction error for each frame is closed with 1, we decided that the frame is noise-like speech region. And for this frame, if spectral ratios were upper than threshold, we decided that the frame is silence region. Finally, on this frame, we estimated noise level.
RSA--Past, Present, Future
Authors: Adi Shamir
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

In 2008 we are celebrating the 10-th anniversary of CHES and the 30-th anniversary of the publication of the RSA paper at CACM. In this talk I will survey some of the major RSA-related papers published at CHES during the last 10 years, describe my own research on security and implementation issues, introduce some new attacks, and make predictions about the future of RSA.
Research on Application of Improved Text Cluster Algorithm in Intelligent QA System
Authors: Ming Zhao, Jianli Wang, Guanjun Fan
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

With rapid development of Internet information, It is quite an important project for data mining that how to classify these large amounts of texts. In this paper, we propose an improved text classify cluster algorithm, while calculating similarity, we synthetically consider the relationship between keywords and eigenvector representation on base of term frequency statistics, thereby it lessens sensitivity of input sequence and frequency, and effectively raises similarity accuracy of small text and simple sentence as well as preciseness and recall rate of text cluster result.
Developing a Computer-Supported Tutoring Interaction Component with Interaction Data Reuse
Authors: Chi-Jen Lin, Chih-Yueh Chou, Tak-Wai Chan
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Most of intelligent tutoring systems (ITSs) were used to be developed by researchers or professionals with knowledge engineering background, due to knowledge model development. As a result, most of teachers, who are the best candidates of ITS developers in terms of their knowledge and motivation, are hindered from developing relevant systems. This study aims to explore a general approach for teachers to developing a computer-supported tutoring interaction component. Interaction data reuse (IDR) is proposed as the key concept for the design of the development approach.
Improved Competitive Performance Bounds for CIOQ Switches
Authors: Alex Kesselman, Kirill Kogan, Michael Segal
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

Combined input and output queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch. We analyze the performance of a switch policy by means of competitive analysis, where a uniform performance guarantee is provided for all traffic patterns. Azar and Richter [8] proposed an algorithm β-PG (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β= 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β= 3 and β= 2.8, respectively. Basically, we demonstrate that β-PG is at most $\frac{\beta^2 + 2\beta}{\beta - 1}$ and at least $\frac{\beta^2 - \beta + 1}{\beta - 1}$-competitive.
Curvature Feature Based Shape Analysis
Authors: Yufeng Chen, Fengxia Li, Tianyu Huang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

A novel method is presented to evaluate the similarity of shapes based on the curvature features and their distribution. Firstly the curvature information is used to define the curvature features, which are learned and searched by the proposed statistic method. Secondly the structural features of each pair are measured, so that the distribution of the curvature feature can be further measured. Taking both advantages of the local shape context analysis and the global feature distances optimization, our method can endure large nonrigid distortion and occlusion. The experiments, which have been implemented on the MPEG-7 shape database, show that this method is efficient and robust under certain shape distortion. Another experiment on the abnormal behavior detection shows its potential in shape detection, motion tracking, image retrieving and the related areas.