Lexical Query Modeling in Session Search

Lexical query modeling has been the leading paradigm for session search. In this paper, we analyze TREC session query logs and compare the performance of different lexical matching approaches for session search. Naive methods based on term frequency weighing perform on par with specialized session models. In addition, we investigate the viability of lexical query models in the setting of session search. We give important insights into the potential and limitations of lexical query modeling for session search and propose future directions for the field of session search.Comment: ICTIR2016, Proceedings of the 2nd ACM International Conference on the Theory of Information Retrieval. 201

Seed production, infestation, and viability in Acacia tortilis (synonym: Vachellia tortilis) and Acacia robusta (synonym: Vachellia robusta) across the Serengeti rainfall gradient

Tree recruitment in savannas proceeds in multiple stages characterized by successive filters occurring at the seed and seedling stages. The “demographic bottleneck” hypothesis suggests that such filters ultimately restrict tree density and prevent trees from dominating grasses in savannas, but many of the demographic transitions underlying this assumption have not been quantified. We investigated how short- (1–2 years) and long-term (40 + years) rainfall patterns influenced seed production, infestation, and viability for two dominant species, Acacia robusta and Acacia tortilis across the Serengeti ecosystem mean annual precipitation gradient over a two-year period. We found that neither production, nor infestation, nor viability was influenced by rainfall. Pod production differed between species and increased with tree height in A. robusta. Mean infestation proportion in 2013 was higher (mean ± SE; 0.28 ± 0.08) in A. tortilis than in A. robusta (0.11 ± 0.05) but the trend reversed in 2014, when A. tortilis (0.33 ± 0.10) had lower infestation than A. robusta (0.61 ± 0.09). Under laboratory conditions, A. tortilis and A. robusta seeds had maximum germination (= viability) proportions of 70 and 20%, respectively. Mean seed viability was more than five-fold higher (0.46 ± 0.19) in A. tortilis than in A. robusta (0.08 ± 0.10). Our study has produced important estimates for seed stage demographic dynamics that can be used for modeling tree dynamics in Serengeti system, and savannas in general

Schwarzschild Models for the Galaxy

Schwarzschild's orbit-superposition technique is the most developed and well-tested method available for constraining the detailed mass distributions of equilibrium stellar systems. Here I provide a very short overview of the method and its existing implementations, and briefly discuss their viability as a tool for modeling the Galaxy using Gaia data.Comment: 2 pages; invited review at "Modelling the Galaxy in the era of Gaia", proceedings of Joint Discussion 5 at the XXVIIth IAU General Assembly (Rio de Janeiro, August 2009); James Binney, Ian F. Corbett, eds

Generative and Discriminative Voxel Modeling with Convolutional Neural Networks

When working with three-dimensional data, choice of representation is key. We explore voxel-based models, and present evidence for the viability of voxellated representations in applications including shape modeling and object classification. Our key contributions are methods for training voxel-based variational autoencoders, a user interface for exploring the latent space learned by the autoencoder, and a deep convolutional neural network architecture for object classification. We address challenges unique to voxel-based representations, and empirically evaluate our models on the ModelNet benchmark, where we demonstrate a 51.5% relative improvement in the state of the art for object classification.Comment: 9 pages, 5 figures, 2 table

Identification of complex biological network classes using extended correlation analysis

Modeling and analysis of complex biological networks necessitates suitable handling of data on a parallel scale. Using the IkB-NF-kB pathway model and a basis of sensitivity analysis, analytic methods are presented, extending correlation from the network kinetic reaction rates to that of the rate reactions. Alignment of correlated processed components, vastly outperforming correlation of the data source, advanced sets of biological classes possessing similar network activities. Additional construction generated a naturally structured, cardinally based system for component-specific investigation. The computationally driven procedures are described, with results demonstrating viability as mechanisms useful for fundamental oscillatory network activity investigation

CASP Solutions for Planning in Hybrid Domains

CASP is an extension of ASP that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the EZCSP CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the EZCSP solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.Comment: Under consideration in Theory and Practice of Logic Programming (TPLP

Modeling Negotiations Over Water and Ecosystem Management: Uncertainty and Political Viability

We present a modeling approach for generating robust predictions about how changes in institutional, economic, and political considerations will influence the outcome of political negotiations over complex water-ecosystem policy debates. Evaluating the political viability of proposed policies is challenging for researchers in these complex natural and political environments; there is limited information with which to map policies to outcomes to utilities or to represent the political process adequately. Our analysis evaluates the viability of policy options using a probabilistic political viability criterion that explicitly recognizes the existence of modeling uncertainty. The approach is used to conduct a detailed case study of the future of California’s Sacramento-San Joaquin Delta. Several other possible applications of the approach are briefly discussed

An Optimal Control Theory for the Traveling Salesman Problem and Its Variants

We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space of measurable functions to the field of real numbers. Many variants of the TSP, such as those with neighborhoods, with forbidden neighborhoods, with time-windows and with profits, can all be framed under this construct. In sharp contrast to their discrete-optimization counterparts, the modeling constructs presented in this paper represent a fundamentally new domain of analysis and computation for TSPs and their variants. Beyond its apparent mathematical unification of a class of problems in graph theory, the main advantage of the new approach is that it facilitates the modeling of certain application-specific problems in their home space of measurable functions. Consequently, certain elements of economic system theory such as dynamical models and continuous-time cost/profit functionals can be directly incorporated in the new optimization problem formulation. Furthermore, subtour elimination constraints, prevalent in discrete optimization formulations, are naturally enforced through continuity requirements. The price for the new modeling framework is nonsmooth functionals. Although a number of theoretical issues remain open in the proposed mathematical framework, we demonstrate the computational viability of the new modeling constructs over a sample set of problems to illustrate the rapid production of end-to-end TSP solutions to extensively-constrained practical problems.Comment: 24 pages, 8 figure