The sweep-line method is a state space reduction technique for memory-efficient on-the-fly verification of concurrent systems. The method relies on a progress measure capturing inherent progress in the system under verification to store only fragments of the state space in memory at a time and thereby reduce peak memory usage. The sweepline method has been applied to many concurrent systems, bu...

Grid-interactive converters with primary frequency control and inertia emulation have emerged and are promising for future renewable generation plants because of the contribution in power system stabilisation. This study gives a synchronous active power control solution for grid-interactive converters, as a way to emulate synchronous generators for inerita characteristics and load sharing. As d...

We present a new algorithm for triangulating simple polygons that has four advantages over previous solutions [GJPT, Ch]. a) It is faster: Whilst previous solutions worked in time O(nlogn), the new algorithm only needs time O(n+rlogr) where r is the number of concave angles of the polygon. b) It works for a larger class of inputs: Whilst previous solutions worked for simple polygons, the new al...

Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to t...

The transistor circuit research is aimed at problems of general interest in communication engineering. Fundamental principles of transistor circuit design and practical limitations imposed by available devices are being investigated for circuits useful in a wide variety of applications. Present studies include work on sweep generators, temperature effects in dc amplifiers, and methods of stabil...

This paper presents fast algorithms for penetration and contact determination between general polyhedral models in dynamic environments. The main contribution is an extension of an earlier expected constant time algorithm between convex polytopes to detect penetrations and contacts. For each pair of non-convex polyhedral models, the algorithm uses the convex hull of each object to determine whi...

Interferometric gravitational wave detectors could measure the frequency sweep of a binary inspiral [characterized by its chirp mass] to high accuracy. The observed chirp mass is the intrinsic chirp mass of the binary source multiplied by (1 + z), where z is the redshift of the source. Assuming a nonzero cosmological constant, we compute the expected redshift distribution of observed events for...

Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We present a simple 4-approximation algorithm for this problem which runs in O(n log n)-time and uses the plane-sweep technique. Previous algorithms that achieve the same approximation ratio have a higher time complexity. We also show how to ext...

Let and be two sets of -monotone and non-intersecting curve segments, and . We give a new sweep-line algorithm that reports the intersecting pairs of segments of . Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simpl...