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

Calculation of runoff computation cost and sensitivity analysis of topological attributes

REMOTE SENSING APPLICATIONS-SOCIETY AND ENVIRONMENT 2022年 26卷

作者： Gholami, Farinaz Nemati, Alireza Li, Yue Zhang, Junlong Qingdao Univ Dept Syst Sci Engn Qingdao Peoples R China Qingdao Univ Inst Future IFF Qingdao Peoples R China Qingdao Univ Dept Environm Sci & Engn Qingdao Peoples R China Qingdao Univ Dept Environm Sci & Engn Qingdao Peoples R China

computation cost and sensitivity of the simulated results to the input parameters are the essential targets in this study. The impact of different DEMs with various sources and cell -sizes are studied on the output accuracy of the hydrological model. Evaluation of the most influential input parameters is conducted by employing Sequential Uncertainties Fitting Ver. 2 algorithms on the performance of the SWAT model. The simulation time is calculated in each case, and the trade-off between the output accuracy and the computation time is discussed. Zarrineh River watershed in Iran has been studied as a case study. The outcomes indicate that the reach lengths, reach slopes, the number of sub-basins and the amount of HRUs are the most influential parameter in runoff simulation by the SWAT model, and they differ by changing the DEM source and resolution. Simulated results over-predict the runoff during low precipitation periods and under-predict it during high precipitation seasons. The accuracy of simulated results decreases by reducing the DEM resolution, and ten times reduction of the DEM resolution generally leads to a 50% increase of error while decreasing the simulation time by eight times. The results show that the fine resolution of the input data enhances the performance of the SWAT model in the prediction of a few parameters such as the runoff yield, the hydrological response, and estimating the terrain morphology. The SWAT model has the best performance while using the DEM generated from the TOPO1:25000 as the input with 0.79, 0.79, 13.57 for the NSE, R-2, PBIAS, respectively. The results can be employed to estimate the impact of low-resolution input data on the simulated result and reduce the computation time by decreasing the input DEM resolution with only a minor reduction of accuracy.

关键词： Topological attribute Sensitivity analysis computation cost Runoff estimation Resampled DEMs

来源：评论

学校读者我要写书评

暂无评论

A novel approach for trade-off between computation and communication cost in wireless sensor networks

A novel approach for trade-off between computation and commu...

引用

12th International Conference on Advanced Communication Technology (ICACT) - ICT for Green Growth and Sustainable Development

作者： Arastouie, Narges Sabaei, Masoud Shahreza, Hosseinali Shirali Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Iran

ISBN: (纸本)9788955191455

Wireless sensor networks consist of nodes with severe energy constraints and thus, they must use energy saving algorithms in different layers. Despite the prior work, the computational cost in a wireless sensor network is usually neglected compared to the communication cost;it may not admit to in which large volumes of data packets are being transmitted, such as those cases in which This packets are video frames captured by video sensor nodes. In this paper, we consider the problem of minimizing the communication needed to send readings from a set of sensors to a single destination with obtaining a trade-off between computation and communication energy. We propose a centralized as well as a distributed algorithm. In the former, the sink node and in the latter, each node endeavors to reduce network energy consumption adaptively, making a trade-off between data compression at the appropriate level and sending row data. The data compression technique used is dependent on the application type and considers spatial correlation. Comparing the simulation results of our approach with similar work, without consideration of trade-off between computation and comparison, shows significant improvement in energy saving of the network.

关键词： sensor network data compression energy consumption computation cost data entropy aggregation

来源：评论

学校读者我要写书评

暂无评论

An Improvised Certificate-Based Proxy Signature Using Hyperelliptic Curve Cryptography for Secure UAV Communications

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第4期26卷 5264-5275页

作者： Khan, Muhammad Asghar Ullah, Insaf Kumar, Neeraj Akhunzada, Adnan Anisi, Mohammad Hossein Alqhatani, Abdulmajeed Afghah, Fatemeh Barb, Gordana Waqas, Abi Prince Mohammad Bin Fahd Univ Dept Elect Engn Al Khobar 31952 Saudi Arabia Univ Essex Inst Analyt & Data Sci Colchester CO4 3SQ England Thapar Inst Engn & Technol CSED Patiala 147004 India Imam Abdulrahman Bin Faisal Univ Coll Comp Sci & Informat Technol Dept Networks & Commun Dammam 31441 Saudi Arabia Univ Doha Sci & Technol Coll Comp & Informat Technol Doha Qatar Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ England Najran Univ Dept Informat Syst Najran 66454 Saudi Arabia Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA Politehn Univ Timisoara Dept Commun Timisoara 300006 Romania Mehran Univ Engn & Technol MUET Telecommun Dept Jamshoro 76062 Pakistan

