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

Innovative Research in Applied Science, engineering and Technology (IRASET),Conference on

作者： Abdelkarim Ou-khouya Hassane Mes-adi Meryem Taoufiki Imane Ait Ibrahim Amin El Harfouf Rachid Herbazi Mohamed Tahiri Process Engineering Computer Science and Mathematics Laboratory Khouribga National School of Applied Sciences Sultan Moulay Slimane University Khouribga Morocco Faculty of Sciences and Techniques Sustainable Development Laboratory Sultan Moulay Slimane University Beni-Mellal Morocco Departement of Physics Laboratory of Condensed Matter and interdisciplinary Sciences CNRST Labeled Research Unit Faculty of Sciences Mohamed V University Rabat Morocco Department of Physics Polydisciplinary Faculty of Khouribga University of Sultan Moulay Slimane Khouribga Morocco Intelligent Systems and Applications Laboratory (LSIA) EMSI Tangier Morocco

ISBN: (数字)9798350309508

ISBN: (纸本)9798350309515

In this study, we investigate the mechanical properties of gold (Au) materials using molecular dynamics simulations. In this simulation, the nanoindentation process was performed to analyze the deformation defects and hardness properties of Au under different indentation velocities. The results suggest that the deformation behavior of the Au specimen was affected by different indentation velocities. These findings were confirmed by examining the load-displacement curve, which indicated elastic deformation through the appearance of a linear load-displacement relationship at low indentation velocities. In contrast, plastic deformation was identified by the presence of intensified serrations in the load-displacement curve at higher indentation velocities. Under such conditions, the hardness exhibited minimal variation when the indenter velocity increased from 5 mls to 10 mls. However, a significant increase in hardness was noted when the indentation velocity was further raised to 15 mls.

关键词： Deformable models Gold Analytical models Deformation Dynamics Plastics Load modeling

来源：评论

学校读者我要写书评

暂无评论

Edible aquatic robots with Marangoni propulsion

引用

Nature Communications 2025年第1期16卷 1-9页

作者： Zhang, Shuhang Kwak, Bokeon Zhu, Ruihao Pankhurst, Markéta Zhang, Lu Boom, Remko M. Floreano, Dario Laboratory of Intelligent Systems School of Engineering École Polytechnique Fédérale de Lausanne STI-IGM-LIS Lausanne Switzerland Laboratory of Food Process Engineering Wageningen University and Research Wageningen Netherlands

Centimeter-scale aquatic robots could be used in environmental monitoring, exploration, and intervention in aquatic environments. However, existing robots rely on artificial polymers and commercial electronic components, which can pollute and disrupt sensitive ecological environments if they are not retrieved. To address these challenges, we describe a fully biodegradable and fully edible self-propelled device that leverages the Marangoni effect for autonomous propulsion. The body of the edible aquatic robot is made of freeze-dried fish food and is powered by a water-triggered pneumatic reaction that produces motion by sustained release of a surfactant that is safe for aquatic fauna. The device’s biodegradable and non-toxic composition allows for safe environmental deployment for environmental sensing, delivery of nutrition or medication in aquatic environments. The proposed method substantially expands the potential benefits of small-scale aquatic robots that could be deployed on a large scale without the need to retrieve them and even provide nutrition to wildlife at the end of their lifetime as animals do. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks

arXiv

引用

arXiv 2024年

作者： Liu, Yi Tang, Xiaoan Pedrycz, Witold Zhang, Qiang The Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education The School of Management Hefei University of Technology Hefei Box 270 Anhui Hefei230009 China The Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada The Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Istinye University Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer Istanbul Turkey

