ppxscal/embedding_network huggingface dataset:
A GA-Based Feature Subset Selection and Parameter Optimization of Support Vector Machine for Content --- Based Image Retrieval
Authors: Kwang-Kyu Seo
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

This paper presents the effectiveness of applying genetic algorithm (GA)-based feature subset selection and parameter optimization of support vector machine (SVM) for content-based image retrieval (CBIR). SVM, one of the new techniques for pattern classification, has been widely used in many application areas. The kernel parameters setting for SVM in the training process impacts on the classification accuracy. Feature subset selection is another factor that impacts classification accuracy. The objective of this study is to simultaneously optimize the parameters and feature subset without degrading the SVM classification accuracy using the GA-based approach for CBIR. In this study, we show that the proposed GA-based approach outperforms SVM to the problem of the image classification problem in CBIR. Compared with NN and SVM algorithm, the proposed GA-based approach significantly improves the classification accuracy and has fewer input features for SVM.
Useful functions: a definition of the inverse quote function
Authors: Joachim Laubsch
Venue: Issue 2 (July 1978) (1978)

It frequently happens that a LISP programmer wants a function to produce a data-structure or function containing constant and variable substructures. The usual solution is to program a form containing a lot of data-structure composing functions (like LIST, CONS and APPEND). The resulting expression is hard to decipher for humans unless more mnemonic constructor-functions are defined. A simple way out is to write the resulting structure with its variable substructures especially marked.
Context-Aware Mashups for Mobile Devices
Authors: Andreas Brodt, Daniela Nicklas, Sailesh Sathish, Bernhard Mitschang
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

With the Web 2.0 trend and its participation of end-users more and more data and information services are online accessible, such as web sites, Wikis, or web services. So-called mashups--web applications that integrate data from more than one source into an integrated service--can be easily realized using scripting languages. Also, mobile devices are increasingly powerful, have ubiquitous access to the Web and feature local sensors, such as GPS. Thus, mobile applications can adapt to the mobile user's current situation.We examine how context-aware mashups can be created. One challenge is the provisioning of context data to the mobile application. For this, we discuss different ways to integrate context data, such as the user's position, into web applications. Moreover, we assess different data formats and the overall performance. Finally, we present the Telar mashup platform, a client-server solution for location-based mashups for mobile devices such as the Nokia N810 Internet Tablet.
Mending Broken Metal Label Characters Based on Structural Features
Authors: Guoliang Lu, Changhou Lu, Huaibo Song
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In the process of the recognition of metal label characters, the characters often have broken gaps, which bring troubles to the next process. In this paper, a novel method is developed which is based on the characters’ structural features and the previous statistic information, and this method bridges the gap effectively. As the experiments show, using this method the reconstructed character’s skeleton is smooth and structure is complete, which meets the needs of the next feature extraction.
Computer Graphics Displays: Windows for Process Control
Authors: Charles Berg
Venue: IEEE Computer Graphics and Applications (1983)

Augmenting conventional panel boards in operations control rooms, graphics displays let plant operators ¿see¿ the condition of any unit in a processing system. 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
Basic Analysis of Stickiness Sensation for Tactile Displays
Authors: Masaaki Yamaoka, Akio Yamamoto, Toshiro Higuchi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper analyzes fingertip behavior on sticky surfaces for synthesizing stickiness sensation. Changes of fingertip contact area were monitored during contacts to sticky surfaces, which were then analyzed with respect to contact force. The analysis revealed that stickiness surfaces cause large hysteresis on the relationship between contact force and area. Based on the analysis, the sticky sensation was simply synthesized by using vacuum pressure. The synthesized sensation elicited a similar feeling as sticky sensation caused by adhesive glue, although the sensation was weaker than the intended one.
On the Relations between the Syntactic Theories of λμ-Calculi
Authors: Alexis Saurin
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Since Parigot's seminal article on "an algorithmic interpretation of classical natural deduction" [15], &lambda;&mu;-calculus has been extensively studied both as a typed and an untyped language. Among the studies about the call-by-name lambda-mu-calculus authors used different presentations of the calculus that were usually considered as equivalent from the computational point of view. In particular, most of the papers use one of three variants of the calculus initially introduced by Parigot: (i) Parigot's syntax, (ii) an extended calculus that satisfies B&ouml;hm theorem and (iii) a second variant by de Groote he considered when designing an abstract machine for &lambda;&mu;-calculus that contains one more reduction rule. In a previous work [20] we showed that contrarily to Parigot's calculus that does not enjoy separation property as shown by David and Py [3], de Groote's initial calculus, that we refer to as &iquest;&frac14;-calculus, does enjoy the separation property. This evidence the fact that the calculi are really different and suggest that the relationships between the &lambda;&mu;-calculi should be made clear. This is the purpose of the present work. We first introduce four variants of call-by-name &lambda;&mu;-calculus, establish some results about reductions in &lambda;&mu;-calculus and then investigate the relationships between the &lambda;&mu;-calculi. We finally introduce a type system for &iquest;&frac14;-calculus and prove subject reduction and strong normalization.
A framework for end-to-end simulation of high-performance computing systems
Authors: Wolfgang E. Denzel, Jian Li, Peter Walker, Yuho Jin
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

