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

computational algorithms and Aesthetic Impact in Animated Visual Effects

IEEE ACCESS 2024年 12卷 188890-188901页

作者： Duan, Tao Dong, Wei Wang, Fei Yao, Yuxia Jilin Engn Normal Univ Coll Arts & Design Changchun 130000 Jilin Peoples R China Jilin Engn Normal Univ Coll Educ Sci Changchun 130000 Jilin Peoples R China Jilin Agr Univ Coll Informat Technol Changchun 130000 Jilin Peoples R China

computational algorithms play a crucial role in shaping the aesthetic impact of animated visual effects (VFX). This abstract explores the intersection of technical algorithms and artistic expression in the realm of VFX, focusing on their collaborative role in modern animation. The integration of computational algorithms enhances the realism and creativity of animated VFX. Advanced rendering techniques such as ray tracing and global illumination algorithms simulate light behavior with high fidelity, achieving photorealistic effects that captivate audiences. Procedural algorithms generate complex geometries and textures efficiently, facilitating the creation of intricate and visually appealing animations. Beyond technical fidelity, algorithms also enable novel artistic expressions. Generative algorithms, for instance, allow animators to explore unconventional designs and styles, pushing the boundaries of visual storytelling. algorithms in simulation contribute to the lifelike movement of characters and elements, enhancing emotional engagement and narrative impact. The synergy between computational algorithms and artistic vision in animated VFX underscores their transformative impact on contemporary animation. This abstract highlights the essential role of algorithms in fostering innovation and creativity, advancing the field of animated visual effects into new realms of aesthetic possibility.

关键词： Visualization Heuristic algorithms Visual effects computational modeling Solid modeling Rendering (computer graphics) Accuracy Animation Art computational algorithms animated visual effects aesthetic impact procedural techniques generative art

来源：评论

学校读者我要写书评

暂无评论

Scoring functions for computational algorithms applicable to the design of spiked oligonucleotides

引用

NUCLEIC ACIDS RESEARCH 1998年第3期26卷 697-702页

作者： Jensen, LJ Andersen, KV Svendsen, A Kretzschmar, T Novo Nordisk AS Dept Enzyme Design DK-2880 Bagsvaerd Denmark

Protein engineering by inserting stretches of random DNA sequences into target genes in combination with adequate screening or selection methods is a versatile technique to elucidate and improve protein functions. Established compounds for generating semi-random DNA sequences are spiked oligonucleotides which are synthesised by interspersing wild type (wt) nucleotides of the target sequence with certain amounts of other nucleotides. Directed spiking strategies reduce the complexity of a library to a manageable format compared with completely random libraries. computational algorithms render feasible the calculation of appropriate nucleotide mixtures to encode specified amino acid subpopulations. The crucial element in the ranking of spiked codons generated during an iterative algorithm is the scoring function. In this report three scoring functions are analysed: the sum-of-square-differences function s, a modified cubic function c,and a scoring function m derived from maximum likelihood considerations. The impact of these scoring functions on calculated amino acid distributions is demonstrated by an example of mutagenising a domain surrounding the active site serine of subtilisin-like proteases. At default weight settings of one for each amino acid, the new scoring function m is superior to functions s and c in finding matches to a given amino acid population.

关键词： .oligonucleotides applicable protein engineering deviations Subtilisin Scoring functions computational algorithms synthesising

来源：评论

学校读者我要写书评

暂无评论

A review of computational algorithms for CpG islands detection

引用

JOURNAL OF BIOSCIENCES 2019年第6期44卷 1页

作者： Tahir, Rana Adnan Zheng, Da Nazir, Amina Qing, Hong Beijing Inst Technol Key Lab Mol Med & Biotherapy Minist Ind & Informat Technol Dept BiolSch Life Sci Beijing Peoples R China COMSATS Univ Islamabad Dept Biosci Sahiwal Campus Islamabad Pakistan

CpG islands are generally known as the epigenetic regulatory regions in accordance with histone modifications, methylation, and promoter activity. There is a significant need for the exact mapping of DNA methylation in CpG islands to understand the diverse biological functions. However, the precise identification of CpG islands from the whole genome through experimental and computational approaches is still challenging. Numerous computational methods are being developed to detect the CpG-enriched regions, effectively, to reduce the time and cost of the experiments. Here, we review some of the latest computational CpG detection methods that utilize clustering, patterns and physical-distance like parameters for CpG island detection. The comparative analyses of the methods relying on different principles and parameters allow prioritizing the algorithms for specific CpG associated datasets to achieve higher accuracy and sensitivity. A number of computational tools based on the window, Hidden Markov Model, density and distance-/length-based algorithms are being applied on human or mammalian genomes for accurate CpG detection. Comparative analyses of CpG island detection algorithms facilitate to prefer the method according to the target genome and required parameters to attain higher accuracy, specificity, and performance. There is still a need for efficient computational CpG detection methods with lower false-positive results. This review provides a better understanding about the principles of tools that will assist to prioritize and develop the algorithms for accurate CpG islands detection.

