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

arXiv 2025年

作者： Logan, Jack A. Sumner, Jacob Grigas, Alex T. Shattuck, Mark D. O'Hern, Corey S. Department of Mechanical Engineering Yale University New HavenCT06520 United States Graduate Program in Computational Biology & Biomedical Informatics Yale University New HavenCT06520 United States Integrated Graduate Program in Physical and Engineering Biology Yale University New HavenCT06520 United States Benjamin Levich Institute and Physics Department The City College of New York New YorkNY10031 United States Department of Applied Physics Yale University New HavenCT06520 United States Department of Physics Yale University New HavenCT06520 United States

Proteins are composed of linear chains of amino acids that fold into complex three-dimensional structures. A general feature of folded proteins is that they are compact with a radius of gyration Rg(N) ∼ Nν that obeys power-law scaling with the number of amino acids N in each protein and ν ∼ 1/3. In this study, we investigate the internal scaling of the radius of gyration Rg(n) versus the chemical separation n between amino acids for all subchains of length n. We show that for globular proteins Rg(n) ∼ nν1,2 with a larger exponent ν1 > 1/3 for small n and a smaller exponent ν2 g(N) ∝ Nν. To describe this scaling behavior for Rg(n), we carry out folding simulations for a series of coarse-grained models for proteins beginning with the freely-jointed and freely-rotating chain models composed of spherical monomers and varying degrees of stereochemical constraints. We show that a minimal model, which coarse-grains amino acids into a single spherical backbone atom and one variable-sized spherical side-chain atom, and enforces bend- and dihedral-angle constraints, can recapitulate Rg(n) for x-ray crystal structures of globular proteins. In addition, this model predicts the correct average packing fraction and size of the hydrophobic core, which are two key physical features that can be used to distinguish between computational 'decoys' and correctly folded proteins in protein design applications. © 2025, CC BY.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Method to Reduce Lead-time of Business Process discovered

Method to Reduce Lead-time of Business Process discovered

引用

International Congress on Image and Signal Processing, BioMedical Engineering and informatics (CISP-BMEI)

作者： Gilberto Aleces dos Santos Luiz Fernando Puttow Southier Edson E. Scalabrin Informatics Graduate Program PUCPR Curitiba Brazil

ISBN: (数字)9780738105451

ISBN: (纸本)9781665422994

The process mining allows to automatically discover process models from event logs. Those models provide information that allow to make many types of analysis based on models, such as: compliance verification, performance analysis and bottlenecks identification on the business process. The bottlenecks identification is highly relevant for process managers to suggest improvements. Here, the improvement which is interesting is the lead-time reduction. A double hypothesis was made. The first is that lead-time reduction goes through the identification and removal of bottlenecks at the business process. The second is that the focused intervention at the critical path allows to reduce lead-time causing small changes on the current process. The process mining allows, by using model process discovery, to obtain basic statistic information of a business process, as: minimal, maximum and average duration of each activity. The technique PERT/CPM allows to calculate for each activity the weighted average of the expected execution and the critical path. This helps to identify the relevant activity focusing on the bottlenecks of a business process. The experiments show that the method allows to reduce the lead-time of a process and indicate the degree of the resource's commitment in each of the method iterations, in terms of similarity among optimized model and original model. The experiments were conducted over real word "Hospital Billing" and "Sepsis cases" databases.

关键词： Business Lead Task analysis Data models Data mining Analytical models Optimization

来源：评论

学校读者我要写书评

暂无评论

Multiclass Classification of Online Comments Based on Toxicity Scale 14th

Multiclass Classification of Online Comments Based on Toxici...

引用

14th International Conference on Computer Science and its Applications, CSA 2022 and the 16th KIPS International Conference on Ubiquitous Information Technologies and Applications, CUTE 2022

