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

2012 Loughborough Antennas and Propagation Conference, LAPC 2012

作者： Mahdi, Qaysar S. Qaysi, Husham J. A. Al- Communication and Computer Engineering Depart. Cihan University Erbil Iraq

ISBN: (纸本)9781467322195

In this paper a comparison study is presented in order to evaluate the Simultaneous Multi - Beams radar under different radar cross section and different transmitting frequencies in order to evaluate the new radar performance under such complex environment. The results show that increasing the transmitting frequency will decrease the radar coverage and increasing the radar cross section will increase the radar coverage. Under such conditions the Simultaneous Multi - Beams radar offers good maneuverability and performance because it will choose the best type of beam according to the radar type, radar cross section, target height and frequency diversity. Also it is concluded that the planner array will provide good beam forming and beam shaping techniques and it is possible to implement and construct a smart DSP processor which will choose the appropriate beam according to the target plat form and detection scenario for the new technology in addition to save time and cost. © 2012 IEEE.

关键词： Radar cross section

来源：评论

学校读者我要写书评

暂无评论

A secure destination-sequenced distance-vector routing protocol for ad hoc networks

引用

Journal of Networks 2010年第8期5卷 942-948页

作者： Wang, Jyu-Wei Chen, Hsing-Chung Lin, Yi-Ping Depart. of Photonics and Communication Engineering Asia University No.500 Lioufong Rd. Wufong Township Taichung County 413 Taiwan Depart. of Computer Science and Information Technology Asia University Taichung Taiwan

This paper presents a secure destination- sequenced distance-vector (SDSDV) routing protocol for mobile ad hoc wireless networks. The proposed protocol is based on the regular DSDV protocol. Within SDSDV, each node maintains two one-way hash chains about each node in the network. Two additional fields, which we call AL (alteration) field and AC (accumulation) field, are added to each entry of the update packets to carry the hash values. With proper use of the elements of the hash chains, the sequence number and the metric values on a route can be protected from being arbitrarily tampered. In comparison with the secure efficient ad hoc distance vector (SEAD) protocol previously proposed in the literature provides only a non-decreasing protection on the metrics, SDSDV can provide complete protection. © 2010 Academy Publisher.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

The development of microsystems device based on Wireless Sensor Network

The development of microsystems device based on Wireless Sen...

引用

2010 International Symposium on computer, communication, Control and Automation, 3CA 2010

作者： Pan, Y.-J. Nian, H.-T. Depart. of Computer and Communication Engineering Ta Hwa Institute of Technology Hsinchu Taiwan

ISBN: (纸本)9781424455669

The idea of Wireless Personal Area Network (WPAN) is using a short range and low power wireless network technology to connect certain devices. Wireless Sensor Network (WSN) is one of the technologies to realize WPAN. It can setup a low cost, low power and low data transfer rate wireless network in a particular area by deploying several network nodes. The application includes building automation, industrial control, remote control and healthcare. This study proposes a device of microsystems based on ZigBee Wireless Sensor Network. We use embedded controller and ZigBee module to implement a programmable network node. We set up a wireless sensor network in distributed structure by several network nodes and PC. Finally, we would use this wireless network to establish a detection system of micromixer. © 2010 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Noise Reduction of Temperature Data Using Jacobi and Gauss-Seidel Iterations

Noise Reduction of Temperature Data Using Jacobi and Gauss-S...

引用

2024 International Symposium on Intelligent Signal Processing and communication Systems, ISPACS 2024

作者： Tseng, Chien-Cheng Lee, Su-Ling Depart. of Computer and Communication Engineering National Kaohsiung University of Sci. and Tech Kaohsiung Taiwan Depart. of Computer Science and Information Engineering Chang Jung Christian University Tainan Taiwan

ISBN: (纸本)9798350389210

