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

Verification of Impedance Matching Using Input/Output Current Equalization Control in Wireless Power Transfer Systems with Active Rectifier

引用

IEEJ Transactions on Industry Applications 2025年第4期145卷 261-271页

作者： Kobayashi, Seiya Maekawa, Sari Electrical Engineering Program Graduate School of Science and Technology Meiji University 1-1-1 Higashimita Tama-ku Kanagawa Kawasaki214-8571 Japan

The efficiency of a wireless power transfer system changes with the load. To solve this problem, an impedance matching method has been developed. Conventional methods control the equivalent load to the optimal value using circuit parameters and the detected load voltage and current. However, they require estimating the mutual inductance M in case of misalignment or an airgap change. M-estimation has some issues such as a limited operating range. In this study, we developed a high-efficiency operation method that can respond to a change in M without its estimation by controlling the currents in the coils to equalize them. We confirmed that the developed method enables highly efficient operation without M-estimation despite misalignment. © 2025 The Institute of Electrical Engineers of Japan.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

R-LIME: Rectangular Constraints and Optimization for Local Interpretable Model-agnostic Explanation Methods 27th

R-LIME: Rectangular Constraints and Optimization for Local I...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Ohara, Genji Kimura, Keigo Kudo, Mineichi Division of Computer Science and Information Technology Graduate School of Information Science and Technology Hokkaido University Sapporo060–0814 Japan

ISBN: (纸本)9783031783531

In recent years, complex machine learning models have been widely introduced in various industrial fields due to their high accuracy. However, their increasing complexity has been a major obstacle to their implementation in sensitive decision-making situations. In order to address this problem, various post-hoc explanation methods have been proposed, but they have not been able to achieve interpretability of both the explanation and its scope. We propose R-LIME, a novel method that interprets complex classifiers within an interpretable scope. R-LIME locally and linearly approximates the complex decision boundary of a black-box classifier within a rectangular region and maximizes the region as long as the approximation accuracy exceeds a given threshold. The resulting rectangular region is interpretable for users because it is expressed as a conjunction of feature predicates. Through qualitative and quantitative comparisons on a real-world dataset, we demonstrate that R-LIME provides more reliable and interpretable explanations than existing methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

"Nyctophy": Assessing the effectiveness of serious game for nyctophobia based on virtual reality by usability and heart rate monitoring 9th

"Nyctophy": Assessing the effectiveness of serious game for ...

引用

9th International Conference on computer science and Computational Intelligence, ICCSCI 2024

作者： Ardiyanto, Elshad Ryan Alexander, Patrick Putra, Edyth Novian Ramdhan, Dimas Game Application & Technology Program Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia

Nyctophobia is a phobia of the dark and is common among children but also found in adults. While the phobia itself is commonly known, the diversity of its treatment is still minimal. As technology has reached its highest point, numerous inventions and innovations have emerged in the medical sector. This study aimed to examine the usability of Virtual Reality and Keyboard and Mouse as an interface using the Extended Reality Game Usability Questionnaire (XR-GUQ) in Nyctophobia therapy and to analyze the heart rate response, impact, and implications using t-test Paired/Wilcoxon Signed Rank. Thirty-four Bina Nusantara University students from various backgrounds completed the test using interfaces and a smartwatch. They were divided into two groups, high- and low fear, using the modified Acrophobia Questionnaire (AQ), which resulted in a significant difference. The XR-GUQ result was insignificant in all variables, which indicates similar usability scores on both interfaces. The t-test Paired/Wilcoxon Signed Rank test revealed a significant difference between the high- and low-fear groups when using the Virtual Reality interface compared to the Keyboard and Mouse interface. This significant difference was found within each group regardless of the interface used. This research shows similar scores in terms of usability but a significant difference in heart rate response with the help of a serious game to give a new sensation of phobia therapy. © 2024 The Authors.

关键词： Serious games

来源：评论

学校读者我要写书评

暂无评论

Comparison of Spelling Error Correction Algorithms for the Indonesian Language 11

Comparison of Spelling Error Correction Algorithms for the I...

引用

11th International Conference on Information and Education technology, ICIET 2023

作者： Yanfi, Yanfi Setiawan, Reina Soeparno, Haryono Budiharto, Widodo Bina Nusantara University BINUS Graduate Program Computer Science Jakarta Indonesia Bina Nusantara University BINUS Graduate Program Computer Science School of Computer Science Computer Science Department Jakarta Indonesia Bina Nusantara University School of Computer Science Computer Science Department Jakarta Indonesia

