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

IEEJ Transactions on Electronics, Information and systems 2025年第1期145卷 16-24页

作者： Shouno, Kazuhiro Sato, Lina Fukagawa, Kanta Tanimoto, Hiroshi Muto, Cosy Division of Information Engineering University of Tsukuba 1-1-1 Tennoudai Ibaraki Tsukuba305-8573 Japan Graduate School of Science and Technology Degree Programs in Systems and Information Engineering Master’s Program in Computer Science University of Tsukuba Japan Kitami Institute of Technology 165 Koen-cho Hokkaido Kitami090-8507 Japan Faculty of Education Nagasaki University 1-14 Bunkyo-machi Nagasaki852-8521 Japan

This paper proposes a measurement technique for an integrated complex filter. The proposed method is based on two measurement methods with integrated circuitry for calibration. It is accomplished by applying square waves to an FUT (Filter Under Test) instead of sinusoidal waves or by superposing transfer characteristics obtained by applying a single sinusoidal wave to an FUT. In both of the above methods, the output signal connected to the external measurement equipment via a 50 Ω coaxial cable and so on. In this case, the output signal of the FUT should be amplified by internal or external amplifiers, which degrades the response. However, it is cancelled out by the proposed calibration circuitry with some analog switches. In addition to the above, for the RC polyphase filter, the source resistance and the load capacitance degrade the measurement results and their effect is discussed. The validity of the proposal is confirmed through computer simulation for a third-order RCPF whose passband is 8–40 MHz fabricated by Phenitec 0.6 µm CMOS process. It is shown that the measurement error is −1.10 dB for the square-wave method and −1.00 dB and −0.43 degrees for the superposition method at 40 MHz. © 2025 The Institute of Electrical Engineers of Japan.

关键词： Capacitance

来源：评论

学校读者我要写书评

暂无评论

Effect of Sn addition on electrochemical activity of ribbons of Mg-Al-Ca anode material for rechargeable magnesium batteries fabricated by rapid solidification

引用

Keikinzoku/Journal of Japan Institute of Light Metals 2025年第1期75卷 9-13页

作者： Fukuta, Yoshitaka Kikura, Kensei Tsukeda, Tadayoshi Aida, Tetsuo Tabata, Hironobu Kurihara, Hideki Suzuki, Mayumi Program of Materials Science and Engineering Studies in Science and Engineering Graduate School of Science and Engineering University of Toyama 3190 Gofuku Toyama-shi Toyama930-8555 Japan Graduate School of Science and Engineering University of Toyama Toyama-shi Toyama Japan Faculty of Sustainable Design Academic Assembly University of Toyama Toyama-shi Toyama Japan CHUETSU METAL WORKS CO. LTD. Nakaniikawagun Toyama Japan Saitama Industrial technology Center Kawaguchi-shi Saitama Japan Department of Mechanical Systems Engineering Faculty of Engineering Toyama Prefectural University Imizu-shi Toyama Japan

Magnesium-based batteries are potential candidates for next-generation rechargeable batteries due to the divalent nature of magnesium cations and the natural abundance of magnesium resources. In this study, the electrochemical activity of Mg-6mass%Al-3mass%Ca anodes combined with Sn was investigated. Thin ribbons of the anode specimens were prepared by a single-roll rapid solidification method. The results showed that the electrochemical activity increased upon adding 1 mass% Sn, while it decreased for 3 mass% Sn. Based on the results of an X-ray diffraction analysis, the addition of Sn led to the formation of Mg2Sn and Ca2Sn phases, which increased the lattice distortion. Scanning electron microscopy observations indicated that these secondary phases were homogeneously distributed for 1 mass% Sn addition, while they were coarsely distributed for 3 mass% Sn. © 2025 The Japan Institute of Light Metals.

