Query: Ad Hoc Retrieval Experiments Using WordNet and Automatically Constructed Thesauri

Relevant passages:
Concept Based Query Expansion <=SEP=> Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. A similarity thesaurus reflects domain knowledge about the particular collection from which it is constructed. We address the two important issues with query expansion: the selection and the weighting of additional search terms. In contrast to earlier methods, our queries are expanded by adding those terms that are most similar to the concept of the query, rather than selecting terms that are similar to the query terms. Our experiments show that this kind of query expansion results in a notable improvement in the retrieval effectiveness when measured using both recall-precision and usefulness.

An Association Thesaurus for Information Retrieval <=SEP=> Although commonly used in both commercial and experimental information retrieval systems, thesauri have not demonstrated consistent beneets for retrieval performance, and it is diicult to construct a thesaurus automatically for large text databases. In this paper, an approach, called PhraseFinder, is proposed to construct collection-dependent association thesauri automatically using large full-text document collections. The association thesaurus can be accessed through natural language queries in INQUERY, an information retrieval system based on the probabilistic inference network. Experiments are conducted in IN-QUERY to evaluate diierent types of association thesauri, and thesauri constructed for a variety of collections.

Experiments in Automatic Statistical Thesaurus Construction <=SEP=> A well constructed thesaurus has long been recognized as a valuable tool in the effective operation of an information retrieval system. This paper reports the results of experiments designed to determine the validity of an approach to the automatic construction of global thesauri (described originally by Crouch in [1] and [2] based on a clustering of the document collection. The authors validate the approach by showing that the use of thesauri generated by this method results in substantial improvements in retrieval effectiveness in four test collections. The term discrimination value theory, used in the thesaurus generation algorithm to determine a term's membership in a particular thesaurus class, is found not to be useful in distinguishing a “good” from an “indifferent” or “poor” thesaurus class). In conclusion, the authors suggest an alternate approach to automatic thesaurus construction which greatly simplifies the work of producing viable thesaurus classes. Experimental results show that the alternate approach described herein in some cases produces thesauri which are comparable in retrieval effectiveness to those produced by the first method at much lower cost.

Term-Weighting Approaches in Automatic Text Retrieval <=SEP=> The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucially on the choice of effective termweighting systems. This article summarizes the insights gained in automatic term weighting, and provides baseline single-term-indexing models with which other more elaborate content analysis procedures can be compared. 1. AUTOMATIC TEXT ANALYSIS In the late 195Os, Luhn [l] first suggested that automatic text retrieval systems could be designed based on a comparison of content identifiers attached both to the stored texts and to the users’ information queries. Typically, certain words extracted from the texts of documents and queries would be used for content identification; alternatively, the content representations could be chosen manually by trained indexers familiar with the subject areas under consideration and with the contents of the document collections. In either case, the documents would be represented by term vectors of the form D= (ti,tj,...ytp) (1) where each tk identifies a content term assigned to some sample document D. Analogously, the information requests, or queries, would be represented either in vector form, or in the form of Boolean statements. Thus, a typical query Q might be formulated as Q = (qa,qbr.. . ,4r) (2)

Build-to-order supply chain management : a literature review and framework for development <=SEP=> The build-to-order supply chain management (BOSC) strategy has recently attracted the attention of both researchers and practitioners, given its successful implementation in many companies including Dell computers, Compaq, and BMW. The growing number of articles on BOSC in the literature is an indication of the importance of the strategy and of its role in improving the competitiveness of an organization. The objective of a BOSC strategy is to meet the requirements of individual customers by leveraging the advantages of outsourcing and information technology. There are not many research articles that provide an overview of BOSC, despite the fact that this strategy is being promoted as the operations paradigm of the future. The main objective of this research is to (i) review the concepts of BOSC, (ii) develop definitions of BOSC, (iii) classify the literature based on a suitable classification scheme, leading to some useful insights into BOSC and some future research directions, (iv) review the selected articles on BOSC for their contribution to the development and operations of BOSC, (v) develop a framework for BOSC, and (vi) suggest some future research directions. The literature has been reviewed based on the following four major areas of decision-making: organizational competitiveness, the development and implementation of BOSC, the operations of BOSC, and information technology in BOSC. Some of the important observations are: (a) there is a lack of adequate research on the design and control of BOSC, (b) there is a need for further research on the implementation of BOSC, (c) human resource issues in BOSC have been ignored, (d) issues of product commonality and modularity from the perspective of partnership or supplier development require further attention and (e) the trade-off between responsiveness and the cost of logistics needs further study. The paper ends with concluding remarks. # 2004 Elsevier B.V. All rights reserved.

Team MIT Urban Challenge Technical Report <=SEP=> This technical report describes Team MIT's approach to the DARPA Urban Challenge. We have developed a novel strategy for using many inexpensive sensors, mounted on the vehicle periphery, and calibrated with a new cross­modal calibration technique. Lidar, camera, and radar data streams are processed using an innovative, locally smooth state representation that provides robust perception for real­ time autonomous control. A resilient planning and control architecture has been developed for driving in traffic, comprised of an innovative combination of well­proven algorithms for mission planning, situational planning, situational interpretation, and trajectory control. These innovations are being incorporated in two new robotic vehicles equipped for autonomous driving in urban environments, with extensive testing on a DARPA site visit course. Experimental results demonstrate all basic navigation and some basic traffic behaviors, including unoccupied autonomous driving, lane following using pure­pursuit control and our local frame perception strategy, obstacle avoidance using kino­dynamic RRT path planning, U­turns, and precedence evaluation amongst other cars at intersections using our situational interpreter. We are working to extend these approaches to advanced navigation and traffic scenarios. † Executive Summary This technical report describes Team MIT's approach to the DARPA Urban Challenge. We have developed a novel strategy for using many inexpensive sensors, mounted on the vehicle periphery, and calibrated with a new cross-modal calibration technique. Lidar, camera, and radar data streams are processed using an innovative, locally smooth state representation that provides robust perception for real-time autonomous control. A resilient planning and control architecture has been developed for driving in traffic, comprised of an innovative combination of well-proven algorithms for mission planning, situational planning, situational interpretation, and trajectory control. These innovations are being incorporated in two new robotic vehicles equipped for autonomous driving in urban environments, with extensive testing on a DARPA site visit course. Experimental results demonstrate all basic navigation and some basic traffic behaviors, including unoccupied autonomous driving, lane following using pure-pursuit control and our local frame perception strategy, obstacle avoidance using kino-dynamic RRT path planning, U-turns, and precedence evaluation amongst other cars at intersections using our situational interpreter. We are working to extend these approaches to advanced navigation and traffic scenarios. DISCLAIMER: The information contained in this paper does not represent the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency (DARPA) or the Department of Defense. DARPA does not guarantee the accuracy or reliability of the information in this paper. Additional support …

Platforms in healthcare innovation ecosystems: The lens of an innovation intermediary <=SEP=> Healthcare innovation has made progressive strides. Innovative solutions now tend to incorporate device integration, data collection and data analysis linked across a diverse range of actors building platform-centric healthcare ecosystems. The interconnectedness and inter-disciplinarity of the ecosystems bring with it a number of vital issues around how to strategically manage such a complex system. This paper highlights the importance of innovation intermediaries particularly in a platform-centric ecosystem such as the healthcare industry. It serves as a reminder of why it is important for healthcare technologists to consider proactive ways to contribute to the innovation ecosystem by creating devices with the platform perspective in mind.

Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment <=SEP=> Sensors in a data fusion environment over hostile territory are geographically dispersed and change location with time. In order to collect and process data from these sensors an equally flexible network of fusion beds (i.e., clusterheads) is required. To account for the hostile environment, we allow communication links between sensors and clusterheads to be unreliable. We develop a mixed integer linear programming (MILP) model to determine the clusterhead location strategy that maximizes the expected data covered minus the clusterhead reassignments, over a time horizon. A column generation (CG) heuristic is developed for this problem. Computational results show that CG performs much faster than a standard commercial solver and the typical optimality gap for large problems is less than 5%. Improvements to the basic model in the areas of modeling link failure, consideration of bandwidth capacity, and clusterhead changeover cost estimation are also discussed.

Tableau Methods for Modal and Temporal Logics <=SEP=> This document is a complete draft of a chapter by Rajeev Gor e on \Tableau Methods for Modal and Temporal Logics" which is part of the \Handbook of Tableau Methods", edited

General Spectral Camera Lens Simulation <=SEP=> We present a camera lens simulation model capable of producing advanced photographic phenomena in a general spectral Monte Carlo image rendering system. Our approach incorporates insights from geometrical diffraction theory, from optical engineering and from glass science. We show how to efficiently simulate all five monochromatic aberrations, spherical and coma aberration, astigmatism, field curvature and distortion. We also consider chromatic aberration, lateral colour and aperture diffraction. The inclusion of Fresnel reflection generates correct lens flares and we present an optimized sampling method for path generation.

An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs <=SEP=> In this paper we present a polynomial time technology mapping algorithm, called Flow-Map, that optimally solves the LUT-based FPGA technology mapping problem for depth minimization for general Boolean networks. This theoretical breakthrough makes a sharp contrast with the fact that conventional technology mapping problem in library-based designs is NP-hard. A key step in Flow-Map is to compute a minimum height K-feasible cut in a network, solved by network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. We tested the Flow-Map algorithm on a set of benchmarks and achieved reductions on both the network depth and the number of LUTs in mapping solutions as compared with previous algorithms.

A gender-specific behavioral analysis of mobile device usage data <=SEP=> Mobile devices provide a continuous data stream of contextual behavioral information which can be leveraged for a variety of user services, such as in personalizing ads and customizing home screens. In this paper, we aim to better understand gender-related behavioral patterns found in application, Bluetooth, and Wi-Fi usage. Using a dataset which consists of approximately 19 months of data collected from 189 subjects, gender classification is performed using 1,000 features related to the frequency of events yielding up to 91.8% accuracy. Then, we present a behavioral analysis of application traffic using techniques commonly used for web browsing activity as an alternative data exploration approach. Finally, we conclude with a discussion on impersonation attacks, where we aim to determine if one gender is less vulnerable to unauthorized access on their mobile device.

From Databases to Big Data <=SEP=> 

Educational game design for online education <=SEP=> The use of educational games in learning environments is an increasingly relevant trend. The motivational and immersive traits of game-based learning have been deeply studied in the literature, but the systematic design and implementation of educational games remain an elusive topic. In this study some relevant requirements for the design of educational games in online education are analyzed, and a general game design method that includes adaptation and assessment features is proposed. Finally, a particular implementation of that design is described in light of its applicability to other implementations and environments. 2008 Elsevier Ltd. All rights reserved.

A review of the literature on the aging adult skull and face: implications for forensic science research and applications. <=SEP=> This paper is a summary of findings of adult age-related craniofacial morphological changes. Our aims are two-fold: (1) through a review of the literature we address the factors influencing craniofacial aging, and (2) the general ways in which a head and face age in adulthood. We present findings on environmental and innate influences on face aging, facial soft tissue age changes, and bony changes in the craniofacial and dentoalveolar skeleton. We then briefly address the relevance of this information to forensic science research and applications, such as the development of computer facial age-progression and face recognition technologies, and contributions to forensic sketch artistry.

Feature-based survey of model transformation approaches <=SEP=> Concrete Figure 5 Features of the body of a domain: (A) patterns and (B) logic Language Paradigm Value Specification Element Creation Implicit Explicit Logic Constraint Object-Oriented Functional Procedural Logic Value Binding Imperative Assignment IBM SYSTEMS JOURNAL, VOL 45, NO 3, 2006 CZARNECKI AND HELSEN 629 operating on one model from the parts operating on other models. For example, classical rewrite rules have an LHS operating on the source model and an RHS operating on the target model. In other approaches, such as a rule implemented as a Java program, there might not be any such syntactic distinction. Multidirectionality Multidirectionality refers to the ability to execute a rule in different directions (see Figure 4A). Rules supporting multidirectionality are usually defined over in/out-domains. Multidirectional rules are available in MTF and QVT Relations. Application condition Transformation rules in some approaches may have an application condition (see Figure 4A) that must be true in order for the rule to be executed. An example is the when-clause in QVT Relations (Example 1). Intermediate structure The execution of a rule may require the creation of some additional intermediate structures (see Figure 4A) which are not part of the models being transformed. These structures are often temporary and require their own metamodel. A particular example of intermediate structures are traceability links. In contrast to other intermediate structures, traceability links are usually persisted. Even if traceability links are not persisted, some approaches, such as AGG and VIATRA, rely on them to prevent multiple ‘‘firings’’ of a rule for the same input element. Parameterization The simplest kind of parameterization is the use of control parameters that allow passing values as control flags (Figure 7). Control parameters are useful for implementing policies. For example, a transformation from class models to relational schemas could have a control parameter specifying which of the alternative patterns of object-relational mapping should be used in a given execution. 7 Generics allow passing data types, including model element types, as parameters. Generics can help make transformation rules more reusable. Generic transformations have been described by Varró and Pataricza. 17 Finally, higher-order rules take other rules as parameters and may provide even higher levels of reuse and abstraction. Stratego 64 is an example of a term rewriting language for program transformation supporting higher-order rules. We are currently not aware of any model transformation approaches with a first class support for higherorder rules. Reflection and aspects Some authors advocate the support for reflection and aspects (Figure 4) in transformation languages. Reflection is supported in ATL by allowing reflective access to transformation rules during the execution of transformations. An aspect-oriented extension of MTL was proposed by Silaghi et al. 65 Reflection and aspects can be used to express concerns that crosscut several rules, such as custom traceability management policies. 66 Rule application control: Location determination A rule needs to be applied to a specific location within its source scope. As there may be more than one match for a rule within a given source scope, we need a strategy for determining the application locations (Figure 8A). The strategy could be deterministic, nondeterministic, or interactive. For example, a deterministic strategy could exploit some standard traversal strategy (such as depth first) over the containment hierarchy in the source. Stratego 64 is an example of a term rewriting language with a rich mechanism for expressing traversal in tree structures. Examples of nondeterministic strategies include one-point application, where a rule is applied to one nondeterministically selected location, and concurrent application, where one rule is Figure 6 Typing Untyped Syntactically Typed Semantically Typed Typing Figure 7 Parameterization Control Parameters Generics Higher-Order Rules Parameterization CZARNECKI AND HELSEN IBM SYSTEMS JOURNAL, VOL 45, NO 3, 2006 630 Figure 8 Model transformation approach features: (A) location determination, (B) rule scheduling, (C) rule organization, (D) source-target relationship, (E) incrementality, (F) directionality, and (G) tracing Concurrent One-Point Non-Deterministic Deterministic Interactive Rule Application Strategy A

Robotic versus Open Partial Nephrectomy: A Systematic Review and Meta-Analysis <=SEP=> OBJECTIVES
To critically review the currently available evidence of studies comparing robotic partial nephrectomy (RPN) and open partial nephrectomy (OPN).


MATERIALS AND METHODS
A comprehensive review of the literature from Pubmed, Web of Science and Scopus was performed in October 2013. All relevant studies comparing RPN with OPN were included for further screening. A cumulative meta-analysis of all comparative studies was performed and publication bias was assessed by a funnel plot.


RESULTS
Eight studies were included for the analysis, including a total of 3418 patients (757 patients in the robotic group and 2661 patients in the open group). Although RPN procedures had a longer operative time (weighted mean difference [WMD]: 40.89; 95% confidence interval [CI], 14.39-67.40; p = 0.002), patients in this group benefited from a lower perioperative complication rate (19.3% for RPN and 29.5% for OPN; odds ratio [OR]: 0.53; 95%CI, 0.42-0.67; p<0.00001), shorter hospital stay (WMD: -2.78; 95%CI, -3.36 to -1.92; p<0.00001), less estimated blood loss(WMD: -106.83; 95%CI, -176.4 to -37.27; p = 0.003). Transfusions, conversion to radical nephrectomy, ischemia time and estimated GFR change, margin status, and overall cost were comparable between the two techniques. The main limitation of the present meta-analysis is the non-randomization of all included studies.


CONCLUSIONS
RPN appears to be an efficient alternative to OPN with the advantages of a lower rate of perioperative complications, shorter length of hospital stay and less blood loss. Nevertheless, high quality prospective randomized studies with longer follow-up period are needed to confirm these findings.

Black-Box Calibration for ADCs With Hard Nonlinear Errors Using a Novel INL-Based Additive Code: A Pipeline ADC Case Study <=SEP=> This paper presents a digital nonlinearity calibration technique for ADCs with strong input–output discontinuities between adjacent codes, such as pipeline, algorithmic, and SAR ADCs with redundancy. In this kind of converter, the ADC transfer function often involves multivalued regions, where conventional integral-nonlinearity (INL)-based calibration methods tend to miscalibrate, negatively affecting the ADC’s performance. As a solution to this problem, this paper proposes a novel INL-based calibration which incorporates information from the ADC’s internal signals to provide a robust estimation of static nonlinear errors for multivalued ADCs. The method is fully generalizable and can be applied to any existing design as long as there is access to internal digital signals. In pipeline or subranging ADCs, this implies access to partial subcodes before digital correction; for algorithmic or SAR ADCs, conversion bit/bits per cycle are used. As a proof-of-concept demonstrator, the experimental results for a 1.2 V 23 mW 130 nm-CMOS pipeline ADC with a SINAD of 58.4 dBc (in nominal conditions without calibration) is considered. In a stressed situation with 0.95 V of supply, the ADC has SINAD values of 47.8 dBc and 56.1 dBc, respectively, before and after calibration (total power consumption, including the calibration logic, being 15.4 mW).

WebSelF: A Web Scraping Framework <=SEP=> We present WebSelF, a framework for web scraping which models the process of web scraping and decomposes it into four conceptually independent, reusable, and composable constituents. We have validated our framework through a full parameterized implementation that is flexible enough to capture previous work on web scraping. We conducted an experiment that evaluated several qualitatively different web scraping constituents (including previous work and combinations hereof) on about 11,000 HTML pages on daily versions of 17 web sites over a period of more than one year. Our framework solves three concrete problems with current web scraping and our experimental results indicate that composition of previous and our new techniques achieve a higher degree of accuracy, precision and specificity than existing tech-

KNN Model-Based Approach in Classification <=SEP=> The k-Nearest-Neighbours (kNN) is a simple but effective method for classification. The major drawbacks with respect to kNN are (1) its low efficiency being a lazy learning method prohibits it in many applications such as dynamic web mining for a large repository, and (2) its dependency on the selection of a “good value” for k. In this paper, we propose a novel kNN type method for classification that is aimed at overcoming these shortcomings. Our method constructs a kNN model for the data, which replaces the data to serve as the basis of classification. The value of k is automatically determined, is varied for different data, and is optimal in terms of classification accuracy. The construction of the model reduces the dependency on k and makes classification faster. Experiments were carried out on some public datasets collected from the UCI machine learning repository in order to test our method. The experimental results show that the kNN based model compares well with C5.0 and kNN in terms of classification accuracy, but is more efficient than the standard kNN.

A new retexturing method for virtual fitting room using Kinect 2 camera <=SEP=> This research work proposes a new method for garment retexturing using a single static image along with depth information obtained using the Microsoft Kinect 2 camera. First the garment is segmented out from the image and texture domain coordinates are computed for each pixel of the shirt using 3D information. After that shading is applied on the new colours from the texture image by applying linear stretching of the luminance of the segmented garment. The proposed method is colour and pattern invariant and results in to visually realistic retexturing. The proposed method has been tested on various images and it is shown that it generally performs better and produces more realistic results compared to the state-of-the-art methods. The proposed method can be an application for the virtual fitting room.

Classification of Various Neighborhood Operations for the Nurse Scheduling Problem <=SEP=> Since the nurse scheduling problem (NSP) is a problem of finding a feasible solution, the solution space must include infeasible solutions to solve it using a local search algorithm. However, the solution space consisting of all the solutions is so large that the search requires much CPU time. In the NSP, some constraints have higher priority. Thus, we can define the solution space to be the set of solutions satisfying some of the important constraints, which are called the elementary constraints. The connectivity of the solution space is also important for the performance. However, the connectivity is not obvious when the solution space consists only of solutions satisfying the elementary constraints and is composed of small neighborhoods. This paper gives theoretical support for using 4-opt-type neighborhood operations by discussing the connectivity of its solution space and the size of the neighborhood. Another interesting point in our model is a special case of the NSP corresponds to the bipartite transportation problem, and our result also applies to it.

Ecient Sparse Matrix-Vector Multiplication on CUDA <=SEP=> The massive parallelism of graphics processing units (GPUs) offers tremendous performance in many high-performance computing applications. While dense linear algebra readily maps to such platforms, harnessing this potential for sparse matrix computations presents additional challenges. Given its role in iterative methods for solving sparse linear systems and eigenvalue problems, sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In this paper we discuss data structures and algorithms for SpMV that are efficiently implemented on the CUDA platform for the fine-grained parallel architecture of the GPU. Given the memory-bound nature of SpMV, we emphasize memory bandwidth efficiency and compact storage formats. We consider a broad spectrum of sparse matrices, from those that are well-structured and regular to highly irregular matrices with large imbalances in the distribution of nonzeros per matrix row. We develop methods to exploit several common forms of matrix structure while offering alternatives which accommodate greater irregularity. On structured, grid-based matrices we achieve performance of 36 GFLOP/s in single precision and 16 GFLOP/s in double precision on a GeForce GTX 280 GPU. For unstructured finite-element matrices, we observe performance in excess of 15 GFLOP/s and 10 GFLOP/s in single and double precision respectively. These results compare favorably to prior state-of-the-art studies of SpMV methods on conventional multicore processors. Our double precision SpMV performance is generally two and a half times that of a Cell BE with 8 SPEs and more than ten times greater than that of a quad-core Intel Clovertown system.

High-speed VLSI architectures for the AES algorithm <=SEP=> This paper presents novel high-speed architectures for the hardware implementation of the Advanced Encryption Standard (AES) algorithm. Unlike previous works which rely on look-up tables to implement the SubBytes and InvSubBytes transformations of the AES algorithm, the proposed design employs combinational logic only. As a direct consequence, the unbreakable delay incurred by look-up tables in the conventional approaches is eliminated, and the advantage of subpipelining can be further explored. Furthermore, composite field arithmetic is employed to reduce the area requirements, and different implementations for the inversion in subfield GF(2/sup 4/) are compared. In addition, an efficient key expansion architecture suitable for the subpipelined round units is also presented. Using the proposed architecture, a fully subpipelined encryptor with 7 substages in each round unit can achieve a throughput of 21.56 Gbps on a Xilinx XCV1000 e-8 bg560 device in non-feedback modes, which is faster and is 79% more efficient in terms of equivalent throughput/slice than the fastest previous FPGA implementation known to date.

Improving Real-Time Captioning Experiences for Deaf and Hard of Hearing Students <=SEP=> We take a qualitative approach to understanding deaf and hard of hearing (DHH) students' experiences with real-time captioning as an access technology in mainstream university classrooms. We consider both existing human-based captioning as well as new machine-based solutions that use automatic speech recognition (ASR). We employed a variety of qualitative research methods to gather data about students' captioning experiences including in-class observations, interviews, diary studies, and usability evaluations. We also conducted a co-design workshop with 8 stakeholders after our initial research findings. Our results show that accuracy and reliability of the technology are still the most important issues across captioning solutions. However, we additionally found that current captioning solutions tend to limit students' autonomy in the classroom and present a variety of user experience shortcomings, such as complex setups, poor feedback and limited control over caption presentation. Based on these findings, we propose design requirements and recommend features for real-time captioning in mainstream classrooms.

An Empirical Examination of the Effects of Web Personalization at Different Stages of Decision-Making <=SEP=> Personalization agents are incorporated in many websites to tailor content and interfaces for individual users. But in contrast to the proliferation of personalized web services worldwide, empirical research studying the effects of web personalization is scant. How does exposure to personalized offers affect subsequent product consideration and choice outcome? Drawing on the literature in HCI and consumer behavior, this research examines the effects of web personalization on users’ information processing and expectations through different decision-making stages. A study using a personalized ring-tone download website was conducted. Our findings provide empirical evidence of the effects of web personalization. In particular, when consumers are forming their consideration sets, the agents have the capacity to help them discover new products and generate demand for unfamiliar products. Once the users have arrived at their choice, however, the persuasive effects from the personalization agent diminish. These results establish that adaptive role of personalization agents at different stages of decision-making.

Pacific kids DASH for health (PacDASH) randomized, controlled trial with DASH eating plan plus physical activity improves fruit and vegetable intake and diastolic blood pressure in children. <=SEP=> BACKGROUND
Pacific Kids DASH for Health (PacDASH) aimed to improve child diet and physical activity (PA) level and prevent excess weight gain and elevation in blood pressure (BP) at 9 months.


METHODS
PacDASH was a two-arm, randomized, controlled trial (ClinicalTrials.gov: NCT00905411). Eighty-five 5- to 8-year-olds in the 50th-99th percentile for BMI were randomly assigned to treatment (n=41) or control (n=44) groups; 62 completed the 9-month trial. Sixty-two percent were female. Mean age was 7.1±0.95 years. Race/ethnicity was Asian (44%), Native Hawaiian or Other Pacific Islander (28%), white (21%), or other race/ethnicity (7%). Intervention was provided at baseline and 3, 6 and 9 months, with monthly supportive mailings between intervention visits, and a follow-up visit at 15 months to observe maintenance. Diet and PA were assessed by 2-day log. Body size, composition, and BP were measured. The intervention effect on diet and PA, body size and composition, and BP by the end of the intervention was tested using an F test from a mixed regression model, after adjustment for sex, age, and ethnic group.


RESULTS
Fruit and vegetable (FV) intake decreased less in the treatment than control group (p=0.04). Diastolic BP (DBP) was 12 percentile units lower in the treatment than control group after 9 months of intervention (p=0.01). There were no group differences in systolic BP (SBP) or body size/composition.


CONCLUSIONS
The PacDASH trial enhanced FV intake and DBP, but not SBP or body size/composition.

Efficient Time-Domain Image Formation with Precise Topography Accommodation for General Bistatic SAR Configurations <=SEP=> Due to the lack of an appropriate symmetry in the acquisition geometry, general bistatic synthetic aperture radar (SAR) cannot benefit from the two main properties of low-to-moderate resolution monostatic SAR: azimuth-invariance and topography-insensitivity. The precise accommodation of azimuth-variance and topography is a real challenge for efficent image formation algorithms working in the Fourier domain, but can be quite naturally handled by time-domain approaches. We present an efficient and practical implementation of a generalised bistatic SAR image formation algorithm with an accurate accommodation of these two effects. The algorithm has a common structure with the monostatic fast-factorised backprojection (FFBP), and is therefore based on subaperture processing. The images computed over the different subapertures are displayed in an advantageous elliptical coordinate system capable of incorporating the topographic information of the imaged scene in an analogous manner as topography-dependent monostatic SAR algorithms do. Analytical expressions for the Nyquist requirements using this coordinate system are derived. The overall discussion includes practical implementation hints and a realistic computational burden estimation. The algorithm is tested with both simulated and actual bistatic SAR data. The actual data correspond to the spaceborne-airborne experiment between TerraSAR-X and F-SAR performed in 2007 and to the DLR-ONERA airborne experiment carried out in 2003. The presented approach proves its suitability for the precise SAR focussing of the data acquired in general bistatic configurations.

Machine Comprehension Based on Learning to Rank <=SEP=> Machine comprehension plays an essential role in NLP and has been widely explored with dataset like MCTest. However, this dataset is too simple and too small for learning true reasoning abilities. (Hermann et al., 2015) therefore release a large scale news article dataset and propose a deep LSTM reader system for machine comprehension. However, the training process is expensive. We therefore try feature-engineered approach with semantics on the new dataset to see how traditional machine learning technique and semantics can help with machine comprehension. Meanwhile, our proposed L2R reader system achieves good performance with efficiency and less training data.