析科技翻译论著中汉语语法术语的误用

随着科学技术的发展 ,研究和探讨科技翻译的著作不断问世 ,但是目前有些论述科技英汉、汉英翻译的书籍在使用汉语语法术语方面不够正确。该文从词、句子成分和句的角度分析了汉语语法术语误用的情况。     

科技期刊表格常见编排问题及规范加工

针对科技期刊表格编排中常见的问题,以国家有关科技期刊编排标准为依据,对其进行了规范性及科学性分析,给出了解决表格编排中存在问题的正确做法;指出了科技期刊表格编排必须科学、规范、简洁、自明.     

A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks

The problem of determining the number of multi-type protection devices and their locations on electrical supply tree networks with subtree dependency is investigated. The aim is to reduce the amount of inconvenience caused to customers that are affected by any given fault on the networks. An appropriate implementation of tabu search is proposed. We exploit a variable neighborhood and a soft aspiration level, and we embed a data structure and reduction tests into the search to speed up the process. Computational tests are performed on randomly generated electrical tree networks varying in size and branch complexity with encouraging results.     

概念检索在因特网中的应用及比较研究

本文从概念检索的概念介绍入手,简介了概念检索在因特网中的应用情况,并对目前的几个具有概念检索功能的中文搜索引擎进行了比较研究,对结果进行分析,发现这几个搜索引擎在一定程度上实现了概念检索,但效果都不大理想,概念检索的理论研究与实际应用情况存在一段差距。     

新一代中文智能搜索引擎研究

本文主要论述了新一代中文智能搜索引擎的发展、工作原理、特点及其发展趋势     

科技期刊的信息工作

阐述了信息工作在科技期刊办刊实践中的地位,归纳出信息工作的内容,即作者信息、读者市场信息、审稿人信息、报道领域的动态信息,以及学术出版业内信息等,并指出科技期刊应通过日常工作、学术会议、互联网络等渠道发布和收集信息。     

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.