Unmanned aerial vehicles (UAVs) have enabled numerous inventive solutions to multiple problems, considerably facilitating our daily lives;however, UAVs frequently rely on an open wireless channel for communication, making them susceptible to cyber-physical threats. Also, UAVs cannot execute complicated cryptographic algorithms due to their limited onboard computing capabilities. Balancing high-security levels and minimum computation costs is imperative when developing a security solution for UAVs. Consequently, several proxy signature schemes have been proposed in the literature to fulfill these requirements. Nevertheless, many of these solutions face the issue of high computation costs, and some exhibit security vulnerabilities that could not be more feasible options for UAV communication. Considering these constraints in mind, in this article, we introduce an improvised certificate-based proxy signature scheme (ICPS), which leverages the concept of hyperelliptic curve cryptography (HECC) to meet the security and efficiency requirements of UAV networks. The proposed ICPS scheme offers a range of notable features, including its ability to address key escrow and secret key distribution issues. The proposed ICPS scheme's security hardness has been evaluated using the widely known security tool, the random oracle model (ROM), proving its resilience against known and unknown cybersecurity threats. Finally, this study conducts a performance comparison of the proposed scheme against existing schemes, emphasizing its outstanding cost-efficiency. Notably, the computation cost is measured at 5.3536 ms and the communication cost at 1120 bits, substantially lower than relevant existing schemes.

关键词： Security Autonomous aerial vehicles Cryptography costs Elliptic curve cryptography Electronic mail Wireless sensor networks computational modeling Wireless communication Read only memory Unmanned aerial vehicles proxy signature hyperelliptic curve security computation cost random oracle model

来源：评论

学校读者我要写书评

暂无评论

Multi-Persona Mobility: Joint cost-Effective and Resource-Aware Mobile-Edge computation Offloading

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第3期29卷 1408-1421页

作者： Tout, Hanine Mourad, Azzam Kara, Nadjia Talhi, Chamseddine Univ Quebec Ecole Technol Super ETS Dept Software & Informat Technol Engn Montreal PQ H3C 1K3 Canada Lebanese Amer Univ Dept Comp Sci & Math Beirut 00961 Lebanon

Multi-persona mobile computing has begun to make its way to determine the battle about practical strategy for adopting personal devices in workplace. Though its competency, multi-persona performance and viability are critically threatened by the limited resources of mobile devices. In recent years, mobile edge computing (MEC) has risen as promising paradigm within the internet of things era bringing benefits to the proximity of mobile terminals, leveraging intelligent computations offloading services to address the severity of their resource scarcity. Yet, embracing mobile edge-based services to augment personas resources and performance raises new concerns including determining what computations to offload for serving the highest number of mobile devices and reducing the remote execution fees imposed on the institution. In this context, we propose new cost-effective MEC-based solution to address these issues. We develop two-level multi-objective optimization realized through an intelligent offloading decision model able to settle both concerns, by minimizing processing, memory and energy while augmenting virtual mobile instances performance on a wide range of physical devices with minimal offloading service fees. We also propose a redesigned smart genetic-based method able to accelerate and reduce the overhead of offloading decision evaluation. Extensive analysis is performed and the results show that our proposition can get more quickly the offloading strategy than other schemes. The results also demonstrate the ability to enforce the virtual mobile devices by reducing local processing, memory usage, energy consumption and execution time along with acceptable minimal additional fees compared to other techniques.

关键词： Mobile handsets Task analysis Performance evaluation Optimization Medical services Business Mobile computing boldsymbol Multi-Persona mobile computing intelligent offloading mobile edge computing multi-objective optimization resource management computation cost

来源：评论

学校读者我要写书评

暂无评论

Least-squares reverse-time migration with cost-effective computation and memory storage

引用

JOURNAL OF APPLIED GEOPHYSICS 2016年 129卷 200-208页

作者： Liu, Xuejian Liu, Yike Huang, Xiaogang Li, Peng Chinese Acad Sci Key Lab Shale Gas & Geoengn Inst Geol & Geophys Beijing 100029 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China China Natl Offshore Oil Corp Res Inst Beijing 100028 Peoples R China CNK R&D Ctr BGP Zhuozhou 072750 Hebei Peoples R China

