ppxscal/embedding_network huggingface dataset:
Issues on the optimisation of evolutionary algorithms code
Authors: P. Collet, J. Louchet, E. Lutton
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The aim of this paper is to show that the common belief, in the evolutionary community, that evaluation time usually takes over 90% of the total time, is far from being always true. In fact, many real-world applications showed a much lower percentage. This raises several questions, one of them being the balance between fitness and operators computational complexity: what is the use of elaborating smart evolutionary operators to reduce the number of evaluations if as a result, the total computation time is increased?.
Parallel Algebraic Approach of BCH Coding in VHDL
Authors: Luis Vitorio Cargnini, Rubem Dutra Ribeiro Fagundes, Eduardo A. Bezerra, Gabriel M. Almeida
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This work introduces an algebraic approach, using a Hardware Description Language (HDL) and shows that nowadays microelectronics technology could solve algebraic problems that were considered unsolvable using traditional sequential implementation forms as Berlekamp-Massey. An algebraic approach to implement Error Correcting Codes (ECC) is proposed, and implemented using a Hardware Description Language, specifically VHDL. The ECC designed for HDL algebraic implementation is Bose-Chaudhuri-Hocquenghem (BCH), that is one of the most important cyclic block codes. In this research work, we adopted n=63 and k=57, BCH(63,57) an usual configuration in many scientific communication systems as CCSDS telecommand systems of European Space Agency (ESA) and Agencia Espacial Brasileira (AEB). The achieved results clearly shows the main idea in our approach: to prove that an algebraic implementation is a far better approach, leading to an impressive efficiency, and much more suitable than any other sequential algorithm, even then the ones in a hardware version.
Weighted least squares method for the approximation of directional derivatives
Authors: M. Tico
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Using the facet model we design a family of filters for the approximation of partial derivatives of the digital image surface. Prior information (e.g., local dominant orientation) is incorporated in a two-dimensional weight function. A weighted least squares estimation of the facet parameters is applied in order to design the proposed filters. Exemplary application of the proposed filters to fingerprint image segmentation is also presented.
Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation
Venue: Symposium on Computer Animation (2007)

The ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA) is the leading scientific meeting devoted exclusively to computer animation. The symposium attracts high quality papers and provides an opportunity for researchers in the area of computer animation to meet, share ideas and discuss emerging directions in the field. This year the Seventh SCA was held in San Diego, California prior to the ACM SIGGRAPH 2007 Conference. These proceedings contain 28 papers from 81 submissions. The exceptional quality of the submitted papers made the final selection difficult. Each paper was reviewed by at least 3 members of the international program committee in a double-blind reviewing process. The acceptance decisions were made through online discussions and feedback from the entire program committee. The final program includes papers on a variety of topics, including fluids, deformable objects, behavior modeling, articulation, real time simulation, motion editing, analysis, and control. The symposium continues to highlight promising works in progress with a poster and demo session. Our program included a special session on posters and demos which were presented and discussed in an evening reception. This program included works that were just short of the final papers program and additional posters that were selected through a separate poster-review process.
Static evaluation of Certificate Policies for GRID PKIs interoperability
Authors: Valentina Casola, Nicola Mazzocca, Jesus Luna, Oscar Manso, Manel Medina
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Validating an end-entity X.509 digital certificate prior to authorizing it for using a resource into the computational Grid has become a widely studied topic due to its importance for security. A more comprehensive validation process involves not only a real-time check on the credential's status, but also an evaluation of the trust level applicable to its Certification Authority. Nowadays Policy Management Authorities (PMAs) gather Grid CAs fulfilling a minimum set of requirements defined in an Authentication Profile thus guaranteeing a trusted interoperability environment for Grid projects. Currently this is a manual process that only results in a binary decision (the CA is able to become part of the PMA or not), however in practice, different CAs offer different security levels. In this paper we present ways to apply the Reference Evaluation Methodology (REM) to automatically obtain the security level of a CA. The described process is based on the building of a formalized policy template for Grid Certificate Policies. This methodology has been used to evaluate the security level offered by a set of EUGridPMA's CAs; the obtained results are then conveyed to relying parties using an infrastructure composed of CertiVeR's Validation Service and the Open GRid Ocsp (OGRO) middleware for the Globus Toolkit 4, thus providing enough information for a comprehensive certificate validation decision.
The Emperor's New Security Indicators
Authors: Stuart E. Schechter, Rachna Dhamija, Andy Ozment, Ian Fischer
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

