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

Raman spectrum classification based on transfer learning by a convolutional neural network: Application to pesticide detection

引用

SPECTROCHIMICA ACTA PART A-MOLECULAR AND BIOMOLECULAR SPECTROSCOPY 2022年 265卷 120366-120366页

作者： Hu, Jiaqi Zou, Yanqiu Sun, Biao Yu, Xinyao Shang, Ziyang Huang, Jie Jin, Shangzhong Liang, Pei China Jiliang Univ Coll Opt & Elect Technol Hangzhou 310018 Peoples R China Tianjin Univ Sch Elect & Informat Engn Tianjin 300000 Peoples R China Southern Univ Sci & Technol Dept Elect & Elect Engn Shenzhen 518055 Guangdong Peoples R China

Pesticide detection is of tremendous importance in agriculture, and Raman spectroscopy/SurfaceEnhanced Raman Scattering (SERS) has proven extremely effective as a stand-alone method to detect pesticide residues. Machine learning may be able to automate such detection, but conventional algorithms require a complete database of Raman spectra, which is not feasible. To bypass this problem, the present study describes a transfer learning method that improves the algorithm's accuracy and speed to extract features and classify Raman spectra. The transfer learning model described here was developed through the following steps: (1) the classification model was pre-trained using an open-source Raman spectroscopy database;(2) the feature extraction layer was saved after training;and (3) the training model for the Raman spectroscopy database was re-established while using self-tested pesticides and keeping the feature extraction layer unchanged. Three models were evaluated with or without transfer learning: CNN-1D, Resnet-1D, and Inception-1D, and they have improved the accuracy of spectrum classification by 6%, 2%, and 3%, with reduced training time and increased curve smoothness. These results suggest that transfer learning can improve the feature extraction capability and therefore accuracy of Raman spectroscopy models, expanding the range of Raman-based applications where transfer learning model can be used to identify the spectra of different substances. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Raman spectrum Pesticide residue Transfer learning sorting algorithms Convolutional Neural Networks

来源：评论

学校读者我要写书评

暂无评论

Generating Nearly Sorted Sequences – The use of measures of disorder

引用

Electronic Notes in Theoretical Computer Science 2004年 91卷 56-95页

作者： Vladimir Estivill-Castro School of Computing and Information Technology Griffith University Brisbane Australia

There have been several formal proposals for a function that evaluates disorder in a sequence. We show here that definitions that allow equivalence to an operational formulation allow for the construction of an algorithm for pseudo-random generation of nearly sorted sequences. As there is interest in comparing performance of algorithms on nearly sorted sequences during experimental evaluations of their implementation, our methods here provide the pathway for establishing the benchmarks datasets to compare such algorithms.

关键词： sorting algorithms Statistical Correlation of Rankings Graph Isomorphism Measures of Disorder Generation of pseudo-random permutations

来源：评论

学校读者我要写书评

暂无评论

Create Your Own Permutation Statistics

引用

Mathematics Magazine 2004年第2期77卷 130-134页

作者： Emeric Deutsch Warren P. Johnson Polytechnic University Bates College

Given a property that a permutation may or may not have, we define astatistic on all permutations: the length of the longest initial segment of the permutation thatdoes have the given property.

关键词： Mathematical permutation Combinatorial permutations Truncation sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

NOTES ON RECURSION ELIMINATION

引用

COMMUNICATIONS OF THE ACM 1977年第6期20卷 434-439页

作者： BIRD, RS UNIV READING DEPT COMP SCIREADING RG6 2AFBERKSHIREENGLAND

Various methods of recursion elimination arc applied to the schematic recursive procedure: Proc S(x); px then N(x); S(fx); S(gx); M(x) ft. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time. [ABSTRACT FROM AUTHOR]

关键词： computational induction optimization of programs recursion elimination sorting algorithms stacks trees

来源：评论

学校读者我要写书评

暂无评论

A DECISION PROCEDURE FOR THE CORRECTNESS OF A CLASS OF PROGRAMS

引用

JOURNAL OF THE ACM 1981年第2期28卷 215-232页

作者： MATETI, P UNIV ILLINOIS URBANA IL 61801 USA

Verification of certain properties of a class of programs is considered. The programs are written In a miniprogrammmg language that has variables of only two data types, a linear array of elements, and pomters to these elements. The array elements can only be exchanged;pointers can only be incremented or decremented by one Program properties to be venfied are expressed in a severely restricted assertion language which contains essentially Boolean expressions of comparisons among pointers and among array elements Several in-place sorting algorithms can be readily written and asserted m these languages A decision procedure for the truthhood of the verification conditions generated for the above class of asserted programs is presented An algorithm for generating counterexamples for false verification conditions is also given The theorem prover can be readily implemented using simple graph algorithms The objective of this exercise is to use problem knowledge to design simple and efficient verifiers. The techmques developed seem applicable to wider classes of programs mampulatmg data structures. © 1981, ACM. All rights reserved.

关键词： aprogram verification nonresolution theorem prowng sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Integrating Pareto Optimization into Dynamic Programming

引用

algorithms 2016年第1期9卷 12-12页

