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

43rd Annual Meeting of the Cognitive Science Society: Comparative Cognition: Animal Minds, CogSci 2021

作者： Zhang, Yayun Amatuni, Andrei Cain, Ellis Wang, Xizi Crandall, David Yu, Chen Department of Psychology University of Texas Austin United States Cognitive Science Program Indiana University Bloomington United States Luddy School of Informatics Computing and Engineering Indiana University Bloomington United States

Learning verbs is challenging because it is difficult to infer the precise meaning of a verb when there are a multitude of relations that one can derive from a single event. To study this verb learning challenge, we used children’s egocentric view collected from naturalistic toy-play interaction as learning materials and investigated how visual and linguistic information provided in individual naming moments as well as cross-situational information provided from multiple learning moments can help learners resolve this mapping problem using the Human Simulation Paradigm. Our results show that learners benefit from seeing children’s egocentric views compared to third-person observations. In addition, linguistic information can help learners identify the correct verb meaning by eliminating possible meanings that do not belong to the linguistic category. Learners are also able to integrate visual and linguistic information both within and across learning situations to reduce the ambiguity in the space of possible verb meanings. © Cognitive Science Society: Comparative Cognition: Animal Minds, CogSci *** rights reserved.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Multiomics Reveals Induction of Neuroblastoma SK-N-BE(2)C Cell Death by Mitochondrial Division Inhibitor 1 through Multiple Effects

引用

Journal of Proteome Research 2024年第1期23卷 301-315页

作者： Wang, Wei-Hsuan Kao, Yi-Chun Hsieh, Chiao-Hui Tsai, Shin-Yu Cheung, Chantal Hoi Yin Huang, Hsuan-Cheng Juan, Hsueh-Fen Genome and Systems Biology Degree Program Academia Sinica and National Taiwan University Taipei 106 Taiwan Department of Life Science National Taiwan University Taipei 106 Taiwan Center for Computational and Systems Biology National Taiwan University Taipei 106 Taiwan Institute of Biomedical Informatics National Yang Ming Chiao Tung University Taipei 112 Taiwan Graduate Institute of Biomedical Electronics and Bioinformatics National Taiwan University Taipei 106 Taiwan Center for Advanced Computing and Imaging in Biomedicine National Taiwan University Taipei 106 Taiwan

Mitochondrial division inhibitor 1 (Mdivi-1) is a well-known synthetic compound aimed at inhibiting dynamin-related protein 1 (Drp1) to suppress mitochondrial fission, making it a valuable tool for studying mitochondrial dynamics. However, its specific effects beyond Drp1 inhibition remain to be confirmed. In this study, we employed integrative proteomics and phosphoproteomics to delve into the molecular responses induced by Mdivi-1 in SK-N-BE(2)C cells. A total of 3070 proteins and 1945 phosphorylation sites were identified, with 880 of them represented as phosphoproteins. Among these, 266 proteins and 97 phosphorylation sites were found to be sensitive to the Mdivi-1 treatment. Functional enrichment analysis unveiled their involvement in serine biosynthesis and extrinsic apoptotic signaling pathways. Through targeted metabolomics, we observed that Mdivi-1 enhanced intracellular serine biosynthesis while reducing the production of C24:1-ceramide. Within these regulated phosphoproteins, dynamic dephosphorylation of proteasome subunit alpha type 3 serine 250 (PSMA3-S250) occurred after Mdivi-1 treatment. Further site-directed mutagenesis experiments revealed that the dephosphorylation-deficient mutant PSMA3-S250A exhibited a decreased cell survival. This research confirms that Mdivi-1’s inhibition of mitochondrial division leads to various side effects, ultimately influencing cell survival, rather than solely targeting Drp1 inhibition. © 2023 American Chemical Society.

关键词： Mdivi-1 multiomics neuroblastoma phosphoproteome proteome targeted metabolome

来源：评论

学校读者我要写书评

暂无评论

Classification Based on Texture Analysis for Synthetic Hazy Image from Mount Kelud Haze Image Density

Classification Based on Texture Analysis for Synthetic Hazy ...

引用

International Conference on Electrical, Electronics and Information Engineering (ICEEIE)