关键词： Bioinformatics computational algorithms CpG island CpGcluster epigenetics methylation

来源：评论

学校读者我要写书评

暂无评论

computational algorithms FOR STATE-DEPENDENT QUEUING-NETWORKS

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 1983年第1期1卷 67-92页

作者： SAUER, CH IBM Department 450 Building 984 11400 Burnet Road Austin TX

来源：评论

学校读者我要写书评

暂无评论

computational algorithms that effectively reduce report defects in surgical pathology

引用

Journal of Pathology Informatics 2019年第1期10卷 20页

作者： Ye, Jay J. Tan, Michael R. Dahl-Chase Pathology Associates Bangor ME United States

Background: Pathology report defects refer to errors in the pathology reports, such as transcription/voice recognition errors and incorrect nondiagnostic information. Examples of the latter include incorrect gender, incorrect submitting physician, incorrect description of tissue blocks submitted, report formatting issues, and so on. Over the past 5 years, we have implemented computational algorithms to identify and correct these report defects. Materials and Methods: Report texts, tissue blocks submitted, and other relevant information are retrieved from the pathology information system database. Two complementary algorithms are used to identify the voice recognition errors by parsing the gross description texts to either (i) identify previously encountered error patterns or (ii) flag sentences containing previously-unused two-word sequences (bigrams). A third algorithm based on identifying conflicting information from two different sources is used to identify tissue block designation errors in the gross description;the information on actual block submission is compared with the block designation information parsed from the gross description text. Results: The computational algorithms identify voice recognition errors in approximately 8%-10% of the cases and block designation errors in approximately 0.5%-1% of all the cases. Conclusions: The algorithms described here have been effective in reducing pathology report defects. In addition to detecting voice recognition and block designation errors, these algorithms have also be used to detect other report defects, such as wrong gender, wrong provider, special stains or immunostains performed but not reported, and so on. © 2020 Wolters Kluwer Medknow Publications. All rights reserved.

关键词： computational algorithms error reduction in pathology pathology report defects

来源：评论

学校读者我要写书评

暂无评论

New Technologies and Trends in Artificial Intelligence: computational algorithms, Data Modelling, and Applications

New Technologies and Trends in Artificial Intelligence: Comp...

引用

作者： C.L.Philip Chen South China University of Technology

This talk will review new technologies and trends in artificial intelligence (AI) from algorithmic, data modeling, and applications perspective. Subjects include algorithms and technologies being developed from specific AI to general AI, explainable AI, small sample learning and zero-shot learning, non-deep-structure learning, and computational brain science. Also, design of reliable and robust AI algorithms and its applications will be discussed.

关键词： and Applications Data Modelling computational algorithms New Technologies and Trends in Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

The moon, the ghetto and artificial intelligence: Reducing systemic racism in computational algorithms

引用

GOVERNMENT INFORMATION QUARTERLY 2022年第2期39卷 101645-101645页

作者： Fountain, Jane E. Univ Massachusetts Amherst Sch Publ Policy Amherst MA 01003 USA

computational algorithms and automated decision making systems that include them offer potential to improve public policy and organizations. But computational algorithms based on biased data encode those biases into algorithms, models and their outputs. Systemic racism is institutionalized bias with respect to race, ethnicity and related attributes. Such bias is located in data that encode the results and outputs of decisions that have been discriminatory, in procedures and processes that may intentionally or unintentionally disadvantage people based on race, and in policies that may discriminate by race. computational algorithms may exacerbate systemic racism if they are not designed, developed, and used-that is, enacted-with attention to identifying and remedying bias specific to race. Advancing social equity in digital governance requires systematic, ongoing efforts to assure that automated decision making systems, and their enactment in complex public organizational arrangements, are free from bias.

关键词： Digital government Public management Systemic racism Discrimination Artificial intelligence Machine learning computational algorithms

来源：评论

学校读者我要写书评

暂无评论

