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

International Conference on Communications, Signal Processing, and systems, CSPS 2018

作者： Lu, Wei-feng Lin, Wei-jun Chen, Si-guang Yang, Li-jun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China College of IoT Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789811362637

Aiming at mode selection in D2D communication, a mode selection strategy based on social-aware was proposed. In addition to physical connection status, users’ social relationships also served as an observation element. Through relationship between users, the closeness of user relationship can be judged, and then through users’ reference, the similarity between users can be obtained. In this way, by combining physical connection with social relationships, users’ aggregate utility was acquired. According to the physical connection quality and the social relationship strength, taking maximizing users’ aggregate utility as the goal, a random algorithm was designed to match users. Simulation results show that mode selection based on social perception can effectively improve users’ aggregate utility. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Improving the Efficiency of Blockchain Applications with Smart Contract based Cyber-insurance

Improving the Efficiency of Blockchain Applications with Sma...

引用

IEEE International Conference on Communications (ICC)

作者： Jia Xu Yongqi Wu Xiapu Luo Dejun Yang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Department of Computing The Hong Kong Polytechnic University Hongkong China Department of Computer Science Colorado School of Mines Golden USA

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Blockchain based applications benefit from decentralization, data privacy, and anonymity. However, they may suffer from inefficiency due to underlying blockchain. In this paper, we aim to address this limitation while still enjoying the privacy and anonymity. Taking the blockchain based crowdsourcing system as an example, we propose a new smart contract based cyber-insurance framework, which can greatly shorten the delay, and enable the workers to obtain the economic compensation for increased security risk caused by a conflict between the need to provide service quickly and delay in payment. We model the process of determining insurance premium and number of confirmations as a Stackelberg Game and prove the existence of Stackelberg Equilibria, at which the utility of the requester is maximized, and none of the workers can improve its utility by unilaterally deviating from its current strategy. The experimental results show that our framework can definitely improve the time efficiency of crowdsourcing. Particularly, it takes on average only 33% of the time required by the naive blockchain based crowdsouring solution for time-sensitive cases.

关键词： Contracts Crowdsourcing Task analysis Insurance Bitcoin

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Power Prediction for data Center Operations via Long Short-Term Memory Network

Multi-Granularity Power Prediction for Data Center Operation...

引用

IEEE International Conference on Big data and Cloud Computing (BdCloud)

作者： Ziyu Shen Xusheng Zhang Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

The increasing numbers of the applications and requirement of cloud computing have made huge power consumption in data centers, which brings the problems of the high cost and resource waste. This problem attracts significant attention from academia and industry. A critical approach to solve this problem is constructing an intelligent energy management system for data centers. Furthermore, an efficient assessment and prediction module of power consumption in data centers is an essential part of the management system. It facilitates cloud service providers to perform workflow scheduling at the minimal cost and energy efficiency management with the requirement of QoS. Since the assessment and prediction of power consumption correlate, this paper presents a multi-granularity approach for power consumption prediction in data centers, which combines multi-task learning with the LSTM network. We first transfer a multi-granularity power prediction problem into a multi-task regression problem to assess and predict the power consumption of data center system maintenance and scheduling operations. Due to the time requirement for workflow and container scheduling, the prediction interval is 30 seconds. Then we propose an efficient long short-term memory network for the multigranularity prediction. The experimental results show our model outperforms other prediction models on the real datasets.

关键词： Power demand data centers Task analysis Predictive models data models Time series analysis Servers

来源：评论

学校读者我要写书评

暂无评论

Community-based Message Forwarding in Mobile Social Networks

Community-based Message Forwarding in Mobile Social Networks

引用

作者： Zhiming Chen Yang Xiang School of Computer Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing

With the popularity of various smart devices and the application of sensor network technology, message transmission using mobile devices is becoming *** paper focuses on the forwarding in mobile social network(MSN).The MSN is a special Delay Tolerant Network(DTN) consisting of mobile *** MSN, nodes move and share information with each other through carried short-range wireless communication *** nodes in the MSN typically access some building areas more frequently, such as schools, companies, or apartments, while visiting other areas, such as the roads between buildings, less *** building areas that nodes frequently visit are called *** increase delivery ratio and reduce transmission time in MSN, this paper proposes a novel zero-knowledge multi-copy routing algorithm, Mixed Message Forwarding(MMF) which exploits and improves the metric, namely *** reflects the importance of a node in the *** improves copy diffusion by using different directions of node movement as *** facilities called boundary boxes are added to the network *** boxes are special throw *** boxes are relays with large storage space and fixed *** is designed and evaluated, which utilizes the aforementioned boundary boxes to reduce transmission *** simulation results show that the MMF can improve the delivery ratio and reduce the transmission delay, compared with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure and Privacy-preserving data-sharing Framework based on Blockchain Technology for Al-Najaf/Iraq Oil Refinery

