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

International Conference of Information and Communication Technology (ICICT)

作者： Ali, Abduladhem Abdulkareem Hussein, Hussein Alaa Univ Basrah Dept Comp Engn Basrah Iraq

ISBN: (纸本)9781450366434

Road markings express the rules for the road while catching the upcoming road layout. These rules are applied to driving scenarios by real drivers who are known to Highway driving manuals. However, autonomous driving vehicles must read the roads in the same way that real drivers do. In this paper, the problem of automatically reading the road markings is addressed. A new approach for lane classification using the onboard camera is presented. As an initial step, the road boundaries are detected using the Hough transform model. The region of interest (ROI) is divided into two sub-regions. Hough Transform is applied to each of the sub-regions independently. The computational time required for lane detection is improved in this way. After that, adaptive smoothing and some processing steps are added to reduce the noise while still making the close edge's apart. Then, seed fill algorithm is applied to the lanes location to identify the lane markings types. This method is able to recognize five types of lane markings such as: dashed, solid, double solid, dashed-solid and solid-dashed. The method is applied to a large set of video sequences with various situations and showed that the accuracy is over 95%.

关键词： Lane markings classification onboard cameras intelligent transportation systems seed algorithm real-time lane markings recognition Hough Transform

来源：评论

学校读者我要写书评

暂无评论

Efficient Order Batching Optimization Using seed Heuristics and the Metropolis algorithm

引用

SN Computer Science 2023年第2期4卷 107页

作者： Oxenstierna, Johan Malec, Jacek Krueger, Volker Department of Computer Science Lund University Lund Sweden Kairos Logic AB Lund Sweden

Order Picking in warehouses is often optimized using a method known as Order Batching, which means that one vehicle can be assigned to pick a batch of several orders at a time. There exists a rich body of research on Order Batching Problem (OBP) optimization, but one area which demands more attention is computational efficiency, especially for optimization scenarios where warehouses have unconventional layouts and vehicle capacity configurations. Due to the NP-hard nature of the OBP, computational cost for optimally solving large instances is often prohibitive. In this paper, we compare the performance of two approximate optimizers designed for maximum computational efficiency. The first optimizer, Single Batch Iterated (SBI), is based on a seed algorithm, and the second, Metropolis Batch Sampling (MBS), is based on a Metropolis algorithm. Trade-offs in memory and CPU-usage and generalizability of both algorithms is analyzed and discussed. Existing benchmark datasets are used to evaluate the optimizers on various scenarios. On smaller instances, we find that both optimizers come within a few percentage points of optimality at minimal CPU-time. For larger instances, we find that solution improvement continues throughout the allotted time but at a rate which is difficult to justify in many operational scenarios. SBI generally outperforms MBS and this is mainly attributed to the large search space and the latter’s failure to efficiently cover it. The relevance of the results within Industry 4.0 era warehouse operations is discussed. © 2022, The Author(s).

关键词： Computational efficiency Metropolis algorithm Order Batching Problem Order picking seed algorithm Warehousing

来源：评论

学校读者我要写书评

暂无评论

Improving Order-Picking Performance by Optimizing Order Batching in Multiple-Cross-Aisle Warehouse Systems: A Case Study from E-Commerce in China 4

Improving Order-Picking Performance by Optimizing Order Batc...

引用

4th International Conference on Industrial Engineering and Applications (ICIEA)

作者： Zhao, Zhijie Yang, Peng Tsinghua Univ Grad Sch Shenzhen Res Ctr Modern Logist Shenzhen Peoples R China

ISBN: (纸本)9781509067756

This article explores the order batching problem (OBP), in warehouse of e-commerce companies. Based on the real E-commence warehouse case, we present a valid tabu search(TS) algorithm to determine how to group the orders in batches, with a greed-based seed heuristic method generating its initial solution. In tabu search, a modified combined picker routing algorithm for the multiple-cross-aisle picker routing problem is embedded in it to calculate the value of fitness function and evaluate the performance of the tabu algorithm. These algorithms are experimentally tested on real warehouse operational data cases from a B2C company warehouse. Comparing with the current applied operational patterns, our proposed methods are able to improve the order-picking efficiency greatly.

关键词： order batching problem picker routing tabu search seed algorithm

来源：评论

学校读者我要写书评

暂无评论

A 3-D Wideband Multi-Confocal Ellipsoid Model for Wireless Massive MIMO Communication Channels with Uniform Planar Antenna Array 85

