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

22nd ACM International Conference on Information and Knowledge Management (CIKM)

作者： Wang, Hongya Cao, Jiao Shu, Lihchyun Rafiei, Davood Donghua Univ Sch Comp Sci & Technol Shanghai Peoples R China Natl Cheng Kung Univ Coll Management Tainan Taiwan Univ Alberta Dept Comp Sci Edmonton AB Canada

ISBN: (纸本)9781450322638

Locality Sensitive Hashing (LSH) is widely recognized as one of the most. promising approaches to similarity search in high-dimensional spaces. Based on LSH, a considerable number of nearest neighbor search algorithms have been proposed in the past, with some of them having been used in many real-life applications. Apart from their demonstrated superior performance in practice, the popularity of the LSH algorithms is mainly due to their provable performance bounds on query cost, space consumption and failure probability. In this paper, we show that a surprising gap exists between the LSH theory and widely practiced algorithm analysis techniques. In particular, we discover that a critical assumption made in the classical LSH algorithm analysis does not hold in practice, which suggests that using the existing methods to analyze the performance of practical LSH algorithms is a conceptual mismatch. To address this problem, a novel analysis model is developed that bridges the gap between the LSH theory and the method for analyzing the LSH algorithm performance. With the help of this model, we identify some important flaws in the commonly used analysis methods in the LSH literature. The validity of this model is verified through extensive experiments with real datasets.

关键词： Locality Sensitive Hashing Probabilistic algorithm algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

A software aided algorithm analysis

A software aided algorithm analysis

引用

2014 International Electrical Engineering Congress, iEECON 2014

作者： Trimananda, Rahmadi Kuang, Yeoh Chiah CPU System Validation Intel Microelectronics Penang Malaysia

ISBN: (纸本)9781479931743

System validation in the industry needs a lot of servers to generate test sets and run them on the validated processors or SoCs. With the requirement of a competitive time-to-market, this process has to happen speedily and, yet thoroughly to ensure a quality product. As the validation is automated using software, this implies that effective and efficient validation software is absolutely needed. This paper reports the basics that were revisited while our team was trying to improve the performance of our validation software. The analysis and improvement process was aided by functional-level algorithm analysis software called VTune™ that could precisely pinpoint the caveats in the source code. Revisiting the basics resulted in three key learnings on software improvements. A significant 16 percent performance improvement was achieved. © 2014 IEEE.

关键词： aided algorithm analysis improvement techniques software

来源：评论

学校读者我要写书评

暂无评论

For a Few Dollars More: Verified Fine-Grained algorithm analysis Down to LLVM

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2022年第3期44卷 14-14页

作者： Haslbeck, Maximilian P. L. Lammich, Peter Tech Univ Munich Arcisstr 21 D-80333 Munich Germany Univ Twente Drienerlolaan 5 NL-7522 NB Enschede Netherlands

We present a framework to verify both, functional correctness and (amortized) worst-case complexity of practically efficient algorithms. We implemented a stepwise refinement approach, using the novel concept of resource currencies to naturally structure the resource analysis along the refinement chain, and allow a fine-grained analysis of operation counts. Our framework targets the LLVM intermediate representation. We extend its semantics from earlier work with a cost model. As case studies, we verify the amortized constant time push operation on dynamic arrays and the O(n log n) introsort algorithm, and refine them down to efficient LLVM implementations. Our sorting algorithm performs on par with the state-of-the-art implementation found in the GNU C++ Library, and provably satisfies the complexity required by the C++ standard.

关键词： algorithm analysis program verification refinement Isabelle/HOL

来源：评论

学校读者我要写书评

暂无评论

Fourier Transform Infrared Spectroscopy (FT-IR) and Simple algorithm analysis for Rapid and Non-Destructive Assessment of Developmental Cotton Fibers

引用

SENSORS 2017年第7期17卷 1469-1469页

作者： Liu, Yongliang Kim, Hee-Jin ARS Cotton Struct & Qual Res Unit USDA New Orleans LA 70124 USA ARS Cotton Fiber Bioscience Res Unit USDA New Orleans LA 70124 USA

