ppxscal/embedding_network huggingface dataset:
Extractors from Reed-Muller codes
Authors: Amnon Ta-Shma, David Zuckerman, Shmuel Safra
Venue: Journal of Computer and System Sciences (2006)

Finding explicit extractors is an important derandomization goal that has received a lot of attention in the past decade. Previous research has focused on two approaches, one related to hashing and the other to pseudorandom generators. A third view, regarding extractors as good error correcting codes, was noticed before. Yet, researchers had failed to build extractors directly from a good code without using other tools from pseudorandomness. We succeed in constructing an extractor directly from a Reed-Muller code. To do this, we develop a novel proof technique.Furthermore, our construction is the first to achieve degree close to linear. In contrast, the best previous constructions brought the log of the degree within a constant of optimal, which gives polynomial degree. This improvement is important for certain applications. For example, it was used [E. Mossel, C. Umans, On the complexity of approximating the VC dimension, J. Comput. System Sci. 65 (2002) 660-671] to show that approximating VC dimension to within a factor of N1-δ is AM-hard for any positive δ.
Generalized Unsolicited Tests for Authentication Protocol Analysis
Authors: Yongjian Li, Jun Pang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Guttman and Javier Thayer introduced the notion of unsolicited authentication tests, and used it to prove the correctness of security protocols in which a key server authenticate its clients. As an example, they have applied unsolicited authentication tests to prove the authentication goals of the Otway-Rees protocol. However, unsolicited authentication tests seem not to be fully explored in that case study, and the proofs were complicated. In this paper, we revisit the unsolicited authentication tests, and show how to strengthen and apply them in more general cases. To justify our work, we also use this extension to prove all agents' authentication guarantee of the Otway-Rees protocol.
Coordinated Visualisation of Video and System Log Data
Authors: Allistair Morrison, Paul Tennent, Matthew Chalmers
Venue: Proceedings of the Fourth International Conference on Coordinated & Multiple Views in Exploratory Visualization (2006)

As mobile computing technologies become more common, there is an ever-greater interest in eval~iation and analysis of such systems. Evaluating the use of large, multi-user, mobile systems can be a challenging task and can be aided by unalysing both systemgenerated logs of activity and video of user behaviour. Replayer provides a distributed, cross plagorm toolkit for utilising multiple coordinated visualisations in the analysis and understanding of these heterogeneous forms of data. In this paper we pay particular attention to the methods used to combine recorded media such as video with numerical visualisations such as histograms and time series graphs. We examine in some detail the architecture behind the system, and the techniques used to maintain synchronisation and coordination when interactively brushing components. We demonstrate how Replayer can be used to explore data sets using an array of available visualisations, can focus analysis of video data on the most salient periods and can provide context for every area of the recordtd data.
Design of User Authentication Protocol based on XTR-ElGamal
Authors: Kyoung-Sook Jung, Imran Ahmad Rao
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

An Efficient user authentication protocol can be the one that has fast operations and short key length. XTR is proposed by Lenstra and Verheul. It has short key length and fast computing speed. That's why; it can be used in complex arithmetic. This paper focuses on designing efficient user authentication protocol in which a subgroup of Galois Field to problem domain is applied. Proposed protocol uses GF( p2 ) a subgroup for solving problem instead of using GF( p6 ) that is existent finite field. XTR-ElGamal based user authentication protocol reduced bit number that is required while exchanging key by doing with upside. Proposed protocol focuses on easy calculation and execution by reducing required overhead when calculated. In this paper, we designed authentication protocol with y_i = g^a-b g-^5 mod q, 1\lei \le 3 that is required to do user authentication.
Smith's Theorem and a characterization of the 6-cube as distance-transitive graph
Authors: M. R. Alfuraidan, J. I. Hall
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

