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

SSRN 2023年

作者： Wang, Zeli Dai, Weiqi Li, Ming Choo, Kim-Kwang Raymond Zou, Deqing Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing40065 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio United States

Existing smart contract vulnerability identification approaches mainly focus on complete program detection. Consequently, lots of known potentially vulnerable locations need manual verification, which is energy-exhaustive and error-prone. Fuzzing is an effective way to detect vulnerabilities. However, current fuzzers cannot effectively probe these suspicious targets because they overlook two key factors: exploring all paths toward the targets and providing high-quality directed seed inputs. This paper presents a Directed vulnerability veriFier (DFier), elaborating effective transaction sequences with directed inputs for the fuzzer, to focus on analyzing target paths and automatically detect whether the given locations are vulnerable. Specifically, DFier fuses the effectiveness of static analysis and the efficiency of fuzzing. The static analysis helps locate target paths and generate directed inputs for the fuzzer under three heuristic strategies. The first prefers inputs with the larger possibility of triggering potential vulnerabilities based on target features. The second guides the value mutation to satisfy the path constraints. The third adequately leverages execution information to help find exploits faster. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius). And the performance losses are in an acceptable range. © 2023, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Investigating the relation between environment and internal structure of massive elliptical galaxies using strong lensing

arXiv

引用

arXiv 2024年

作者： Adnan, S.M. Rafee Hasan, Muhammad Jobair Al-Imtiaz, Ahmad Robin, Sulyman H. Shwadhin, Fahim R. Shajib, Anowar J. Nahid, Mamun Hossain Tanver, Mehedi Hasan Akter, Tanjela Jahan, Nusrath Jafar, Zareef Rashid, Mamunur Biswas, Anik Chowdhury, Akbar Ahmed Feardous, Jannatul Rahaman, Ajmi Ridwan, Masuk Sharma, Rahul D. Chowdhury, Zannat Hossain, Mir Sazzat Department of Physics and Astronomy University of Louisville LouisvilleKY40208 United States Department of Physics Shahjalal University of Science and Technology Sylhet3114 Bangladesh Copernicus Astronomical Memorial of SUST Shahjalal University of Science and Technology Sylhet3114 Bangladesh Department of Electrical and Electronic Engineering Bangladesh Army University of Engineering & Technology Qadirabad Natore6431 Bangladesh Department of Astronomy & Astrophysics University of Chicago ChicagoIL60637 United States Kavli Institute for Cosmological Physics University of Chicago ChicagoIL60637 United States Department of Mathematics Shahjalal University of Science and Technology Sylhet3114 Bangladesh Center for Computational & Data Sciences Independent University Bangladesh Dhaka1229 Bangladesh Department of Computer Science and Engineering Brac University Dhaka1212 Bangladesh Department of Electrical and Electronic Engineering Bangladesh University of Engineering and Technology Dhaka1205 Bangladesh Department of Physical Science Independent University Bangladesh Dhaka1229 Bangladesh Department of Electrical & Electronic Engineering Rajshahi University of Engineering & Technology Rajshahi6204 Bangladesh Department of Computer Science and Engineering Independent University Bangladesh Dhaka1229 Bangladesh

Strong lensing directly probes the internal structure of the lensing galaxies. In this paper, we investigate the relation between the internal structure of massive elliptical galaxies and their environment using a sample of 15 strong lensing systems. We performed lens modeling for them using lenstronomy and constrained the mass and light distributions of the deflector galaxies. We adopt the local galaxy density as a metric for the environment and test our results against several alternative definitions of it. We robustly find that the centroid offset between the mass and light is not correlated with the local galaxy density. This result supports using centroid offsets as a probe of dark matter theories since the environment's impact on it can be treated as negligible. Although we find a strong correlation between the position angle offset and the standard definition of the local galaxy density, consistent with previous studies, the correlation becomes weaker for alternative definitions of the local galaxy density. This result weakens the support for interpreting the position angle misalignment as having originated from interaction with the environment. Furthermore, we find the 'residual shear' magnitude in the lens model to be uncorrelated with the local galaxy density, supporting the interpretation of the residual shear originating, in part, from the inadequacy in modeling the angular structure of the lensing galaxy and not solely from the structures present in the environment or along the line of sight. © 2024, CC BY.

