ppxscal/embedding_network huggingface dataset:
Towards unbiased benchmarking of evolutionary and hybrid algorithms for real-valued optimisation
Authors: Cara Macnish
Venue: Connection Science (2007)

Randomised population-based algorithms, such as evolutionary, genetic and swarm-based algorithms, and their hybrids with traditional search techniques, have proven successful and robust on many difficult real-valued optimisation problems. This success, along with the readily applicable nature of these techniques, has led to an explosion in the number of algorithms and variants proposed. In order for the field to advance it is necessary to carry out effective comparative evaluations of these algorithms, and thereby better identify and understand those properties that lead to better performance. This paper discusses the difficulties of providing benchmarking of evolutionary and allied algorithms that is both meaningful and logistically viable. To be meaningful the benchmarking test must give a fair comparison that is free, as far as possible, from biases that favour one style of algorithm over another. To be logistically viable it must overcome the need for pairwise comparison between all the proposed algorithms. To address the first problem, we begin by attempting to identify the biases that are inherent in commonly used benchmarking functions. We then describe a suite of test problems, generated recursively as self-similar or fractal landscapes, designed to overcome these biases. For the second, we describe a server that uses web services to allow researchers to 'plug in' their algorithms, running on their local machines, to a central benchmarking repository.
Estimation of the flashover voltage on insulators using artificial neural networks
Authors: A. A. Gialketsi, V. T. Kontargyri, I. F. Gonos, I. A. Stathopulos
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This work attempts to elucidate the potentials of Artificial Neural Networks (ANNs) in high voltage applications and especially to estimate the flashover voltage on polluted insulators, using an ANN which is trained with the error backpropagation algorithm. For this purpose, an ANN was constructed in MATLAB and has been trained with several MATLAB training functions, while tests regarding the number of neurons, the number of epochs and the value of learning rate have taken place, in order to find which net architecture and which value of the other parameters give the best result. Some of the data had resulted from former experiments, while some other had resulted by applying a mathematical type based on a simplified model for the calculation of the flashover voltage.
Towards a Formal Verification of an Authentication Protocol Using Non-Monotonic Logic
Authors: Manik Lal Das, V. Lakshmi Narasimhan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Authentication is one of the important security properties required to identify the communicating party or to validate the received document. Several authentication techniques with many flavors have been proposed; however, most of them lack a formal security proof. In this paper, we present a two-factor authentication protocol and followed by a key establishment mechanism using only hash function. We analyze and verify the security of the proposed protocol using non-monotonic logic.
A new beginning, a fond farewell
Authors: Stuart I. Feldman
Venue: Communications of the ACM (2008)

I am writing this column in my last month as President of ACM. It's been a great opportunity to support the Association's many successful programs and to expand and firmly establish new directions. Much has been accomplished, much remains to be done.
Software Engineering Practice in Computer Science Courses
Authors: Shoma Chatterjee
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

This paper seeks to combine a traditional computer science course with software engineering process. A computer science course such as Computer Graphics, Digital Image Processing, Compiler or Operating Systems gives a chance to students working in a group to write a realistic large project of almost 3000 lines and make it function correctly. The course involves a team programming project. The software engineering lifecycle addresses issues on design, coding, documenting, unit testing and integration testing. Innovative and active learning based educational methods are adopted for teaching such a course.
Search for Additive Nonlinear Time Series Causal Models
Authors: Tianjiao Chu, Clark Glymour
Venue: The Journal of Machine Learning Research (2008)

