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

Performance and energy-aware bi-objective tasks scheduling for cloud data centers

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Materwala, Huned Ismail, Leila Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi15551 United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates

Cloud computing enables remote execution of users' tasks. The pervasive adoption of cloud computing in smart cities' services and applications requires timely execution of tasks adhering to Quality of Services (QoS). However, the increasing use of computing servers exacerbates the issues of high energy consumption, operating costs, and environmental pollution. Maximizing the performance and minimizing the energy in a cloud data center is challenging. In this paper, we propose a performance and energy optimization bi-objective algorithm to tradeoff the contradicting performance and energy objectives. An evolutionary algorithm-based multi-objective optimization is for the first time proposed using system performance counters. The performance of the proposed model is evaluated using a realistic cloud dataset in a cloud computing environment. Our experimental results achieve higher performance and lower energy consumption compared to a state-of-the-art algorithm. © 2021, CC BY.

关键词： Energy efficiency

Contrasting social and non-social sources of predictability in human mobility

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chen, Zexun Kelty, Sean Welles, Brooke Foucault Bagrow, James P. Menezes, Ronaldo Ghoshal, Gourab BioComplex Laboratory University of Exeter United Kingdom College of Engineering Mathematics and Physical Sciences University of Exeter United Kingdom Department of Physics and Astronomy University of Rochester RochesterNY United States Northeastern University BostonMA United States Department of Mathematics & Statistics Vermont Complex Systems Center University of Vermont BurlingtonVT United States Department of Computer Science University of Rochester RochesterNY United States

Social structures influence a variety of human behaviors including mobility patterns, but the extent to which one individual’s movements can predict another’s remains an open question. Further, latent information about an individual’s mobility can be present in the mobility patterns of both social and non-social ties, a distinction that has not yet been addressed. Here we develop a "colocation" network to distinguish the mobility patterns of an ego’s social ties from those of non-social colocators, individuals not socially connected to the ego but who nevertheless arrive at a location at the same time as the ego. We apply entropy and predictability measures to analyse and bound the predictive information of an individual’s mobility pattern and the flow of that information from their top social ties and from their non-social colocators. While social ties generically provide more information than non-social colocators, we find that significant information is present in the aggregation of non-social colocators: 3–7 colocators can provide as much predictive information as the top social tie, and colocators can replace up to 85% of the predictive information about an ego, compared with social ties that can replace up to 94% of the ego’s predictability. The presence of predictive information among non-social colocators raises privacy concerns: given the increasing availability of real-time mobility traces from smartphones, individuals sharing data may be providing actionable information not just about their own movements but the movements of others whose data are absent, both known and unknown individuals. © 2021, CC BY.

关键词： Behavioral research

Author Correction: H∞ observer-based control for fuzzy Hadamard fractional-order systems

学校读者我要写书评

暂无评论

Computational and Applied mathematics 2025年第5期44卷 1-1页

作者： Rhaima, Mohamed Gassara, Hamdi Mchiri, Lassaad Hajjaji, Ahmed El Makhlouf, Abdellatif Ben Department of Statistics and Operations Research College of Science King Saud University Riyadh Saudi Arabia Laboratory of Sciences Techniques of Automatic Control and Computer Engineering National School of Engineering of Sfax University of Sfax Sfax Tunisia Panthéon-Assas University Paris II Paris France Modeling Information and Systems Laboratory University of Picardie Jules Verne UFR of Sciences Amiens France Department of Mathematics Faculty of Sciences Sfax University Sfax Tunisia

学校读者我要写书评

暂无评论

反向连边在大型分层网络中的影响（英文）

engineering 2024年第5期 240-249页

作者：曹浩森胡斌斌莫小雨陈都鑫高建喜袁烨陈关荣 Tamás Vicsek 管晓宏张海涛 MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Intelligent Manufacturing Equipment and Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology School of Mechanical and Aerospace Engineering Nanyang Technological University Jiangsu Key Laboratory of Networked Collective Intelligence School of Mathematics Southeast University Department of Computer Science Rensselaer Polytechnic Institute Department of Electronic Engineering City University of Hong Kong Department of Biological Physics E?tv?s University MOE Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi'an Jiaotong University

Hierarchical networks are frequently encountered in animal groups, gene networks, and artificial engineering systems such as multiple robots, unmanned vehicle systems, smart grids, wind farm networks,and so forth. The structure of a large directed hierarchical network is often strongly influenced by reverse edges from lower-to higher-level nodes, such as lagging birds' howl in a flock or the opinions of lowerlevel individuals feeding back to higher-level ones in a social group. This study reveals that, for most large-scale real hierarchical networks, the majority of the reverse edges do not affect the synchronization process of the entire network; the synchronization process is influenced only by a small part of these reverse edges along specific paths. More surprisingly, a single effective reverse edge can slow down the synchronization of a huge hierarchical network by over 60%. The effect of such edges depends not on the network size but only on the average in-degree of the involved subnetwork. The overwhelming majority of active reverse edges turn out to have some kind of ‘‘bunchingo effect on the information flows of hierarchical networks, which slows down synchronization processes. This finding refines the current understanding of the role of reverse edges in many natural, social, and engineering hierarchical networks,which might be beneficial for precisely tuning the synchronization rhythms of these networks. Our study also proposes an effective way to attack a hierarchical network by adding a malicious reverse edge to it and provides some guidance for protecting a network by screening out the specific small proportion of vulnerable nodes.

