Determinants of linear judgment: A meta-analysis of lens model studies

The mathematical representation of Brunswik s lens model has been usedextensively to study human judgment and provides a unique opportunity to conduct ameta-analysis of studies that covers roughly five decades. Specifically, we analyzestatistics of the lens model equation (Tucker, 1964) associated with 259 different taskenvironments obtained from 78 papers. In short, we find on average fairly high levelsof judgmental achievement and note that people can achieve similar levels of cognitiveperformance in both noisy and predictable environments. Although overall performancevaries little between laboratory and field studies, both differ in terms of components ofperformance and types of environments (numbers of cues and redundancy). An analysisof learning studies reveals that the most effective form of feedback is information aboutthe task. We also analyze empirically when bootstrapping is more likely to occur. Weconclude by indicating shortcomings of the kinds of studies conducted to date, limitationsin the lens model methodology, and possibilities for future research.

Consumer choice in competitive location models: Formulations and heuristics

A new direction of research in Competitive Location theory incorporatestheories of Consumer Choice Behavior in its models. Following thisdirection, this paper studies the importance of consumer behavior withrespect to distance or transportation costs in the optimality oflocations obtained by traditional Competitive Location models. To dothis, it considers different ways of defining a key parameter in thebasic Maximum Capture model (MAXCAP). This parameter will reflectvarious ways of taking into account distance based on several ConsumerChoice Behavior theories. The optimal locations and the deviation indemand captured when the optimal locations of the other models are usedinstead of the true ones, are computed for each model. A metaheuristicbased on GRASP and Tabu search procedure is presented to solve all themodels. Computational experience and an application to 55-node networkare also presented.

Incorporating waiting time in competitive location models: Formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum CaptureProblem. In the original MCP, market capture is obtained by lower traveling distances or lowertraveling time, in this new version not only the traveling time but also the waiting time willaffect the market share. This problem is hard to solve using standard optimization techniques.Metaheuristics are shown to offer accurate results within acceptable computing times.

On heuristic and linear models of judgment: Mapping the demand for knowledge

Research on judgment and decision making presents a confusing picture of human abilities. For example, much research has emphasized the dysfunctional aspects of judgmental heuristics, and yet, other findings suggest that these can be highly effective. A further line of research has modeled judgment as resulting from as if linear models. This paper illuminates the distinctions in these approaches by providing a common analytical framework based on the central theoretical premise that understanding human performance requires specifying how characteristics of the decision rules people use interact with the demands of the tasks they face. Our work synthesizes the analytical tools of lens model research with novel methodology developed to specify the effectiveness of heuristics in different environments and allows direct comparisons between the different approaches. We illustrate with both theoretical analyses and simulations. We further link our results to the empirical literature by a meta-analysis of lens model studies and estimate both human andheuristic performance in the same tasks. Our results highlight the trade-off betweenlinear models and heuristics. Whereas the former are cognitively demanding, the latterare simple to use. However, they require knowledge and thus maps of when andwhich heuristic to employ.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Solving a concrete sleepers production scheduling by genetic algorithms

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

Can the trabecular bone score (TBS) be considered as a major clinical risk factor (CRF) of osteoporotic fractures? A meta-like analysis

Abstract: To have an added value over BMD, a CRF of osteoporotic fracture must be predictable of the fracture, independent of BMD, reversible and quantifiable. Many major recognized CRF exist.Out of these factorsmany of themare indirect factor of bone quality. TBS predicts fracture independently of BMD as demonstrated from previous studies. The aim of the study is to verify if TBS can be considered as a major CRF of osteoporotic fracture. Existing validated datasets of Caucasian women were analyzed. These datasets stem from different studies performed by the authors of this report or provided to our group. However, the level of evidence of these studies will vary. Thus, the different datasets were weighted differently according to their design. This meta-like analysis involves more than 32000 women (≥50 years) with 2000 osteoporotic fractures from two prospective studies (OFELY&MANITOBA) and 7 crosssectional studies. Weighted relative risk (RR) for TBS was expressed for each decrease of one standard deviation as well as per tertile difference (TBS=1.300 and 1.200) and compared with those obtained for the major CRF included in FRAX®. Overall TBS RR obtained (adjusted for age) was 1.79 [95%CI-1.37-2.37]. For all women combined, RR for fracture for the lowest comparedwith themiddle TBS tertilewas 1.55[1.46- 1.68] and for the lowest compared with the highest TBS tertile was 2.8[2.70-3.00]. TBS is comparable to most of the major CRF (Fig 1) and thus could be used as one of them. Further studies have to be conducted to confirm these first findings.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Investigating the possible causal association of smoking with depression and anxiety using Mendelian randomisation meta-analysis: the CARTA consortium.