作者： eun Kang, Jo Kim, Jisun su Do, Hyeon Oh, Sihyun hwa Lee, Si jee Jeung, Min seo Choi, Min Oh, Se Jong Doo, Ill Chul Department of Interdisciplinary Graduate Program of Linguistics and Informatics Yonsei University Graduate School Seoul Korea Republic of Department of Political Science and International Relations Hankuk University of Foreign Studies Seoul Korea Republic of Department of Japanese Language and Culture Soochow University Taipei Taiwan Department of English Linguistics & Language Technology Hankuk University of Foreign Studies Seoul Korea Republic of Department of Hungarian Hankuk University of Foreign Studies Yongin Korea Republic of Department of French Studies Hankuk University of Foreign Studies Yongin Korea Republic of Department of Information Communications Engineering Hankuk University of Foreign Studies Yongin Korea Republic of Artificial Intelligence Education Hankuk University of Foreign Studies Yongin Korea Republic of

ISBN: (纸本)9789819912513

Our research specifies the criteria for categorizing comments and supplements the limitations of the existing services that filter out only some of the direct malicious comments centered on specific vocabulary and phrases. In comparison to prior research detecting three sentiments as positive, negative, or neutral, we subdivided expressions into six categories. Our model applying classification downstream tasks to a pre-trained KcBERT model draws results reflecting the meaning and social context of the comments. An improved accuracy compared to previous studies shows a meaningful outcome. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

D-SRGAN: DEM Super-Resolution with Generative Adversarial Networks

引用

SN Computer Science 2021年第1期2卷 48页

作者： Demiray, Bekir Z. Sit, Muhammed Demir, Ibrahim Department of Computer Science University of Iowa Iowa City United States Interdisciplinary Graduate Program in Informatics University of Iowa Iowa City United States Department of Civil and Environmental Engineering University of Iowa Iowa City United States Department of Electrical and Computer Engineering University of Iowa Iowa City United States

Digital elevation model (DEM) is a critical data source for variety of applications such as road extraction, hydrological modeling, flood mapping, and many geospatial studies. The usage of high-resolution DEMs as inputs in many application areas improves the overall reliability and accuracy of the raw dataset. The goal of this study is to develop a machine learning model that increases the spatial resolution of DEM without additional information. In this paper, a GAN based model (D-SRGAN), inspired by single image super-resolution methods, is developed and evaluated to increase the resolution of DEMs. The experiment results show that D-SRGAN produces promising results while constructing 3 feet high-resolution DEMs from 50 feet low-resolution DEMs. It outperforms common statistical interpolation methods and neural network *** study shows that it is possible to use the power of artificial neural networks to increase the resolution of the DEMs. The study also demonstrates that approaches from single image super-resolution can be applied for DEM super-resolution. © 2021, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. part of Springer Nature.

关键词： Deep learning DEM DEM reconstruction Generative adversarial networks (GANs) Super-resolution

来源：评论

学校读者我要写书评

暂无评论

Investigating the computation of smoothed deceptive routes in topographic terrains for agent-based simulation systems

Investigating the computation of smoothed deceptive routes i...

引用

Computational Intelligence in Security, Defence and Biometrics (CISDB), IEEE Symposium on

作者： Luigi P. Souza Thiago R. S. Leão Crhistopher Lenhard Edison P. Freitas Luis A. L. Silva Graduate Program in Computer Science Federal Univ. of Santa Maria Santa Maria Brazil Undergraduate Course in Computer Science Federal Univ. of Santa Maria Santa Maria Brazil Institute of Informatics Federal Univ. of Rio Grande do Sul Porto Alegre Brazil Applied Computing Department Federal Univ. of Santa Maria Santa Maria Brazil

ISBN: (数字)9798331508296

ISBN: (纸本)9798331508302

The capacity to deceptively move in hilly terrains is fundamental to agents in simulation systems for tactical and strategic military training. Such an ability to deceive the adversary can ensure a relevant advantage by hiding the real goals of a mission. Using pairs of real and deceptive mission goals, this paper investigates the planning of realistic deceptive routes for simulated agents. With real-world terrain elevation maps, it shows how to explore pathfinding algorithms with relevant path-smoothing characteristics (Theta* and WJPS*, contrasting with the standard $A^{*}$ algorithm) in terrains with pronounced relief features. The study analyzes the effects of terrain elevation costs and the representation of relief contour lines on the determination of more realistic deceptive paths. This work also investigates how users can adjust a Last Topographic Deceptive Point ($L D P_{T}$) calculation to enhance the pathfinding algorithm’s ability to produce more deceptively dense and topographically aware routes. Experimental results for different deceptive topographic path planning strategies are evaluated according to statistical models showing that Theta*, despite being slower than the base $A^{*}$ method in most cases, generated smoothed paths while maintaining a similar deception density for the proposed strategies. On the other hand, WJPS outperformed both in execution time for certain strategies while maintaining the smoothed path characteristic and resulting in a path with lower deceptive capacity.