When a sensor network is used to collect temperature data, the data may be corrupted by unwanted noise. Therefore, it is desirable to develop a graph signal processing (GSP) method to reduce noise when the sensor network is represented as a graph model. Traditionally, a smoothness-based method has been used to address this problem, assuming that temperature data is smooth over the network while noise exhibits high variation. This method requires solving a linear system using matrix inversion, which is impractical for large networks. In this article, we present the Jacobi and Gauss-Seidel iterations to solve the linear system of the smoothness-based method. These iterations generate a sequence of approximate solutions that only involve matrix-vector multiplication of the sparse matrix. We derive the convergence conditions of these iterative methods to ensure that a solution can be obtained. Finally, we use temperature data collected by sensor network in Taiwan to study the convergence speed of the iterations. We also demonstrate the signal-to-noise ratio (SNR) improvement of the proposed method to show its effectiveness in noise reduction. © 2024 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

A Steepest Descent Method for Time Estimation of Heat Diffusion Over Graph

A Steepest Descent Method for Time Estimation of Heat Diffus...

引用

2024 International Symposium on Intelligent Signal Processing and communication Systems, ISPACS 2024

ISBN: (纸本)9798350389210

Heat diffusion over a graph extends the classical heat diffusion problem into the realm of graph theory, where a graph consists of nodes connected by edges. This concept is widely used in various fields, such as network theory, computer science, and data analysis, to model and study the spread of heat through complex networks. Understanding heat diffusion over a graph provides powerful insights into the dynamic processes occurring within networks, offering a robust framework for analyzing and solving complex problems across various domains. In this paper, the heat diffusion process is treated as a graph signal governed by a discrete heat equation. When a noisy graph signal of heat diffusion is measured, the challenge is to estimate the diffusion time from the noisy measurement signal. To tackle this issue, a steepest descent method is proposed to estimate the diffusion time by minimizing the error function between the model signal and the measured signal. The matrix exponential used to compute model signal is calculated by using polynomial graph filter method for reducing the computation complexity. Experiments conducted on complex networks in the USA, with single-point, double-point, and triple-point heat sources, demonstrate the effectiveness of the proposed method. © 2024 IEEE.

关键词： Steepest descent method

来源：评论

学校读者我要写书评

暂无评论

A fusion method for low-illumination color image enhancement on CIELUV space 8

A fusion method for low-illumination color image enhancement...

引用

8th IEEE Global Conference on Consumer Electronics, GCCE 2019

作者： Lee, Su-Ling Tseng, Chien-Cheng Chang-Jung Christian University Depart. of Computer Science and Information Engineering Tainan Taiwan National Kaohsiung University of Sci. and Tech. Depart. of Computer and Communication Engineering Kaohsiung Taiwan

ISBN: (纸本)9781728135755

In this paper, a fusion method for low-illumination color image enhancement on CIELUV space is presented. First, the input color image on RGB space is converted into the one on CIELUV space. Then, three color image enhancement methods are employed to enhance the low-illumination image individually including chroma-based method, homomorphic filtering method, and power-law transformation (PLT) method. Next, a Gaussian weighting fusion method is applied to combine three individual enhanced images to obtain the final enhanced image. Finally, low-illumination images are used to evaluate the enhanced quality of the proposed method and make comparison with conventional method. © 2019 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

A Graph Signal Denoising Method Using Total Variation Regularization and Fractional Graph Fourier Transform

A Graph Signal Denoising Method Using Total Variation Regula...

引用

2024 International Symposium on Intelligent Signal Processing and communication Systems, ISPACS 2024

ISBN: (纸本)9798350389210

In the research area of graph signal processing (GSP), total variation (TV) regularization has been effectively utilized to develop a graph signal denoising method in the vertex domain. This paper aims to enhance the performance of the traditional TV-based denoising method by first providing the spectral-domain interpretation of the total variation regularization method. Then, the graph Fourier transform (GFT) is extended to the fractional graph Fourier transform (FrGFT) to obtain a more generalized TV regularization method based on FrGFT. The conventional TV regularization is merely a special case of the proposed TV regularization using FrGFT. Next, a new denoising method is introduced, which considers the trade-off between signal distortion and TV using FrGFT. A step-by-step procedure for computing the denoised signal is also provided, making it easy to apply in various applications. Finally, the effectiveness of the proposed denoising method based on TV regularization and FrGFT is demonstrated using temperature data from a sensor network in the USA. The signal-to-noise ratio (SNR) improvement is used to determine the optimal fractional order of the FrGFT for achieving the best-denoised signal. © 2024 IEEE.

