Genomewide Linkage Scan of 409 European-ancestry and African American Families with Schizophrenia: Suggestive Evidence of Linkage at 8p23.3-p21.2 and 11p13.1-q14.1 in the Combined Sample

We report the clinical characteristics of a schizophrenia sample of 409 pedigrees-263 of European ancestry ( EA) and 146 of African American ancestry ( AA)-together with the results of a genome scan ( with a simple tandem repeat polymorphism interval of 9 cM) and follow-up fine mapping. A family was required to have a proband with schizophrenia ( SZ) and one or more siblings of the proband with SZ or schizoaffective disorder. Linkage analyses included 403 independent full-sibling affected sibling pairs ( ASPs) ( 279 EA and 124 AA) and 100 all-possible half-sibling ASPs ( 15 EA and 85 AA). Nonparametric multipoint linkage analysis of all families detected two regions with suggestive evidence of linkage at 8p23.3-q12 and 11p11.2-q22.3 ( empirical Z likelihood-ratio score [ Z(lr)] threshold >= 2.65) and, in exploratory analyses, two other regions at 4p16.1-p15.32 in AA families and at 5p14.3-q11.2 in EA families. The most significant linkage peak was in chromosome 8p; its signal was mainly driven by the EA families. Z(lr) scores >= 2.0 in 8p were observed from 30.7 cM to 61.7 cM ( Center for Inherited Disease Research map locations). The maximum evidence in the full sample was a multipoint Z(lr) of 3.25 ( equivalent Kong-Cox LOD of 2.30) near D8S1771 ( at 52 cM); there appeared to be two peaks, both telomeric to neuregulin 1 ( NRG1). There is a paracentric inversion common in EA individuals within this region, the effect of which on the linkage evidence remains unknown in this and in other previously analyzed samples. Fine mapping of 8p did not significantly alter the significance or length of the peak. We also performed fine mapping of 4p16.3-p15.2, 5p15.2-q13.3, 10p15.3-p14, 10q25.3-q26.3, and 11p13-q23.3. The highest increase in Z(lr) scores was observed for 5p14.1-q12.1, where the maximum Z(lr) increased from 2.77 initially to 3.80 after fine mapping in the EA families.

Parsing Arabic relative clauses: A paninian dependency grammar approach

We present an approach to parsing rehive clauses in Arabic in the tradition of the Paninian Grammar Frumework/2] which leads to deriving U common logicul form for equivalent sentences. Particular attention is paid to the analysis of resumptive pronouns in the retrieval of syntuctico-semantic relationships. The analysis arises from the development of a lexicalised dependency grammar for Arabic that has application for machine translation.

DEA models for ratio data:convexity consideration

Data envelopment analysis (DEA) is defined based on observed units and by finding the distance of each unit to the border of estimated production possibility set (PPS). The convexity is one of the underlying assumptions of the PPS. This paper shows some difficulties of using standard DEA models in the presence of input-ratios and/or output-ratios. The paper defines a new convexity assumption when data includes a ratio variable. Then it proposes a series of modified DEA models which are capable to rectify this problem.

An extended minimax disparity to determine the OWA operator weights

This paper contributes to extend the minimax disparity to determine the ordered weighted averaging (OWA) model based on linear programming. It introduces the minimax disparity approach between any distinct pairs of the weights and uses the duality of linear programming to prove the feasibility of the extended OWA operator weights model. The paper finishes with an open problem. © 2006 Elsevier Ltd. All rights reserved.

A note on DEA models in technology selection:an improvement of Karsak and Ahiska's approach

This paper introduces a compact form for the maximum value of the non-Archimedean in Data Envelopment Analysis (DEA) models applied for the technology selection, without the need to solve a linear programming (LP). Using this method the computational performance the common weight multi-criteria decision-making (MCDM) DEA model proposed by Karsak and Ahiska (International Journal of Production Research, 2005, 43(8), 1537-1554) is improved. This improvement is significant when computational issues and complexity analysis are a concern.

Inverse forecasting:a new approach for predictive modelling

In the last two decades there have been substantial developments in the mathematical theory of inverse optimization problems, and their applications have expanded greatly. In parallel, time series analysis and forecasting have become increasingly important in various fields of research such as data mining, economics, business, engineering, medicine, politics, and many others. Despite the large uses of linear programming in forecasting models there is no a single application of inverse optimization reported in the forecasting literature when the time series data is available. Thus the goal of this paper is to introduce inverse optimization into forecasting field, and to provide a streamlined approach to time series analysis and forecasting using inverse linear programming. An application has been used to demonstrate the use of inverse forecasting developed in this study. © 2007 Elsevier Ltd. All rights reserved.

Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

Determining more realistic OWA weights

The concept of ordered weighted averaging (OWA) operator weights arises in uncertain decision making problems, however some weights may have a specific relationship with other. This information about the weights can be obtained from decision makers (DMs). This paper intends to introduce a theory of weight restrictions into the existing OWA operator weight models. Based on the DMs' value judgment the obtained OWA operator weights could be more realistic.

Finding relevant search engine results:a minimax linear programming approach

For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach.