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

Effect of channel thickness on the particle diffusion and permeability of carbon nanotubes a membrane in reverse electrodialysis process using molecular dynamics simulation

引用

International Communications in Heat and Mass Transfer 2025年 166卷

作者： Shuai Sun Ali Basem Narinderjit Singh Sawaran Singh Younis Mohamed Atiah Al-zahy Salman Saeidlou Khursheed Muzammil Soheil Salahshour S. Mohammad Sajadi Hani Sahramaneshi School of Energy and Constructional Engineering Shandong Huayu University of Technology Dezhou Shandong 253034 China Faculty of Engineering DongShin University Naju-si Jeollanam-do 58245 South Korea Faculty of Engineering Warith Al-Anbiyaa University Karbala 56001 Iraq Faculty of Data Science and Information Technology INTI International University Persiaran Perdana BBN Putra Nilai Nilai 71800 Malaysia Department of Physics College of Education Misan University Maysan Iraq School of Engineering Technology and Design Canterbury Christ Church University Kent UK Department of Public Health College of Applied Medical Sciences Khamis Mushait Campus King Khalid University Abha 62561 Saudi Arabia Faculty of Engineering and Natural Sciences Istanbul Okan University Istanbul Turkey Faculty of Engineering and Natural Sciences Bahcesehir University Istanbul Turkey Research Center of Applied Mathematics Khazar University Baku Azerbaijan Department of Chemistry Payam e Noor University Saqqez Branch Saqqez Kurdistan Iran Fast Computing Center Shabihsazan Ati Pars Tehran Iran

Adopting innovative technology and solutions is critical for ensuring clean water. Several methods may be used to remove salts from water. They may be divided into two categories: membranes and heat. Reverse electrodialysis, which uses a membrane, is an efficient way of separating substances. Prior research investigated system-level factors, but the nanoscale mechanisms that drive ion and water penetration across membranes were poorly understood. This study closed a research gap by investigating the influence of carbon nanotube membrane thickness on particle mobility and fluid dynamics in reverse electrodialysis systems. The research is contributed to the enhancement of energy conversion efficiency and membrane performance in reverse electrodialysis systems by offering a comprehensive understanding of the influence of channel thickness on particle transport and selectivity through the carbon nanotube membrane. Molecular dynamics simulations using the LAMMPS software package are conducted to examine the effect of carbon nanotube thickness variation (1-layer vs 2-layer) on fluid flow, ionic current, hydrogen bonding, and fluid density. To the findings, increasing the thickness of a carbon nanotube from one layer to two layers decreases the fluid flow rate to 203.79 atoms/ns and the current from 5.31 e/ns to 5.15 e/ns. Additionally, the number of broken hydrogen bonds decreases from 116 to 105, indicating decreased permeability and increased stability of the hydrogen-bonding network. In addition to offering useful information for the construction of more effective and selective membranes in renewable energy applications, these results provided a molecular understanding of how carbon nanotube thickness affected reverse electrodialysis effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for total variation image denoising

引用

Paper Asia 2018年第4期COMPENDIUM VOL. 1卷 6-10页

作者： Jie-Bin, Huang Chen-Liang, Li Gui-Bing, Fang School of Mathematics and Computing Science Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation Guilin University of Electronic Technology GuilinGuangxi541004 China

A TV image denoising model is transformed into a two-side obstacle variational inequality problem under considering the grayscale range of the image, then some new methods are presented to solve the variational inequality problems. The numerical results show that the new methods are efficient under some suitable parameter. © 2018, SHPMedia Sdn Bhd. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

The verified CakeML compiler backend

引用

Journal of Functional Programming 2019年

作者： Tan, Yong Kiam Myreen, Magnus O. Kumar, Ramana Fox, Anthony Owens, Scott Norrish, Michael Computer Science Department Carnegie Mellon University Pittsburgh PA 15213 United States CSE Chalmers University of Technology Gothenburg 412 96 Sweden Data61 CSIRO / CSE University of New South Wales Kensington NSW 2033 Australia Department of Computer Science and Technology University of Cambridge Cambridge CB3 0FD United Kingdom School of Computing University of Kent Canterbury CT2 7NF United Kingdom Data61 CSIRO Research School of Computer Science Australian National University Canberra ACT 2600 Australia

The CakeML compiler is, to the best of our knowledge, the most realistic verified compiler for a functional programming language to date. The architecture of the compiler, a sequence of intermediate languages through which high-level features are compiled away incrementally, enables verification of each compilation pass at an appropriate level of semantic detail. Parts of the compiler's implementation resemble mainstream (unverified) compilers for strict functional languages, and it supports several important features and optimisations. These include efficient curried multi-argument functions, configurable data representations, efficient exceptions, register allocation, and more. The compiler produces machine code for five architectures: x86-64, ARMv6, ARMv8, MIPS-64, and RISC-V. The generated machine code contains the verified runtime system which includes a verified generational copying garbage collector and a verified arbitrary precision arithmetic (bignum) library. In this paper, we present the overall design of the compiler backend, including its 12 intermediate languages. We explain how the semantics and proofs fit together and provide detail on how the compiler has been bootstrapped inside the logic of a theorem prover. The entire development has been carried out within the HOL4 theorem prover. © 2019 Cambridge University Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Context Based Classification of Twitter 4

Comparative Analysis of Context Based Classification of Twit...

引用

4th International Conference on Advances in computing, Communication and Automation, ICACCA 2018

作者： Tiwana, Muhammad Salman Javeed, Farooq Lali, Muhammad Ikramullah Dar, Hafsa Bilal, Muhammad Dept. of CS and IT University of Sargodha Sargodha Pakistan Dept. of Computer Science University of Gujrat Gujrat Pakistan Dept. of Software Engineering University of Gujrat Gujrat Pakistan School of Computing and IT Taylor's University Subang Jaya Malaysia Centre for Data Science and Analytics Taylor's University Subang Jaya Malaysia

ISBN: (纸本)9781538671672

Social media offers online data source where internet users' share their opinions, views and discuss any news or events that happen around the world. Twitter is a popular social media which effectively takes part in any mega event and is used before, during and after live events. Some tweets become trend based on their popularity. The trending tweets are classified by twitter into categories like: Sports (S), Entertainment (E), Politics (P), and Technology (T) which are used in our work. We have used context based meanings to further improve the trending tweet classification results. In this article, we have verified the twitter's automated classification results with manual classification by experts. Furthermore, we compared the classification results with SVM, Linear Regression, Logistic Regression and Naive Bayes implemented in Weka tool. We found that twitter's classifier works with almost 89% accuracy in our dataset. This work would contribute in improving misclassification of data of different categories on social media. © 2018 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Planar median graphs and cubesquare-graphs

arXiv

引用

arXiv 2021年

作者： Seemann, Carsten R. Moulton, Vincent Stadler, Peter F. Hellmuth, Marc Max Planck Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Bioinformatics Group Department of Computer Science Interdisciplinary Center for Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany School of Computing Sciences University of East Anglia NorwichNR4 7TJ United Kingdom Halle-Jena-Leipzig Competence Center for Scalable Data Services and Solutions Dresden-Leipzig Leipzig Germany Research Center for Civilization Diseases Centre for Biotechnology and Biomedicine Leipzig University Härtelstraße 16-18 LeipzigD-04107 Germany Institute for Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Facultad de Ciencias Universidad Nacional de Colombia Sede Bogotá Colombia The Santa Fe Institute 1399 Hyde Park Rd. Santa FeNM87501 United States Department of Mathematics Faculty of Science Stockholm University StockholmSE - 106 91 Sweden

Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph G is a median graph in terms of forbidden subgraphs and the structure of isometric cycles in G, and also in terms of subgraphs of G that are contained inside and outside of 4-cycles with respect to an arbitrary planar embedding of G. These results lead us to a new characterization of planar median graphs in terms of cubesquare-graphs that is, graphs that can be obtained by starting with cubes and square graphs, and iteratively replacing 4-cycle boundaries (relative to some embedding) by cubes or square-graphs. As a corollary we also show that a graph is planar median if and only if it can be obtained from cubes and square-graphs by a sequence of "square-boundary" amalgamations. These considerations also lead to an O(n log n)-time recognition algorithm to compute a decomposition of a planar median graph with n vertices into cubes and square-graphs. Copyright © 2021, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Oscillatory evolution of collective behavior in evolutionary games played with reinforcement learning

arXiv

引用

arXiv 2019年

作者： Zhang, Si-Ping Zhang, Ji-Qiang Chen, Li Liu, Xu-Dong Key Laboratory of Biomedical Information Engineering Ministry of Education Key Laboratory of Neuro-informatics & Rehabilitation Engineering Ministry of Civil Affairs Institute of Health and Rehabilitation Science School of Life Science and Technology Xi'an Jiaotong University Xi'an710049 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China School of Physics and Information Technology Shaanxi Normal University Xi'an710062 China

