Learning effect and deteriorating jobs in the single machine scheduling problems

This paper studies the single machine scheduling problems with learning effect and deteriorating jobs simultaneously. In this model, the processing times of jobs are defined as functions of their starting times and positions in a sequence. It is shown that even with the introduction of learning effect and deteriorating jobs to job processing times, the makespan, the total completion time and the sum of the k$k$th power of completion times minimization problems remain polynomially solvable, respectively. But for the following objective functions: the total weighted completion time and the maximum lateness, this paper proves that the shortest weighted processing time first (WSPT) rule and the earliest due-date first (EDD) rule can construct the optimal sequence under some special cases, respectively.     

Representation in the (Artificial) Immune System

Much of contemporary research in Artificial Immune Systems (AIS) has partitioned into either algorithmic machine learning and optimisation, or, modelling biologically plausible dynamical systems, with little overlap between. We propose that this dichotomy is somewhat to blame for the lack of significant advancement of the field in either direction and demonstrate how a simplistic interpretation of Perelson’s shape-space formalism may have largely contributed to this dichotomy. In this paper, we motivate and derive an alternative representational abstraction. To do so we consider the validity of shape-space from both the biological and machine learning perspectives. We then take steps towards formally integrating these perspectives into a coherent computational model of notions such as life-long learning, degeneracy, constructive representations and contextual recognition—rhetoric that has long inspired work in AIS, while remaining largely devoid of operational definition.     

薏仁种类的近红外光谱技术快速鉴别

薏仁是一种药食两用资源,对其品质快速鉴别的需求也越来越多,近红外光谱技术(near infrared spectroscopy,NIRS)作为一种快速、 无损且环保的方法正适合这一需求。 以不同产地和品种薏仁的近红外光谱为基础,结合化学计量学方法对薏仁种类进行鉴别。 对原光谱用无监督学习算法主成分分析(principal component analysis,PCA)和有监督学习算法学习向量量化(learning vector quantization,LVQ)神经网络、 支持向量机(support vector machine,SVM)进行定性判别分析。 由于不同地区和不同品种的薏仁营养物质组成复杂且含量相近,所选两类薏仁的特征变量很相似,因而PCA得分图重叠严重,很难区分;而LVQ神经网络和SVM都能得到满意结果,LVQ神经网络的预测正确率为90.91%,SVM在经过惩罚参数和核函数参数优选后,分类准确率能达到100%。 结果表明：近红外光谱技术结合化学计量学方法可作为一种快速、 无损、 可靠的方法用于薏仁种类的鉴别,并为市场规范提供技术参考。     

Manifold‐based canonical correlation analysis for wireless sensor network localization

Signal‐strength‐based location estimation in wireless sensor networks is to locate the physical positions of unknown sensors via the received signal strengths. In this field, there are few localization researches sufficiently exploiting topology structures of the network in both signal space and physical space. The goal of this paper is to first establish two effective localization models based on specific manifold (or local) structures of both signal space and physical (location) space by using our previous locality preserving canonical correlation analysis (LPCCA) model and a newly‐proposed locality correlation analysis (LCA) model, and then develop their corresponding novel location algorithms, called location estimation—LPCCA (LE—LPCCA) and location estimation—LCA (LE—LCA). Since both LPCCA and LCA relatively sufficiently take into account locality characteristics of the manifold structures in both the spaces, our localization algorithms developed from them consequently achieve better localization accuracy than other publicly available advanced algorithms. Copyright © 2011 John Wiley & Sons, Ltd.     

基于贝叶斯稀疏学习的多跳频信号频率跟踪方法

以往的跳频信号参数盲估计方法大多难以适应多个信号同时存在的情况,且需要积累一定数量的样本以后才能从中提取所需要的信息.为了稳定实时地跟踪跳频信号的频率,该文提出一种利用贝叶斯稀疏学习的单/多通道跳频信号频率估计和跳变时刻检测方法来实现多跳频信号频率的实时跟踪.首先建立了多跳频信号的稀疏表示模型,然后介绍了多观测贝叶斯稀疏学习算法及跳变时刻实时检测方法,最后仿真结果验证方法的有效性.     

A content-adaptive sharpness enhancement algorithm using 2D FIR filters trained by pre-emphasis

