Estimation of coherent and incoherent radio frequency (RF) signal attenuation through foliage is of great importance for a number of radar and communication problems. At UHF band and higher frequencies foliage presents a complex environment for electromagnetic waves in terms of scattering and wave propagation. For most applications, dealing with complex foliage models that account for single an...

Currently, for the planning of wireless cellular networks in urban scenarios either empirical (direct ray or over rooftop ray) or ray-optical (ray tracing) propagation models are used. In this paper both approaches are compared to one another and to measurements in different urban city centers. Additionally a new concept which is called Dominant Path Model (DPM) is presented in this paper. This...

As a flexible alternative to the Cox model, the additive risk model assumes that the hazard function is the sum of the baseline hazard and a regression function of covariates. For right censored survival data when variable selection is needed along with model estimation, we propose a path consistent model selector using a modified Lasso approach, under the additive risk model assumption. We sho...

The construction and application of an indoor spatial data model is an important prerequisite to meet the requirements of diversified indoor spatial location services. The traditional indoor spatial topology model focuses on the construction of topology information. It has high path analysis and query efficiency, but ignores the spatial location information. The grid model retains the plane pos...

For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the system. We propose to enrich such tree models with “jump-edges” that capture observational indistinguishability: for an agent a, an a-labeled edge is added between two nodes if the observable behaviors of the agent a...

We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general technique which we consider here in the context of the bounded model checking of sequential programs with nondeterministic conditionals. The DPR approach is based on the symbolic analysis of concrete executions. For e...

The second author and Postnikov have recently constructed a simple combinatorial model for the characters of the irreducible representations of a complex semisimple Lie group, that is referred to as the alcove path model. In this paper we relate the alcove path model to the the semistandard Young tableaux in type A and the KashiwaraNakashima tableaux in type C. More explicitly, we construct bij...