检索结果-内蒙古大学图书馆

LINGUA 2013年 130卷 33-49页

作者： Chomsky, Noam MIT Dept Linguist & Philosophy Cambridge MA 02139 USA

With the crystallization of the "generative enterprise" half a century ago, two concepts became salient: the initial state and final states of the language faculty, respectively, UG (the genetic component) and I-languages. Since then inquiry has gained far greater scope and depth. It has also led to sharpening of fundamental principles of language. At first, descriptive adequacy appeared to require rich and complex assumptions about UG. A primary goal has always been to overcome this deficiency. Core properties of concem have included compositionality, order, projection (labeling), and displacement. Early work assigned the first three to phrase structure rules and the last to the transformational component. Simplification of computational procedures suggests that compositionality and displacement (along with the "copy theory") fall together while order may be a reflex of sensorimotor externalization, conclusions that have far-reaching consequences. As for labeling, minimal computation restricts options to the few that have considerable empirical support. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Syntax Minimal computation Merge labeling algorithm Minimal search

来源：评论

学校读者我要写书评

暂无评论

On the generalized elementary shortest path problem: A heuristic approach

引用

Electronic Notes in Discrete Mathematics 2013年 41卷 503-510页

作者： Guerrero, W.J. Velasco, N. Prodhon, C. Amaya, C.A. Pylo School of Engineering Universidad de los Andes Bogotá Cra 1 Este No 19A - 40 Colombia ICD-LOSI (UMR-STMR CNRS 6279) Université de Technologie de Troyes CS 42060 10004 Troyes Cedex 12 rue Marie Curie France Invited Professor ICD-LOSI (CNRS 6279) Université de Technologie de Troyes CS 42060 10004 Troyes Cedex 12 rue Marie Curie France

We introduce the generalized elementary shortest path problem (GESPP) where in addition to the features of the shortest path problem, nodes belong to predefined non-disjoint clusters. Each cluster is associated to a profit to the cost function, obtained if at least one element in the cluster appears in the path. Several applications can be considered as school bus routing, pricing problems, or telecommunication network design. Thus, depending on the case, clusters could be interpreted as groups of nodes with linking features as, for example, being easily reachable from each other, or some kind of coverage guarantee. We compare the GESPP to similar problems in the literature and we propose a two-phase heuristic algorithm for graphs including negative cycles. Tests on random instances with up to 100 nodes show an average gap of 0.3% to the best known solutions computed in 2.8s in average. © 2013 Elsevier B.V.

关键词： Elementary shortest path problem labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

A Continuous Time Model of Multi-vehicle Routing Problems: A Column Generation Approach

A Continuous Time Model of Multi-vehicle Routing Problems: A...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Matsushita, Susumu Nishi, Tatsushi Morikawa, Masashi Hisano, Takeshi Osaka Univ Grad Sch Engn Sci 1-3 Machikaneyama Cho Toyonaka Osaka 560 Japan Daifuku Co Ltd Shiga Japan

ISBN: (纸本)9781479906529

In this paper, we propose a column generation heuristics to a continuous time model of conflict-free pickup and delivery vehicle routing problems. The transportation system is divided into several regions with regular intervals. A network model of conflict-free multi-vehicle routing problem with acceleration and deceleration motions is developed. A column generation heuristics is used to find a near-optimal solution. The pricing problem for each vehicle routing problem is formulated as a resource constrained shortest path problem, which is effectively solved by a labeling algorithm. Computational results demonstrate the effectiveness of the proposed method.

关键词： automated guided vehicle acceleration motion column generation routing labeling algorithm heuristics

来源：评论

学校读者我要写书评

暂无评论

A New First-Scan Method for Two-Scan labeling algorithms

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2012年第8期E95D卷 2142-2145页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Shaanxi Univ Sci & Technol Coll Elect & Informat Engn Xianyang 710021 Shaanxi Peoples R China Aichi Prefectural Univ Grad Sch Informat Sci & Technol Nagakute Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Owariasahi 4888711 Japan Univ Chicago Div Biol Sci Dept Radiol Chicago IL 60637 USA

This paper proposes a new first-scan method for two-scan labeling algorithms. In the first scan, our proposed method first scans every fourth image line, and processes the scan line and its two neighbor lines. Then, it processes the remaining lines from top to bottom one by one. Our method decreases the average number of times that must be checked to process a foreground pixel will;thus, the efficiency of labeling can be improved.

关键词： labeling algorithm connected component first scan pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A run-based two-scan labeling algorithm

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2008年第5期17卷 749-756页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Aichi Prefectural Univ Grad Sch Informat Sci & Technol Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Aichi 4888711 Japan Univ Chicago Dept Radiol Div Biol Sci Chicago IL 60637 USA

We present an efficient run-based two-scan algorithm for labeling connected components in a binary image. Unlike conventional label-equivalence-based algorithms, which resolve label equivalences between provisional labels, our algorithm resolves label equivalences between provisional label sets. At any time, all provisional labels that are assigned to a connected component are combined in a set, and the smallest label is used as the representative label. The corresponding relation of a provisional label and its representative label is recorded in a table. Whenever different connected components are found to be connected, all provisional label sets concerned with these connected components are merged together, and the smallest provisional label is taken as the representative label. When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label. During the second scan, we need only to replace each provisional label by its representative label. Experimental results on various types of images demonstrate that our algorithm outperforms all conventional labeling algorithms.

