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

sequential search algorithm FOR THE LARGEST VALUE OF A TWICE DIFFERENTIABLE FUNCTION

引用

MATHEMATICAL NOTES 1982年第3-4期31卷 312-315页

作者： VASILEV, SB GANSHIN, GS Krasnoyarsk Polytechnic Institute USSR

来源：评论

学校读者我要写书评

暂无评论

A bi-objective model with sequential search algorithm for optimizing network-wide train timetables

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2019年 127卷 1259-1272页

作者： Tian, Xiaopeng Niu, Huimin Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou 730070 Peoples R China

This study focuses on how to optimize train timetables with transfer synchronization for a high-speed rail network. Aiming at network-based and synchronization-oriented train operations, a bi-objective integer programming model integrated with irregular headways is proposed to maximize the number of connections and minimize the total transfer waiting time for one day. This study also reveals an interactive relationship for timetables, transfer schemes and number of connections. By optimizing the two objectives sequentially, we develop a novel heuristic search algorithm to solve the proposed model. Specifically, an initial solution is obtained by independently optimizing the first objective, and the improved timetables are iteratively searched to minimize the total waiting time under the maximum number of transfer connections. We also put forward a set of numerical experiments to demonstrate the effectiveness and availability of the proposed approach.

关键词： High-speed rail Network-wide timetable Bi-objective model Connection sequential search algorithm

来源：评论

学校读者我要写书评

暂无评论

SIMPLEST sequential search algorithm FOR LARGEST VALUE OF A TWICE-DIFFERENTIABLE FUNCTION

引用

MATHEMATICAL NOTES 1976年第5-6期19卷 508-509页

作者： GANSHIN, GS KRASNOYARSK STATE UNIV KRASNOYARSKUSSR

In this note we describe a sequential algorithm for the computation with specified accuracy on a segment of the largest value of a twice-differentiable function. The algorithm described does not require the computatio... 详细信息

关键词： search algorithm sequential algorithm sequential search sequential search algorithm

来源：评论

学校读者我要写书评

暂无评论

APPLIED sequential-search algorithm FOR COMPRESSION-ENCRYPTION OF HIGH-RESOLUTION STRUCTURED LIGHT 3D DATA

APPLIED SEQUENTIAL-SEARCH ALGORITHM FOR COMPRESSION-ENCRYPTI...

引用

International Conference on Interfaces and Human Computer Interaction / International Conference on Game and Entertainment Technologies / International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing

作者： Siddeq, Mohammed M. Rodrigues, Marcos A. Sheffield Hallam Univ GMPR Geometr Modelling & Pattern Recognit Res Grp Sheffield S Yorkshire England

ISBN: (纸本)9789898533388

Anew image compression algorithm is proposed and demonstrated in the context of structured light 3D reconstruction. Structured light images contain patterns of light, which are captured by the sensor at very high resolution. The algorithm steps involvea two level Discrete Wavelet Transformation (DWT) followed by a Discrete Cosine Transformation (DCT) to generate a DC-Column andan MA-Matrix (Multi-Array Matrix). The MA-Matrix is then partitioned into blocks and a minimization algorithm codes each block followed by arithmetic coding. At decompression stage anewproposedalgorithm, sequential-search algorithm (SS-algorithm) is used to estimate the MA-Matrix. Thereafter, all decompressed DC-Columns arecombined withthe MA-Matrix followed by inverse DCT and inverse DWT. The effectiveness of the algorithm is demonstrated within a 3D reconstruction scenario from structured light images.

关键词： Discrete Wavelet Transform Discrete Cosine Transform Minimize Matrix Size algorithm sequential search algorithm Structured Light 3D reconstruction

来源：评论

学校读者我要写书评

暂无评论

Hybrid genetic algorithms for feature selection

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2004年第11期26卷 1424-1437页

作者： Oh, IS Lee, JS Moon, BR Chonbuk Natl Univ Div Elect & Comp Engn Jeonju 561756 Chonbuk South Korea Woosuk Univ Dept Comp Engn Samrye 565701 Chonbuk South Korea Seoul Natl Univ Sch Comp Sci & Engn Seoul 151742 South Korea

