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

Case study: stereo vision experiments with multi-core software API on embedded MPSoC environments

JOURNAL OF SUPERCOMPUTING 2012年第1期61卷 103-117页

作者： Li, Jia-Jhe Chen, Chung-Kai Wu, Tung-Yu Lee, Jenq Kuen Natl Tsing Hua Univ Dept Comp Sci Programming Language Lab Hsinchu 30043 Taiwan Realtek Semicond Corp Hsinchu Taiwan

Markov random field models provide a robust formulation of low-level vision problems. Among all these problems, stereo vision remains the most investigated field. The belief propagation (BP) method provides accurate result in stereo vision problems. However, the algorithm remains slow for practical use. This paper describes a case study on the parallelization of belief propagation for stereo matching using the "Multi-core Software APIs" (MSA) on embedded MPSoC environments. MSA is a library-based middleware providing an asynchronous remote procedure call (RPC) mechanism. It supplies a function-offloading programming model to hide the underlying interprocessor communication and configuration detail from programmers. Furthermore, MSA provides a set of stream-specific APIs for supporting a streaming-function remoting mechanism on heterogeneous multi-core architectures. Our experiments shows that the BP method for stereo matching can be adapted from a single core program to a multi-core one for embedded MPSoC environments rapidly.

关键词： Multi-core programming Remote procedure call Streaming Stereo matching

来源：评论

学校读者我要写书评

暂无评论

Testing the Compiler for a New-Born programming language: An Industrial Case Study (Experience Paper) 2023

Testing the Compiler for a New-Born Programming Language: An...

引用

32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)

作者： Zhao, Yingquan Chen, Junjie Fu, Ruifeng Ye, Haojie Wang, Zan Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Huawei Programming Language Lab Hangzhou Peoples R China

ISBN: (纸本)9798400702211

Due to the critical role of compilers, many compiler testing techniques have been proposed, two most notable categories among which are grammar-based and metamorphic-based techniques. All of them have been extensively studied for testing mature compilers. However, it is typical to develop a new compiler for a new-born programming language in practice. In this scenario, the existing techniques are hardly applicable due to some major reasons: (1) no reference compilers to support differential testing, (2) lack of program analysis tools to support most of metamorphic-based compiler testing, (3) substantial implementation effort incurred by different programming language features. Hence, it is unknown how the existing techniques perform in this new scenario. In this work, we conduct the first exploration (i.e., an industrial case study) to investigate the performance of the existing techniques in this new scenario with substantial adaptations. We adapted grammar-based compiler testing to this scenario by synthesizing new test programs based on code snippets and using compilation crash as test oracle due to the lack of reference compilers for differential testing. We also adapted metamorphic-based compiler testing to this scenario by constructing equivalent test programs under any inputs to relieve the dependence on program analysis tools. We call the adapted techniques SynFuzz and MetaFuzz, respectively. We evaluated both SynFuzz and MetaFuzz on two versions of a new compiler for a new-born programming language in a global IT company. By comparing with the testing practice adopted by the testing team and the general fuzzer (AFL), SynFuzz can detect more bugs during the same testing time, and both SynFuzz and MetaFuzz can complement the other two techniques. In particular, SynFuzz and MetaFuzz have detected 11 previously unknown bugs, all of which have been fixed by the developers. From the industrial case study, we summarized a series of lessons and suggestions for prac

关键词： Compiler Testing Program Synthesis Metamorphic Testing

来源：评论

学校读者我要写书评

暂无评论

Program Ingredients Abstraction and Instantiation for Synthesis-based JVM Testing 24

Program Ingredients Abstraction and Instantiation for Synthe...

引用

31st Conference on Computer and Communications Security

作者： Zhao, Yingquan Wang, Zan Chen, Junjie Fu, Ruifeng Lu, Yanzhou Gao, Tianchang Ye, Haojie Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Programming Language Lab Huawei Hangzhou Peoples R China

ISBN: (纸本)9798400706363

