1,194 research outputs found
Rigid ball-polyhedra in Euclidean 3-space
A ball-polyhedron is the intersection with non-empty interior of finitely
many (closed) unit balls in Euclidean 3-space. One can represent the boundary
of a ball-polyhedron as the union of vertices, edges, and faces defined in a
rather natural way. A ball-polyhedron is called a simple ball-polyhedron if at
every vertex exactly three edges meet. Moreover, a ball-polyhedron is called a
standard ball-polyhedron if its vertex-edge-face structure is a lattice (with
respect to containment). To each edge of a ball-polyhedron one can assign an
inner dihedral angle and say that the given ball-polyhedron is locally rigid
with respect to its inner dihedral angles if the vertex-edge-face structure of
the ball-polyhedron and its inner dihedral angles determine the ball-polyhedron
up to congruence locally. The main result of this paper is a Cauchy-type
rigidity theorem for ball-polyhedra stating that any simple and standard
ball-polyhedron is locally rigid with respect to its inner dihedral angles.Comment: 11 pages, 2 figure
Vehicles Recognition Using Fuzzy Descriptors of Image Segments
In this paper a vision-based vehicles recognition method is presented.
Proposed method uses fuzzy description of image segments for automatic
recognition of vehicles recorded in image data. The description takes into
account selected geometrical properties and shape coefficients determined for
segments of reference image (vehicle model). The proposed method was
implemented using reasoning system with fuzzy rules. A vehicles recognition
algorithm was developed based on the fuzzy rules describing shape and
arrangement of the image segments that correspond to visible parts of a
vehicle. An extension of the algorithm with set of fuzzy rules defined for
different reference images (and various vehicle shapes) enables vehicles
classification in traffic scenes. The devised method is suitable for
application in video sensors for road traffic control and surveillance systems.Comment: The final publication is available at http://www.springerlink.co
Illuminating spindle convex bodies and minimizing the volume of spherical sets of constant width
A subset of the d-dimensional Euclidean space having nonempty interior is
called a spindle convex body if it is the intersection of (finitely or
infinitely many) congruent d-dimensional closed balls. The spindle convex body
is called a "fat" one, if it contains the centers of its generating balls. The
core part of this paper is an extension of Schramm's theorem and its proof on
illuminating convex bodies of constant width to the family of "fat" spindle
convex bodies.Comment: 17 page
Belief Hierarchical Clustering
In the data mining field many clustering methods have been proposed, yet
standard versions do not take into account uncertain databases. This paper
deals with a new approach to cluster uncertain data by using a hierarchical
clustering defined within the belief function framework. The main objective of
the belief hierarchical clustering is to allow an object to belong to one or
several clusters. To each belonging, a degree of belief is associated, and
clusters are combined based on the pignistic properties. Experiments with real
uncertain data show that our proposed method can be considered as a propitious
tool
Opaque Service Virtualisation: A Practical Tool for Emulating Endpoint Systems
Large enterprise software systems make many complex interactions with other
services in their environment. Developing and testing for production-like
conditions is therefore a very challenging task. Current approaches include
emulation of dependent services using either explicit modelling or
record-and-replay approaches. Models require deep knowledge of the target
services while record-and-replay is limited in accuracy. Both face
developmental and scaling issues. We present a new technique that improves the
accuracy of record-and-replay approaches, without requiring prior knowledge of
the service protocols. The approach uses Multiple Sequence Alignment to derive
message prototypes from recorded system interactions and a scheme to match
incoming request messages against prototypes to generate response messages. We
use a modified Needleman-Wunsch algorithm for distance calculation during
message matching. Our approach has shown greater than 99% accuracy for four
evaluated enterprise system messaging protocols. The approach has been
successfully integrated into the CA Service Virtualization commercial product
to complement its existing techniques.Comment: In Proceedings of the 38th International Conference on Software
Engineering Companion (pp. 202-211). arXiv admin note: text overlap with
arXiv:1510.0142
Contact numbers for congruent sphere packings in Euclidean 3-space
Continuing the investigations of Harborth (1974) and the author (2002) we
study the following two rather basic problems on sphere packings. Recall that
the contact graph of an arbitrary finite packing of unit balls (i.e., of an
arbitrary finite family of non-overlapping unit balls) in Euclidean 3-space is
the (simple) graph whose vertices correspond to the packing elements and whose
two vertices are connected by an edge if the corresponding two packing elements
touch each other. One of the most basic questions on contact graphs is to find
the maximum number of edges that a contact graph of a packing of n unit balls
can have in Euclidean 3-space. Our method for finding lower and upper estimates
for the largest contact numbers is a combination of analytic and combinatorial
ideas and it is also based on some recent results on sphere packings. Finally,
we are interested also in the following more special version of the above
problem. Namely, let us imagine that we are given a lattice unit sphere packing
with the center points forming the lattice L in Euclidean 3-space (and with
certain pairs of unit balls touching each other) and then let us generate
packings of n unit balls such that each and every center of the n unit balls is
chosen from L. Just as in the general case we are interested in finding good
estimates for the largest contact number of the packings of n unit balls
obtained in this way.Comment: 18 page
Tuning the Level of Concurrency in Software Transactional Memory: An Overview of Recent Analytical, Machine Learning and Mixed Approaches
Synchronization transparency offered by Software Transactional Memory (STM) must not come at the expense of run-time efficiency, thus demanding from the STM-designer the inclusion of mechanisms properly oriented to performance and other quality indexes. Particularly, one core issue to cope with in STM is related to exploiting parallelism while also avoiding thrashing phenomena due to excessive transaction rollbacks, caused by excessively high levels of contention on logical resources, namely concurrently accessed data portions. A means to address run-time efficiency consists in dynamically determining the best-suited level of concurrency (number of threads) to be employed for running the application (or specific application phases) on top of the STM layer. For too low levels of concurrency, parallelism can be hampered. Conversely, over-dimensioning the concurrency level may give rise to the aforementioned thrashing phenomena caused by excessive data contention—an aspect which has reflections also on the side of reduced energy-efficiency. In this chapter we overview a set of recent techniques aimed at building “application-specific” performance models that can be exploited to dynamically tune the level of concurrency to the best-suited value. Although they share some base concepts while modeling the system performance vs the degree of concurrency, these techniques rely on disparate methods, such as machine learning or analytic methods (or combinations of the two), and achieve different tradeoffs in terms of the relation between the precision of the performance model and the latency for model instantiation. Implications of the different tradeoffs in real-life scenarios are also discussed
Noise-robust method for image segmentation
Segmentation of noisy images is one of the most challenging problems in image analysis and any improvement of segmentation methods can highly influence the performance of many image processing applications. In automated image segmentation, the fuzzy c-means (FCM) clustering has been widely used because of its ability to model uncertainty within the data, applicability to multi-modal data and fairly robust behaviour. However, the standard FCM algorithm does not consider any information about the spatial linage context and is highly sensitive to noise and other imaging artefacts. Considering above mentioned problems, we developed a new FCM-based approach for the noise-robust fuzzy clustering and we present it in this paper. In this new iterative algorithm we incorporated both spatial and feature space information into the similarity measure and the membership function. We considered that spatial information depends on the relative location and features of the neighbouring pixels. The performance of the proposed algorithm is tested on synthetic image with different noise levels and real images. Experimental quantitative and qualitative segmentation results show that our method efficiently preserves the homogeneity of the regions and is more robust to noise than other FCM-based methods
FSL-BM: Fuzzy Supervised Learning with Binary Meta-Feature for Classification
This paper introduces a novel real-time Fuzzy Supervised Learning with Binary
Meta-Feature (FSL-BM) for big data classification task. The study of real-time
algorithms addresses several major concerns, which are namely: accuracy, memory
consumption, and ability to stretch assumptions and time complexity. Attaining
a fast computational model providing fuzzy logic and supervised learning is one
of the main challenges in the machine learning. In this research paper, we
present FSL-BM algorithm as an efficient solution of supervised learning with
fuzzy logic processing using binary meta-feature representation using Hamming
Distance and Hash function to relax assumptions. While many studies focused on
reducing time complexity and increasing accuracy during the last decade, the
novel contribution of this proposed solution comes through integration of
Hamming Distance, Hash function, binary meta-features, binary classification to
provide real time supervised method. Hash Tables (HT) component gives a fast
access to existing indices; and therefore, the generation of new indices in a
constant time complexity, which supersedes existing fuzzy supervised algorithms
with better or comparable results. To summarize, the main contribution of this
technique for real-time Fuzzy Supervised Learning is to represent hypothesis
through binary input as meta-feature space and creating the Fuzzy Supervised
Hash table to train and validate model.Comment: FICC201
- …