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

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Kai Lei Meng Qin Bo Bai Gong Zhang Min Yang PCL Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China ICNLAB School of Electronics and Computer Engineering (SECE) Peking University Shenzhen China Future Network Theory Lab 2012 Labs Huawei Technologies Co. Ltd Hong Kong China Chinese Academy of Sciences Shenzhen Institutes of Advanced Technology Shenzhen China

In this paper, we generally formulate the dynamics prediction problem of various network systems (e.g., the prediction of mobility, traffic and topology) as the temporal link prediction task. Different from conventional techniques of temporal link prediction that ignore the potential non-linear characteristics and the informative link weights in the dynamic network, we introduce a novel non-linear model GCN-GAN to tackle the challenging temporal link prediction task of weighted dynamic networks. The proposed model leverages the benefits of the graph convolutional network (GCN), long short-term memory (LSTM) as well as the generative adversarial network (GAN). Thus, the dynamics, topology structure and evolutionary patterns of weighted dynamic networks can be fully exploited to improve the temporal link prediction performance. Concretely, we first utilize GCN to explore the local topological characteristics of each single snapshot and then employ LSTM to characterize the evolving features of the dynamic networks. Moreover, GAN is used to enhance the ability of the model to generate the next weighted network snapshot, which can effectively tackle the sparsity and the wide-value-range problem of edge weights in real-life dynamic networks. To verify the model's effectiveness, we conduct extensive experiments on four datasets of different network systems and application scenarios. The experimental results demonstrate that our model achieves impressive results compared to the state-of-the-art competitors.

关键词： Predictive models Hidden Markov models Task analysis Topology Network topology Generative adversarial networks Gallium nitride

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Cryptography Theory-Based Generating Method for Secure ECs

引用

Tsinghua Science and Technology 2017年第5期22卷 499-510页

作者： Chao Wang Feng Hu Huanguo Zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

Ant Colony Optimization （AGO） has the character of positive feedback, distributed searching, and greedy searching. It is applicable to optimization grouping problems. Traditional cryptographic research is mainly based on pure mathematical methods which have complicated theories and algorithm. It seems that there is no relationship between cryptography and ACO. Actually, some problems in cryptography are due to optimization grouping problems that could be improved using an evolutionary algorithm. Therefore, this paper presents a new method of solving secure curve selection problems using ACO. We improved Complex Multiplication （CM） by combining Evolutionary Cryptography Theory with Weber polynomial solutions. We found that ACO makes full use of valid information generated from factorization and allocates computing resource reasonably. It greatly increases the performance of Weber polynomial solutions. Compared with traditional CM, which can only search one root once time, our new method searches all roots of the polynomial once, and the average time needed to search for one root reduces rapidly. The more roots are searched, the more ECs are obtained.

关键词： ECs Weber polynomial evolutionary algorithm ant algorithm complex multiplication

来源：评论

学校读者我要写书评

暂无评论

Simple Method for Realizing Weil Theorem in Secure ECC Generation

引用

Tsinghua Science and Technology 2017年第5期22卷 511-519页

作者： Feng Hu Chao Wang Huanguo Zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

How to quickly compute the number of points on an Elliptic Curve （EC） has been a longstanding challenge. The computational complexity of the algorithm usually employed makes it highly inefficient. Unlike the general EC, a simple method called the Weil theorem can be used to compute the order of an EC characterized by a small prime number, such as the Kobltiz EC characterized by two. The fifteen secure ECs recommended by the National Institute of Standards and Technology （NIST） Digital Signature Standard contain five Koblitz ECs whose maximum base domain reaches 571 bits. Experimental results show that the computation speed decreases for base domains exceeding 600 bits. In this paper, we propose a simple method that combines the Weil theorem with Pascals triangle, which greatly reduces the computational complexity. We have validated the performance of this method for base fields ranging from 2l^100 to 2^1000. Furthermore, this new method can be generalized to any ECs characterized by any small prime number.

关键词： Elliptic Curves （ECs） Pascal＇s triangle Weil theorem

来源：评论

学校读者我要写书评

暂无评论

A Modified Ćuk Converter With Constant Switching Frequency Modulated Sliding Mode Control

A Modified Ćuk Converter With Constant Switching Frequency ...

引用

Compatibility in Power Electronics (CPE)

作者： Emre Ozsoy Sanjeevikumar Padmanaban Frede Blaabjerg Mahajan Sagar Bhaskar Fiaz Ahmad Research & Development Design Center Danfoss Drives A/S Denmark Department of Energy Technology Aalborg University Esbjerg Denmark Center of Reliable Power Electronics (CORPE) Department of Energy Technology Aalborg University Aalborg Denmark Renewable Energy Lab Department of Communications & Networks College of Engineering Prince Sultan University Riyadh Saudi Arabia Electrical Engineering National University of Computer & Emerging Science5 Peshawar Pakistan