Least-squares reverse-time migration (LSRTM), which involves several iterations of reverse-time migration (RTM) and Born modeling procedures, can provide subsurface images with better balanced amplitudes, higher resolution and fewer artifacts than standard migration. However, the same source wavefield is repetitively computed during the Born modeling and RTM procedures of different iterations. We developed a new LSRTM method with modified excitation-amplitude imaging conditions, where the source wavefield for RTM is forward propagated only once while the maximum amplitude and its excitation-time at each grid are stored. Then, the RTM procedure of different iterations only involves: (1) backward propagation of the residual between Born modeled and acquired data, and (2) implementation of the modified excitation-amplitude imaging condition by multiplying the maximum amplitude by the back propagated data residuals only at the grids that satisfy the imaging time at each time-step. For a complex model, 2 or 3 local peak-amplitudes and corresponding traveltimes should be confirmed and stored for all the grids so that multiarrival information of the source wavefield can be utilized for imaging. Numerical experiments on a three-layer and the Marmousi2 model demonstrate that the proposed LSRTM method saves huge computation and memory cost. (C) 2016 Elsevier B.V. All rights reserved.

关键词： LSRTM computation cost Memory storage Excitation-amplitude Local peak-amplitude

来源：评论

学校读者我要写书评

暂无评论

A novel trade-off between communication and computation costs for data aggregation in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2013年第4期12卷 245-253页

作者： Arastouie, N. Sabaei, M. Hakami, V. Soltanali, S. Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Iran

Wireless Sensor Networks (WSNs) consist of inexpensive low-power miniature sensing devices with severe power constraints, necessitating energy-efficient solutions for networking operations. Major prior art proposals have been primarily directed towards minimising the communication cost, either implicitly assuming away the computation overhead as being negligible, or radically trading against it. However, in computation-bound scenarios, dealing with a large volume of data, such simplifying assumptions or radical measures tend to be inefficient. In this paper, we investigate the problem of minimising the overall energy needed to send data from a set of sensor nodes to a single destination, where each node is in charge of a mission. Two types of missions are defined: sensing and decision making;while source nodes are only in charge of sensing, relay nodes can carry out both missions simultaneously. More specifically, given a node's current backlog and its latest view on the relevant portion of the data-gathering tree, taking on the decision-making mission involves deriving an online trade-off between energy costs of compression and communication, and deciding between sending data either in the raw mode or alternatively compressed with a feasible optimal compression ratio. The used data compression technique depends on the type of application and the spatiotemporal correlation in the packets. Simulation experiments reveal that, compared with previous methods, the proposed scheme exhibits superior energy efficiency with an additional 36% reduction of the costs.

关键词： sensor network energy consumption computation cost aggregation

来源：评论

学校读者我要写书评

暂无评论

Fast computation of Zernike moments in polar coordinates

引用

IET IMAGE PROCESSING 2012年第7期6卷 996-1004页

作者： Liu, C. Huang, X. -H. Wang, M. Huazhong Univ Sci & Technol Key Lab Image Proc & Intelligent Control Minist Educ China Dept Control Sci & Engn Wuhan 430074 Hubei Peoples R China

Zernike moments (ZMs) are widely used in many image analysis and pattern recognition problems because of their superiority compared with other moments. However, they suffer from high computation cost and inherent error. Previous researches have shown that the algorithm, computing ZMs in polar system, improves the ZMs accuracy of the reconstruction and invariance properties dramatically. In this study, the authors firstly modify a direct method for computing ZMs in polar coordinates and present a recursive relation. Then, this study presents an algorithm for fast computation of ZMs, based on the improved polar pixel tiling scheme. Owing to the symmetrical property, ZMs can be obtained by computing only one-sixteenth circle of the radial polynomials, which means that the number of pixels involved in the computation of ZMs is only 6.25% of the previous method. This leads to a significant reduction in the computational complexity requirements. A comparison with the other conventional method is performed in detail. The obtained results show the superiority of the proposed method.

关键词： polar pixel tiling scheme image analysis image reconstruction polar coordinates inherent error Computer vision and image processing techniques reconstruction computational complexity pattern recognition Zernike polynomials invariance properties Interpolation and function approximation (numerical analysis) Optical, image and video signal processing Zernike moments computation cost radial polynomials

来源：评论

学校读者我要写书评

暂无评论

Joint Service Caching, computation Offloading and Resource Allocation in Mobile Edge Computing Systems

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第8期20卷 5288-5300页

作者： Zhang, Guanglin Zhang, Shun Zhang, Wenqian Shen, Zhirong Wang, Lin Donghua Univ Minist Educ Coll Informat Sci & Technol Engn Res Ctr Digitized Text & Apparel Technol Shanghai 201620 Peoples R China Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China

