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

A windowing approach to detecting line segments using Hough transform

PATTERN RECOGNITION 1996年第2期29卷 255-265页

作者： Zhang, YF Webber, R UNIV WESTERN ONTARIO DEPT COMP SCILONDONON N6A 5B9CANADA

A new approach for using the Hough transform to detect line segments is presented. This approach is efficient in both space and time. Strategies combining the features of the intersection point [Ben-Tzvi, Leavers and Sandler, Proc. 5th Intl. Conf. Image Anal. 152-159 (1990);Xu, Oja and Kultannen, Pattern Recognition Lett. 11, 331-338 (1990)] and dual plane [Conker, Comput. Vis. Graphics Image Process. 43, 115-132 (1988)] methods are used to calculate the Hough transform. A dense set of small overlapping windows are used to restrict the pairs of image pixels that are evaluated. Experimental results indicate that this method reduces the time and space requirements significantly.

关键词： feature detection Hough transform parallel image processing algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Importance of convection and damping on rates of convergence for the Lax-Wendroff method

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 1999年第4期20卷 1513-1529页

作者： Kolibal, J Univ So Mississippi Dept Math Hattiesburg MS 39406 USA

It is well known that in solving steady state problems using hyperbolic time-stepping methods the intent is to drive the transients to zero as quickly as possible. In this paper the convergence to steady state of the Lax-Wendroff method applied to solving the equations of gas dynamics is analyzed for the Laval nozzle problem by comparing the relative rates of damping and convection using a linearized eigenmode analysis. This analysis is developed for the simpler isenthalpic system and then extended to the full Euler equations. Finally, this allows a comparison between these systems. For both models, useful analytical information can be gleaned about the transient behavior of these systems, especially in regard to quantifying the competitive factors affecting the removal of unsteady waves.

关键词： compressible fluids algorithm analysis convergence rates

来源：评论

学校读者我要写书评

暂无评论

DIGITAL SEARCH-TREES AGAIN REVISITED - THE INTERNAL PATH-LENGTH PERSPECTIVE

引用

SIAM JOURNAL ON COMPUTING 1994年第3期23卷 598-616页

作者： KIRSCHENHOFER, P PRODINGER, H SZPANKOWSKI, W PURDUE UNIV DEPT COMP SCIW LAFAYETTEIN 47907

This paper studies the asymptotics of the variance for the internal path length in a symmetric digital search tree under the Bernoulli model. This problem has been open until now. It is proved that the variance is asymptotically equal to N . 0.26600 + N . delta(log2 N), where N is the number of stored records and delta(x) is a periodic function of mean zero and a very small amplitude. This result completes a series of studies devoted to the asymptotic analysis of the variances of digital tree parameters in the symmetric case. In order to prove the previous result a number of nontrivial problems concerning analytic continuations and some others of a numerical nature had to be solved. In fact, some of these techniques are motivated by the methodology introduced in an influential paper by Flajolet and Sedgewick.

关键词： DIGITAL SEARCH TREES algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

On the dangers of default implementations: The case of radial basis function networks

引用

INTELLIGENT DATA analysis 2014年第2期18卷 261-279页

作者： Lee, Jun Won Giraud-Carrier, Christophe Korea Inst Sci & Technol Biomed Res Inst Ctr Bion Seoul 136791 South Korea Brigham Young Univ Dept Comp Sci Provo UT 84602 USA

We illustrate the danger of using default implementations of learning algorithms by showing that the implementation of RBF networks in the three most popular open source data mining software packages causes the algorithm to behave and perform like naive Bayes in most instances. This result has significant implications for both practitioners and researchers in terms of computational complexity, ensemble design and metalearning for algorithm selection. We outline the limits of the similarity between RBF and naive Bayes, and use metalearning to build a selection model capable of accurately discriminating between the two algorithms, so that extra computation is only incurred when it is likely to produce significant improvement in predictive accuracy.

关键词： algorithm analysis naive Bayes RBF networks metalearning

来源：评论

学校读者我要写书评

暂无评论

Investigation of fiber maturity and crystallinity information in Upland seed cottons by Fourier transform infrared spectroscopy

引用

TEXTILE RESEARCH JOURNAL 2023年第11-12期93卷 2507-2519页

