This paper presents a novel method for fitting egg-shapes to discrete sets of boundary points. Egg-shapes extend ellipses by assigning a positive weight to one of the two focal points. Fitting of egg-shapes thus requires optimization of 6 ...

Noisy images are a bottleneck to solve the image processing problems. The present paper aims to classify images as different types of foggy and blurry images. A feature based classifier called FB classifier has been proposed. Given an image the classifier ...

Given a graph, eccentricity measures the distance from each node to its farthest node. Eccentricity indicates the centrality of each node and collectively encodes fundamental graph properties: the radius and the diameter --- the minimum and maximum ...

The present paper represents the analytical calculation and computer simulation of motion of nanosatellite that in polar system of coordinates are structured. In particular, the paper asks whether possible to simulate the problem gets the initial orbital ...

In this paper we investigate the Minimum Eccentricity Isometric Cycle (MEIC) problem. Given a graph, this problem consists in finding an isometric cycle with smallest possible eccentricity k. We show that this problem is NP-Hard and we propose a 3-...

The eccentricity of a node in a graph G(V,E) is its maximal shortest-path distance to any other node. Shun (KDD 2015) suggested a simple heuristic for computing all eccentricities in an input graph, based on two-phase parallel BFS from a small sample of ...

The article studies how movement stability of the tractor unit with a semi-mounted two-axle trailer is influenced by some kinematic parameters, in particular, by a change in the ratio between eccentricity (displacement of the platform support point of ...

We introduce a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In this model, each link has a unit price, and each agent tries to minimize its cost, which is either its eccentricity or its ...

In this paper we propose a highly parallel GPU-based bounding algorithm for computing the exact diameter of large real-world sparse graphs. The diameter is defined as the length of the longest shortest path between vertices in the graph, and serves as a ...

We exploit the falloff of acuity in the visual periphery to accelerate graphics computation by a factor of 5-6 on a desktop HD display (1920x1080). Our method tracks the user's gaze point and renders three image layers around it at progressively higher ...

We present an algorithm to compute All Pairs Shortest Paths (APSP) of a network in a distributed way. The model of distributed computation we consider is the message passing model: in each synchronous round, every node can transmit a different (but ...

This paper deals with eccentricity fault detection in a induction motor via artificial neural networks. Discriminative features are extracted from magnitudefrequency plot of line current spectra at characteristic frequencies. Based on this data, ...

A central cycle problem requires a cycle that is reasonably short and keeps the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low. The objective may be to minimize maximum distance or cycle length. Most ...

We present a logically detailed case-study of explanation and prediction in Newtonian mechanics. The case in question is that of a planet's elliptical orbit in the Sun's gravitational field. Care is taken to distinguish the respective contributions of ...

In view of the special working conditions and serious external interference of forging hydraulic press, the limitation of traditional method for detecting moving beam eccentricity is analyzed. According to the essential requirements of the detecting ...

Abstract—Nowadays, locating several satellites in a narrowstation-keeping window is a good way to make advantage of the geostationary orbit source problem. To avoid collision,drawbacks of close approach and mutual interferences, a method of multi-...

Visual attention is one of the important phenomena in biological vision which can be followed to achieve more efficiency, intelligence, and robustness in artificial vision systems. This paper investigates a region-based approach that performs pixel ...

We present a novel image indexing and retrieval system based on object contour description. Extended curvature scale space (CSS) descriptors composed of both local and global features are used to represent and index concave and convex object shapes. ...

We present an indexing and retrieval system of historic art images based on fuzzy shape similarity. The system is composed of three principal components: object annotation, object shape indexing, and query/retrieval. The object annotation in database ...

We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSET, respectively, and provide efficient algorithms for their solution. The ...