ISBN: (纸本)9781665465489

Edit distance as a string measurement metric is often used to help detect misspellings in languages. This paper aims to compare two string spelling error correction algorithms for the Indonesian language. The N-gram, Jaro-Winkler distance, and Levenshtein distance algorithms are used to determine whether they can accurately correct typological errors in the Indonesian language. Moreover, this study utilized KNIME tools to process the data from beginning to end. The data was retrieved from news in Indonesia. After the experiment on N from 1 to 12, the results obtained for the comparative analysis proved that Jaro-Winkler distance performed better than Levenshtein distance for comparing smaller strings like words and names. However, Levenshtein distance performs as well as Jaro-Winkler distance started from four strings. Finally, both Jaro-Winkler distance and Levenshtein distance algorithm got the best performance accuracy for eight strings with an accuracy of 99.52 percent. The result of this study is also presented that both algorithms can support word error correction for the Indonesian language. © 2023 IEEE.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

Improvement of Visual Odometry Based on Robust Feature Extraction Considering Semantics 9

Improvement of Visual Odometry Based on Robust Feature Extra...

引用

9th International Conference on Control, Decision and Information Technologies, CoDIT 2023

作者： Adachi, Miho Xue, JunFeng Honda, Kazufumi Wada, Marin Miyamoto, Ryusuke Graduate School of Science and Technology Department of Computer Science Japan School of Science and Technology Meiji University Department of Computer Science Kawasaki Japan

ISBN: (纸本)9798350311402

Visual odometry is a key technology for an autonomous robot to accurately determine its locations on a map accurately if a camera is the main external sensor. If IMU is available, the scale information can also be estimated by combining visual and IMU information, which is called Visual Inertial Odometry (VIO). This research attempts to modify VINS-Mono, a widely used VIO method, to improve the estimation accuracy in symbiotic environments with people in outdoor scenes, where estimation accuracy becomes worsens according to the dynamic obstacles in images. The proposed method replaces a method for feature point extraction in VINS-Mono and adds a process to limit the area for the feature point extraction using semantic information obtained from segmentation results. Experimental results using datasets created from actual environments demonstrate that SuperPoint showed the best accuracy for most scenes and that area limitation improved estimation accuracy when many dynamic obstacles were included in the input images. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence-Powered Intent Classification for Indonesian E-Wallet Customer Service Chatbots 4

Artificial Intelligence-Powered Intent Classification for In...

引用

4th International Conference on Intelligent Cybernetics technology and Applications, ICICyTA 2024

作者： Owen, Christopher Suhartono, Derwin Binus Graduate Program Bina Nusantara University Computer Science Department Jakarta Indonesia School of Computer Science Bina Nusantara University Computer Science Department Jakarta Indonesia

ISBN: (纸本)9798331506490

The rapid expansion of e-wallet services in Indonesia has significantly heightened the need for efficient customer service solutions, making chatbots an essential tool for user support. However, many providers continue to rely on rule-based chatbots, resulting in rigid interactions that struggle to meet diverse user needs or handle the linguistic complexities of the Indonesian language. This study addresses these limitations by developing an AI-powered intent classification model specifically tailored for Indonesian e-wallet customer service, aimed at delivering a more accurate, adaptive, and user-centered experience. A custom dataset was created from user comments on social media associated with Indonesia's top e-wallet providers, followed by data pre-processing and clustering using the BERTopic model. To improve interpretability, OpenAI's GPT-4 was employed for label refinement, resulting in enhanced clarity. Various models were tested, including IndoBERT, RoBERTa, and Convolutional Neural Network (CNN) architectures in both 2D and 3D configurations. The highest-performing model combined IndoBERT embeddings with a 3D CNN classifier, achieving an accuracy of 84.30%, precision of 84.33%, recall of 84.30%, and an F1-score of 84.24%. This study contributes a unique Indonesian-specific dataset and demonstrates the potential of AI to transform customer service interactions in Indonesia's e-wallet sector, offering a clear advancement over traditional rule-based approaches. © 2024 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Study on sonic-Assisted processing method for micro pattern formation on Cu film 1

Study on sonic-Assisted processing method for micro pattern ...

引用

1st International Conference on Robotics, Engineering, science, and technology, RESTCON 2024

作者： Yamamoto, Soma Fukushige, Yuho Nishizawa, Hideaki Khajornrungruang, Panart Suzuki, Keisuke Kyushu Institute of Technology Graduate School of Computer Science and Systems Engineering Fukuoka Japan