We present an end-to-end simulation framework that is capable of simulating High-Performance Computing (HPC) systems with hundreds of thousands of interconnected processors. The tool applies discrete event simulation and is driven by real-world application traces. We refer to it as MARS (MPI Application Replay network Simulator). It maintains reasonable simulation details of both the processors in general and specifically the interconnection network. Among other things, it features several network topologies, flexible routing schemes, arbitrary application task placement, point-to-point statistics collection, and data visualization. With a few case studies, we demonstrate the usefulness of this tool for assisting high-level system design as well as for performance projection and application tuning of future HPC systems.
Improving Energy Conservation Using Bulk Transmission over High-Power Radios in Sensor Networks
Authors: Cigdem Sengul, Mehedi Bakht, Albert F. Harris, Tarek Abdelzaher, Robin Kravets
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. This paper explores the potential for energy savings from adding a high-power, high-bandwidth radio to current sensor platforms. High-bandwidth radios consume more power but significantly reduce the time for transmissions. Consequently, they offer net savings in total communication energy when there is enough data to offset wake-up energy overhead. The analysis on energy characteristics of several IEEE 802.11 radios show that a feasible crossover point exists (in terms of data size) after which energy savings are possible. Based on this analysis, we present a bulk data transmission protocol for dual radio systems. The results of simulations and prototype implementation show significant energy savings at the expense of introducing acceptable delay.
Analysis of Students' Developed Programs at the Maturity Exams in Information Technologies
Authors: Jonas Blonskis, Valentina Dagienė
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

Two models of the maturity exams in information technologies have been developed in Lithuania. The first one is intended to evaluate the students' skills for using information and communication technologies (ICT). Another is focused on programming skills and is intended to promote the professional studies (informatics) in higher education. The first national exam in information technologies (programming) was launched in 2006. The exam consists of a set of tests (questions of IT and questions of programming) and two practical programming tasks. The goal of practical tasks is to create programs for given tasks. Developing programs is one of the most important parts of the exam and also one of the most difficult tasks for students. The paper deals with solutions of practical tasks --- students' developed programs during the national exams in information technologies (programming) in 2006 and 2007.
Discriminative Sequence Labeling by Z-Score Optimization
Authors: Elisa Ricci, Tijl Bie, Nello Cristianini
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed sequences, the task is to determine some parameter values such that the hidden labels can be correctly reconstructed from observations. Maximizing the Z-score appears to be a very good criterion to solve this problem both theoretically and empirically. We show that the Z-score is a convex function of the parameters and it can be efficiently computed with dynamic programming methods. In addition to that, the maximization step turns out to be solvable by a simple linear system of equations. Experiments on artificial and real data demonstrate that our approach is very competitive both in terms of speed and accuracy with respect to previous algorithms.
A Practical Single Refinement Method for B
Authors: Steve Dunne, Stacey Conroy
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We propose a single refinement method for B, inspired directly by Gardiner and Morgan's longstanding single complete rule for data refinement, and rendered practical by application of the current first author's recent first-order characterisation of refinement between monotonic computations.
System Considerations in the Design of the Am29000
Authors: Mike Johnson
Venue: IEEE Micro (1987)

