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

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Wanli, Dong Naijie, Gu Kun, Bi Kun, Tu Xiaohu, Liu Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. However, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we propose a network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We mathematically formulate the optimization framework, taking into account the interference constraints, the number of channels in the network and the number of radios available at each mesh router etc. We then use this framework to develop solutions for multiple objectives subject to different kind of fairness constraints on allocation of scarce wireless capacity among mobile clients. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

First-Order Meta-Learning in Node Classification with Graph Convolutional Network 4

First-Order Meta-Learning in Node Classification with Graph ...

引用

4th International Conference on Artificial Intelligence and Big Data, ICAIBD 2021

作者： Cao, Jing Xu, Yi Song, Xuening School of Information and Software Engineering University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China

ISBN: (纸本)9780738131702

In recent years, research on graph representation learning within graph neural networks has made great progress. Among them, graph convolutional neural networks (GCN), which is based on spectral domain, have drawn great attention and become one of the mainstream graph embedding approaches. However, few-shot learning on graphs has little related work, as we know. Toward this problem, we propose a meta-learning method on graphs, FOML-GCN (First order meta-learning on GCN), aimed to be applied in various kinds of models of graph convolutional networks. As many common approaches in meta-learning, FOML-GCN involves two phases, meta-training and meta-testing. By learning the potential Knowledge from a small number of samples in existing classes during meta-training, our method enhances the ability in node classification of the base model by training within new few data that only appear in the meta-testing step. The experiment on two benchmark datasets shows that our FOML-GCN performs better than base GCN and other models of graph network in few-shot node classification tasks. © 2021 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Address assignment in wireless sensor networks using game approach

Address assignment in wireless sensor networks using game ap...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Kim, Tu Naijie, Gu Kim, Bi Wanli, Dong Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

In this paper, we propose a game model to solve the MAC address assignment in sensor networks. Insufficiency of battery power of sensors makes the conservation of the energy be the main design issues for the sensor networks. Due to the small packet payload, the MAC header is a significant and energy-costly overhead. To remedy this, we propose a novel scheme for a MAC address assignment. The key feature which makes our approach unique is that we propose a mixed strategy game model to solve the address assignment problem. We prove that there is a mixed strategy Nash equilibrium in our game model. The model takes advantage of the exploitation of spatial address ruse to save energy. Our model is easy to implement, which makes it a potential candidate for practical implementations, even for very large networks.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Strict pattern matching under non-overlapping condition

引用

Science China(Information Sciences) 2017年第1期60卷 5-20页

作者： Youxi WU Cong SHEN He JIANG Xindong WU School of Computer Science and Engineering Hebei University of Technology Hebei Province Key Laboratory of Big Data Calculation School of Computer Science and Technology Tianjin University School of Software Dalian University of Technology School of Computer Science and Information Engineering Hefei University of Technology School of Computing and Informatics University of Louisiana at Lafayette

Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences) of a pattern and then to determine whether the pattern is frequent or not. A state-of-the-art sequential pattern mining with gap constraints(or flexible wildcards) uses the number of non-overlapping occurrences to denote the frequency of a pattern. Non-overlapping means that any two occurrences cannot use the same character of the sequence at the same position of the pattern. In this paper, we investigate strict pattern matching under the non-overlapping condition. We show that the problem is in P at first. Then we propose an algorithm, called NETLAP-Best, which uses Nettree structure. NETLAP-Best transforms the pattern matching problem into a Nettree and iterates to find the rightmost root-leaf path, to prune the useless nodes in the Nettree after removing the rightmost root-leaf path. We show that NETLAP-Best is a complete algorithm and analyse the time and space complexities of the algorithm. Extensive experimental results demonstrate the correctness and efficiency of NETLAP-Best.

关键词： pattern matching sequential pattern mining gap constraint flexible wildcard non-overlapping occurrence Nettree

来源：评论

学校读者我要写书评

暂无评论

Neighborhood-based distributed topological hole detection algorithm in sensor networks

Neighborhood-based distributed topological hole detection al...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Kun, Bi Naijie, Gu Kun, Tu Wanli, Dong Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

Topological holes in sensor networks usually indicate the region where nodes are depleted or not dense enough due to kinds of reasons. In this paper, we study the problem of detecting topological holes in wireless sensor networks. Those sensor nodes have no geographic location information and have a limited communication range. We present a novel distributed topological holes detection algorithm which is based purely on the logical communication topology graph. By exchanging information with its 1-hop and 2-hop neighbors, each node can independently decide whether it is on the boundary of a hole. Those boundary sensor nodes together could describe the region of the topological hole. Experimental results show that our distributed algorithm is effective in exploiting those characteristics of those nodes on the boundaries of holes. And thus it could identify those holes in sensor networks of moderate node densities.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Zone routing protocol based on energy consumption

引用