关键词： X ray diffraction analysis

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2116-2139页

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y. F. Scarlett, Jonathan CNRS@CREATE DesCartes Program CREATE Tower 138602 Singapore National University of Singapore Department of Computer Science Queenstown119077 Singapore National University of Singapore School of Computing Department of Information Systems and Analytics Queenstown119077 Singapore National University of Singapore Department of Mathematics Department of Electrical and Computer Engineering Queenstown119077 Singapore Institute of Data Science National University of Singapore Department of Computer Science The Department of Mathematics Queenstown119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank-Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ vanishes. © 1963-2012 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Protecting Your Attention during Distributed Graph Learning: Efficient Privacy-Preserving Federated Graph Attention Network

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 1949-1964页

作者： Zhou, Jinhao Wu, Jun Ni, Jianbing Wang, Yuntao Pan, Yanghe Su, Zhou Waseda University Graduate School of Information Production and Systems Fukuoka808-0135 Japan Queen's University Department of Electrical and Computer Engineering KingstonONK7L 3N6 Canada Xi'An Jiaotong University School of Cyber Science and Engineering Xi'an710049 China

Federated graph attention networks (FGATs) are gaining prominence for enabling collaborative and privacy-preserving graph model training. The attention mechanisms in FGATs enhance the focus on crucial graph features for improved graph representation learning while maintaining data decentralization. However, these mechanisms inherently process sensitive information, which is vulnerable to privacy threats like graph reconstruction and attribute inference. Additionally, their role in assigning varying and changing importance to nodes challenges traditional privacy methods to balance privacy and utility across varied node sensitivities effectively. Our study fills this gap by proposing an efficient privacy-preserving FGAT (PFGAT). We present an attention-based dynamic differential privacy (DP) approach via an improved multiplication triplet (IMT). Specifically, we first propose an IMT mechanism that leverages a reusable triplet generation method to efficiently and securely compute the attention mechanism. Second, we employ an attention-based privacy budget that dynamically adjusts privacy levels according to node data significance, optimizing the privacy-utility trade-off. Third, the proposed hybrid neighbor aggregation algorithm tailors DP mechanisms according to the unique characteristics of neighbor nodes, thereby mitigating the adverse impact of DP on graph attention network (GAT) utility. Extensive experiments on benchmarking datasets confirm that PFGAT maintains high efficiency and ensures robust privacy protection against potential threats. © IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

The Effect of WebRTC Jitter Buffer on Cloud Streaming Game QoE

The Effect of WebRTC Jitter Buffer on Cloud Streaming Game Q...

引用

Consumer Technology (ICCT-Pacific), International Conference on

作者： Naoyasu Kaneko Toshiro Nunome Department of Engineering Computer Science Program Graduate School of Engineering Nagoya Institute of Technology Nagoya Japan

ISBN: (数字)9798331504120

ISBN: (纸本)9798331504137

This paper considers a cloud streaming game using WebRTC. Since the cloud streaming game consists of a server and a client, the network quality between them affects the game. Among the network quality degradation factors, we focus on delay jitter. We reduce the effect of the jitter by buffering. We conduct a subjective experiment of a single-player action game and evaluate application-level QoS and QoE. We investigate the impact of buffering on the video and audio quality of the user playing the game.

关键词： Degradation Games Quality of service Jitter Streaming media Cloud gaming Delays Quality of experience Servers WebRTC

来源：评论

学校读者我要写书评

暂无评论

Placement Refinement Strategies for Security Closure

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and systems 2025年

作者： Danigno, Marcelo Fogaca, Mateus Schvittz, Rafael Butzen, Paulo Microelectronic Graduate Program Porto Alegre Brazil Cadence Design Systems Inc United States Computer Science Center Rio Grande Brazil