The Am29000 blends the flexibility of microprogrammed processors with standard programming languages and operating systems in a second-generation RISC.
Repairing Decision-Theoretic Policies Using Goal-Oriented Planning
Authors: Christoph Mies, Alexander Ferrein, Gerhard Lakemeyer
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decision-theoretic policies become invalid due to small deviations during execution; and repairing might pay off compared to re-planning from scratch. Our policies are generated with Readylog, a derivative of Golog based on the situation calculus, which combines programming and planning for agents in dynamic domains. When an invalid policy is detected, the world state is transformed into a pddl description and a state-of-the-art pddl planner is deployed to calculate the repair plan.
A BBN Based Approach for Improving a Telecommunication Software Estimation Process
Authors: Stamatia Bibi, Ioannis Stamelos, George Gerolimos, Vangelis Kollias
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

This paper describes analytically a methodology for improving the estimation process of a small-medium telecommunication (TLC) company. All the steps required for the generation of estimates such as data collection, data transformation, estimation model extraction and finally exploitation of the knowledge explored are described and demonstrated as a case study involving a Greek TLC company. Based on this knowledge certain interventions are suggested in the current process of the company under study in order to include formal estimation procedures in each development phase.
Developing a model of in-service training by using multinomial logistic regression
Authors: Hung-Jen Yang, Jui-Chen Yu, Hsieh-Hua Yang
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In-service training is the bridge to connected learning with real world and is the trigger setting for professional growing. On-line technology is supporting our learning in many ways. Both credit and degree pursuing are formal developing program. There is a need to developing a model of in-service training for a certain professional group so can illustrate their group behavior. The purpose of this study was to present how to develop a model of in-service training by using multiple logistic regressions. Based on literature review, a theory model was first identified. An investigating was conducted to collect data to evaluate the designed model. The model consist two factors, one is the learners' age and the other is the learning styles. Two models were establish to explore both credit training and degree training courses. The resulted model then was further discussed to reveal in-depth of in-service needs.
Potential Assessment of an Ellipsoidal Neural Fuzzy Time Series Model for Freeway Traffic Prediction
Authors: Ping-Feng Pai, Kuo-Ping Lin, Ping-Teng Chang
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Forecasting of traffic flow is one of the most important approaches to control the capacity of highway network efficiently during peak flow periods. Therefore, many emerging methods have been designed to predict traffic flow of freeways. However, the ellipsoidal neural fuzzy model, originally developed for control and pattern recognition problems, was seldom used in forecasting traffic flow. The aim of this study is to investigate the potential of ellipsoidal neural fuzzy model in predicting highway traffic. Monthly traffic data at Tai-Shan tollgate of a freeway in Taiwan are collected to depict the performance of forecasting models. Three other neural network models, namely back-propagation neural networks (BPNN), and radial basis function neural networks (RBFNN) and general regression neural networks (GRNN) models are used to predict the same traffic data sets. Simulation results reveal that the ellipsoidal neural fuzzy time-series (ENFTS) model is superior to the other models. Therefore, the ENFTS is a feasible and promising approach in predicting freeway traffic.
Simulation program complex for studying motion control methods for autonomous underwater vehicles
Authors: V. A. Bobkov, Yu. S. Borisov, A. V. Inzartsev, S. V. Mel'Man
Venue: Programming and Computing Software (2008)

Development of a graphical simulation complex for studying motion control methods for autonomous underwater vehicles is discussed. Its structure and functioning scheme are presented. An approach to solving navigation problem and to 3D reconstruction of underwater environment from a given sequence of digital images is described. It is based on the use of an extended Kalman filter and original algorithm of dense 3D recovery of the environment points. Results of computational experiments and estimates of the efficiency of the approach are presented.
Kinetic model of a skid steered robot
Authors: Frantisek Solc, Jaroslav Sembera
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

The paper introduces mathematical models of a skid steered mobile platform for robotics. The platform consists of a rectangular steel construction with four wheels. Two banks of two drive wheels on each side are linked to two DC electrical motors via chain on sprocket drive and gearing. The two drive assemblies for the left and right banks are identical but they operate independently to steer the vehicle by skid. Wheels of the vehicle consist of rims and shallow tread pneumatic tyres. Dynamic and quasi-kinematic models are introduced.
Applying Model-Based Testing to HTML Rendering Engines --- A Case Study
Authors: Jens R. Calamé, Jaco Pol
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

