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

arXiv 2017年

作者： Luo, Wenjian Li, Zhifang Anhui Key Laboratory of Software in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei230027 China

Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be described by a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean function. Copyright © 2017, The Authors. All rights reserved.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Research on Image Clustering Based on Evolutionary Programming Algorithm

Research on Image Clustering Based on Evolutionary Programmi...

引用

2018 International Conference on Mathematics, Modeling, Simulation and Statistics Application（MMSSA2018）

作者： She Liu Shuying Yang Department of computer and Communication Engineering Tianjin University of Technology Key laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology

ISBN: (纸本)9781510880504

Evolutionary programming algorithm is applied to the problem of image clustering. The solution of the problem is encoded by the symbol coding, and swarm intelligent model is used to search the solution of the problem. In evolutionary programming algorithm, the global search ability is effectively improved by mutation operator and selection operator. The excellent diversity of solutions is guaranteed by using Gaussian mutation operator, and the complexity of the evolutionary operation is reduced. The simulation experiments show that the proposed algorithm for image clustering is effective and correct.

关键词： evolutionary programming image clustering swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Coverage-preserving Data Gathering in Wireless Sensor Networks

Coverage-preserving Data Gathering in Wireless Sensor Networ...

引用

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Hongli Xu Liusheng Huang Jumin Wu Yang Wang Depart. of Computer Science and Technology Anhui Province key Laboratory of Software in Computing and Communication University of Science and Technology Hefei China

The power is the most significant resource in wireless sensor nodes, so energy conservation is the most important factor in designing the protocol for sensor networks. In this paper, we study the problem of energy-efficient collection of the physical information from the target area. The coverage-preserving data gathering (CPDG) problem is to build up a tree, which minimizes the total energy consumption, and preserves the original coverage to ensure the result correctness. This problem can be formalized as 0-1 integer linear programming, and solved by an efficient heuristic algorithm. Furthermore, an improved algorithm is also proposed to balance the energy consumption among all the sensor nodes. The experimental results show that CPDG algorithm can conserve the energy about 30% of PEDAP protocol, which is regarded as one of the most efficient data gathering protocols as we know.

关键词： Wireless sensor networks Energy efficiency Energy consumption Heuristic algorithms Monitoring Distributed computing Computer networks Energy conservation Wireless application protocol Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Hormone-based Clustering Algorithm in Wireless Sensor Networks

A Hormone-based Clustering Algorithm in Wireless Sensor Netw...

引用

2010 2nd International Conference on Computer Engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Dayuan Dong Haifeng You Yipeng Zhang Xufa Wang Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China HefeiChina

ISBN: (纸本)9781424463473;9781424463497;9781424463503

Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper,we propose a hormone-based clustering algorithm (HCA) inspired by the communication mechanism of bioendocrine system to prolong the lifetime of the sensor nodes. Two kinds of hormones,cluster hormone and member hormone,are used in the algorithm. Hormone message can promote a node to become a cluster head or a member node. Comparative experiment shows that the proposed algorithm has effectively prolong the lifetime of WSN compared with LEACH[1] and HEED[2].

关键词： hormone:clustering:wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Removal of Baseline Wander from Dynamic Electrocardiogram Signals

Removal of Baseline Wander from Dynamic Electrocardiogram Si...

引用

Congress on Image and Signal Processing, CISP

作者： Min Dai Shi-Liu Lian Tianjin Key Laboratory of Intelligent Computing & Novel Software Technology School of Computer and Communication Engineering Key Laboratory of Computer Vision and System Ministry of Education School of Computer and Communication Engineering Tianjin University of Technology Tianjin China

The traditional method based on moving average filter can remove the baseline wander in electrocardiogram signals, but also causes the loss of motive ECG signals, which makes distortions of filtered ECG signals. In this paper, a modified moving average filter is proposed to selectively capture the low-frequency baseline wander noise and remove it from the detected signals in order to recover true ECG. The interval sampling data is taken into consideration when calculate the moving average in order to reduce the loss of useful ECG signals and distortions. The algorithm is developed for computer implementation using MATLAB. To validate the proposed methods, the recording from MIT/BIH database is used. Experimental results demonstrate the improvement of the proposed moving average filter over the traditional one in removing baseline wander without introducing distortion to the ECG signals.

关键词： Electrocardiography Frequency Distortion Finite impulse response filter IIR filters Computer vision Clinical diagnosis Electrodes Adaptive filters Low-frequency noise

来源：评论

学校读者我要写书评

暂无评论

Representative Template Set Generation Method for Pedestrian Detection

Representative Template Set Generation Method for Pedestrian...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Pei Wu Xian-Bin Cao Yan-Wu Xu Hong Qiao Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Institute of Automation Chinese Academy and Sciences Beijing China

Template matching is an effective approach for pedestrian detection. In order to achieve real-time and accurate detection, how to obtain a suitable representative template set is still an open problem due to the large variety of pedestrian shape. This paper introduced a representative template generation method for a template matching based pedestrian detection system (PDS). Based on nonlinear manifold learning and clustering, the new approach can generate a suitable representative template subset from a large amount of original templates. First, an improved nonlinear dimensionality reduction method was proposed to map original templates to feature vectors (points) in the low-dimensional embedding space; second, representative points were generated in the embedding space by clustering; at the end, corresponding representative template set were synthesized by mapping inversely the newly generated points from the embedding space to the visual input *** experimental results showed that the template generation method speeds up detection procedure without considerable loss of performance.

关键词： Shape Laboratories communication system software Vehicle detection Fuzzy systems Automation Performance loss Vehicles Object detection Pattern matching

来源：评论

学校读者我要写书评

暂无评论

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Junteng Wang Wenjian Luo Yamin Hu Hao Jiang Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (数字)9781728142487

ISBN: (纸本)9781728142494

Cryptographic hash functions play significant roles in information security applications, including data integrity. Facing hash collision attacks, several prevalent cryptographic hash functions have been proved not safe enough. In this paper, we propose a simple scheme for data integrity check called PN-HASH (Positive hash and Negative hash). PN-HASH is inspired by the negative representation of information, which is a research branch in the field of immune computation. This scheme computes two hash values of the input message and its negative representation. The resulting hashes are called the positive hash and the negative hash, respectively. The proposed scheme is simple but can improve the resistance to hash collision attacks. Furthermore, for more flexibility and higher security, we propose three extensions of PN-HASH. Security and complexity analyses show that PN-HASH could improve the security of underlying cryptographic hash functions, with approximately twice cost of them. To give exact examples, we present PN-MD5, an implementation of PN-HASH based on MD5.

关键词： Cryptography Data integrity Databases Resistance Complexity theory Face

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：