关键词： Training Hands Biometrics Costs Path planning Planning Security Standards Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Pilot Assignment in Cell-Free Massive MIMO

arXiv

引用

arXiv 2023年

作者： Guedes, Raphael M. de Rezende, José F. Barbosa, Valmir C. Informatics and Computer Science Department State University of Rio de Janeiro RJ Rio de Janeiro20550-900 Brazil Systems Engineering and Computer Science Program Federal University of Rio de Janeiro RJ Rio de Janeiro21941-914 Brazil Graduate Program in Computational Sciences State University of Rio de Janeiro RJ Rio de Janeiro20550-900 Brazil

Cell-free massive MIMO systems are currently being considered as potential enablers of future (6G) technologies for wireless communications. By combining distributed processing and massive MIMO, they are expected to deliver improved user coverage and efficiency. A possible source of performance degradation in such systems is pilot contamination, which contributes to causing interference during uplink training and affects channel estimation negatively. Contamination occurs when the same pilot sequence is assigned to more than one user. This is in general inevitable, as the number of mutually orthogonal pilot sequences corresponds to only a fraction of the coherence interval. We introduce a new algorithm for pilot assignment and analyze its performance both from a theoretical perspective and in computational experiments. We show that it has an approximation ratio close to 1 for a plausibly large number of orthogonal pilot sequences, as well as low computational complexity under massive parallelism. We also show that, on average, it outperforms other methods in terms of per-user SINR and throughput on the uplink. Copyright © 2023, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Multi-way Time Series Join on Multi-length Patterns

Multi-way Time Series Join on Multi-length Patterns

引用

IEEE International Conference on Data Mining (ICDM)

作者： Md Parvez Mollah Vinicius M. A. Souza Abdullah Mueen University of New Mexico Albuquerque USA Graduate Program in Informatics Pontifícia Universidade Católica do Paraná Curitiba Brazil

ISBN: (纸本)9781665423991

This paper introduces a new pattern mining task that considers aligning or joining a set of time series based on an arbitrary number of subsequences (i.e., patterns) with arbitrary lengths. Joining multiple time series along common patterns can be pivotal in clustering and summarizing large time series datasets. An exact algorithm to join hundreds of time series based on multi-length patterns is impractical due to the high computational costs. This paper proposes a fast algorithm named MultiPAL to join multiple time series at interactive speed to summarize large time series datasets. The algorithm exploits Matrix Profiles of the individual time series to enable a greedy search over possible joins. The algorithm is orders of magnitude faster than the exact solution and can utilize hundreds of Matrix Profiles. We evaluate our algorithm for sequential mining on data from various real-world domains, including power management and bioacoustics monitoring.

关键词： Power system management Heuristic algorithms Conferences Time series analysis Clustering algorithms Iterative algorithms Data mining

来源：评论

学校读者我要写书评

暂无评论

Dynamic Deployment and Control of an NDN Network for Military Multi-UAVs Based Surveillance Applications

Dynamic Deployment and Control of an NDN Network for Militar...

引用

International Conference on Unmanned Aircraft Systems (ICUAS)

作者： Otávio A. Rocha da Cruz Carlos Eduardo Pereira Antonio Santos da Silva João Paulo J. da Costa Paulo Mendes Edison Pignaton de Freitas Graduate Program in Electrical Engineering Federal University of Rio Grande do Sul Rio Grande do Sul Brazil Institute of Informatics Federal University of Rio Grande do Sul Rio Grande do Sul Brazil Hamm-Lippstadt University of Applied Sciences (HSHL) Hamm Germany Karlsruhe Institute of Technology (KIT) Karlsruhe Germany Airbus Taufkirchen Germany

ISBN: (数字)9798350357882

ISBN: (纸本)9798350357899