High output gain ratio demand for DC-DC converters have been increasing in recent years due to diverse integration of various renewable sources and industrial applications. This article focused to provide a detailed analysis of a Cuk converter with increased voltage conversion ratio. The circuit only consists of two inductors, five capacitors and four diodes. In particular, configuration is composed of combination of two different cascaded switched capacitor voltage boost network. The voltage in the output is 29 times higher than the input voltage, if 0.9 duty ratio is used. Further, high gain DC-DC converter control is a challenging task due to higher order and nonlinear characteristics. Standard PI controllers cannot accomplish robust operation for all operation regions. Hence, Sliding Mode Controller (SMC) is a reliable and robust method for high order nonlinear systems due to its robustness and independence from system dynamics and parameter variations. Furthermore, this paper develops a constant switching frequency SMC approach to high gain modified Cuk converter. Comprehensive theoretical analysis is presented and numerically verified using Matlab/Simulink software.

关键词： DC-DC power converters Switches Switching frequency PI control Voltage control Hysteresis Inductors

来源：评论

学校读者我要写书评

暂无评论

Detecting MAC Misbehavior of IEEE 802.11 Devices within Ultra Dense Wi-Fi networks

Detecting MAC Misbehavior of IEEE 802.11 Devices within Ultr...

引用

International Conference on Telecommunications (ICT)

作者： M. Shahwaiz Afaqui Stephen Brown Ronan Farrell Wireless Networks Research Lab Universitat Oberta de Catalunya Spain Department of Computer Science Maynooth University Ireland Department of Electronic Engineering Maynooth University Ireland

The widespread deployment of IEEE 802.11 has made it an attractive target for potential attackers. The latest IEEE 802.11 standard has introduced encryption and authentication protocols that primarily address the issues of confidentiality and access control. However, improving network availability in the presence of misbehaving stations has not been addressed in the standard. Existing research addresses the problem of detecting misbehavior in scenarios without overlapping cells. However, in real scenarios cells overlap, resulting in a challenging environment for detecting misbehavior. The contribution of this paper is the presentation and evaluation of a new method for detecting misbehavior in this environment. This method is based on an objective function that uses a broad range of symptoms. Simulation results indicate that this new approach is very sensitive to misbehaving stations in ultra dense networks.

关键词： IEEE 802.11 Standard Wireless fidelity Throughput Transmitters Protocols Space stations Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Demonstration of 50Gb/s/λ symmetric PAM4 TDM-PON with 10G-class optics and DSP-free ONUs in the O-band

Demonstration of 50Gb/s/λ symmetric PAM4 TDM-PON with 10G-c...

引用

Optical Fiber Communication Conference, OFC 2018

作者： Zhang, Kuo Zhuge, Qunbi Xin, Haiyun Xing, Zhenping Xiang, Meng Fan, Sujie Yi, Lilin Hu, Weisheng Plant, David V. State Key Lab of Advanced Optical Communication System and Networks Shanghai Jiao Tong University Shanghai200240 China Department of Electrical and Computer Engineering McGill University MontrealQCH3A 2A7 Canada Ciena Corporation OttawaONK2K 0L1 Canada

We demonstrate a 50Gb/s/λ PAM4 TDM-PON based on 10G-class DMLs and PDs in Oband with downlink pre-compensation and uplink post-equalization. Results show that, without any DSP in the ONU, 29dB optical power budget is... 详细信息

ISBN: (纸本)9781943580385

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Correction to “Fulcrum: Flexible Network Coding for Heterogeneous Devices”

引用

IEEE Access 2021年 9卷 108199-108199页

作者： Daniel E. Lucani Morten V. Pedersen Diego Ruano Chres W. Sørensen Frank H. P. Fitzek Janus Heide Olav Geil Vu Nguyen Martin Reisslein Aarhus University Aarhus Denmark Steinwurf ApS Aalborg Denmark IMUVA-Mathematics Research Institute University of Valladolid Valladolid Spain Aalborg University Aalborg Denmark Danish Ministry of Defence Acquisition and Logistics Organization Copenhagen Denmark 5G Lab Germany Deutsche Telekom Chair of Communication Networks Technische Universität Dresden Dresden Germany Centre for Tactile Internet with Human-in-the-Loop (CeTI) Technische Universität Dresden Dresden Germany School of Electrical Computer and Energy Engineering Arizona State University Tempe AZ USA

