Algorithms

Self-stabilizing Algorithms in DAG Structured Networks

by Sebastien Tixeuil

Misyurov D.A. Dialectical formulas based on the binary notation as the development formulas // Credo New. 2012. №2

by Dmitry Misyurov

The article suggests dialectical formulas based on the binary notation as the development formulas: formula with... more The article suggests dialectical formulas based on the binary notation as the development formulas: formula with dominant and the non-dominant elements; universal formula; formula with symbolic weight of elements; tautological formula. For example, it suggests an opportunity to use the dialectical formulas for modeling and artificial intelligence creation, etc.

Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem

by Jorge A. Ruiz-Vanoye

Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra, Felipe Cocón, Andrés Soto, Ma. De los Ángeles Buenabad Arias, Gustavo Verduzco-Reyes, Roberto Alberto-Lira. Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem. International Journal of Combinatorial Optimization Problems and Informatics, Vol. 3, No. 3, pp. 104-123, Sep-Dec (2012). ISSN:2007-1558.

In this paper, we show a survey of meta-heuristics algorithms based on grouping of animals by social behavior for the... more In this paper, we show a survey of meta-heuristics algorithms based on grouping of animals by social behavior for the Traveling Salesman Problem, and propose a new classification of meta-heuristics algorithms (not based on swarm intelligence theory) based on grouping of animals: swarm algorithms, schools algorithms, flocks algorithms and herds algorithms: a) The swarm algorithms (inspired by the insect swarms and zooplankton swarms): Ant Colony Optimization algorithm – ACO (inspired by the research on the behavior of ant colonies), Firefly Algorithm (based on fireflies), Marriage in Honey Bees Optimization Algorithm - MBO algorithm (inspired by the Honey Bee), Wasp Swarm Algorithm (inspired on the Parasitic wasps), Termite Algorithm (inspired by the termites), Mosquito swarms Algorithm – MSA (inspired by mosquito swarms), zooplankton swarms Algorithm - ZSA (inspired by the Zooplankton) and Bumblebees Swarms Algorithm – BSA (inspired by Bumblebees). b) The school algorithms (inspired by the fish schools): The Particle Swarm Optimization algorithm – PSO (inspired by social behavior and movement dynamics of fish or schooling). c) The flock algorithms (inspired by the bird flocks): the flocking algorithm, and the Particle Swarm Optimization algorithm (inspired on the dynamics of the birds), d) The herd and pack Algorithms (inspired by the mammal herds and packs): bat algorithm (inspired by bat), wolf pack search algorithm - WPS (inspired by wolfs), Rats herds algorithm - RATHA (inspired by Rats), Dolphins Herds Algorithm - DHA (inspired by Dolphins) and the feral-dogs herd algorithm - FDHA (inspired by feral-dogs herd).

Semantify del.icio.us: automatically turn your tags into senses

by Francesco Ronzano

Social Data on The Web Workshop at the 7th International Semantic Web Conference (ISWC), 2008

At present tagging is experimenting a great di usion as the most adopted way to collaboratively classify resources... more At present tagging is experimenting a great diusion as the most adopted way to collaboratively classify resources over the Web. In this paper, after a detailed analysis of the attempts made to improve the organization and structure of tagging systems as well as the usefulness of this kind of social data, we propose and evaluate the Tag Disambiguation Algorithm, mining del.icio.us data. It allows to easily semantify the tags of the users of a tagging service: it automatically nds out for each tag the related concept of Wikipedia in order to describe Web resources through senses. On the basis of a set of evaluation tests, we analyze all the advantages of our sense-based way of tagging, proposing new methods to keep the set of users tags more consistent or to classify the tagged resources on the basis of Wikipedia categories, YAGO classes or Wordnet synsets. We discuss also how our semanitied social tagging data are strongly linked to DBPedia and the datasets of the Linked Data community.

An Efficient Algorithm for RFID Reader Positioning for Coverage of Irregularly-Shaped Areas

by Shrisha Rao

By Nandakumar Mysore, Prakash Nenavat, Rasmi S. Unnithan, Ravi Mulukutla, and Shrisha Rao. 5th Annual IEEE Conference on Automation Science and Engineering (IEEE CASE 2009), Bangalore, India, August, 2009.

