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

29th IEEE Asia Pacific Conference on Communications, APCC 2024

作者： Liang, Chengchao Huang, Yuran Liu, Yidian Chai, Rong Chen, Qianbin Carleton Univ. Depart. of Systems and Computer Eng. OttawaON Canada Chongqing Univ. Posts & Telecom. School of Communication and Information Engineering Chongqing China

ISBN: (纸本)9798331517816

Low Earth Orbit (LEO) satellite systems provide geographically unrestricted services to ground users. However, the conflict between existing resource allocation schemes and the variability of inter-beam traffic is becoming increasingly prominent. To address this issue, this paper proposes a resource allocation strategy for beam-hopping satellite networks based on Rate-Splitting Multiple Access (RSMA) technology, aiming to reduce co-channel interference while improving system resource utilization. First, by analyzing the resource allocation challenges faced by beam-hopping satellite networks, including low spectrum utilization and co-channel interference, the background and motivation for the proposed strategy are provided. Next, RSMA technology is introduced, dividing user messages into common and private parts, and a corresponding resource allocation algorithm is designed to enhance spectrum utilization and reduce co-channel interference. Through the construction of a system model and simulation experiments, the effectiveness and performance advantages of the proposed strategy are verified. This study provides new ideas and methods for resource allocation in beam-hopping satellite networks, which is significant for improving system performance and service quality. © 2024 IEEE.

关键词： Cochannel interference

来源：评论

学校读者我要写书评

暂无评论

Memristor-based random access memory: The delayed switching effect could revolutionize memory design 15

Memristor-based random access memory: The delayed switching ...

引用

15th Non-Volatile Memory Technology Symposium, NVMTS 2015

作者： Wang, Frank Zhigang Chua, Leon O. Helian, Na School of Computing University of Kent Canterbury United Kingdom Depart. of Electrical Engineering and Computer Science University of California Berkeley United States School of Computer Science University of Hertfordshire Hatfield United Kingdom

ISBN: (纸本)9781509021260

Memristor's on/off resistance can naturally store binary bits for non-volatile memories. In this work, we found that memristor's another peculiar feature that the switching takes place with a time delay (we name it the delayed switching) can be used to selectively address any desired memory cell in a crossbar array. The analysis shows this is a must-be in a memristor with a piecewise-linear 9-q curve. A circuit model-based experiment has verified the delayed switching feature. It is demonstrated that memristors can be packed at least twice as densely as semiconductors, achieving a significant breakthrough in storage density. © 2015 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

information hiding in standard MIDI files based on velocity reference values

引用

International Journal of Network Security 2016年第2期18卷 274-282页

作者： Wu, Da-Chun Chen, Ming-Yao Depart. of Computer and Communication Engineering National Kaohsiung First University of Science and Technology No. 1 University Rd Yanchao Dist. Kaohsiung City824 Taiwan Institute of Engineering Science and Technology National Kaohsiung First University of Science and Technology No. 1 University Rd Yanchao Dist. Kaohsiung City824 Taiwan

This paper proposed a novel method to embed information in SMFs (Standard MIDI Files) by slightly adjusting the velocity values of notes. First, this method uses the velocity values of the first note of strong beat, the first of weak beat, and the first second-strong beat with non-zero velocity value in a measure as the referencing values for velocity of other notes in the same measure. Then, the data are embedded in the velocity values of notes excluding the notes with the referencing values. The method uses the difference between the velocity value of each note and its corresponding reference value to decide the number of bits which can be used for embedding data in each note. The proposed method limits the changes of the velocity value of each note to its original value and its corresponding reference value during the data embedding. It can avoid the differences from the original music being heard due to the velocity values excessive change. In addition, the proposed method can also embed data without changing the file sizes of the SMFs. It can also avoid attracting attention. The experimental results show the feasibility of the proposed method.

关键词： Velocity

来源：评论

学校读者我要写书评

暂无评论

Closed-form design of fractional delay FIR filter using discrete hartley transform

Closed-form design of fractional delay FIR filter using disc...

引用

IEEE Region 10 International Conference TENCON

作者： Chien-Cheng Tseng Su-Ling Lee Depart. of Computer and Communication Engineering National Kaohsiung First University of Science and Technology Kaohsiung Taiwan Depart. of Computer Science and Information Engi Chungju National University Tainan Taiwan

In this paper, the design of fractional delay FIR filter is investigated. First, the interpolation formula of discrete-time sequence is derived by using discrete Hartley transform (DHT). Then, the DHT-based interpolation formula is applied to design fractional delay FIR filter by using suitable index mapping. The filter coefficients are easily computed because closed-form design is obtained. Finally, design examples are demonstrated to show the proposed method has smaller design error than the conventional Lagrange fractional delay FIR filter using the same design parameters

