ppxscal/embedding_network huggingface dataset:
From Narrow to Broad Band Design and Selection in Hyperspectral Images
Authors: Adolfo Martínez-Usó, Filiberto Pla, José M. Sotoca, Pedro García-Sevilla
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Selecting the most relevant bands from a hyperspectral image would considerably reduce the amount of data without practically losing relevant information. In addition, if some physical and signal criteria of this selection are taken into account, the obtained results grouping consecutive bands would be useful to design new filters for hyperspectral cameras in order to improve the efficiency of these devices. Starting from certain number of pre-selected bands, intervals of spectrally adjacent instances to these initial bands are considered for calculating new broader bands. Results will show how a weighted average on these intervals can keep, or even improve, the performance respecting to a narrower selection, avoiding, at the same time, common drawbacks from the narrow-band acquisition devices.
A multiscale real-time navigation and communication satellite simulation model for OMNeT++
Authors: Andreas Lewandowski, Ralf Burda, Christian Wietfeld
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper presents the first steps of developing the Galileo Satellite Communication Simulator (GSCS) based on the INET Framework [2] of OMNeT++ simulation engine [1]. We present our mobility model for the accurate prediction and modeling of satellite motion using NORAD's (North American Aerospace Defense Command) propagation algorithm SGP (Simplified General Perturbations) for real-time satellite position modelling. Galileo specific satellite orbit data is generated in order to establish the mobility of the prospective space segment. The validity of the simulation implementation is then proved by comparing the results of our simulation with two reputable satellite tracking applications and to a real GPS receiver, from which further extensions of the simulation system are derived. In further steps the integration in a Multiscale Network Simulation Environment is described. The dynamic interaction between Environment, Radio Channel and User Mobility can then be modelled in an adequate way.
Sudoku access: a sudoku game for people with motor disabilities
Authors: Stéphane Norte, Fernando G. Lobo
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Educational games are a beneficial activity motivating a large number of students in our society. Unfortunately, disabled people have reduced opportunities when using a computer game. We have created a new Sudoku game for people whose motion is impaired, called Sudoku Access. This special interface allows the control of the game either by voice or by a single switch. We conducted a user study of the Sudoku Access that shows that people can play the game quickly and accurately. With this special Sudoku puzzle we can help more people to get involved in computer games and contribute to develop logic thinking and concentration in students. Our research aims at building enabling technologies that increase individuals' functional independence in a game environment.
Adaptive Algorithm to Vehicle Following Control in Intelligent Transportation System
Authors: Dianbo Ren, Jiye Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In this paper, the Lyapunov second method is used to derive adaptive control laws that can be used to control the spacing between vehicles in a platoon. The decentralized adaptive algorithm to compensate for parametric variations is investigated and the terminal sliding mode longitudinal control laws for each vehicle in the platoon are designed. From the simulation of the vehicle platoon, convergence rate of spacing errors of the vehicle platoon is fast.
Governing at a distance - politicians in the blogosphere
Authors: Stephen Coleman, Giles Moss
Venue: Information Polity (2008)