ISBN: (纸本)9798350348842

In semiconductor processing to form surface shapes, photolithography and dry etching are used. In this case, the vacuum process requires improvements cost and productivity. We propose a sonic-Assisted processing method using the resonance phenomenon of stainless used steel plate diaphragms. This method is characterized by vibrating the diaphragm with sound pressure to vibrate the particles and microfabricate on Cu thin film [1][2]. To evaluate the sonic-Assisted processing method, we attempted to process Cu wafers by transmitting vibrations perpendicular to the wafer to a SUS plate diaphragm as a micro-shape transfer process using a micro-pattern pad. As a result, 100 μm length and 20 μm width grooves were formed on the Cu wafer surface. © 2024 IEEE.

关键词： Copper

来源：评论

学校读者我要写书评

暂无评论

Improved encoding structure and decoding algorithms for spinal codes

引用

Journal of Systems Engineering and Electronics 2022年第4期33卷 856-866页

作者： HUANG Wensha WANG Lina School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Shunde Graduate School University of Science and Technology BeijingBeijing 100083China

To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.

关键词： spinal code tail-biting encoding lower decoding complexity early termination strategy

来源：评论

学校读者我要写书评

暂无评论

Vortex Ring and Dynamic Lift Generated by Downstroke of Elastic Butterfly Wing 1

Vortex Ring and Dynamic Lift Generated by Downstroke of Elas...

引用

1st International Conference on Robotics, Engineering, science, and technology, RESTCON 2024

作者： Haishi, Sei Fuchiwaki, Masaki Kyushu Institute of Technology Graduate School of Computer Science and Systems Engineering Iizuka Japan

ISBN: (纸本)9798350348842

The shape of airfoil contributes to the performance of the airfoil itself. Elastic deformation during unsteady motion not only generates vortices with larger vorticity, but also enables the generation of sustained dynamic lift than rigid moving airfoil. Membrane airfoils exhibit the high performance by elastic deformation with unsteady motion. Butterfly wing, which is an example of application of membrane airfoil, have been shown to generate a pair of vortex rings and dynamic lift through flapping motion. However, it has not been clarified sufficiently how the wing shape responds to changes in dynamic lift and vortex rings. In this study, authors also visualized the vortex ring, simultaneously measured the dynamic lift, and measured the wing shape. When the wing pass through the horizontal position (when the flapping angle φ = 0 deg.), the dynamic lift is at its maximum, and the vortex ring becomes more developed. As a result, the wing chord direction gradually curves, and when the flapping angle φ =-30 deg., the entire wing chord becomes camber shape. Since no deformation occurred in the wingspan direction at any flapping angle in this measurement range, it can be said that camber in the wing chord direction is necessary to generate the dynamic lift and vortex ring. © 2024 IEEE.

关键词： Elastic deformation

来源：评论

学校读者我要写书评

暂无评论

Independent Set Reconfiguration Under Bounded-Hop Token Jumping 19th

Independent Set Reconfiguration Under Bounded-Hop Token Jump...

引用

19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025

作者： Hatano, Hiroki Kitamura, Naoki Izumi, Taisuke Ito, Takehiro Masuzawa, Toshimitsu Graduate School of Information Science and Technology Department of Computer Science Osaka University Osaka Suita Japan Graduate School of Information Sciences Tohoku University Sendai Japan

ISBN: (纸本)9789819628445

The independent set reconfiguration problem (ISReconf) is the problem of determining, for two given independent sets of a graph, whether one can be transformed into the other by repeatedly applying a prescribed reconfiguration rule. There are two well-studied reconfiguration rules, called the Token Sliding (TS) rule and the Token Jumping (TJ) rule, and it is known that the complexity status of ISReconf differs between the TS and TJ rules for some graph classes. In this paper, we analyze how changes in reconfiguration rules affect the computational complexity of ISReconf. To this end, we generalize the TS and TJ rules to a unified reconfiguration rule, called the k-Jump rule, which removes one vertex from a current independent set and adds a vertex within distance k from the removed vertex to obtain another independent set having the same cardinality. We give the following three results: First, we show that the computational complexity of ISReconf under the k-Jump rule for general connected graphs is identical for all k≥3. Second, we present a polynomial-time algorithm to solve ISReconf under the 2-Jump rule for split graphs. Third, we consider the shortest variant of ISReconf, which determines whether there is a transformation of at most steps, for a given integer ≥0. We prove that this shortest variant under the k-Jump rule is NP-complete for chordal graphs of diameter at most 2k+1, for any k≥3. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：