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

2nd IEEE International Conference on Computer and Communications (ICCC)

作者： Cai Liangwei Yi Haoping Shenzhen Univ Coll Informat Engn Shenzhen Peoples R China

ISBN: (纸本)9781467390262

An optimization method based on improved shuffled frog leaping algorithm (ISFLA) is proposed to solve pattern matching problem of regular expression grouping. The algorithm uses improved individual renewal formula and introduces population update strategy to optimize regular expression grouping combining with Becchi algorithm. It is shown by the experimental results that the proposed algorithm can search for better solution in a global scope, decrease the number of state effectively, diminish the complexity of pattern matching and has a higher search and optimize capability.

关键词： intelligent computationt regular expression SFLA network security grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

grouping-Based Consistency Protocol Design for End-Edge-Cloud Hierarchical Storage System

引用

IEEE ACCESS 2020年 8卷 8959-8973页

作者： Gu, Shushi Wang, Yizhen Wang, Ye Zhang, Qinyu Qin, Xue Harbin Inst Technol Shenzhen Sch Elect & Informat Engn Shenzhen 518055 Peoples R China Peng Cheng Lab Shenzhen 518052 Peoples R China Texas A&M Univ Corpus Christi Dept Comp Sci Corpus Christi TX 78412 USA

With the increasing of the number of edge-devices and the demand of real-time experience, the end-edge-cloud hierarchical storage system (EECHSS) is emerged recently for reliable caching and fast offloading of massive amounts of data. EECHSS can accommodate various services, save computing power and improve storage capacity, due to transformation from central-cloud to edge-cloud, considerable reducing service delay and communication overhead. One of the main challenges brought by edge-cloud architecture is consistency problem. It is difficult to guarantee that the data from the two distributed clusters is consistent by existing consistency protocols. In addition, as the variety of applications increases, the existing fixed consistency level of classical protocols can no longer satisfy the system dynamic requirements. In this paper, we focus on designing grouping-based consistency protocols with adaptively selecting consistency level in EECHSS. At first, we analyze the internal structure and the workflow of EECHSS, and devise two modified adaptive grouping-based consistency protocols (GM-Paxos and GEPaxos) with efficient grouping algorithms. Then, for the characteristics that data is offloaded frequently, we design two synchronization strategies to ensure the consistency of the data cached in the edge-cloud and the central-cloud, respectively. Experiments show that, our proposed grouping-based consistency protocols of EECHSS can improve the availability as much as possible while ensuring data consistent.

关键词： End-edge-cloud hierarchical storage system adaptive consistency grouping algorithm synchronization strategy

来源：评论

学校读者我要写书评

暂无评论

A grouping method based on grid density and relationship for crowd evacuation simulation

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2017年 473卷 319-336页

作者： Li, Yan Liu, Hong Liu, Guang-Peng Li, Liang Moore, Philip Hu, Bin Shandong Normal Univ Sch Informat Sci & Engn 88 Wenhua East Rd Jinan Peoples R China Shandong Prov Key Lab Novel Distributed Comp Soft Jinan Peoples R China Lanzhou Univ Sch Informat Sci & Engn Lanzhou Peoples R China

Psychological factors affect the movement of people in the competitive or panic mode of evacuation, in which the density of pedestrians is relatively large and the distance among them is small. In this paper, a crowd is divided into groups according to their social relations to simulate the actual movement of crowd evacuation more realistically and increase the attractiveness of the group based on social force model. The force of group attraction is the synthesis of two forces;one is the attraction of the individuals generated by their social relations to gather, and the other is that of the group leader to the individuals within the group to ensure that the individuals follow the leader. The synthetic force determines the trajectory of individuals. The evacuation process is demonstrated using the improved social force model. In the improved social force model, the individuals with close social relations gradually present a closer and coordinated action while following the leader. In this paper, a grouping algorithm is proposed based on grid density and relationship via computer simulation to illustrate the features of the improved social force model. The definition of the parameters involved in the algorithm is given, and the effect of relational value on the grouping is tested. Reasonable numbers of grids and weights are selected. The effectiveness of the algorithm is shown through simulation experiments. A simulation platform is also established using the proposed grouping algorithm and the improved social force model for crowd evacuation simulation. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Crowd evacuation Social force model Computer simulation grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

CCECGP: causal consistency model of edge-cloud collaborative based on grouping protocol

引用

JOURNAL OF SUPERCOMPUTING 2023年第8期79卷 8401-8424页

作者： Tian, Junfeng Jia, Haoyi Bai, Wenqing Hebei Univ Sch Cyber Secur & Comp Baoding 071000 Peoples R China Hebei Univ Hebei Key Lab High Confidence Informat Syst Baoding 071000 Peoples R China

