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

International Conference on Logistics Systems and Intelligent Management

作者： Li, Lin Wang, Lele Huo, Jiazhen Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China Tongji Univ Dept Math Shanghai 200092 Peoples R China

ISBN: (纸本)9781424473281

Seamless steel tube, including multi-variety and multi-specification products, requires variously complicated operations in the whole production process, especially in the cold treating process (CTP). This paper takes the seamless tube plant of Baoshan Iron and Steel Complex as the research background. Considering the practical production constraints, CTP scheduling problem can be viewed as a hybrid flowshop scheduling problem with sequence-dependent setup time. We formulate it as a non-linear mixed integer programming model(NMIP) with multi-objectives. Then a two-stage heuristic algorithm based on modified GA and local search method is proposed to get near-optimal solution of large-scale NMIP problem. Finally, computation experiments with real production instance are carried out to test the efficiency and performance of algorithm. The simulation results show that proposed model and algorithm can be implemented as an effective method to generate optimized scheduling scheme in the CTP scheduling system.

关键词： Cold treating Process Seamless Steel Tube Production Hybrid Fowshop Scheduling Sequence-dependent Setup Time Mixed Integer Programming Model two-stage algorithm

来源：评论

学校读者我要写书评

暂无评论

The Optimization of Delivery Vehicle Scheduling Considering the Actual Road Network Factors

The Optimization of Delivery Vehicle Scheduling Considering ...

引用

International Conference on Logistics, Informatics and Service Sciences (LISS)

作者： Lin, Xin Geng, Fei Jin, Zhihong Xu, Qi Dalian Maritime Univ Coll Transportat Management Dalian Peoples R China Dalian Maritime Univ Collaborat Innovat Ctr Transport Studies Dalian Peoples R China

ISBN: (纸本)9781509011025

Vehicle scheduling of urban distribution is an important element of the logistics center's operation. The total scheduling cost is not only influenced by the satisfaction of customer service time window and the effective utilization of vehicle capacity, but also is closely related to the traffic flow, road capacity, vehicle saturation degree of intersection, traffic lights and road rules in actual road network. This paper proposes a two-stage model based on the shortest path's selection in the road network and vehicle scheduling, and designs a two-stage algorithm to solve it which combines both Dijkstra algorithm with improving labeling rules and simulated annealing algorithm with parallel local search rules. By taking a distribution center in Shahekou District of Dalian as an example, a vehicle scheduling plan in two weeks was calculated and compared with the original plan, which verified the effectiveness of the model and algorithm. Sensitivity analysis of two road network factors: traffic flow and forbidden roads, showed that change of traffic flow on the main road and moderate distance between forbidden roads and distribution centers have a great effect on vehicle schedules.

关键词： urban traffic vehicle scheduling two-stage algorithm actual road network sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Trivial two-stage group testing for complexes using almost disjunct matrices

Trivial two-stage group testing for complexes using almost d...

引用

1st International Workshop on Combinatorics of Searching Sorting and Coding (COSSAC 01)

作者： Macula, AJ Rykov, VV Yekhanin, S SUNY Coll Geneseo Dept Math Geneseo NY 14454 USA Moscow MV Lomonosov State Univ Dept Cybernet & Comp Sci Moscow 119899 Russia

Let [t] represent a finite population with t elements. Suppose we have an unknown d-family of k-subsets Gamma of [t]. We refer to Gamma as the set of positive k-complexes. In the group testing for complexes problem, Gamma must be identified by performing 0, 1 tests on subsets or pools of [t]. A pool is said to be positive if it completely contains a complex;otherwise the pool is said to be negative. In classical group testing, each member of F is a singleton. In this paper, we exhibit and analyze a probabilistic trivial two-stage algorithm that identifies the positive complexes. (C) 2003 Elsevier B.V. All rights reserved.

关键词： group testing complexes disjunct martix two-stage algorithm hypergraphs

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Nonadaptive and two-stage Group Testing with Relatively Small Pools and DNA Library Screening

引用

Journal of Combinatorial Optimization 1998年第4期2卷 385-397页

作者： Macula, Anthony J. State University of New York College at Geneseo Department of Mathematics Geneseo NY 14454 United States

We use a simple, but nonstandard, incidence relation to construct probabilistic nonadaptive group testing algorithms that identify many positives in a population with a zero probability of yielding a false positive. More importantly, we give two-stage modifications of our nonadaptive algorithms that dramatically reduce the expected number of sufficient pools. For our algorithms, we give a lower bound on the probability of identifying all the positives and we compute the expected number of positives identified. Our method gives control over the pool sizes. In DNA library screening algorithms, where relatively small pools are generally preferred, having control over the pool sizes is an important practical consideration.

关键词： DNA library screening Human Genome Project Minimal families of k-sets Nonadaptive group testing two-stage algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph-analytical method for estimating single photon synchronization parameters of an autocompensation quantum key distribution system 5

Graph-analytical method for estimating single photon synchro...

引用

5th IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC)

作者： Rumyantsev, Konstantin Rudinsky, Evgeny Southern Fed Univ Rostov Na Donu Russia

ISBN: (纸本)9781728106465

In this article we describe the graph-analytical method for estimating single-photon synchronization parameters of an auto-compensation quantum key distribution system. In this paper is formed and described diagram of states and transitions for random search for a photon pulse with allowance for false detection. Based on the results of the analysis, expressions are defined for calculating the mathematical expectation, dispersion and average number of steps spent on the synchronization process. The interval for the average number of steps used for the synchronization process is determined. The average synchronization time according to the proposed algorithm is estimated considering the probability of false alarm. The calculations showed that the error in determining the mean synchronization time according to the expressions is no more than 1.7%. Thus, the graph-analytic method for estimating the single-photon synchronization parameters of the QKD auto-compensation system allows to determine the statistical characteristics and the average synchronization time with a low error.