With cotton fiber growth or maturation, cellulose content in cotton fibers markedly increases. Traditional chemical methods have been developed to determine cellulose content, but it is time-consuming and labor-intensive, mostly owing to the slow hydrolysis process of fiber cellulose components. As one approach, the attenuated total reflection Fourier transform infrared (ATR FT-IR) spectroscopy technique has also been utilized to monitor cotton cellulose formation, by implementing various spectral interpretation strategies of both multivariate principal component analysis (PCA) and 1-, 2- or 3-band/-variable intensity or intensity ratios. The main objective of this study was to compare the correlations between cellulose content determined by chemical analysis and ATR FT-IR spectral indices acquired by the reported procedures, among developmental Texas Marker-1 (TM-1) and immature fiber (im) mutant cotton fibers. It was observed that the R value, CIIR, and the integrated intensity of the 895 cm(-1) band exhibited strong and linear relationships with cellulose content. The results have demonstrated the suitability and utility of ATR FT-IR spectroscopy, combined with a simple algorithm analysis, in assessing cotton fiber cellulose content, maturity, and crystallinity in a manner which is rapid, routine, and non-destructive.

关键词： Fourier transform infrared spectroscopy attenuated total reflection cellulose fiber secondary cell wall biosynthesis principal component analysis algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

With Random Parametric Equation of Circle Inscribed Polygon Generation algorithm and analysis

With Random Parametric Equation of Circle Inscribed Polygon ...

引用

International Conference on Applied Mechanics and Materials (ICAMM 2012)

作者： Sun, Yanhai Song, Laizhong Shen, Tao China Three Gorges Univ Coll Sci Yichang 443002 Peoples R China

ISBN: (纸本)9783037855911

For getting the parametric equation of random polygon, by the basic extension factor to stretch the round, there generates polygon of meeting the required conditions. Such algorithm overcomes the disadvantage in the generation of polygon from round under control of a single parameter and the complication of mathematical background. Firstly, a detailed introduction is given to the basic extension factor and the selection of relevant coefficient, and then the errors of such algorithm are analyzed. And the experimental result shows that the mathematical background of such method is relatively easy, the parameters are easy to control and constitute, and the generation of arbitrary polygon is available with high precision. Such the parametric equation of random polygon and method can be used in relevant fields such as geometric modeling, CAD/CAM, and computer graphics.

关键词： Random polygon parametric equation Free deformation Polygonal aggregate model algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

algorithm analysis for returning adult students

Journal of Computing Sciences in Colleges

引用

Journal of Computing Sciences in Colleges 2004年第2期20卷

作者： Kelvin Sung Peter Shirley University of Washington Bothell WA University of Utah Salt Lake City UT

Returning adult students typically have expectations of gaining both near-term applicable skill sets and long-term foundational concepts from their courses. Most algorithm analysis classes are designed for traditional students and do not have teaching practical skill set as one of their major goals. This paper describes an attempt to meet the expectations of both applicable skills and foundational concepts in an algorithm analysis class. The class emphasizes implementation and experimentation while covering concepts supporting students' future self-learning. We also present our approach to support the teaching of this highly demanding course to students with busy life schedules.

关键词： adult students algorithm analysis non-traditional students

来源：评论

学校读者我要写书评

暂无评论

Ultrahigh Sensing Performance: Coresponse and Differentiation of Ethyl Acetate and Its Byproducts in Fe-Ce-O Interfacial Sensor

引用

ACS SENSORS 2025年第3期10卷 2038-2048页

作者： Fang, Lu Zhang, Sibo Dai, Xinyi Sun, Pengfei Cao, Zhengmao Wang, Wu Dong, Xiaoping Dong, Fan Chen, Si Zhejiang Sci Tech Univ Dept Chem Hangzhou 310018 Peoples R China Univ Elect Sci & Technol China Inst Fundamental & Frontier Sci Res Ctr Carbon Neutral Environm & Energy Technol Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Yangtze Delta Reg Inst Huzhou Huzhou 313000 Peoples R China Zhejiang Univ Technol Coll Environm Hangzhou 310027 Peoples R China