Various types of promising techniques have come into being for influence maximization whose aim is to identify influential nodes in complex networks. In essence, real-world applications usually have high requirements on the balance between time complexity and accuracy of influential nodes identification. To address the challenges of imperfect node influence measurement and inefficient seed nodes selection mechanism in such class of foregoing techniques, this article proposes a novel approach called Cost-Effective Community-Hierarchy-Based Mutual Voting for influence maximization in complex networks. First, we develop a method for measuring the importance of different nodes in networks based on an original concept of Dual-Scale Community-Hierarchy Information that synthesizes both hierarchy structural information and community structural information of nodes. The community structural information contained in the nodes is measured by a new notion of Hierarchical-Community Entropy. Second, we develop a method named Cost-Effective Mutual-Influence-based Voting for seed nodes selection. Hereinto, a low-computational-cost mutual voting mechanism and an updating strategy called Lazy Score Updating Strategy are newly constructed for optimizing the selecting of seed nodes. Third, we develop a balance index to evaluate the performance of different methods in striking the tradeoff between time complexity and the accuracy of influential nodes identification. Finally, we demonstrate the approach performance over ten public datasets. The extensive experiments show that the proposed approach outperforms 16 state-of-the-art techniques on the balance between time complexity and accuracy of influential nodes identification. Compared with the method with the second highest value of the balance index, our approach can be improved by at most 9.29%. Copyright © 2024, The Authors. All rights reserved.

关键词： Expectation maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimizing Carbon Emissions in Green Logistics for Time-Dependent Routing

SSRN

引用

SSRN 2024年

作者： Liu, Yiming Yu, Yang Roberto, Baldacci Tang, Jiafu Sun, Wei State Key Laboratory of Synthetic Automation for Process Industries Institute of Intelligent Data and Systems Engineering Northeastern University Shenyang110819 China Dalian University of Technology School of Economics and Management Liaoning Dalian116024 China Division of Engineering Management and Decision Sciences College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation P.O. Box 34110 Doha Qatar College of Management Science and Engineering Dongbei University of Finance and Economics Shahekou Dalian116026 China Business School Liaoning University Shenyang110316 China

This paper considers a green vehicle routing problem termed the time-dependent green vehicle routing problem with time windows (TDGVRPTW). The TDGVRPTW is an extension of the green vehicle routing problem with time windows in green logistics. It considers time-dependent vehicle speed and aims to minimize carbon emissions. Since the travel times and carbon emissions between locations depend on the departure time from the starting location, optimizing carbon emissions requires determining the optimal departure times from both the depot and customers. This paper presents a branch-price-and-cut (BPC) algorithm to solve the TDGVRPTW. The problem is formulated based on a set-partitioning model. To solve the pricing problem associated with the set-partitioning model, we first define backward non-dominated time-dependent arcs and optimal timed routes. We also introduce three types of routes, forward, backward, and patchwork optimal timed routes, and analyze their characteristics. Then, we introduce a method to adjust the times in backward and patchwork optimal timed routes from the latest to the earliest. We prove that this method guarantees correctness and effectively reduces complexity. We propose a bidirectional labeling algorithm to generate routes. The pricing problem employs state-of-the-art techniques, including limited memory subset row cuts (lm-SRCs), ng-route relaxation, and bucket graphs to enhance the algorithm’s efficiency. The BPC algorithm is tested on a set of instances derived from benchmark instances in the literature. The results demonstrate the effectiveness of the proposed algorithm in solving the TDGVRPTW. © 2024, The Authors. All rights reserved.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Towards edible drones for rescue missions: design and flight of nutritional wings

arXiv

引用

arXiv 2022年

作者： Kwak, Bokeon Shintake, Jun Zhang, Lu Floreano, Dario The Laboratory of Intelligent Systems School of Engineering Ecole Polytechnique Federale de Lausanne LausanneCH1015 Switzerland The Shintake Research Group School of Informatics and Engineering The University of Electro-Communications 1-5-1 Chofugaoka Chofu Tokyo182-8585 Japan Laboratory of Food Process Engineering Wageningen University and Research P.O. Box 17 Wageningen6700 AA Netherlands