Radio frequency identification (RFID) is a proven automation technology finding application in various commercial... more Radio frequency identification (RFID) is a proven automation technology finding application in various commercial sectors. These applications involve locating all tagged items automatically using available RFID readers. RFID readers are of two types, fixed and mobile. The number of readers required to cover an area depends on factors such as the properties of the reader, tag and the shape of the area to be covered.

This paper presents an algorithm to find the minimum number of fixed RFID readers required for complete coverage of an area of irregular shape. This approach, which applies the Graham’s scan algorithm of computational geometry, can be used for buildings, warehouses, etc., of any shape. The algorithm determines the required number of readers by considering the interrogation range of the reader. A methodology of forming the convex hull/polygon covering the irregular area, and subsequently placing the readers at specified locations within the polygon based on the properties of the reader is discussed here.

A sample tiling of an irregularly shaped floor space is shown as an example, and applications of the tiling algorithm are indicated by giving verbal sketches of automation systems for a food court, a parking lot, and an airport baggage tracking system that can make use of it.

Cluster editing problem for points on the real line: A polynomial time algorithm

by Bassel Mannaa

Minimizing cycle time in single machine scheduling with start time-dependent processing times

by Mehdi Hosseinabadi Farahani

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
2012, DOI: 10.1007/s00170-012-4116-1

This paper considers the single machine scheduling problem with a new version of time-dependent processing times. The... more This paper considers the single machine scheduling problem with a new version of time-dependent processing times. The processing time of a job is defined as a piecewise linear function of its start time. It is preferred that the processing of each job be started at a specific time which means that processing the job before or after that time implies additional effort to accomplish the job. The job-processing time is a nonmonotonic function of its start time. The increasing rate of processing times is job independent and the objective is to minimize the cycle time. We show that the optimal schedule is V shaped and propose an optimal polynomial time algorithm for the problem.

Can we really dissociate the computational and algorithm-level theories of human memory?

by Guy Tiberghien

An Extensible Digital Ink Segmentation and Classification Framework for Natural Notetaking

by Beat Signer

Adriana Ispas, Beat Signer and Moira C. Norrie, Proceedings of EICS 2011, ACM SIGCHI Symposium on Engineering Interactive Computing Systems, Pisa, Italy, June 2011

With the emergence of digital pen and paper technologies, we have witnessed an increasing number of enhanced... more With the emergence of digital pen and paper technologies, we have witnessed an increasing number of enhanced paper-digital notetaking solutions. However, the natural notetaking process includes a variety of individual work practices that complicate the automatic processing of paper notes and require user intervention for the classification of digital ink data. We present an extensible digital ink processing framework that simplifies the classification of digital ink data in natural notetaking applications. Our solution deals with the manual as well as automatic ink data segmentation and classification based on Delaunay triangulation and a strongest link algorithm. We further highlight how our solution can be extended with new digital ink classifiers and describe a paper-digital reminder application that has been realised based on the presented digital ink processing framework.

The Normalized Similarity Metric and Its Applications

by Shihyen Chen

An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity

by Shihyen Chen

Steepest Descent Least Mean Square Algorithm (LMS) Based Adaptive Filter for Noise Cancellation in Speech Signals

by Udayanto Dwi Atmojo

Presented in 6th SEAMS GMU International Conference on Mathematics and Its Applications 2011 in Yogyakarta, Indonesia, July 12-15, 2011

This paper considers Least Mean Square (LMS) algorithm to subsequently modify adaptive filter weights. The... more This paper considers Least Mean Square (LMS) algorithm to subsequently modify adaptive filter weights. The corresponding filter is used to cancel noise caused by diesel engine interference contained in speech signal. The design is then implemented on LabView software. The simulation shows that the design can reduce interference, thus increasing signal to noise ratio (SNR) of the speech signal by more than 100%

A Variable Neighborhood Search Algorithm for Composing First Species Counterpoint Musical Fragments

by Dorien Herremans

Working Paper - University of Antwerp, co-author: K. Sörensen

In this paper a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments of... more In this paper a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments of arbitrary length consisting of a cantus firmus and a first species counterpoint melody. The objective function of the algorithm is based on a quantification of existing counterpoint rules. The VNS algorithm developed in this paper is a local search algorithm that starts from a randomly generated melody and improves it by changing one or two notes at a time. A thorough parametric analysis of the VNS reveals the significance of the algorithms parameters on the quality of the composed fragment, as well as their optimal settings. The VNS algorithm has been implemented in a user-friendly software environment for composition, called Optimuse. Optimuse allows a user to specify a number of characteristics such as length, key, and mode. Based on this information, Optimuse composes both a cantus firmus and a first species counterpoint melody. Alternatively, the user may specify a cantus firmus, and let Optimuse compose only an accompanying first species counterpoint melody.

