Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...

This paper compares different algorithms for the segmentation of skin lesions in dermoscopic images. The basic segmentation algorithms compared are Thresholding techniques (Global and Adaptive), Region based techniques (K-means, Fuzzy C means, Expectation Maximization and Statistical Region Merging), Contour models (Active Contour Model and Chan Vese Model) and Spectral Clustering. Accuracy, se...

The concept of attraction has been shown to play a basic role in the synthesis of supervisors for stabilizing discrete-event processes. In this paper we define and investigate optimal attraction optimal in the sense that the cost (or distance) of the convergence path is as small as possible with respect to some distance measure. We find conditions for the existence of supervisors achieving opti...

This paper compares different algorithms for the segmentation of skin lesions in dermoscopic images. The basic segmentation algorithms compared are Thresholding techniques (Global and Adaptive), Region based techniques (K-means, Fuzzy C means, Expectation Maximization and Statistical Region Merging), Contour models (Active Contour Model and Chan Vese Model) and Spectral Clustering. Accuracy, se...

A recent technique used in falsification methods for hybrid systems relies on distance-based heuristics for guiding the search towards a goal state. The question is whether the technique can be carried over to reachability analyses that use regions as their basic data structure. In this paper, we introduce a box-based distance measure between regions. We present an algorithm that, given two reg...

We investigated how path integration performance can be influenced by five basic path properties in a Virtual Reality Cube. Participants performed pathcompletion tasks in hallway paths with up to 12 segments. Distance information was visual, whereas turning angles were specified through vision and body senses. The ridge regression analyses suggested that path integration was affected by the num...

Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. This paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. The proposed technique is deployed in wel...

The recent advancements in the field of the information and communication technology resulted in a revolution comparable to the industrial revolution. The basis of this revolution is the information and the value it has as the pure expression of human knowledge. The technological advancements offer us the ability to process, store, retrieve and transmit information in multiple formats (text, so...

We introduce the telescopic relative entropy (TRE), which is a new regularisation of the relative entropy related to smoothing, to overcome the problem that the relative entropy between pure states is either zero or infinity and therefore useless as a distance measure in this case. We study basic properties of this quantity, and find interesting relationships between the TRE and the trace norm ...

The relations between two distance matrices on the same nite set are analyzed via metric scaling by correlating principal axis Some applications are given and illustrated with examples Introduction Dissimilarities similarities and distances are fundamental concepts in mul tidimensional scaling and related topics Euclidean and Mahalanobis dis tance also play a basic role in techniques such as re...