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

Lightweight Automatic Modulation Classification via Progressive Differentiable Architecture Search

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2023年第6期9卷 1519-1530页

作者： Zhang, Xixi Chen, Xiaofeng Wang, Yu Gui, Guan Adebisi, Bamidele Sari, Hikmet Adachi, Fumiyuki Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210003 Peoples R China Manchester Metropolitan Univ Fac Sci & Engn Dept Engn Manchester M1 5GD England Tohoku Univ Int Res Inst Disaster Sci Sendai 9808572 Japan

Automatic modulation classification (AMC) is a key step of signal demodulation that determines whether the receiver can correctly receive the transmitted signal without prior knowledge of the modulation type. Deep learning (DL) based AMC methods have been proven to achieve excellent performances. However, these DL-based methods rely heavily on expert experience to design neural network structures. these hand-designed networks have fixed architectures and lack flexibility, which often leads to insufficient model generalization. Neural architecture search (NAS) is a vital direction for automatic machine learning (AutoML), which can solve the shortcomings of hand-designed network architectures. In this paper, according to the specific modulation classification task, we propose a lightweight progressive differentiable architecture search-based AMC (PDARTS-AMC) method to search for a very lightweight network with great performance. In addition, the optimal architecture searched on dataset simulated by MATLAB is transferred to the RadioML2016.10B task, to verify the robustness and generalization of the proposed method. Experimental results show that the proposed PDARTS-AMC method both improves the classification accuracy and reduces the computational cost when compared with existing classical AMC methods.

关键词： Feature extraction Modulation Computer architecture Mathematical models Neural networks data models Search problems Automatic modulation classification neural architecture search progressive differentiable architecture search lightweight network

来源：评论

学校读者我要写书评

暂无评论

Maximum Flows in Parametric Graph Templates 1

引用

13th international symposium on algorithms and Complexity, CIAC 2023

作者： Ben-Nun, Tal Gianinazzi, Lukas Hoefler, Torsten Oltchik, Yishai ETH Zurich Universitätstrasse 6 Zürich Switzerland NVIDIA Tel-Aviv Israel

ISBN: (数字)9783031304484

ISBN: (纸本)9783031304477

Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. this parametric graph template representation allows us to reason about the execution graph of a parallel program at a cost that only depends on the program size. We develop structurally-parametric polynomial-time algorithm variants of maximum flows. When the graph models a parallel loop program, the maximum flow provides a bound on the data movement during an execution of the program. By reasoning about the structure of the repeating subgraphs, we avoid explicit construction of the instantiation (e.g., the execution graph), potentially saving an exponential amount of memory and computation. Hence, our approach enables graph-based dataflow analysis in previously intractable settings. © 2023, the Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Incomplete Directed Perfect Phylogeny in Linear Time 1

引用

17th international symposium on algorithms and data structures (wads)

作者： Bernardini, Giulia Bonizzoni, Paola Gawrychowski, Pawel Univ Milano Bicocca Milan Italy Univ Wroclaw Inst Comp Wroclaw Poland CWI Amsterdam Netherlands

ISBN: (数字)9783030835088

ISBN: (纸本)9783030835088;9783030835071

Reconstructing the evolutionary history of a set of species is a central task in computational biology. In real data, it is often the case that some information is missing: the Incomplete Directed Perfect Phylogeny (IDPP) problem asks, given a collection of species described by a set of binary characters with some unknown states, to complete the missing states in such a way that the result can be explained with a directed perfect phylogeny. Pe'er et al. [SICOMP 2004] proposed a solution that takes (O) over tilde (nm) time (the (O) over tilde(center dot) notation suppresses polylog factors) for n species and m characters. their algorithm relies on pre-existing dynamic connectivity data structures: a computational study recently conducted by Fernandez-Baca and Liu showed that, in this context, complex data structures perform worse than simpler ones with worse asymptotic bounds. this gives us the motivation to look into the particular properties of the dynamic connectivity problem in this setting, so as to avoid the use of sophisticated data structures as a blackbox. Not only are we successful in doing so, and give a much simpler O(nm log n)-time algorithm for the IDPP problem;our insights into the specific structure of the problem lead to an asymptotically optimal O(nm)-time algorithm.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Compact Distance Oracles with Large Sensitivity and Low Stretch 1

引用

18th international symposium on algorithms and data structures, wads 2023

作者： Bilò, Davide Choudhary, Keerti Cohen, Sarel Friedrich, Tobias Krogmann, Simon Schirneck, Martin Department of Information Engineering Computer Science and Mathematics University of L’Aquila L’Aquila Italy Department of Computer Science and Engineering Indian Institute of Technology Delhi Delhi India School of Computer Science The Academic College of Tel Aviv-Yaffo Tel Aviv-Yafo Israel Hasso Plattner Institute University of Potsdam Potsdam Germany Faculty of Computer Science University of Vienna Vienna Austria

