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

computer Vision and Machine Intelligence (CVMI), International Conference on

作者： Seizan Tsugawa Takao Toma Shiho Oshiro Tomohisa Wada Computer Science and Intelligent Systems Program University of the Ryukyus Okinawa Japan Magna Design Net Inc Okinawa Japan Information Technology Center University of the Ryukyus Okinawa Japan Dept. of Engineering Area of Computer Science and Intelligent Systems University of the Ryukyus Okinawa Japan

This paper proposed Scalability in Autoencoder-based Orthogonal Frequency Division Multiplexing(OFDM) communication system. In the previous research, only the comparison between IEEE802.11a and Autoencoder by the conventional OFDM communication system was performed, and it was proved that the communication system created by Autoencoder exceeded the performance of the conventional system. Therefore, in this paper, it uses IEEE802.11n and compare whether it can be improved by expanding the bandwidth and using ***802.11n standard has an FFT length of 128, a subcarrier number of 114 (108 for data), and modulation schemes of Quadrature Phase Shift Keying(QPSK), 16 Quadrature Amplitude Modulation (16QAM). The GI length is 800ns and the symbol length is 4000ns. In the simulation, a computer simulation was performed using a conventional OFDM communication system and a communication system generated by Autoencoder. Assuming that the simulation environment had an Signal-to-Noise Ratio (SNR) of 0 to 30 and an amplitude r of 0.0 to 1.0, the Symbol Error Rate (SER) status for each SNR was output. As a result of computer simulation, QPSK converged at SNR 27 ㏈ at IEEE 802.11a, but was able to reduce SER overwhelmingly to SNR 12 ㏈ at IEEE 802.11n. Also, in 16QAM the convergence at r=0.0 is the same as for SNR22 ㏈, but in IEEE 802.11a it does not converge after r=0.6, but in IEEE 802.11n it does not converge only at r=0.9 and r=1.0 . As a future task, it will use IEEE802.11ac, which enables communication speeds several times faster than IEEE802.11n, examine whether it is possible to further improve accuracy. And it will continue our research to correspond MIMO communication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem

引用

ACM Journal of Experimental Algorithmics 2023年第2期28卷 1-26页

作者： Cornejo-Acosta, José Alejandro García-Díaz, Jesús Pérez-Sansalvador, Julio César Ríos-Mercado, Roger Z. Pomares-Hernández, Saúl Eduardo Instituto Nacional de Astrofísica Óptica y Electrónica Computer Science Department Puebla72840 Mexico Tecnológico Nacional de México/ITS de Purísima Del Rincón Computer Engineering Department Guanajuato36425 Mexico Consejo Nacional de Humanidades Ciencias y Tecnologías Mexico City03940 Mexico Universidad Autónoma de Nuevo León Graduate Program in Systems Engineering San Nicolás de los GarzaNL 66455 Mexico LAAS-CNRS Université de Toulouse France INSA ToulouseF31400 France

The uniform capacitated vertex k-center problem is an -hard combinatorial optimization problem that models real situations where k centers can only attend a maximum number of customers, and the travel time or distance from the customers to their assigned center has to be minimized. This article introduces a polynomial-time constructive heuristic algorithm that exploits the relationship between this problem and the minimum capacitated dominating set problem. The proposed heuristic is based on the one-hop farthest-first heuristic that has proven effective for the uncapacitated version of the problem. We carried out different empirical evaluations of the proposed heuristic, including an analysis of the effect of a parallel implementation of the algorithm, which significantly improved the running time for relatively large instances. © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Intelligent Constellation Generation based on Autoencoder Communication System

Intelligent Constellation Generation based on Autoencoder Co...

引用

computer Vision and Machine Intelligence (CVMI), International Conference on

作者： Kaisei Matsumoto Takao Toma Shiho Oshiro Tomohisa Wada Computer Science and Intelligent Systems Program University of the Ryukyus Okinawa Japan Magna Design Net Inc Okinawa Japan Information Technology Center University of the Ryukyus Okinawa Japan Dept. of Engineering Area of Computer Science and Intelligent Systems University of the Ryukyus Okinawa Japan