作者： Fresy Nugroho Puspa Miladin Safitri A. Basid Yunifa Miftachul Arif Norizan Mat Diah Firma Sahrul Bahtiar Hani Nurhayati Fachrul Kurniawan Nurizal Dwi Priandani Dodik Arwin Dermawan Informatics Engineering Faculty of Science and Technology Universitas Islam Negeri Maulana Malik Ibrahim Malang Indonesia School of Computing Sciences College of Computing Informatics and Media Universiti Teknologi MARA Shah Alam Malaysia Faculty of Science and Technology Library and Information Science Universitas Islam Negeri Maulana Malik Ibrahim Malang Indonesia Manajemen Informatika Program Vokasi Universitas Negeri Surabaya Surabaya Indonesia

This paper classifies the simulations of homogeneous synthetic images, heterogeneous synthetic hazy images, and original hazy images taken from CCTV (Close Circuit Television) of Mt. Kelud crater using the GLCM (Gray Level Co-Occurrence Matrix) method. The average feature values obtained using the GLCM (Gray Level Co-Occurrence Matrix) method are used to compare the similarity of gray feature values of the three and then classify thin, medium, and thick images. The results for classifying thin haze, medium haze, and thick haze on the homogeneous synthetic hazy image test data obtained an accuracy value of 50%, a precision value of 46%, and a sensitivity value of 65%. As for the classification of thin, medium, and thick fog on heterogeneous synthetic hazy images, test data obtained an accuracy value of 42%, a precision value of 32%, and a sensitivity value of 48%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Investigating the Predictive Performance of Gaussian Process Machine Learning in Time Series Demographic Data Handling

Investigating the Predictive Performance of Gaussian Process...

引用

International Conference on Computer and Automation Engineering, ICCAE

作者： Shalini Nagaratnam Muhammad Naeim Mohd Aris Nuralea Natasya Amir Hamdan Department of Econometrics and Business Statistics School of Business Monash University Malaysia Bandar Sunway Malaysia Department of American Degree Transfer Program School of American Education Sunway University Bandar Sunway Malaysia College of Computing Informatics and Mathematics Universiti Teknologi MARA Malaysia

ISBN: (数字)9798350370058

ISBN: (纸本)9798350370164

Effective handling and modelling of time series data play a crucial role in enhancing the quality of derived information during the research process which includes addressing missing values. Meticulous attention to these data-related tasks is paramount, as the outcomes of the research are directly influenced by the quality and integrity of the processed data. This study employs a non-parametric Gaussian Process Regression (GPR) prediction algorithm in machine learning to investigate the predictive performance of Malaysian demographic data for 1960 to 2021. For robust results, the traditional parametric models were introduced for comparison. The reliability and efficiency of the algorithm are presented. The results show that the GPR with squared exponential covariance function can give the most accurate prediction on the data based on the low mean absolute deviation (MAD) and root mean squared error values (RMSE).

关键词： Interpolation Machine learning algorithms Computational modeling Biological system modeling Time series analysis Urban areas Gaussian processes

来源：评论

学校读者我要写书评

暂无评论

Partial entropy decomposition reveals higher-order structures in human brain activity

arXiv

引用

arXiv 2023年

作者： Varley, Thomas F. Pope, Maria Puxeddu, Maria Grazia Faskowitz, Joshua Sporns, Olaf Department of Psychological and Brain Sciences Indiana University BloomingtonIN47405 United States School of Informatics Computing & Engineering Indiana University BloomingtonIN47405 United States Program in Neuroscience Indiana University BloomingtonIN47405 United States

The standard approach to modeling the human brain as a complex system is with a network, where the basic unit of interaction is a pairwise link between two brain regions. While powerful, this approach is limited by the inability to assess higher-order interactions involving three or more elements directly. In this work, we present a method for capturing higher-order dependencies in discrete data based on partial entropy decomposition (PED). Our approach decomposes the joint entropy of the whole system into a set of strictly non-negative partial entropy atoms that describe the redundant, unique, and synergistic interactions that compose the system's structure. We begin by showing how the PED can provide insights into the mathematical structure of both the FC network itself, as well as established measures of higher-order dependency such as the O-information. When applied to resting state fMRI data, we find robust evidence of higher-order synergies that are largely invisible to standard functional connectivity analyses. This synergistic structure is symmetrical across hemispheres, largely conserved across individual subjects, and is distinct from structural features based on redundancy that have previously dominated FC analyses. Our approach can also be localized in time, allowing a frame-by-frame analysis of how the distributions of redundancies and synergies change over the course of a recording. We find that different ensembles of regions can transiently change from being redundancy-dominated to synergy-dominated, and that the temporal pattern is structured in time. These results provide strong evidence that there exists a large space of unexplored structures in human brain data that have been largely missed by a focus on bivariate network connectivity models. This synergistic "shadow structures" is dynamic in time and, likely will illuminate new and interesting links between brain and behavior. Beyond brain-specific application, the PED provides a very general app

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