关键词： Signal denoising

来源：评论

学校读者我要写书评

暂无评论

A Rational Graph Filter Method for GFT Centrality Computation 6

A Rational Graph Filter Method for GFT Centrality Computatio...

引用

6th International Symposium on computer, Consumer and Control, IS3C 2023

作者： Tseng, Chien-Cheng Lee, Su-Ling National Kaohsiung University of Sci. and Tech Depart. of Computer and Communication Engineering Kaohsiung Taiwan Chang Jung Christian University Depart. of Computer Science and Information Engineering Tainan Taiwan

ISBN: (纸本)9798350301953

Graph Fourier transform (GFT) is an important tool for analyzing the irregular graph signals collected from various real-world networks. One of its applications is the graph Fourier transform centrality (GFTC) which has been developed to find the influential nodes in the graphical representations of networks. In the traditional GFTC computation method, the eigen-decomposition of Laplacian matrix needs to be calculated for obtaining the GFT basis to compute GFTC. To reduce the computational complexity, a rational graph filter (RGF) method is presented in this paper. The main technique is that the spectral-domain computational task is converted to the vertex-domain one by using Parseval's theorem of GFT. The Pade method and Maclaurin series expansion are applied to obtain the filter coefficients of RGF when the weight function of GFTC is specified. Finally, the Taipei metro network is used to demonstrate the effectiveness of GFTC index for identifying the important stations in the metro network. © 2023 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Design of Graph Filter Using Hilbert Matrix and Vandermonde Matrix

Design of Graph Filter Using Hilbert Matrix and Vandermonde ...

引用

2023 VTS Asia Pacific Wireless communications Symposium, APWCS 2023

作者： Tseng, Chien-Cheng Lee, Su-Ling National Kaohsiung University of Sci. and Tech. Depart. of Computer and Communication Engineering Kaohsiung Taiwan Chang-Jung Christian University Depart. of Computer Science and Information Engineering Tainan Taiwan

ISBN: (纸本)9798350316803

The graph filter is a useful tool for processing signals collected from various networks. This paper presents the closed-form design of a graph filter. Depending on whether the graph frequency is known or not, there are two types of designs studied here. The first design is the graph-unaware method, where the graph frequency does not need to be known in advance. In this case, the filter coefficients are determined by minimizing the integral squared errors between the actual response and the ideal response. The optimal solution is then obtained by using the inverse of the Hilbert matrix. The second design is the graph-aware method, where the graph frequency needs to be known in advance. In this case, the filter coefficients are obtained by letting the actual response be equal to the ideal response at the prescribed frequency points. The solution is obtained by using the inverse of the Vandermonde matrix. Finally, the temperature data denoising of sensor networks with different sizes are used to demonstrate the effectiveness of the designed graph filters. © 2023 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Closed-Form Parameter Determination Method for Quantum State Preparation Circuit

A Closed-Form Parameter Determination Method for Quantum Sta...

引用

2024 International Symposium on Intelligent Signal Processing and communication Systems, ISPACS 2024

作者： Lee, Su-Ling Tseng, Chien-Cheng Depart. of Computer Science and Information Engineering Chang Jung Christian University Tainan Taiwan Depart. of Computer and Communication Engineering National Kaohsiung University of Sci. and Tech Kaohsiung Taiwan

ISBN: (纸本)9798350389210

Designing a quantum circuit that prepares user-specific states is a fundamental task in quantum computation. This involves loading user-provided data into the initial superposition state of a quantum register, enabling further processing by quantum algorithms. To address this state preparation problem, a quantum circuit utilizing rotation Y gates and controlled rotation Y gates has been previously proposed. However, the method for determining the rotation angles of these Y gates has not been detailed. This paper introduces a closed-form method for computing these angle parameters based on user-provided data. Numerical examples demonstrate the ease of use of the proposed method, which is implemented using IBM's quantum information software kit (Qiskit). Additionally, real-world feature data from iris flowers is used to show that the feature data can be accurately loaded into the quantum register, facilitating tasks such as machine learning, dimensionality reduction, or pattern recognition through quantum computation. © 2024 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：