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

30th International Conference on Neural Information Processing, ICONIP 2023

作者： Gong, Aiyue Fukumoto, Fumiyo Muangkammuen, Panitan Li, Jiyi Yu, Dongjin School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Integrated Graduate School of Medicine Engineering Agricultural Sciences Faculty of Engineering University of Yamanashi Kofu400-8511 Japan Faculty of Engineering Graduate Faculty of Interdisciplinary Research University of Yamanashi Kofu400-8511 Japan

ISBN: (纸本)9789819981830

Technical debt occurs when development teams take actions to expedite the delivery of a project at the cost of poor code quality and additional work of later refactoring. The accumulation of technical debt will make the software fixes prohibitively expensive. As a typical type of technical debt, Self-Admitted Technical Debt (SATD) is acknowledged by developers in code comments. Identifying SATD in code comments can improve code quality. However, manually discerning whether code comments contain SATD would be expensive and time-consuming. To solve this problem, we propose a method to apply the Ladder Network with the pre-training model to identify SATD based on the labeled data from 10 open source projects and the unlabeled data from another ten projects. By comparing with the original model of Ladder Network, and other semi-supervised learning models, the results show that the proposed method performs better in technical debt identification. In addition, the proposed method also achieves better results compared with supervised learning methods. This shows that our approach can make better use of unlabeled data to improve classification performance. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Tree paths: A new model for steering behaviors

Tree paths: A new model for steering behaviors

引用

9th International Conference on Intelligent Virtual Agents, IVA 2009

作者： Rodrigues, Rafael Araújo De Lima Bicho, Alessandro Paravisi, Marcelo Jung, Cláudio Rosito Magalhães, Léo Pini Musse, Soraia Raupp Graduate Programme in Computer Science PUCRS Building 32 Av. Ipiranga 6681 Porto Alegre RS Brazil Graduate Programme in Applied Computing UNISINOS Av. Unisinos 950 São Leopoldo RS Brazil School of Electrical and Computer Engineering UNICAMP Av. Albert Einstein 400 Campinas SP Brazil

ISBN: (纸本)3642043798

This paper describes a model for generating steering behaviors of groups of characters based on the biologically-motivated space colonization algorithm. This algorithm has been used in the past for generating leaf venation patterns and tree structures, simulating the competition for space between growing veins or branches. Adapted to character animation, this model is responsible for the motion control of characters providing robust and realistic group behaviors by adjusting just a few parameters. The main contributions are related with the robustness, flexibility and simplicity to control groups of characters. © 2009 Springer Berlin Heidelberg.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Task-based low-rank hybrid parallel Cholesky factorization for distributed memory environment 5

Task-based low-rank hybrid parallel Cholesky factorization f...

引用

5th International Conference on Big-data Service and Intelligent Computation, BDSIC 2023

作者： Jiao, Han Zhang, Jilin Suzuki, Tomohiro Integrated Graduate School of Medicine Engineering and Agricultural Sciences University of Yamanashi Yamanashi Kofu Japan School of Computer Science Hangzhou Dianzi University Zhejiang Hangzhou China Department of Interdisciplinary Reseach Division of Engineering University of Yamanashi Yamanashi Kofu Japan

ISBN: (纸本)9798400708893

The primary targets for improving efficiency for large-scale matrix factorization are reducing synchronization, addressing the overlap in communication and computation, and improving load balance. In recent years, tiled algorithms with task parallelism in multicore shared memory systems have become well-established as efficient methods for conducting fine-grained computations on smaller tiles. Moreover, they provide flexible execution orders for a runtime system in many situations. However, traditional hybrid programs with MPI and OpenMP for distributed memory systems use a fork-join model for multi-threads in each process, which leads to threadparallel computing tasks interchange with sequential communication tasks. In this paper, we incorporate task parallelism and low-rank approximation into a hybrid task-based Cholesky factorization in a distributed environment and propose some low-rank variants. We evaluate the performance of our programs on both full-rank inputs and low-rank inputs and report the pros and cons of the proposed programs. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