This paper examines blogs by three senior politicians as examples of governing at a distance. It considers how the translation of policy messages might be supported by what Scannell has called the 'for-everyone-as-someone' structure of communication. Three communicative characteristics of the blogs are considered: politicians' attempts to seem like ordinary people; their efforts to manage time and appear spontaneous; and their claims to be conversing with and listening to the public. The paper concludes by raising questions about the consequences of digitally mediated intimacy for democratic representation.
Preimages for Reduced-Round Tiger
Authors: Sebastiaan Indesteege, Bart Preneel
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function of Tiger-12, i.e., Tiger reduced to 12 rounds out of 24, with a complexity of 263.5 compression function evaluations. We show how this can be used to construct second preimages with complexity 263.5 and first preimages with complexity 264.5 for Tiger-12. These attacks can also be extended to Tiger-13 at the expense of an additional factor of 264 in complexity.
Batch Verification of Short Signatures
Authors: Jan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particular requirements on the applicable cryptographic primitives. For instance, several applications require that communication overhead be small and that many messages be processed at the same time. In this paper we consider the suitability of public key signatures in the latter scenario. That is, we consider signatures that are 1) short and 2) where many signatures from (possibly) different signers on (possibly) different messages can be verified quickly.We propose the first batch verifier for messages from many (certified) signers without random oracles and with a verification time where the dominant operation is independent of the number of signatures to verify. We further propose a new signature scheme with very short signatures, for which batch verification for many signers is also highly efficient. Prior work focused almost exclusively on batching signatures from the same signer. Combining our new signatures with the best known techniques for batching certificates from the same authority, we get a fast batch verifier for certificates and messages combined. Although our new signature scheme has some restrictions, it is the only solution, to our knowledge, that is a candidate for some pervasive communication applications.
Fast and Adaptive Variable Order Markov Chain Construction
Authors: Marcel H. Schulz, David Weese, Tobias Rausch, Andreas Döring, Knut Reinert, Martin Vingron
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Variable order Markov chains (VOMCs) are a flexible class of models that extend the well-known Markov chains. They have been applied to a variety of problems in computational biology, e.g. protein family classification. A linear time and space construction algorithm has been published in 2000 by Apostolico and Bejerano. However, neither a report of the actual running time nor an implementation of it have been published since. In this paper we use the lazy suffix tree and the enhanced suffix array to improve upon the algorithm of Apostolico and Bejerano. We introduce a new software which is orders of magnitude faster than current tools for building VOMCs, and is suitable for large scale sequence analysis.
Evolving Mechanisms of Virtual Learning Communities: Lessons Learned from a Case in Higher Education
Authors: Angelo Corallo, Marco Maggio, Francesca Grippa, Giuseppina Passiante
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This paper presents an explorative case of a Virtual Learning Community built around a Master's Program intended to create "e-Business Solutions Engineers". To monitor the evolution of the learning community we applied a methodological framework composed of four dimensions: knowledge improvement, mental models' evolution, social networks dynamics, and overall satisfaction measurement. The analysis of data, collected through ten months of exchanged e-mails and five monthly web-surveys, has been validated through interviews to a key informant. The application of Social Network Analysis provided a dynamic visualization of the interactions that we matched with the learning outcomes at individual and team level.
Algorithms of choosing the pre-conditioner matrix for quadratic programming with linear bound constraints
Authors: Nicolae Popoviciu, Mioara Boncut
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The paper begins with several quadratic programming models (QP). For QP model with linear bound constraints a preconditioning technique [2] is necessary, in a neural network frame. This technique reduces the susceptibility of the system to errors. Two algorithms of preconditioning are presented: the first one is based on one matrix and the second is based on two matrixes. Both algorithms are used in three numerical applications. Each application ends by a test of correctitude of computations.
Image Interpolation via Tangent-Control Subdivision
Authors: Luming Liang, Beiji Zou, Huanxi Zhao, Xia Qiu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A novel image interpolation method based on a nonlinear interpolative subdivision scheme is presented. This algorithm allows us to interpolate images from discrete to discrete with an arbitrary real positive scale. Comparative experiments with several traditional image interpolation algorithms indicate that our method preserves edges to which the human visual system is sensitive successfully. Moreover, corresponding PSNR (peak signal to noise ratio) results are also shown.
The Relation between Indel Length and Functional Divergence: A Formal Study
Authors: Raheleh Salari, Alexander Schönhuth, Fereydoun Hormozdiari, Artem Cherkasov, S. Cenk Sahinalp
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Although insertions and deletions (indels) are a common type of evolutionary sequence variation, their origins and their functional consequences have not been comprehensively understood. There is evidence that, on one hand, classical alignment procedures only roughly reflect the evolutionary processes and, on the other hand, that they cause structural changes in the proteins' surfaces.We first demonstrate how to identify alignment gaps that have been introduced by evolution to a statistical significant degree, by means of a novel, sound statistical framework, based on pair hidden Markov models (HMMs). Second, we examine paralogous protein pairs in E. coli, obtained by computation of classical global alignments. Distinguishing between indel and non-indel pairs, according to our novel statistics, revealed that, despite having the same sequence identity, indel pairs are significantly less functionally similar than non-indel pairs, as measured by recently suggested GO based functional distances. This suggests that indels cause more severe functional changes than other types of sequence variation and that indel statistics should be taken into additional account to assess functional similarity between paralogous protein pairs.
Simulating BitTorrent
Authors: Karel De Vogeleer, David Erman, Adrian Popescu
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

