Comparative analysis of inbreeding parameters and runs of homozygosity islands in 2 Italian autochthonous cattle breeds mainly raised in the Parmigiano-Reggiano cheese production region

Reggiana and Modenese are autochthonous cattle breeds, reared in the North of Italy, that can be mainly distinguished for their standard coat color (Reggiana is red, whereas Modenese is white with some pale gray shades). Almost all milk produced by these breeds is transformed into 2 mono-breed branded Parmigiano-Reggiano cheeses, from which farmers receive the economic incomes needed for the sustainable conservation of these animal genetic resources. After the setting up of their herd books in 1960s, these breeds experienced a strong reduction in the population size that was subsequently reverted starting in the 1990s (Reggiana) or more recently (Modenese) reaching at present a total of about 2,800 and 500 registered cows, respectively. Due to the small population size of these breeds, inbreeding is a very important cause of concern for their conservation programs. Inbreeding is traditionally estimated using pedigree data, which are summarized in an inbreeding coefficient calculated at the individual level (F_PED). However, incompleteness of pedigree information and registration errors can affect the effectiveness of conservation strategies. High-throughput SNP genotyping platforms allow investigation of inbreeding using genome information that can overcome the limits of pedigree data. Several approaches have been proposed to estimate genomic inbreeding, with the use of runs of homozygosity (ROH) considered to be the more appropriate. In this study, several pedigree and genomic inbreeding parameters, calculated using the whole herd book populations or considering genotyping information (GeneSeek GGP Bovine 150K) from 1,684 Reggiana cattle and 323 Modenese cattle, were compared. Average inbreeding values per year were used to calculate effective population size. Reggiana breed had generally lower genomic inbreeding values than Modenese breed. The low correlation between pedigree-based and genomic-based parameters (ranging from 0.187 to 0.195 and 0.319 to 0.323 in the Reggiana and Modenese breeds, respectively) reflected the common problems of local populations in which pedigree records are not complete. The high proportion of short ROH over the total number of ROH indicates no major recent inbreeding events in both breeds. ROH islands spread over the genome of the 2 breeds (15 in Reggiana and 14 in Modenese) identified several signatures of selection. Some of these included genes affecting milk production traits, stature, body conformation traits (with a main ROH island in both breeds on BTA6 containing the ABCG2, NCAPG, and LCORL genes) and coat color (on BTA13 in Modenese containing the ASIP gene). In conclusion, this work provides an extensive comparative analysis of pedigree and genomic inbreeding parameters and relevant genomic information that will be useful in the conservation strategies of these 2 iconic local cattle breeds.     

A synergistic strategy for combining thesaurus-based and corpus-based approaches in building ontology for multilingual search engines

In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings.     

Long-run urban dynamics: understanding local housing market change in London

Abstract

Recently, a literature has emerged using empirical techniques to study the evolution of international cities over many centuries; however, few studies examine long-run change within cities. Conventional models and concepts are not always appropriate and data issues make long-run neighbourhood analysis particularly problematic. This paper addresses some of these points. First, it discusses why the analysis of long-run urban change is important for modern urban policy and considers the most important concepts. Second, it constructs a novel data set at the micro level, which allows consistent comparisons of London neighbourhoods in 1881 and 2001. Third, the paper models some of the key factors that affected long-run change, including the role of housing. There is evidence that the relative social positions of local urban areas persist over time but, nevertheless, at fine spatial scales, local areas still exhibit change, arising from aggregate population dynamics, from advances in technology, and also from the effects of shocks, such as wars. In general, where small areas are considered, long-run changes are likely to be greater, because individuals are more mobile over short than long distances. Finally, the paper considers the implications for policy.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Gradient-based recursive parameter estimation for a periodically nonuniformly sampled-data Hammerstein–Wiener system based on the key-term separation

The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.     

SINA: Semantic interpretation of user queries for question answering on interlinked data

The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。     

结合公钥加密和关键字可搜索加密的加密方案

带关键字搜索的公钥加密(PEKS)是一种有用的加密原语，它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器，而不影响原始数据的安全性和隐私性。但是，由于缺乏对于数据的加密以及解密能力，PEKS方案不能单独进行使用，必须与标准的公钥加密方案(PKE)相结合。因此，Baek等人在2006年引入了一种新的加密原语，称为结合PKE和PEKS的加密方案(PKE+PEKS)，它同时提供了PKE和PEKS的功能。目前，已有文献提出了几种PKE+PEKS方案。然而，他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案，与已有方案相比，该方案在性能上有很大的提升，并且在生成关键字和数据密文时，不需要使用双线性对，极大地降低了计算和存储成本。安全性分析表明，本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明，本分提出的方案更加高效。