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

IEEE Open Journal of Nanotechnology 2023年 4卷 150-155页

作者： Chen, Yi-Ho Ohori, Daisuke 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 Tohoku University Institute of Fluid Science Sendai980-8577 Japan National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Hsinchu300093 Taiwan National Yang Ming Chiao Tung University Institute of Pioneer Semiconductor Innovation Hsinchu300093 Taiwan National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Institute of Communications Engineering Institute of Biomedical Engineering Hsinchu300093 Taiwan National Yang Ming Chiao Tung University Department of Electronics and Electrical Engineering Hsinchu300093 Taiwan National Yang Ming Chiao Tung University Institute of Communications Engineering Hsinchu300093 Taiwan

This study investigated the electrical properties of AlGaN/GaN high-electron-mobility transistors (HEMTs) with varied recess depths under the gate electrode. We demonstrated a recess depth of approximately 6 nm, which was achieved through neutral beam etching (NBE) technique with a low etch rate of 1.8 nm/min, resulting in device enhancement-mode (E-mode) behavior with threshold voltage (Vth) of 0.49 V. The effects of post-metallization annealing (PMA) on the device performance were also examined. The results revealed that PMA treatment improves the DC characteristics of the devices, including maximum drain current (IDMAX), transconductance (gm), subthreshold swing (SS), on-off ratio, and off-state leakage current, with maximum enhancement percentage of 18.3% for IDMAX, 3758% for on-off ratio, and 54.3% for SS. Moreover, this study compared the recess depths of metal-insulator-semiconductor high-electron-mobility transistors (MIS-HEMTs) with the SiN dielectric layer. The results showed that MIS-HEMTs exhibit more negative Vth values, which can be attributed to the controlled surface states achieved through passivation. © 2020 IEEE.

关键词： Etching

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in the Message Passing Interface 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Jesper Larsson Träff Siegfried Benkner Jack J. Dongarra

ISBN: (数字)9783642335181

ISBN: (纸本)9783642335174

This book constitutes the refereed proceedings of the 19th European MPI Users' Group Meeting, EuroMPI 2012, Vienna, Austria, September 23-26, 2012. The 29 revised papers presented together with 4 invited talks and 7 poster papers were carefully reviewed and selected from 47 submissions. The papers are organized in topical sections on MPI implementation techniques and issues; benchmarking and performance analysis; programming models and new architectures; run-time support; fault-tolerance; message-passing algorithms; message-passing applications; IMUDI, improving MPI user and developer interaction.

关键词： Algorithm Analysis and Problem Complexity computer Communication Networks Software Engineering Programming Techniques computer Systems Organization and Communication Networks Simulation and Modeling

来源：评论

学校读者我要写书评

暂无评论

Symbolic Analysis of Concurrency Errors in OpenMP Programs

Symbolic Analysis of Concurrency Errors in OpenMP Programs

引用

International Conference on Parallel Processing (ICPP)

作者： Hongyi Ma Steve R. Diersen Liqiang Wang Chunhua Liao Daniel Quinlan Zijiang Yang Department of Computer Science University of Wyoming Center for Applied Scientific Computing Lawrence Livermore National Laboratory Department of Computer Science Western Michigan University

In this paper we present the OpenMP Analysis Toolkit (OAT), which uses Satisfiability Modulo Theories (SMT) solver based symbolic analysis to detect data races and deadlocks in OpenMP codes. Our approach approximately simulates real executions of an OpenMP program through schedule permutation. We conducted experiments on real-world OpenMP benchmarks and student homework assignments by comparing our OAT tool with two commercial dynamic analysis tools: Intel Thread Checker and Sun Thread Analyzer, and one commercial static analysis tool: Viva64 PVS Studio. The experiments show that our symbolic analysis approach is more accurate than static analysis and more efficient and scalable than dynamic analysis tools with less false positives and negatives.

关键词： Encoding System recovery Synchronization Arrays Indexes Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Improved Dwarf Mongoose Optimization for Constrained Engineering Design Problems

引用

Journal of Bionic Engineering 2023年第3期20卷 1263-1295页

作者： Jeffrey O.Agushaka Absalom E.Ezugwu Oyelade N.Olaide Olatunji Akinola Raed Abu Zitar Laith Abualigah School of Mathematics Statisticsand Computer ScienceUniversity of KwaZulu-NatalKing Edward AvenuePietermaritzburg CampusPietermaritzburg3201KwaZulu-NatalSouth Africa Department of Computer Science Federal University of LafiaLafia950101Nigeria Unit for Data Science and Computing North-West University11 Hoffman StreetPotchefstroom2520South Africa Sorbonne Center of Artificial Intelligence Sorbonne University-Abu Dhabi38044Abu DhabiUnited Arab Emirates Hourani Center for Applied Scientific Research Al-Ahliyya Amman UniversityAmman19328Jordan Faculty of Information Technology Middle East UniversityAmman11831Jordan Faculty of Information Technology Applied Science Private UniversityAmman11931Jordan School of Computer Sciences Universiti Sains Malaysia11800Pulau PinangMalaysia