This paper proposes a content-adaptive sharpening algorithm using two-dimensional (2D) FIR filters trained by pre-emphasis for various image pairs. In the learning stage, all low-quality (LQ) and high-quality (HQ) image pairs are first pre-emphasized, i.e., properly sharpened. Then selective 2D FIR filter coefficients for high-frequency synthesis are trained using the pre-emphasized LQ–HQ image pairs, and then are stored in a dictionary that resembles an LUT (look-up table). In the inference stage, each input image is pre-emphasized in the same manner as in the learning stage. The best-matched 2D filter for each LQ patch is then found in the dictionary, and an HQ patch corresponding to the input LQ patch is synthesized using the resultant 2D FIR filter. The experiment results show that the proposed algorithm visually outperforms existing ones and that the mean of absolute errors (MAEs) and MSSSIM (multi-scale structure similarity) of the proposed algorithm are about 10% to 60% lower and about 0.002–0.053 higher, respectively than those of the existing algorithms.     

Evolutionary model of the growth and size of firms

The key idea of this model is that firms are the result of an evolutionary process. Based on demand and supply considerations the evolutionary model presented here derives explicitly Gibrat’s law of proportionate effects as the result of the competition between products. Applying a preferential attachment mechanism for firms, the theory allows to establish the size distribution of products and firms. Also established are the growth rate and price distribution of consumer goods. Taking into account the characteristic property of human activities to occur in bursts, the model allows also an explanation of the size–variance relationship of the growth rate distribution of products and firms. Further the product life cycle, the learning (experience) curve and the market size in terms of the mean number of firms that can survive in a market are derived. The model also suggests the existence of an invariant of a market as the ratio of total profit to total revenue. The relationship between a neo-classic and an evolutionary view of a market is discussed. The comparison with empirical investigations suggests that the theory is able to describe the main stylized facts concerning the size and growth of firms.     

ALGA在岸基导弹航路规划中的应用研究

针对基本遗传算法(GA)易局部收敛的缺陷,设计了基于模式搜索的自学习算子,提出一种基于模式搜索的自学习遗传算法(ALGA)。通过仿真测试函数将ALGA与基本遗传算法、自适应遗传算法(AGA)进行比较,显示改进的ALGA提高了算法的综合搜索能力。将改进的ALGA运用到岸基导弹航路规划中,并进行仿真实验,仿真结果验证了改进算法的有效性。     

On a learning precedence graph concept for the automotive industry

Assembly line balancing problems (ALBP) consist in assigning the total workload for manufacturing a product to stations of an assembly line as typically applied in automotive industry. The assignment of tasks to stations is due to restrictions which can be expressed in a precedence graph. However, (automotive) manufacturers usually do not have sufficient information on their precedence graphs. As a consequence, the elaborate solution procedures for different versions of ALBP developed by more than 50 years of intensive research are often not applicable in practice.Unfortunately, the known approaches for precedence graph generation are not suitable for the conditions in the automotive industry. Therefore, we describe a new graph generation approach that is based on learning from past feasible production sequences and forms a sufficient precedence graph that guarantees feasible line balances. Computational experiments indicate that the proposed procedure is able to approximate the real precedence graph sufficiently well to detect optimal or nearly optimal solutions for a well-known benchmark data set. Even for additional large instances with up to 1,000 tasks, considerable improvements of line balances are possible. Thus, the new approach seems to be a major step to close the gap between theoretical line balancing research and practice of assembly line planning.     

Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking

The two-echelon location-routing problem (LRP-2E) arises from recent transportation applications like city logistics. In this problem, still seldom studied, first-level trips serve from a main depot a set of satellite depots, which must be located, while second-level trips visit customers from these satellites. After a literature review on the LRP-2E, we present four constructive heuristics and a hybrid metaheuristic: A greedy randomized adaptive search procedure (GRASP) complemented by a learning process (LP) and path relinking (PR). The GRASP and learning process involve three greedy randomized heuristics to generate trial solutions and two variable neighbourhood descent (VND) procedures to improve them. The optional path relinking adds a memory mechanism by combining intensification strategy and post-optimization. Numerical tests show that the GRASP with LP and PR outperforms the simple heuristics and an adaptation of a matheuristic initially published for a particular case, the capacitated location-routing problem (CLRP). Additional tests on the CLRP indicate that the best GRASP competes with the best metaheuristics published.