关键词：

COVID-19 pneumonia level detection using deep learning algorithm

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2020年

作者： Ghafoor, Kayhan Zrar Ali, Abbas M. Mulahuwaish, Aos Maghdid, Halgurd S. Hussein, Safwan Mawlood Mohammed, Marwan A. Department of Software Engineering Salahaddin University-Erbil Iraq School of Mathematics and Computer Science University of Wolverhampton Wulfruna Street WolverhamptonWV1 1LY United Kingdom Department of Computer Science and Information Systems Saginaw Valley State University University Center 7400 Bay Rd Science East 174 MI48710 United States Department of Software Engineering Faculty of Engineering Koya University Kurdistan Iraq Computer Engineering Department Tishk International University Iraq

The first COVID-19 confirmed case is reported in Wuhan, China and spread across the globe with unprecedented impact on humanity. Since this pandemic requires pervasive diagnosis, it is significant to develop smart, fast and efficient detection technique. To this end, we developed an Artificial Intelligence (AI) engine to classify the lung inflammation level (mild, progressive, severe stage) of the COVID-19 confirmed patient. In particular, the developed model consists of two phases;in the first phase, we calculate the volume and density of lesions and opacities of the CT images of the confirmed COVID-19 patient using Morphological approaches. In the second phase, the second phase classifies the pneumonia level of the confirmed COVID-19 patient. To achieve precise classification of lung inflammation, we use modified Convolution Neural Network (CNN) and k-Nearest Neighbor (kNN). The result of the experiments show that the utilized models can provide the accuracy up to 95.65% and 91.304 % of CNN and kNN respectively. © 2020, CC BY.

关键词： COVID-19

Strategic priorities for transformative progress in advancing biology with proteomics and artificial intelligence

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Yingying Jun, A. Liu, Zhiwei Sun, Rui Qian, Liujia Payne, Samuel H. Bittremieux, Wout Ralser, Markus Li, Chen Chen, Yi Dong, Zhen Perez-Riverol, Yasset Khan, Asif Sander, Chris Aebersold, Ruedi Vizcaíno, Juan Antonio Krieger, Jonathan R. Yao, Jianhua Wen, Han Zhang, Linfeng Zhu, Yunping Xuan, Yue Sun, Benjamin Boyang Qiao, Liang Hermjakob, Henning Tang, Haixu Gao, Huanhuan Deng, Yamin Zhong, Qing Chang, Cheng Bandeira, Nuno Li, Ming Weinan, E. Sun, Siqi Yang, Yuedong Omenn, Gilbert S. Zhang, Yue Xu, Ping Fu, Yan Liu, Xiaowen Overall, Christopher M. Wang, Yu Deutsch, Eric W. Chen, Luonan Cox, Jürgen Demichev, Vadim He, Fuchu Huang, Jiaxing Jin, Huilin Liu, Chao Li, Nan Luan, Zhongzhi Song, Jiangning Yu, Kaicheng Wan, Wanggen Wang, Tai Zhang, Kang Zhang, Le Bell, Peter A. Mann, Matthias Zhang, Bing Guo, Tiannan Affiliated Hangzhou First People’s Hospital State Key Laboratory of Medical Proteomics School of Medicine Westlake University Zhejiang Province Hangzhou China Westlake Center for Intelligent Proteomics Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Province Hangzhou China Biology Department Brigham Young University ProvoUT84602 United States Department of Computer Science University of Antwerp Antwerp2020 Belgium Department of Biochemistry CharitéUniversitätsmedizin Berlin Berlin Germany Biomedicine Discovery Institute Department of Biochemistry and Molecular Biology Monash University MelbourneVICVIC 3800 Australia Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Harvard Medical School Ludwig Center at Harvard United States Harvard Medical School Broad Institute Ludwig Center at Harvard Dana-Farber Cancer Institute United States Department of Biology Institute of Molecular Systems Biology ETH Zürich Zürich Switzerland Bruker Ltd. MiltonONL9T 6P4 Canada AI for Life Sciences Lab Tencent Shenzhen518057 China State Key Laboratory of Medical Proteomics AI for Science Institute Beijing100080 China Beijing Institute of Lifeomics Beijing102206 China Thermo Fisher Scientific GmbH Hanna-Kunath Str. 11 Bremen28199 Germany Informatics and Predictive Sciences Research Bristol Myers Squibb United States Department of Chemistry Fudan University Songhu Road 2005 Shanghai200438 China Department of Computer Science Luddy School of Informatics Computing and Engineering Indiana University IN47408 United States ProCan® Children’s Medical Research Institute Faculty of Medicine and Health The University of Sydney WestmeadNSW Australia La Jolla CA United States Central China Institute of Artificial Intelligence University of Waterloo Canada AI for Science Institute Center for Machine Learning Research School of Mathematical Sciences Peking University China Research Institute of Intelligent Complex Systems Fudan U