The military usage of Unmanned Aerial Vehicles (UAVs) has garnered attention, especially after their employment in the Ukrainian war. Despite the most commented lethal usage, they have many other applications from which surveillance for imagery acquisition is one of primal importance. Using a standalone UAV for this purpose is well-known, but to cope with the scale of battlefield operations, using multi- UAV systems is an asset of great value. However, these systems rely on ad hoc networks that require solutions beyond conventional ones based on the Internet Protocol (IP). This paper addresses this concern by proposing a communication support mechanism for multi-UAV military surveillance systems based on the Information-Centric Networks (ICN) paradigm. The proposed approach consists of the dynamic deployment of an ICN network based on microservices architecture, where the communication services of each UAV are deployed according to their resources. The solution is validated in a simulated battlefield scenario where a surveillance UAV provides data demanded by other nodes. The results demonstrate that the proposed solution minimizes the data delivery delays by successfully deploying the customized set of microservices to support the transmission, even when a UAV with a low battery level is replaced at runtime.

关键词： Military communication Runtime Protocols Surveillance Information-centric networking Microservice architectures Autonomous aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

Dynamic Healthcare Embeddings for Improving Patient Care

Dynamic Healthcare Embeddings for Improving Patient Care

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Hankyu Jang Sulyun Lee D. M. Hasibul Hasan Philip M. Polgreen Sriram V. Pemmaraju Bijaya Adhikari Department of Computer Science University of Iowa Iowa City Iowa USA Interdisciplinary Graduate Program in Informatics University of Iowa Iowa City Iowa USA Department of Internal Medicine University of Iowa Iowa City Iowa USA

As hospitals move towards automating and integrating their computing systems, more fine-grained hospital operations data are becoming available. These data include hospital architectural drawings, logs of interactions between patients and healthcare professionals, prescription data, procedures data, and data on patient admission, discharge, and transfers. This has opened up many fascinating avenues for healthcare-related prediction tasks for improving patient care. However, in order to leverage off-the-shelf machine learning software for these tasks, one needs to learn structured representations of entities involved from heterogeneous, dynamic data streams. Here, we propose DECENT, an auto-encoding heterogeneous co-evolving dynamic neural network, for learning heterogeneous dynamic embeddings of patients, doctors, rooms, and medications from diverse data streams. These embeddings capture similarities among doctors, rooms, patients, and medications based on static attributes and dynamic interactions. DECENT enables several applications in healthcare prediction, such as predicting mortality risk and case severity of patients, adverse events (e.g., transfer back into an intensive care unit), and future healthcare-associated infections. The results of using the learned patient embeddings in predictive modeling show that DECENT has a gain of up to 48.1% on the mortality risk prediction task, 12.6% on the case severity prediction task, 6.4% on the medical intensive care unit transfer task, and 3.8% on the Clostridioides difficile (***) Infection (CDI) prediction task over the state-of-the-art baselines. In addition, case studies on the learned doctor, medication, and room embeddings show that our approach learns meaningful and interpretable embeddings.

关键词： Hospitals Social networking (online) Neural networks Machine learning Predictive models Back Software

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm to Update Incremental Attributes in Morphological Trees

SSRN

引用

SSRN 2022年

作者： Gobber, Charles Ferreira Hashimoto, Ronaldo Fumio Alves, Wonder Alexandre Luz Informatics and Knowledge Management Graduate Program Universidade Nove de Julho São Paulo Brazil Department of Computer Science Institute of Mathematics and Statistics Universidade de São Paulo São Paulo Brazil

Attribute Filters are powerful image simplification operators that have very good contour-preservation properties. They can be efficiently computed using morphological trees. The most common strategy to compute attribute filters using morphological trees is based on three steps: (i) tree construction: the tree is built along with its attributes;(ii) filtering: we simplify the tree by removing some of its nodes based on some attribute and a filtering rule defined on a threshold value;and (iii) image reconstruction: this is the final phase where the tree is converted back to an image leading to an attribute filter. However, after filtering a few attributes in tree may change and they must be updated, since some attribute filters are computed by filtering the simplified tree again, but with a different threshold. In this paper it is presented an efficient algorithm to update incremental attributes in morphological trees with low memory consumption and fast computation. © 2022, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：