A generic distance-regular graph is primitive of diameter at least two and valency at least three. We give a version of Derek Smith's famous theorem for reducing the classification of distance-regular graphs to that of primitive graphs. There are twelve cases--the generic case, four canonical imprimitive cases that reduce to the generic case, and seven exceptional cases. All distance-transitive graphs were previously known in six of the seven exceptional cases. We prove that the 6-cube is the only distance-transitive graph coming under the remaining exceptional case.
Virtual Laboratory as a Remote and Interactive Access to the Scientific Instrumentation Embedded in Grid Environment
Authors: M. Okon, D. Kaliszan, M. Lawenda, D. Stoklosa, T. Rajtar, N. Meyer, M. Stroinski
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The following paper describes the key architecture elements of the Virtual Laboratory Project, which is developed in the Poznan Supercomputing and Networking Center. Project started in 2002, and since then the work was carried under different statesponsored grants and now is carried under EU FP6 IST projects. The authors will explain briefly the main ideas and key design elements behind this original concept. The current state of the project will be presented, as the project reached its production phase, and plans for the near and far future will be revealed. A special attention will be given to the concept and implementation of Digital Science Library, as it plays an important role in the scope of the whole system. Although the various aspects of this system were presented on workshops and conferences, this paper brings together all the pieces, and presents the overall look on the entire scope of this Virtual Laboratory System.
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
Authors: Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Toshiro Kubota, Glenn Fung, Marcos Salganicoff, R. Bharat Rao
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging largely due to the following three characteristics. Typical CAD training data sets are large and extremely unbalanced between positive and negative classes. When searching for descriptive features, researchers often deploy a large set of experimental features, which consequently introduces irrelevant and redundant features. Finally, a CAD system has to satisfy stringent real-time requirements.This work is distinguished by three key contributions. The first is a cascade classification approach which is able to tackle all the above difficulties in a unified framework by employing an asymmetric cascade of sparse classifiers each trained to achieve high detection sensitivity and satisfactory false positive rates. The second is the incorporation of feature computational costs in a linear program formulation that allows the feature selection process to take into account different evaluation costs of various features. The third is a boosting algorithm derived from column generation optimization to effectively solve the proposed cascade linear programs.We apply the proposed approach to the problem of detecting lung nodules from helical multi-slice CT images. Our approach demonstrates superior performance in comparison against support vector machines, linear discriminant analysis and cascade AdaBoost. Especially, the resulting detection system is significantly sped up with our approach.
OntoSNP: Ontology Driven Knowledgebase for SNP
Authors: Jaehyoung Lim, Aeyoung Yoon, Choong-Hyun Sun, Taeho Hwang, Gwan-Su Yi, Soon J. Hyun, Jae-Jeung Rho
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Ontology-based knowledgebase system can provide great benefits for analysis of biological information. Currently, some ontology-driven information systems have been introduced in this filed. In most cases, however, the advantage of ontology which computer science technology can provide is not fully implemented. Even the well-known ontologies such as Gene Ontology (GO) include only limited number of properties for each term. To find meaningful information across complex relation chains among data, indispensable properties of each term should be described and relationship among data can be analyzed by reasoning. Ontology with rules can play a key role in bioinformatics area because, as well as interoperability, it finds new knowledge and checks validity of candidate knowledge automatically using a reasoning engine. In this paper, we propose an ontology-based information system for SNP analysis (OntoSNP) equipped with Web Ontology Language (OWL) and a reasoning engine. The proposed system provides finding of SNP-gene-disease relations, automatic data validity and knowledge conflict checking. OntoSNP is based on well-defined SNP-gene-disease ontology model in OWL and knowledge-finding and validation rules in Semantic Web Rule Language (SWRL).
Secure Distributed Cluster Formation in Wireless Sensor Networks
Authors: Kun Sun, Pai Peng, Peng Ning, Cliff Wang
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

In wireless sensor networks, clustering sensor nodes into small groups is an effective technique to achieve scalability, self-organization, power saving, channel access, routing, etc. A number of cluster formation protocols have been proposed recently. However, most existing protocols assume benign environments, and are vulnerable to attacks from malicious nodes. In this paper, we propose a secure distributed cluster formation protocol to organize sensor networks into mutually disjoint cliques. Our protocol has the following properties: (1) normal nodes are divided into mutually disjoint cliques; (2) all the normal nodes in each clique agree on the same clique memberships; (3) while external attackers can be prevented from participating in the cluster formation process, inside attackers that do not follow the protocol semantics can be identified and removed from the network; (4) the communication overhead is moderate; (5) the protocol is fully distributed.
Quality of Adaptation
Authors: Eli Gjorven, Frank Eliassen, Jan Oyvind Aagedal
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

In order to support reusable and extendable solutions to self-adaptation, state of the art within adaptive systems include a diversity of architectures and mechanisms targeting different application types, technologies, context and concerns. Current approaches do not allow reasoning about the mechanisms and strategies themselves during startuptime or run-time. Consequently, the configuration or tuning of the adaptation system itself, must be done manually by a user or an administrator, or hard coded at design-time, making it harder to reuse. In this position paper, we propose considering adaptation as a service. In order to allow reasoning about and comparing such services, we define Quality of Adaptation (QoA) to be the qualitative properties of an adaptation service. We argue that this approach facilitates the development of adaptation mechanisms and control that are, like the system they adapt, reusable and adaptable, and open to evolution.
Methods for quantitative usability requirements: a case study on the development of the user interface of a mobile phone
Authors: Timo Jokela, Jussi Koivumaa, Jani Pirkola, Petri Salminen, Niina Kantola
Venue: Personal and Ubiquitous Computing (2006)