Jisuanji Gongcheng/Computer Engineering 2006年第12期32卷 117-118+135页

作者： Zhai, Weifeng Gu, Naijie Zhang, Jianming Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

A zone routing protocol based on the energy consumption speed of nodes in mobile Adhoc networks is presented. A route select parameter computed by residual lifetime of nodes and hop count of route is used to be selected the best route, the nodes that have more energy have more probability of chosen. The mechanism can balance the energy consumption of node and prolong network's life. Simulation result comparing with zone routing protocol in NS-2 shows EZRP has less number of death nodes, lower routing overhead, and longer lifetime of network.

关键词： Energy consumption EZRP Hybrid routing protocol MANET

来源：评论

学校读者我要写书评

暂无评论

The detection of Trojan horse based on the data mining

The detection of Trojan horse based on the data mining

引用

6th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2009

作者： Tang, Shugang School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin 300191 China

ISBN: (纸本)9780769537351

Trojan horse is a serious security threat to computer network. Traditionally, Trojan Horses are detected using file's dynamic characteristics or behaviors. However, these methods are not available for unknown or un-awakened Trojan horses. Trojan horse always exists as PE (Portable Executable) file format in the Windows system environment, and the PE file has many static characteristics, which contains many runtime characteristics. In this paper, a new detecting method based on PE file's static attributes is proposed, and intelligent information processing techniques are used to analyze those static attributes, such as decision tree, BP network and Finite State Machine. Further, a detection model is established to estimate whether a PE file is a Trojan horse. This thesis is prepared to value the static Trojan characteristic and build a new way to detect the Trojan horse by using the PE file static characteristics. © 2009 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Research on ultra-dependable embedded real time operating system

Research on ultra-dependable embedded real time operating sy...

引用

2011 IEEE/ACM International Conference on Green computing and communications, GreenCom 2011

作者： Chen, Hui Yang, Shi Ping Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China Guangzhou Haige Communication Industry Group Guangzhou China

ISBN: (纸本)9780769544663

In this paper, to research and design ultra-dependable embedded real time operating system supporting security and safety, spatial and temporal isolation safeguard is proposed and used. Temporal isolation mechanism guarantees a subsystem can exclusively use a pre-allocated processing time without any intervention from other subsystem. On the other hand, spatial isolation implies that a subsystem cannot inadvertently access other subsystem's space resources, like memory, buffers, I/O ports, and registers. Thus, a subsystem is the owner of its resources, such as memory, I/O ports, and processor time units. From this, the real time tasks running in different subsystems never interfere with each other. To support the temporal isolation among subsystems, a two-level scheduling model is designed, which consists of a low-level cyclic schedule at the operating system level and high-level fixed priority schedule at subsystem level. Thus, a real time task in a subsystem can only be scheduled and executed during the static time window allocated to the subsystem, and any task overrun cannot cross the time window boundaries of subsystem. It is very easy to restrain a task time-failure within the subsystem with temporal isolation mechanism. In reference to spatial isolation safeguard, a based on hard currency and error holding mechanism is presented, it apply to most embedded modern processors with memory protection unit, such as i386sx, PowerPC. As a result, an ultra-dependable embedded RTOS supporting temporal and spatial isolation safeguard is implemented and verified. It is called ERTOS designed by software Engineering Institute of East China Normal University. © 2011 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Group key Agreement Protocol from Short Signatures 8

Asymmetric Group Key Agreement Protocol from Short Signature...

引用

8th IEEE International Conference on Computer and communications, ICCC 2022

作者： Shen, Kunyu Zhang, Lei Zhang, Rui Fang, Qihao Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Sichuan Chengdu610041 China

ISBN: (纸本)9781665450515

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem. © 2022 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

MPC-Based Privacy-Preserving Serverless Federated Learning 3

MPC-Based Privacy-Preserving Serverless Federated Learning

引用

3rd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2022

作者： Zhong, Liangyu Zhang, Lei Xu, Lin Wang, Lulu East China Normal University Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute Shanghai200062 China Science and Technology on Communication Security Laboratory Sichuan Chengdu610041 China

ISBN: (数字)9781665451604

ISBN: (纸本)9781665451604

Federated learning (FL) enables multiple users to collaboratively train a global model by keeping their data sets local. Since a single server is used, traditional FL faces the single point of failure problem. An available approach is to adopt a serverless architecture. However, most of existing serverless FL schemes fail to protect gradient privacy, except for a few schemes that adopt differential privacy (DP) where the global model accuracy will decrease. To address these problems, we propose a privacy-preserving serverless FL scheme based on secure multiparty computation (MPC). Combining multiple cryptographic primitives (e.g., key agreement and symmetric encryption), our scheme protects gradient privacy in FL and it is accuracy-lossless. By secret sharing, our scheme supports users to quit an FL task in each round during training. © 2022 IEEE.

关键词： Privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：