We evaluate website authentication measures that are designed to protect users from man-in-the-middle, "phishing', and other site forgery attacks. We asked 67 bank customers to conduct common online banking tasks. Each time they logged in, we presented increasingly alarming clues that their connection was insecure. First, we removed HTTPS indicators. Next, we removed the participant's site-authentication image-the customer-selected image that many websites now expect their users to verify before entering their passwords. Finally, we replaced the bank's password-entry page with a warning page. After each clue, we determined whether participants entered their passwords or withheld them. We also investigate how a study's design affects participant behavior: we asked some participants to play a role and others to use their own accounts and passwords. We also presented some participants with security-focused instructions. We confirm prior findings that users ignore HTTPS indicators: no participants withheld their passwords when these indicators were removed. We present the first empirical investigation of site-authentication images, and we find them to be ineffective: even when we removed them, 23 of the 25 (92%) participants who used their own accounts entered their passwords. We also contribute the first empirical evidence that role playing affects participants' security behavior: role-playing participants behaved significantly less securely than those using their own passwords.
Towards an Embedded Visuo-Inertial Smart Sensor
Authors: P. Chalimbaud, F. Marmoiton, F. Berry
Venue: International Journal of Robotics Research (2007)

In the neurological system of primates, changes in posture are detected by the central nervous system through a vestibular process. This process, located in the inner ear, coordinates several system outputs to maintain stable balance, visual gaze, and autonomic control in response to changes in posture. Consequently the vestibular data is merged to other sensing data like touch, vision, .... The visuo-inertial merging is crucial for several tasks like navigation, depth estimation, stabilization. This paper proposes a &#x201C;primate-inspired&#x201D; sensing hardware, based on a CMOS imaging and an artificial vestibular system. The whole sensor can be considered like a smart embedded sensor where one of the most original aspects of this approach is the use of a System On Chip implemented in a FPGA to manage the whole system. The sensing device is designed around a 4 million pixels CMOS imager and the artificial vestibular set is composed of three linear accelerometers and three gyroscopes. With its structure, the system provides a high degree of versatility and allows the implementation of parallel image and inertial processing algorithms. In order to illustrate the proposed approach, depth estimation with Kalman filtering implementation is carried out.
Perspectives on ontology-based querying: Research Articles
Authors: Rasmus Knappe, Henrik Bulskov, Troels Andreasen
Venue: International Journal of Intelligent Systems (2007)

In this article, we introduce principles for ontology-based querying of information bases. We consider a framework in which a basis ontology over atomic concepts in combination with a concept language defines a generative ontology. Concepts are assumed to be the basis for an index of the information base, in the sense that these concepts are attached to objects in the information base. Concepts are thus applied to obtain a means for descriptions that generalize classical word-based information base indexing. We discuss how the ontology influences the matching of values, especially how the different relations of the ontology may contribute to overall similarity between concepts. Further, we discuss a set of major properties to improve a given similarity measure's accordance with the semantics of the ontology, and use these properties to guide the choice of function. Finally we implement a prototype search system to evaluate the chosen approach. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 739&ndash;761, 2007.
Motility, mixing, and multicellularity
Authors: Cristian A. Solari, John O. Kessler, Raymond E. Goldstein
Venue: Genetic Programming and Evolvable Machines (2007)

A fundamental issue in evolutionary biology is the transition from unicellular to multicellular organisms, and the cellular differentiation that accompanies the increase in group size. Here we consider recent results on two types of "multicellular" systems, one produced by many unicellular organisms acting collectively, and another that is permanently multicellular. The former system is represented by groups of the bacterium Bacillus subtilis and the latter is represented by members of the colonial volvocalean green algae. In these flagellated organisms, the biology of chemotaxis, metabolism and cell---cell signaling is intimately connected to the physics of buoyancy, motility, diffusion, and mixing. Our results include the discovery in bacterial suspensions of intermittent episodes of disorder and collective coherence characterized by transient, recurring vortex streets and high-speed jets of cooperative swimming. These flow structures markedly enhance transport of passive tracers, and therefore likely have significant implications for intercellular communication. Experiments on the Volvocales reveal that the sterile flagellated somatic cells arrayed on the surface of Volvox colonies are not only important for allowing motion toward light (phototaxis), but also play a crucial role in driving fluid flows that transport dissolved molecular species. These flows, generated by the collective beating of flagella, confer a synergistic advantage with regard to transport of nutrients and chemical messengers. They allow these species to circumvent a nutrient acquisition bottleneck which would exist if transport were purely diffusive, and thereby evolve to larger multicellular individuals. In both cases, a higher level of organization, specialization and complexity counteract the higher costs inherent to larger groups.
A statistical method for profiling network traffic
Authors: David Marchette
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