Machine learning methods for wildfire risk assessment

引用

EARTH SCIENCE INFORMATICS 2025年第1期18卷 1-24页

作者： Brys, Carlos Martinez, David Luis La Red Marinelli, Marcelo Natl Univ Misiones Fac Econ Sci Comp Sci Dept Ave Llamosas 9458 RA-3300 Posadas Misiones Argentina Natl Univ Northeast Fac Exact & Nat & Surveying Sci Comp Sci Dept Ave Libertad 5460 RA-3400 Corrientes Corrientes Argentina Natl Univ Misiones Fac Exact Chem & Nat Sci Comp Sci Dept Felix de Azara 1552 RA-3300 Posadas Misiones Argentina

Accurate fire risk prediction is crucial to mitigate the significant threats of wildfires to ecosystems, human life, and property. This article reviews various computational algorithms for predicting the risk of wildfires, highlighting their methodologies, related work, and findings. Key algorithms include Logistic Regression, Random Forest, Artificial Neural Networks, and Deep Learning models such as Convolutional Neural Networks and Long Short-Term Memory Neural Networks. The review synthesizes contributions from numerous studies to provide a comprehensive overview of the state of the art in predicting the risk of wildfires. Advances in computational technologies and the availability of large volumes of data have enabled the development of more accurate algorithms to predict and assess fire risk more accurately. Wildfires exert catastrophic effects on natural ecosystems, air quality, and human health, and the increasing frequency and intensity of these fires, intensified by climate change, underscores the need for more accurate predictive models to mitigate their impacts.

关键词： Forest fires Risk prediction computational algorithms Emergency management Forest planning

来源：评论

学校读者我要写书评

暂无评论

MICROCOMPUTERS AGAINST SUPERCOMPUTERS - ON GEOMETRIC PARTITION OF THE computational BOX FOR VECTORIZED MD algorithms

引用

MOLECULAR SIMULATION 1992年第3-5期8卷 305-319页

作者： KITOWSKI, J MOSCINSKI, J Institute of Computer Science 30-059 Cracow AGH al. Mickiewicza 30 Poland

In the paper three vector algorithms (with original data structures and no nearest neighbour lists) for Molecular Dynamics simulation are compared and their timings presented. The timings have been obtained on ETA 10-P*108 and IBM 3090/150E (with Vector Facility) computers as well as on several microprocessors (e.g. MOTOROLA MC68020/68881, INTEL i80386/387, i486 and INMOS TRANSPUTER T800).

关键词： MOLECULAR DYNAMICS LENNARD-JONES POTENTIALS computational algorithms DATA STRUCTURES FOR VECTOR PROCESSING MICROPROCESSORS

来源：评论

学校读者我要写书评

暂无评论

An integrative TLBO-driven hybrid grey wolf optimizer for the efficient resolution of multi-dimensional, nonlinear engineering problems

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-71页

作者： Singh, Harleenpal Saxena, Sobhit Sharma, Himanshu Kamboj, Vikram Kumar Arora, Krishan Joshi, Gyanendra Prasad Cho, Woong Lovely Profess Univ Sch Elect & Elect Engn Phagwara Punjab India GH Raisoni Coll Engn & Management Nagpur India Univ Calgary Schulich Sch Engn Calgary AB Canada Kangwon Natl Univ Dept Elect & AI Syst Engn Samcheok South Korea

This research article introduces a hybrid optimization algorithm, referred to as Grey Wolf Optimizer-Teaching Learning Based Optimization (GWO-TLBO), which extends the Grey Wolf Optimizer (GWO) by integrating it with Teaching-Learning-Based Optimization (TLBO). The benefit of GWO is that it explores potential solutions in a way similar to how grey wolves hunt, but the challenge with this approach comes during fine-tuning, where the algorithm settles too early on suboptimal results. This weakness can be compensated by integrating TLBO method into the algorithm to improve its search power of solutions as in teaches students how to learn and teachers are knowledge felicitator. GWO-TLBO algorithm was applied for several benchmark optimization problems to evaluate its effectiveness in simple to complex scenarios. It is also faster, more accurate and reliable when compare to other existing optimization algorithms. This novel approach achieves a balance between exploration and exploitation, demonstrating adaptability in identifying new solutions but also quickly zoom in on (near) global optima: this renders it a reliable choice for challenging optimization problems according to the analysis and results.

关键词： Performance benchmarks Population-based metaheuristics Global optimization Engineering design challenges computational algorithms Optimization techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：