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

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

作者： Mohamed Mahmoud Abdelhamid Amr Wael Abdelmawgod Mohamed Tharwat Al-Metwally Abdelrahman Mohamed Hossien Howida A. Shedeed Eslam Saeed Fouly Aya Naser Scientific Computing Department Faculty of Computer and Information Science Ain Shams University Cairo Egypt Scientific Computing Department Faculty of Computer and Information Science Ain Shams University

Classifying various precise manual movements based on electroencephalogram (EEG) signals presents an important research obstacle, particularly in the category of motor rehabilitation within brain-computer interface (BCI) applications. This study focuses on classifying EEG signals into six hand movement classes (forward, backward, up, down, right, left) utilizing machine learning and deep learning methods. The goal is to detect the person's current thoughts and intentions, including motor imagery and real movements, to assist individuals with physical disabilities or limb loss in controlling their robotic arms. After data collection and preprocessing, feature extraction is performed on the EEG signals obtained from the five signal bands (alpha, beta, theta, delta, gamma). Deep learning techniques include the use of recurrent neural networks with long short-term memory (RNN-LSTM) and convolutional neural networks (CNN), in addition to more traditional classifiers like Support Vector Machines (SVM) and Linear Discriminant Analysis (LDA), an overall best accuracy 70% is achieved in detecting the 6 hand movements classes from one subject. DWT with Logistic Regression, also CSP using SVM (one vs rest) achieved the same accuracy. EEG-Net also got 70% accuracy on the 6 classes. 93% accuracy is achieved for binary classification (2 classes) with CSP as a feature and Random Forest classifier also DWT using LSTM achieved the same accuracy using a 60-channel EEG system, the results that overcome the results from literature review on the same dataset. Cross subjects' technique is experimented also in this study. Using cross subjects' data from 4 classes, CSP using LSTM shows high accuracy of 61%. The use of a 60-channel EEG system and the adoption of deep learning techniques resulted in the best accuracy for hand movement recognition in this study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiple structural RNA alignment with Lagrangian relaxation

引用

5th International Workshop on Algorithms in Bioinformatics, WABI 2005

作者： Bauer, Markus Klau, Gunnar W. Reinert, Knut Institute of Computer Science Free University of Berlin Germany International Max Planck Research School for Computational Biology and Scientific Computing Germany Institute of Mathematics Free University of Berlin Germany

ISBN: (纸本)3540290087

Many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence, it is clear that any method that relates RNA sequences in form of (multiple) alignments should take structural features into account. Since multiple: alignments are of great importance for subsequent data analysis, research in improving the speed and accuracy of such alignments benefits many other analysis problems. We present a formulation for computing provably optimal, structure-based, multiple RNA alignments and give an algorithm that finds such an optimal (or near-optimal) solution. To solve the resulting computational problem we propose an algorithm based on Lagrangian relaxation which already proved successful in the two-sequence case. We compare our implementation, mLARA, to three programs (clustalW, MARNA, and pmmulti) and demonstrate that we can often compute multiple alignments with consensus structures that have a significant lower minimum free energy term than computed by the other programs. Our prototypical experiments show that our new algorithm is competitive and, in contrast to other methods, is applicable to long sequences where standard dynamic programming approaches must fail. Furthermore, the Lagrangian method is capable of handling arbitrary pseudoknot structures. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Recovering logical structure from Charm++ event traces 15

Recovering logical structure from Charm++ event traces

引用

International Conference for High Performance computing, Networking, Storage and Analysis, SC 2015

作者： Isaacs, Katherine E. Bhatele, Abhinav Lifflander, Jonathan Böhme, David Gamblin, Todd Schulz, Martin Hamann, Bernd Bremer, Peer-Timo Department of Computer Science University of California DavisCA United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States Department of Computer Science University of Illinois at Urbana-Champaign UrbanaIL United States

ISBN: (纸本)9781450337236