ISBN: (数字)9783031389061

ISBN: (纸本)9783031389054

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch σ⩾ 1 is a data structure that preprocesses an input graph G. When queried with the triple (s, t, F), where s, t∈ V and F⊆ E contains at most f edges of G, the oracle returns an estimate d^ G-F(s, t) of the distance dG-F(s, t) between s and t in the graph G- F such that dG-F(s, t) ⩽ d^ G-F(s, t) ⩽ σ· dG-F(s, t). For any positive integer k⩾ 2 and any 0 1+1/k) under the Erdős girth conjecture. Bilò et al. [STOC 2023] gave a solution with stretch 3 + Ε, query time O(nα) but space O(n2-αf+1), approaching the quadratic barrier for large sensitivity. In the realm of subquadratic space, our f-DSOs are the first ones that guarantee, at the same time, large sensitivity, low stretch, and non-trivial query time. To obtain our results, we use the approximate distance oracles of thorup and Zwick [JACM 2005], and the derandomization of the f-DSO of Weimann and Yuster [TALG 2013] that was recently given by Karthik and Parter [SODA 2021]. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Fast and compact planar embeddings

引用

COMPUTATIONAL GEOMETRY-thEORY AND APPLICATIONS 2020年 89卷 101630-101630页

作者： Ferres, Leo Fuentes-Sepulveda, Jose Gagie, Travis He, Meng Navarro, Gonzalo Univ Desarrollo & Telefon I D Fac Engn Santiago Chile Univ Chile Dept Comp Sci Santiago Chile Ctr Biotechnol & Bioengn CeBiB Santiago Chile Diego Portales Univ Sch Comp Sci & Telecommun Santiago Chile Dalhousie Univ Fac Comp Sci Halifax NS Canada Millennium Inst Fdn Res Data IMFD Santiago Chile

there are many representations of planar graphs, but few are as elegant as Turan's (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multiedges, and can store any specified embedding. Its main disadvantage has been that "it does not allow efficient searching" (Jacobson, 1989). In this paper we show how to add a sublinear number of bits to Turan's representation such that it supports fast navigation while retaining simplicity. As a consequence of the inherited simplicity, we offer the first efficient parallel construction of a compact encoding of a planar graph embedding. Our experimental results show that the resulting representation uses about 6 bits per edge in practice, supports basic navigation operations within a few microseconds, and can be built sequentially at a rate below 1 microsecond per edge, featuring a linear speedup with a parallel efficiency around 50% for large datasets. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Planar embedding Compact data structures Parallel construction

来源：评论

学校读者我要写书评

暂无评论

A Hyperspectral Band Selection Network Combining Siamese Network and Local-Global Attention

A Hyperspectral Band Selection Network Combining Siamese Net...

引用

IEEE international symposium on Information (IT) in Medicine and Education, ITME

作者： Yuan An Guangjian Chen Dehua Huang Huiqin Zheng Qin Wang Cairen Jian Qian Weng College of Computer and Data Science Fuzhou University Fuzhou China Fujian Geologic Surveying and Mapping Institute Fuzhou China Tan Kah Kee College Xiamen University Zhangzhou China

Hyperspectral images can provide dozens to hundreds of continuous spectral bands, greatly enhancing the richness of information. However, the redundancy among adjacent bands leads to increased data processing complexity. Despite the recent introduction of numerous band selection methods, there has been limited focus on incorporating context information from the entire spectral range into this task. Furthermore, researchers have primarily concentrated on band informativeness and sparse representation for reconstructing all bands, often overlooking the separability of classes in downstream tasks. To address these challenges, we propose a hyperspectral band selection network combining Siamese Network Local-Global Attention (SLGA). this approach first segments the hyperspectral image into homogeneous regions and constructs sample pairs based on a random elimination strategy. Next, it utilizes the Local-Global Attention (L-GA) mechanism to obtain band weights that capture both local and global spectral structures. these reweighted bands are then fed into a twin network to obtain their high-dimensional representations, compute loss values, and update network parameters. Finally, extensive classification experiments using SVM, KNN, and LDA classifiers are conducted on the Indian Pines and Botswana hyperspectral image datasets. the results from these experiments on benchmark datasets demonstrate that the proposed SLGA method performs exceptionally well, outperforming state-of-the-art algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Observation Routes and External Watchman Routes 18th

Observation Routes and External Watchman Routes

引用

18th international symposium on algorithms and data structures, wads 2023

作者： Dumitrescu, Adrian Tóth, Csaba D. Algoresearch L.L.C. MilwaukeeWI United States California State University Northridge Los AngelesCA United States Tufts University MedfordMA United States