OBJECTIVES: To investigate whether associations of smoking with depression and anxiety are likely to be causal, using a Mendelian randomisation approach. DESIGN: Mendelian randomisation meta-analyses using a genetic variant (rs16969968/rs1051730) as a proxy for smoking heaviness, and observational meta-analyses of the associations of smoking status and smoking heaviness with depression, anxiety and psychological distress. PARTICIPANTS: Current, former and never smokers of European ancestry aged ≥16 years from 25 studies in the Consortium for Causal Analysis Research in Tobacco and Alcohol (CARTA). PRIMARY OUTCOME MEASURES: Binary definitions of depression, anxiety and psychological distress assessed by clinical interview, symptom scales or self-reported recall of clinician diagnosis. RESULTS: The analytic sample included up to 58 176 never smokers, 37 428 former smokers and 32 028 current smokers (total N=127 632). In observational analyses, current smokers had 1.85 times greater odds of depression (95% CI 1.65 to 2.07), 1.71 times greater odds of anxiety (95% CI 1.54 to 1.90) and 1.69 times greater odds of psychological distress (95% CI 1.56 to 1.83) than never smokers. Former smokers also had greater odds of depression, anxiety and psychological distress than never smokers. There was evidence for positive associations of smoking heaviness with depression, anxiety and psychological distress (ORs per cigarette per day: 1.03 (95% CI 1.02 to 1.04), 1.03 (95% CI 1.02 to 1.04) and 1.02 (95% CI 1.02 to 1.03) respectively). In Mendelian randomisation analyses, there was no strong evidence that the minor allele of rs16969968/rs1051730 was associated with depression (OR=1.00, 95% CI 0.95 to 1.05), anxiety (OR=1.02, 95% CI 0.97 to 1.07) or psychological distress (OR=1.02, 95% CI 0.98 to 1.06) in current smokers. Results were similar for former smokers. CONCLUSIONS: Findings from Mendelian randomisation analyses do not support a causal role of smoking heaviness in the development of depression and anxiety.

Active learning methods for remote sensing image classification

In this paper, we propose two active learning algorithms for semiautomatic definition of training samples in remote sensing image classification. Based on predefined heuristics, the classifier ranks the unlabeled pixels and automatically chooses those that are considered the most valuable for its improvement. Once the pixels have been selected, the analyst labels them manually and the process is iterated. Starting with a small and nonoptimal training set, the model itself builds the optimal set of samples which minimizes the classification error. We have applied the proposed algorithms to a variety of remote sensing data, including very high resolution and hyperspectral images, using support vector machines. Experimental results confirm the consistency of the methods. The required number of training samples can be reduced to 10% using the methods proposed, reaching the same level of accuracy as larger data sets. A comparison with a state-of-the-art active learning method, margin sampling, is provided, highlighting advantages of the methods proposed. The effect of spatial resolution and separability of the classes on the quality of the selection of pixels is also discussed.

The Impact of Cannabis Use on Cognitive Functioning in Patients With Schizophrenia: A Meta-analysis of Existing Findings and New Data in a First-Episode Sample.

Cannabis use is highly prevalent among people with schizophrenia, and coupled with impaired cognition, is thought to heighten the risk of illness onset. However, while heavy cannabis use has been associated with cognitive deficits in long-term users, studies among patients with schizophrenia have been contradictory. This article consists of 2 studies. In Study I, a meta-analysis of 10 studies comprising 572 patients with established schizophrenia (with and without comorbid cannabis use) was conducted. Patients with a history of cannabis use were found to have superior neuropsychological functioning. This finding was largely driven by studies that included patients with a lifetime history of cannabis use rather than current or recent use. In Study II, we examined the neuropsychological performance of 85 patients with first-episode psychosis (FEP) and 43 healthy nonusing controls. Relative to controls, FEP patients with a history of cannabis use (FEP + CANN; n = 59) displayed only selective neuropsychological impairments while those without a history (FEP - CANN; n = 26) displayed generalized deficits. When directly compared, FEP + CANN patients performed better on tests of visual memory, working memory, and executive functioning. Patients with early onset cannabis use had less neuropsychological impairment than patients with later onset use. Together, these findings suggest that patients with schizophrenia or FEP with a history of cannabis use have superior neuropsychological functioning compared with nonusing patients. This association between better cognitive performance and cannabis use in schizophrenia may be driven by a subgroup of "neurocognitively less impaired" patients, who only developed psychosis after a relatively early initiation into cannabis use.