687 research outputs found
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
Pixel and Voxel Representations of Graphs
We study contact representations for graphs, which we call pixel
representations in 2D and voxel representations in 3D. Our representations are
based on the unit square grid whose cells we call pixels in 2D and voxels in
3D. Two pixels are adjacent if they share an edge, two voxels if they share a
face. We call a connected set of pixels or voxels a blob. Given a graph, we
represent its vertices by disjoint blobs such that two blobs contain adjacent
pixels or voxels if and only if the corresponding vertices are adjacent. We are
interested in the size of a representation, which is the number of pixels or
voxels it consists of.
We first show that finding minimum-size representations is NP-complete. Then,
we bound representation sizes needed for certain graph classes. In 2D, we show
that, for -outerplanar graphs with vertices, pixels are
always sufficient and sometimes necessary. In particular, outerplanar graphs
can be represented with a linear number of pixels, whereas general planar
graphs sometimes need a quadratic number. In 3D, voxels are
always sufficient and sometimes necessary for any -vertex graph. We improve
this bound to for graphs of treewidth and to
for graphs of genus . In particular, planar graphs
admit representations with voxels
Optimally Dense Packings for Fully Asymptotic Coxeter Tilings by Horoballs of Different Types
The goal of this paper to determine the optimal horoball packing arrangements
and their densities for all four fully asymptotic Coxeter tilings (Coxeter
honeycombs) in hyperbolic 3-space . Centers of horoballs are
required to lie at vertices of the regular polyhedral cells constituting the
tiling. We allow horoballs of different types at the various vertices. Our
results are derived through a generalization of the projective methodology for
hyperbolic spaces. The main result states that the known B\"or\"oczky--Florian
density upper bound for "congruent horoball" packings of remains
valid for the class of fully asymptotic Coxeter tilings, even if packing
conditions are relaxed by allowing for horoballs of different types under
prescribed symmetry groups. The consequences of this remarkable result are
discussed for various Coxeter tilings.Comment: 26 pages, 10 figure
Autonomous clustering using rough set theory
This paper proposes a clustering technique that minimises the need for subjective
human intervention and is based on elements of rough set theory. The proposed algorithm is
unified in its approach to clustering and makes use of both local and global data properties to
obtain clustering solutions. It handles single-type and mixed attribute data sets with ease and
results from three data sets of single and mixed attribute types are used to illustrate the
technique and establish its efficiency
Contact Representations of Graphs in 3D
We study contact representations of graphs in which vertices are represented
by axis-aligned polyhedra in 3D and edges are realized by non-zero area common
boundaries between corresponding polyhedra. We show that for every 3-connected
planar graph, there exists a simultaneous representation of the graph and its
dual with 3D boxes. We give a linear-time algorithm for constructing such a
representation. This result extends the existing primal-dual contact
representations of planar graphs in 2D using circles and triangles. While
contact graphs in 2D directly correspond to planar graphs, we next study
representations of non-planar graphs in 3D. In particular we consider
representations of optimal 1-planar graphs. A graph is 1-planar if there exists
a drawing in the plane where each edge is crossed at most once, and an optimal
n-vertex 1-planar graph has the maximum (4n - 8) number of edges. We describe a
linear-time algorithm for representing optimal 1-planar graphs without
separating 4-cycles with 3D boxes. However, not every optimal 1-planar graph
admits a representation with boxes. Hence, we consider contact representations
with the next simplest axis-aligned 3D object, L-shaped polyhedra. We provide a
quadratic-time algorithm for representing optimal 1-planar graph with L-shaped
polyhedra
Regular packings on periodic lattices
We investigate the problem of packing identical hard objects on regular
lattices in d dimensions. Restricting configuration space to parallel alignment
of the objects, we study the densest packing at a given aspect ratio X. For
rectangles and ellipses on the square lattice as well as for biaxial ellipsoids
on a simple cubic lattice, we calculate the maximum packing fraction \phi_d(X).
It is proved to be continuous with an infinite number of singular points X^{\rm
min}_\nu, X^{\rm max}_\nu, \nu=0, \pm 1, \pm 2,... In two dimensions, all
maxima have the same height, whereas there is a unique global maximum for the
case of ellipsoids. The form of \phi_d(X) is discussed in the context of
geometrical frustration effects, transitions in the contact numbers and number
theoretical properties. Implications and generalizations for more general
packing problems are outlined.Comment: 5 pages, 4 figures, accepted for publication in Physical Review
Letter
Basic Understanding of Condensed Phases of Matter via Packing Models
Packing problems have been a source of fascination for millenia and their
study has produced a rich literature that spans numerous disciplines.
Investigations of hard-particle packing models have provided basic insights
into the structure and bulk properties of condensed phases of matter, including
low-temperature states (e.g., molecular and colloidal liquids, crystals and
glasses), multiphase heterogeneous media, granular media, and biological
systems. The densest packings are of great interest in pure mathematics,
including discrete geometry and number theory. This perspective reviews
pertinent theoretical and computational literature concerning the equilibrium,
metastable and nonequilibrium packings of hard-particle packings in various
Euclidean space dimensions. In the case of jammed packings, emphasis will be
placed on the "geometric-structure" approach, which provides a powerful and
unified means to quantitatively characterize individual packings via jamming
categories and "order" maps. It incorporates extremal jammed states, including
the densest packings, maximally random jammed states, and lowest-density jammed
structures. Packings of identical spheres, spheres with a size distribution,
and nonspherical particles are also surveyed. We close this review by
identifying challenges and open questions for future research.Comment: 33 pages, 20 figures, Invited "Perspective" submitted to the Journal
of Chemical Physics. arXiv admin note: text overlap with arXiv:1008.298
Locked and Unlocked Chains of Planar Shapes
We extend linkage unfolding results from the well-studied case of polygonal
linkages to the more general case of linkages of polygons. More precisely, we
consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are
hinged together sequentially at rotatable joints. Our goal is to characterize
the families of planar shapes that admit locked chains, where some
configurations cannot be reached by continuous reconfiguration without
self-intersection, and which families of planar shapes guarantee universal
foldability, where every chain is guaranteed to have a connected configuration
space. Previously, only obtuse triangles were known to admit locked shapes, and
only line segments were known to guarantee universal foldability. We show that
a surprisingly general family of planar shapes, called slender adornments,
guarantees universal foldability: roughly, the distance from each edge along
the path along the boundary of the slender adornment to each hinge should be
monotone. In contrast, we show that isosceles triangles with any desired apex
angle less than 90 degrees admit locked chains, which is precisely the
threshold beyond which the inward-normal property no longer holds.Comment: 23 pages, 25 figures, Latex; full journal version with all proof
details. (Fixed crash-induced bugs in the abstract.
Prioritization of the launch of ICT products and services through linguistic multi-criteria decision-making
The market launch of new products and services is a basic pillar for large and medium-sized companies in the ICT (Information and Communications Technology) sector. Choosing the right moment for it is usually a differentiating factor in terms of competition, since it is a source of competitive advantage. There are several mechanisms and strategies to address this problem from the market perspective. However, the criteria of the different actors involved – managers, sales representatives, experts, etc. – coexist in the corporate sphere and they often differ, causing difficulties in priority setting processes in the launch of a product or service. The assessment of the prioritization of these criteria is usually expressed in natural language, thus adding a great deal of uncertainty. Fuzzy linguistic models have proved to be an efficient tool for managing the intrinsic uncertainty of this type of information. This paper presents a linguistic multi-criteria decision-making model, able to reconcile the different requirements and viewpoints existing in the corporate sector when planning the launch of new products and services. The proposed model is based on the fuzzy 2-tuple linguistic model, aimed at managing linguistic data expressing different corporate criteria, without compromising accuracy in the calculation of said data. In order to illustrate this, a practical case study is presented, in which the model is applied for scheduling the launch prioritization of several new products and services by a telecommunications company, within the deadlines set in its strategic planning.The authors would like to acknowledge the financial support received from the European Regional Development Fund (ERDF) for the Research Projects TIN2016-75850-R, TIN2016-79484-R and TIN2013-40658-P
- …