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

International Conference on Networking and Network Applications (NaNA)

作者： Xu Zhang Naijie Gu Junjie Su Kaixin Ren Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Due to the conservative additive increase and multiplicative decrease strategy, traditional TCP has a severe problem in utilizing bandwidth over high-speed long-distance networks. This paper proposes a delay-based congestion control algorithm, named DFTCP, for these networks. DFTCP calculates a reasonable equilibrium point for a network flow based on the estimation of the maximum size of available buffers along its network path, and adjusts the congestion window size according to the distance between the equilibrium point and the current network state. The experimental results demonstrate that, the new algorithm performs well in terms of bandwidth utilization, intra-protocol fairness and RTT fairness, and exhibits reasonable friendliness to standard TCP.

关键词： Delays Standards Packet loss Throughput Bandwidth Convergence

来源：评论

学校读者我要写书评

暂无评论

The Learning-Bargaining Algorithm Used in Unlicensed Spectrum Pre-Allocation

The Learning-Bargaining Algorithm Used in Unlicensed Spectru...

引用

第三届IEEE无线通讯、网络技术暨移动计算国际会议

作者： Kun Han Jinlong Li Ping Zhu Xufa Wang Anhui Province Key Laboratory of Software in Computing and Communication Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China

In the wireless network of finite spectrum resource, some communication users probably do not allocate the spectrum so that their communication should be delayed. Thus it is necessary to arrange the communication time of the systems when we allocate the communication spectrum. We propose a games learning-bargaining algorithm to pre-allocate the communication resources in the frequency-time space. Through this distributed games learning, each user obtains its communication schedule, and the result of allocation is further improved by the bargaining process. The result of this algorithm makes the bandwidth utilization achieve a quite high level and arranges the global communication time as short as possible. Comparing with the centralized algorithm of NP-hard, this distributed algorithm has low time complexity. The experiments verify the convergence of the algorithm and present the superiorities of our results to other allocation algorithms.

关键词： Cognitive Radio Spectrum Allocation Game Theory Learning-Bargaining Time Complexity.

来源：评论

学校读者我要写书评

暂无评论

A real-time schedule method for aircraft landing scheduling problem based on cellular automaton 09

A real-time schedule method for aircraft landing scheduling ...

引用

2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

作者： Shenpeng, Yu Xianbin, Cao Maobin, Hu Wenbo, Du Jun, Zhang Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 86-551-3601545 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China School of Engineering Science University of Science and Technology of China Hefei 230026 86-551-3600127 China School of Electronic and Information Engineering Beihang University Beijing 100083 China

ISBN: (纸本)9781605583266

The Aircraft Landing Scheduling (ALS) problem is a typical hard multi-constraint optimization problem. In real applications, it is not most important to find the best solution but to provide a feasible landing schedule in an acceptable time. We propose a novel approach which can effectively solve the ALS while satisfying the real-time need. It consists of two steps: (i) Use CA to simulate the landing process in the terminal airspace and to find a considerably good landing sequence;(ii) a simple Genetic Algorithm associated with a Relaxation Operator is used to obtain a better result based on the CA result. Experiments have shown that our method is much faster and suitable for real-time ALS problem compared with traditional optimization methods. For all the 13 data sets, the proposed approach can find satisfactory solutions in less than 2 seconds. Copyright 2009 ACM.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Reversible data hiding in encrypted images with Two-MSB prediction 10

Reversible data hiding in encrypted images with Two-MSB pred...

引用

10th IEEE International Workshop on Information Forensics and Security, WIFS 2018

作者： Puyang, Yi Yin, Zhaoxia Qian, Zhenxing Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University Hefei230601 China Department of Computer Science Purdue University West lafayette47906 United States Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200072 China

ISBN: (纸本)9781538665367

In recent years, reversible data hiding in encrypted images (RDHEI) that embeds additional data into the encrypted image content has received more and more attention. In previous RDHEI methods, there is no one considering the correlation between neighboring pixels. In this paper, to better explore the correlation between neighbor pixels, a novel reversible data hiding method in encrypted images with two-MSB (MSB and second MSB) prediction is proposed. After analyzing the original image content and detecting all the possible prediction errors, we encrypt the original image content using the bitwise exclusive-or (XOR) operation and highlight prediction error based on the error location binary map. Finally, all available pixels are embedded with additional data by two-MSB substitution. In our method, reversibility, separability and error-free data extraction are realized. The experimental results show that the proposed method providing a higher embedding rate and better quality of directly decrypted image compared with other start-of-the-art methods. © 2018 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Coverage Based Node Scheduling Scheme for Wireless Sensor Networks

An Energy-Aware Coverage Based Node Scheduling Scheme for Wi...

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Jinxia Liu Naijie Gu Songsong He Dept. of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei Anhui 230027 China

A fundamental issue in wireless sensor network is to extend network lifetime while maintaining network coverage and connectivity. Protection for sensors themselves is another important concern. An Energyaware Coverage based Node Scheduling scheme (ECNS) is proposed to provide protection for sensors and guarantees network connectivity and desired coverage level. ECNS enables each node to decide whether it is eligible to turn off to conserve energy through local information exchange with its neighbors. Simulation results show that ECNS improves network performance with respect to energy conservation, load balance and network lifetime.