A 3-D Wideband Multi-Confocal Ellipsoid Model for Wireless M...

引用

IEEE 85th Vehicular Technology Conference (VTC Spring)

作者： Bai, Lu Wang, Cheng-Xiang Wu, Shangbin Sun, Jian Zhang, Wensheng Shandong Univ Shandong Prov Key Lab Wireless Commun Jinan 250100 Shandong Peoples R China Heriot Watt Univ Sch Engn & Phys Sci Edinburgh EH14 4AS Midlothian Scotland Samsung R&D Inst UK Staines Upon Thames TW18 4QE England Southeast Univ State Key Lab Millimeter Waves Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781509059324

This paper first proposes a three dimensional (3-D) non-stationary wideband multi-confocal ellipsoid channel model with uniform planar antenna array (UPA) for massive multiple-input multiple-output (MIMO) wireless communication systems. The proposed 3-D geometry-based stochastic model (GBSM) not only considers the non-stationary channel characteristics in time domain but also describes the non-stationary channel characteristics in array domain by adopting a birth-death (BD) process and seed algorithm on UPA for the first time. At the meanwhile, selective cluster evolution and cluster evolution areas (CEAs) are first proposed in this paper. Only clusters in CEAs go through cluster evolution because near-field effect and other clusters can be observed by all antennas. Channel parameters, including delay, Doppler frequency, angle of departure (AoD), and angle of arrive (AoA), are considered in both the azimuth direction and elevation direction. This paper also considers rotations of UPAs. Based on the proposed theoretical reference model, the relevant simulation model is also obtained. The statistical properties of theoretical reference model and simulation model can match well with numerical results.

关键词： Non-stationary wideband multi-confocal ellipsoid massive MIMO GBSM CEA 3-D model seed algorithm UPA

来源：评论

学校读者我要写书评

暂无评论

Research on Efficient Stream Cipher Design in Big Data Environment 24

Research on Efficient Stream Cipher Design in Big Data Envir...

引用

16th International Conference on Machine Learning and Computing (ICMLC)

作者： Liu, Shilin Jin, Zhexue Li, Yongzhen Yanbian Univ Network Informat Secur Lab Yanji 133002 Peoples R China

ISBN: (纸本)9798400709234

The design and implementation of stream cipher algorithms has always been one of the research hotspots in the field of cryptography. With the diversification of application environments and the improvement of security requirements, the design and efficient implementation of stream ciphers are facing new challenges. In the current big data era, stream ciphers have more advantages than block ciphers in the efficiency of processing large-capacity data. seed algorithm, as a data encryption standard in South Korea, was issued by the Korea Information Security Agency (KISA) in 1998. The overall structure of seed is a 16-round Feistel network. This paper uses the seed block cipher algorithm as the core to design the stream cipher. This paper refers to the CFB (Ciphertext Feedback) mode of block cipher, the output of each block is used as the input of the next block and then continues on. The bit value is extracted in the intermediate state of each block by specific rules, 256 bits are extracted from each block, and the bit sequence extracted from each block is concatenated to generate the final key stream. In theory, the stream cipher algorithm based on seed is about 2 times faster than seed-CFB mode in generating key stream. Due to the time consumption of key stream extraction, the final experimental results show that SKE(seed Key stream Extraction) algorithm is about 1.5 times faster than seed-CFB mode in generating key stream. When the data size is large, the processing speed of the algorithm is relatively faster. The SKE algorithm also has good diffusion and avalanche performance by avalanche effect experiments.

关键词： SKE Stream cipher seed algorithm Avalanche effect

来源：评论

学校读者我要写书评

暂无评论

seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

引用

BMC PLANT BIOLOGY 2009年第1期9卷 126-126页

作者： Fauteux, Francois Stromvik, Martina V. McGill Univ McGill Ctr Bioinformat Montreal PQ Canada

Background: Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results: We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP) gene promoters from three plant families, namely Brassicaceae (mustards), Fabaceae (legumes) and Poaceae (grasses) using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L.) Heynh.), soybean (Glycine max (L.) Merr.) and rice (Oryza sativa L.) respectively. We have identified three conserved motifs (two RY-like and one ACGT-like) in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion: seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination of conserved motif

关键词： seed Storage Protein Position Weight Matrix seed Storage Protein Gene seed algorithm Soybean Promoter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：