Electromagnetic modeling of antenna characteristics can be performed using different methods. This papers deals with antenna modeling using Partial Element Equivalent Circuit (PEEC) models. Antenna properties including input impedance, radiation diagrams and gain are computed from PEEC model results. The input impedance is computed directly by using the currents and voltages at the feed-point of the antenna. The radiation diagrams are computed in a post-processing step by treating each volume cell as an infinitesimal dipole and using the superposition principle to compute the radiated field. The computed results are compared to analytical results for dipoles. For more complex antenna structures the computed results are compared with measurements and results from other computational methods. Accurate and fast results shows that the method is promising as an antenna system design tool.

It is reasonable to think that sensor networks might be part of society critical systems in the future. Therefor this paper discusses and shows the vulnerabilities of sensor networks to intentional electromagnetic interference (IEMI). Principle ways of sensor network IEMI is addressed and followed by a discussion on schemes for protection. Experimental results for both in-band and exband interference from low- and high- level sources is reported. It is obvious that more emphasis has to be put on sensor networks susceptibility to IEMI, and in particular more experimental data is needed.

The Zookeeper's Problem is a shortest-path problem that, given a simple polygon (a zoo) containing a set of disjoint convex polygons (cages) attached to the boundary of the zoo, asks for a shortest route (closed path) in the zoo that intersects the boundaries of all cages without entering their interiors. The literature contains several algorithms for variants of this problem some of which compute exact and some approximate solutions. However, no implementations have been reported. Moreover, concerns have also been raised about the numerical properties of the algorithms that compute exact solutions. In this paper we present a study of two algorithms for the Zookeeper's Problem. One of them compute exact solutions and the other provably good approximations. We give observations about the algorithms and the solutions they compute. We also present an experimental study based on an implementation of the algorithms in Java.