Accurately detecting low concentrations of ethyl acetate (EA) holds promise for the early screening of rectal and gastric cancer. The primary challenges lie in achieving a high response at parts per billion level concentration and ensuring high selectivity. This study focuses on designing Fe-Ce-O bimetallic oxides with doping and heterogeneous interfaces, which exhibit outstanding redox properties and highly enhanced ability of the adsorption and activation of both O-2 and EA molecules. Benefiting from the violent reaction between EA and the adsorbed oxygen species, the sensor achieves an ultrahigh ethyl acetate sensing response of more than 500,000 at 200 ppm concentration, along with an ultrafast recovery rate (<5 s). In experiments, the response can reach 4.8 even at an extremely low concentration of 10 ppb. Special attention is given to the interfacial chemical reactions through in situ DRIFTS during the sensing process. We propose for the first time that the produced intermediate byproducts (acetaldehyde, ethyl alcohol, acetic acid, and formic acid) coresponse on this sensor, contributing to its ultrahigh sensing response. Furthermore, both EA and the byproducts are effectively classified using linear discriminant analysis with 95% accuracy. This work is expected to elucidate the interfacial sensing mechanisms, particularly the contributions of derived byproducts to the sensor's response, and to propose a novel idea for designing high-performance sensors.

关键词： Fe-Ce-O interfacial sensor ethyl acetate in situ DRIFTS coresponse and differentiation algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

An adaptive helper and equivalent objective evolution strategy for constrained optimization

引用

INFORMATION SCIENCES 2025年 690卷

作者： Xu, Tao Chen, Hongyang He, Jun Zhejiang Lab Hangzhou 311121 Peoples R China Nottingham Trent Univ Dept Comp Sci Nottingham NG11 8NS England

The matrix adaptation evolution strategy is a simplified covariance matrix adaptation evolution strategy with reduced computational cost. Using it as a search engine, several algorithms have been recently proposed for constrained optimization and have shown excellent performance. However, these algorithms require the simultaneous application of multiple techniques to handle constraints, and also require gradient information. This makes them inappropriate for handling non-differentiable functions. This paper proposes a new matrix adaption evolutionary strategy for constrained optimization using helper and equivalent objectives. The method optimizes two objectives but with no need for special handling of infeasible solutions and without gradient information. A new mechanism is designed to adaptively adjust the weights of the two objectives according to the convergence rate. The efficacy of the proposed algorithm is evaluated using computational experiments on the IEEE CEC 2017 Constrained Optimization Competition benchmarks. Experimental results demonstrate that it outperforms current state-ofthe-art evolutionary algorithms. Furthermore, this paper provides sufficient conditions for the convergence of helper and equivalent objective evolutionary algorithms and proves that using helper objectives can reduce the likelihood of premature convergence.

关键词： Constrained optimization Evolutionary algorithms algorithm analysis algorithm design Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

THE DESIGN AND analysis OF algorithm OF MINIMUM COST SPANNING TREE

引用

Acta Mathematica Scientia 1996年第3期16卷 296-301页

作者：徐绪松刘大成吴丽华 School of Management Wuhan University Wuhan 430072 China

This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).

关键词： minimum cost spanning tree a sort using the FDG path compression set operation of find and unite algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

A PROBABILISTIC analysis OF AN ERROR-CORRECTING algorithm FOR THE TOWERS OF HANOI PUZZLE

引用

INFORMATION PROCESSING LETTERS 1984年第2期18卷 99-103页

作者： SCARIONI, F SPERANZA, HG Department of mathematics University of Milan 20129 Milano Italy

The well-known towers of Hanoi puzzle consists of a set of n disks of unequal size threaded onto 3 needles such that no disk rests on a smaller one. A legal move consists of removing a top disk from one needle and transferring it to another without violating the above rule. All recursive and iterative algorithms for the problem assume that the puzzle is initially in the stack-configuration and perform the unique minimal sequence of moves to reach the final state. However, a person attempting to solve the puzzle may execute a different sequence of legal moves and leave the puzzle unfinished with any arrangement of the disks. If such an arrangement is one of the configurations of the minimal sequence of moves, someone else can finish the puzzle applying the minimal algorithm. Walsh (1982) has given a rule for identifying such cases. If the arrangement is not an intermediate configuration of the minimal sequence, this rule can recognize the error but cannot correct it.

关键词： algorithm analysis towers of Hanoi error correction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：