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

On self-dual and LCD double circulant and double negacirculant codes over Fq+ uFq

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shi, Minjia Zhu, Hongwei Qian, Liqin Sok, Lin Sol, Patrick Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University No.3 Feixi Road Hefei Anhui230039 China School of Mathematical Sciences Anhui University Hefei Anhui230601 China National Mobile Communications Research Laboratory Southeast University China Department of Mathematics Royal University of Phnom Penh Phnom Penh12156 Cambodia CNRS LAGA University of Paris 8 Saint-Denis93526 France

Double circulant codes of length 2n over the semilocal ring R = Fq + uFq, u2 = u, are studied when q is an odd prime power, and-1 is a square in Fq. Double negacirculant codes of length 2n are studied over R when n is even and q is an odd prime power. Exact enumeration of self-dual and LCD such codes for given length 2n is given. Employing a duality-preserving Gray map, self-dual and LCD codes of length 4n over Fq are constructed. Using random coding and the Artin conjecture, the relative distance of these codes is bounded below. The parameters of examples of the modest length are computed. Several such codes are optimal. Copyright © 2018, The Authors. All rights reserved.

关键词：

How many weights can a linear code have?

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shi, Minjia Zhu, Hongwei Solé, Patrick Cohen, Gérard D. Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University No. 3 Feixi Road Hefei Anhui Province230039 China School of Mathematical Sciences Anhui University Hefei230601 China CNRS/LAGA University of Paris 8 2 rue de la Liberté Saint-Denis93 526 France TelecomParisTech 46 rue Barrault Paris75 013 France

We study the combinatorial function L(k, q), the maximum number of nonzero weights a linear code of dimension k over Fq can have. We determine it completely for q = 2, and for k = 2, and provide upper and lower bounds in the general case when both k and q are ≥ 3. A refinement L(n, k, q), as well as nonlinear analogues N(M, q) and N(n, M, q), are also introduced and studied. Copyright © 2018, The Authors. All rights reserved.

关键词： Codes (symbols)

A Novel Compact Broadband Circularly Polarized Antenna for GNSS

学校读者我要写书评

暂无评论

A Novel Compact Broadband Circularly Polarized Antenna for G...

IEEE Asia-Pacific Conference on Antennas and Propagation

作者： Aoyun Zhang Zhongxiang Zhang Wensheng Yu Xianliang Wu Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University School of Electronic and Information Engineering Hefei Normal University

ISBN: (纸本)9781538616093

A novel compact broadband circularly polarized (CP) antenna is proposed for use in the Global Navigation Satellite System (GNSS). Circular polarization for the presented antenna is achieved by introducing two L-shaped branches in the ground plane and inverted L-shaped microstrip fed. The antenna exhibits a wide impedance bandwidth of 44.9% (1.14-1.8GHz) for reflection coefficient<-10dB and an axial ratio (AR) bandwidth of 36.9% (1.15-1.67GHz) for AR<3dB. The CP bandwidth (reflection coefficient<-10dB and AR<3dB) can cover all GNSS frequency bands. Although simple in structure, the antenna can meet the requirements for handheld wireless terminals.

关键词： Broadband Circular polarization Compact GNSS

Radio detection of an elusive millisecond pulsar in the Globular Cluster NGC 6397

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Lei Ridolfi, Alessandro Blumer, Harsha Freire, Paulo C.C. Manchester, Richard N. McLaughlin, Maura Kremer, Kyle Cameron, Andrew D. Zhang, Zhiyu Behrend, Jan Burgay, Marta Buchner, Sarah Champion, David J. Chen, Weiwei Dai, Shi Feng, Yi Fu, Xiaoting Guo, Meng Hobbs, George Keane, Evan F. Kramer, Michael Levin, Lina Li, Xiangdong Ni, Mengmeng Pan, Jingshan Padmanabh, Prajwal V. Possenti, Andrea Ransom, Scott M. Tsai, Chao-Wei Krishnan, Vivek Venkatraman Wang, Pei Zhang, Jie Zhi, Qijun Zhang, Yongkun Li, Di National Astronomical Observatories Chinese Academy of Sciences A20 Datun Road Chaoyang District Beijing100101 China Centre for Astrophysics and Supercomputing Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia SelargiusI-09047 Italy Department of Physics and Astronomy West Virginia University MorgantownWV26506 United States Max-Planck Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany CSIRO Space and Astronomy Australia Telescope National Facility PO Box 76 EppingNSW1710 Australia TAPIR California Institute of Technology PasadenaCA91125 United States The Observatories of the Carnegie Institution for Science PasadenaCA91101 United States Swinburne University of Technology Mail H74 PO Box 218 VIC3122 Australia School of Astronomy and Space Science Nanjing University Nanjing210023 China Ministry of Education Nanjing210093 China South African Radio Astronomy Observatory Fir Street Black River Park Cape Town7925 South Africa School of Science Western Sydney University Locked Bag 1797 PenrithNSW2751 Australia Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Purple Mountain Observatory Chinese Academy of Sciences Nanjing210023 China National Supercomputing Center in Jinan Qilu University of Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China Jinan Institute of Supercomputing Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China School of Physics Trinity College Dublin College Green Dublin Ireland Jodrell Bank Centre for Astrophysics Department of Physics and Astronomy The University of Manchester ManchesterM13 9PL United Kingdom HannoverD-30167 Germany MonserratoI-09042 Italy NRAO 520 Edgemont Road CharlottesvilleVA22903 United States College of Physics and Electronic Engineering Qilu Normal University 2 Wenbo Road Zhangqiu District Jinan250200 China Guizhou Provincial Key Laboratory of Radio