The security closure of integrated circuits (ICs) is an emerging area of research within the very large scale integration (VLSI) community. Malicious third parties, referred to as "attackers", can employ various techniques to leak, alter, or manipulate the logic of a circuit. When targeting a completed layout, their primary goal is often the insertion of hardware trojans. In this work, we present algorithms that strengthen placement solutions against hardware trojan attacks. While state-of-the-art methods rely on exhaustive placement algorithms, we propose a clustering-based placement approach that reduces the number of moved cells by up to 17%. Additionally, we introduce a cell movement heuristic aimed at preventing increases in wirelength. Our methods reduce vulnerable placement sites by up to 78% while maintaining minimal impact on design performance. Compared to other approaches, our solution decreases the amount of moved cells to an average of 8%, mitigating the impact on wirelength to an average of 0.5%. © 1982-2012 IEEE.

关键词： Electronic design automation

来源：评论

学校读者我要写书评

暂无评论

The Information systems and Model for Succession Planning in Higher Education Institutions

The Information Systems and Model for Succession Planning in...

引用

computer Applications (ICCA), IEEE Conference on

作者： Devyano Luhukay Ford Lumban Gaol Meyliana Harjanto Prabowo Computer Science Department BINUS Graduate Program Computer Science Bina Nusantara University Jakarta Indonesia Information Systems Department School of Information Systems Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798331534592

ISBN: (纸本)9798331534608

Succession planning is important in organization management. It is a strategic level management that involves not only finding the best successor but also including the development program for the successor so that they will be ready for the new prospective position. The integration and collaboration between all related stakeholders are important. Specifically, in succession planning at higher education, key positions play an important role so that institutional operations can run well. In this research, a succession planning model in higher education was built using the Systematic Literature Review(SLR), and the Software Development Lifecycle(SDLC) method was used for the application development, also, to be able to evaluate the implementation of one of the steps of the model, the simulation technique used machine learning (ML) to find the best algorithm for predicting the readiness of potential successors at higher education. Six algorithms were used: Logistic Regression, Decision Tree, K-Nearest Neighbor, Linear Discriminant Analysis, Gaussian Naïve Bayes, and Support Vector Machine. The data prepared for the simulation is based on the factors for the best successor candidate. The results obtained in this research are the succession planning model and the application design, as well as the Support Vector Machine (SVM) algorithm as the best algorithm for predicting the readiness status of successor candidates based on SVM’s accuracy score that is compared to the other algorithm in some variance amounts of data. The Succession Planning Model that is actualized in the application design provides a reference for the higher education institution to implement the Succession Model in their institution.

关键词： Support vector machines Machine learning algorithms Systematics Education Software algorithms Machine learning Predictive models Prediction algorithms Planning Information systems

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Incentive Mechanisms for Federated Learning in Vehicular Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Fathi, Faeze Montazeri, Mina N.araabi, Babak Du, Hongyang Niyato, Dusit Kebriaei, Hamed University of Tehran School of Ece College of Engineering Tehran Iran Urban Energy Systems Laboratory Dübendorf8600 Switzerland Nanyang Technological University School of Computer Science and Engineering The Energy Research Institute @ Ntu Interdisciplinary Graduate Program Singapore Nanyang Technological University School of Computer Science and Engineering Singapore School of Computer Science Tehran Iran

Centralized machine learning algorithms in vehicular networks face privacy and resource constraints. Federated Learning (FL) addresses these by enabling collaborative model training without sharing raw data. To incentivize vehicle participation despite resource constraints, we propose a contract between Roadside Units (RSUs) and vehicles, specifying required computation resources and rewards based on local data quality. The contract is designed to maximize the utility of the RSU, subject to constraints that ensure the participation of the vehicles in the task and truthful reporting of their data quality parameter. However, designing an optimal contract with classical methods is limited to specific utility functions. To extend the design methodology of optimal contracts to a broader range of utility functions, our study proposes a deep learning-based solution. Specifically, we present a novel application of Deep Neural Networks (DNNs), marking the first instance of applying DNNs in contract theory-based incentive mechanisms to achieve nearoptimal contracts. We design the DNN's structure to inherently satisfy specific constraints of the optimization problem, enhancing its efficiency and accuracy in determining the optimal contract. We utilize an augmented Lagrangian method to approximate the optimal contract in federated learning tasks. A case study on traffic sign recognition demonstrates the applicability and effectiveness of our method. Comparing our approach with the well-known generative diffusion model shows that in the FL scenarios, the DNN results are closer to the optimal contract compared to those of the generative diffusion model. © 1967-2012 IEEE.