作者： Liu, Yongliang Delhom, Christopher D. USDA Cotton Struct & Qual Res Unit New Orleans LA USA ARS USDA Southern Reg Res Ctr SRRC Cotton Struct & Qual Res Unit New Orleans LA 70124 USA

Cotton fiber maturity has been determined by cross-sectional image analysis (IA), advanced fiber information system (AFIS), and Cottonscope methods on cotton lint. These methods have reported the results as average maturity and maturity distribution in a sample, through measuring the fibers in the ways of either individual fiber cross-section or longitude of several sub-samples. Previous studies have shown good agreement in maturity for well-prepared samples among these methods, although AFIS is observed to be less sensitive. As a different approach, attenuated total reflection Fourier transform infrared (ATR FT-IR) spectroscopy was proposed to measure fiber maturity (M-IR) at bundle fiber level. Extending fiber maturity measurement into seed cotton, the FT-IR method might be an option considering such factors as essential cotton seed and visible trash removal, measuring system availability and speed, and also sub-sampling representation in a naturally variable sample. A comparison of fiber M-IR average in seed cottons with AFIS maturity ratio (M-AFIS) in ginned cotton fibers exhibited a general trend of increasing M-AFIS with M-IR. On the basis of M-IR value, 3-M-IR (low-, mid-, and high-) fiber classification analysis implied the distinctions within seed cottons having close M-IR average, and among the same cultivar grown at different conditions. Additionally, cultivars with a similar maturity distribution varied in fiber crystallinity (CIIR) distribution, and vice versa.

关键词： Fourier transform infrared spectroscopy attenuated total reflection seed cotton fiber maturity maturity frequency crystallinity algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

An abstract model for branching and its application to mixed integer programming (vol 166, pg 369, 2017)

引用

MATHEMATICAL PROGRAMMING 2017年第1-2期166卷 407-407页

作者： Le Bodic, Pierre Nemhauser, George Monash Univ Fac Informat Technol Clayton Vic Australia Georgia Inst Technol Atlanta GA 30332 USA

The selection of branching variables is a key component of branch-and-bound algorithms for solving mixed-integer programming (MIP) problems since the quality of the selection procedure is likely to have a significant effect on the size of the enumeration tree. State-of-the-art procedures base the selection of variables on their “LP gains”, which is the dual bound improvement obtained after branching on a variable. There are various ways of selecting variables depending on their LP gains. However, all methods are evaluated empirically. In this paper we present a theoretical model for the selection of branching variables. It is based upon an abstraction of MIPs to a simpler setting in which it is possible to analytically evaluate the dual bound improvement of choosing a given variable. We then discuss how the analytical results can be used to choose branching variables for MIPs, and we give experimental results that demonstrate the effectiveness of the method on MIPLIB 2010 “tree” instances where we achieve a \(5\%\) geometric average time and node improvement over the default rule of SCIP, a state-of-the-art MIP solver.

关键词： Branch and bound Abstract model Mixed integer programming Computational complexity algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

The robust constant and its applications in random global search for unconstrained global optimization

引用

JOURNAL OF GLOBAL OPTIMIZATION 2016年第3期64卷 469-482页

作者： Peng, Zheng Wu, Donghua Zhu, Wenxing Fuzhou Univ Coll Math & Comp Sci Fuzhou 350108 Peoples R China Shanghai Univ Coll Sci Dept Math Shanghai 200444 Peoples R China Fuzhou Univ Ctr Discrete Math & Theoret Comp Sci Fuzhou 350108 Peoples R China

Robust analysis is important for designing and analyzing algorithms for global optimization. In this paper, we introduce a new concept, robust constant, to quantitatively characterize the robustness of measurable sets and functions. The new concept is consistent to the theoretical robustness presented in literatures. This paper shows that, from the respects of convergence theory and numerical computational cost, robust constant is valuable significantly for analyzing random global search methods for unconstrained global optimization.

关键词： Unconstrained global optimization Robust constant Random global search Pure adaptive search algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

An Initial Error analysis for Evolutionary algorithms 17

An Initial Error Analysis for Evolutionary Algorithms

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： He, Jun Zhou, Yuren Li, Guangming Aberystwyth Univ Aberystwyth SY23 3DB Dyfed Wales Sun Yat Sen Univ Guangzhou 510006 Peoples R China Shenzhen Inst Informat Technol Shenzhen 518172 Peoples R China

ISBN: (纸本)9781450349390