2D Basement Relief Inversion using Sparse Regularization.

arXiv

引用

arXiv 2024年

作者： Barboza, Francisco Márcio da Cunha Romão Silva, E. Arthur Anthony de Carvalho, Bruno Motta Department of Computing and Technology Federal University of Rio Grande do Norte Rio Grande do Norte Caicó Brazil Graduate Program on Systems and Computing Federal University of Rio Grande do Norte Rio Grande do Norte Natal Brazil Department of Informatics and Applied Mathematics Federal University of Rio Grande do Norte Rio Grande do Norte Natal Brazil

Basement relief gravimetry is a key application in geophysics, particularly important for oil exploration and mineral prospecting. It involves solving an inverse geophysical problem, where the parameters of a geological model are inferred from observed data. In this context, the geological model consists of the depths of constant-density prisms representing the basement relief, and the data correspond to the gravitational anomalies caused by these prisms. Inverse geophysical problems are typically ill-posed, as defined by Hadamard, meaning that small perturbations in the data can result in large variations in the solutions. To address this instability, regularization techniques, such as those proposed by Tikhonov, are employed to stabilize the solutions. This study presents a comparative analysis of various regularization techniques applied to the gravimetric inversion problem, including Smoothness Constraints, Total Variation, the Discrete Cosine Transform (DCT), and the Discrete Wavelet Transform (DWT) using Daubechies D4 wavelets. Optimization methods are commonly used in inverse geophysical problems because of their ability to find optimal parameters that minimize the objective function—in this case, the depths of the prisms that best explain the observed gravitational anomalies. The Genetic Algorithm (GA) was selected as the optimization technique. GA is based on Darwinian evolutionary theory, specifically the principle of natural selection, where the fittest individuals in a population are selected to pass on their traits. In optimization, this translates to selecting solutions that most effectively minimize the objective function. The results, evaluated using fit metrics and cumulative error analysis, demonstrate the effectiveness of all the regularization techniques and the Genetic Algorithm. Among the methods tested, the Smoothness constraint was briefly the most effective for the first and second synthetic models. For the third model, which was based on re

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Maternal Health Risk Classification - A Comparison between Algorithm Decision Tree and k-Nearest Neighbor (kNN)

Maternal Health Risk Classification - A Comparison between A...

引用

Sustainable Emerging Innovations in Engineering and Technology (ICSEIET), International Conference on

作者： Maylia Fatmawati Mega Novita Nugroho Dwi Saputro Alok Singh Chauhan Noora Qotrun Nada Amit Sinha Bambang Agus Herlambang Shruti Gupta Department of Informatics Faculty of Engineering and Informatics Universitas PGRI Semarang Semarang Indonesia Postgraduate Program of Science Education Universitas PGRI Semarang Semarang Indonesia School of Computing Science & Engineering Galgotias University Greater Noida India Department of Computer Science & Engineering ABES Engineering College Ghaziabad Uttar Pradesh India

Maternal health is a critical concern, particularly for individuals who are pregnant and will shape the future generations. However, not all expectant mothers receive tailored attention and care for their unique health needs. Consequently, many mothers face high levels of health risks during pregnancy, highlighting the importance of classifying maternal health risks. Classification can help identify influential factors affecting maternal health and predict risk levels for individual mothers. In the field of data mining, various classification methods exist for analyzing complex datasets. This study focuses on two widely used algorithms: decision tree and k-Nearest Neighbor (kNN). By employing these algorithms, we aim to classify a dataset comprising 1,014 records of maternal health risk levels. Through cross-validation and T-tests, we rigorously evaluate the performance of the decision tree and kNN algorithms in this context. Our findings indicate that the kNN algorithm is more suitable for classifying maternal health risks, achieving a significantly higher accuracy of 71.50% compared to the decision tree algorithm's accuracy of 70.71%. This result establishes the superiority of the kNN algorithm in accurately classifying maternal health risks. These findings have implications for developing targeted interventions and tailored healthcare strategies to mitigate identified risks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming Algorithm using Furniture Industry 0/1 Knapsack Problem 5