Drones have shown to be useful aerial vehicles for unmanned transport missions such as food and medical supply delivery. This can be leveraged to deliver life-saving nutrition and medicine for people in emergency situations. However, commercial drones can generally only carry 10 % − 30 % of their own mass as payload, which limits the amount of food delivery in a single flight. One novel solution to noticeably increase the food-carrying ratio of a drone, is recreating some structures of a drone, such as the wings, with edible materials. We thus propose a drone, which is no longer only a food transporting aircraft, but itself is partially edible, increasing its food-carrying mass ratio to 50 %, owing to its edible wings. Furthermore, should the edible drone be left behind in the environment after performing its task in an emergency situation, it will be more biodegradable than its non-edible counterpart, leaving less waste in the environment. Here we describe the choice of materials and scalable design of edible wings, and validate the method in a flight-capable prototype that can provide 300 kcal and carry a payload of 80 g of water. © 2022, CC BY-NC-ND.

关键词： Nutrition

来源：评论

学校读者我要写书评

暂无评论

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

引用

Complex System Modeling and Simulation 2021年第3期1卷 198-217页

作者： Xue Han Yuyan Han Qingda Chen Junqing Li Hongyan Sang Yiping Liu Quanke Pan Yusuke Nojima the School of Computer Science Liaocheng UniversityLiaocheng 252000China the State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China the School of Information Science and Engineering Shandong Normal UniversityJinan 252000China the College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China the School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China the Department of Computer Science and Intelligent Systems Osaka Prefecture UniversityOsaka 599-8531Japan

To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing *** this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup *** solve DPFSPs,significant developments of some metaheuristic algorithms are *** this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in *** to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed *** compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.

关键词： distributed permutation flow shop iterated greedy local search swapping strategy

来源：评论

学校读者我要写书评

暂无评论

Co-Encapsulation of Hydrophilic and Hydrophobic Bioactives Stabilized in Nanostarch-Assisted Emulsion Gel as Inner Core of Coaxial 3d Printing

SSRN

引用

SSRN 2024年

作者： Niu, Ruihao Su, Jia Huang, Xiao Chen, Qihe Huang, Zhaojing Cheng, Huan Yin, Jun Zhou, Jianwei Xu, Enbo Liu, Donghong Zhao, Runan Hu, Haohao Yu, Xinyao College of Biosystems Engineering and Food Science National-Local Joint Engineering Laboratory of Intelligent Food Technology and Equipment Zhejiang Key Laboratory for Agro-Food Processing Integrated Research Base of Southern Fruit and Vegetable Preservation Technology Fuli Institute of Food Science Zhejiang University Hangzhou310058 China Ningbo Research Institute Zhejiang University Ningbo315100 China Innovation Center of Yangtze River Delta Zhejiang University Jiaxing314102 China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou310058 China Key Laboratory of 3D Printing Process and Equipment of Zhejiang Province School of Mechanical Engineering Zhejiang University Hangzhou310028 China Shanxi Normal University China Zhejiang University China

3D printing technology, especially coaxial 3D mode of multiple-component shaping, has great potential in the manufacture of personalized nutritional foods. However, the integration and stabilization of functional objectives different in nature is still a challenge for 3D customized foods. Here, we using starch nanoparticle (SNP) assisted soy protein (SPI) emulsion gel to load with the typical hydrophilic and hydrophobic bioactives (anthocyanin, AC, and curcumin, Cur, respectively). The addition of SNP significantly improved the storage stability of the emulsion. Xanthan gum (XG) was also added to the SNP/SPI system to enhance its rheology and form an emulsion gel as inner core of coaxial 3D printing. LF-NMR and emulsification analyses showed that AC/Cur@SNP/SPI/XG functional inner core had a strong water binding state and good stability. After printing with outer layer, the SNP/SPI coaxial sample had the lowest deviation rate of 0.8%. Also, SNP/SPI coaxial sample showed higher anthocyanin (90.2%) and curcumin (90.8%) retention compared to pure starch (S), pure SNP, pure SPI, and S/SPI samples as well as SNP/SPI sample printed without outer layer. In summary, this study provides a new perspective for the manufacture of customized products as multifunctional foods, feeds and even potential delivery of drugs. © 2024, The Authors. All rights reserved.