Quantitative usability requirements are a critical but challenging, and hence an often neglected aspect of a usability engineering process. A case study is described where quantitative usability requirements played a key role in the development of a new user interface of a mobile phone. Within the practical constraints of the project, existing methods for determining usability requirements and evaluating the extent to which these are met, could not be applied as such, therefore tailored methods had to be developed. These methods and their applications are discussed.
Maximum likelihood combination of multiple clusterings
Authors: Tianming Hu, Ying Yu, Jinzhi Xiong, Sam Yuan Sung
Venue: Pattern Recognition Letters (2006)

A promising direction for more robust clustering is to derive multiple candidate clusterings over a common set of objects and then combine them into a consolidated one, which is expected to be better than any candidate. Given a candidate clustering set, we show that with a particular pairwise potential used in Markov random fields, the maximum likelihood estimation is the one closest to the set in terms of a metric distance between clusterings. To minimize such a distance, we present two combining methods based on the new similarity determined by the whole candidate set. We evaluate them on both artificial and real datasets, with candidate clusterings either from full space or subspace. Experiments show that they not only lead to a closer distance to the candidate set, but also achieve a smaller or comparable distance to the true clustering.
A criterion for the separation of a linear-quadratic mixture of independent components
Authors: M. Krob, M. Benidir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Blind identification of a linear mixture is a possible approach for source parameters estimation in array processing. The goal is to perform blind identification of a linear-quadratic mixture of independent and circular random components. The authors propose an approach based on the maximization of a criterion. They define a class of criteria appropriate to the linear-quadratic mixture. They show that the maxima of these criteria over the set of the unitary matrices allow to identify the mixture. They give the expression of such a criterion and an algorithm to maximise it. This problem is of interest in all areas involving second-order nonlinear mechanisms or systems in which the inputs are unobservable.
An agent based general solution model for the course timetabling problem
Authors: Yan Yang, Raman Paranjape, Luigi Benedicenti
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and dynamic-constraint issues. In our solution model, each agent in the system represents a constraint in the course timetabling problem. Compared to existing course timetabling solutions, the proposed agent solution model has much better generality, flexibility, dynamics, modularity and scalability.
MUSTA Fluxes for systems of conservation laws
Authors: E. F. Toro, V. A. Titarev
Venue: Journal of Computational Physics (2006)

This paper is about numerical fluxes for hyperbolic systems and we first present a numerical flux, called GFORCE, that is a weighted average of the Lax-Friedrichs and Lax-Wendroff fluxes. For the linear advection equation with constant coefficient, the new flux reduces identically to that of the Godunov first-order upwind method. Then we incorporate GFORCE in the framework of the MUSTA approach [E.F. Toro, Multi-Stage Predictor-Corrector Fluxes for Hyperbolic Equations. Technical Report NI03037-NPA, Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK, 17th June, 2003], resulting in a version that we call GMUSTA. For non-linear systems this gives results that are comparable to those of the Godunov method in conjunction with the exact Riemann solver or complete approximate Riemann solvers, noting however that in our approach, the solution of the Riemann problem in the conventional sense is avoided. Both the GFORCE and GMUSTA fluxes are extended to multi-dimensional non-linear systems in a straightforward unsplit manner, resulting in linearly stable schemes that have the same stability regions as the straightforward multi-dimensional extension of Godunov's method. The methods are applicable to general meshes. The schemes of this paper share with the family of centred methods the common properties of being simple and applicable to a large class of hyperbolic systems, but the schemes of this paper are distinctly more accurate. Finally, we proceed to the practical implementation of our numerical fluxes in the framework of high-order finite volume WENO methods for multi-dimensional non-linear hyperbolic systems. Numerical results are presented for the Euler equations and for the equations of magnetohydrodynamics.
PARAgrab: a comprehensive architecture for web image management and multimodal querying
Authors: Dhiraj Joshi, Ritendra Datta, Ziming Zhuang, W. P. Weiss, Marc Friedenberg, Jia Li, James Z. Wang
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