Java Virtual Machine (JVM) holds a crucial position in executing various Java programs, thereby necessitating rigorous testing to ensure software reliability and security. Regarding existing JVM testing techniques, synthesis-based techniques have proven to be state-of-the-art, which construct a test program by synthesizing various program ingredients extracted from historical bug-revealing test programs into a seed program. However, existing synthesis-based techniques directly use the program ingredients specific to historical bugs, which limits the test scope without the ability of covering more JVM features and negatively affects the diversity of synthesized test programs. This paper introduces a paradigm of "ingredient abstraction and instantiation" for synthesis-based JVM testing and develops a new technique called Jetris. Instead of merely inserting the specific program ingredients into different seed programs, Jetris leverages the knowledge derived from historical bug-revealing program ingredients to generalize bug-revealing patterns (i.e., control- and data-flow patterns), and then utilizes these patterns as guidance to generate more program ingredients. To achieve a more comprehensive exploration, we enrich the generated ingredients by incorporating various program elements (e.g., new data type). We extensively evaluated Jetris on four Long-Term Support OpenJDK versions of two mainstream JVMs (i.e., HotSpot and OpenJ9). The experimental results demonstrate that Jetris can detect more unique bugs than existing techniques, and the test programs generated by Jetris can achieve higher JVM code coverage. Additionally, Jetris successfully detects 21 previously unknown bugs in these mainstream JVMs, and 13 of them have been confirmed/fixed by developers. Moreover, Jetris has been successfully applied to a new JVM implementation in a global IT company and detected 9 bugs during the practical evaluation.

关键词： Java Virtual Machine Program Synthesis JVM Testing Compiler Testing

来源：评论

学校读者我要写书评

暂无评论

Experimental reliability analysis of multi-UAV simulation with TMO-based distributed architecture and global time synchronization

Experimental reliability analysis of multi-UAV simulation wi...

引用

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORC Workshops 2010

作者： Song, Seung-Hwa Kim, Doo-Hyun Chang, Chun-Hyon Embedded Computing Lab School of Internet and Multimedia Engineering Konkuk University Seoul Korea Republic of Programming Language Lab School of Computer Engineering Konkuk University Seoul Korea Republic of

ISBN: (纸本)9780769540382

In developing multi-UAV(Unmanned Aerial Vehicle) system, a simulation environment is essential to verify the functionalities of the whole system with higher productivity and reduced risks of accidents. Simulations of multi-UAV systems are usually accomplished by using distributed systems where multiple standalone simulators are connected via a network. Thus, in order to achieve an improved reality in such distributed simulation environments, the whole multi-UAV simulator should be guaranteed real-time and synchronized behaviors among the connected systems. In this paper, we discuss about the necessity of two important real-time features, i.e., the periodicity of computations and the clock synchronization among standalone simulators. We also propose an architecture based on TMO(Time-triggered and Message-triggered Object) model as a multi-UAV simulation platform with our preliminary experimental results showing its potential feasibilities. © 2010 IEEE.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Lisp50 the 50th birthday of Lisp at OOPSLA 2008

Lisp50 the 50th birthday of Lisp at OOPSLA 2008

引用

23rd ACM SIGPLAN Conference on Object Oriented programming Systems languages and Applications,OOPSLA 2008

作者： Costanza, Pascal Gabriel, Richard P. Hirschfeld, Robert Steele Jr., Guy L. Vrije Universiteit Brussel Programming Technology Lab Brussels Belgium IBM Research Hawthorne NY United States Hasso-Plattner Institut Universitat Potsdam Potsdam Germany Sun Microsystems Laboratories Programming Language Research Group Burlington MA United States

In October 1958, John McCarthy published one in a series of reports about his then ongoing effort for designing a new programming language that would be especially suited for achieving artificial intelligence. That report was the first one to use the name LISP for this new programming language. 50 years later, Lisp is still in use. We would like to celebrate Lisp's 50th birthday. OOPSLA 2008 is an excellent venue for such a celebration, because object-oriented programming benefitted heavily from Lisp ideas and because OOPSLA 2008 takes place in October, exactly 50 years after the name Lisp has been used publicly for the first time. We will have talks by John McCarthy himself, and numerous other influential Lispers from the past five decades. We will also take a look at the next 50 years of Lisp.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach

arXiv

引用

arXiv 2017年

作者： Li, Zengkun Huawei 2012 Lab Central Software Institute Compiler and Programming Language Lab

This paper presents a non-manual design engineering method based on heuristic search algorithm to search for candidate agents in the solution space which formed by artificial intelligence agents modeled on the base of bionics. Compared with the artificial design method represented by meta-learning and the bionics method represented by the neural architecture chip, this method is more feasible for realizing artificial general intelligence, and it has a much better interaction with cognitive neuroscience;at the same time, the engineering method is based on the theoretical hypothesis that the final learning algorithm is stable in certain scenarios, and has generalization ability in various scenarios. The paper discusses the theory preliminarily and proposes the possible correlation between the theory and the fixed-point theorem in the field of mathematics. Limited by the author’s knowledge level, this correlation is proposed only as a kind of conjecture. Copyright © 2017, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Weighted Cross-entropy for Low-Resource languages in Multilingual Speech Recognition 25

Weighted Cross-entropy for Low-Resource Languages in Multili...

引用

25th Interspeech Conference

作者： Pineiro-Martin, Andres Garcia-Mateo, Carmen Docio-Fernandez, Laura Del Carmen Lopez-Perez, Maria Rehm, Georg Univ Vigo AtlanTTic Res Ctr GTM Res Grp Vigo Spain Balidea Consulting & Programming SL Santiago De Compostela Spain DFKI GmbH Speech & Language Technol Lab Berlin Germany

This paper addresses the challenge of integrating low-resource languages into multilingual automatic speech recognition (ASR) systems. We introduce a novel application of weighted cross-entropy, typically used for unbalanced datasets, to facilitate the integration of low-resource languages into pre-trained multilingual ASR models within the context of continual multilingual learning. We fine-tune the Whisper multilingual ASR model on five high-resource languages and one low-resource language, employing language-weighted dynamic cross-entropy and data augmentation. The results show a remarkable 6.69% word error rate (WER) reduction for the low-resource language compared to the fine-tuned model without applying our approach, and a 48.86% WER reduction compared to the original Whisper model. In addition, our approach yields an average WER reduction of 3.29% across the six languages, showing no degradation for the high-resource languages.

关键词： Continual multilingual learning automatic speech recognition weighted cross-entropy low-resource language

来源：评论

学校读者我要写书评

暂无评论

A lock-free cache-friendly software queue buffer for decoupled software pipelining

A lock-free cache-friendly software queue buffer for decoupl...

引用

2010 International Computer Symposium, ICS 2010

作者： Chen, Wen Ren Yang, Wuu Hsu, Wei Chung Programming Language and System Lab Institute of Computer Science and Engineering National Chiao Tung University Hsinchu 30013 Taiwan System Lab. Institute of Computer Science and Engineering National Chiao Tung University Hsinchu 30013 Taiwan

ISBN: (纸本)9781424476404

Multicore has become a trend on server and client computers in recent years. Parallelization is one way to fully utilize the computing power provided by multicore architectures. Most applications of interest have complex data and control dependency, which make traditional parallelization techniques, such as DOALL and DOACROSS, inapplicable. Decoupled Software Pipelining (DSWP), a new parallelization technique, shows its potential on parallelizing general applications. However, its success relies on fast inter-core synchronization and communication. On commodity multicore platforms, the performance of current DSWP disappoints us since the overhead involving lock-based, cache dishonored software approach offsets the benefit from DSWP. We present a lock-free, cache-friendly software queue designed for DSWP. A lock-free, cache-friendly solution need take two different aspects of memory system, memory coherence and memory consistency, into *** show how inattention to these two aspects leads to incorrect or inefficient solutions. We also present our approach to providing a correct and efficient solution with detailed explanation. Due to the nondeterministic nature of parallel programs, traditional testing techniques cannot be used to fully verify the correctness of the implementation. We also discuss the correctness of our implementation both in informal and formal ways. ©2010 IEEE.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Medical Data Analysis Using AutoML Frameworks