关键词： Delay Finite impulse response filter Discrete transforms Interpolation Lagrangian functions Design methodology Frequency Content addressable storage Signal design Design engineering

来源：评论

学校读者我要写书评

暂无评论

Secure k-connectivity properties of wireless sensor networks

Secure k-connectivity properties of wireless sensor networks

引用

2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS

作者： Yee, Wei Law Yen, Li-Hsing Di Pietro, Roberto Palaniswami, Marimuthu Depart. of Electrical and Electronic Engineering University of Melbourne Australia Department of Computer Science National University of Kaohsiung Taiwan Department of Mathematics Università di Roma Tre Italy

ISBN: (纸本)1424414555

A k-connected wireless sensor network (WSN) allows messages to be routed via one (or more) of at least k node-disjoint paths, so that even if some nodes along one of the paths fail, or are compromised, the other paths can still be used. This is a much desired feature in fault tolerance and security. k-connectivity in this context is largely a well-studied subject. When we apply the random key predistribution scheme to secure a WSN however, and only consider the paths consisting entirely of secure (encrypted and/or authenticated) links, we are concerned with the secure k-connectivity of the WSN. This notion of secure k-connectivity is relatively new and no results are yet available. The random key pre-distribution scheme has two important parameters: the key ring size and the key pool mechsize. While it has been determined before the relation between these parameters and 1-connectivity, our work in k-connectivity is new. Using a recently introduced random graph model called kryptograph, we derive mathematical formulae to estimate the asymptotic probability of a WSN being securely k-connected, and the expected secure k-connectivity, as a function of the key ring size and the key pool size. Finally, our theoretical findings are supported by simulation results. ©2007 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Linear complexity of quaternary sequences constructed from binary Legendre sequences

Linear complexity of quaternary sequences constructed from b...

引用

International Symposium on information Theory and Its Applications, ISITA

作者： Young-Sik Kim Ji-Woong Jang Sang-Hyo Kim Jong-Seon No Depart. Information & Communication Engineering Chosun University Gwangju Korea Depart. Computer & Information Technology Ulsan College Ulsan Korea School of Information & Communication Engineering Sungkyungkwan University Suwon Korea Depart. Electrical Engineering and Computer Science Seoul National University Seoul Korea

In this paper, we derive the linear complexity of the quaternary sequences proposed by Kim, Jang, Kim, and No. Because the period of the quaternary sequences is 2p, we introduce the discrete Fourier transform over the finite field F qm which is a splitting field of x 2p - 1. It turns out that the linear complexity over F qm of the quaternary sequence constructed from the Legendre sequence is p or 2p - 1.

关键词： Complexity theory Discrete Fourier transforms Correlation Educational institutions Multiaccess communication Cryptography

来源：评论

学校读者我要写书评

暂无评论

Time Adaptive Dual Particle Swarm Optimization

Time Adaptive Dual Particle Swarm Optimization

引用

Congress on Evolutionary Computation

作者： Ulysse Côté Allard Gabriel Dubé Richard Khoury Luc Lamontagne Benoit Gosselin François Laviolette Depart. of Computer and Electrical Engineering Depart. of Computer Science and Software Engineering Université Laval Québec Québec Canada

ISBN: (纸本)9781509046027

This paper presents a novel particle swarm optimization (PSO) algorithm that combines the strengths of several PSO variants into a single competitive algorithm. This novel algorithm, named Time Adaptive Dual Particle Swarm Optimization (TAD-PSO), is comprised of two specialized populations, with one focusing on exploration of the search space and the other on exploitation. The main population, specialized in exploration, uses orthogonal learning to create information-rich exemplars which intelligently guide particle movement throughout the search space. The auxiliary population uses a PSO variant known for its very fast convergence speed, and thus very high performance on unimodal problems. This population is specialized in exploitation of the interesting local minima. The main population size decays linearly, to foster exploration early and convergence in the later stages of the optimization procedure. Additionally, TAD-PSO does not have the topological structure of the swarm as an algorithm hyper-parameter, making it a fast and simple algorithm to apply to new problems. TAD-PSO was tested extensively and compared to 6 widely used PSO variants on 19 benchmark problems, for 10, 30 and 100 dimensions. TAD-PSO consistently ranked first in each dimensional space, making it a competitive optimization algorithm on both unimodal and multimodal problems.

关键词： Sociology Statistics Particle swarm optimization Topology Optimization Convergence Animals

来源：评论

学校读者我要写书评

暂无评论