Mobile Edge Computing (MEC) brings abundant cloud resources to the edge of the network and provides great opportunities to improve user's quality of experience. While many recent studies have investigated the problem of computation offloading, service caching is also an important design topic of MEC. Service caching stores application-related databases or libraries in advance and enables corresponding user tasks to be offloaded. Due to the limited resources in the edge server, service caching decisions have to be made judiciously to maximize the system performance. In this paper, we study the problem of joint service caching, computation offloading, transmission and computing resource allocation in a general scenario of multiple users with multiple tasks. We aim to minimize the overall computation and delay costs for all users and formulate the optimization problem as a quadratically constrained quadratic program (QCQP) which is non-convex and NP-hard. To solve this challenging problem, we propose an efficiently approximate algorithm based on semidefinite relaxation (SDR) approach and alternating optimization which always computes a locally optimal solution. Moreover, we extend the study to the scenario where each user has a computation cost constraint. Simulation results show that our algorithm can minimize the system cost effectively by utilizing the available system resources.

关键词： Task analysis Resource management Servers Quality of experience Delays computational modeling Approximation algorithms Mobile edge computing service caching computation offloading resource allocation computation cost delay cost

来源：评论

学校读者我要写书评

暂无评论

Fast RFID Sensory Data Collection: Trade-off Between computation and Communication costs

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2019年第3期27卷 1179-1191页

作者： Liu, Xiulong Cao, Jiannong Yang, Yanni Qu, Wenyu Zhao, Xibin Li, Keqiu Yao, Didi Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Tianjin Univ Coll Intelligence & Comp Tianjin 300011 Peoples R China Tsinghua Univ Sch Software Key Lab Informat Syst Secur Minist EducTsinghua Natl Lab Informat Sci & Tech Beijing 100091 Peoples R China Alibaba Co Ltd Hangzhou 310000 Zhejiang Peoples R China

This paper studies the important sensory data collection problem in the sensor-augmented RFID systems, which is to quickly and accurately collect sensory data from a predefined set of target tags with the coexistence of unexpected tags. The existing RFID data collection schemes suffer from either low time-efficiency due to tag-collisions or serious data corruption issue due to interference of unexpected tags. To overcome these limitations, we propose the hierarchical-hashing data collection (HDC) protocol, which can not only significantly improve the utilization of RFID wireless communication channel by establishing bijective mapping between k target tags and the first k slots in time frame, but also effectively filter out the serious interference of unexpected tags. Although HDC has attractive advantages, the theoretical analysis reveals that the computation cost involved in it is as huge as O(k2(k)), where k is normally large in practice. By making some modifications to the basic HDC protocol, we propose the multi-framed hierarchical-hashing data collection (MHDC) protocol to effectively reduce the involved computation complexity. Unlike HDC that only issues a single time frame, MHDC uses multiple time frames to collaboratively collect sensory data from the k target tags. It can be understood as that a big computation task is disintegrated into multiple small pieces and then shared by multiple time frames. As a result, the computation cost involved in MHDC is reduced to O(k2(n)), where n << k is the expected number of target tags that each time frame handles. Theoretical analysis is given to jointly consider the communication cost and computation cost thereby maximizing the overall time-efficiency of MHDC. Extensive simulation results reveal that the proposed MHDC protocol can correctly collect all sensory data and is always about more than 2x faster than the state-of-the-art RFID sensory data collection protocols.

关键词： RFID sensory data collection seed-searching computation cost communication cost

来源：评论

学校读者我要写书评

暂无评论

Efficient identity-based blind message recovery signature scheme from pairings

引用

IET INFORMATION SECURITY 2018年第2期12卷 150-156页

作者： Verma, Girraj Kumar Singh, B. B. Hindustan Coll Sci & Technol Farah Mathura India Govt KRG PG Coll Gwalior India

Blind signature (BS) schemes are a vital tool to design electronic cash (e-cash), online transaction, electronic voting (e-voting), digital right management (DRM) systems etc. The communication systems designed for such applications need small size and more confidential signature schemes. This article presents the first provably secure and efficient identity-based message recovery BS scheme from pairing. Since, in this scheme, the message is not transmitted with signature and recovered during verification phase, the total message-signature length is the lowest. Due to the blindness, the scheme provides authentication along with anonymity. The performance comparison shows that the authors' scheme consumes the lowest computation cost. Thus, it inspires the energy efficient (green) technology as well as is the most appealing BS scheme towards applications such as e-cash, e-voting, DRM systems etc. using low bandwidth and high security.

关键词： digital signatures electronic money government data processing digital rights management formal verification green computing energy conservation pairings BS scheme green technology energy efficient technology computation cost performance comparison total message-signature length verification phase communication systems DRM digital right management systems e-voting electronic voting online transaction e-cash electronic cash efficient identity-based blind message recovery signature scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：