We report the discovery of a new 5.78 ms-period millisecond pulsar (MSP), PSR J1740−5340B (NGC 6397B), in an eclipsing binary system discovered with the Parkes radio telescope (now also known as Murriyanga), Australia, and confirmed with the MeerKAT radio telescope in South Africa. The measured orbital period, 1.97 days, is the longest among all eclipsing binaries in globular clusters (GCs) and consistent with that of the coincident X-ray source U18, previously suggested to be a ‘hidden MSP’. Our XMM-Newton observations during NGC 6397B’s radio quiescent epochs detected no X-ray flares. NGC 6397B is either a transitional MSP or an eclipsing binary in its initial stage of mass transfer after the companion star left the main sequence. The discovery of NGC 6397B potentially reveals a subgroup of extremely faint and heavily obscured binary pulsars, thus providing a plausible explanation to the apparent dearth of binary neutron stars in core-collapsed GCs as well as a critical constraint on the evolution of GCs. Copyright © 2022, The Authors. All rights reserved.

关键词： Mass transfer

Framework for adaptive computation offloading in IoT applications 17

学校读者我要写书评

暂无评论

Framework for adaptive computation offloading in IoT applica...

9th Asia-Pacific Symposium on Internetware, Internetware 2017

作者： Chen, Shihong Liu, Bichun Chen, Xing Zhang, Ying Huang, Gang College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China

ISBN: (纸本)1595930361

The internet of things (IoT) attracts great interest in many application domains concerned with monitoring and control of physical phenomena. IoT applications try to provide more and more functionality and then they inevitably become so complex as to make the limits of devices worse, which may lead to poor performance of applications. Computation offloading is a promising way to improve the performance of an IoT application by executing some parts of the application on remote devices or servers. However, supporting such capability is not easy for application developers due to (1) adaptability: IoT applications often face changes of runtime environments so that the adaptation on offloading is needed. (2) effectiveness: when the device context changes, it needs to dynamically decide the deployment plan of computation tasks, and the reduced execution time must be greater than the network delay and extra overheads caused by offloading. This paper proposes a framework which supports IoT applications with adaptive computation offloading capability. First, a design pattern is proposed to enable an application to be computation offloaded on-demand. Second, an estimation model is presented to automatically decide the deployment plan for offloading. Third, a framework is implemented to support the design pattern and the estimation model. A thorough zxevaluation on the real-world application is proposed, and the results show that our approach can help reduce execution time by over 45% in most scenarios.

关键词： computation offloading

Corrigendum to “Integrated production and transportation on parallel batch machines to minimize total weighted delivery time” [Computers and Operations Research Volume 102, pages 39–51]

学校读者我要写书评

暂无评论

Computers & Operations Research 2019年 105卷 248-248页

作者： Zhao-hong Jia Xue-xue Zhuo Joseph Y.-T. Leung Kai Li Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui 230039 P.R. China Department of Computer Science New Jersey Institute of Technology Newark NJ 07102 USA School of Management Hefei University of Technology Hefei Anhui 230009 P.R. China

Double circulant self-dual and LCD codes over Galois rings

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shi, Minjia Huang, Daitao Sok, Lin Solé, Patrick School of Mathematical Sciences Anhui University Hefei230601 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University No. 3 Feixi Road Hefei Anhui Province230039 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Anhui University Hefei230601 China CNRS/LAGA University of Paris 8 2 rue de la Liberté Saint-Denis93 526 France

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic p2 and order p4 with p and odd prime. When p ≡ 3 (mod 4), we give an algorithm to construct a duality preserving bijective Gray map from such a Galois ring to Z2p2. Using random coding, we obtain families of asymptotically good self-dual and LCD codes over Zp2, for the metric induced by the standard Fp-valued Gray maps. Copyright © 2018, The Authors. All rights reserved.

关键词： Codes (symbols)

A new distance-regular graph of diameter 3 on 1024 vertices

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shi, Minjia Krotov, Denis S. Solé, Patrick Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University No.3 Feixi Road Hefei Anhui230039 China School of Mathematical Sciences Anhui University Hefei Anhui230601 China Sobolev Institute of Mathematics pr. Akademika Koptyuga 4 Novosibirsk630090 Russia 4CNRS/LAGA University of Paris 8 2 rue de la Liberté Saint-Denis93 526 France

The dodecacode is a nonlinear additive quaternary code of length 12. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance 5. In particular, this latter code is completely regular but not completely transitive. Its coset graph is distance-regular of diameter three on 210 vertices, with new intersection array -33, 30, 15;1, 2, 15}. The automorphism groups of the code, and of the graph, are determined. Connecting the vertices at distance two gives a strongly regular graph of (previously known) parameters (210, 495, 238, 240). Another strongly regular graph with the same parameters is constructed on the codewords of the dual code. A non trivial completely regular binary code of length 33 is constructed.05E30, 94B05 Copyright © 2018, The Authors. All rights reserved.

关键词： Additives

A novel HEFTS-L algorithm for scheduling large number of DAG tasks

学校读者我要写书评

暂无评论

A novel HEFTS-L algorithm for scheduling large number of DAG...

2017 3rd Workshop on Advanced Research and Technology in Industry Applications(WARTIA 2017)

作者： Xin Liu Rongbin Xu Yongliang Cheng Pengfei Zhang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education School of Computer Science and Technology Anhui University Co-Innovation Center for Information Supply & Assurance Technology Anhui University

In recent years, along with the development of technologies for distributed computing such as big data and clouds workflow systems, efficiency of workflow scheduling has become very impotent. Hence sc

关键词：