Pointwise consistent, feasible procedures for estimating contemporaneous linear causal structure from time series data have been developed using multiple conditional independence tests, but no such procedures are available for non-linear systems. We describe a feasible procedure for learning a class of non-linear time series structures, which we call additive non-linear time series. We show that for data generated from stationary models of this type, two classes of conditional independence relations among time series variables and their lags can be tested efficiently and consistently using tests based on additive model regression. Combining results of statistical tests for these two classes of conditional independence relations and the temporal structure of time series data, a new consistent model specification procedure is able to extract relatively detailed causal information. We investigate the finite sample behavior of the procedure through simulation, and illustrate the application of this method through analysis of the possible causal connections among four ocean indices. Several variants of the procedure are also discussed.
Quantitative Evaluation of Common Subexpression Elimination on Queue Machines
Authors: Arquimedes Canedo, Masahiro Sowa, Ben A. Abderazek
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Queue computation model is a novel alternative for high performance architectures. Compiling for queue machines requires a different approach than compiling for traditional architectures. We have solved the problem of generating correct code with the queue compiler infrastructure. In this paper we introduce some problems encountered when optimizing code for queue machines. Common-subexpression elimination (CSE) is a widely used optimization to improve execution time. This paper makes a quantitative evaluation of how this optimization affects the characteristics of queue programs. We have found that in average, 28% of instructions are eliminated, and 15% of the critical path is reduced. We determine how enlarging the scope of compilation from expressions to basic blocks affects the distribution of offsetted instructions.
A two-stage methodology for sequence classification based on sequential pattern mining and optimization
Authors: Themis P. Exarchos, Markos G. Tsipouras, Costas Papaloukas, Dimitrios I. Fotiadis
Venue: Data Knowledge Engineering (2008)

We present a methodology for sequence classification, which employs sequential pattern mining and optimization, in a two-stage process. In the first stage, a sequence classification model is defined, based on a set of sequential patterns and two sets of weights are introduced, one for the patterns and one for classes. In the second stage, an optimization technique is employed to estimate the weight values and achieve optimal classification accuracy. Extensive evaluation of the methodology is carried out, by varying the number of sequences, the number of patterns and the number of classes and it is compared with similar sequence classification approaches.
High-speed codebook design by the multipath competitive learning on a systolic memory architecture
Authors: Kentaro Sano, Chiaki Takagi, Kenichi Suzuki, Tadao Nakamura
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

So far, we have proposed a dedicated processor based on a systolic memory architecture to accelerate competitive learning (CL) for optimal codebook design. While this processor achieves high-speed codebook design, it has essential problems: limitation of hardware resources and lack in flexibility of codebook size. To solve these problems, we present a multipath CL algorithm that allows the processor to flexibly handle the various size of a codebook. The multipath CL on the FPGA-based prototype of the processor could design codebooks with comparable MSEs to the software simulation while the prototype processor achieved 2000 times faster processing speed than a general-purpose processor.
Fast scheduling on P2P streaming overlay
Authors: Jiaming Li, Chai Kiat Yeo, Bu Sung Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Peer-to-Peer architecture is widely applied in large scale distributed applications. For streaming applications, latency is one of the most important metrics which affect user experience. However, network dynamics such as congestion and bandwidth fluctuation cause instability in the peer overlay and increase peer latency. To avoid wasting network resources on overlay redirection, we introduce our scheduling algorithm [6] into the peers on the overlay to distribute most important packets to the descendant peers first. We also alter Maximum Bandwidth Sum Tree overlay construction scheme [4] to cater for streaming application and investigate our scheduling algorithm in such an environment. Performance results show the improvement in terms of latency and data arrival ratio before the expiration time.
Using alphametics in introductory programming classes
Authors: Charles Ashbacher
Venue: Journal of Computing Sciences in Colleges (2008)

An alphametic is an arithmetic problem where the digits are replaced by letters. Furthermore, after the digits are replaced, the problem should contain a message. For example, the following problem appeared in volume 32(2) of Journal of Recreational Mathematics STEEL + BELTED = RADIALS and has the solution 87336 + 936732 = 1024068. The problem is that you are given the alphametic in textual form and you are to determine the digits. This type of problem lends itself to solution using a computer program that contains a series of properly nested loops and ifs. I have used alphametics as a basic problem in my introductory programming classes many times and have found them to be an excellent programming assignment. The purpose of this talk is to demonstrate the fundamental approach to a computer solution of this class of problem.
MarSelHR: A Haplotype Reconstruction System Using Linkage Disequilibrium
Authors: Sang-Soo Yeo, Sung Kwon Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We propose MarSeIHR, a haplotype reconstruction system, which is a combination of LD based block partitioning with Clark's algorithm. MarSelHR uses less CPU processing time than other haplotype reconstruction systems, and makes possible large-scale data processing using less memory through block unit processing. Furthermore, MarSelHR involves biological meaning through LD basedpartitioning and is able to result in more precise inference.
Fish Schooling Behavior Simulator for Cyber Aquarium
Authors: Eung Kon Kim, Jong Chan Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