Artificial intelligence (AI) is transforming scientific research, including proteomics. Advances in mass spectrometry (MS)-based proteomics data quality, diversity, and scale, combined with groundbreaking AI techniques, are unlocking new challenges and opportunities in biological discovery. Here, we highlight key areas where AI is driving innovation, from data analysis to new biological insights. These include developing an AI-friendly ecosystem for proteomics data generation, sharing, and analysis;improving peptide and protein identification and quantification;characterizing protein-protein interactions and protein complexes;advancing spatial and perturbation proteomics;integrating multi-omics data;and ultimately enabling AI-empowered virtual cells. © 2025, CC BY.

关键词： Biotic

Minimizing Deduction System and Its Application?

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Cen, Zhe Feng, Xiutao Wang, Zhangyi Cao, Chunping Department of Computer Science and Technology University of Shanghai for Science and Technology Shanghai200093 China Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Sciences CAS Beijing100089 China School of Cyber Science and Engineering Wuhan University Wuhan430072 China

In a deduction system with some propositions and some known relations among these propositions, people usually care about the minimum of propositions by which all other propositions can be deduced according to these known relations. Here we call it a minimizing deduction system. Its common solution is the guess and determine method. In this paper we propose a method of solving the minimizing deduction system based on MILP. Firstly, we introduce the conceptions of state variable, path variable and state copy, which enable us to characterize all rules by inequalities. Then we reduce the deduction problem to a MILP problem and solve it by the Gurobi optimizer. As its applications, we analyze the security of two stream ciphers SNOW2.0 and Enocoro-128v2 in resistance to guess and determine attacks. For SNOW 2.0, it is surprising that it takes less than 0.1s to get the best solution of 9 known variables in a personal Macbook Air(Early 2015, Double Intel Core i5 1.6GHZ, 4GB DDR3). For Enocoro-128v2, we get the best solution of 18 known variables within 3 minutes. What’s more, we propose two improvements to reduce the number of variables and inequalities which significantly decrease the scale of the MILP problem. Copyright © 2020, The Authors. All rights reserved.

关键词： Integer programming

Graph-Based File Dispatching Protocol With D2D-Aided UAV-NOMA Communications in Large-Scale Networks

学校读者我要写书评

暂无评论

Graph-Based File Dispatching Protocol With D2D-Aided UAV-NOM...

IEEE Conference on Wireless Communications and Networking

作者： Baoji Wang Rongqing Zhang Chen Chen Xiang Cheng Liuqing Yan State Key Laboratory of Advanced Optical Communication Systems and Networks Department of Electronics School of Electronics Engineering and Computer Science Peking University Beijing China school of Software Engineering Tongji University Shanghai China Department of Electrical & Computer Engineering Colorado State University CO USA

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

Unmanned aerial vehicle (UAV)-assisted communications are expected to become an important part of the next generation mobile communication systems, due to the high mobility of the UAVs. Non-orthogonal multiple access (NOMA) is regarded as a rosy technology in the fifth generation (5G) mobile communication systems, since it can effectively improve the spectral efficiency. In this paper, we combine the advantages of the UAV-assisted communications and NOMA, and propose a device-to-device (D2D)-enhanced UAV-NOMA network architecture, in which D2D is introduced to increase the file dispatching efficiency. Resource reuse based on spatial reuse is also allowed to further improve the spectral efficiency. Then, we propose a graph-based file dispatching (GFD) protocol to control the interference and minimize the UAV-assisted file dispatching mission time. Simulation results verify the advantages of our proposed D2D-enhanced UAV-NOMA network architecture and the efficiency of our designed GFD protocol.

关键词：

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Larson, Jeffrey Menickelly, Matt Zhou, Baoyu Mathematics and Computer Science Division Argonne National Laboratory LemontIL60439 United States Department of Industrial and Systems Engineering Lehigh University BethlehemPA18015 United States

We propose a manifold sampling algorithm for minimizing a nonsmooth composition f = h ◦ F, where we assume h is nonsmooth and may be inexpensively computed in closed form and F is smooth but its Jacobian may not be available. We additionally assume that the composition h ◦ F defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of F are combined with particularly sampled information about h to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about f . Copyright © 2020, The Authors. All rights reserved.

关键词： Learning algorithms