引用

JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY 2024年第7期19卷 4515-4522页

作者： Shin, Seunghun Park, Dongyoung Ji, Suhwan Joo, Gihun Im, Hyeonseung Kangwon Natl Univ Interdisciplinary Grad Program Med Bigdata Converg Major AI & Software Chunchon 24341 South Korea Yonsei Univ Theory Computat Lab Seoul 03722 South Korea Kangwon Natl Univ Programming Language & Machine Learning Lab Chunchon 24341 South Korea Kangwon Natl Univ Dept Comp Sci & Engn Chunchon 24341 South Korea

Recently, there has been a growing interest in applying machine learning (ML) and deep learning to medical big data and smart healthcare. However, it can be challenging to possess both domain knowledge of medical data and expertise in ML necessary for conducting research in this area. In this regard, an automated machine learning (AutoML) framework can be a solution, which automates an ML pipeline-building process from data cleansing and preprocessing to model building, optimization, and performance evaluation. Since AutoML can reduce domain dependency in ML and quickly build high-performance models, it has a high potential for use in the medical and healthcare fields. Therefore, in this paper, we aim to validate the effectiveness of various AutoML frameworks using structured and unstructured medical data such as electronic medical records, medical images, and signal data. More specifically, we compare the performance of representative AutoML frameworks and simple handcrafted models in terms of various metrics such as the area under the curve, accuracy, and F1 score. Our experimental results show that AutoML effectively handles structured and unstructured data in general, but it still needs to be further improved to deal with data that is imbalanced or requires special preprocessing, such as signal data.

关键词： AutoML Machine learning Medical data Medical imaging Biosignals

来源：评论

学校读者我要写书评

暂无评论

Escape from Escape Analysis of Golang 42

Escape from Escape Analysis of Golang

引用

42nd ACM/IEEE International Conference on Software Engineering - Companion Proceedings (ICSE-Companion) / 42nd ACM/IEEE International Conference on Software Engineering - Software Engineering in Practice (ICSE-SEIP)

作者： Wang, Cong Zhang, Mingrui Jiang, Yu Zhang, Huafeng Xing, Zhenchang Gu, Ming Tsinghua Univ Sch Software BNRist KLISS Beijing Peoples R China Huawei Technol Compiler & Programming Language Lab Hangzhou Peoples R China Australian Natl Univ Coll Engn & Comp Sci Canberra ACT Australia

ISBN: (纸本)9781450371230

Escape analysis is widely used to determine the scope of variables, and is an effective way to optimize memory usage. However, the escape analysis algorithm can hardly reach 100% accurate, mistakes of which can lead to a waste of heap memory. It is challenging to ensure the correctness of programs for memory optimization. In this paper, we propose an escape analysis optimization approach for Go programming language (Golang), aiming to save heap memory usage of programs. First, we compile the source code to capture information of escaped variables. Then, we change the code so that some of these variables can bypass Golang's escape analysis mechanism, thereby saving heap memory usage and reducing the pressure of memory garbage collection. Next, we present a verification method to validate the correctness of programs, and evaluate the effect of memory optimization. We implement the approach to an automatic tool and make it open-source(1). For evaluation, we apply our approach to 10 open-source projects. For the optimized Golang code, the heap allocation is reduced by 8.88% in average, and the heap usage is reduced by 8.78% in average. Time consumption is reduced by 9.48% in average, while the cumulative time of GC pause is reduced by 5.64% in average. We also apply our approach to 16 industrial projects in Bytedance Technology. Our approach successfully finds 452 optimized cases which are confirmed by developers.

关键词： escape analysis memory optimization code generation go programming language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：