关键词： Anthocyanins

来源：评论

学校读者我要写书评

暂无评论

Topological Polymeric Glucosyl Nanoaggregates In Scaffold Enhance Piscine Myofiber Density and Orientation

SSRN

引用

SSRN 2024年

作者： Niu, Ruihao Xin, Qipu Lao, Jihui Huang, Xiao Chen, Qihe Yin, Jun Chen, Jun Liu, Donghong Xu, Enbo College of Biosystems Engineering and Food Science National-Local Joint Engineering Laboratory of Intelligent Food Technology and Equipment Zhejiang Key Laboratory for Agro-Food Processing Integrated Research Base of Southern Fruit and Vegetable Preservation Technology Fuli Institute of Food Science Zhejiang University Hangzhou310058 China College of Life Sciences Zhejiang University Hangzhou310058 China Key Laboratory of 3D Printing Process and Equipment of Zhejiang Province School of Mechanical Engineering Zhejiang University Hangzhou310028 China Innovation Center of Yangtze River Delta Zhejiang University Jiaxing314102 China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou310058 China MOE Key Laboratory of Biosystems Homeostasis & Protection Zhejiang University Hangzhou China Cancer Center Zhejiang University Hangzhou China

Upon the pressure of conventional land agriculture and marine environment facing the future of human beings, the emerging of alternative proteins represented by cultured meat is expected with a breakthrough of efficient, safe and sustainable production. However, the cell proliferation efficiency and final myofiber density in current animal-derived scaffolds are still limited. Here, we incorporated five plant-derived edible polymeric glucosyl nanoparticles (GNPs) into gelatin alginate hydrogels to form nanoaggregates with nanotopographies inside. The nano-scale topological morphology significantly enhances the adhesion and proliferation efficiencies of piscine satellite cells (PSCs) in the scaffold. Mechanically, the presence of GNP nanoaggregate increases the interaction between ITG-A1 (membrane protein of PSCs) and hydrogel microenvironment, which activates the focal adhesion-integrin-cytoskeleton mechanotransduction signaling to promote cell proliferation. With a controlled diameter, these GNPs can also improve the density, alignment and differentiation efficiency of PSCs. When cultured in vitro for 15 days, the diameter, cell density and orientation of muscle fibers in the GNP-stimulated cultured fish fillet are very similar to native fish muscle tissue. © 2024, The Authors. All rights reserved.

关键词： Nanoparticles

来源：评论

学校读者我要写书评

暂无评论

Fast Construction Algorithm of Cooperative Relay Network for Unmanned Aerial Vehicle

Fast Construction Algorithm of Cooperative Relay Network for...

引用

第33届中国控制与决策会议

作者： Guoqiang Wang Pengfei Cheng He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education Engineering Research Center for Intelligent Decision-making & Information Systems Technologies Ministry of Education Key Laboratory of Urban ITS Technology Optimization and Integration Ministry of Public Security of China

In view of the situation that the relay network needs to be constructed between the combat nodes with communication interruption in battlefield environment,a fast construction algorithm of Unmanned Aerial Vehicle(UAV) cooperative relay network is proposed,which is based on the theory of multiple shortest paths and strategy of giving priority to the relay placement node that is the most difficult to reach for *** with the existing algorithms,this algorithm can further shorten the construction time of UAV cooperative relay network on the premise of minimizing the number of UAVs used for ***,the simulation experiment results demonstrate the effectiveness of the proposed algorithm.

关键词： UAV Relay network Node Placement Multiple shortest paths

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：