Reversible jump Markov chain Monte Carlo algorithms for Bayesian variable selection in logistic mixed models

In this article, to reduce computational load in performing Bayesian variable selection, we used a variant of reversible jump Markov chain Monte Carlo methods, and the Holmes and Held (HH) algorithm, to sample model index variables in logistic mixed models involving a large number of explanatory variables. Furthermore, we proposed a simple proposal distribution for model index variables, and used a simulation study and real example to compare the performance of the HH algorithm with our proposed and existing proposal distributions. The results show that the HH algorithm with our proposed proposal distribution is a computationally efficient and reliable selection method.     

比较法视野下我国搜查措施之理论反思

我国有证搜查还处于内部控制、自我约束和事后监督的阶段。被搜查者的合法权利不得不严重依赖于侦查人员搜查的文明程度。而无证搜查立法的拘谨与侦查实践的现实需要之间存在显著的差异。我国搜查措施所存在的问题,显示出搜查措施对侦查机关的规范和约束力度还处于较低的水平,对被搜查者权利的保障仍有所不足。我国不仅需要完善有证搜查制度,而且更需要建立和规范以同意搜查为核心的无证搜查制度,以追随刑事诉讼现代化之步伐,实现法治中国之梦想。     

HRD in 2020: a hop-on,hop-off city tour

This article reports on the outcome of a Future Search Conference in the UK to consider human resource development (HRD) in 2020 and beyond. We firstly consider themes from the past into the present. This includes the persistence of solutions in HRD that are systematic, predictable, how apprenticeships in the UK have had to accommodate government policies to ameliorate youth unemployment and the long-standing difficulty for HRD of failing to demonstrate a return on investment (ROI) on activities. We then present four scenarios based on key questions for the future relating to value of HRD and whether this will be a future for HRD. Reponses to the questions form scenario logics which we present against the theme of city tour. Each scenario is explained against the presented logic with positive, negative, ambiguous and uncertain implications for HRD. We suggest that each scenario carries a glimpse of what might be.     

知识搜索引擎与翻译

信息化进程的纵深发展对翻译行业产生了深刻的影响,译者如何从海量信息中高效获取信息关系到其翻译服务的质量。因此,译者的信息素养和搜索能力显得愈发重要。通过探讨搜索引擎的补充和延伸——知识搜索引擎,着重论述知识搜索引擎相对于传统搜索引擎,在主题分类、一站式知识检索、互动式知识问答、个性化知识库等方面具备的突出优势,并对比国内三大知识搜索引擎,论述其在翻译实践中的重要启示。     

Fast and approximate exhaustive variable selection for generalised linear models with APES

We present APproximated Exhaustive Search (APES), which enables fast and approximated exhaustive variable selection in Generalised Linear Models (GLMs). While exhaustive variable selection remains as the gold standard in many model selection contexts, traditional exhaustive variable selection suffers from computational feasibility issues. More precisely, there is often a high cost associated with computing maximum likelihood estimates (MLE) for all subsets of GLMs. Efficient algorithms for exhaustive searches exist for linear models, most notably the leaps‐and‐bound algorithm and, more recently, the mixed integer optimisation (MIO) algorithm. The APES method learns from observational weights in a generalised linear regression super‐model and reformulates the GLM problem as a linear regression problem. In this way, APES can approximate a true exhaustive search in the original GLM space. Where exhaustive variable selection is not computationally feasible, we propose a best‐subset search, which also closely approximates a true exhaustive search. APES is made available in both as a standalone R package as well as part of the already existing mplot package.     

The triggers of local and distant search: Relative magnitude and persistence in explaining acquisition relatedness

Research on problemistic search has assumed negative attainment discrepancy to be the trigger of both local and distant search. Extending this research, we present and compare two additional triggers: (1) relative attainment discrepancy, which reflects how much a firm's attainment discrepancy deviates from its past negative attainment discrepancies; and (2) persistent attainment discrepancy, which reflects how often the firm experiences below-aspirations performance. Our triggers for distant search model a behavioral explanation for the timing and relatedness of acquisitions. We find support for baseline arguments of problemistic search whereby firms increase both industry- and skill-related acquisitions when they perform below aspirations. When they persistently perform below aspirations, however, this likelihood is reduced and firms engage in acquisitions that are more unrelated, thereby providing support for the notion of expanding search boundaries from local to distant search. Of the two triggers of distant search proposed, relative attainment discrepancy does not induce firms to expand search boundaries. Our results indicate that persistent attainment discrepancy is a key construct to consider when studying the expansion of search boundaries.     

基于音乐搜索排行榜测量的研究

在现代生活中,音乐、电影和美术已经是不可或缺的重要组成部分。音乐排行榜在音乐工业中也起着非常重要的作用。针对一种新型的排行榜,实时的搜索排行榜进行研究。通过数据的采集与分析,研究这一类型的排行榜的排名特征和用户行为。从研究结果中,发现了搜索排行榜与传统的商业性排行榜的差别就是这一新兴排行榜中存在一部分特殊用户。近而研究了这些特殊用户的用户行为特征以及给排行榜带来的影响。     

互联网免费专利搜索引擎innojoy在专利检索分析中的应用

专利文献是专利技术信息的载体,对专利文献进行分析可以为企业了解行业格局、掌握竞争对手动向及研发立项提供重要参考。互联网免费专利搜索引擎的出现为企业专利工作者进行专利文献的检索分析提供了便利。本文以innojoy为例,介绍了互联网免费专利搜索引擎在专利检索分析中的应用。     

改进离散人工蜂群算法规划异形满版服饰图案切割路径

服饰图案切割路径规划是服饰图案自动切割技术的关键部分之一。文中用改进的离散人工蜂群算法实现了激 光切割系统对异形满版服饰图案的切割工艺路径规划优化。首先,把满版服饰图案激光切割路径规划转化为广义旅行 商问题求解,证明了路径规划转化成普通TSP问题比转化成第一类广义TSP问题更为有效,并给出了路径规划中“图案 始切割点”的优化选择方法。然后结合部分匹配交叉和启发式变异搜索方法的人工蜂群算法求解TSP问题,证明了与 A*算法及遗传算法相比,该方法更为优越。并且该方法已应用于激光切割机切割异形满版服饰图案路径规划的生产实 践,运行可靠,比未规划时的工艺路线平均提高效率33.7%。该方法提供了一种解决TSP问题的新方法,具有一定的理 论意义和价值     

刑事搜查立法精密化比较研究

刑事搜查制度既关系到刑事侦查权的正当行使,又关系到被搜查人的人权保护,各国立法者都要在打击犯罪和保障人权之间进行艰难的价值选择,因此西方法治国家的立法者设计了一套精密科学的机制。然而我国关于刑事搜查制度方面的立法粗糙,人权保障不足。借鉴域外经验对我国刑事搜查制度予以全面改造,才是明智之举。