In the above article [1] , in Section II-B.1)a, titled “Outer Encoding,” the first sentence of the second paragraph should be corrected to consistently use $\Omega _{j}$ to denote the coded packets, i.e., this sentence should state: “For systematic outer encoding, the outer encoding vectors for coded packets $\Omega _{j},\,\,j = 1, 2, \ldots, n$ , form an identity matrix of dimension $n \times n$ , i.e., coded packets $\Omega _{j}, j = 1, 2, \ldots, n$ , are identical to the source packets $P_{j}$ .”

关键词： Systematics Network coding Encoding

来源：评论

学校读者我要写书评

暂无评论

MedShapeNet - A Large-Scale Dataset of 3D Medical Shapes for computer Vision

arXiv

引用

arXiv 2023年

作者： Li, Jianning Zhou, Zongwei Yang, Jiancheng Pepe, Antonio Gsaxner, Christina Luijten, Gijs Qu, Chongyu Zhang, Tiezheng Chen, Xiaoxi Li, Wenxuan Wodzinski, Marek Friedrich, Paul Xie, Kangxian Jin, Yuan Ambigapathy, Narmada Nasca, Enrico Solak, Naida Melito, Gian Marco Vu, Viet Duc Memon, Afaque R. Schlachta, Christopher De Ribaupierre, Sandrine Patel, Rajnikant Eagleson, Roy Chen, Xiaojun Mächler, Heinrich Kirschke, Jan Stefan de la Rosa, Ezequiel Christ, Patrick Ferdinand Li, Hongwei Bran Ellis, David G. Aizenberg, Michele R. Gatidis, Sergios Küstner, Thomas Shusharina, Nadya Heller, Nicholas Andrearczyk, Vincent Depeursinge, Adrien Hatt, Mathieu Sekuboyina, Anjany Löffler, Maximilian Liebl, Hans Dorent, Reuben Vercauteren, Tom Shapey, Jonathan Kujawa, Aaron Cornelissen, Stefan Langenhuizen, Patrick Ben-Hamadou, Achraf Rekik, Ahmed Pujades, Sergi Boyer, Edmond Bolelli, Federico Grana, Costantino Lumetti, Luca Salehi, Hamidreza Ma, Jun Zhang, Yao Gharleghi, Ramtin Beier, Susann Sowmya, Arcot Garza-Villarreal, Eduardo A. Balducci, Thania Angeles-Valdez, Diego Souza, Roberto Rittner, Leticia Frayne, Richard Ji, Yuanfeng Ferrari, Vincenzo Chatterjee, Soumick Dubost, Florian Schreiber, Stefanie Mattern, Hendrik Speck, Oliver Haehn, Daniel John, Christoph Nürnberger, Andreas Pedrosa, João Ferreira, Carlos Aresta, Guilherme Cunha, António Campilho, Aurélio Suter, Yannick Garcia, Jose Lalande, Alain Vandenbossche, Vicky Van Oevelen, Aline Duquesne, Kate Mekhzoum, Hamza Vandemeulebroucke, Jef Audenaert, Emmanuel Krebs, Claudia van Leeuwen, Timo Vereecke, Evie Heidemeyer, Hauke Röhrig, Rainer Hölzle, Frank Badeli, Vahid Krieger, Kathrin Gunzer, Matthias Chen, Jianxu van Meegdenburg, Timo Dada, Amin Balzer, Miriam Fragemann, Jana Jonske, Frederic Rempe, Moritz Malorodov, Stanislav Bahnsen, Fin H. Seibold, Constantin Jaus, Alexander Marinov, Zdravko Jaeger, Paul F. Stiefelhagen, Rainer Santos, Ana Sofia Lindo, Mariana Ferreira, André Alves, Victor Kamp, Michael Abourayya, Amr Nensa, Felix Hörst, Fabian Brehmer, Alexander Hein Girardetstraße 2 Essen45131 Germany Graz University of Technology Inffeldgasse 16c Graz8010 Austria Graz Austria The Department of Computer Science Johns Hopkins University Malone Hall 3400 N Charles St BaltimoreMD21218 United States Rte Cantonale Lausanne1015 Switzerland The Department of Measurement and Electronics AGH University of Science and Technology Krakow Poland Sierre Switzerland Department of Biomedical Engineering University of Basel Hegenheimermattweg Allschwil167C CH-4123 Switzerland The Boston College 140 Commonwealth Ave Chestnut HillMA02467 United States University Hospital B7-200 339 Windermere Road LondonN6A 5A5 Canada The Department of Radiology Renji Hospital School of Medicine Shanghai Jiao Tong University Shanghai200240 China The Research Center for Connected Healthcare Big Data ZhejiangLab Zhejiang Hangzhou311121 China The Faculty of Statistics Technical University Dortmund August-Schmidt-Straße 1 Dortmund44227 Germany The Institute of Mechanics Graz University of Technology Kopernikusgasse 24/IV Graz8010 Austria The Institute of Biomedical Manufacturing and Life Quality Engineering State Key Laboratory of Mechanical System and Vibration School of Mechanical Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai200240 China The Department of Cardiac Surgery Medical University Graz Auenbruggerplatz 29 Graz8036 Austria The Department of Diagnostic and Interventional Radiology University Hospital Giessen Justus-Liebig-University Giessen Klinikstraße 33 Giessen35392 Germany The Department of Mechanical Engineering Mehran University of Engineering and Technology Jamshoro Sindh76062 Pakistan The Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China The Geschäftsführender Oberarzt Abteilung für Interventionelle und Diagnostische Neuroradiologie Universitätsklinikum der Technischen Universität München Ismaningerstr. 22 München81675 Germany icometrix Kolonel Be

