The boundaryless beam propagation method uses a mapping function to transform the infinite real space into a finite-size computational domain [Opt. Lett.21, 4 (1996)]. This leads to a bounded field that avoids the artificial reflections produced by the computational window. However, the method suffers from frequency aliasing problems, limiting the physical region to be sampled. We propose an ad...

In object-oriented (OO) programming, variables do not contain objects directly but ad-dresses of objects on the heap. Thus, several variables can point to the same object; wecall this aliasing.Aliasing is a central feature of OO programming that enables efficient sharing of objectsacross a system. This is essential for the implementation of many programming idioms,such as it...

We present a system called ALIAS, that is designed to search for duplicate authors from Microsoft Academic Search Engine dataset. Author-ambiguity is a prevalent problem in this dataset, as many authors publish under several variations of their own name, or different authors share similar or same name. ALIAS takes an author name as an input (who may or may not exist in the corpus), and outputs ...

An expression is derived for the spatial power spectrum of wave-front errors after correction with a segmented mirror. This includes estimates of the spectral contributions of segment piston and tilt corrections and spatial aliasing by a regular array of segments. The approach allows rapid computation of wave-front error spectra in systems with highly segmented mirrors.

Alias detection is a challenging task critical in several areas such as the intelligence community, social network analysis, databases, biology, and marketing. Problem domains can be as simple as datasets containing accidentally replicated data, or as complex as populations containing criminals or terrorists wielding multiple identities. Teasing out aliases or near aliases in the later case is ...

Deduplication, a key operation in integrating data from multiple sources, is a time-consuming, labor-intensive and domainspecific operation. We present our design of alias that uses a novel approach to ease this task by limiting the manual effort to inputing simple, domain-specific attribute similarity functions and interactively labeling a small number of record pairs. We describe how active l...

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out whe...

We call these subtheories modules. Examples of such theories can be found in reasoning about actions, where each T αi contains descriptions of the atomic action αi in terms of preconditions and effects, and T ∅ is the set of static laws (alias domain constraints, alias integrity constraints), i.e. those formulas that hold in every possible state of a dynamic system. For example, T marry = {¬mar...

AABB [28]. Accelerated [160, 88]. Accelerating [239, 63, 67]. Accumulation [56]. accuracy [4]. Accurate [269, 40, 63, 268, 95, 99, 8]. Acoustical [274]. Active [195]. Adapting [311]. Adaptive [260, 159, 205, 22, 71, 215, 145]. Adjacency [163, 80]. Advanced [193]. Affine [263]. Algorithm [309, 241, 137, 269, 104, 29, 129, 58, 230, 191, 298, 203, 281, 170, 272, 97, 77, 158, 4, 85, 83, 7]. Algorit...