Asynchrony and non-determinism in Charm++ programs present a significant challenge in analyzing their event traces. We present a new framework to organize event traces of parallel programs written in Charm++. Our reorganization allows one to more easily explore and analyze such traces by providing context through logical structure. We describe several heuristics to compensate for missing dependencies between events that currently cannot be easily recorded. We introduce a new task ordering that recovers logical structure from the non-deterministic execution order. Using the logical structure, we define several metrics to help guide developers to performance problems. We demonstrate our approach through two proxy applications written in Charm++. Finally, we discuss the applicability of this framework to other task-based runtimes and provide guidelines for tracing to support this form of analysis. © 2015 ACM.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Local search yields a PTAS for fixed-dimensional k-means problem with penalties

引用

Journal of the Operations Research Society of China 2024年第2期12卷 351-362页

作者： Fan Yuan Da-Chuan Xu Dong-Lei Du Dong-Mei Zhang Beijing Institute for Scientific and Engineering Computing Beijing University of TechnologyBeijing 100124China Faculty of Management University of New BrunswickFrederictonNB E3B 9Y2Canada School of Computer Science and Technology Shandong Jianzhu UniversityJinan 250101ShandongChina

We study a problem called the k-means problem with penalties(k-MPWP),which is a natural generalization of the typical k-means *** this problem,we have a set D of client points in R^(d),a set F of possible centers in R^(d),and a penalty cost Pj>O for each point j∈*** are also given an integer k which is the size of the center point *** want to find a center point set S■F with size k,choose a penalized subset of clients P■D,and assign every client in D\P to its open *** goal is to minimize the sum of the squared distances between every point in D\P to its assigned centre point and the sum of the penalty costs for all clients in *** using the multi-swap local search technique and under the fixed-dimensional Euclidean space setting,we present a polynomial-time approximation scheme(PTAS)for the k-MPWP.

关键词： Approximation algorithm k-means Local search Penalty

来源：评论

学校读者我要写书评

暂无评论

Implementation and Evaluation of a Scalable Application-Level Checkpoint-Recovery Scheme for MPI Programs 04

Implementation and Evaluation of a Scalable Application-Leve...

引用

2004 ACM/IEEE Conference on Supercomputing, SC 2004

作者： Schulz, Martin Bronevetsky, Greg Fernandes, Rohit Marques, Daniel Pingali, Keshav Stodghill, Paul Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94551 United States Department of Computer Science Cornell University IthacaNY14853 United States

ISBN: (纸本)0769521533

The running times of many computational science applications are much longer than the mean-time-to-failure of current high-performance computing platforms. To run to completion, such applications must tolerate hardware failures. Checkpoint-and-restart (CPR) is the most commonly used scheme for accomplishing this - the state of the computation is saved periodically on stable storage, and when a hardware failure is detected, the computation is restarted from the most recently saved state. Most automatic CPR schemes in the literature can be classified as system-level checkpointing schemes because they take core-dump style snapshots of the computational state when all the processes are blocked at global barriers in the program. Unfortunately, a system that implements this style of checkpointing is tied to a particular platform;in addition, it cannot be used if there are no global barriers in the program. We are exploring an alternative called application-level, non-blocking checkpointing. In our approach, programs are transformed by a pre-processor so that they become self-checkpointing and self-restartable on any platform;there is also no assumption about the existence of global barriers in the code. In this paper, we describe our implementation of application-level, non-blocking checkpointing. We present experimental results on both a Windows cluster and a Compaq Alpha cluster, which show that the overheads introduced by our approach are small. © 2004 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

GMH: A message passing toolkit for GPU clusters

GMH: A message passing toolkit for GPU clusters

引用

16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010

作者： Chen, Jie Watson III, William Mao, Weizhen Scientific Computing Group Jefferson Lab. Newport News VA 23606 United States Department of Computer Science College of William and Mary Williamsburg VA 23187 United States

ISBN: (纸本)9780769543079

Driven by the market demand for high-definition 3D graphics, commodity graphics processing units (GPUs) have evolved into highly parallel, multi-threaded, many-core processors, which are ideal for data parallel computing. Many applications have been ported to run on a single GPU with tremendous speedups using general C-style programming languages such as CUDA. However, large applications require multiple GPUs and demand explicit message passing. This paper presents a message passing toolkit, called GMH (GPU Message Handler), on NVIDIA GPUs. This toolkit utilizes a data-parallel thread group as a way to map multiple GPUs on a single host to an MPI rank, and introduces a notion of virtual GPUs as a way to bind a thread to a GPU automatically. This toolkit provides high performance MPI style point-to-point and collective communication, but more importantly, facilitates event-driven APIs to allow an application to be managed and executed by the toolkit at runtime. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Hue-balls and lit-tensors for direct volume rendering of diffusion tensor fields