关键词： connected components labeling algorithm linear-time algorithm pattern recognition run-length encoding

来源：评论

学校读者我要写书评

暂无评论

Two Efficient Label-Equivalence-Based Connected-Component labeling algorithms for 3-D Binary Images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2011年第8期20卷 2122-2134页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Shaanxi Univ Sci & Technol Coll Mech & Elect Engn Xianyang 710021 Shaanxi Peoples R China Aichi Prefectural Univ Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Aichi 4888711 Japan Univ Chicago Dept Radiol Div Biol Sci Chicago IL 60637 USA

Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.

关键词： Connected component label equivalence labeling algorithm run 3-D binary image

来源：评论

学校读者我要写书评

暂无评论

Advanced sensitivity analysis of the fuzzy assignment problem

引用

APPLIED SOFT COMPUTING 2011年第8期11卷 5341-5349页

作者： Lin, Chi-Jen Wen, Ue-Pyng Lin, Pei-Yi Ta Hwa Inst Technol Dept Ind Engn & Management Hsinchu Taiwan Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu Taiwan

This paper concentrates on sensitivity analysis of the fuzzy assignment problem (FAP). Since most real environments are uncertain, the FAP is more realistic than the assignment problem in application. Owing to the high degeneracy of the FAP, as that of the assignment problem, traditional sensitivity analysis, called Type I sensitivity analysis, which determines the range in which the current optimal basis remains optimal, is impractical. Hence, we attempt to perform other two types of advanced sensitivity analysis, called Type II and Type III sensitivity analysis, to overcome this problem. A labeling algorithm is then presented, where Type II sensitivity analysis is to determine the range of perturbation to keep the current optimal assignment remaining optimal, and Type III sensitivity analysis is to determine the range for which the rate of change of optimal value function remains unchanged. The procedure of the labeling algorithm is divided into two parts: one is when the unassigned cell is perturbed, and the other is when the assigned cell is perturbed. An example is presented to demonstrate that the labeling algorithm is a useful tool for determining the Type II and Type III sensitivity analysis of the FAP. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Assignment problem Fuzzy theory Sensitivity analysis Degeneracy labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

Determining Type II sensitivity ranges of the fractional assignment problem

引用

OPERATIONS RESEARCH LETTERS 2011年第1期39卷 67-73页

作者： Lin, Chi-Jen Ta Hwa Inst Technol Dept Ind Engn & Management Cyong Lin 307 Hsin Chu County Taiwan

This paper proposes iterative labeling algorithms to determine the Type II sensitivity ranges of the fractional assignment problem. Unlike the traditional sensitivity range which keeps the current optimal basis remaining optimal, the Type II sensitivity range is the range that keeps the current optimal assignment remaining optimal. Focusing only on the non-degenerate basic variables makes the Type II sensitivity range more practical. Three cases of perturbation, each with two kinds, are discussed. An example is presented to demonstrate the proposed algorithms. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Assignment problem Fractional programming Linear programming Sensitivity analysis Degeneracy labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient first-scan method for label-equivalence-based labeling algorithms

引用

PATTERN RECOGNITION LETTERS 2010年第1期31卷 28-35页

Label-equivalence-based connected-component labeling algorithms complete labeling in two or more raster scans. In the first scan, each foreground pixel is assigned a provisional label, and label equivalences between provisional labels are recorded. For doing this task, all conventional algorithms use the same mask that consists of four processed neighbor pixels to process every foreground pixel. This paper presents a simple yet efficient first-scan method for label-equivalence-based labeling algorithms. In our method, foreground pixels following a background pixel and those following a foreground pixel are processed in a different way. By use of this idea, the pixel followed by the current foreground pixel can be removed from the mask. In other words, the mask used in our method consists of three processed neighbor pixels. Thus, for processing a foreground pixel, the average number of times for checking the processed neighbor pixels in the first scan is reduced from 2.25 to 1.75. Because the current foreground pixel following a background pixel or a foreground pixel can be known without any additional computing cost, our method is efficient for any image that contains at least one foreground pixel. Experimental results demonstrated that our method is effective for improving the efficiency of label-equivalence-based labeling algorithms. (C) 2009 Published by Elsevier B.V.

关键词： Connected component labeling algorithm First scan Mask Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A Heuristic algorithm for Substrates Testing in MCM

A Heuristic Algorithm for Substrates Testing in MCM

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Murakami, Keisuke Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781457707391

Multi-chip module (MCM) substrate is designed to pack two or more semiconductor chips. On a MCM substrate, there might exist a few types of faults in the wiring. Thus, it is essential to establish an efficient method for testing in MCM to detect faults. This paper presents a heuristic algorithm for substrates testing in MCM. Our objective is to minimize the completion time of the testing. The testing is performed by two equipments, called probe. Several previous works propose a method for the testing. Although the method finds at least one feasible solution fast, there is no guarantee that the solution is always good. Therefore, we formulate a testing problem as a shortest path problem with covering constraints (SPCC) and then, we propose a heuristic algorithm for the SPCC. In computation experiments, we show the SPCC approach are superior to the existing method.

关键词： labeling algorithm MCM substrates probe testing shortest path problem with covering constraints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：