3D Geometric Shape Assembly via Efficient Point Cloud Matching 41

3D Geometric Shape Assembly via Efficient Point Cloud Matchi...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Lee, Nahyuk Min, Juhong Lee, Junha Kim, Seungwook Lee, Kanghee Park, Jaesik Cho, Minsu Department of Computer Science and Engineering POSTECH Pohang Korea Republic of Graduate School of Artificial Intelligence POSTECH Pohang Korea Republic of Department of Computer Science and Engineering Seoul National University Seoul Korea Republic of Interdisciplinary Program in Artificial Intelligence Seoul National University Seoul Korea Republic of

Learning to assemble geometric shapes into a larger target structure is a pivotal task in various practical applications. In this work, we tackle this problem by establishing local correspondences between point clouds of part shapes in both coarse- and fine-levels. To this end, we introduce Proxy Match Transform (PMT), an approximate high-order feature transform layer that enables reliable matching between mating surfaces of parts while incurring low costs in memory and compute. Building upon PMT, we introduce a new framework, dubbed Proxy Match TransformeR (PMTR), for the geometric assembly task. We evaluate the proposed PMTR on the large-scale 3D geometric shape assembly benchmark dataset of Breaking Bad and demonstrate its superior performance and efficiency compared to state-of-the-art methods. Project page: https://***/pmtr. Copyright 2024 by the author(s)

关键词： 3D modeling

来源：评论

学校读者我要写书评

暂无评论

Low-Voltage Ride-Through Scheme for Distributed Generation Inverters Using a Modified Current Reference Strategy 25

Low-Voltage Ride-Through Scheme for Distributed Generation I...

引用

25th IEEE International Conference on Industrial Technology, ICIT 2024

作者： Wen, Fankai Acuna, Pablo Yang, Jin Yuan, Zhige Ghias, Amer M. Y. M. Nanyang Technological University Interdisciplinary Graduate Programme Energy Research Institue @ Ntu Singapore Universidad De Talca Department Of Electrical Engineering Curico Chile School Of Aeronautics And Astronautics University Of Electronic Science And Technology Of China Chengdu China School Of Electrical And Electronic Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350340266

The growing number of distributed generations (DGs) has shifted the power supply to be more flexible and reliable. Meanwhile, for the stability of the power grid, the increasing integration demands a robust fault ride-through (FRT) ability when the unbalanced sag occurs in the grid operation, namely low-voltage ride-through (LVRT). During an unbalanced sag, the oscillation in the active and reactive power, the distorted and unbalanced current are the main significant detriments. Several current reference strategies have been developed to mitigate these adverse effects. However, the standard approach prioritizes compensation for one objective entirely, typically the sag, at the expense of leaving another objective unaddressed i.e. constant powers, balanced current, or harmonic distortion. To accomplish the characteristics of different current reference strategies, this paper modifies the current reference to achieve two control variables. Besides, to accurately boost the voltage at the point of common coupling, the reactive power compensation reference is proposed according to the power transfer equation. A model predictive control (MPC) controller is designed to deliver a given power by making the current follow the reference. The simulation results show that the proposed LVRT scheme achieves at the PCC voltage a more accurate and larger boost and the modified current strategy can decouple the traditional strategies. © 2024 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Deadline-constrained Multi-resource Task Mapping and Allocation for Edge-Cloud Systems

arXiv

引用

arXiv 2022年

作者： Gao, Chuanchao Shaan, Aryaman Easwaran, Arvind School of Computer Science and Engineering Nanyang Technological University Singapore Energy Research Institute @ NTU Interdisciplinary Graduate Programme Nanyang Technological University Singapore