Conformance testing is a widely used approach to validate a system correct w.r.t. its specification. This approach is mainly used for behavior-oriented systems. BAiT (Behavior Adaptation in Testing) is a conformance testing approach for data-intensive reactive systems. In this paper, we validate the applicability of BAiT to systems, which are not behavior-oriented (reactive) but document-centered.In particular, we apply BAiT to the test of the HTML rendering engine Gecko, which is used by Mozilla Firefox. In order to do so, we formally specify a part of the CSS box model in the specification language μCRL and implement a wrapper for the Gecko renderer. Then, we automatically generate test cases and run tests with BAiT in a controlled experiment in order to demonstrate our approach on the relevant part of Gecko.
Product Theorems Via Semidefinite Programming
Authors: Troy Lee, Rajat Mittal
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for restricted classes of games. Despite all these examples of product theorems--some going back nearly thirty years--it was only recently that Mittal and Szegedy began to develop a general theory to explain when and why semidefinite programs behave perfectly under product. This theory captured many examples in the literature, but there were also some notable exceptions which it could not explain--namely, an early parallel repetition result of Feige and Lovász, and a direct product theorem for the discrepancy method of communication complexity by Lee, Shraibman, and Špalek. We extend the theory of Mittal and Szegedy to explain these cases as well. Indeed, to the best of our knowledge, our theory captures all examples of semidefinite product theorems in the literature.
On Partial Correlations of Various Z4 Sequence Families
Authors: Parampalli Udaya, Serdar Boztaş
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Galois ring m ¿sequences were introduced in the late 1980s and early 1990s, and have near-optimal full periodic correlations. They are related to Z 4-linear codes, and are used in CDMA communications. We consider periodic correlation and obtain algebraic expressions of the first two partial period correlation moments of the sequences belonging to families A, B and C. These correlation moments have applications in synchronisation performance of CDMA systems using Galois ring sequences. The use of Association Schemes provides us with a new uniform technique for analyzing the sequence families A, B and C.
Minimum Common String Partition Parameterized
Authors: Peter Damaschke
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Minimum Common String Partition (MCSP) and related problems are of interest in, e.g., comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two strings with equal symbol content, the problem is to partition one string into k blocks, k as small as possible, and to permute them so as to obtain the other string. MCSP is NP-hard, and only approximation algorithms are known. Here we show that MCSP is fixed-parameter tractable in suitable parameters, so that practical instances can be efficiently solved to optimality.
Convergence Behavior of Competitive Repetition-Suppression Clustering
Authors: Davide Bacciu, Antonina Starita
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Competitive Repetition-suppression (CoRe) clustering is a bio-inspired learning algorithm that is capable of automatically determining the unknown cluster number from the data. In a previous work it has been shown how CoRe clustering represents a robust generalization of rival penalized competitive learning (RPCL) by means of M-estimators. This paper studies the convergence behavior of the CoRe model, based on the analysis proposed for the distance-sensitive RPCL (DSRPCL) algorithm. Furthermore, it is proposed a global minimum criterion for learning vector quantization in kernel space that is used to assess the correct location property for the CoRe algorithm.
Autonomous security for autonomous systems
Authors: Josh Karlin, Stephanie Forrest, Jennifer Rexford
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The Internet's interdomain routing protocol, BGP, supports a complex network of Autonomous Systems which is vulnerable to a number of potentially crippling attacks. Several promising cryptography-based solutions have been proposed, but their adoption has been hindered by the need for community consensus, cooperation in a public key infrastructure (PKI), and a common security protocol. Rather than force centralized control in a distributed network, this paper examines distributed security methods that are amenable to incremental deployment. Typically, such methods are less comprehensive and not provably secure. The paper describes a distributed anomaly detection and response system that provides comparable security to cryptographic methods and has a more plausible adoption path. Specifically, the paper makes the following contributions: (1) it describes pretty good BGP (PGBGP), whose security is comparable (but not identical) to secure origin BGP; (2) it gives theoretical proofs on the effectiveness of PGBGP; (3) it reports simulation experiments on a snapshot of the Internet topology annotated with the business relationships between neighboring networks; (4) it quantifies the impact that known exploits could have on the Internet; and (5) it determines the minimum number of ASes that would have to adopt a distributed security solution to provide global protection against these exploits. Taken together these results explore the boundary between what can be achieved with provably secure centralized security mechanisms for BGP and more distributed approaches that respect the autonomous nature of the Internet.