This paper discusses intelligent constellation generation based on autoencoder communication system. In previous studies, the amplitude was set to fluctuate between r=0.0 and 1.0. However, when checking the generated constellation, distortion was confirmed instead of the conventional symbol arrangement. Therefore, in this paper, it compares the case where the amplitude is constant, the case where the average amplitude within a Minibatch is 1, and the case where the average amplitude is 1 for Interval time. The communication standard used in this research is IEEE 802.11a, assuming wireless Local Area Network (LAN) specifications. The IEEE 802.11a standard has an Fast Fourier Transform (FFT) length of 64, a subcarrier number of 52, and Quadrature Phase Shift Keying (QPSK) and 16 Quadrature Amplitude Modulation (QAM), modulation methods. A guard interval of 800 ns is added and the symbol length is 4000 ns. First, a simulation was performed under the condition that the amplitude was kept constant. QPSK with 4 symbols, constant amplitude model is rounded more than previous research result. 16QAM with 16 symbols is arranged regularly like lined up on a line. Second, the simulation was performed under the condition that the average amplitude within the minibatch was set to 1. QPSK with 4 symbols, appears to rotate clockwise. 16QAM with 16 symbols has a more uniform symbol placement than previous research result. Third, a simulation was performed under the condition that the average amplitude within Interval time was set to 1. QPSK with 4 symbols, is the closest to square among QPSK output results so far. The direction is slightly tilted, but if it can be rotated a little more, it may be possible to reproduce the same symbol arrangement as before. 16QAM with 16 symbols, the symbol arrangement is biased as a whole. However, it can be seen that are arranged in line on the line, perhaps due to regularity. As future work, in addition to the conditions set this time, it will exa

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Genetic Algorithm to Optimize Cargo Stability in Container Transportation 11

A Genetic Algorithm to Optimize Cargo Stability in Container...

引用

11th IEEE Global Conference on Consumer Electronics, GCCE 2022

作者： Hsieh, Chi-Jung Wu, Kuang-Sung Wu, Tin-Yu Tey, Fu Jie Chen, Yi-Kai Ho, Jye Yi National Ilan University Department of Computer Science and Information Engineering Ilan County Taiwan National Ilan University Master Program of E-Learning for Multimedia and Network Communications Yilan Taiwan National Pingtung University of Science and Technology Department of Management Information Systems Pingtung County Taiwan National Taiwan University of Science and Technology Department of Electrical Engineering Taipei Taiwan

ISBN: (纸本)9781665492324

In the era of the global village, frequent cross-border trade in goods has made container transportation a significant part in delivery of cargo. However, rollover accidents of container trucks often occur because of tall truck height, improper cargo stowage or crooked roads. Therefore, how to find the optimal center of gravity (CG) of the packed cargo remains an issue that the transportation industry should not neglect. To optimize cargo stability and reduce the incidence of rollovers, this paper proposes a genetic algorithm that scores the cargo stacking process to find the best CG of the cargo based on the CG of the vehicle. According to the deviation angle and the point closest to the best CG, we can Figure out the optimal cargo stacking method. © 2022 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Slice-Fusion: Reducing False Positives in Liver Tumor Detection for Mask R-CNN

引用

IEEE/ACM Transactions on Computational Biology and Bioinformatics 2023年第5期20卷 3267-3277页

作者： Tu, Deng-Yao Lin, Peng-Chan Chou, Hsin-Hung Shen, Meng-Ru Hsieh, Sun-Yuan National Cheng Kung University Master Degree Program on Artificial Intelligence Tainan City70101 Taiwan National Cheng Kung University Institute of Medical Informatics Department of Oncology Department of Genomic Medicine National Cheng Kung University Hospital College of Medicine Department of Computer Science and Information Engineering Tainan City70101 Taiwan National Chi Nan University Department of Computer Science and Information Engineering Nantou County54561 Taiwan National Cheng Kung University Graduate Institute of Clinical Medicine Department of Obstetrics and Gynecology Department of Pharmacology National Cheng Kung University Hospital College of Medicine Tainan City70101 Taiwan National Cheng Kung University Institute of Medical Information Institute of Manufacturing Information and Systems Center for Innovative FinTech Business Models International Center for the Scientific Development of Shrimp Aquaculture Department of Computer Science and Information Engineering Tainan City70101 Taiwan