At present, most causal consistency models based on cloud storage can no longer meet the needs of delay-sensitive applications. Moreover, the overhead of data synchronization between replicas is too high. This paper proposes a causal consistency model of edge-cloud collaborative based on grouping protocol. The model is based on the edge-cloud collaboration architecture, partitions cloud data centers and groups edge nodes by distributed hash tables, and stores a subset of the complete data set in nodes located at the edge of the network, thereby realizing partial geo-replication in edge-cloud collaboration environment. At the same time, we design a group synchronization algorithm called Imp_Paxos, so that the update only needs to be synchronized to the main group, which reduces the visibility delay of the update and decreases the data synchronization overhead. Besides, a sort timestamp is proposed in this paper, which generates different timestamps according to the type of update to track causality, keeping the amount of metadata managed in a relatively stable and low state. Therefore, the proposed model reduces the overhead of metadata for system management and improves throughput quantity of system. Experiments show that our model performs well in terms of throughput, operation latency, and update visibility latency compared with existing causal consistency models.

关键词： Causal consistency Edge-cloud collaborative Distributed hash table Sort timestamp grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

Collision chain mitigation and hidden device-aware grouping in large-scale IEEE 802.11ah networks

引用

COMPUTER NETWORKS 2016年 108卷 296-306页

作者： Damayanti, Wayan Kim, Sanghyun Yun, Ji-Hoon PT Telekomunikasi Indonesia Int Jakarta Indonesia Seoul Natl Univ Sci & Technol Dept Elect & Informat Engn Seoul South Korea

A new IEEE standard for large-scale wireless connectivity in IoT and M2M applications, called IEEE 802.11ah, has recently been introduced. A single access point (AP) of 802.11ah can provide connectivity to a large number of devices (up to 8192) with the communication range of up to 1 km. Due to such a large coverage area with a large number of connected devices, however, the hidden node problem of 802.11ah networks is severer than typical Wi-Fi networks. Especially, we observe that frequent occurrences of a collision chain results in significant deterioration of network performance even with the group-based access restriction mechanism of 802.11ah. To solve this problem, we propose a collision chain mitigation scheme that detects and interrupts a collision chain, lets a smaller number of devices contend thereafter and also provide the information from which a carrier-sensitivity table is constructed by AR Although the proposed scheme mitigates performance deterioration due to a collision chain when occurred, collision chains still occur. So, we propose a grouping algorithm which can perform both initial grouping and regrouping from existing groups based on the carrier-sensitivity table constructed by the mitigation scheme so that only a negligible number of hidden devices remain in each group and the root cause of collision chain is obviated. Our simulation study shows that the mitigation scheme alone makes network throughput comparable to the case of no hidden devices and its combination with the grouping algorithm improves throughput performance over the 8-group case of the conventional mechanism by up to 146%. (C) 2016 Elsevier B.V. All rights reserved.

关键词： IEEE 802.11ah Hidden node problem Collision grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

A Literature Review of grouping Solutions in Collaborative Learning 6

A Literature Review of Grouping Solutions in Collaborative L...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Ge, Zigang Qi, Zihuan Yang, Lihua Beijing Univ Posts & Telecommun Sch Network Educ Beijing Peoples R China Chinas Minist Educ Dev Strategies High Level Spec Res Ctr Beijing Peoples R China

ISBN: (纸本)9781538676721

The present study reviews the literature on the topic of collaborative group formation, with the aim to construct a group formation model in Collaborative Learning. The study examines 8 papers about the formation of collaborative learning groups published in SSCI-indexed journals from 2006 to 2017 from aspects of grouping criteria, group types, grouping algorithm, grouping adaptability and grouping evaluation. The review has the following findings: 1) All of these papers have taken learners' personal information and learning behaviors as grouping criteria, but few of them examine context information;2) Most of them focus on one of the two group types, namely heterogeneous group and homogeneous group;3) All of them put emphasis on the description and testing of grouping algorithms, which mainly derive from the ones in other disciplines;and 4) None of them involves grouping adaptability in their discussion. Based on the analysis, the present paper proposes a grouping model which may better suit Collaborative Learning.

关键词： mobile learning collaborative learning groups grouping models grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient K-coverage grouping Scheduling in Wireless Sensor Networks

Efficient K-coverage Grouping Scheduling in Wireless Sensor ...

引用

11th International Conference on Advanced Communication Technology

作者： Wueng, Meng-Chun Lin, Han-Pei Hwang, Shyh-In Yuan Ze Univ Dept Comp Sci & Engn Chungli Taiwan

ISBN: (纸本)9788955191387

The K-coverage configuration guarantees that each location in an area is covered by at least K wireless sensors. To prolong the system lifetime, how to design an efficient sleep-scheduling algorithm have been attracted much attention. Many studies cannot maximize the system lifetime, while ensuring the K-coverage configuration. In this paper, we classify wireless sensors into groups, in which each group is K-covered with the minimum overlap among sensors. Different from the previous studies, our algorithm further reduces the cost of maintaining connectivity among sensors and the latency of reporting events. Experimental results demonstrate the efficiency and accuracy of our algorithm.