作者： Gatter, Thomas Giegerich, Robert Saule, Cedric Univ Bielefeld Fac Technol D-33501 Bielefeld Germany Univ Bielefeld Ctr Biotechnol D-33501 Bielefeld Germany

Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into dynamic programming opens a wide range of algorithmic alternatives, which we study in substantial detail in this article, using real-world applications in biosequence analysis, a field where dynamic programming is ubiquitous. Our results are two-fold: (1) We introduce the operation of a Pareto algebra product in the dynamic programming framework of Bellman's GAP. Users of this framework can now ask for Pareto optimization with a single keystroke. Careful evaluation of the implementation alternatives by means of an extended Bellman's GAP compiler demonstrates the dependence of the best implementation choice on the application at hand. (2) We extract from our experiments several pieces of advice to programmers who do not use a system such as Bellman's GAP, but who choose to hand-craft their dynamic programming recurrences, incorporating Pareto optimization from scratch.

关键词： pareto optimization algebraic dynamic programming sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Gamifying Computer Science Education for Z Generation

引用

INFORMATION 2021年第11期12卷 453页

作者： Jawad, Hadeel Mohammed Tout, Samir Oakland Univ Dept Comp Sci & Engn Rochester MI 48309 USA Eastern Michigan Univ Sch Informat Secur & Appl Comp Ypsilanti MI 48197 USA

Generation Z members use their smart devices as part of their everyday routine. Teaching methods may need to be updated to make learning materials more interesting for this generation. This paper suggests gamifying computer science subjects to enhance the learning experience for this generation. Additionally, many students face difficulty in understanding computer science materials and algorithms. Gamifying computer science education is one of the suggested teaching methods to simplify topics and increase students' engagement. Moreover, the field of computer science is dominated by males. The use of gamification could increase women's interest in this field. This paper demonstrates different techniques that were developed by the researchers to employ gamification in teaching computer science topics. The data was collected at the end of the two different courses. Results show that students enjoyed the suggested teaching method and found it useful. This paper also demonstrates two tools and their gamification elements. These tools were developed by the researchers to help people learn computer programming and information security.

关键词： gamifying computer science education data structures sorting algorithms Code Genie gamifying cybersecurity education

来源：评论

学校读者我要写书评

暂无评论

Study of test classification algorithm based on domain knowledge

Study of test classification algorithm based on domain knowl...

引用

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Yutong Gao Feifan Song Xiaqing Xie Qing Sun Xu Wu Department of Computer Science and Information Engineering National Taipei University of Technology China School of Economics andManagement Beijing University of Posts and Telecommunications China Beijing University of Posts and Telecommunications Library China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China

When facing various and massive data resources, how to effectively utilize the resources according to the division field is one of the core problem of the institutional repository research. In this paper, we improved Bayesian classification algorithm, then proposed a text classification algorithm based on domain knowledge. Furthermore, some key technologies such as text classification, feature selection, weight improvement and domain knowledge algorithm improvement are designed and implemented. We use widely applied IkAnalyzer method to classify Chinese words. For feature selection and weight improvement part, we focus on the processing of special vocabulary in the document. We introduce the field expand vocabulary assist the Bayesian formula in the field application part to obtain the final result. The experiment result shows that the improved algorithm enhanced the accuracy of the classification efficiently, and the system calculating time is acceptable.

关键词： Bayesian Classification Domain Knowledge Institutional Repository sorting algorithms Text Classification domain knowledge Text categorization sorting algorithm Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Multistage Methods for Freight Train Classification

引用

NETWORKS 2011年第1期57卷 87-105页

作者： Jacob, Riko Marton, Peter Maue, Jens Nunkesser, Marc Swiss Fed Inst Technol Inst Theoret Comp Sci Zurich Switzerland Tech Univ Munich Dept Comp Sci Munich Germany Univ Zilina Fac Management & Comp Sci Zilina Slovakia

In this article, we study the train classification problem. Train classification basically is the process of rearranging the cars of a train in a specified order, which can be regarded as a special sorting problem. This sorting is done in a special railway installation called a classification yard, and a classification process is described by a classification schedule. In this article, we develop a novel encoding of classification schedules, which allows characterizing train classification methods simply as classes of schedules. Applying this efficient encoding, we achieve a simpler, more precise analysis of well-known classification methods. Furthermore, we elaborate a valuable optimality condition inherent in our encoding, which we succesfully apply to obtain tight lower bounds for the length of schedules in general and to develop new classification methods. Finally, we present complexity results and algorithms to derive optimal schedules for several real-world settings. Together, our theoretical results provide a solid foundation for improving train classification in practice. (C) 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(1), 87-105 2011

关键词： rail cargo shunting of rolling stock sorting algorithms train classification

来源：评论

学校读者我要写书评

暂无评论

Vertically-parallel method and VLSI-structure for sorting of one-dimensional arrays

Vertically-parallel method and VLSI-structure for sorting of...

引用

International Scientific and Technical Conference on Computer Science and Information Technologies

作者： Ivan Tsmots Oleksa Skorokhoda Volodymyr Antoniv Vasyl Rabyk Department of Automated Control Systems Lviv Polytechnic National University Lviv Ukraine Department of Radio Physics and Computer Technologies Ivan Franko National University of Lviv Lviv Ukraine

The vertically-parallel method for sorting one-dimensional arrays of numbers has been developed. The graph of the algorithm for vertically-parallel sorting of arrays has been built. The structure of the hardware for vertically-parallel sorting of one-dimensional arrays of large numbers has been designed. Components of the device for vertically-parallel sorting of arrays of numbers using FPGA have been implemented.

关键词： sorting algorithms Vertically-parallel calculations VLSI FPGA Hardware implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：