Prior to the deep learning era, shape was commonly used to describe the objects. Nowadays, state-of-the-art (SOTA) algorithms in medical imaging are predominantly diverging from computer vision, where voxel grids, meshes, point clouds, and implicit surface models are used. This is seen from numerous shape-related publications in premier vision conferences as well as the growing popularity of ShapeNet (about 51,300 models) and Princeton ModelNet (127,915 models). For the medical domain, we present a large collection of anatomical shapes (e.g., bones, organs, vessels) and 3D models of surgical instrument, called MedShapeNet, created to facilitate the translation of data-driven vision algorithms to medical applications and to adapt SOTA vision algorithms to medical problems. As a unique feature, we directly model the majority of shapes on the imaging data of real patients. As of today, MedShapeNet includes 23 datasets with more than 100,000 shapes that are paired with annotations (ground truth). Our data is freely accessible via a web interface and a Python application programming interface (API) and can be used for discriminative, reconstructive, and variational benchmarks as well as various applications in virtual, augmented, or mixed reality, and 3D printing. Exemplary, we present use cases in the fields of classification of brain tumors, skull reconstructions, multi-class anatomy completion, education, and 3D printing. In future, we will extend the data and improve the interfaces. The project pages are: https://***/ and https://***/Jianningli/*** Codes 68T01 © 2023, CC BY.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Unilateral Left-Tail Anderson-Darling Test Based Spectrum Sensing with Laplacian Noise

arXiv

引用

arXiv 2018年

作者： Jiang, Lijuan Li, Yongzhao Ye, Yinghui Chen, Yunfei Jin, Ming Zhang, Hailin Integrated Service Networks Lab of Xidian University Xi’an China School of Engineering University of Warwick CoventryCV4 7AL United Kingdom Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo315211 China

This paper focuses on spectrum sensing under Laplacian noise. To remit the negative effects caused by heavy-tailed behavior of Laplacian noise, the fractional lower order moments (FLOM) technology is employed to pre-process the received samples before spectrum sensing. Via exploiting the asymmetrical difference between the distribution for the FLOM of received samples in the absence and presence of primary users, we formulate the spectrum sensing problem under Laplacian noise as a unilateral goodness-of-fit (GoF) test problem. Based on this test problem, we propose a new GoF-based detector which is called unilateral left-tail Anderson Darling (ULAD) detector. The analytical expressions for the theoretical performance, in terms of false-alarm and detection probabilities, of the ULAD are derived. Moreover, a closed-form expression for the optimal detection threshold is also derived to minimize the total error rate. Simulation results are provided to validate the theoretical analyses and to demonstrate the superior performance of the proposed detector than others. Copyright © 2018, The Authors. All rights reserved.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Cooperative secure transmission by exploiting social ties in random networks

arXiv

引用

arXiv 2018年

作者： Wang, Hui-Ming Xu, Yiming Huang, Ke-Wen Han, Zhu Tsiftsis, Theodoros A. School of Electronics and Information Engineering Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an Shaanxi710049 China Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States School of Engineering Nazarbayev University Astana010000 Kazakhstan

Social awareness and social ties are becoming increasingly popular with emerging mobile and handheld devices. Social trust degree describing the strength of the social ties has drawn lots of research interests in many fields in wireless communications, such as resource sharing, cooperative communication and so on. In this paper, we propose a hybrid cooperative beamforming and jamming scheme to secure communication based on the social trust degree under a stochastic geometry framework. The friendly nodes are categorized into relays and jammers according to their locations and social trust degrees with the source node. We aim to analyze the involved connection outage probability (COP) and secrecy outage probability (SOP) of the performance in the networks. To achieve this target, we propose a double Gamma ratio (DGR) approach through Gamma approximation. Based on this, the COP and SOP are tractably obtained in closed-form. We further consider the SOP in the presence of Poisson Point Process (PPP) distributed eavesdroppers and derive an upper bound. The simulation results verify our theoretical findings, and validate that the social trust degree has dramatic influences on the security performance in the networks. Copyright © 2018, The Authors. All rights reserved.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：