关键词： Probes

来源：评论

学校读者我要写书评

暂无评论

A Survey of Recent Advances in Optimization Methods for Wireless Communications

arXiv

引用

arXiv 2024年

作者： Liu, Ya-Feng Chang, Tsung-Hui Hong, Mingyi Wu, Zheyu So, Anthony Man-Cho Jorswieck, Eduard A. Yu, Wei The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China The Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States The Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong The Institute for Communication Technology Technische Universitat Braunschweig Germany The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recently developed optimization techniques in areas ranging from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing or developing suitable algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

CCGRID 2023: A Holistic Approach to Inclusion and Belonging

CCGRID 2023: A Holistic Approach to Inclusion and Belonging

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： Beth Plale Preeti Malakar Meenakshi D'Souza Hemangee K. Kapoor Yogesh Simmhan Ilkay Altintas Manohar Swaminathan School of Informatics Computing and Engineering Indiana University Bloomington IN USA Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kalyanpur Kanpur India International Institute of Information Technology Bangalore Bengaluru Karnataka India Department of Computer Science and Engineering Indian Institute of Technology Guwahati Guwahati Assam India Department of Computational and Data Sciences Indian Institute of Science Bangalore India San Diego Supercomputer Center University of California San Diego MC USA Microsoft Research Lab - India Bengaluru Karnataka India

“CCGRID will act with responsibility as its primary consideration; with equity, diversity, and inclusion as its central goals.” from the CCGRID 2023 web site [1]

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Particle Approximation of Lagged Feynman-Kac Formulae

arXiv

引用

arXiv 2024年

作者： Awadelkarim, Elsiddig Caffarel, Michel Moral, Pierre Del Jasra, Ajay Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia University of Toulouse CNRS-Lab. de Chimie et Physique Quantiques Toulouse31062 France Centre de Recherche Inria Bordeaux Sud-Ouest Talence33405 France School of Data Science The Chinese University Hong Kong Shenzhen China

In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman-Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function. The typical application considered here is the computation of eigenvalues associated with non-negative operators as found, for example, in physics or particle simulation of rare-events. We focus on a novel lagged approximation of this invariant measure, based upon the introduction of a ratio of time-averaged Feynman-Kac marginals associated with a positive operator iterated l ∈ N times;a lagged Feynman-Kac formula. This estimator and its approximation using Diffusion Monte Carlo (DMC) have been extensively employed in the physics literature. In short, DMC is an iterative algorithm involving N ∈ N particles or walkers simulated in parallel, that undergo sampling and resampling operations. In this work, it is shown that for the DMC approximation of the lagged Feynman-Kac formula, one has an almost sure characterization of the L1-error as the time parameter (iteration) goes to infinity and this is at most of O(exp{−κl}/N), for_ κ > 0. In addition a non-asymptotic in time, and time uniform L1−bound is proved which is O(l/√N). We also prove a novel central limit theorem to give a characterization of the exact asymptotic in time variance. This analysis demonstrates that the strategy used in physics, namely, to run DMC with N and l small and, for long time enough, is mathematically justified. Our results also suggest how one should choose N and l in practice. We emphasize that these results are not restricted to physical applications;they have broad relevance to the general problem of particle simulation of the Feynman-Kac formula, which is utilized in a great variety of scientific and engineering fields. © 2024, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Big data in healthcare:Conceptual network structure,key challenges and opportunities

引用

Digital Communications and Networks 2023年第4期9卷 856-868页