Secure and Privacy-preserving Data-sharing Framework based o...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Samir M. Umran SongFeng Lu Zaid Ameen Abduljabbar Zhi Lu Bingyan Feng Lu Zheng 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 Wuhan China Ministry of Industry and Minerals Iraqi Cement State Company Baghdad Iraq Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China College of Education for Pure Sciences University of Basrah Technical Computer Engineering Department Al-Kunooze University College Basrah Iraq School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Wuhan Huazhong Numerical Control Co. Ltd Industrial Internet Research Institute Wuhan China College of Computer Science South-Central University for Nationalities Wuhan China

The Industrial Internet of Things or Industry 4.0 efficiently enhances the manufacturing process in terms of raising productivity, system performance, cost reduction, and building large-scale systems. It enables the connection of numerous heterogeneous devices and sensors into the internet network through the utilization of revolutionary techniques that transfer the manufacturing paradigm to intelligent processes. The traditional industrial internet of things adopts centralized architectures and complex encryption algorithms that suffer from several cyber-security threats and lead to data leakage, privacy disclosure, and high computational and communicational costs. In our work, we proposed a decentralized, efficient, low-power, scalable, secure, privacy-preserving, and trusting architecture based on a private blockchain network/smart contract and interplanetary file system technology for the Al-NajafyIraq oil refinery factory. That enables autonomous working and provides a high level of security authentication and privacy preservation, P2P communication, remote access, immutability and information backtracking. Traditional blockchain technology has storage limitation issues, most recent works adopted external servers or the cloud for storage purposes. Our proposed scheme addresses the limitations of blockchain data storage by adopting an interplanetary file system (IPFS) network; provides an efficient data encryption mechanism at the perceptual layer by adopting a lightweight encryption algorithm, high-performance, and ultra-low-power consumption ARM Cortex-M microcontroller. In addition, our architecture succeeds in merging blockchain technology, IoTs, and an IPFS with the oil refinery as an industrial application area. Moreover, it provides an efficient framework that resists common cyber-security attacks and realizes cyber-security requirements represented by data availability, integrity, and confidentiality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Hot Topics Discovery Based on Short Texts of Online Reviews 5

Research on Hot Topics Discovery Based on Short Texts of Onl...

引用

5th Annual International Conference on Network and Information systems for Computers, ICNISC 2019

作者： Liu, Zhenyan Qiu, Yueshi Zhang, Zhe Mao, Limin Zheng, Xiaohan Beijing Key Laboratory of Software Security Engineering Technology School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China Academy of Intelligent Collaborative Cloud System China Aerospace Science and Industry Corporation Limited Beijing100048 China

The two crucial issues for hot topics discovery based on online reviews are that the sparsity of short text features and the "long tail" phenomenon of hot topics. This paper focuses on these two key issues, and proposes an improved similarity calculation method to calculate the similarity of short texts, and a novel clustering algorithm based on the time factor and dynamic adjustment of comparison times to automatically discard a large number of outliers. Moreover, the validity and advancement of the new method are presented by comparative experiments using real data sets. © Published under licence by IOP Publishing Ltd.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Consistent and Complementary Graph Regularized Multi-view Subspace Clustering

arXiv

引用

arXiv 2020年

作者： Zheng, Qinghai Zhu, Jihua Li, Zhongyu Pang, Shanmin Wang, Jun Chen, Lei School of Software Engineering Xi’an Jiaotong University Xi’an710049 China Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. Exploration of all information is crucial for good multi-view clustering. However, most traditional methods blindly or crudely combine multiple views for clustering and are unable to fully exploit the valuable information. Therefore, we propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC), which simultaneously integrates a consistent graph regularizer with a complementary graph regularizer into the objective function. In particular, the consistent graph regularizer learns the intrinsic affinity relationship of data points shared by all views. The complementary graph regularizer investigates the specific information of multiple views. It is noteworthy that the consistent and complementary regularizers are formulated by two different graphs constructed from the first-order proximity and second-order proximity of multiple views, respectively. The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering. Extensive experiments on six benchmark datasets serve to validate the effectiveness of the proposed method over other state-of-the-art multi-view clustering methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Localization of Deep Inpainting Using High-Pass Fully Convolutional Network

Localization of Deep Inpainting Using High-Pass Fully Convol...

引用

International Conference on Computer Vision (ICCV)