Large-scale cooperation underpins the evolution of ecosystems and the human society, and the collective behaviors by self-organization of multi-agent systems are the key for understanding. As artificial intelligence (AI) prevails in almost all branches of science, it would be of great interest to see what new insights of collective behavior could be obtained from a multi-agent AI system. Here, we introduce a typical reinforcement learning (RL) algorithm - Q learning into evolutionary game dynamics, where agents pursue optimal action on the basis of the introspectiveness rather than the birth-death or imitation processes in the traditional evolutionary game (EG). We investigate the cooperation prevalence numerically for a general 2 × 2 game setting. We find that the cooperation prevalence in the multi-agent AI is amazingly of equal level as in the traditional EG in most cases. However, in the snowdrift games with RL we also reveal that explosive cooperation appears in the form of periodic oscillation, and we study the impact of the payoff structure on its emergence. Finally, we show that the periodic oscillation can also be observed in some other EGs with the RL algorithm, such as the rock-paper-scissors game. Our results offer a reference point to understand emergence of cooperation and oscillatory behaviors in nature and society from AI's perspective. Copyright © 2019, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Template bank for compact binary mergers in the fourth observing run of Advanced LIGO, Advanced Virgo, and KAGRA

arXiv

引用

arXiv 2022年

作者： Sakon, Shio Tsukada, Leo Fong, Heather Kennington, James Niu, Wanting Hanna, Chad Adhicary, Shomik Baral, Pratyusava Baylor, Amanda Cannon, Kipp Caudill, Sarah Cousins, Bryce Creighton, Jolien D.E. Ewing, Becca George, Richard N. Godwin, Patrick Harada, Reiko Huang, Yun-Jing Huxford, Rachael Joshi, Prathamesh Kuwahara, Soichiro Li, Alvin K.Y. Magee, Ryan Meacher, Duncan Messick, Cody Morisaki, Soichiro Mukherjee, Debnandini Pace, Alex Posnansky, Cort Ray, Anarya Sachdev, Surabhi Singh, Divya Tapia, Ron Tsutsui, Takuya Ueno, Koh Viets, Aaron Wade, Leslie Wade, Madeline Wang, Jonathan Department of Physics The Pennsylvania State University University ParkPA16802 United States Institute for Gravitation and the Cosmos The Pennsylvania State University University ParkPA16802 United States Department of Physics and Astronomy University of British Columbia VancouverBCV6T 1Z4 Canada RESCEU The University of Tokyo Tokyo113-0033 Japan Graduate School of Science The University of Tokyo Tokyo113-0033 Japan Department of Astronomy and Astrophysics The Pennsylvania State University University ParkPA16802 United States Institute for Computational and Data Sciences The Pennsylvania State University University ParkPA16802 United States Leonard E. Parker Center for Gravitation Cosmology and Astrophysics University of Wisconsin-Milwaukee MilwaukeeWI53201 United States Department of Physics University of Massachusetts DartmouthMA02747 United States Center for Scientific Computing and Data Science Research University of Massachusetts DartmouthMA02747 United States Department of Physics University of Illinois UrbanaIL61801 United States Center for Gravitational Physics University of Texas at Austin AustinTX78712 United States LIGO Laboratory California Institute of Technology PasadenaCA91125 United States MIT Kavli Institute for Astrophysics and Space Research Massachusetts Institute of Technology CambridgeMA02139 United States Institute for Cosmic Ray Research The University of Tokyo 5-1-5 Kashiwanoha Chiba Kashiwa277-8582 Japan NASA Marshall Space Flight Center HuntsvilleAL35811 United States Center for Space Plasma and Aeronomic Research University of Alabama in Huntsville HuntsvilleAL35899 United States School of Physics Georgia Institute of Technology AtlantaGA30332 United States Concordia University Wisconsin MequonWI53097 United States Department of Physics Hayes Hall Kenyon College GambierOH43022 United States Department of Physics University of Michigan Ann ArborMI48109 United States