作者： Leonardo B.Furstenaua Pedro Leivas Michele Kremer Sott Michael S.Dohan Jose Ricardo Lopez-Robles Manuel J.Cobo Nicola Luigi Bragazzi Kim-Kwang Raymond Choo Post-Graduate Program in Industrial Engineering Federal University of Rio Grande Do SulPorto Alegre90035-190Brazil University of Santa Cruz Do Sul Av.Independencia 2293Santa Cruz Do SulRSBrazil Business School Unisinos UniversityAv.Dr.Nilo Peçanha 160091330-002Porto AlegreBrazil Faculty of Business Administration Lakehead UniversityThunder BayOntarioCanada Autonomous University of Zacatecas Av.Ramon Lopez Velarde Col.CentroZacatecas98000Mexico Department of Computer Science and Artificial Intelligence Andalusian Research Institute in Data Science and Computational Intelligence(DaSCI)University of GranadaGranada 18071Spain York University ON M3J 1P3Canada Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249USA

Big data is a concept that deals with large or complex data sets by using data analysis tools(e.g.,data mining,machine learning)to analyze information extracted from several sources *** data has attracted wide attention from academia,for example,in supporting patients and health professionals by improving the accuracy of decision-making,diagnosis and disease *** research aimed to perform a Bibliometric Performance and Network Analysis(BPNA)supported by a Scoping Review(SR)to depict the strategic themes,thematic evolution structure,main challenges and opportunities related to the concept of big data applied in the healthcare *** this goal in mind,4857 documents from the Web of science covering the period between 2009 to June 2020 were analyzed with the support of SciMAT *** bibliometric performance showed the number of publications and citations over time,scientific productivity and the geographic distribution of publications and research *** strategic diagram yielded 20 clusters and their relative importance in terms of centrality and *** thematic evolution structure presented the most important themes and how it changes over ***,we presented the main challenges and future opportunities of big data in healthcare.

关键词： Big data Healthcare digitalization Bibliometric Strategic intelligence Co-word analysis SciMAT

来源：评论

学校读者我要写书评

暂无评论

Using data Analytics to Forecast Violent Crime

Using Data Analytics to Forecast Violent Crime

引用

International Conference on computational science and computational Intelligence (CSCI)

作者： Herious Cotton Tor A. Kwembe Computational Data Enabled Science and Engineering Jackson State University Jackson MS USA Department of Mathematics and Statistical Sciences Jackson State University Jackson MS USA

ISBN: (纸本)9781665458429

In this paper, we used data analytics to analyze criminal data. Prophet model, LSTM recurrent neural network model, a linear regression model, and traditional neural network model were used to predict homicide and rape in the Southeastern Cities of Memphis Tennessee, Jackson Mississippi, and New Orleans Louisiana. LSTM recurrent neural network model and traditional neural network model have smaller RMSE. Thus, LSTM recurrent neural network model and traditional neural network model performed better than the prophet and linear regression models. These promising outcomes will be significant to scholars, policymakers, and law enforcement officers.

关键词： Recurrent neural networks data analysis Law enforcement Scientific computing Urban areas Linear regression data visualization

来源：评论

学校读者我要写书评

暂无评论

引用

China CDC weekly 2022年第40期4卷 885-889,I0002-I0005页

作者： Yuan Bai Mingda Xu Caifen Liu Mingwang Shen Lin Wang Linwei Tian Suoyi Tan Lei Zhang Petter Holme Xin Lu Eric H.Y.Lau Benjamin J.Cowling Zhanwei Du WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong Kong Special Administrative RegionChina Laboratory of Data Discovery for Health Limited(D24H) Hong Kong Science ParkHong Kong Special Administrative RegionChina China-Australia Joint Research Center for Infectious Diseases School of Public HealthXi’an Jiaotong University Health Science CenterXi’an CityShaanxi ProvinceChina Department of Genetics University of CambridgeCambridge CB23EHUK College of Systems Engineering National University of Defense TechnologyChangsha CityHunan ProvinceChina Department of Computer Science Aalto UniversityEspooFinland Center for Computational Social Science Kobe UniversityKobeJapan