IP Television (IPTV) and other media distribution applications are expected to be one of the next Internet killer applications. One indication of this is the corporate backing that the IP Multimedia Subsystem (IMS) is getting. However, the bandwidth utilization of these applications is still an issue, as the volume of multimedia grows due to larger image resolution and higher bitrate audio. One way of managing this increase in bandwidth requirements is to use existing end-host bandwidth to decrease the load on the content server in a Peer-to-Peer (P2P) fashion. One of the most successful P2P applications is BitTorrent (BT), a swarming file transfer system. This paper presents an implementation of a BT simulator intended for future use in investigating modifications to the BT system to provide streaming media capabilities. The simulator is validated against real-world measurements and a brief performance analysis is provided.
Injecting Life with Computers
Authors: Ehud Shapiro
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Although electronic computers are the only "computer species" we are accustomed to, the mathematical notion of a programmable computer has nothing to do with wires and logic gates. In fact, Alan Turing's notional computer, which marked in 1936 the birth of modern computer science and still stands at its heart, has greater similarity to natural biomolecular machines such as the ribosome and polymerases than to electronic computers. Recently, a new "computer species" made of biological molecules has emerged. These simple molecular computers inspired by the Turing machine, of which a trillion can fit into a microliter, do not compete with electronic computers in solving complex computational problems; their potential lies elsewhere. Their molecular scale and their ability to interact directly with the biochemical environment in which they operate suggest that in the future they may be the basis of a new kind of "smart drugs": molecular devices equipped with the medical knowledge to perform disease diagnosis and therapy inside the living body. They would detect and diagnose molecular disease symptoms and, when necessary, administer the requisite drug molecules to the cell, tissue or organ in which they operate. In the talk we review this new research direction and report on preliminary steps carried out in our lab towards realizing its vision.
Study on Discretization in Rough Set Via Modified Quantum Genetic Algorithm
Authors: Shuhong Chen, Xiaofeng Yuan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Optimal discretization of real valued attributes in rough set is a problem of NP-complete. To resolve this problem, a modified quantum genetic algorithm (MQGA) and a new parametric configuration scheme for the fitness function are proposed in this paper. In MQGA, a novel technique with locally hierarchical search ability is introduced to speed up the convergence of QGA. With this configuration scheme, it is convenient to distinguish the appropriate solutions that partition the new decision table consistently from all the results. Experiments on dataset of Iris have demonstrated that the proposed MQGA is more preferable compared with the traditional GA-based method and QGA based method in terms of execution time and ability to obtain the optimal solution.
Hash Functions and RFID Tags: Mind the Gap
Authors: Andrey Bogdanov, Gregor Leander, Christof Paar, Axel Poschmann, Matt J. Robshaw, Yannick Seurin
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

The security challenges posed by RFID-tag deployments are well-known. In response there is a rich literature on new cryptographic protocols and an on-tag hash function is often assumed by protocol designers. Yet cheap tags pose severe implementation challenges and it is far from clear that a suitable hash function even exists. In this paper we consider the options available, including constructions based around compact block ciphers. While we describe the most compact hash functions available today, our work serves to highlight the difficulties in designing lightweight hash functions and (echoing [17]) we urge caution when routinely appealing to a hash function in an RFID-tag protocol.
Advanced MPI Programming
Authors: Julien Langou, George Bosilca
Venue: Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2007)

MPI provides a large range of features allowing various approaches for parallel computing. This tutorial will present interesting features from the MPI-1 standard. These features extend the user knowledge about MPI way beyond the few basic standard functions, giving them the opportunity to implement better, simpler and potentially faster parallel algorithms. This tutorial will cover several features from medium level to advanced of the MPI-1 standard to enable users to exploit fully MPI.
The Epsilon Generation Language
Authors: Louis M. Rose, Richard F. Paige, Dimitrios S. Kolovos, Fiona A. Polack
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

We present the Epsilon Generation Language (EGL), a model-to-text (M2T) transformation language that is a component in a model management tool chain. The distinctive features of EGL are described, in particular its novel design which inherits a number of language concepts and logical features from a base model navigation and modification language. The value of being able to use a M2T language as part of an extensible model management tool chain is outlined in a case study, and EGL is compared to other M2T languages.
Christopher Strachey, 1916-1975: A Biographical Note
Authors: Martin Campbell-Kelly
Venue: IEEE Annals of the History of Computing (1985)

