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

arXiv 2022年

作者： Fujita, Naoki Röhm, André Mihana, Takatomo Horisaki, Ryoichi Li, Aohan Hasegawa, Mikio Naruse, Makoto Department of Information Physics and Computing Graduate School of Information Science and Technology The University of Tokyo Bunkyo-ku Hongo Tokyo113-8656 Japan Graduate School of Informatics and Engineering The University of Electro-Communications 1-5-1 Chofugaoka Chofu-shi Tokyo182-8585 Japan Department of Electrical Engineering Graduate School of Engineering Tokyo University of Science 6-3-1 Niijuku Katsushikaku Tokyo125-8585 Japan

Fully pairing all elements of a set while attempting to maximize the total benefit is a combinatorically difficult problem. Such pairing problems naturally appear in various situations in science, technology, economics, and other fields. In our previous study, we proposed an efficient method to infer the underlying compatibilities among the entities, under the constraint that only the total compatibility is observable. Furthermore, by transforming the pairing problem into a traveling salesman problem with a multi-layer architecture, a pairing optimization algorithm was successfully demonstrated to derive a high-total-compatibility pairing. However, there is substantial room for further performance enhancement by further exploiting the underlying mathematical properties. In this study, we prove the existence of algebraic structures in the pairing problem. We transform the initially estimated compatibility information into an equivalent form where the variance of the individual compatibilities is minimized. We then demonstrate that the total compatibility obtained when using the heuristic pairing algorithm on the transformed problem is significantly higher compared to the previous method. With this improved perspective on the pairing problem using fundamental mathematical properties, we can contribute to practical applications such as wireless communications beyond 5G, where efficient pairing is of critical importance. Copyright © 2022, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Rule Reduction Approach to Software Fault-proneness Prediction

A Heuristic Rule Reduction Approach to Software Fault-pronen...

引用

Asia-Pacific Conference on Software engineering

作者： Akito Monden Jacky Keung Shuji Morisaki Yasutaka Kamei Ken-Ichi Matsumoto Graduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan Department of Computing Hong Kong Polytechnic University Hong Kong China Faculty of Informatics Shizuoka University Hamamatsu Shizuoka Japan Graduate School and Faculty of Information Science and Electrical Engineering Kyushu University Fukuoka Japan

Background: Association rules are more comprehensive and understandable than fault-prone module predictors (such as logistic regression model, random forest and support vector machine). One of the challenges is that there are usually too many similar rules to be extracted by the rule mining. Aim: This paper proposes a rule reduction technique that can eliminate complex (long) and/or similar rules without sacrificing the prediction performance as much as possible. Method: The notion of the method is to removing long and similar rules unless their confidence level as a heuristic is high enough than shorter rules. For example, it starts with selecting rules with shortest length (length=1), and then it continues through the 2nd shortest rules selection (length=2) based on the current confidence level, this process is repeated on the selection for longer rules until no rules are worth included. Result: An empirical experiment has been conducted with the Mylyn and Eclipse PDE datasets. The result of the Mylyn dataset showed the proposed method was able to reduce the number of rules from 1347 down to 13, while the delta of the prediction performance was only. 015 (from. 757 down to. 742) in terms of the F1 prediction criteria. In the experiment with Eclipsed PDE dataset, the proposed method reduced the number of rules from 398 to 12, while the prediction performance even improved (from. 426 to. 441.) Conclusion: The novel technique introduced resolves the rule explosion problem in association rule mining for software proneness prediction, which is significant and provides better understanding of the causes of faulty modules.

关键词： Measurement Association rules Explosions Software Predictive models Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Communicating with multiple users for embodied conversational agents

Communicating with multiple users for embodied conversationa...

引用

International Conference on Telecommunications (ConTEL)

作者： H.H. Huang A. Cerekovic T. Furukawa Y. Yamaoka H. Ohashi I. Pandzic Y. Nakano T. Nishida Graduate School of Informatics Kyoto University Japan Paculty of Electrical Engineering and Computing University of Zagreb Croatia Department of Computer Information and Communication Sciences Tokyo University of Agriculture and Technology Japan Department of Computer and Information Science Seikei University Japan