关键词： Wireless sensor networks K-coverage configuration Sleep Scheduling grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimizing Inventory grouping Decisions: A grouping Particle Swarm Optimization Approach

Optimizing Inventory Grouping Decisions: A Grouping Particle...

引用

World Congress on Engineering and Computer Science, WCES 2017

作者： Mutingi, Michael Musiyarira, Harmony Mbohwa, Charles Dube, Partson Namibia Univ Sci & Technol Fac Engn P Bag 13388 Windhoek Namibia Univ Johannesburg Dept Qual & Operat Management Fac Engn & Built Environm Johannesburg South Africa Namibia Univ Sci & Technol Fac Engn Windhoek Namibia Univ Johannesburg Dept Mech & Ind Engn Fac Engn & Built Environm Johannesburg South Africa

ISBN: (纸本)9789881404756

Inventory classification involving thousands of different items is of common occurrence in moderate to large scale organizations. Though widely applied in several industries, the classical ABC inventory analysis has limitations, including inability to handle qualitative criteria, inability to model multiple criteria, and sub-optimal solutions. This research presents an extension to the inventory classification problem. The proposed approach incorporates a multi-criteria grouping perspective based on a particle swarm optimization approach. First, we analyze the grouping structure of the inventory classification problem. Second, we model the problem from a multi-criteria perspective. Third, we present a particle grouping particle swarm optimization approach for the problem. The proposed multi-criteria inventory classification approach is promising. Finally, further research prospects are presented.

关键词： Inventory grouping ABC analysis Particle Swarm Optimization grouping algorithm Multi-criteria optimization

来源：评论

学校读者我要写书评

暂无评论

A grouping Adaptive MIMO-OFDM Modulation Method for PLC 3

A Grouping Adaptive MIMO-OFDM Modulation Method for PLC

引用

3rd IEEE International Conference on Information Communication and Signal Processing (ICICSP)

作者： Li, Yingxue Zhang, Min Zhang, Xiao Feng Li, Guocheng Lu, Jun China STATE GRID Jiangxi Econ Res Inst Nanchang Jiangxi Peoples R China North China Elect Power Univ Sch Elect & Elect Engn Beijing Peoples R China

ISBN: (纸本)9781728188232

In order to ensure the timeliness and reliability of power line carrier communication, a grouping adaptive MIMO-OFDM modulation method based on the requirements of service delay and bit error rate was ***, the power line communication service is divided into real-time(RT) service and non-real-time(NRT) service from the perspective of timeliness. Then, from the perspective of reliability, the business is divided into high-level business and low-level business. On this basis, the grouping strategy and modulation mode are selected adaptively. The simulation results show that the computation iteration times of this method is less than that of the no-grouping *** comparing the grouping algorithm, the extra service delay caused by grouping is avoided and the sub-carrier loading efficiency is improved.

关键词： orthogonal frequency division multiplexing multiple-input multiple-output grouping algorithm power line communication

来源：评论

学校读者我要写书评

暂无评论

Efficient Suboptimal Resource Allocation algorithms for Multiuser MIMO-OFDMA Systems

引用

WIRELESS PERSONAL COMMUNICATIONS 2015年第4期82卷 1967-1985页

作者： Majidzadeh, Mohammad Eslami, Mohsen Shiraz Univ Technol Dept Elect & Elect Engn Shiraz Iran

Multiple-input multiple-output (MIMO) wireless communication systems in combination with orthogonal frequency division multiple access and space division multiple access are flexible, spectrally efficient and of high capacity. These systems can allocate frequency, time, and space resources adaptively among mobile stations. Optimal resource allocation (RA) for maximizing the sum rate is usually too complex for practical applications, hence suboptimal algorithms are required. The performance of RA algorithms are degraded due to imperfections in channel state information at transmitter (CSIT). Thus, techniques that make the RA algorithm, robust against CSIT errors are favorable. In this paper, two novel suboptimal grouping algorithms are introduced that are shown to achieve better sum rate-complexity and fairness-complexity performances. A novel index is proposed to measure the efficiency of RA algorithms, which takes into account sum rate and complexity simultaneously. Moreover, the effect of erroneous CSIT on sum rate is investigated and it is shown that performance of the proposed RA algorithms with erroneous CSIT are superior to the existing schemes. Finally, fairness performance of the proposed RA algorithms are evaluated, which are shown to be the same if not superior to other existing algorithms.

关键词： Resource allocation (RA) grouping algorithm Space division multiple access (SDMA) Orthogonal frequency division multiple access (OFDMA) Multiple input-multiple output (MIMO)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：