Automatic liver tumor detection from computed tomography (CT) makes clinical examinations more accurate. However, deep learning-based detection algorithms are characterized by high sensitivity and low precision, which hinders diagnosis given that false-positive tumors must first be identified and excluded. These false positives arise because detection models incorrectly identify partial volume artifacts as lesions, which in turn stems from the inability to learn the perihepatic structure from a global perspective. To overcome this limitation, we propose a novel slice-fusion method in which mining the global structural relationship between the tissues in the target CT slices and fusing the features of adjacent slices according to the importance of the tissues. Furthermore, we design a new network based on our slice-fusion method and Mask R-CNN detection model, called Pinpoint-Net. We evaluated proposed model on the Liver Tumor Segmentation Challenge (LiTS) dataset and our liver metastases dataset. Experiments demonstrated that our slice-fusion method not only enhance tumor detection ability via reducing the number of false-positive tumors smaller than 10mm, but also improve segmentation performance. Without bells and whistles, a single Pinpoint-Net showed outstanding performance in liver tumor detection and segmentation on LiTS test dataset compared with other state-of-the-art models. © 2004-2012 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

A Two-stage Reconfiguration in Network Function Virtualization: Toward Service Function Chain Optimization

引用

IEEE Transactions on Network and Service Management 2025年

作者： Assis, Karcius D. R. Almeida, Raul C. Baghban, Hojjat Santos, Alex F. Boutaba, Raouf Electrical and Computer Engineering Department Salvador Brazil University of Waterloo David R. Cheriton School of Computer Science Canada Department of Electronics and Systems Recife Brazil Chang Gung University Department of Artificial Intelligence Taiwan Chang Gung University College of Intelligent Computing Taiwan Center of Science and Technology in Energy and Sustainability Brazil Postgraduate Program in Computer Science Bahia Brazil

Network Function Virtualization (NFV), as a promising paradigm, speeds up the service deployment by separating network functions from proprietary devices and deploying them on common servers in the form of software. Any service in NFV-enabled networks is achieved as a Service Function Chain (SFC) which consists of a series of ordered Virtual Network Functions (VNFs). However, migration of VNFs for more flexible services within a dynamic NFV-enabled network is a key challenge to be addressed. Current VNF migration studies mainly focus on single VNF migration decisions without considering the sharing and concurrent migration of VNF instances. In this paper, we assume that each deployed VNF is used by multiple SFCs and deal with the optimal placement for the contemporaneous migration of VNFs based on the actual network situation. We formalize the VNF migration and SFC reconfiguration problem as a mathematical model, which aims to minimize the VNF migration between nodes or the total number of core changes per node. The approach is a two-stage MILP based on optimal order to solve the reconfiguration. Extensive evaluation shows that the proposed approach can reduce the change in terms of location or number of cores per node in a 6-node and 14-node networks while ensuring network latency compared with the model without reconfiguration. © 2004-2012 IEEE.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Tracking Players in a Badminton Court by Two Cameras

arXiv

引用

arXiv 2023年

作者： Chou, Young-Ching Zhang, Shen-Ru Chen, Bo-Wei Chen, Hong-Qi Lin, Cheng-Kuan Tseng, Yu-Chee Department of Computer Science National Yang Ming Chiao Tung University Taiwan Undergraduate Degree Program of Systems Engineering and Technology National Yang Ming Chiao Tung University Taiwan Computer Science and Information Engineering Chung Cheng Institute of Technology NDU Taiwan

This study proposes a simple method for multi-object tracking (MOT) of players in a badminton court. We leverage two off-the-shelf cameras, one on the top of the court and the other on the side of the court. The one on the top is to track players’ trajectories, while the one on the side is to analyze the pixel features of players. By computing the correlations between adjacent frames and engaging the information of the two cameras, MOT of badminton players is obtained. This two-camera approach addresses the challenge of player occlusion and overlapping in a badminton court, providing player trajectory tracking and multi-angle analysis. The presented system offers insights into the positions and movements of badminton players, thus serving as a coaching or self-training tool for badminton players to improve their gaming strategies. Copyright © 2023, The Authors. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Correction: Humanoid robot-empowered language learning based on self-determination theory