Christopher Strachey was one of the most original computer scientists of his generation: his fields were computer design and programming, and he made important contributions to them both. He liked to say (not quite accurately) that he had changed the direction of his career every seven years. The different phases of his life and career are reflected in the five sections of this note.
Conflicts and Friction in Pedestrian Dynamics
Authors: Andreas Schadschneider
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

"Conflicts" occur generically in particle-hopping models with parallel dynamics when multiple occupation of sites is forbidden. For cellular automata models of pedestrian dynamics we argue that such conflicts represent an important aspect of the real dynamics. Clogging at bottlenecks is described more realistically if one introduces "friction", i.e. conflicts in which none of the involved agents is allowed to move.
Shared Linguistic Resources for the Meeting Domain
Authors: Meghan Lammie Glenn, Stephanie Strassel
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper describes efforts by the University of Pennsylvania's Linguistic Data Consortium to create and distribute shared linguistic resources --- including data, annotations, tools and infrastructure --- to support the Spring 2007 (RT-07) Rich Transcription Meeting Recognition Evaluation. In addition to making available large volumes of training data to research participants, LDC produced reference transcripts for the NIST Phase II Corpus and RT-07 conference room evaluation set, which represent a variety of subjects, scenarios and recording conditions. For the 18-hour NIST Phase II Corpus, LDC created quick transcripts which include automatic segmentation and minimal markup. The 3-hour evaluation corpus required the creation of careful verbatim reference transcripts including manual segmentation and rich markup. The 2007 effort marked the second year of using the XTrans annotation tool kit in the meeting domain. We describe the process of creating transcripts for the RT-07 evaluation, and describe the advantages of utilizing XTrans for each phase of transcription and its positive impact on quality control and real-time transcription rates. This paper also describes the structure and results of a pilot consistency study that we conducted on the 3-hour test set. Finally, we present plans for further improvements to infrastructure and transcription methods.
Towards Automatically Generating Double-Free Vulnerability Signatures Using Petri Nets
Authors: Ryan Iwahashi, Daniela A. Oliveira, S. Felix Wu, Jedidiah R. Crandall, Young-Jun Heo, Jin-Tae Oh, Jong-Soo Jang
Venue: Proceedings of the 11th international conference on Information Security (2008)

With the increased popularity of polymorphic and register spring attacks, exploit signatures intrusion detection systems (IDS) can no longer rely only on exploit signatures. Vulnerability signatures that pattern match based on properties of the vulnerability instead of the exploit should be employed. Recent research has proposed three classes of vulnerability signatures but its approach cannot address complex vulnerabilities such as the ASN.1 Double-Free. Here we introduce Petri nets as a new class of vulnerability signature that could potentially be used to detect other types of vulnerabilities. Petri nets can be automatically generated and are represented as a graph making it easier to understand and debug. We analyzed it along side the three other classes of vulnerability signatures in relation to the Windows ASN.1 vulnerability. The results were very promising due to the very low false positive rate and 0% false negative rate. We have shown that Petri nets are a very efficient, concise, and effective way of describing signatures (both vulnerability and exploit). They are more powerful than regular expressions and still efficient enough to be practical. Comparing with the other classes, only Turing machines provided a better identification rate but they incur significant performance overhead.
P3P deployment on websites
Authors: Lorrie Faith Cranor, Serge Egelman, Steve Sheng, Aleecia M. McDonald, Abdur Chowdhury
Venue: Electronic Commerce Research and Applications (2008)

We studied the deployment of computer-readable privacy policies encoded using the standard W3C platform for privacy preferences (P3P) format to inform questions about P3P's usefulness to end users and researchers. We found that P3P adoption is increasing overall and that P3P adoption rates greatly vary across industries. We found that P3P had been deployed on 10% of the sites returned in the top-20 results of typical searches, and on 21% of the sites returned in the top-20 results of e-commerce searches. We examined a set of over 5000 websites in both 2003 and 2006 and found that P3P deployment among these sites increased over that time period, although we observed decreases in some sectors. In the Fall of 2007 we observed 470 new P3P policies created over a 2-month period. We found high rates of syntax errors among P3P policies, but much lower rates of critical errors that prevent a P3P user agent from interpreting them. We also found that most P3P policies have discrepancies with their natural language counterparts. Some of these discrepancies can be attributed to ambiguities, while others cause the two policies to have completely different meanings. Finally, we show that the privacy policies of P3P-enabled popular websites are similar to the privacy policies of popular websites that do not use P3P.