关键词： Traffic signs

来源：评论

学校读者我要写书评

暂无评论

Damage-Free Neutral Beam Etching for Gate Recess in E-Mode AlGaN/GaN HEMTs

IEEE Electron Device Letters

引用

IEEE Electron Device Letters 2025年第5期46卷 705-708页

作者： Chen, Yi-Ho Chu, Fu-Chuan Aslam, Muhammad Lee, Yao-Jen Li, Yiming Samukawa, Seiji National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Graduate Degree Program of College of Electrical and Computer Engineering Hsinchu300093 Taiwan National Chung-Shan Institute of Science and Technology Solid State Devices Section Electronic System Research Division Taoyuan325 Taiwan National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Hsinchu300093 Taiwan Institute of Pioneer Semiconductor Innovation National Yang Ming Chiao Tung University Hsinchu300093 Taiwan Institute of Pioneer Semiconductor Innovation Institute of Artificial Intelligence Innovation National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Institute of Biomedical Engineering Department of Electronics and Electrical Engineering Institute of Communications Engineering Hsinchu300093 Taiwan National Yang Ming Chiao Tung University Institute of Communications Engineering Department of Electronics and Electrical Engineering Hsinchu300093 Taiwan

Recess gate etching is a critical technique for achieving enhancement-mode (E-mode) AlGaN/GaN high-electron mobility transistors (HEMTs) because the interface is susceptible to the etching damage. This study fabricates recess gates using the neutral beam etching (NBE) technique. By adjusting the aperture thickness in the NBE apparatus, we simulate both NB-mode and plasma-mode etching. The electrical characteristics of E-mode HEMTs fabricated using these two modes are analyzed and compared through DC, noise, and pulsed IV measurements. The results demonstrate that NB-recessed HEMTs exhibit superior performance. © 1980-2012 IEEE.

关键词： Aluminum gallium nitride

来源：评论

学校读者我要写书评

暂无评论

Overlapped Error Correction Codes in Two-Dimensional Structures

Overlapped Error Correction Codes in Two-Dimensional Structu...

引用

IEEE Latin American Symposium on Circuits and systems (LASCAS)

作者： Andrew Fritsch Wagner Savaris Adahil Muniz Giovanna Borba Rodrigo Girardi Jarbas Silveira César Marcon Graduate Program in Computer Science (PPGCC) Pontifical Catholic University of Rio Grande do Sul (PUCRS) Brazil Graduate Program in Teleinformatics Engineering (PPGETI) Federal University of Ceará (UFC) Brazil

ISBN: (数字)9798331522124

ISBN: (纸本)9798331522131

The continuous advancement of communication systems necessitates the development of algorithms capable of identifying and correcting errors that may arise during data transmission and storage. This pursuit of reliability is particularly crucial in critical systems and sectors that are challenging to access, such as space exploration, passenger transportation, and financial services. In this context, the Error Correction Code (ECC) is a fundamental tool for providing a certain degree of reliability to these systems. This research proposes a novel technique to enhance the error correction capacity of ECCs by leveraging region overlapping. Specifically, we propose correcting data areas protected by more than one ECC, which allows for the inference of logical correlations between ECCs, thereby augmenting their error detection and correction capability. Our focus is bidimensional codeword structures, commonly known as 2D-ECCs, which entail a hierarchical arrangement of ECCs. We evaluated the ECC proposal, comparing its error correction and detection capabilities. Through this evaluation, we aim to demonstrate the technique's efficacy in bolstering the reliability and resilience of communication systems, particularly in critical domains where precision and accuracy are paramount.

关键词： Fault tolerance Fault tolerant systems Transportation Error correction codes Error correction Space exploration Proposals Integrated circuit reliability Financial services Resilience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：