关键词： Sensor network coverage network connectivity lifetime node scheduling scheme.

来源：评论

学校读者我要写书评

暂无评论

Operator Placement for IoT Data Streaming Applications in Edge computing Environment 22nd

Operator Placement for IoT Data Streaming Applications in ...

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Chen, Sixin Tang, Bing Yang, Qing Liu, Yuanyuan School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411201 China Hunan Key Laboratory for Service Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan411201 China School of Information and Communication Engineering Guangzhou Maritime University Guangzhou510725 China

ISBN: (纸本)9783031226762

With the rapid development of IoT applications, how to process large and continuous data streams in real time for IoT applications has become a challenge in recent years. This paper presents a model to predict the Maximum Sustainable Throughput (MST) of data streaming applications at the edge, and then proposes GACP, a constraint programming-base operator placement strategy to maximize MST using the genetic algorithm. We evaluated the proposed operator placement strategy in terms of MST, the number of edge servers in usage, and the percentage of communications within edge servers. Experimental results show that compared with the existing heuristic algorithms, the proposed GACP strategy can achieve better MST, which is 2–5 times higher than existing algorithms. © 2023, Springer Nature Switzerland AG.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Extending CDFR for Overlapping Community Detection

Extending CDFR for Overlapping Community Detection

引用

International Conference on Data Intelligence and Security (ICDIS)

作者： Nannan Lu Wenjian Luo Li Ni Hao Jiang Weiping Ding Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei China Centre for Artificial Intelligence University of Technology Sydney Broadway NSW Australia

ISBN: (纸本)9781538657638

In many real-world networks, a node often belongs to multiple communities. Therefore, overlapping community detection is an important task in social network analysis. CDFR is an efficient algorithm recently proposed for non-overlapping community detection. In this paper, CDFR is extended for overlapping community detection, and the extended algorithm is called as OCDFR. In OCDFR, CDFR is first called to obtain a non-overlapping community partition. Then, find the kth NGC (k=1, 2, 3,...) node for each node, and record the fuzzy relations between them. Based on the fuzzy relation between a node and its kth NGC, five decision methods are proposed to determine whether it can join the communities to which its kth NGC belongs. Experimental results on real-world networks and synthetic networks demonstrate that OCDFR is effective and highly competitive.

关键词： Heuristic algorithms Social network services Partitioning algorithms Clustering algorithms Nickel Complex networks Security

来源：评论

学校读者我要写书评

暂无评论

Extended Doo-Sabin surfaces

引用

Journal of Information and Computational Science 2011年第12期8卷 2239-2247页

作者： Huang, Zhangjin Wang, Feng Wang, Guoping School of Computer Science and Technology University of Science and Technology of China China Key Laboratory of Software in Computing and Communication Anhui Province China USTC-SICT Joint Laboratory on Network and Communication China Peking University China School of Electronic Engineering and Computer Science Peking University China

In this paper we propose a modification of quadratic NURSSes called EDSes (Extended Doo-Sabin Surfaces). EDSes inherit the refinement rules for quadratic NURSSes for four-sided faces but use the refinement rules for Doo-Sabin surfaces for faces with other than four sides. Compared to quadratic NURSSes, if all the knot intervals are positive, EDSes always converge to G1 continuous limit surfaces with closed-form limit point as well as limit normal rules. 1548-7741/Copyright © 2011 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Group Signatures with Decentralized Tracing 15th

Group Signatures with Decentralized Tracing

引用

15th International Conference on Information Security and Cryptology, Inscrypt 2019

作者： Lu, Tingting Li, Jiangtao Zhang, Lei Lam, Kwok-Yan Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China State Key Laboratory of Cryptology P.O. Box 5159 Beijing China Shanghai Institute for Advanced Communication and Data Science Shanghai China School of Computer Engineering and Science Shanghai University Shanghai China Nanyang Technological University Singapore Singapore

ISBN: (纸本)9783030429201

Group signature is a useful cryptographic primitive that allows a message to be signed by a user on behalf of a group which is managed by some trusted authority, namely the group manager. However, group signature schemes typically place a disturbingly high level of trust on the group manager, which has become a major deployment issue in cyber applications where there is no centralized trust management. In this paper, we investigate mechanisms that aim to achieve a balance between anonymity and accountability in group signatures by decentralizing the operation of tracing the signer. We propose a practical group signature scheme with decentralized tracing. When comparing with a similar result by Benjumea et al. (FC 2008), our proposal has the advantage of a shorter signature size. © 2020, Springer Nature Switzerland AG.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

Social sensing enhanced time estimation for bus service

引用

作者： Liu, Jin Li, Juan Cui, Xiaohui Niu, Xiaoguang Sun, Xiaoping Zhou, Jing State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEAs and road condition attributions PRCAs. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEAs of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. © 2015 John Wiley & Sons, Ltd.

关键词： Buses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：