This paper proposes a modified version of the Dwarf Mongoose Optimization Algorithm (IDMO) for constrained engineering design problems. This optimization technique modifies the base algorithm (DMO) in three simple but effective ways. First, the alpha selection in IDMO differs from the DMO, where evaluating the probability value of each fitness is just a computational overhead and contributes nothing to the quality of the alpha or other group members. The fittest dwarf mongoose is selected as the alpha, and a new operator ω is introduced, which controls the alpha movement, thereby enhancing the exploration ability and exploitability of the IDMO. Second, the scout group movements are modified by randomization to introduce diversity in the search process and explore unvisited areas. Finally, the babysitter's exchange criterium is modified such that once the criterium is met, the babysitters that are exchanged interact with the dwarf mongoose exchanging them to gain information about food sources and sleeping mounds, which could result in better-fitted mongooses instead of initializing them afresh as done in DMO, then the counter is reset to zero. The proposed IDMO was used to solve the classical and CEC 2020 benchmark functions and 12 continuous/discrete engineering optimization problems. The performance of the IDMO, using different performance metrics and statistical analysis, is compared with the DMO and eight other existing algorithms. In most cases, the results show that solutions achieved by the IDMO are better than those obtained by the existing algorithms.

关键词： Improved dwarf mongoose Nature-inspired algorithms Constrained optimization Unconstrained optimization Engineering design problems

来源：评论

学校读者我要写书评

暂无评论

Advances in Geometric Modeling and Processing 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Bernard Mourrain Scott Schaefer Guoliang Xu

ISBN: (数字)9783642134111

ISBN: (纸本)9783642134104

This volume contains the papers presented at 6th Conference on Geometric Modeling and Processing (GMP 2010) held in Castro Urdiales, Spain during June16–18,2010. GeometricModelingandProcessingisabiannualinternational conference series on geometric modeling, simulation and computing. Previously, GMPhasbeenheldinHongKong(2000),Saitama,Japan(2002),Beijing,China (2004), Pittsburgh, USA (2006) and Hangzhou, China (2008). GMP 2010 received a total of 30 submissions that were reviewed by three to four Program Committee members on average. While the number of subm- sions dropped signi?cantly from previous years, the quality did not and was still quite high overall. Based on the reviews received, the committee decided to - cept 20 papers for inclusion in the proceedings. Additionally, extended versions of selected papers were considered for a special issue of computer-Aided - sign (CAD) and computer-Aided Geometric Design (CAGD). The paper topics spanned a wide variety and include: – Solutions of transcendental equations – Volume parameterization – Smooth curves and surfaces – Isogeometric analysis – Implicit surfaces – Computational geometry Many people helped make this conference happen and we are grateful for their help. We would especially like to thank the Conference Chair, all of the authors who submitted papers, the ProgramCommittee members who reviewed the papers and all of the participants at the conference.

关键词： computer Graphics Programming Techniques Theory of Computation Discrete Mathematics in computer science Algorithm Analysis and Problem Complexity Pattern Recognition

来源：评论

学校读者我要写书评

暂无评论

Visualization of the mining models on a data mining and integration platform

Visualization of the mining models on a data mining and inte...

引用

作者： Janciak, Ivan Lenart, Marek Brezany, Peter Novakova, Lenka Habala, Ondrej Research Group of Scientific Computing Faculty of Computer Science University of Vienna Austria Department of Cybernetics Faculty of Electrical Engineering Czech Technical University Czech Republic Institute of Informatics Slovak Academy of Sciences Slovakia

ISBN: (纸本)9789532330670

An appropriate and understandable data visualization is a key feature for the usability of a data mining system. The proper visualization methods for data exploration increase the whole acceptability of the system and proper selection of the further data processing tasks. This paper introduces a framework for visualization of results as it is being implemented in the European project ADMIRE (Advanced Data Mining and Integration Research for Europe). The feasibility of the framework for distributed systems is presented on a real data mining and integration scenario. We describe two visualization components fully implemented and deployed in the distributed environment. The first one is implemented on the ADMIRE Gateway and is processing input data and producing information required by the second component residing on the ADMIRE Workbench, which provides the actual graphical visualization. The ADMIRE Gateway and Workbench are two basic components of the distributed ADMIRE Platform. © 2011 MIPRO.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Achievable Sum-Rate Maximizing AF Relay Beamforming Scheme in Two-Way Relay Channels

Achievable Sum-Rate Maximizing AF Relay Beamforming Scheme i...

引用

IEEE International Conference on Communications Workshops, ICC

作者： N. Lee H. J. Yang J. Chun Scientific Computing Laboratory School of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

This paper deals with design of a amplify-and- forward (AF) relay beamforming matrix in a two-way relay protocol when a relay node has multiple antennas. Two-way relaying is a promising protocol since it provides enhanced spectral efficiency compared to one-way relaying protocols. In this paper we derive the achievable sum-rate upper bound of AF beamforming scheme and propose the achievable sum-rate maximizing relay beamforming scheme when the destination and the relay node have perfect knowledge of the channel state information (CSI) for forward and backward channels. The solution of the sum-rate maximizing scheme is obtained by using the proposed algorithm, general power iterative algorithm, which solves a global optimization problem efficiently. Comparing with one-way relaying protocol, the improved sum-rate performance of the proposed scheme is verified by numerical simulation.