ISBN: (纸本)9783031389054

We introduce the Observation Route Problem (ORP) defined as follows: Given a set of n pairwise disjoint compact regions in the plane, find a shortest tour (route) such that an observer walking along this tour can see (observe) some point in each region from some point of the tour. the observer does not need to see the entire boundary of an object. the tour is not allowed to intersect the interior of any region (i.e., the regions are obstacles and therefore out of bounds). the problem exhibits similarity to both the Traveling Salesman Problem with Neighborhoods (TSPN) and the External Watchman Route Problem (EWRP). We distinguish two variants: the range of visibility is either limited to a bounding rectangle, or unlimited. We obtain the following results: (I)Given a family of n disjoint convex bodies in the plane, computing a shortest observation route does not admit a (clog n) -approximation unless P= NP for an absolute constant c> 0. (this holds for both limited and unlimited vision.)(II)Given a family of disjoint convex bodies in the plane, computing a shortest external watchman route is NP -hard. (this holds for both limited and unlimited vision;and even for families of axis-aligned squares.)(III)Given a family of n disjoint fat convex polygons, an observation tour whose length is at most O(log n) times the optimal can be computed in polynomial time. (this holds for limited vision.)(IV)For every n≥ 5, there exists a convex polygon with n sides and all angles obtuse such that its perimeter is not a shortest external watchman route. this refutes a conjecture by Absar and Whitesides (2006). © the Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Convolutional Neural Network for Classification of Source Codes 13

Convolutional Neural Network for Classification of Source Co...

引用

IEEE 13th international symposium on Embedded Multicore/Many-Core Systems-on-Chip (MCSoC)

作者： Ohashi, Hiroki Watanobe, Yutaka Univ Aizu Grad Dept Comp Sci & Engn Fukushima 9658580 Japan

ISBN: (纸本)9781728148823

A method to classify source code based on convolutional neural networks is presented. the goal of the neural networks is to predict the type of algorithm that is used in the corresponding source code so that the result obtained can be used for different kinds of assistance and assessment for programming education. In the proposed method, source code is converted into a sequence that represents the structure of the code without any keywords, such as variable names or function names. In present paper, models and implementation of the proposed method are presented. An experiment considering several algorithm types is also conducted. For evaluation of the proposed method, source code accumulated in an online judge system is used. the results of the experiment demonstrate that the proposed method can predict the algorithm used in the given source code to a high degree of accuracy.

关键词： Feature extraction Classification algorithms Prediction algorithms Programming profession data structures Computer languages

来源：评论

学校读者我要写书评

暂无评论

Online Labeling: algorithms, Lower Bounds and Open Questions 1

引用

symposium on 13th international Computer Science - theory and Applications

作者： Saks, Michael Rutgers State Univ Dept Math New Brunswick NJ 08854 USA

ISBN: (数字)9783319905303

ISBN: (纸本)9783319905303;9783319905297

the online labeling problem (also known as the file maintenance problem), is a natural algorithmic problem that has arisen as a buidling block for data structures. A stream of distinct integer items is to be assigned labels online from a label set {1, ... , m} so that the order of the labels respects the natural order of the items. Maintaining order on the labels may require relabeling items. the algorithm pays 1 each time an item is labeled or relabeled and the goal of the algorithm is to minimize the total cost. We survey upper and lower bounds and open problems in both the deterministic and randomized setting.

关键词： Online labeling data structures

来源：评论

学校读者我要写书评

暂无评论

Optimal Query Time for Encoding Range Majority 15th

Optimal Query Time for Encoding Range Majority

引用

15th international algorithms and data structures symposium (wads)

作者： Gawrychowski, Pawel Nicholson, Patrick K. Univ Haifa Haifa Israel Nokia Bell Labs New Providence NJ USA

ISBN: (纸本)9783319621272;9783319621265

We revisit the range tau-majority problem, which asks us to preprocess an array A[1..n] for a fixed value of tau is an element of (0, 1/2], such that for any query range [i, j] we can return a position in A of each distinct tau-majority element. A tau-majority element is one that has relative frequency at least tau in the range [i, j]: i.e., frequency at least tau (j-i+1). Belazzougui et al. [wads 2013] presented a data structure that can answer such queries in O(1/tau) time, which is optimal, but the space can be as much as theta(n lg n) bits. Recently, Navarro and thankachan [Algorithmica 2016] showed that this problem could be solved using an O(n lg(1/tau)) bit encoding, which is optimal in terms of space, but has suboptimal query time. In this paper, we close this gap and present a data structure that occupies O(n lg(1/tau)) bits of space, and has O(1/tau) query time. We also show that this space bound is optimal, even for the much weaker query in which we must decide whether the query range contains at least one tau-majority element.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：