Curvature nonlinearity measure and filter divergence detector for nonlinear tracking problems

Curvature nonlinearity measure and filter divergence detecto...

引用

11th International Conference on information Fusion, FUSION 2008

作者： Niu, Ruixin Varshney, Pramod K. Alford, Mark Bubalo, Adnan Jones, Eric Scalzo, Maria Depart. of Electrical Engineering and Computer Science Syracuse University Syracuse NY 13244 United States Air Force Research Laboratory RIEA Rome NY 13441 United States

ISBN: (纸本)9783000248832

Several nonlinear filtering techniques are investigated for nonlinear tracking problems. Experimental results show that for a weakly nonlinear tracking problem, the extended Kalman filter and the unscented Kalman filter are good choices, while a particle filter should be used for problems with strong nonlinearity. To quantitatively determine the nonlinearity of a nonlinear tracking problem, we propose two types of measures: one is the differential geometry curvature measure and the other is based on the normalized innovation squared (NIS) of the Kalman filter. Simulation results show that both measures can effectively quantify the nonlinearity of the problem. The NIS is capable of detecting the filter divergence online. The curvature measure is more suitable for quantifying the nonlinearity of a tracking problem as determined via simulations.

关键词： Extended Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Acquisition of rule-based knowledge for analyzing DNA-binding sites in proteins 2

Acquisition of rule-based knowledge for analyzing DNA-bindin...

引用

2nd International Conference on Scalable information Systems, InfoScale 2007

作者： Ho, Shinn-Jang Chang, Chia-Yun Huang, Liang-Tsung Hwang, Shiow-Fen Ho, Shinn-Ying Depart. of Automation Engineering National Univ. Formosa University Taiwan Yunlin632 Taiwan Institute of Bioinformatics National Chiao Tung Univ. Hsinchu300 Taiwan Depart. of Information Eng. and Computer Science Feng Chia University Taichung407 Taiwan Institute of Bioinformatics National Chiao Tung Hsinchu300 Taiwan

ISBN: (纸本)9781595937575

This study aims to analyze DNA-binding proteins via acquisition of interpretable knowledge which can accurately predict binding sites in proteins to understand DNA-protein recognition mechanism. For mining accurate and interpretable knowledge, a large-scale dataset consisting of 982 DNA-binding proteins is constructed. This study investigates a novel feature set consisting of 11 features, including solvent accessibility, secondary structure, charge information near the residue, amino acid group and neighbor property. The derived binding and non-binding rules reveal that besides the well-known solvent accessibility, the electric charge distribution near the residue and the amino acid groups also play important roles in prediction of binding sites. The interpretable and accurate knowledge is helpful for biologist to analyze DNA-binding proteins.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

High-Performance Ka-Band Microstrip Patch Antenna for Next-Generation Networks at 33 GHz 2

High-Performance Ka-Band Microstrip Patch Antenna for Next-G...

引用

2nd IEEE International Conference on Networking and Communications, ICNWC 2024

作者： Subramanian, Suresh Narmadha, D. Sundar, G. Naveen Iwin Thanakumar Joseph, S. Saravanan, S. Bruntha, P. Malin Saveetha Institute of Medical and Technical Sciences Saveetha School of Engineering Depart. of Electronics and Communication Engineering Chennai India Karunya Institute of Technology and Sciences Department of Computer Science and Engineering Coimbatore India Koneru Lakshmaiah Education Foundation Department of Computer Science and Engineering Andhrapradesh Vaddeswaram India VIT School of Design Department of Multimedia Vellore India Karunya Institute of Technology and Sciences Depart. of Electronics and Communication Engineering Coimbatore India

ISBN: (纸本)9798350365269

A proposed microstrip patch antenna, powered through microstrip feeding and tailored for Ka-band applications (30-40 GHz), signifies a notable advancement in antenna technology. This work is particularly pertinent to next-generation network applications, with a specific focus on the frequency of 33 GHz. The antenna is fabricated using the Rogers RT/Duroid 5880™ substrate, renowned for its distinct attributes. Notably, it boasts a remarkably low dielectric loss tangent of 0.0009, coupled with a relative permittivity of 2.2 and a thickness measuring 1mm. These characteristics render it well-suited for antennas necessitating minimal signal attenuation, effective concentration of electromagnetic waves, and meticulous dimensional management. Simulation and thorough analysis of the antenna's performance have been conducted using Ansoft HFSS. This comprehensive assessment of radiation performance parameters is crucial to ensure that the microstrip patch antenna functions effectively within the specified Ka band frequencies, thus aligning with the requirements of next-generation network applications. © 2024 IEEE.

关键词： Next generation networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：