作者： Haodong Li Jiwu Huang Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Image inpainting has been substantially improved with deep learning in the past years. Deep inpainting can fill image regions with plausible contents, which are not visually apparent. Although inpainting is originally designed to repair images, it can even be used for malicious manipulations, e.g., removal of specific objects. Therefore, it is necessary to identify the presence of inpainting in an image. This paper presents a method to locate the regions manipulated by deep inpainting. The proposed method employs a fully convolutional network that is based on high-pass filtered image residuals. Firstly, we analyze and observe that the inpainted regions are more distinguishable from the untouched ones in the residual domain. Hence, a high-pass pre-filtering module is designed to get image residuals for enhancing inpainting traces. Then, a feature extraction module, which learns discriminative features from image residuals, is built with four concatenated ResNet blocks. The learned feature maps are finally enlarged by an up-sampling module, so that a pixel-wise inpainting localization map is obtained. The whole network is trained end-to-end with a loss addressing the class imbalance. Extensive experimental results evaluated on both synthetic and realistic images subjected to deep inpainting have shown the effectiveness of the proposed method.

关键词： Forensics Feature extraction Convolution Kernel Machine learning Computer vision Probability

来源：评论

学校读者我要写书评

暂无评论

Downscaling multilayer soil moisture using parameterized depth profiles associated with environmental factors

引用

Journal of Hydrology 2025年 661卷

作者： Zhang, Mo Ge, Yong Ma, Yuxin Jin, Yan Chen, Yingying Liu, Shaomin State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing100101 China College of Resources and Environment University of Chinese Academy of Sciences Beijing100101 China Key Laboratory of Poyang Lake Wetland and Watershed Research Ministry of Education Jiangxi Normal University Nanchang330022 China Jiangxi Provincial Key Laboratory of Ecological Intelligent Monitoring and Comprehensive Treatment of Watershed School of Geography and Environment Jiangxi Normal University Nanchang330022 China New South Wales Department of Climate Change Energy the Environment and Water ParramattaNSW2150 Australia School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China National Tibetan Plateau Data Center State Key Laboratory of Tibetan Plateau Earth System Environment and Resources Institute of Tibetan Plateau Research Chinese Academy of Sciences Beijing100101 China State Key Laboratory of Earth Surface Processes and Hazards Risk Governance Beijing Normal University Beijing100875 China

High-resolution multilayer soil moisture is valuable for water resources management, drought monitoring, and crop optimization. However, integrating process-based models into statistical downscaling methods to estimate multilayer soil moisture can increase both prediction uncertainty and computational complexity of parameterization. Here, three parameterized equations (Peak, Trough, and Balance) were proposed to quantify soil moisture profiles associated with environmental factors, and downscale multilayer soil moisture. Global (0–40 cm) and local (0–10, 10–20, and 20–40 cm) fitting strategies represented the vertical extent of environmental influences. Three machine learning models were employed to downscale satellite soil moisture and predict depth parameters, which were then used to generate sub-surface soil moisture. The results indicated that the local fitting strategy consistently outperformed the global strategy across all depths, reducing the mean absolute error (MAE) and root mean square error (RMSE) by 81.8 % and 80.4 %, and increasing the coefficient of determination (R2) by 22.5 %. Furthermore, local fitting revealed distinct nonlinear and linear patterns within the 0–20 cm and 20–40 cm intervals, respectively. The prediction accuracy of sub-surface soil moisture was improved compared to surface results, with MAE and RMSE reduced by 30.2 %–60.7 % and 34.9 %–56.7 %, respectively. The modified local fitting strategy further enhanced prediction performance, with the Peak–Trough–Balance combination recommended as the optimal configuration. Future studies should account for variations in soil and vegetation cover, refine interval division by incorporating soil-forming processes, and adopt advanced uncertainty quantification methods to enhance its adaptability and robustness. This study provides a reference for multilayer soil moisture downscaling in large-scale regions with depth variability and environmental heterogeneity. © 2025 Elsevier B.V.

关键词： Soil moisture

来源：评论

学校读者我要写书评

暂无评论

Throughput Maximization for UAV-Enabled data Collection

Throughput Maximization for UAV-Enabled Data Collection

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Junchao Gong Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China

ISBN: (数字)9781728199160

ISBN: (纸本)9781728192369

In this paper, we consider a scenario where an unmanned aerial vehicle (UAV) collects data from a set of nodes placed on a two-dimensional (2-D) plane. The UAV flies along a given line to collect data. To prevent transmission collisions, only one node is allowed to transmit data to the UAV at any time, and the number of nodes that can transmit data to the UAV cannot exceed a specified number to avoid frequent switches. The problem is to select a subset of nodes and schedule their transmission time to maximize the UAV's throughput. After formulating the problem, we find that it is difficult to solve due to mixture of real variables and integer variables. We then propose to decompose the problem into subproblems, and give a polynomial time algorithm to solve each subproblem to optimality. We then get an exact algorithm by solving all subproblems. Unfortunately, due to an exponential number of subproblems, the overall running time is exponential with respect to the input size. We then propose two polynomial-time suboptimal algorithms to solve the problem, both of which explore a polynomial number of subproblems. Simulations show that the suboptimal algorithms perform comparably with the exponential-time exact algorithm, while the running time is much smaller.

关键词： Schedules Heuristic algorithms Two dimensional displays data collection Throughput Unmanned aerial vehicles Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：