As computer graphics are developing and digital films and animations are growing, we can meet cyber characters easily. Crowd behavior scenes in cyber underwater are used in game and entertainment industries. We should develop the techniques of 3D modeling and animation to create the cyber underwater using these cyber characters. Fish schooling or group moving in cyber underwater is a part of beautiful and familiar ecosystem. It is not so easy to present the behavior of fish crowd naturally as a computer animation. Thanks to development of computer graphics in entertainment industry, the numbers of digital films and animations is increased and the scenes of numerous crowd are shown to us. Though there are many studies on the techniques to process the crowd behavior effectively and the developments of crowd behavioral systems, there is not enough study on the development for an efficient crowd behavioral simulator. In this paper, we present a realistic and efficient Fish Schooling Behavior Simulator to create the contents of cyber underwater environment, which shows each type of fish behavior in cyber underwater smartly, and which generates the animating the behavior automatically, reducing the time and cost.
A generalisation of the CKLHC cryptosystem
Authors: Milton Chowdhury
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The main purpose of this paper is to present a new group theoretic cryptosystem which is a generalisation of the CKLHC cryptosystem hence our cryptosystem is for some parameters known to be secure. We suggest a partial implementation of our cryptosystem in braid groups. The security of our new cryptosystem is based on new generalisations of known hard problems. Compared to the CKLHC cryptosystem in our cryptosystem there is more control of the public parameters and for certain parameters it is more efficient with group multiplications.
Software system analysis with graph homomorphisms
Authors: C. V. Karapoulios, G. K. Adam, S. N. Xanthakis
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper we present a graph based formalism for the analysis and the behavioral envisioning of software based systems. We first try to identify and solve the main limitations of dynamic analysis approaches. Follow some results of a qualitative abstraction tool and some simple application examples. We then introduce the concept of a system qualitative graph, the role of graph homomorphisms for modeling a software, and more generally a system, as a continuous phase transition map operating on an abstract data space. We finish with the presentation of the underlying mathematical framework and some properties of graph homomorphism invariants.
Quantifying the benefits of immersion for procedural training
Authors: Ajith Sowndararajan, Rongrong Wang, Doug A. Bowman
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

Training is one of the most important and widely-used applications of immersive virtual reality (VR). Research has shown that immersive virtual environments (VEs) are beneficial for training motor activities and spatial activities, but it is unclear whether immersive VEs are beneficial for purely mental activities, such as memorizing a procedure. In this paper, we present a between-subjects experiment comparing two levels of immersion in a procedural training task. For the higher level of immersion, we used a large L-shaped projection display. We used a typical laptop display for the lower level of immersion. We asked participants to memorize two procedures: one simple and the other complex. We found that the higher level of immersion resulted in significantly faster task performance and reduced error for the complex procedure. We hypothesize that the higher level of immersion helped users to memorize the complex procedure by providing enhanced spatial cues, leading to the development of an accurate mental map that could be used as a memory aid.
On the efficiency of Pollard's rho method for discrete logarithms
Authors: Shi Bai, Richard P. Brent
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Many improvements have been proposed, while few evaluation results and efficiency suggestions have been reported. This paper is devoted to a detailed study of the efficiency issues in Pollard's rho method. We describe an empirical performance analysis of several widely applied algorithms. This should provide a better combination of algorithms and a good choice of parameters for Pollard's rho method.
Bayes optimal classification for decision trees
Authors: Siegfried Nijssen
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We present an algorithm for exact Bayes optimal classification from a hypothesis space of decision trees satisfying leaf constraints. Our contribution is that we reduce this classification problem to the problem of finding a rule-based classifier with appropriate weights. We show that these rules and weights can be computed in linear time from the output of a modified frequent itemset mining algorithm, which means that we can compute the classifier in practice, despite the exponential worst-case complexity. In experiments we compare the Bayes optimal predictions with those of the maximum a posteriori hypothesis.
Summarization of compressed text images: an experience on Indic script documents
Authors: Utpal Garain
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Automatic summarization of JBIG2 coded textual images is discussed. Compressed images are partially decompressed to compute relevant features. The feature extraction method is free from using any character recognition module. Summary sentences are ranked. Experiment considers documents in Indic scripts that lack in having any efficient OCR systems. Script independent aspect of the approach is highlighted through use of two most popular Indic scripts. Sentence selection efficiency of about 61% is achieved when judged against man-made summarization. A nonparametric (distribution-free) rank statistic shows a correlation coefficient of 0.33 as a measure of the (minimum) strength of the associations between sentence ranking by machine and human.
On some questions regarding k -regular and k -context-free sequences
Authors: Yossi Moshe
Venue: Theoretical Computer Science (2008)

