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

Fast Fourier single-pixel imaging based on Sierra–Lite dithering algorithm

Chinese Physics B 2019年第6期28卷 189-194页

作者： Zhen-Yu Liang Zheng-Dong Cheng Yan-Yan Liu Kuai-Kuai Yu Yang-Di Hu National University of Defense Technology State Key Laboratory of Pulsed Power Laser TechnologyHefei 230037China Science and Technology on Electro-Optical Information Security Control Laboratory Tianjin 300000China

The single-pixel imaging(SPI) technique is able to capture two-dimensional(2 D) images without conventional array sensors by using a photodiode. As a novel scheme, Fourier single-pixel imaging(FSI) has been proven capable of reconstructing high-quality images. Due to the fact that the Fourier basis patterns(also known as grayscale sinusoidal patterns)cannot be well displayed on the digital micromirror device(DMD), a fast FSI system is proposed to solve this problem by binarizing Fourier pattern through a dithering algorithm. However, the traditional dithering algorithm leads to low quality as the extra noise is inevitably induced in the reconstructed images. In this paper, we report a better dithering algorithm to binarize Fourier pattern, which utilizes the Sierra–Lite kernel function by a serpentine scanning method. Numerical simulation and experiment demonstrate that the proposed algorithm is able to achieve higher quality under different sampling ratios.

关键词： single-pixel imaging binary Fourier basis pattern the dithering algorithm

来源：评论

学校读者我要写书评

暂无评论

An N/4 fixed-point duality quantum search algorithm

引用

Science China(Physics,Mechanics & Astronomy) 2010年第9期53卷 1765-1768页

作者： HAO Liang1,LIU Dan2 & LONG GuiLu1,3 1Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics,Tsinghua University,Beijing 100084,China 2School of Sciences,Dalian Nationalities University,Dalian 116600,China 3Tsinghua National Laboratory for Information Science and Technology,Beijing 100084,China 1. Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics Tsinghua University Beijing 100084 China2. School of Sciences Dalian Nationalities University Dalian 116600 China3. Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

Here a fixed-point duality quantum search algorithm is *** algorithm uses iteratively non-unitary operations and measurements to search an unsorted *** the marked item is found,the algorithm stops *** algorithm uses a constant non-unitary operator,and requires N/4 steps on average(N is the number of data from the database) to locate the marked *** implementation of this algorithm in a usual quantum computer is also demonstrated.

关键词： fixed-point search algorithm duality quantum computing the N4 duality search algorithm

来源：评论

学校读者我要写书评

暂无评论

THE FFD algorithm FOR THE BIN PACKING PROBLEM WITH KERNEL ITEMS

引用

Applied Mathematics(A Journal of Chinese Universities) 1998年第3期13卷 97-102页

ＴＨＥＦＦＤＡＬＧＯＲＩＴＨＭＦＯＲＴＨＥＢＩＮＰＡＣＫＩＮＧＰＲＯＢＬＥＭＷＩＴＨＫＥＲＮＥＬＩＴＥＭＳＺＨＡＮＧＧＵＯＣＨＵＡＮＡＮＤＹＡＯＥＮＹＵＡｂｓｔｒａｃｔ．ＴｈｅＦＦＤａｌｇｏｒｉｔｈｍｉｓｏｎｅｏｆｔ... 详细信息

ＴＨＥＦＦＤＡＬＧＯＲＩＴＨＭＦＯＲＴＨＥＢＩＮＰＡＣＫＩＮＧＰＲＯＢＬＥＭＷＩＴＨＫＥＲＮＥＬＩＴＥＭＳＺＨＡＮＧＧＵＯＣＨＵＡＮＡＮＤＹＡＯＥＮＹＵＡｂｓｔｒａｃｔ．ＴｈｅＦＦＤａｌｇｏｒｉｔｈｍｉｓｏｎｅｏｆｔｈｅｍｏｓｔｆａｍｏｕｓａｌｇｏｒ...

关键词： FFD THE PACKING BIN algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of a Genetic algorithm Based on the Immunity for Flow Shop under Uncertainty

引用

武汉理工大学学报 2006年第S2期28卷 673-676页

作者： WANG Luchao~1 DENG Yongping~2 1.Water Resource and Hydropower College,Wuhan University,Wuhan 430072,China 2.Guangzhou Research and Development Center,China Telecom,Gnangzhou,510630,China Water Resource and Hydropower College Wuhan UniversityWuhan 430072China Guangzhou Research and Development Center China TelecomGuangzhou510630China

The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical *** then,an immune based partheno-genetic algorithm was proposed by making use of concepts and principles introduced from immune system and genetic system in *** this method,processing se- quence of products could be expressed by the character encoding and each antibody represents a feasible *** was used to measure the matching degree between antibody and *** several antibodies producing operators,such as swopping,mov- ing,inverting,etc,were worked *** algorithm was combined with evolution function of the genetic algorithm and density mechanism in organisms immune *** and inhibition of antibodies were realized by expected propagation ratio of an- tibodies,and in this way,premature convergence was *** simulation proved that this algorithm is effective.

关键词： genetic algorithm based on the immunity flow shop character encoding antibody

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Traffic Equilibrium Flow with Capacity Constraints of Arcs

引用

Journal of Transportation Technologies 2015年第4期5卷 240-246页

作者： Zhi Lin College of Sciences Chongqing Jiaotong University Chongqing China

