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

3rd International Conference on Data Analytics, Computing and Artificial Intelligence, ICDACAI 2024

作者： Wu, Qiangyin Changchun Humanities and Sciences College Changchun130117 China

ISBN: (纸本)9798331519032

Nowadays, the information acquisition channels of media have gradually shifted to the Internet, and the decline of traditional media has become a foregone conclusion in the face of new media backed by big data, and the strong rise of new media has also changed the mode of information push. This personalized push mechanism has always had the problem of poor alignment with the customer's interest points. Therefore, this paper proposes to optimize the content recommendation system by using the computer algorithm represented by the Bayesian classification algorithm, which not only improves its performance, but also tries to alleviate the information cocoon phenomenon brought by the current new media. In the final comparison experiment on the average absolute error between the user's predicted rating and the actual rating, the average absolute error of the experimental group based on the proposed method was 0.2974, while the average absolute error of the control group using the conventional system was 0.3481. In other words, this method greatly improves the control of the content recommendation system over the user's preferences, so as to push the content that they are more interested in. © 2024 IEEE.

关键词： bayesian classification algorithm computer algorithm content recommendation system new media

来源：评论

学校读者我要写书评

暂无评论

COMPLX: a computer algorithm for the detection of protein-ligand and other macromolecular complexes in mass spectra

引用

JOURNAL OF MASS SPECTROMETRY 2003年第5期38卷 573-581页

作者： Wong, JWH Downard, KM Univ Sydney Sch Mol & Microbial Biosci Sydney NSW 2006 Australia

A new algorithm has been designed and tested to identify protein, or any other macromolecular, complexes that have been widely reported in mass spectral data. The program takes advantage of the appearance of multiply charged ions that are common to both electrospray ionization and, to a lesser extent, matrix-assisted laser desorption/ionization (MALDI) mass spectra. The algorithm, known as COMPLX for the COMposition of Protein-Ligand compleXes, is capable of identifying complexes for any protein or macromolecule with a binding partner of molecular mass up to 100000 Da. It does so by identifying ion pairs present in a mass spectrum that, when they share a common charge, have an m/z value difference that is an integer fraction of a ligand or binding partner molecular mass. Several additional criteria must be met in order for the result to be ranked in the output file including that all m/z values for ions of the protein or complex have progressively lower values as their assigned charge increases, the difference between the m/z values for adjacent charge states (z, z+1) decrease as the assigned charge state increases, and the ratio of any two m/z values assigned to a protein or complex is equal to the inverse ratio of their charge., The entries that satisfy these criteria are then ranked according to the appearance of ions in the mass spectrum associated with the binding partner, the length of a continuous series of charges across any set of ions for a protein and complex and the lowest error recorded for the molecular mass of the ligand or binding partner. A diverse range of hypothetical and experimental mass spectral data were used to implement and test the program, including those recorded for antibody-peptide, protein-peptide and protein-heme complexes. Spectra of increasing complexity, in terms of the number of ions input, were also successfully analysed in which the number of input m/z values far exceeds the few associated with a macromolecular complex. Thus the

关键词： computer algorithm protein complex macromolecule mass spectrometry

来源：评论

学校读者我要写书评

暂无评论

A computer algorithm FOR THE ANALYSIS OF PROTEIN DISTRIBUTION IN BUDDING YEAST

引用

CYTOMETRY 1984年第1期5卷 81-85页

作者： MARTEGANI, E VANONI, M DELIA, D IST NAZL STUDIO & CURA TUMORI I-20133 MILAN ITALY

Protein distribution is related to age distribution and depends on the law of growth of the population and the law of growth of the single cell. To extract the available information from protein distribution, at a computer algorithm was developed starting from a model for growth of S. cerevisiae. This algorithm quantitatively fits experimental protein distributions, allows a deconvolution of these distributions, and thus yields information about temporal parameters of the cell cycle and structure of yeast populations.

关键词： Growth kinetics Saccharomyces cerevisiae protein distributions structured model flow cytometry computer algorithm

来源：评论

学校读者我要写书评

暂无评论

Paper 5: Surveillance of Multiple Congenital Anomalies: Implementation of a computer algorithm in European Registers for Classification of Cases