One of the most critical reason that prevents embodied conversational agents to be used in practical applications can be considered as the lack of the capabilities to be aware of multiple users and to interact with them. This paper presents our investigations in an advanced tour guide agent system serving two users and a simpler quiz agent kiosk which is developed for public exhibitions. To improve the life likeness of the agents, we propose that the agent should be attentive to its users. To achieve the agent's attentiveness toward the users, two aspects are considered: its utterance strategy toward the users and its internal attitude should be adaptive to users' status. To explore these two aspects more throughly, two prototype systems are implemented and evaluated with subject experiments respectively. In addition to regular questionnaires evaluation, GNAT test that measures implicit preference was conducted as well. The preliminary results implied that the experiment participants perceived that the agents are attentive and natural.

关键词： Testing Humans Laboratories informatics Agriculture Information science Application software Prototypes Robustness Working environment noise

来源：评论

学校读者我要写书评

暂无评论

Feasibility study of Information Technology Investment (a case study of ODOO ERP: Project Management Module Implementation in Indonesia Based Company)

Feasibility study of Information Technology Investment (a ca...

引用

International Conference on ICT For Smart Society (ICISS)

作者： Fredy Jingga Raymond Kosala Suhono Harso Supangkat Benny Ranti Computer Science Department BINUS Graduate Program - Doctor of Computer Science Information Systems Department School of Information Systems Bina Nusantara University Jakarta Indonesia Computer Science Department BINUS Graduate Program - Doctor of Computer Science Bina Nusantara University Jakarta Indonesia School of Electrical Engineering and Informatics Bandung Institute of Technology Bandung Indonesia

IT Governance are one of the needs in managing Enterprise Level IT. This study shows part of the decision domain of IT Governance Help, which are IT Investment and Prioritization. The purpose of this study is to determine feasibility of implementation open source ERP system Odoo project management module that replaces current system based on operational, economic, and technical aspects. The method used are Fit / Gap Analysis and Cost Benefit model using economic impact worksheet. The analysis is done by comparing the requirement with features owned by current system and Odoo ERP system. This research resulted that Odoo ERP System is feasible in the 3 aspects, the operational feasibility Odoo reaching 72% Fit, the economic feasibility with ROI of 84%, and technical feasibility indicating the technical requirement can be fulfilled by leasing AWS server. The conclusion is the open source ERP system Odoo project management module is feasible to be applied in terms of 3 aspects that have been studied, those are operational, economic, and technical.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Frictional characteristics measurement of a ceramic aerostatic linear bearing 5

Frictional characteristics measurement of a ceramic aerostat...

引用

5th International Conference on Advanced Micro-Device engineering, AMDE 2013

作者： Kitabata, Kouki Iwashita, Hiroshi Takita, Akihiro Djamal, Mitra Pornsuwancharoen, Nithiroth Fujii, Yusaku Education Program of Electronics and Informatics Mathematics and Physics Graduate School of Science and Technology Gunma University 1-5-1 Tenjin-cho Kiryu Gunma376-8515 Japan Depatment of Electronics Graduate School of Engineering Gunma University 1-5-1 Tenjin-cho Kiryu Gunma376-8515 Japan Division of Mechanical Sience and Technology Graduate School of Tecnology Gunma University 1-5-1 Tenjin-cho Kiryu Gunma376-8515 Japan Theoretical High Energy Physics and Instrumentation Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jl. Ganesa 10 Bandung40132 Indonesia Department of Electrical Engineering Faculty of Industry and Technology Rajamangala University of Technology Isan Sakonnakon47160 Thailand

ISBN: (纸本)9783038354659

The resultant force acting on the moving part of the ceramic aerostatic linear bearing is measured highly accurately as the inertial force of the moving part of the bearing by means of the levitation mass method (LMM). The measurement results of the ceramic aerostatic linear bearing and metal aerostatic linear bearing of different mass are compared. The regression equation of the ceramic aerostatic linear bearing and metal aerostatic linear bearing are calculated. The ceramic linear bearing and metal linear bearing have extremely small frictional force.. © (2015) Trans Tech Publications, Switzerland.

关键词： Aerodynamics

来源：评论

学校读者我要写书评

暂无评论

Valley notch filter in a graphene strain superlattice: Green's function and machine learning approach

引用

Physical Review B 2019年第20期100卷 205411-205411页

作者： V. Torres P. Silva E. A. T. de Souza L. A. Silva D. A. Bahamon Instituto de Física Universidade Federal Fluminense Niterói Av. Litorânea sn 24210-340 RJ-Brazil MackGraphe – Graphene and Nano-Materials Research Center Mackenzie Presbyterian University Rua da Consolação 896 01302-907 São Paulo SP Brazil School of Computing and Informatics & Graduate Program in Electrical Engineering and Computing Mackenzie Presbyterian University Rua da Consolação 896 01302-907 São Paulo SP Brazil

The valley transport properties of a superlattice of out-of-plane Gaussian deformations are calculated using a Green's function and a machine learning approach. Our results show that periodicity significantly improves the valley filter capabilities of a single Gaussian deformation; these manifest themselves in the conductance as a sequence by valley filter plateaus. We establish that the physical effect behind the observed valley notch filter is the coupling between counterpropagating transverse modes; the complex relationship between the design parameters of the superlattice and the valley filter effect make it difficult to estimate in advance the valley filter potentialities of a given superlattice. With this in mind, we show that a deep neural network can be trained to predict valley polarization with a precision similar to the Green's function but with much less computational effort.

关键词： Ballistic transport Quantum transport Strain Graphene Landauer formula Machine learning Tight-binding model

来源：评论

学校读者我要写书评

暂无评论

Systolic Array for Parallel Solution of the Robust Kalman Filter Used for Attitude and Position Estimations in UAVs

Systolic Array for Parallel Solution of the Robust Kalman Fi...

引用

International Conference on Unmanned Aircraft Systems (ICUAS)

作者： Leandro José Evilásio Campos Marco Henrique Terra Ricardo Menotti Roberto Santos Inoue Graduate Program in Electrical Engineering Federal University of São Carlos São Carlos SP Brazil Department of Electrical and Computer Engineering São Carlos School of Engineering University of São Paulo São Carlos SP Brazil Department of Computing Federal University of São Carlos

The efficient Kalman filter has been widely used in recent decades to obtain air navigation information in UAVs. However, for a good performance of the Kalman filter, the model that describes the system dynamics must not contain uncertainties. This paper presents the implementation of a robust Kalman filter to estimate the attitude, velocity, and position of UAVs. The robust filter considers uncertainties in the sensor models. A mathematical structure based on the solution of linear systems synthesizes the predictor-corrector robust estimation algorithm. The main contribution of this study is the proposed QR decomposition based on Givens rotation to solve the linear system. The simulated experiments used sensory data collected in Zürich-Switzerland and ground truth referencing attitude, velocity, and position. The offline simulation results express the effectiveness of the robust Kalman filter for this application, with a reduction of up to 18.9% in the estimation error, in relation to the standard Kalman filter. The proposal to use systolic arrays for numerical solutions has shown promise for implementation in parallel processing platforms, such as FPGAs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Is Attention All You Need for EEG to Predict Neurological Outcomes in Cardiac Arrest?

Is Attention All You Need for EEG to Predict Neurological Ou...

引用

2024 IEEE-EMBS International Conference on Biomedical and Health informatics, BHI 2024

作者： Dionisio, Jefferson Rizwan, Muhammad Suzuki, Hidetaka Hassan, Kazi Mahmudul Chanpornpakdi, Ingon Lin, Lian-Yu Tanaka, Toshihisa Lin, Che Tokyo University of Agriculture and Technology Tokyo Japan Japanese Red Cross Musashino Hospital Department of Emergency and Critical Care Tokyo Japan National Taiwan University College of Medicine and Hospital Division of Cardiology Department of Internal Medicine Taipei Taiwan Artificial Intelligence of Things Taiwan International Graduate Program Academia Sinica Taipei Taiwan National Taiwan University Department of Electrical Engineering Taipei Taiwan Graduate Institute of Communication Engineering National Taiwan University Taipei Taiwan National Taiwan University Center for Advanced Computing and Imaging in Biomedicine Taipei Taiwan Department of Smart Medicine and Health Informatics National Taiwan University Taipei Taiwan

ISBN: (纸本)9798350351552

Sudden cardiac arrest (SCA) poses a significant health challenge, necessitating accurate predictions of neurological outcomes in comatose patients, where good outcomes are defined as the recovery of most cognitive functions. Electroencephalogram (EEG) serves as a valuable biomarker for monitoring neurological states due to its rich, time-dependent information. This study aims to predict neurological outcomes using early EEG data by employing the Transformer model, which leverages multi-headed attention to identify patterns in lengthy sequences such as hour-long EEG recordings. Unlike traditional methods that use subsampled EEG epochs, we utilize the entire EEG sequences, subdivided into time steps, allowing our model to capture detailed temporal patterns via the attention mechanism. Moreover, we trained our proposed model using each EEG recording as an individual data sample but evaluated our model through aggregated patient-wise predictions. This approach allows us to boost the data sample size. Our results demonstrate promising predictive performance, achieving an AUROC of 0.82 and AUPRC of 0.90 on the holdout test set and an AUROC of 0.73 and AUPRC of 0.93 on an external test set with patient-wise predictions. This study highlights the potential of utilizing attention mechanisms to capture important time series progressions across EEG sequences for improving SCA prognosis. © 2024 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Empirical Studies on Application of Genetic Algorithms and Ant Colony Optimization for Data Clustering

Empirical Studies on Application of Genetic Algorithms and A...

引用

Computer Science Society (SCCC) International Conference Chilean FLAGGED

作者： Thelma Elita Colanzi Wesley Klewerton Guez Assunção Aurora Trinidad Ramirez Pozo Ana Cristina B. Kochem Vendramin Diogo Augusto Barros Pereira Computer Science Postgraduate Program Federal University of Paraná (UFPR) Curitiba Paraná Brazil Graduate School of Electrical Engineering and Computer Science (CPGEI) Federal Technological University of Paraná (UTFPR) Curitiba Paraná Brazil Informatics Department (DAINF)

Cluster analysis is used in several research areas to classify data sets in groups by their similar characteristics. Metaheuristic-based techniques, such as Genetic Algorithms (GAs) and Ant Colony Optimization (ACO), have been applied in order to increase the clustering algorithm performance. GA and ACO-based clustering algorithms are capable of efficiently and automatically forming natural groups from a pre-defined number of clusters. This paper presents a GA and an ACO algorithm to the clustering problem. Both algorithms were refined using local search in order to improve the clustering accuracy. The results are compared on numeric UCI databases.

关键词： Clustering algorithms Search problems Equations Mathematical model Gallium Genetic algorithms Memetics

来源：评论

学校读者我要写书评

暂无评论

Language-specific Characteristic Assistance for Code-switching Speech Recognition

arXiv

引用

arXiv 2022年

作者： Song, Tongtong Xu, Qiang Ge, Meng Wang, Longbiao Shi, Hao Lv, Yongjie Lin, Yuqin Dang, Jianwu Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Graduate School of Informatics Kyoto University Sakyo-ku Kyoto Japan Japan Advanced Institute of Science and Technology Ishikawa Japan

Dual-encoder structure successfully utilizes two language-specific encoders (LSEs) for code-switching speech recognition. Because LSEs are initialized by two pre-trained language-specific models (LSMs), the dual-encoder structure can exploit sufficient monolingual data and capture the individual language attributes. However, most existing methods have no language constraints on LSEs and underutilize language-specific knowledge of LSMs. In this paper, we propose a language-specific characteristic assistance (LSCA) method to mitigate the above problems. Specifically, during training, we introduce two language-specific losses as language constraints and generate corresponding language-specific targets for them. During decoding, we take the decoding abilities of LSMs into account by combining the output probabilities of two LSMs and the mixture model to obtain the final predictions. Experiments show that either the training or decoding method of LSCA can improve the model's performance. Furthermore, the best result can obtain up to 15.4% relative error reduction on the code-switching test set by combining the training and decoding methods of LSCA. Moreover, the system can process code-switching speech recognition tasks well without extra shared parameters or even retraining based on two pre-trained LSMs by using our method. Copyright © 2022, The Authors. All rights reserved.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：