关键词： Quantum key distribution security single-photon synchronization two-stage algorithm expected value dispersion of synchronization time

来源：评论

学校读者我要写书评

暂无评论

Computational Complexity Reduction for Functional Connectivity Estimation in Large Scale Neural Network 22nd

Computational Complexity Reduction for Functional Connectivi...

引用

22nd International Conference on Neural Information Processing (ICONIP)

作者： Baek, JeongHun Oba, Shigeyuki Yoshimoto, Junichiro Doya, Kenji Ishii, Shin Kyoto Univ Grad Sch Informat Yoshidahonmachi 36-1 Kyoto Japan Grad Univ Okinawa Inst Sci & Technol Neural Computat Unit Okinawa 9040495 Japan Nara Inst Sci & Technol Grad Sch Informat Sci Nara 6300101 Japan

ISBN: (纸本)9783319265551;9783319265544

Identification of functional connectivity between neurons is an important issue in computational neuroscience. Recently, the number of simultaneously recorded neurons is increasing, and computational complexity to estimate functional connectivity is exploding. In this study, we propose a two-stage algorithm to estimate spike response functions between neurons in a large scale network. We applied the proposed algorithm to various scales of neural networks and showed that the computational complexity is reduced without sacrificing estimation accuracy.

关键词： Computational complexity reduction Functional connectivity two-stage algorithm Large scale networks

来源：评论

学校读者我要写书评

暂无评论

two-stage Recursive Least Squares Parameter Identification for Cascade Systems with Dead Zone

Two-Stage Recursive Least Squares Parameter Identification f...

引用

Chinese Intelligent Systems Conference (CISC)

作者： Li, Linwei Ren, Xuemei Zhao, Wei Wang, Minlin Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

ISBN: (纸本)9789811023354;9789811023347

In this paper, two-stage recursive least squares algorithm (TS-RLS) is investigated for parameter identification of cascade systems with dead zone. In order to estimate the slopes and endpoints of the dead zone, switching functions are presented to reconstruct the expression of dead zone. All the parameters of linear subsystems and dead zone are separated by using the key term separation principle, which is applied to convert the cascade systems into a quasilinear model. The proposed identification algorithm not only estimates all the parameters of the cascade systems, but also reduces the computation cost of identification process. The result of the simulation illustrates the flexibility and efficiency of proposed identification algorithm.

关键词： Parameter identification Dead zone two-stage algorithm Cascade systems

来源：评论

学校读者我要写书评

暂无评论

two-stage Recursive Least Squares Method for Modeling Power Signals 4

Two-stage Recursive Least Squares Method for Modeling Power ...

引用

The Fourth International Conference On Control, Automation and Information Sciences

作者： Li, Xiangli Zhou, Lincheng Zhu, Peiyi Changshu Inst Technol Sch Elect & Automat Engn Changshu Peoples R China

ISBN: (纸本)9781479998920

This paper studies two-stage recursive least squares identification problems for power signals by the decomposition technique. The basic idea is to decompose a power signal model into two submodels and then to identify the parameters of each submodel, respectively. Compared with the recursive least squares algorithm, the dimensions of the involved covariance matrices in each submodel become small and thus the proposed algorithm has a high computational efficiency. Finally, the simulation results indicate that the proposed algorithm is effective.

关键词： least squares parameter estimation two-stage algorithm decomposition technique power signals

来源：评论

学校读者我要写书评

暂无评论

A New two-step algorithm for Spotlight Synthetic Aperture Radar Imaging 20

A New Two-step Algorithm for Spotlight Synthetic Aperture Ra...

引用

Conference on Radar Sensor Technology XX

作者： Sun, Ligang Zhang, Lei Wang, Guanyong Hu, Mengqi Qiao, Zhijun G. Univ Texas Rio Grande Valley Sch Math & Stat Sci Edinburg TX 78539 USA Xidian Univ Xian 710071 Peoples R China

ISBN: (纸本)9781510600706

In this paper, we designed a new two-stage algorithm to formulate accurately the focusing image with the highly squinted synthetic aperture radar. First of all is the general model of the squinted synthetic aperture radar (SAR) focusing a fixed area. After the echo data collection, the first stage of the algorithm is to establish the coarse image by performing the conventional range cell migration correction and azimuth matched filtering. In the second stage, the azimuth-variant was corrected and the motion compensation was carried to achieve a better image. A simulation experiment was given in the end.

关键词： Synthetic Aperture Radar spolight SAR model motion compensation (MOCO) two-stage algorithm

来源：评论

学校读者我要写书评

暂无评论

two-stage Segmentation of SAR Images Distorted by Additive Noise with Uncorrelated Samples 39

Two-Stage Segmentation of SAR Images Distorted by Additive N...

引用

39th IEEE International Conference on Electronics and Nanotechnology (ELNANO)

作者： Vyshnevyi, Serhii Natl Tech Univ Ukraine Dept Radio Engn Igor Sikorsky Kyiv Polytech Inst Kiev Ukraine

ISBN: (纸本)9781728120652

In this paper the algorithm of SAR images segmentation is investigated, which is developed on the basis of two-stage approach the essence of which is in conducting of one-dimensional processing independently along rows and columns followed by combining the obtained results and forming of segmented image. Analysis of the algorithm is performed using simulation while processing of test synthesized image.

关键词： image segmentation two-stage algorithm SAR image a posteriori probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：