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

Air conditioning compressor crankshaft roundness measurement based on a laser profiler

MEASUREMENT SCIENCE AND TECHNOLOGY 2024年第5期35卷 055010-055010页

作者： Liang, Jie Sun, Zhenwei Zhengzhou Univ Sch Mech & Power Engn Zhengzhou 450001 Peoples R China

Crankshafts are key components of air conditioning compressors. The good roundness of a crankshaft has positive effects on the operating stability, service life, working efficiency, and noise radiation of the compressor. This study proposes a line point cloud data merging method for measuring crankshaft roundness using a laser profiler. First, a crankshaft roundness measurement system for air conditioning compressors is developed, and a high-accuracy 2D laser displacement sensor is employed to collect the line point cloud data. Second, the steps of the merging method are divided into two parts: (1) the radial merging to eliminate the effects of eccentricity;(2) the circumferential merging to remove overlapping data points of two adjacent profiles. Then, a pin gauge is used to select the point cloud region of the profile line for data merging. Experimental results show that the measurement repeatability of the proposed system can be controlled at the micrometer level. Besides, the roundness measured from the merged data is very close to the roundness measuring instrument measurements, which verifies the accuracy of the measurement system and the validity of the line point data merging algorithm.

关键词： roundness measurement laser profiler line point cloud merging algorithm point cloud region

来源：评论

学校读者我要写书评

暂无评论

Research on Unstructured Data Access Strategy In Cloud Environment 2

Research on Unstructured Data Access Strategy In Cloud Envir...

引用

2nd International Conference on Computer Engineering and Intelligent Control (ICCEIC)

作者： Fang, Lu-lu Hu, Hai-rong Chen, Cai-sen Chen, Song Army Acad Armored Forces Ctr Exercise & Training Beijing Peoples R China Army Acad Armored Forces Dept Informat & Commun Beijing Peoples R China

ISBN: (纸本)9781665402125

For the problem of low storage efficiency of small files in HDFS (Hadoop Distributed File Systems, HDFS), a small file merging algorithm based on file type is proposed, and the model structure and implementation steps of the algorithm are studied. On the basis of the original architecture, ClientServer is added for data preprocessing. Finally, algorithms are designed for data " write and read " operations.

关键词： HDFS architecture storage merging algorithm

来源：评论

学校读者我要写书评

暂无评论

A model for building probabilistic knowledge-based systems using divergence distances

引用

EXPERT SYSTEMS WITH APPLICATIONS 2021年 174卷 114494-114494页

作者： Nguyen, Van Tham Tran, Trong Hieu Nguyen, Ngoc Thanh Namdinh Univ Technol Educ Fac Informat Technol Nam Din Vietnam Wroclaw Univ Sci & Technol Fac Comp Sci & Management Wroclaw Poland Vietnam Natl Univ VNU Univ Engn & Technol Hanoi Vietnam Nguyen Tat Thanh Univ Fac Informat Technol Ho Chi Minh City Vietnam

The knowledge-based systems (KBSs) in general and solving the knowledge merging problem in particular have seen a great surge of research activity in recent years. However, there still exist two main shortcomings that need to be addressed in the probabilistic framework. Firstly, the current methods only deal with the problems in which original probabilistic knowledge bases (PKBs) are required to be consistent and formed in the same structure. It is a very strong requirement and difficult to apply in practice. Secondly, only a few measures of distance between probability distributions have been studied to apply in existing models. To overcome these disadvantages, in this paper, we introduce a novel framework for merging PKBs. To this end, a theoretical model is introduced and several experiments are implemented. In theoretical model, some theorems are pointed out and proved to provide mathematical background to construct the merging model. Moreover, a deep survey on how to employ divergence distance functions (DDFs) between probability distributions to carry out the merging process are performed. In experimental aspect, a consistency recovery algorithm and some merging algorithms based on DDFs are proposed. Through the results of conducted experiments, issues about the time cost of merging process, the number of iterations, and CPU Time Elapsed parameter to solve the class of optimization problems in the merging process are analyzed, compared, and evaluated.

关键词： Probabilistic knowledge base Divergence distance function merging algorithm Probabilistic knowledge-based system

来源：评论

学校读者我要写书评

暂无评论

VisTaxa: Developing a Taxonomy of Historical Visualizations

引用

IEEE Transactions on Visualization and Computer Graphics 2025年第06期31卷 3850-3862页

作者： Yu Zhang Xinyue Chen Weili Zheng Yuhan Guo Guozheng Li Siming Chen Xiaoru Yuan Department of Computer Science University of Oxford Oxford U.K. National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University and PKU-WUHAN Institute for Artificial Intelligence Beijing China School of Data Science Fudan University Shanghai China Beijing Institute of Technology Beijing China

Historical visualizations are a rich resource for visualization research. While taxonomy is commonly used to structure and understand the design space of visualizations, existing taxonomies primarily focus on contemporary visualizations and largely overlook historical visualizations. To address this gap, we describe an empirical method for taxonomy development. We introduce a coding protocol and the VisTaxa system for taxonomy labeling and comparison. We demonstrate using our method to develop a historical visualization taxonomy by coding 400 images of historical visualizations. We analyze the coding result and reflect on the coding process. Our work is an initial step toward a systematic investigation of the design space of historical visualizations.