Two clustering methods are described and applied to network data. These allow the clustering of machines into "activity groups", which consist of machines which tend to have similar activity profiles. In addition, these methods allow the user to determine whether current activity matches these profiles, and hence to determine when there is "abnormal" activity on the network. A method for visualizing the clusters is described, and the approaches are applied to a data set consisting of a months worth of data from 993 machines.
A speaker tracking system based on speaker turn detection for NIST evaluation
Authors: J.-F. Bonastre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A speaker tracking system (STS) is built by using successively a speaker change detector and a speaker verification system. The aim of the STS is to find in a conversation between several persons (some of them having already enrolled and other being totally unknown) target speakers chosen in a set of enrolled users. In a first step, speech is segmented into homogeneous segments containing only one speaker, without any use of a priori knowledge about speakers. Then, the resulting segments are checked to belong to one of the target speakers. The system has been used in a NIST evaluation test with satisfactory results.
Finite data record performance analysis of rapid synchronization and combined demodulation algorithms
Authors: I. N. Psaromiligkos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We investigate the coarse synchronization performance of matched-filter-type (MF) and minimum-variance-distortion less-response-type (MF) near self-synchronized receivers for asynchronous direct-sequence code-division-multiple-access communications under finite data record adaptation. Analytic expressions are derived that approximate closely the probability of coarse synchronization error and provide low-cost highly-accurate alternatives to the computationally demanding performance evaluation through simulations. The expressions are explicit functions of the data record size N and the filter order p and reveal the effect of short-data-record sample-matrix-inversion (SMI) implementations on the coarse synchronization performance.
Fundamental issues in representing np-complete problems
Authors: Carsten Schurmann
Venue:  (2006)

In this dissertation, we study the issues involved in representing NP-complete problems in a formal logical framework. We focus on two main issues: representing NP-complete problem instances and their reductions succinctly so that the corresponding correctness proofs can also be represented, and determining statically if a reduction between two NP-complete problems is a polynomial-time reduction. We use logical framework LF and its advanced variants linear LF and concurrent LF to store NP-complete problems and their reductions. We identify advantages and disadvantages of these systems for our purpose. Finally, we develop fairly comprehensive static criteria for distinguishing polynomial time algorithms from non-polynomial time algorithms. These criteria can be represented within the system as a proof of the fact that a reduction is polynomial time algorithm. The criteria are general enough to be applicable for a large class of functional and logic programming languages.
Towards a Model of Information Aesthetics in Information Visualization
Authors: Andrea Lau, Andrew Vande Moere
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper proposes a model of information aesthetics in the context of information visualization. It addresses the need to acknowledge a recently emerging number of visualization projects that combine information visualization techniques with principles of creative design. The proposed model contributes to a better understanding of information aesthetics as a potentially independent research field within visualization that specifically focuses on the experience of aesthetics, dataset interpretation and interaction. The proposed model is based on analysing existing visualization techniques by their interpretative intent and data mapping inspiration. It reveals information aesthetics as the conceptual link between information visualization and visualization art, and includes the fields of social and ambient visualization. This model is unique in its focus on aesthetics as the artistic influence on the technical implementation and intended purpose of a visualization technique, rather than subjective aesthetic judgments of the visualization outcome. This research provides a framework for understanding aesthetics in visualization, and allows for new design guidelines and reviewing criteria.
The julia content distribution network
Authors: Danny Bickson, Dahlia Malkhi
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

