A spanning heuristic for the unordered and ordered matching identification problem

The matching identification problem (MIP) is a combinatoric search problem related to the fields of learning from examples, boolean functions, and knowledge acquisition. The MIP involves identifying a single “goal” item from a large set of items. Because there is commonly a cost associated with evaluating each guess, the goal item should be identified in as few guesses as possible. As in most search problems, the items have a similar structure, which allows an evaluation of each guessed item. In other words, each guessed item elicits partial information about the goal item, i.e. how similar the guess is to the goal. With this information the goal is more quickly identified.The unordered MIP has been studied by Mehrez and Steinberg (ORSA J. Comput. 7 (1995) 211) in which they proposed two different types of algorithms. The purpose of the present paper is to suggest an improved Spanning Heuristic algorithm. Its improvement increases as the problem size increases. Further results and comparisons are derived for the unordered and ordered cases.This research shows that when the search space is very large, it is better to inquire from items that are known not to be the goal (they have been ruled out by previous guesses), for the purpose of acquiring more information about the goal. As the search space is narrowed, it is better to guess items that have not been ruled out.     

(When) Is job-finding via personal contacts a meaningful concept for social network analysis? A comment to

Chua (2011) argues that in a meritocratic context, institutions restrict the usefulness of social networks in exerting influence on job seekers’ earnings. Regressing job-finding via personal contacts on earnings, he finds negative effects of influence via personal contacts, especially for the well-educated and individuals working in the state sector. In this comment, I argue that these results are ambiguous because (1) the analysis does not sufficiently distinguish between job ‘search’ methods and job ‘finding’ methods, (2) job-finding method indicates information flow rather than a personal contact's influence, and (3) it remains unclear whether Chua's analysis reflects the effect of network usage in job search per se or the effect of self-selection into network usage by individuals with low earning potential.     

Asymptotic Theory of Outlier Detection Algorithms for Linear Time Series Regression Models

Outlier detection algorithms are intimately connected with robust statistics that down‐weight some observations to zero. We define a number of outlier detection algorithms related to the Huber‐skip and least trimmed squares estimators, including the one‐step Huber‐skip estimator and the forward search. Next, we review a recently developed asymptotic theory of these. Finally, we analyse the gauge, the fraction of wrongly detected outliers, for a number of outlier detection algorithms and establish an asymptotic normal and a Poisson theory for the gauge.     

A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing

This paper investigates an integrated production and transportation scheduling problem in an MTO supply chain. A harmony search-based memetic optimization model is developed to handle this problem, in which certain heuristic procedures are proposed to convert the investigated problem into an order assignment problem. A novel improvisation process is also proposed to improve the optimum-seeking performance. The effectiveness of the proposed model is validated by numerical experiments. The experimental results show that (1) the proposed model can solve the investigated problem effectively and that (2) the proposed memetic optimization process exhibits better optimum-seeking performance than genetic algorithm-based and traditional memetic optimization processes.     

论夜间搜查——从两则案例谈起

由于我国《刑事诉讼法》对搜查的时间未作规定,导致司法实践中夜间搜查频繁出现。夜间搜查很容易侵犯被搜查人和与其同住的人的隐私权和生活安宁权,给其造成伤害,司法实践中也确实发生了因夜间搜查而把人吓病的案例。因此,我国在再次修改《刑事诉讼法》时应规定禁止夜间搜查。当然,在保护公民隐私权和生活安宁权的同时,也要兼顾打击犯罪的需要,法律可以设置一些禁止夜间搜查的例外。     

Do resources of network members help in help seeking? Social capital and health information search

Does social capital as resources of network members affect health information search? Analyzing data from the 2004 General Social Survey in the United States, this study measures two social capital indicators (average education of network members and proportion of network members with a high school degree or higher) using the name generator. Most results are consistent using those two indicators. Both indicators are positively associated with frequency of health information seeking and seekers’ frequency of use of two sources (friends or relatives and the Internet). Also average education of network members is positively associated with seekers’ diversity of used sources and frequency of consultation with medical professionals. But neither indicator is associated with seekers’ frequency of use of other four sources (health-related magazines or newsletters, general magazines, daily newspapers, and radio or television programs). The findings demonstrate the theoretical utility of social capital in the social dynamics of medical help-seeking.     

Attachment and Self‐Efficacy in Career Search Activities: A Structural Model

The author integrated attachment theory with social cognitive career theory (SCCT) to examine how attachment styles influence the career search self‐efficacy activities of interviewing, networking, job searching, and personal exploration. Using an undergraduate sample (N = 275, 81% women), the author tested a structural model. Results indicated that anxious attachment style was negatively related to interviewing self‐efficacy, whereas avoidant attachment style was negatively related to networking, job searching, and personal exploration self‐efficacy. Theoretical implications based on these findings provide support for an integrative model of attachment theory with SCCT. Career counselors are encouraged to consider clients’ attachment styles when working with individuals who are searching for employment. To help address the limitations of the study, future researchers could test the applicability of the current model with a more diverse sample.     

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.