Dynamic Programming Algorithm using Furniture Industry 0/1 K...

引用

5th International Conference on Cybernetics and Intelligent Systems, ICORIS 2023

作者： Anditta, Mietha Amartya, Natashya Warnars, Laurens Spits Warnars, Harco Leslie Hendric Spits Ramadhan, Arief Siswanto, Teddy Mantoro, Teddy Noordin, Nurulhuda Bina Nusantara University School of Computer Science Computer Science Departement Jakarta11530 Indonesia Bina Nusantara University School of Information Systems Information Systems Departement Jakarta11530 Indonesia Bina Nusantara University Binus Graduate Program - Computer Science Computer Science Departement Jakarta11530 Indonesia Telkom University Pjj Informatika Bandung40257 Indonesia Trisakti University Information Systems Department Jakarta11440 Indonesia Sampoerna University Faculty of Engineering and Technology Jakarta12760 Indonesia Universiti Teknologi Mara School of Computing Sciences College of Computing Informatics and Mathematics Selangor Malaysia

ISBN: (纸本)9798350369489

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset. © 2023 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

GPU Acceleration of MIP Intra Prediction in VVC

GPU Acceleration of MIP Intra Prediction in VVC

引用

European Signal Processing Conference (EUSIPCO)

作者： Iago Storch Nuno Roma Daniel Palomino Sergio Bampi Graduate Program in Computing Institute of Informatics Federal University of Rio Grande do Sul Porto Alegre Brazil Instituto de Engenharia de Sistemas e Computadores - Investigação e Desenvolvimento (INESC-ID) Lisboa Portugal Instituto Superior Técnico Universidade de Lisboa Lisboa Portugal Federal University of Pelotas Graduate Program in Computing Video Technology Research Group Pelotas Brazil

The Versatile Video Coding (VVC) standard introduced several novel encoding tools for intra frame prediction, increasing the encoder complexity when compared to previous standards. Among these novelties is the MIP tool, whose acceleration has not been tackled in the literature. Therefore, an efficient parallelization of MIP prediction targeting GPU platforms is now proposed. The presented technique makes use of alternative reference samples and computes the distortion in an approximate manner to expose and potentiate massive parallelism. Moreover, the adopted prediction scheduling and memory communication were tailored by considering the GPUs' architecture and memory hierarchy. When compared with a CPU execution, this work is capable to accelerate the MIP prediction up to 105 times at the cost of a negligible coding efficiency loss of 0.284 % BD-BR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fitness-Based Migration Policy for Biased Random-Key Genetic Algorithms 26th

A Fitness-Based Migration Policy for Biased Random-Key Gene...

引用

26th International Conference on Applications of Evolutionary Computation, EvoApplications 2023, held as part of EvoStar 2023

作者： Boiani, Mateus Parpinelli, Rafael Stubs Dorn, Márcio Institute of Informatics Federal University of Rio Grande do Sul Rio Grande do Sul Porto Alegre Brazil Graduate Program in Applied Computing Santa Catarina State University Santa Catarina Joinville Brazil Center for Biotechnology Federal University of Rio Grande do Sul Rio Grande do Sul Porto Alegre Brazil National Institute of Science and Technology - Forensic Science Rio Grande do Sul Porto Alegre Brazil

ISBN: (纸本)9783031302282

Population diversity management is crucial for the quality of solutions in Evolutionary Algorithms. Many techniques require assistance to handle diverse problem characteristics and may prematurely converge in local optima. Maintaining diversity enables the algorithm to search the space and produce better results effectively. Parallel models are a common approach to preserving diversity;however, design decisions affect optimization process characteristics. For example, the Island model’s migration policy affects convergence speed. This study proposes and evaluates a fitness-based migration policy for the Biased Random-Key Genetic Algorithm (BRKGA) and compares it to two traditional strategies. The results in continuous search spaces demonstrate that the proposed policy can enhance BRKGA optimization with appropriate parameters. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：