This paper proposes a novel hybrid genetic algorithm for feature selection. Local search operations are devised and embedded in hybrid GAs to fine-tune the search. The operations are parameterized in terms of their fine-tuning power, and their effectiveness and timing requirements are analyzed and compared. The hybridization technique produces two desirable effects: a significant improvement in the final performance and the acquisition of subset-size control. The hybrid GAs showed better convergence properties compared to the classical GAs. A method of performing rigorous timing analysis was developed, in order to compare the timing requirement of the conventional and the proposed algorithms. Experiments performed with various standard data sets revealed that the proposed hybrid GA is superior to both a simple GA and sequential search algorithms.

关键词： feature selection hybrid genetic algorithm sequential search algorithm local search operation atomic operation multistart algorithm

来源：评论

学校读者我要写书评

暂无评论

5 GHz all-digital delay-locked loop for future memory systems beyond double data rate 4 synchronous dynamic random access memory

引用

ELECTRONICS LETTERS 2015年第24期51卷 1973-1974页

作者： Lee, Dongyeol Kim, Jongsun Hongik Univ Elect & Elect Engn Seoul 121791 South Korea

A new low-power, fast-locking, all-digital delay-locked loop (DLL) that uses a disposable time-to-digital converter (TDC) is presented for future memory systems beyond double data rate 4. To achieve fast locking and high-frequency operation, the proposed DLL utilises a new hybrid (TDC + binary + sequential) search algorithm that results in a fast locking time of 11 clock cycles without the false lock and harmonic lock problems. By minimising the intrinsic delay of the digital delay line, the proposed DLL achieves an operating frequency range of 1.5-5.0 GHz which is higher than that of the current state-of-the-art all-digital DLLs. The DLL is fabricated in a 65 nm CMOS process and it achieves a peak-to-peak (p-p) output clock jitter of 14 ps (with a p-p input clock jitter of 8 ps) at 5 GHz. The DLL consumes 6.9 mW at 1 V and occupies an active area of 0.025 mm(2).

关键词： random-access storage time-digital conversion search problems clocks CMOS memory circuits timing jitter synchronisation low-power electronics memory systems synchronous dynamic random access memory all-digital delay-locked loop low-power DLL fast-locking DLL time-to-digital converter hybrid search algorithm TDC search algorithm binary search algorithm sequential search algorithm clock cycles harmonic lock problems intrinsic delay digital delay line CMOS process peak-to-peak output clock jitter p-p output clock jitter frequency 1 5 GHz to 5 0 GHz size 65 nm power 6 9 mW voltage 1 V size 0 025 mm

来源：评论

学校读者我要写书评

暂无评论

Image compression based on 2D Discrete Fourier Transform and matrix minimization algorithm

引用

ARRAY 2020年 6卷

作者： Rasheed, Mohammed H. Salih, Omar M. Siddeq, Mohammed M. Rodrigues, Marcos A. Northern Tech Univ Tech Coll Kirkuk Comp Engn Dept Mosul Iraq Sheffield Hallam Univ Geometr Modeling & Pattern Recognit Res Grp Sheffield England

In the present era of the internet and multimedia, image compression techniques are essential to improve image and video performance in terms of storage space, network bandwidth usage, and secure transmission. A number of image compression methods are available with largely differing compression ratios and coding complexity. In this paper we propose a new method for compressing high-resolution images based on the Discrete Fourier Transform (DFT) and Matrix Minimization (MM) algorithm. The method consists of transforming an image by DFT yielding the real and imaginary components. A quantization process is applied to both components independently aiming at increasing the number of high frequency coefficients. The real component matrix is separated into Low Frequency Coefficients (LFC) and High Frequency Coefficients (HFC). Finally, the MM algorithm followed by arithmetic coding is applied to the LFC and HFC matrices. The decompression algorithm decodes the data in reverse order. A sequential search algorithm is used to decode the data from the MM matrix. Thereafter, all decoded LFC and HFC values are combined into one matrix followed by the inverse DFT. Results demonstrate that the proposed method yields high compression ratios over 98% for structured light images with good image reconstruction. Moreover, it is shown that the proposed method compares favorably with the JPEG technique based on compression ratios and image quality.

关键词： DFT Matrix minimization algorithm sequential search algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：