The approximation error of an evolutionary algorithm is the fitness difference between the optimal solution and a solution found by the algorithm. In this paper, an initial error analysis has been made to evolutionary algorithms for discrete optimization. First, the order of convergence and asymptotic error constant are defined. Then it is proven that for any EA, under particular initialization, its order of convergence is 1 and its asymptotic error constant equals to the spectral radius of the transition probability sub-matrix;if its transition probability sub-matrix is primitive or upper triangular with unique diagonal entries, then under random initialization, its order of convergence is 1 and its asymptotic error constant equals to the spectral radius of the transition probability sub-matrix. Our study reveals that evolutionary algorithms converge linearly to the optimal solution and the spectral radius of the transition probability sub-matrix is the main factor in affecting the approximation error.

关键词： evolutionary algorithms algorithm analysis convergence rate approximation error

来源：评论

学校读者我要写书评

暂无评论

Investigation of Fourier transform infrared spectroscopy potential in cotton fiber micronaire measurement and distribution

引用

TEXTILE RESEARCH JOURNAL 2024年第19-20期94卷 2178-2188页

作者： Liu, Yongliang Delhom, Christopher D. USDA ARS Southern Reg Res Ctr Washington DC 20250 USA USDA ARS Sustainable Water Management Res Unit Stoneville MS 38776 USA

Cotton micronaire is an essential fiber quality attribute that characterizes both fiber maturity and fineness components. Micronaire and other attributes are measured on fiber lint routinely in laboratories under controlled environmental conditions following a well-established high-volume instrument protocol. In this study, the attenuated total reflection Fourier transform infrared spectroscopy, characterizing fundamental group vibrations in fiber cellulose from 4000 to 400 cm-1, and using an attenuated total reflection device, was explored for fiber micronaire assessment, especially for seed cotton locule fibers that were mingled with nonlint materials, and varied in fiber maturity within a naturally variable sample. Partial least squares multivariate regression models and the algorithmic infrared maturity approach were developed and then applied to predict micronaire values of validation samples and independent seed cotton samples for comparison. Unlike partial least squares models that showed worse in the coefficient of determination, bias, and percentage of samples within the 95% agreement range for independent samples than for validation samples, the algorithmic infrared maturity approach indicated a similarity in the coefficient of determination, bias, and percentage of samples within the 95% agreement range between the validation samples and independent samples. In particular, the algorithmic infrared maturity approach avoided the need to re-calibrate the model with new samples. Therefore, the development of a robust and effective Fourier transform infrared technique combined with the infrared maturity approach for rapid laboratory micronaire assessment and distribution demonstrated a great potential for its extension to the early micronaire testing in remote/breeding locations, and also to regular cotton fibers, processed cotton yarns and fabrics.

关键词： Cotton fiber micronaire seed cotton Fourier transform infrared spectroscopy attenuated total reflection algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling for Wireless On-Demand Data Packet Delivery to High-Speed Trains

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2015年第9期64卷 4101-4112页

作者： Chen, Tianyi Shan, Hangguan Wang, Xin Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China Fudan Univ Dept Commun Sci & Engn Key Lab Informat Sci Electmagnet Waves Shanghai 200433 Peoples R China Florida Atlantic Univ Dept Comp & Elect Engn & Comp Sci Boca Raton FL 33431 USA

In this paper, we consider a cellular/infostation integrated network that supports on-demand data service delivery over a wireless link to users in a high-speed train. For the requests with different lifetimes and prices that they are willing to pay, we develop the optimal packet schedule that aims at earning the maximum revenue. To this end, we formulate the problem as an integer linear program (ILP). The problem cannot be solved efficiently by existing ILP solvers with guaranteed polynomial-time complexity in the worst case. By exploring the special structure of the formulated ILP, we propose a novel Checker algorithm and prove that this algorithm is guaranteed to find the offline optimal schedule in polynomial time. Based on the relevant insights, we further develop a class of online Checker algorithms that require only causal knowledge of service demands and wireless channel capacities. It is established that these online algorithms have a worstcase competitive ratio of 1/2, i.e., total revenue earned by them is at least half as much as the revenue earned by an offline optimal schedule that knows the complete a priori knowledge of future requests and channel conditions. Simulation results are provided to demonstrate the merit of the proposed algorithms.

关键词： algorithm analysis integer linear program (ILP) on-demand services packet schedule wireless link

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：