Avian song learning is an important model system for understanding vocal learning in humans and other animals. Laboratory studies indicate that social interactions are critical for song learning, but field observations show that territorial males are aggressive to intruders, raising the question of whether young birds are tolerated, much less tutored in the wild. We examined how adult song spar...

We describe a basic Geo-coding service encompassing a geo-parsing tool and integrated digital gazetteer service. The development of a geo-parser comes from the need to explicitly georeference large resource collections such as the Statistical Accounts of Scotland which currently only contain implicit georeferences in the form of placennames thus making such collections inherently geographically...

This paper presents information on business intelligence (BI) and its use in industry. The specifics of BI in the chemical industry are discussed. A sample of a specific case where BI has been used through integration with an enterprise resource planning system is given. It is determined that having the key information and performance measures in place to evaluate business decisions is critical...

Abstract: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels. Supply chain planning problem...

Early work on natural language database query processing focused on theories of compositional semantics. Recent work concentrates on the translation of NL queries to SQL where semantics is primarily used in an ad hoc manner to guide syntactic translation. Here, we argue that there remains a need for an efficiently-implementable denotational semantics for NL DB queries, and show how this can be ...

(✓ 1 ✓ 2 ) := F ( ̄ ✓)(✓ 1 ✓ 2 ) (17) Since μ̇ > 0 and min (V ) > 0, we have (✓ 1 ✓ 2 ) 0 (G(✓ 1 ) G(✓ 2 )) (✓ 1 ✓ 2 ) 0 (V )(✓ 1 ✓ 2 ) > 0 for any ✓ 1 6= ✓ 2 . Hence, G(✓) is an injection from Rd to Rd, and so G 1 is a well-defined function. Consequently, (15) has a unique solution ˆ ✓ = G (Z). Let us consider an ⌘-neighborhood of ✓⇤, B⌘ := {✓ : k✓ ✓⇤k  ⌘}, where ⌘ > 0 is a constant that will ...

We investigate the computational complexity of the Boolean Isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. Our main result is a one-round interactive proof for BI, where the veriier has access to an NP oracle. To obtain this, we use a recent result from learning theory by Bsho...

We study geometric and topological properties of the image of a smooth submanifold of Runder a bi-Lipschitz map to R. In particular, we characterize how the dimension, diameter,volume, and reach of the embedded manifold relate to the original. Our main result establishesa lower bound on the reach of the embedded manifold in the case where m ≤ n and the bi-Lipschitz map is li...

Abstract: In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1, . . . , jn, and the processing time pi of the i-th job is given by pi = 1 + bisi, where si is the starting time of the i-th job, i = 1, . . . n. If all jobs have different and non-zero deterioration rates and bi > bj ⇒ bi ≥ bmin+1 bmin bj+ ...