引用

BIRTH DEFECTS RESEARCH PART A-CLINICAL AND MOLECULAR TERATOLOGY 2011年第S1期91卷 S44-S50页

作者： Garne, Ester Dolk, Helen Loane, Maria Wellesley, Diana Barisic, Ingeborg Calzolari, Elisa Densem, James Hosp Lillebaelt Dept Paediat DK-6000 Kolding Denmark Univ Ulster Belfast Antrim North Ireland Princess Anne Hosp Southampton Hants England Childrens Univ Hosp Zagreb Croatia Univ Ferrara I-44100 Ferrara Italy

BACKGROUND: Surveillance of multiple congenital anomalies is considered to be more sensitive for the detection of new teratogens than surveillance of all or isolated congenital anomalies. Current literature proposes the manual review of all cases for classification into isolated or multiple congenital anomalies. METHODS: Multiple anomalies were defined as two or more major congenital anomalies, excluding sequences and syndromes. A computer algorithm for classification of major congenital anomaly cases in the EUROCAT database according to International Classification of Diseases (ICD)v10 codes was programmed, further developed, and implemented for 1 year's data (2004) from 25 registries. The group of cases classified with potential multiple congenital anomalies were manually reviewed by three geneticists to reach a final agreement of classification as "multiple congenital anomaly'' cases. RESULTS: A total of 17,733 cases with major congenital anomalies were reported giving an overall prevalence of major congenital anomalies at 2.17%. The computer algorithm classified 10.5% of all cases as "potentially multiple congenital anomalies''. After manual review of these cases, 7% were agreed to have true multiple congenital anomalies. Furthermore, the algorithm classified 15% of all cases as having chromosomal anomalies, 2% as monogenic syndromes, and 76% as isolated congenital anomalies. The proportion of multiple anomalies varies by congenital anomaly subgroup with up to 35% of cases with bilateral renal agenesis. CONCLUSIONS: The implementation of the EUROCAT computer algorithm is a feasible, efficient, and transparent way to improve classification of congenital anomalies for surveillance and research. Birth Defects Research (Part A) 91: S44-S50, 2011. (C) 2011 Wiley-Liss, Inc.

关键词： multiple congenital anomaly computer algorithm classification surveillance etiology

来源：评论

学校读者我要写书评

暂无评论

Analysis on computer algorithm and Display Methods of Network Diagrams

Analysis on Computer Algorithm and Display Methods of Networ...

引用

2016 2nd International Conference on Materials Engineering and Information Technology Applications(MEITA 2016)

作者： Jin He Hongchong Zhang School of Electrical Engineering Chongqing Vocational Institute of Engineering Department of Party Committee Propaganda Chongqing Vocational Institute of Engineering

With the rapid development of information technology,the combination of information technology with digital-related knowledge,and the widespread use of information technology in real life,many real problems need to be solved by building mathematical model,and the probability of solving some problems about discrete structure with mathematical technology becomes increasingly *** this context,the writer introduced the history of graph theory and the future development direction first,then analyzed the computer algorithm and display methods of network diagrams in detail,and put forward some methods of improving analysis on computer algorithm and display methods of network diagrams based on the actual situation and the future development direction.

关键词： Analysis on network diagrams computer algorithm Display methods Analysis

来源：评论

学校读者我要写书评

暂无评论

DIGITIZATION OF ARC‐SHAPED TIME‐LINE EVENT RECORDING CHART: A computer algorithm

引用

JAWRA Journal of the American Water Resources Association 1986年第5期22卷 769-775页

作者： Liu, C.J. Albright, R.C. Department of Forestry University of Kentucky Lexington Kentucky 40546-0073 United States Department of Forestry Southern Illinois University Carbondale Illinois 62901 106 S Dixon United States

ABSTRACT: A mechanical drum‐type data logger registers data on a recording chart in graphic form. Subsequent computer analysis requires that the data be transformed into digital form. Besides the traditional manual chart‐interpretation techniques, electronic digitization can be used for data transformation. Our paper reports an algorithm for rectilinear digitization of event‐recording charts whose time lines are inherently arc shaped. Using this algorithm, we obtained accurate data transformations from repeated tests of digitizing hydrographic charts at the Watershed Laboratory, Department of Forestry, University of Kentucky. Our experience has shown that ‐ in terms of speed and accuracy ‐ this computer‐based procedure is superior to available alternative procedures. Copyright © 1986, Wiley Blackwell. All rights reserved

