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

Random ensemble learning for EEG classification

ARTIFICIAL INTELLIGENCE IN MEDICINE 2018年 84卷 146-158页

作者： Hosseini, Mohammad-Parsa Pompili, Dario Elisevich, Kost Soltanian-Zadeh, Hamid Rutgers State Univ Dept Elect & Comp Engn Piscataway NJ 08854 USA Michigan State Univ Coll Human Med Div Neurosurg Grand Rapids MI 49503 USA Spectrum Hlth Dept Clin Neurosci Grand Rapids MI 49503 USA Univ Tehran Sch Elect & Comp Engn CIPCE Tehran Iran Henry Ford Hlth Syst Image Anal Lab Dept Radiol Detroit MI 48202 USA Henry Ford Hlth Syst Image Anal Lab Dept Res Adm Detroit MI 48202 USA

Real-time detection of seizure activity in epilepsy patients is critical in averting seizure activity and improving patients' quality of life. Accurate evaluation, presurgical assessment, seizure prevention, and emergency alerts all depend on the rapid detection of seizure onset. A new method of feature selection and classification for rapid and precise seizure detection is discussed wherein informative components of electroencephalogram (EEG)-derived data are extracted and an automatic method is presented using infinite independent component analysis (I-ICA) to select independent features. The feature space is divided into subspaces via random selection and multichannel support vector machines (SVMs) are used to classify these subspaces. The result of each classifier is then combined by majority voting to establish the final output. In addition, a random subspace ensemble using a combination of SVM, multilayer perceptron (MLP) neural network and an extended k-nearest neighbors (k-NN), called extended nearest neighbor (ENN), is developed for the EEG and electrocorticography (ECoG) big data problem. To evaluate the solution, a benchmark ECoG of eight patients with temporal and extratemporal epilepsy was implemented in a distributed computing framework as a multitier cloud-computing architecture. Using leave-one-out cross-validation, the accuracy, sensitivity, specificity, and both false positive and false negative ratios of the proposed method were found to be 0.97, 0.98, 0.96, 0.04, and 0.02, respectively. Application of the solution to cases under investigation with ECoG has also been effected to demonstrate its utility. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Brain-computer interface distributed computing system Electroencephalogram Ensemble learning Epileptic seizure detection Computational neuroscience

来源：评论

学校读者我要写书评

暂无评论

distributed-program reliability analysis: Complexity and efficient algorithms

引用

IEEE TRANSACTIONS ON RELIABILITY 1999年第1期48卷 87-95页

作者： Lin, MS Chang, MS Chen, DJ Tamsui Oxford Univ Coll Dept Informat Management Taipei 25103 Taiwan Chunghwa Telecommun Training Inst Taipei 22077 Taiwan Natl Chiao Tung Univ Dept Comp Sci & Informat Hsinchu 30050 Taiwan

This paper investigates the problem of distributed-program reliability in various classes of distributed computing systems. This problem is computationally intractable for arbitrary distributed computing systems, even when it is restricted to the class of star distributed computing systems. One solvable case for star distributed computing systems is identified, in which data files are distributed with respective to a consecutive property;a polynomial-time algorithm is developed for this case. A linear-time algorithm is developed to test whether or not an arbitrary star distributed computing system has this consecutive file distribution property. Efficient algorithms may still be sought for computing lower & upper bounds on the distributed program reliability for arbitrary distributed computing systems.

关键词： distributed computing system distributed-program reliability computation complexity

来源：评论

学校读者我要写书评

暂无评论

A generalisation of consecutive k-out-of-n:G systems

引用

IEICE TRANSACTIONS ON INFORMATION AND systemS 2000年第6期E83D卷 1309-1313页

作者： Lin, MS Chang, MS Chen, DJ Aletheia Univ Dept Informat Management Taipei 25103 Taiwan Chunghwa Telecommun Training Inst Taipei Taiwan Natl Chiao Tung Univ Inst Comp Sci & Informat Engn Hsinchu 30050 Taiwan

A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where k(i) is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n(2)) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.

关键词： reliability consecutive-k-out-of-n : G system distributed computing system

来源：评论

学校读者我要写书评

暂无评论

Special Issue: Securing distributed Networks and systems

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2011年第12期23卷 1311-1312页

作者： Xiang, Yang Lopez, Javier Wang, Haining Zhou, Wanlei Deakin Univ Sch Informat Technol Geelong Vic 3217 Australia Univ Malaga Dept Comp Sci E-29071 Malaga Spain Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA

With decades of progress toward ubiquitous networks and systems, distributed computing systems have played an increasingly important role in the industry and society. However, not many distributed networks and systems are secure and reliable in the sense of defending against different attacks and tolerating failures automatically, thus guaranteeing properties such as performance, and offering security against intentional threats. This special issue focuses on securing distributed networks and systems. We are delighted to present to you nine technical papers dealing with cutting-edge research and technology related to this topic. These papers were selected out of 149 submissions from 30 countries in the third International Conference on Network and system Security (NSS 2009). The selection has been very rigorous and only the best papers in the conference were selected.

关键词： paper distributed computing system Technical papers Distribute Network

来源：评论

学校读者我要写书评

暂无评论

AN ARCHITECTURE FOR REAL-TIME MULTIMEDIA COMMUNICATION-systemS

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1990年第3期8卷 391-400页

作者： NICOLAOU, C Computer Laboratory University of Cambridge Cambridge UK