In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.

关键词： The Traffic Equilibrium Problem with Capacity Constraints of Arcs Equilibrium Flow algorithm Capacity of Arc Saturated Path

来源：评论

学校读者我要写书评

暂无评论

PCR algorithm FOR PARALLEL COMPUTING MINIMUM-NORM LEAST-SQUARES SOLUTION OF INCONSISTENT LINEAR EQUATIONS

引用

Numerical Mathematics A Journal of Chinese Universities(English Series) 1993年第1期2卷 1-10页

作者：王国荣 Department of Mathematics. Shanghai Normal University Shanghai 2002.14 PRC.

This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.

关键词： Parallel algorithm the minimum-norm least-squares solution inconsistent linear equations generalized inverse.

来源：评论

学校读者我要写书评

暂无评论

A Tree Pattern Matching algorithm for XML Queries with Structural Preferences

引用

Journal of Computer and Communications 2019年第1期7卷 61-83页

作者： Maurice Tchoupé Tchendji Lionel Tadonfouet Thomas Tébougang Tchendji Department of Mathematics and Computer Science Faculty of Sciences University of Dschang Dschang Cameroon INRIA Paris France

In the XML community, exact queries allow users to specify exactly what they want to check and/or retrieve in an XML document. When they are applied to a semi-structured document or to a document with an overly complex model, the lack or the ignorance of the explicit document model (DTD—Document Type Definition, Schema, etc.) increases the risk of obtaining an empty result set when the query is too specific, or, too large result set when it is too vague (e.g. it contains wildcards such as “*”). The reason is that in both cases, users write queries according to the document model they have in mind;this can be very far from the one that can actually be extracted from the document. Opposed to exact queries, preference queries are more flexible and can be relaxed to expand the search space during their evaluations. Indeed, during their evaluation, certain constraints (the preferences they contain) can be relaxed if necessary to avoid precisely empty results;moreover, the returned answers can be filtered to retain only the best ones. This paper presents an algorithm for evaluating such queries inspired by the TreeMatch algorithm proposed by Yao et al. for exact queries. In the proposed algorithm, the best answers are obtained by using an adaptation of the Skyline operator (defined in relational databases) in the context of documents (trees) to incrementally filter into the partial solutions set, those which satisfy the maximum of preferential constraints. The only restriction imposed on documents is No-Self-Containment.

关键词： Semi-Structured Documents Preference Queries Tree Pattern Matching TreeMatch algorithm XML The Skyline Operator

来源：评论

学校读者我要写书评

暂无评论

An Improved Iterative Closest Points algorithm

引用

World Journal of Engineering and Technology 2015年第3期3卷 302-308页

作者： Hao Yang Jialan Jiang Guowei Zhao Jie Zhao School of Astronautics Beijing University of Aeronautics and Astronautics Beijing China School of Mechanical Engineering University of Science and Technology Beijing China

Visual method including binocular stereo vision method and monocular vision method of the relative position and pose measurement for space target has become relatively mature, and many researchers focus on the method based on three-dimension measurement recently. ICP alignment, which is the key of three-dimension pattern measurement method, has the problem of low efficiency in large data sets. Considering this problem, an improved ICP algorithm is proposed in this paper. The improved ICP algorithm is the combination of the original ICP algorithm and KD-TREE. The experimental comparison between the improved ICP algorithm and the traditional ICP algorithm in efficiency has been given in this paper, which shows that the improved ICP algorithm can get much better performance.

关键词： The Relative Position and Pose Measurement of Space Target ICP algorithm KD-TREE

来源：评论

学校读者我要写书评

暂无评论

A Target Tracking algorithm Based on Improved Camshift and UKF

引用

Journal of Software Engineering and Applications 2014年第13期7卷 1065-1073页

作者： Zouguo Yan Weiguo Liang Haidong lv School of Optical-Electrical and Computer Engineering University of Shanghai for Science & Technology Shanghai China

A tracking algorithm based on improved Camshift and UKF is proposed in this paper to deal with the problems which exist in traditional Camshift algorithm, such as artificial orientation and tracking failure under color interference as well as object’s changed illumination occlusion. Meanwhile, in order to solve the sheltered problem, the UKF is combined with improved Camshift algorithm to predict the position of the target effectively. Experiment results show that the proposed algorithm can avoid the interference of the background color and solve the sheltered problem of the object, so that achieving a precise and timely tracking of moving objects. Also it has better robustness to color noises and occlusion when the object’s scale changes and deformation occurs.

关键词： Camshift UKF Tracking algorithm Sheltered Problem Interference of the Background Color

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of NBA Playoff Prediction Method Based on ELO algorithm and Graph Database

引用

Journal of Computer and Communications 2019年第11期7卷 54-64页

作者： Song Yan Siyuan Meng Qiwei Liu Jing Li Department of Computer Science and Technology Shandong University of Technology Zibo China

With the globalization of NBA, all eyes on the NBA playoffs are around the world. Ones celebrate the winning of their team which they like. Especially, NBA fans keep on predicting the playoffs game results. However, prediction of winning probability of teams in NBA playoffs is challenging. In order to meet the challenges, we proposed a method using ELO algorithm for prediction and leveraging Graph Database, Neo4j, for implementation. Experiment results show that, the design and implementation of the prediction system could work to some degree.

关键词： The NBA Playoffs Graph Database Neo4j ELO algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：