Matched-filtering gravitational wave search pipelines identify gravitational wave signals by computing correlations, i.e., signal-to-noise ratios, between gravitational wave detector data and gravitational wave template waveforms. Intrinsic parameters, the component masses and spins, of the gravitational wave waveforms are often stored in "template banks", and the construction of a densely populated template bank is essential for some gravitational wave search pipelines. This paper presents a template bank that is currently being used by the GstLAL-based compact binary search pipeline in the fourth observing run of the LIGO, Virgo, and KAGRA collaboration, and was generated with a new binary tree approach of placing templates, manifold. The template bank contains 1.8×106 sets of template parameters covering plausible neutron star and black hole systems up to a total mass of 400 Mo with component masses between 1-200 Mo and mass ratios between 1 and 20 under the assumption that each component object’s angular momentum is aligned with the orbital angular momentum. We validate the template bank generated with our new method, manifold, by comparing it with a template bank generated with the previously used stochastic template placement method. We show that both template banks have similar effectualness. The GstLAL search pipeline performs singular value decomposition (SVD) on the template banks to reduce the number of filters used. We describe a new grouping of waveforms that improves the computational efficiency of SVD by nearly 5 times as compared to previously reported SVD sorting schemes. Copyright © 2022, The Authors. All rights reserved.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Apnea detection with microbend fiber-optic sensor

Apnea detection with microbend fiber-optic sensor

引用

Chinese Intelligent Systems Conference, CISC 2017

作者： Liu, Li Ye, Tingfeng Guo, Xuemei Kong, Ruixun Bo, Lei Wang, Guoli School of Electronics and Information Technology Sun Yat-sen University Guangzhou510006 China School of Data and Computer Science Sun Yat-sen University Guangzhou510006 China Vkan Certification & Testing Co. Ltd Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9789811064982

As a common chronic disease, sleep apnea syndrome (SAS) seriously threatens patients’ health, so it is imperative to find an effective way of apnea detection. In this paper, we present a new method that explores of using the high sensitivity characteristic of the micro-bending effect of the gradient multimode fiber to detect human breathing movement, and thereby collecting the respiratory signals. With characterizing central apnea, 8 different features in time-domain and frequency-domain are extracted from the respiratory signals, which are used to train the classifiers. In the feature modeling, we present a peak calculation method based on moving average curve (MAC) to increase the accuracy of estimating the respiratory frequency and amplitude. In our experimental studies, the forward sequence selection method (SFS) is employed to combine these features for training SVM classifier, and our approach can reach an accuracy rate of 94.6% in apnea discrimination. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Frequency estimation

来源：评论

学校读者我要写书评

暂无评论

User Heterogeneity and Individualized Recommender

引用

Chinese Physics Letters 2017年第6期34卷 135-138页

作者：王庆先张君杰史晓雨尚明生 School of Information and Software Engineering University of Electronic Science and Technology of China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of Sciences

Previous works on personalized recommendation mostly emphasize modeling peoples＇ diversity in potential fa- vorites into a uniform recommender. However, these recommenders always ignore the heterogeneity of users at an individual level. In this study, we propose an individualized recommender that can satisfy every user with a customized parameter. Experimental results on four benchmark datasets demonstrate that the individualized recommender can significantly improve the accuracy of recommendation. The work highlights the importance of the user heterogeneity in recommender design.

关键词： User Heterogeneity and Individualized Recommender

来源：评论

学校读者我要写书评

暂无评论

Exploiting Box Expansion and Grid Partitioning for Parallel FPGA Routing

Exploiting Box Expansion and Grid Partitioning for Parallel ...

引用

Annual IEEE Symposium on Field-Programmable Custom computing Machines (FCCM)

作者： Minghua Shen Guojie Luo Nong Xiao School of Data and Computer Science Sun Yat-sen University China Center for Energy-efficient Computing and Applications Peking University China

FPGA is reconfigurable architecture able to implement a good trade-off in terms of energy, performance, and flexibility. However, the main drawback in using FPGAs is their very long routing time. Multi-core processors are now ubiquitous, making parallelism an increasingly attractive direction to accelerate the routing time. In this paper, we propose a task-level distributed parallel router that exploits conflict-aware box expansion and equal-sized grid partitioning for parallel FPGA routing. In box expansion, we adopt net bounding box to limit the search space of routing and based on current congestion state among nets, we design conflict-aware box expansion to optimize the serial routing time and provide more non-conflicting nets to obtain significant parallelism. In grid partitioning, we employ equal-sized grid to partition the overall routing region, where the nets in same grid are routed in serial and the grids are processed in parallel. Specifically, the nets distributed in multiple grids can be used to balance the workloads among processor cores. Experiments show that the parallel implementation scales to an average speedup of about 21 × using 32 processor cores compared to state-of-the-art VPR router.

关键词： Routing Field programmable gate arrays Parallel processing Task analysis Servers Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：