In an edge-cloud system, mobile devices can offload their computation intensive tasks to an edge or cloud server to guarantee the quality of service or satisfy task deadline requirements. However, it is challenging to determine where tasks should be offloaded and processed, and how much network and computation resources should be allocated to them, such that a system with limited resources can obtain a maximum profit while meeting the deadlines. A key challenge in this problem is that the network and computation resources could be allocated on different servers, since the server to which a task is offloaded (e.g., a server with an access point) may be different from the server on which the task is eventually processed. To address this challenge, we first formulate the task mapping and resource allocation problem as a non-convex Mixed-Integer Nonlinear Programming (MINLP) problem, known as NP-hard. We then propose a zero-slack based greedy algorithm (ZSG) and a linear discretization method (LDM) to solve this MINLP problem. Experiment results with various synthetic tasksets show that ZSG has an average of 2.98% worse performance than LDM with a minimum unit of 5 but has an average of 6.88% better performance than LDM with a minimum unit of 15. © 2022, CC BY-NC-ND.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Co-Design of Out-of-Distribution Detectors for Autonomous Emergency Braking Systems

Co-Design of Out-of-Distribution Detectors for Autonomous Em...

引用

International Conference on Intelligent Transportation

作者： Michael Yuhas Arvind Easwaran Energy Research Institute @ NTU Interdisciplinary Graduate Programme Nanyang Technological University Singapore School of Computer Science and Engineering Nanyang Technological University Singapore

Learning enabled components (LECs), while critical for decision making in autonomous vehicles (AVs), are likely to make incorrect decisions when presented with samples outside of their training distributions. Out-of-distribution (OOD) detectors have been proposed to detect such samples, thereby acting as a safety monitor, however, both OOD detectors and LECs require heavy utilization of embedded hardware typically found in AVs. For both components, there is a tradeoff between non-functional and functional performance, and both impact a vehicle's safety. For instance, giving an OOD detector a longer response time can increase its accuracy at the expense of the LEC. We consider an LEC with binary output like an autonomous emergency braking system (AEBS) and use risk, the combination of severity and occurrence of a failure, to model the effect of both components' design parameters on each other's functional and non-functional performance, as well as their impact on system safety. We formulate a co-design methodology that uses this risk model to find the design parameters for an OOD detector and LEC that decrease risk below that of the baseline system and demonstrate it on a vision based AEBS. Using our methodology, we achieve a 42.3% risk reduction while maintaining equivalent resource utilization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Timed dataflow: Reducing communication overhead for distributed machine learning systems 22

Timed dataflow: Reducing communication overhead for distribu...

引用

22nd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2016

作者： Sun, Peng Wen, Yonggang Duong, Ta Nguyen Binh Yan, Shengen Energy Research Institute Interdisciplinary Graduate School Nanyang Technological University Singapore Singapore School of Computer Science and Engineering Nanyang Technological University Singapore Singapore Sensetime Group Limited Shatin N.T. Hong Kong

ISBN: (纸本)9781509044573

Many distributed machine learning (ML) systems exhibit high communication overhead when dealing with big data sets. Our investigations showed that popular distributed ML systems could spend about an order of magnitude more time on network communication than computation to train ML models containing millions of parameters. Such high communication overhead is mainly caused by two operations: pulling parameters and pushing gradients. In this paper, we propose an approach called Timed Dataflow (TDF) to deal with this problem via reducing network traffic using three techniques: a timed parameter storage system, a hybrid parameter filter and a hybrid gradient filter. In particular, the timed parameter storage technique and the hybrid parameter filter enable servers to discard unchanged parameters during the pull operation, and the hybrid gradient filter allows servers to drop gradients selectively during the push operation. Therefore, TDF could reduce the network traffic and communication time significantly. Extensive performance evaluations in a real testbed showed that TDF could reduce up to 77% and 79% of network traffic for the pull and push operations, respectively. As a result, TDF could speed up model training by a factor of up to 4 without sacrificing much accuracy for some popular ML models, compared to systems not using TDF. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Hybrid Global Flexible Power Point Tracking Algorithm for Photovoltaic Systems

Hybrid Global Flexible Power Point Tracking Algorithm for Ph...

引用

2024 Energy Conversion Congress and Expo Europe, ECCE Europe 2024

