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

Adaptive energy-preserving algorithms for guiding center system

Plasma science and Technology 2023年第4期25卷 11-22页

作者：朱贝贝刘健张嘉炜祝爱卿唐贻发 Department of Applied Mathematics School of Mathematics and PhysicsUniversity of Science and Technology BeijingBeijing 100083Peopleʼs Republic of China School of Nuclear Science and Technology University of Science and Technology of ChinaHefei 230026Peopleʼs Republic of China Advanced algorithm Joint Lab Shandong Computer Science CenterQilu University of TechnologyJinan 250014Peopleʼs Republic of China The State Key Laboratory of Scientific and Engineering Computing The Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190Peopleʼs Republic of China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049Peopleʼs Republic of China

We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendre’s quadrature rules and time stepsize respectively to overcome the energy drift problem in traditional energy-preserving *** new adaptive algorithms are second order,and their algebraic order is carefully *** results show that the global energy errors are bounded to the machine precision over long time using these adaptive algorithms without massive extra computation cost.

关键词： guiding center system energy-preserving methods adaptive energy conservation

来源：评论

学校读者我要写书评

暂无评论

Adaptive Power Control Aware Depth Routing in Underwater Sensor Networks

引用

computers, Materials & Continua 2021年第10期69卷 1301-1322页

作者： Ghufran Ahmed Saiful Islam Ihsan Ali Isra Adil Hayder Abdelmuttlib Ibrahim Abdalla Ahmed Muhammad Talha Sultan S.Alshamrani Ag Asri Ag Ibrahim Department of Computer Science FAST National University of Computer and Emerging Sciences(NUCES)KarachiPakistan Dr.A.Q.Khan Institute of Computer Sciences and Information Technology KahutaPakistan Faculty of Computer Science and Information Technology University of MalayaKuala Lumpur50603Malaysia Department of Computer Science COMSATS University IslamabadIslamabadPakistan Deanship of Scientific Research King Saud UniversityRiyadhSaudi Arabia Department of Information Technology College of Computer and Information TechnologyTaif UniversityTaif21944Saudi Arabia Faculty of Computing and Informatics Universiti Malaysia SabahKota KinabaluSabahMalaysia

Underwater acoustic sensor network(UASN)refers to a procedure that promotes a broad spectrum of aquatic *** can be practically applied in seismic checking,ocean mine identification,resource exploration,pollution checking,and disaster *** confronts many difficulties and issues,such as low bandwidth,node movements,propagation delay,3D arrangement,energy limitation,and high-cost production and arrangement costs caused by antagonistic underwater *** wireless sensor networks(UWSNs)are considered a major issue being encountered in energy management because of the limited battery power of their ***,the harsh underwater environment requires vendors to design and deploy energy-hungry devices to fulfil the communication requirements and maintain an acceptable quality of ***,increased transmission power levels result in higher channel interference,thereby increasing packet *** the facts mentioned above,this research presents a controlled transmission power-based sparsity-aware energy-efficient clustering in *** contributions of this technique is ***,it uses the adaptive power control mechanism to utilize the sensor nodes’battery and reduce channel interference ***,thresholds are defined to ensure successful ***,clustering can be implemented in dense areas to decrease the repetitive transmission that ultimately affects the energy consumption of nodes and interference ***,mobile sinks are deployed to gather information locally to achieve the previously mentioned *** suggested protocol is meticulously examined through extensive simulations and is validated through comparison with other advanced UWSN *** show that the suggested protocol outperforms other procedures in terms of network lifetime and packet delivery ratio.

关键词： UWSNs UASNs QoS

来源：评论

学校读者我要写书评

暂无评论

Visualizing summary statistics and uncertainty

Visualizing summary statistics and uncertainty

引用

12th Eurographics/IEEE-VGTC Symposium on Visualization, EuroVis 2010

作者： Potter, K. Kniss, J. Riesenfeld, R. Johnson, C.R. Scientific Computing and Imaging Institute University of Utah United States Department of Computer Science University of New Mexico United States School of Computing University of Utah United States

The graphical depiction of uncertainty information is emerging as a problem of great importance. scientific data sets are not considered complete without indications of error, accuracy, or levels of confidence. The visual portrayal of this information is a challenging task. This work takes inspiration from graphical data analysis to create visual representations that show not only the data value, but also important characteristics of the data including uncertainty. The canonical box plot is reexamined and a new hybrid summary plot is presented that incorporates a collection of descriptive statistics to highlight salient features of the data. Additionally, we present an extension of the summary plot to two dimensional distributions. Finally, a use-case of these new plots is presented, demonstrating their ability to present high-level overviews as well as detailed insight into the salient features of the underlying data distribution. © The Eurographics Association and Blackwell Publishing Ltd.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic and portable cloud deployment for scientific simulations