Introduction:Minimizing the importation and exportation risks of coronavirus disease 2019(COVID-19)is a primary concern for sustaining the“Dynamic COVID-zero”strategy in *** estimation is essential for cities to conduct before relaxing border control ***:Informed by the daily number of passengers traveling between 367 prefectures(cities)in China,this study used a stochastic metapopulation model parameterized with COVID-19 epidemic characteristics to estimate the importation and exportation ***:Under the transmission scenario(R0=5.49),this study estimated the cumulative case incidence of Changchun City,Jilin Province as 3,233(95%confidence interval:1,480,4,986)before a lockdown on March 14,2022,which is close to the 3,168 cases reported in real life by March 16,*** a total of 367 prefectures(cities),127(35%)had high exportation risks according to the simulation and could transmit the disease to 50%of all other regions within a period from 17 to 94 *** average time until a new infection arrives in a location in 1 of the 367 prefectures(cities)ranged from 26 to 101 ***:Estimating COVID-19 importation and exportation risks is necessary for preparedness,prevention,and control measures of COVID-19—especially when new variants emerge.

关键词： Export Changchun prevention

来源：评论

学校读者我要写书评

暂无评论

Mining data impressions from deep models as substitute for the unavailable training data

arXiv

引用

arXiv 2021年

作者： Nayak, Gaurav Kumar Mopuri, Konda Reddy Jain, Saksham Chakraborty, Anirban Department of Computational and Data Sciences Indian Institute of Science Bangalore India Department of Computer Science and Engineering Indian Institute of Technology Tirupati

Pretrained deep models hold their learnt knowledge in the form of model parameters. These parameters act as "memory" for the trained models and help them generalize well on unseen data. However, in absence of training data, the utility of a trained model is merely limited to either inference or better initialization towards a target task. In this paper, we go further and extract synthetic data by leveraging the learnt model parameters. We dub them data Impressions, which act as proxy to the training data and can be used to realize a variety of tasks. These are useful in scenarios where only the pretrained models are available and the training data is not shared (e.g., due to privacy or sensitivity concerns). We show the applicability of data impressions in solving several computer vision tasks such as unsupervised domain adaptation, continual learning as well as knowledge distillation. We also study the adversarial robustness of lightweight models trained via knowledge distillation using these data impressions. Further, we demonstrate the efficacy of data impressions in generating data-free Universal Adversarial Perturbations (UAPs) with better fooling rates. Extensive experiments performed on benchmark datasets demonstrate competitive performance achieved using data impressions in absence of original training data. Copyright © 2021, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Perturbation theory for evolution of cooperation on networks

arXiv

引用

arXiv 2022年

作者： Meng, Lingqi Masuda, Naoki Department of Mathematics University at Buffalo State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States

Network structure is a mechanism for promoting cooperation in social dilemma games. In the present study, we explore graph surgery, i.e., to slightly perturb the given network, towards a network that better fosters cooperation. To this end, we develop a perturbation theory to assess the change in the propensity of cooperation when we add or remove a single edge to/from the given network. Our perturbation theory is for a previously proposed random-walk-based theory that provides the threshold benefit-to-cost ratio, (b/c)∗, which is the value of the benefit-to-cost ratio in the donation game above which the cooperator is more likely to fixate than in a control case, for any finite networks. We find that (b/c)∗ decreases when we remove a single edge in a majority of cases and that our perturbation theory captures at a reasonable accuracy which edge removal makes (b/c)∗ small to facilitate cooperation. In contrast, (b/c)∗ tends to increase when we add an edge, and the perturbation theory is not good at predicting the edge addition that changes (b/c)∗ by a large amount. Our perturbation theory significantly reduces the computational complexity for calculating the outcome of graph *** Codes 91A22, 91D30 Copyright © 2022, The Authors. All rights reserved.

关键词： Surgery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：