作者： Kumaresan, Anusha Tafti, Hossein Dehghani Farivar, Glen G. Pou, Josep Strunz, Kai Niyato, Dusit Nanyang Technological University Energy Research Institute at Ntu Interdisciplinary Graduate Programme Singapore Australia The University of Melbourne Department of Electrical and Electronic Engineering VIC3010 Australia Nanyang Technological University School of Electrical and Electronic Engineering Singapore Technische Universität Chair for Sustainable Electric Networks and Sources of Energy Berlin Germany Nanyang Technological University School of Computer Science and Engineering Singapore

ISBN: (纸本)9798350364446

Frequency support in grid-connected photovoltaic (PV) systems is achieved by employing flexible power point tracking (FPPT) algorithms. Subsequently, according to the grid frequency requirements, the PV power is curtailed to a power reference, unlike the traditional method of operating the PV at the maximum power point. In practical cases, the PV arrays are prone to partial shading, and hence, there is a requirement to formulate the FPPT algorithms that operates effectively during such cases. Moreover, fast transient response is a necessity, which implies that the algorithms proposed in this paper is desirable. This paper proposes a hybrid global FPPT (GFPPT) algorithm based on secant and Newton's method, to shift the PV operating point to the required power reference. The Newton's method offers quadratic convergence rate and the secant method guarantees convergence. Hence, a hybrid algorithm consisting of these two methods will provide both fast and guaranteed convergence. Validation through simulation is presented in this paper and the proposed method is compared with the recently presented perturb and observe (P&O) GFPPT algorithm in the literature. © 2024 IEEE.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Quest for the best endoscopic imaging modality for computer-assisted colonic polyp staging

引用

World Journal of Gastroenterology 2019年第10期25卷 1197-1209页

作者： Georg Wimmer Michael Gadermayr Gernot Wolkersdorfer Roland Kwitt Toru Tamaki Jens Tischendorf Michael Hafner Shigeto Yoshida Shinji Tanaka Dorit Merhof Andreas Uhl Department of Computer Sciences University of Salzburg Interdisciplinary Imaging and Vision Institute Aachen RWTH Aachen Department of Internal Medicine I Paracelsus Medical University/Salzburger Landeskliniken(SALK) Department of Information Engineering Graduate School of EngineeringHiroshima University Internal Medicine and Gastroenterology University Hospital Aachen Department of Gastroenterologie and Hepatologie Krankenhaus St.Elisabeth Department of Endoscopy and Medicine Graduate School of Biomedical and Health ScienceHiroshima University Department of Endoscopy Hiroshima University Hospital

BACKGROUND It was shown in previous studies that high definition endoscopy, high magnification endoscopy and image enhancement technologies, such as chromoendoscopy and digital chromoendoscopy [narrow-band imaging(NBI), iScan] facilitate the detection and classification of colonic polyps during endoscopic sessions. However, there are no comprehensive studies so far that analyze which endoscopic imaging modalities facilitate the automated classification of colonic polyps. In this work, we investigate the impact of endoscopic imaging modalities on the results of computer-assisted diagnosis systems for colonic polyp *** To assess which endoscopic imaging modalities are best suited for the computerassisted staging of colonic *** In our experiments, we apply twelve state-of-the-art feature extraction methods for the classification of colonic polyps to five endoscopic image databases of colonic lesions. For this purpose, we employ a specifically designed experimental setup to avoid biases in the outcomes caused by differing numbers of images per image database. The image databases were obtained using different imaging modalities. Two databases were obtained by high-definition endoscopy in combination with i-Scan technology(one with chromoendoscopy and one without chromoendoscopy). Three databases were obtained by highmagnification endoscopy(two databases using narrow band imaging and one using chromoendoscopy). The lesions are categorized into non-neoplastic and neoplastic according to the histological *** Generally, it is feature-dependent which imaging modalities achieve high results and which do not. For the high-definition image databases, we achieved overall classification rates of up to 79.2% with chromoendoscopy and 88.9% without chromoendoscopy. In the case of the database obtained by high-magnification chromoendoscopy, the classification rates were up to 81.4%. For the combination of high-magnification endoscopy with NBI, results

关键词： Endoscopy Colonic polyps Automated diagnosis system Narrow-band imaging Chromoendoscopy Imaging modalities Image enhancement technologies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：