Automatic and portable cloud deployment for scientific simul...

引用

2014 International Conference on High Performance computing and Simulation, HPCS 2014

作者： Horuk, Christopher B. Douglas, Geoffrey Gupta, Anand Krintz, Chandra Abales, Ben Bellesia, Giovanni Drawert, Brian Wolski, Rich Petzold, Linda Hellander, Andreas Dept. of Computer Science University of California Santa Barbara United States Dept. of Information Technology Division of Scientific Computing Uppsala University Sweden

ISBN: (纸本)9781479953127

In this paper, we present CLOUDRUNNER, a framework that extracts arbitrary programs from a source code repository (e.g. GitHub), wraps them in a web service and tasking system, and deploys them over disparate cloud infrastructures and local clusters, automating their portability. In particular, CLOUDRUNNER automatically creates and configures virtual machines so that they can execute the applications, provides a web UI with which users parameterize their applications, deploys instances of the program as background tasks, and collects the results for easy access via a browser. CLOUDRUNNER is an ideal framework for deploying scientific simulation applications portably and as such, we use it to implement StochSS - Stochastic Simulation as-a-service (now available at http://***). We use StochSS to evaluate CLOUDRUNNER overheads and find that they are small, consistent, and amortized for even short running applications. © 2014 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

On the implementation of automatic differentiation tools

引用

Higher-Order and Symbolic Computation 2008年第3期21卷 311-331页

作者： Bischof, Christian H. Hovland, Paul D. Norris, Boyana Institute for Scientific Computing Aachen University of Technology Seffenter Weg 23 Aachen 52074 Germany Mathematics and Computer Science Division Argonne National Laboratory 9700 S. Cass Avenue Argonne IL 60439-4844 United States

Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathematical function into a program that computes the function and its derivatives. Derivatives play an important role in a wide variety of scientific computing applications, including numerical optimization, solution of nonlinear equations, sensitivity analysis, and nonlinear inverse problems. We describe the forward and reverse modes of automatic differentiation and provide a survey of implementation strategies. We describe some of the challenges in the implementation of automatic differentiation tools, with a focus on tools based on source transformation. We conclude with an overview of current research and future opportunities. © 2008 US Government.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Magicmikes - Method for spatial sonification 2

Magicmikes - Method for spatial sonification

引用

Visual Data Exploration and Analysis II 1995

作者： Gröhn, Matti Takala, Tapio Center for Scientific Computing P.O.B. 405 Espoo02101 Finland Helsinki University of Technology Department of Computer Science Espoo02150 Finland

A three-stage method is presented to interactively sonify spatially located data sets, such that both individual point sources and overviews of larger areas can be explored. First, a region of interest in the data set is defined. Delimiting the data points by area and other means corresponds to search with multiple keys in a geographic data base. Second, the selected values are mapped to parameters of simulated sound sources at corresponding locations, which are recorded by visually controllable microphone probes. The probes are shown on the visualized data landscape with their cut-off areas and data selections. At the last stage the sounds are spatialized according to distance and location of sources relative to the probes, adding echoes and reverberation from a virtual acoustic environment. We are experimenting with a listening room with loudspeakers and a headphone setting with realtime computation of the head-related transfer function (HRTF). Combined with interactive visualization, this kind of sonification helps as a navigational aid to locate interesting spots of data. The system allows arbitrary mapping of data channels to visual and sonic parameters, which facilitates flexible exploration of multivariate data. © 1995 SPIE. All rights reserved.

关键词： Probes

来源：评论

学校读者我要写书评

暂无评论

LimonDroid: a system coupling three signature-based schemes for profiling Android malware

引用

Iran Journal of computer science 2021年第2期4卷 95-114页

作者： Tchakounté, Franklin Ngassi, Roger Corneille Ndjeumou Kamla, Vivient Corneille Udagepola, Kalum Priyanath Department of Mathematics and Computer Science Faculty of Science University of Ngaoundéré Ngaoundéré Cameroon Department of Mathematics and Computer Science National School of Agro-Industrial Science University of Ngaoundéré Ngaoundéré Cameroon Department of Information and Computing Sciences Scientific Research Development Institute of Technology Loganlea Australia

Android remains an interesting target to attackers due to its openness. A contribution in the literature consists of providing similarity measurement such as fuzzy hashing to fight against code obfuscation techniques. Research works in this approach suffer from limited signature database. This work combines fuzzy hashing with YARA rules and VirusTotal signature-based schemes, to improve and consistency of the signature database. It is proposed LimonDroid, an Android system, which mimics Limon, a Desktop security tool that includes such schemes. LimonDroid has been tested with 341 malicious and 300 benign applications on a database of 12925 fuzzy-hashed malware signatures, 62 YARA malware families’ patterns and VirusTotal engine. Our approach gives a true-positive rate of 97.36%, a true negative rate of 98.33% and an accuracy of 97.82%. A comparison with similarity-based solutions reveals that LimonDroid is more efficient for users. The objective is not to propose a detection approach better than those in the literature. Instead, we aim at establishing a robust signature database able to identify malicious trends in Android apps. © Springer Nature Switzerland AG 2020.

关键词： Android malware Detection Fuzzy hashing Limon sandbox Similarity Static analysis VirusTotal YARA

来源：评论

学校读者我要写书评

暂无评论

Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism

Optimizing Irregular Communication with Neighborhood Collect...

引用

2023 International Conference on High Performance computing, Network, Storage, and Analysis, SC Workshops 2023

作者： Collom, Gerald Li, Rui Peng Bienz, Amanda Department of Computer Science University of New Mexico Albuquerque United States Center for Advanced Scientific Computing Lawrence Livermore National Laboratory Livermore United States

ISBN: (纸本)9798400707858

Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. The authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install. © 2023 ACM.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Web service location-allocation using discrete NSGA-II with matrix based genetic operations and a repair mechanism

引用

Journal of Ambient Intelligence and Humanized computing 2023年第10期14卷 14163-14187页

作者： Verma, Shanu Pant, Millie Snasel, Vaclav Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Roorkee Roorkee247667 India Centre for Artificial Intelligence and Data Science Indian Institute of Technology Roorkee Roorkee247667 India Department of Computer Science VSB-Technical University of Ostrava Ostrava70800 Czech Republic

Web Service Location-Allocation Problem (WSLAP) is an important and challenging NP-hard combinatorial optimization problem where multiple objectives affecting the quality of service (QoS) are to be optimized simultaneously. Most of the existing research articles mainly focus on selecting web service locations that minimize two QoS: total cost and total response time. However, another QoS factor throughput also needs attention when selecting sites for allocating web services. Therefore, we have constructed a new WSLAP model that minimizes the total cost and the total negative quality factor. This negative quality factor considers throughput along with latency to strengthen the QoS of the located web services. Further, three NSGA-II variants, NSGA-II.V1, NSGA-II.V2, and NSGA-II.V3, with a novel matrix-based chromosome representation, are developed to deal with the proposed bi-objective WSLAP model. These algorithms involve matrix-based genetic operations for better exploration and a repair mechanism for tackling infeasibility. The proposed model and algorithms are validated on 24 test instances, out of which 14 are existing, and 10 are newly created with increased web services, user centres and service locations. The experimental results claim that the proposed WSLAP model succeeded in improving the throughput with a comparatively lower total cost. Further, the proposed algorithms outperformed the compared algorithms in terms of hypervolume, inverted generational distance and computational time on 89% of instances. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection against Multipath Routing

引用

IEEE Journal on Selected Areas in Communications 2025年第6期43卷 2155-2171页

作者： Zhao, Ziming Li, Zhaoxuan Xie, Xiaofei Liu, Zhipeng Li, Tingting Yu, Jiongchi Zhang, Fan Chen, Binbin School of Software Technology Zhejiang University Ningbo315100 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China ZJU-Hangzhou Global Scientific and Technological Innovation Center 311200 China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province 310027 China Jiaxing Research Institute Zhejiang University 314000 China Zhengzhou Xinda Institute of Advanced Technology Zhengzhou450001 China Singapore State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security UCAS Beijing100049 China School of Computing and Information Systems Singapore Management University Singapore188065 Singapore Advanced Digital Sciences Center Singapore138632 Singapore Singapore University of Technology and Design SingaporeB96049 Singapore

With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multi-path routing phenomenon that exists in practice. In this paper, we reveal practical challenges in the context of enabling line-speed model inference in the network dataplane. Furthermore, we propose FCPlane, the forwarding and computing integrated dataplane for zero-trust intrusion detection that aims to enable efficient load balancing while providing reliable traffic analysis results, even against multipath routing. The core idea is to reconcile forwarding and computation to the flowlet level, for which a tailor-made Markov chain model is designed. Based on two public traffic datasets, we evaluate seven state-of-the-art in-network traffic analysis models deployed in four types of topologies (three with multipath routing and one without) to explore performance impact and demonstrate the effectiveness of our proposal. © 1983-2012 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：