引用

Education and Information Technologies 2024年第5期30卷 6843-6845页

作者： Fung, Ka Yan Lee, Lik Hang Sin, Kuen Fung Song, Shenghui Qu, Huamin Interdisciplinary Programs Office (Individualized Interdisciplinary Program (IIP) Hong Kong University of Science and Technology Hong Kong China Department of Industrial and Systems Engineering (ISE) The Hong Kong Polytechnic University Hong Kong China Department of Special Education and Counselling The Education University of Hong Kong Hong Kong China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

来源：评论

学校读者我要写书评

暂无评论

Enhancement of superconductivity in the Fibonacci chain

引用

Physical Review B 2024年第13期109卷 134504-134504页

作者： Meng Sun Tilen Čadež Igor Yurkevich Alexei Andreanov School of Physics and Optoelectronic Engineering Beijing University of Technology Beijing 100124 China Center for Theoretical Physics of Complex Systems Institute for Basic Science Daejeon 34126 Republic of Korea School of Computer Science and Digital Technologies Aston University Birmingham B4 7ET United Kingdom Basic Science Program Korea University of Science and Technology Daejeon 34113 Republic of Korea

We study the interplay between quasiperiodic disorder and superconductivity in a one-dimensional tight-binding model with the quasiperiodic modulation of on-site energies that follow the Fibonacci rule, and all the eigenstates are multifractal. As a signature of multifractality, we observe the power-law dependence of the correlation between different single-particle eigenstates as a function of their energy difference. We numerically compute the mean-field superconducting transition temperature for every realization of a Fibonacci chain of a given size and find the distribution of critical temperatures, analyze their statistics, and estimate the mean value and variance of critical temperatures for various regimes of the attractive coupling strength and quasiperiodic disorder. We find an enhancement of the critical temperature compared to the analytical results that are based on strong assumptions of the absence of correlations and self-averaging of multiple characteristics of the system, which are not justified for the Fibonacci chain. For the very weak coupling regime, we observe a crossover where the self-averaging of the critical temperature breaks down completely and strong sample-to-sample fluctuations emerge.

关键词： Superconductivity Fractals Mean field theory Methods in superconductivity Tight-binding model

来源：评论

学校读者我要写书评

暂无评论

Enhanced Prognostics and Health Management in Automated Driving systems: Using Graph Neural Networks to Recognize Operational Contexts

Enhanced Prognostics and Health Management in Automated Driv...

引用

Prognostics and System Health Management Conference (PHM)

作者： Peng Su Yeqi Wang Conglei Xiang Erik Wendel Madhav Mishra DeJiu Chen Department of Engineering Design Mechatronics Division KTH Royal Institute of Technology Stockholm Sweden Embedded Systems Master Program of Electrical Engineering and Computer Science (EECS) School KTH Royal Institute of Technology Stockholm Sweden Digital Systems Division RISE Research Institutes of Sweden Gothenburg Sweden

ISBN: (数字)9798350360585

ISBN: (纸本)9798350360592

Prognostics and health management (PHM) is an engineering discipline that aims to maintain system behaviour and function and ensure mission success, safety and effectiveness. Addressing the challenges in prognostics and health management for modern intelligent systems, especially automated driving systems, is complex due to the contextual nature of faults. This complexity necessitates a thorough understanding of spatial, and temporal conditions, and relationships within operational scenarios and life-cycle stages. This paper introduces a framework designed to automatically recognize driving scenarios in automated driving systems using graph neural networks (GNNs). The framework extracts relational data from image frames, constructing graph-based models and transforming unstructured sensory data into structured data with diverse node types and relationships. A specific graph neural network processes the graph model to reveal and detect operational conditions and relationships. The proposed framework is evaluated using the KITTI dataset, demonstrating superior performance compared to conventional feed-forward networks such as MLP, particularly in handling relational data.

关键词： Graph neural networks Data models Safety Complexity theory Data mining Prognostics and health management Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：