Peer-to-peer content distribution networks are currently being used widely, drawing upon a large fraction of the Internet bandwidth. Unfortunately, these applications are not designed to be network-friendly. They optimize download time by using all available bandwidth. As a result, long haul bottleneck links are becoming congested and the load on the network is not well balanced. In this paper, we introduce the Julia content distribution network. The innovation of Julia is in its reduction of the overall communication cost, which in turn improves network load balance and reduces the usage of long haul links. Compared with the state-of-the-art BitTorrent content distribution network, we find that while Julia achieves slightly slower average finishing times relative to BitTorrent, Julia nevertheless reduces the total communication cost in the network by approximately 33%. Furthermore, the Julia protocol achieves a better load balancing of the network resources, especially over trans-Atlantic links. We evaluated the Julia protocol using real WAN deployment and by extensive simulation. The WAN experimentation was carried over the PlanetLab wide area testbed using over 250 machines. Simulations were performed using the the GT-ITM topology generator with 1200 nodes. A surprisingly good match was exhibited between the two evaluation methods (itself an interesting result), an encouraging indication of the ability of our simulation to predict scaling behavior.
A social robotics experimental project
Authors: J. M. Giron-Sierra
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

We have four small mobile hexapods. Each hexapod has almost no brain, but can communicate via radio with a PC, using a limited set of digital messages. The hexapods know how to move, and can detect obstacles and some kind of objects. We have four PCs, one for each hexapod (so each hexapod has a helping brain). The PCs are interconnected using the parallel port. We can assign a task for the team, for instance to explore a field. The PCs must work in a coordinated way, exchanging messages. The development of this experimental scenario has been the subject of several projects done by students involved in robotics and computer science. One of the aspects covered is the use of real time operating systems for the PCs to work together. Other aspects are related with mobile robotics and the behavior of insectoids. The general set-up has been completed recently, and a new project will start to accomplish a task and study the results. An object oriented simulation is also another new project, which will be validated against the experimental results. Every project must generate documentation for others to use it. In general, the idea is to establish an interesting challenge, with obvious results. The paper presents the main educational objectives, and describes the chief parts of the experimental set-up: robots and PCs, interconnection characteristics. Then, the paper focuses on the projects done and under way, with emphasis on the pedagogical impact.
Towards Defining Knowledge Management Success
Authors: Murray E. Jennex, Stefan Smolnik, David Croasdell
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Discussions at previous HICSS conferences have shown that there is no general agreement on definitions of Knowledge Management (KM) and Knowledge Management Systems (KMS) success. A deep understanding of these concepts would help to design and implement efficient KM initiatives and systems. We present an exploratory research study to begin and facilitate a debate that will hopefully lead to a consensus definition of KM and KMS success. We chose an expert panel approach followed by two exploratory surveys to approach the KM and KMS success definition. The research shows only a few points of consensus. We present areas of agreement as well as of disagreement, which serve as a good starting point for further discussions on KM and KMS success.
Integrating computerized data acquisition and analysis into an undergraduate electric machines laboratory
Authors: D. G. Kastern
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The Ohio State University (OSU) Department of Electrical Engineering has maintained an electric machines laboratory in the undergraduate curriculum for many years. Safety has always been of paramount concern and therefore instrumentation and measurement procedures must be developed so as to allow safe operation of the equipment over a wide range of experimental tests Hall-effect voltage and current transducers have been incorporated into the test table, the output of which goes to an A/D converter in a PC. The software used to accomplish the data acquisition and subsequent analysis is LabVIEW by National Instruments. Using the many tools provided by LabVIEW a program was developed that gives the srudent freedom to decide what variables to record, how to analyze those variables and how to display them. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
He's parameter-expanding methods for strongly nonlinear oscillators
Authors: Lan Xu
Venue: Journal of Computational and Applied Mathematics (2007)

Ji-Huan He's work on asymptotic techniques is briefly reviewed, and his parameter-expanding methods including modified Lindstedt-Poincare method and bookkeeping parameter method are discussed in detail. Some remarkable virtues of the methods are exploited, and their applications are illustrated.
A mining method of communities keeping tacit knowledge
Authors: Ryutaro Ichise, Hideaki Takeda, Satoshi Kouno, Taichi Muraki
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The research community plays a very important role in holding valuable scientific knowledge. The authors propose a community mining system which helps to find communities of researchers by using bibliography data. The key features of our method are a network model of papers and a word assignment technique for the communities obtained. We implemented the proposed method in a graphical computer system. In this paper, we show how research communities are found using our system. Also, we evaluate the performance of the proposed method using experiments with real world data. The results demonstrate that our system can find appropriately sized research communities for a particular scientific field.