A multimedia communication system includes both the communication protocols used to transport the real-time data and the distributed computing system (DCS) within which any applications using the protocols must execute. The architecture presented attempts to integrate these communications protocols with the DCS in a smooth fashion in order to ease the writing of multimedia applications. Two issues are identified as being essential to the success of this integration: the synchronization of related real-time data streams, and the management of heterogeneous multimedia hardware. The synchronization problem is tackled by defining explicit synchronization properties at the presentation level and by providing control and synchronization operations within the DCS which operate in terms of these properties. The heterogeneity problems are addressed by separating the data transport semantics (protocols themselves) from the control semantics (protocol interfaces).

关键词： direct current ARCHITECTURE Communication protocols semiotics Semantics Building construction data transmission distributed computing system real-time data

来源：评论

学校读者我要写书评

暂无评论

A GA based multiple task allocation considering load

引用

INTERNATIONAL JOURNAL OF HIGH SPEED computing 2000年第4期11卷 203-214页

作者： Tripathi, AK Sarker, BK Kumar, N Vidyarthi, DP Banaras Hindu Univ Dept Comp Engn Varanasi 221005 Uttar Pradesh India Banaras Hindu Univ Fac Sci Dept Comp Sci Varanasi 221005 Uttar Pradesh India

A distributed computing system (DCS) comprising networked heterogeneous processors requires efficient tasks to processor allocation to achieve minimum turnaround time and highest possible throughput. Task allocation in DCS remains an important and relevant problem attracting the attention of researchers in the discipline. A good number of task allocation algorithms have been proposed in the literature [3-9]. This algorithm considered allocation of the modules of a single task to various processing nodes and aim to minimize the turnaround time of the given task. But they did not consider execution of modules belonging to various different tasks (i.e. multiple tasks). In this work we have considered the number of modules that can be accepted by individual processing nodes along with their memory capacities and arrival of multiple disjoint tasks to the DCS from time to time. In this paper, a method based on genetic algorithm is developed which is memory efficient and give an optimal solution of the problem. The given simulation results also show significant achievement in this regard.

关键词： distributed computing system multiple task allocation load inter module communication (IMC)

来源：评论

学校读者我要写书评

暂无评论

The Fip35 WW Domain Folds with Structural and Mechanistic Heterogeneity in Molecular Dynamics Simulations

引用

BIOPHYSICAL JOURNAL 2009年第8期96卷 L53-L55页

作者： Ensign, Daniel L. Pande, Vijay S. Stanford Univ Dept Chem Stanford CA 94305 USA

We describe molecular dynamics simulations resulting in the folding the Fip35 Hpin1 WW domain. The simulations were run on a distributed set of graphics processors, which are capable of providing up to two orders of magnitude faster computation than conventional processors. Using the Folding@home distributed computing system, we generated thousands of independent trajectories in an implicit solvent model, totaling over 2.73 ms of simulations. A small number of these trajectories folded;the folding proceeded along several distinct routes and the system folded into two distinct three-stranded beta-sheet conformations, showing that the folding mechanism of this system is distinctly heterogeneous.

关键词： Molecular Dynamics Simulation trajectory Mechanical systems distributed computing system kinetic simulation PROCESSOR Graphics Processing Unit

来源：评论

学校读者我要写书评

暂无评论

A Variation-Aware Approach for Task Allocation in Wireless distributed computing systems

A Variation-Aware Approach for Task Allocation in Wireless D...

引用

IEEE Global Communications Conference

作者： Xiaofu Ma Haris I. Volos Xiangwei Zheng Jeffrey H. Reed Tamal Bose Department of Electrical and Computer Engineering Virginia Tech Department of Electrical and Computer Engineering The University of Arizona

ISBN: (纸本)9781479913510

Wireless distributed computing (WDC) enables the radio nodes with reduced computing abilities to cooperate in processing complex computational tasks for minimizing the over-all processing latency (makespan). However, the uncertainty of the dynamic mobile wireless environment, which is not an issue for the traditional distributed computing, poses a challenge for WDC. In this paper, a variation-aware approach for WDC is proposed to determine the task allocation by considering the heterogeneous computing capability of the radio nodes as well as the impact of the radio environment. To this end, the transmission latency is characterized as a random variable that depends on the channel fading and the transport protocol. A variation-aware task graph analysis is proposed for the estimation of the makespan's distribution. The evolutionary algorithms are employed for the allocation mapping. We use simulation results to affirm makespan estimation improvement of the proposed approach compared with the traditional deterministic approach, and give insights on the dominating factors for the improvement.

关键词： task allocation WDC wireless distributed computing system deterministic approach transport protocols Radio distributed computing Random variable

来源：评论

学校读者我要写书评

暂无评论

Model Experiment for Load Balancing in a distributed Computer system

Model Experiment for Load Balancing in a Distributed Compute...

引用

International Conference on Mechanical Engineering, Automation and Control systems

作者： I.A. Botygin A.E. Nagiyev Tomsk Polytechnic University Tomsk Russia

The results of model experiments to improve load balancing in distributed computing systems are described. A control scheme of processing requests from the terminal devices, providing effective dynamic horizontal scal... 详细信息

ISBN: (纸本)9781467381154

关键词： distributed computing system load balancing multithreading thread model experiment

来源：评论

学校读者我要写书评

暂无评论

FAST BRIDGE FOR EFFICIENT LAN-LAN COUPLING

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1988年第5期135卷 273-277页

作者： SANTANA, MJ SANTANA, RHC ZALUSKA, EJ Department of Electronics and Computer Science University of Southampton Southampton UK

Describes the design of a fast bridge between two Cambridge ring local area networks. The main requirements are high speed, a flexible addressing range and high reliability. The bridge implemented is in day to day use as part of TRICE, the distributed computing system implemented at the Department of Electronics and Computer Science at Southampton University. The performance and reliability obtained in service are discussed.

关键词： Fasting Electronics computer science distributed computing system Local Area Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：