Time After Time: Short-circuiting The Emotional Distance Between Algorithm And Human Improvisors

by David Plans

Direct algorithms for checking consistency and making inferences from conditional probability assessments

by Renato Pelessoni

Co-authored with Peter Walley and Paolo Vicig. Published in the Journal of Statistical Planning and Inference, 126 (1), 119-151, 2004. Preliminary version attached.

We solve two fundamental problems of probabilistic reasoning: given finitely many conditional probability assessments,... more We solve two fundamental problems of probabilistic reasoning: given finitely many conditional probability assessments, how to determine whether the assessments are mutually consistent, and how to determine what they imply about the conditional probabilities of other events? These problems were posed in 1854 by George Boole, who gave a partial solution using algebraic methods. The two problems are fundamental in applications of the Bayesian theory of probability; Bruno de Finetti solved the second problem for the special case of unconditional probability assessments in what he called ‘the fundamental theorem of probability’. We give examples to show that previous attempts to solve the two problems, using probabilistic logic and similar methods, can produce incorrect answers. Using ideas from the theory of imprecise probability, we show that the general problems have simple, direct solutions which can be implemented using linear programming algorithms. Unlike earlier proposals, our methods are formulated directly in terms of the assessments, without introducing unknown probabilities. Our methods work when any of the conditioning events may have probability zero, and they work when the assessments include imprecise (upper and lower) probabilities or previsions. The main methodological contribution of the paper is to provide general algorithms for making inferences from any finite collection of (possibly imprecise) conditional probabilities.

Algorithmically detecting the bridge number of hyperbolic knots

by Alexander Coward

We show that, up to ambient isotopy, the exterior of a hyperbolic knot in the 3-sphere admits finitely many bridge... more We show that, up to ambient isotopy, the exterior of a hyperbolic knot in the 3-sphere admits finitely many bridge punctured 2-spheres of given Euler characteristic and that there is an algorithm to find all of these surfaces. This yields an algorithm to detect bridge number for hyperbolic knots.

Musical Mood-Based Mobile Gaming.

by Karen Collins

A. Hodge, K. Collins and P. Taillon. Musical Mood-Based Mobile Gaming. International Games Innovation Conference. IEEE Consumer Electronics Society. San Diego, CA. November 2011.

Implementation of an Efficient Algorithm

by Jca Ksrce

K.Jayasudha and Dr.C.Chandrasekar
Keywords : Aprior , AprioriTid, item set , partition
Volume 1 Issue 1 - Jan - Mar 2008
Published in Journal of Computer Applications
http://www.jcaksrce.org

The Four-Color Map Theorem: "Kempe’s Fallacious Proof Repaired"

by Ibrahim Cahit

Further results can be found in the first 6 pages of my paper at arXiv :
http://arxiv.org/abs/0903.4108

A new non-computer direct algorithmic proof for the famous four color theorem based on new concept spiral-chain... more A new non-computer direct algorithmic proof for the famous four color theorem based on new concept spiral-chain coloring of maximal planar graphs has been proposed by the author in 2004 [6],[13]. Historical fallacious inductive proof of Kempe have been re-considered by many mathematicians whether it could be repaired. All attemps so far have been either modification of Kempe color switching argument or trying to show that random second-time coloring would not produce an impasse. In this
note we have shown that when Kempe’s argument fails by the trap of the incomplete four-coloring there is always a simple re-coloring of the nodes of a planar graph so that the undecided node colored properly. Hence our method may be considerd as an completion of fallacious Kempe’s inductive proof. Interesting enough, when we have resolved the impasse in the four coloring of the graphs, the solution end up again with two spirals (double-spirals) Kempe chains that cover all of the nodes.

Implementation of an Efficient Algorithm

by Jca Ksrce

K.Jayasudha and Dr.C.Chandrasekar
Keywords : Aprior , AprioriTid, item set , partition
Volume 1 Issue 1 - Jan - Mar 2008
Published in Journal of Computer Applications
http://www.jcaksrce.org