16,142 research outputs found
Optimal Planar Electric Dipole Antenna
Considerable time is often spent optimizing antennas to meet specific design
metrics. Rarely, however, are the resulting antenna designs compared to
rigorous physical bounds on those metrics. Here we study the performance of
optimized planar meander line antennas with respect to such bounds. Results
show that these simple structures meet the lower bound on radiation Q-factor
(maximizing single resonance fractional bandwidth), but are far from reaching
the associated physical bounds on efficiency. The relative performance of other
canonical antenna designs is compared in similar ways, and the quantitative
results are connected to intuitions from small antenna design, physical bounds,
and matching network design.Comment: 10 pages, 15 figures, 2 tables, 4 boxe
Stored energies in electric and magnetic current densities for small antennas
Electric and magnetic currents are essential to describe electromagnetic
stored energy, as well as the associated quantities of antenna Q and the
partial directivity to antenna Q-ratio, D/Q, for general structures. The upper
bound of previous D/Q-results for antennas modeled by electric currents is
accurate enough to be predictive, this motivates us here to extend the analysis
to include magnetic currents. In the present paper we investigate antenna Q
bounds and D/Q-bounds for the combination of electric- and magnetic-currents,
in the limit of electrically small antennas. This investigation is both
analytical and numerical, and we illustrate how the bounds depend on the shape
of the antenna. We show that the antenna Q can be associated with the largest
eigenvalue of certain combinations of the electric and magnetic polarizability
tensors. The results are a fully compatible extension of the electric only
currents, which come as a special case. The here proposed method for antenna Q
provides the minimum Q-value, and it also yields families of minimizers for
optimal electric and magnetic currents that can lend insight into the antenna
design.Comment: 27 pages 7 figure
Multiple domination models for placement of electric vehicle charging stations in road networks
Electric and hybrid vehicles play an increasing role in the road transport
networks. Despite their advantages, they have a relatively limited cruising
range in comparison to traditional diesel/petrol vehicles, and require
significant battery charging time. We propose to model the facility location
problem of the placement of charging stations in road networks as a multiple
domination problem on reachability graphs. This model takes into consideration
natural assumptions such as a threshold for remaining battery load, and
provides some minimal choice for a travel direction to recharge the battery.
Experimental evaluation and simulations for the proposed facility location
model are presented in the case of real road networks corresponding to the
cities of Boston and Dublin.Comment: 20 pages, 5 figures; Original version from March-April 201
Backbone colorings along perfect matchings
Given a graph and a spanning subgraph of (the backbone of ), a backbone coloring for and is a proper vertex coloring of in which the colors assigned to adjacent vertices in differ by at least two. In a recent paper, backbone colorings were introduced and studied in cases were the backbone is either a spanning tree or a spanning path. Here we study the case where the backbone is a perfect matching. We show that for perfect matching backbones of the number of colors needed for a backbone coloring of can roughly differ by a multiplicative factor of at most from the chromatic number . We show that the computational complexity of the problem ``Given a graph with a perfect matching , and an integer , is there a backbone coloring for and with at most colors?'' jumps from polynomial to NP-complete between and . Finally, we consider the case where is a planar graph
The min-max edge q-coloring problem
In this paper we introduce and study a new problem named \emph{min-max edge
-coloring} which is motivated by applications in wireless mesh networks. The
input of the problem consists of an undirected graph and an integer . The
goal is to color the edges of the graph with as many colors as possible such
that: (a) any vertex is incident to at most different colors, and (b) the
maximum size of a color group (i.e. set of edges identically colored) is
minimized. We show the following results: 1. Min-max edge -coloring is
NP-hard, for any . 2. A polynomial time exact algorithm for min-max
edge -coloring on trees. 3. Exact formulas of the optimal solution for
cliques and almost tight bounds for bicliques and hypergraphs. 4. A non-trivial
lower bound of the optimal solution with respect to the average degree of the
graph. 5. An approximation algorithm for planar graphs.Comment: 16 pages, 5 figure
Efficient Contact State Graph Generation for Assembly Applications
An important aspect in the design of many automated assembly strategies is the ability to automatically generate the set of contact states that may occur during an assembly task. In this paper, we present an efficient means of constructing the set of all geometrically feasible contact states that may occur within a bounded set of misalignments (bounds determined by robot inaccuracy). This set is stored as a graph, referred to as an Assembly Contact State Graph (ACSG), which indicates neighbor relationships between feasible states. An ACSG is constructed without user intervention in two stages. In the first stage, all hypothetical primitive principle contacts (PPCs; all contact states allowing 5 degrees of freedom) are evaluated for geometric feasibility with respect to part-imposed and robot-imposed restrictions on relative positioning (evaluated using optimization). In the second stage, the feasibility of each of the various combinations of PPCs is efficiently evaluated, first using topological existence and uniqueness criteria, then using part-imposed and robot-imposed geometric criteria
Cycle flows and multistabilty in oscillatory networks: an overview
The functions of many networked systems in physics, biology or engineering
rely on a coordinated or synchronized dynamics of its constituents. In power
grids for example, all generators must synchronize and run at the same
frequency and their phases need to appoximately lock to guarantee a steady
power flow. Here, we analyze the existence and multitude of such phase-locked
states. Focusing on edge and cycle flows instead of the nodal phases we derive
rigorous results on the existence and number of such states. Generally,
multiple phase-locked states coexist in networks with strong edges, long
elementary cycles and a homogeneous distribution of natural frequencies or
power injections, respectively. We offer an algorithm to systematically compute
multiple phase- locked states and demonstrate some surprising dynamical
consequences of multistability
- …