We demonstrate PARAgrab - a scalable Web image archival, retrieval, and annotation system that supports multiple querying modalities. The underlying architecture of our large-scale Web image database is described. Querying and visualization techniques used in the system are explained.
How to Perform DFT Timing in Mixed Signal Designs, from 28 Hours to 7 Minutes
Authors: Paul Wong, Jing Jiang
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Modern day mixed-signal designs present interesting challenges to DFT timing flow. In this paper, we will discuss how we devised a DFT timing flow utilizing dynamic simulation with a turn around time better than that of a STA tool. In particular, we describe a design where run time has been reduced from 28 hours to 7 minutes.
Implementing a Banking Front End Processor in Taiwan Using SOA
Authors: Jenny Chen, Alyn Hsu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper presents a Proof Of Concept (POC) experience sharing on how to deploy the Front End Processor (FEP) based on banking requirements in Taiwan. New services usually take several months to materialize as existing IT systems lack compatibility. If banking IT can catch the tempo of business planning; it is the key to save costs while increasing new revenue and profit from higher customer satisfaction and responsiveness. Currently, many banks implement Enterprise Application Integration (EAI) as a bridge between front end and existing systems. Through using Service Oriented Architecture (SOA) - WebSphere Process Server (WPS), the development cycles can be reduced from months to weeks.
Introducing Emergent Loose Modules into the Learning Process of a Linear Genetic Programming System
Authors: Xin Li, Chi Zhou, Weimin Xiao, Peter C. Nelson
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Modularity and building blocks have drawn attention from the Genetic Programming (GP) community for a long time. The results are usually twofold: a hierarchical evolution with adequate building block reuse can accelerate the learning process, but rigidly defined and excessively employed modules may also counteract the expected advantages by confining the reachable search space. In this work, we introduce the concept of emergent loose modules based on a new linear GP system, Prefix Gene Expression Programming (P-GEP), in an attempt to balance between the stochastic exploration and the hierarchical construction for the optimal solutions. Emergent loose modules are dynamically produced by the evolution, and are reusable as sub-functions in later generations. The proposed technique is fully illustrated with a simple symbolic regression problem. The initial experimental results suggest it is a flexible approach in identifying the evolved regularity and the emergent loose modules are critical in composing the best solutions.
A 802.11 based slotted dual-channel reservation MAC protocol for in-building multi-hop networks
Authors: Jing Zhu, Sumit Roy
Venue: Mobile Networks and Applications (2005)

In this paper, we propose a novel slotted Dual-Channel Reservation (DCR) MAC protocol that uses 802.11 primitives for providing both Quality of Service (QoS) and fairness. RTS/CTS handshaking is transmitted on a separated control channel to prevent successive collisions of RTS and CTS packets with existing data transmission. Furthermore, contention for channel access may be initiated by sender as well as receiver depending on the channel status for better fairness. A simple slot reservation algorithm in the data channel provides high efficiency. The main conclusion is that reservation access benefits both delay performance, and efficiency as well as fairness-the reason being that not only an exposed terminal can regain the channel more easily because of dramatically reduced contention (RTS-CTS) traffic, but also a hidden terminal receives less collisions in handshaking since any node winning a slot will quit contending on the control channel. Therefore, it is highly recommended to use reservation access even if the prevailing traffic is data, e.g. TCP. To enhance delay performance, we devise a fake packet repeating mechanism that can reserve the slot for a connection even if the user temporarily has no packets to transmit. Simulations based on key metrics-throughput, fairness index and mean delay are performed to validate the new protocol and quantify its advantages. The limitations of the proposed DCR-802.11 protocol due to need for global clock synchronization and dual channels are also discussed.
To Drive Is Human
Authors: Isaac Miller, Ephrahim Garcia, Mark Campbell
Venue: Computer (2006)

Cornell University researchers offer an insider's perspective on the issues the DARPA Grand Challenge competitors faced in creating a humanlike driver--without the human.
Extended Timed Automata and Time Petri Nets
Authors: Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability properties and timed languages has been proposed, which does however not extend to larger classes of TA which would allow diagonal constraints or more general resets of clocks. Though these features do not add expressiveness, they yield exponentially more concise models. In this work, we propose two translations: one from extended TA to TPNs whose size is either linear or quadratic in the size of the original TA, depending on the features which are allowed; another one from a parallel composition of TA to TPNs, which is also linear. As a consequence, we get that TPNs are exponentially more concise than TA. Keywords: Time Petri Nets, Timed Automata, Conciseness, Reachability Analysis.