关键词： Taxonomy Data Visualization Visualization Encoding Protocols Image Coding Labeling Artificial Intelligence Image Resolution Training Data Labeling Digital Humanities Historical Visualization Qualitative Coding Taxonomy Development Of Methods Design Space Coding Process Visual Space Development Of Taxonomy Visual Representation Visual Images Root Node Tree Nodes Bar Charts Labeled Data Grounded Theory Leaf Node Anchoring Effect Number Of Mismatches Portion Of The Image Visual Design Coding Method Line Chart Source Of Disagreement Taxon Names Batch Of Images merging algorithm Chart Types Exact Ratio Edge Cases Explanatory Framework Qualitative Coding Number Of Taxa Exact Match

来源：评论

学校读者我要写书评

暂无评论

Uncertain decision tree for bank marketing classification

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2020年第0期371卷 112710-000页

作者： Yang, Shiueng-Bien Chen, Tai-Liang Wenzao Ursuline Univ Languages Dept Digital Content Applicat & Management 900 Mintsu 1st Rd Kaohsiung 80424 Taiwan

This study proposes a novel decision tree for uncertain data, called the uncertain decision tree (UDT), based on the uncertain genetic clustering algorithm (UGCA). UDT extends the decision tree to handle data with uncertain information, in which the uncertainty must be considered to obtain high quality results. In UDT, UGCA automatically searches for the proper number of branches of each node, based on the classification error rate and the classification time of UDT. Restated, UGCA reduces both the classification error rate and computing time and, then, optimizes the proposed UDT. Before the UDT is designed using UGCA, an uncertain merging algorithm (UMA) is also developed to reduce the uncertain data set, thereby allowing UGCA to process a large data set efficiently. Importantly, experimental results demonstrate that the proposed UDT outperforms traditional uncertain decision trees. (C) 2020 Published by Elsevier B.V.

关键词： Decision trees Genetic clustering algorithm Uncertain data merging algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms for Doppler Spectral Density Data Quality Control and merging for the Ka-Band Solid-State Transmitter Cloud Radar

引用

REMOTE SENSING 2019年第2期11卷 209-209页

作者： Liu, Liping Zheng, Jiafeng Chinese Acad Meteorol Sci State Key Lab Severe Weather Beijing 100086 Peoples R China Chengdu Univ Informat Technol Sch Atmospher Sci Plateau Atmosphere & Environm Key Lab Sichuan Pro Chengdu 610225 Sichuan Peoples R China

The Chinese Ka-band solid-state transmitter cloud radar (CR) can operate in three different work modes with different pulse widths and coherent integration and non-coherent integration numbers to meet the requirement for long-term cloud measurements. The CR was used to observe cloud and precipitation data in southern China in 2016. In order to resolve the data quality problems caused by coherent integration and pulse compression, which are used to detect weak cloud in the cloud radar, this study focuses on analyzing the consistencies of reflectivity spectra using the three modes and the influence of coherent integration and pulse compression, developing an algorithm for Doppler spectral density data quality control (QC) and merging based on multiple-mode observation data. After dealiasing Doppler velocity and artefact removal, the three types of Doppler spectral density data were merged. Then, Doppler moments such as reflectivity, radial velocity, and spectral width were recalculated from the merged reflectivity spectra. Performance of the merging algorithm was evaluated. Three conclusions were drawn. Firstly, four rounds of coherent integration with a pulse repetition frequency (PRF) of 8333 Hz underestimated the reflectivity spectra for Doppler velocities exceeding 2 m.s(-1), causing a large negative bias in the reflectivity and radial velocity when large drops were present. In contrast, two rounds of coherent integration affected the reflectivity spectra to a lesser extent. The reflectivity spectra were underestimated for low signal-to-noise ratios in the low-sensitivity mode. Secondly, pulse compression improved the radar sensitivity and air vertical speed observation, whereas the precipitation mode and coherent integration led to an underestimation of the number concentration of big raindrops and an overestimation of the number concentration of small drops. Thirdly, a comparison of the individual spectra with the merged reflectivity spectra showed that the Dopp

关键词： doppler spectral density merging algorithm quality control coherent integration and pulse compression

来源：评论

学校读者我要写书评

暂无评论

Automatic detection of individual and touching moths from trap images by combining contour-based and region-based segmentation

引用

IET COMPUTER VISION 2018年第2期12卷 138-145页

作者： Bakkay, Mohamed Chafik Chambon, Sylvie Rashwan, Hatem A. Lubat, Christian Barsotti, Sebastien Univ Toulouse INP IRIT IRIT Toulouse France SiConsult Labege France