关键词： automation computer algorithm decision tree digitization event recorder hydrograph

来源：评论

学校读者我要写书评

暂无评论

Research on computer algorithm and Display Method of Network Diagram

Research on Computer Algorithm and Display Method of Network...

引用

2017 4th International Conference on Machinery,Materials and computer(MACMC 2017)

作者： Wangming Yang College of Computer and Information China Three Gorges University

ISBN: (纸本)9781510871038

Information technology has a very important role in the development of human society. Human development plays an irreplaceable role in in the process of social production practice. Through various mathematical models built by the computer, solve a variety of problems appears. In order to solve some discrete problems, relying on computer numerical calculation will play an irreplaceable role. In this paper, we mainly discuss the computer algorithm and display method of network diagram, and make some brief descriptions on some basic concepts of network diagram. The development process of computer algorithm and display method of network diagram is briefly introduced and the future is fully prospected, its purpose is to make science and technology have better development.

关键词： Network diagram computer algorithm Display method Research

来源：评论

学校读者我要写书评

暂无评论

Study on computer Model algorithm of Laying Strategy in Garment Layout Technology

Study on Computer Model Algorithm of Laying Strategy in Garm...

引用

2015 International Conference on Advances in Mechanical Engineering and Industrial Informatics(AMEII 2015)

作者： Li-na Cui Deparment of Arts and Design Quanzhou Normal University

The key problem of garment layout is laying as much garment patterns as possible in the certain 2D fabric, making sure the fabric's using rate high enough as far as possible. This study takes mathematical analysis... 详细信息

关键词： component Garment layout mathematical expression laying strategy computer algorithm

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Security of Mobile Communication System Based on computer algorithms

引用

INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS 2025年第1期34卷

作者： Zhang, Jinna Zhengzhou Vocat Coll Finance & Taxat Dept Informat Technol Zhengzhou 450000 Henan Peoples R China

With the progress of information technology recently, mobile communication system edge computing (EC) has been widely used in all walks of life, but the traditional mobile communication system EC mode has security problems such as privacy disclosure, malicious tampering, and virus attacks. computer algorithms has brought new vitality to EC in mobile communication systems. This paper analyzed the application of computer algorithm in EC mode of mobile communication system, and selected 20 users as the research object. This paper adopted traditional computing mode (such as cloud computing) and computer algorithm-based mobile communication system EC security research. This text compared the effects of two modes on security performance, data transmission efficiency, energy consumption, cost savings, and user satisfaction. The experimental results in this paper showed that the average security of EC mode of mobile communication system based on computer algorithm was 84%, and the average data transmission time was 4.8s. The energy consumption was 40%, and the cost savings and user satisfaction were 432,000 yuan and 13 points, respectively. Both were superior to the traditional edge counting mode. The EC mode of mobile communication system using computer algorithms can significantly improve the security of mobile communication, data transmission speed, cost savings, user satisfaction, and reduce energy consumption. This model has important significance and value for social development.

关键词： Edge computing mobile communication computer algorithm network security general appearance

来源：评论

学校读者我要写书评

暂无评论

Some results on constructing three-level blocked designs with general minimum lower-order confounding

引用

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 2025年

作者： Li, Zhi Li, Zhiming Tian, Rui Li, Zhengqi Xinjiang Univ Coll Math & Syst Sci Urumqi Peoples R China

Blocked designs are widely used in experimental situations when the experimental units are not homogeneous. This article introduces the blocked general minimum lower-order confounding (B1-GMC) criterion for selecting optimal three-level blocked designs. Some properties of three-level B1-GMC designs are provided in terms of their complementary sets. We obtain a systematic theory on constructing three-level B1-GMC designs. Several efficient algorithms for finding three-level B1-GMC designs are provided and implemented by Python. For application, B1-GMC designs with 27-, 81- and 243-run, respectively, are tabulated.

关键词： Blocked designs blocked general minimum lower-order confounding computer algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：