Hue-balls and lit-tensors for direct volume rendering of dif...

引用

IEEE Conference on Visualization

作者： G. Kindlmann D. Weinstein Scientific Computing and Imaging Department of Computer Science University of Utah USA

ISBN: (纸本)078035897X

With the development of magnetic resonance imaging techniques for acquiring diffusion tensor data from biological tissue, visualization of tensor data has become a new research focus. The diffusion tensor describes the directional dependence of water molecules' diffusion and can be represented by a three-by-three symmetric matrix. Visualization of second-order tensor fields is difficult because the data values have many degrees of freedom. Existing visualization techniques are best at portraying the tensor's properties over a two-dimensional field, or over a small subset of locations within a three-dimensional field. A means of visualizing the global structure in measured diffusion tensor data is needed. We propose the use of direct volume rendering, with novel approaches for the tensors' coloring, lighting, and opacity assignment. Hue-balls use a two-dimensional colormap on the unit sphere to illustrate the tensor's action as a linear operator. Lit-tensors provide a lighting model for tensors which includes as special cases both lit-lines (from streamline vector visualization) and standard Phong surface lighting. Together with an opacity assignment based on a novel two-dimensional barycentric space of anisotropy, these methods are shown to produce informative renderings of measured diffusion tensor data from the human brain.

关键词： Tensile stress Data visualization Magnetic resonance imaging Biological tissues Focusing Symmetric matrices Magnetic field measurement Vectors Extraterrestrial measurements Anisotropic magnetoresistance

来源：评论

学校读者我要写书评

暂无评论

An IIM for Solving Two-fluid Interfacial Flows

An IIM for Solving Two-fluid Interfacial Flows

引用

第一届重庆计算数学与应用数学研讨会(The 1st Chongqing Workshop on Computational and Applied Mathematics)(CQWCAM)

作者： Zhijun Tan Department of Scientific Computing and Computer Science Sun Yat-sen University

来源：评论

学校读者我要写书评

暂无评论

End-to-end performance modeling of distributed GPU applications 34

End-to-end performance modeling of distributed GPU applicati...

引用

34th ACM International Conference on Supercomputing, ICS 2020

作者： Choi, Jaemin Richards, David F. Kale, Laxmikant V. Bhatele, Abhinav Department of Computer Science University of Illinois at Urbana-Champaign UrbanaIL United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States

ISBN: (纸本)9781450379830

With the growing number of GPU-based supercomputing platforms and GPU-enabled applications, the ability to accurately model the performance of such applications is becoming increasingly important. Most current performance models for GPU-enabled applications are limited to single node performance. In this work, we propose a methodology for end-to-end performance modeling of distributed GPU applications. Our work strives to create performance models that are both accurate and easily applicable to any distributed GPU application. We combine trace-driven simulation of MPI communication using the TraceR-CODES framework with a profiling-based roofline model for GPU kernels. We make substantial modifications to these models to capture the complex effects of both on-node and off-node networks in today's multi-GPU supercomputers. We validate our model against empirical data from GPU platforms and also vary tunable parameters of our model to observe how they might affect application performance. © 2020 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Necessary Maximum Principle of Stochastic Optimal Control with Delay and Jump Diffusion

引用

Communications in Mathematical Research 2014年第3期30卷 245-256页

作者： XING LEI ZHAO PENG-FEI Li Yong College of Basic Sciences Changchun University of Technology Institute of Mathematics Jilin University College of Geoexploration Science and Technology Jilin University Post-doctoral Flow Station of Computer Science and Technology College of Computer Science and TechnologyJilin University Department of Scientific Computing Florida State University

In this paper, we have studied the necessary maximum principle of stochastic optimal control problem with delay and jump diffusion.

关键词： stochastic differential equation jump diffusion delay necessary maximum principle

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：