关键词： Relays Array signal processing Power system relaying Protocols Peer to peer computing Iterative algorithms Wireless networks Decoding Communications Society Conferences

来源：评论

学校读者我要写书评

暂无评论

Text-to-Image Synthesis using Generative Adversarial Networks

Text-to-Image Synthesis using Generative Adversarial Network...

引用

IEEE International Conference on Intelligent computing and Information Systems (ICICIS)

作者： Mostafa Samy Ibrahim Mariam Nabil El-Berry Mohamed Fahmy Tolba Sayed Fadel Bahgat Bachelor of Computer and Information Science Faculty of Computer and Information Sciences-Ain Shams University Lecturer in Scientific Computing Department Faculty of Computer and Information Sciences-Ain Shams University Maryam Scientific Computing Department Faculty of Computer and Information Sciences-Ain Shams University

Text-to-image synthesis is considered a unique problem in image synthesis, which is the task of generating image from input text. Previously, the purpose of text-to-image synthesiswas to match words and images using retrieval methods basedon a phrase or collection of keywords. With the evolution ofdeep learning, particularly the usage of generative models, image synthesis has made potentially significant advancements. One of the most significant generative models are Generative Adversarial Networks (GANs), and they have been widely successfully utilized in various domains. In this study proposes our model, examines and summarizes recent work on GAN-based text-to-image synthesis, as well as providing an overview of the evolution of both classic and cutting-edge models. The usual structure of each category is described in depth. The survey presents a thorough review of the development of GAN-based text to image synthesis. Finally, Dynamic Memory GAN with Contrastive Learning (DMGAN+CL) with prompt engineering, which optimizes and acquires consistent textual representations for captions using the contrastive learning technique. We tested our technique on the CUB-200 dataset, and the findings demonstrate that our framework achieved comparable results with other typical GANs architectures in text-to-image synthesis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Alternate Transmission Relaying Schemes for MIMO Wireless Networks

Alternate Transmission Relaying Schemes for MIMO Wireless Ne...

引用

IEEE Conference on Wireless Communications and Networking

作者： Heesun Park Joohwan Chun Scientific Computing Laboratory School of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

Enormous gains of using multiple antennas at both the transmitter and the receiver known as multiple-input multiple-output (MIMO) in wireless communication system have been predicted. Especially, significant improvements in spectral efficiency are given through spatial multiplexing which transmits independent data streams over multiple transmit antennas simultaneously. Recently, many researches demonstrate that similar performance gains are obtained in wireless relay networks with multiple antennas at each terminal. In this paper, we propose a relaying protocol named as alternate transmission relaying protocol which enhances the capacity of the given environment and describe the capacity of MIMO wireless relay networks for the proposed relaying protocol. We consider a system model which has K relay terminals between a designated source terminal and a designated destination terminal. The proposed protocol assumes that no interference exists among the relay terminals. The K relay terminals receive or transmit a signal alternately without an interference. Several singular value decomposition (SVD) based relaying schemes are proposed for the proposed relaying protocol to perform a coherent combining at the destination terminal. In addition, a weight matrix for each relay terminal is designed to increase the capacity of the relaying schemes. We show the theoretical derivations and the simulation results of the proposed schemes in the following sections. Those demonstrate an effectiveness of the proposed schemes.

关键词： Relays MIMO Wireless networks Wireless application protocol Transmitting antennas Interference Receiving antennas Transmitters Wireless communication Performance gain

来源：评论

学校读者我要写书评

暂无评论

Fast and accurate structural RNA alignment by progressive lagrangian optimization

引用

1st International Symposium on Computational Life sciences, CompLife 2005

作者： Bauer, Markus Klau, Gunnar W. Reinert, Knut Algorithmic Bioinformatics Group Institute of Computer Science Free University of Berlin Germany International Max Planck Research School on Computational Biology and Scientific Computing Germany Mathematics in Life Sciences Group Institute of Mathematics Free University of Berlin Germany

ISBN: (纸本)3540291040

During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignment is an essential step in finding structurally conserved regions in related RNA sequences. In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence, any method that relates RNA sequences in form of multiple alignments should take structural features into account, which has been verified in recent studies. Progress has been made in developing new structural alignment algorithms, however, current methods are computationally costly or do not have the desired accuracy to make them an everyday tool. In this paper we present a fast, practical, and accurate method for computing multiple, structural RNA alignments. The method is based on combining a new pairwise structural alignment method with the popular program T-Coffee. Our pairwise method is based on an integer linear programming (ILP) formulation resulting from a graph-theoretic reformulation of the structural alignment problem. We find provably optimal or near-optimal solutions of the ILP with a Lagrangian approach. Tests on a recently published benchmark set show that our Lagrangian approach outper-forms current programs in quality and in the length of the sequences it can align. © Springer-Verlag Berlin Heidelberg 2005.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：