We answer two questions of Allouche and Shallit regarding k-regular sequences and k-context-free sequences. One of these has been solved independently in another way by Bell. We also provide a partial solution to another question of Allouche and Shallit regarding the subword complexity of k-context-free sequences.
E-matching for Fun and Profit
Authors: Michał Moskal, Jakub Łopuszański, Joseph R. Kiniry
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient algorithms for solving the E-matching problem are presented and compared to a well-known algorithm described in the literature.
A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
Authors: Chun-Ming Tang, Jin-Bao Jian
Venue: Journal of Computational and Applied Mathematics (2008)

Based on an augmented Lagrangian line search function, a sequential quadratically constrained quadratic programming method is proposed for solving nonlinearly constrained optimization problems. Compared to quadratic programming solved in the traditional SQP methods, a convex quadratically constrained quadratic programming is solved here to obtain a search direction, and the Maratos effect does not occur without any other corrections. The ''active set'' strategy used in this subproblem can avoid recalculating the unnecessary gradients and (approximate) Hessian matrices of the constraints. Under certain assumptions, the proposed method is proved to be globally, superlinearly, and quadratically convergent. As an extension, general problems with inequality and equality constraints as well as nonmonotone line search are also considered.
Proceedings of the 3rd international workshop on Automation of software test
Venue: International Conference on Software Engineering (2008)

Welcome to AST 2008 -- The Third International Workshop on Automation of Software Test which is to be held in conjunction with The 30th International Conference on Software Engineering (ICSE.08) in Leipzig, Germany on May 11, 2008. In software development practice, as much as 50% of the total cost is spent on testing to ensure its quality. To reduce such cost, it is imperative to have a solution to automate the testing process. This year we have a special theme on "Model-Based Testing for Test Automation." The objective is to narrow the gap between the theory and practice of this important topic. The workshop provides an opportunity for academic researchers and industry participants to exchange ideas and experiences, understand the challenges, explore possible solutions, and discuss future directions. It not only allows the academic community to understand areas vital to the software industry, but it also gives practitioners an opportunity to express their needs. We received 24 submissions from 11 countries. Each paper was carefully evaluated by three reviewers. These reviews were then used for selecting papers to be presented at the conference. Nine papers (37.5% of submissions) were accepted as regular papers. In addition, we have also accepted six short papers. These papers cover a broad spectrum including model-based, risk-based, and requirement-based test generation and specification, conformance testing, coverage testing and measurement, test minimization, and simulation. Authors of selected best papers presented at the workshop will be invited to submit extended and revised versions of their papers for possible publication in a special issue of the Journal of Information and Software Technology.
A New Frame of Knowledge Discovery
Authors: Tian Lan, Runtong Zhang, Hong Dai
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper discussed the development trend of knowledge discovery based on the summary and analysis of the theory of knowledge discovery in database and the actuality of technological method, and introduced the mechanism of total data mining process, researching in expansible structure and algorithm of KLID, and serially developing of software, according to the theory of double base cooperation proposed by author .
Predictive design space exploration using genetically programmed response surfaces
Authors: Henry Cook, Kevin Skadron
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Exponential increases in architectural design complexity threaten to make traditional processor design optimization techniques intractable. Genetically programmed response surfaces (GPRS) address this challenge by transforming the optimization process from a lengthy series of detailed simulations into the tractable formulation and rapid evaluation of a predictive model. We validate GPRS methodology on realistic processor design spaces and compare it to recently proposed techniques for predictive microarchitectural design space exploration.
Predicting when browsing context is relevant to search
Authors: Mandar Rahurkar, Silviu Cucerzan
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We investigate a representative case of sudden information need change of Web users. By analyzing search engine query logs, we show that the majority of queries submitted by users after browsing documents in the news domain are related to the most recently browsed document. We investigate ways of identifying whether a query is a good candidate for contextualization conditioned on the most recently browsed document by a user. We build a successful classifier for this task, which achieves 96% precision at 90% recall.