Insect detection is one of the most challenging problems of biometric image processing. This study focuses on developing a method to detect both individual insects and touching insects from trap images in extreme conditions. This method is able to combine recent approaches on contour-based and region-based segmentation. More precisely, the two contributions are: an adaptive k-means clustering approach by using the contour's convex hull and a new region merging algorithm. Quantitative evaluations show that the proposed method can detect insects with higher accuracy than that of the most used approaches.

关键词： image segmentation biometrics (access control) convex programming computer vision automatic detection touching moths individual moths trap images region based segmentation insect detection biometric image processing touching insects contour convex hull merging algorithm

来源：评论

学校读者我要写书评

暂无评论

Mining Spatio-temporal Knowledge of Climate for Dendrobium Officinale in Greenhouse Cultivation

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2018年第2期11卷 160-166页

作者： Sun, Lin Zheng, Zengwei Zhu, Jianfeng Zhejiang Univ City Coll Hangzhou Key Lab IoT Technol & Applicat Hangzhou 310015 Zhejiang Sheng Peoples R China

Background This paper presents a novel spatio-temporal learning method to generate knowledge of fine-gained cultivation of Dendrobium officinale from large climatic sensor data. In recent years, data driven precision agriculture, which is strongly connected with data mining techniques, has a great impact on traditional farming. Most of the environmental control methods in the green house are based on human experience. Methods: In the paper, fine-gained rules have been proposed to provide precise climate control in temporal dimensions during the growth of plants. Spatial and temporal information were combined together and analyzed. An unsupervised merging algorithm on time segments was proposed to learn optimal tags for classification, and then new data samples consisting of clustering labels were prepared for knowledge mining from the raw sensor data. Finally the climatic rules were built in the form of decision trees. Results: The experimental results show that about 80% climatic conditions in the past successful cultivation can be replicated to guide future cultivation by our decision rules. Conclusion: The knowledge cultivation can guarantee similar quality of Dendrobium officinale since it is especially important for the production of herb medicine.

关键词： Knowledge cultivation spatio-temporal analysis merging algorithm decision tree wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

InteMAP: Integrated metagenomic assembly pipeline for NGS short reads

引用

BMC BIOINFORMATICS 2015年第1期16卷 1-14页

作者： Lai, Binbin Wang, Fumeng Wang, Xiaoqi Duan, Liping Zhu, Huaiqiu Peking Univ Coll Engn State Key Lab Turbulence & Complex Syst Beijing 100871 Peoples R China Peking Univ Coll Engn Dept Biomed Engn Beijing 100871 Peoples R China Peking Univ Ctr Quantitat Biol Beijing 100871 Peoples R China Peking Univ Hosp 3 Dept Gastroenterol Beijing 100191 Peoples R China

Background: Next-generation sequencing (NGS) has greatly facilitated metagenomic analysis but also raised new challenges for metagenomic DNA sequence assembly, owing to its high-throughput nature and extremely short reads generated by sequencers such as Illumina. To date, how to generate a high-quality draft assembly for metagenomic sequencing projects has not been fully addressed. Results: We conducted a comprehensive assessment on state-of-the-art de novo assemblers and revealed that the performance of each assembler depends critically on the sequencing depth. To address this problem, we developed a pipeline named InteMAP to integrate three assemblers, ABySS, IDBA-UD and CABOG, which were found to complement each other in assembling metagenomic sequences. Making a decision of which assembling approaches to use according to the sequencing coverage estimation algorithm for each short read, the pipeline presents an automatic platform suitable to assemble real metagenomic NGS data with uneven coverage distribution of sequencing depth. By comparing the performance of InteMAP with current assemblers on both synthetic and real NGS metagenomic data, we demonstrated that InteMAP achieves better performance with a longer total contig length and higher contiguity, and contains more genes than others. Conclusions: We developed a de novo pipeline, named InteMAP, that integrates existing tools for metagenomics assembly. The pipeline outperforms previous assembly methods on metagenomic assembly by providing a longer total contig length, a higher contiguity and covering more genes. InteMAP, therefore, could potentially be a useful tool for the research community of metagenomics.

关键词： Coverage Level Metagenomic Data merging algorithm Individual Assembler High Coverage Level

来源：评论

学校读者我要写书评

暂无评论

A Firewall Rules Optimized Model Based On Service-Grouping 12

A Firewall Rules Optimized Model Based On Service-Grouping

引用

12th Web Information System and Application Conference (WISA)

作者： Zhang, Lin Huang, Mengxing Hainan Univ Coll Informat Sci & Technol Haikou Peoples R China

ISBN: (纸本)9781467393720

Aiming at networks with a large number of firewall rules, in order to reduce the number of rules and rule filtering times while firewall's performance does not change, a firewall policy rules merging model based on rule-service is presented. The model detects the rules in a fast way using an algorithm based on rule service first, and then it resolves the conflicts segment by using action constraint strategy. And then it runs the rule merging algorithm in a set of rules with no anomalies based on service. Finally, the experimental results show that merging efficiency is outperformed compared with other similar rule merging models. Compared to the traditional firewall, the optimized firewall model made less filtering hits while processing the same packets.

关键词： network security firewall policy anomaly merging algorithm rule optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：