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

1st International conference of Advanced computing and Informatics, ICACIN 2020

ISBN: (纸本)9789811560477

The proceedings contain 56 papers. The special focus in this conference is on Advanced computing and Informatics. The topics include: Evaluation of Several Artificial Intelligence and Machine Learning Algorithms for Image Classification on Small Datasets;A Comprehensive Study of Dissemination and Data Retrieval in Secure VANET-Cloud Environment;toward to Autonomous Broker for Virtual Network Provisioning and Monitoring;comparative Study on Random Traveling Wave Pulse-Coupled Oscillator Algorithm of Energy-Efficient Wireless Sensor Networks;impact of Inspirational Motivation on Organizational Innovation (Administrative Innovation, Process Innovation, and Product Innovation);managing the Smart Grid in Free Market;an Haptic Display for Visually Impaired Pedestrian Navigation;GPU parallelization for Accelerating 3D Primitive Equations of Ocean Modeling;yemeni Paper Currency Recognition System Using Deep Learning Approach;tuning Hyper-Parameters of Machine Learning Methods for Improving the Detection of Hate Speech;performance Comparison of Machine Learning Techniques in Identifying Dementia from Open Access Clinical Datasets;Clustering Analysis to Improve Web Search Ranking Using PCA and RMSE;preface;optimization of a Similarity Performance on Bounded Content of Motion Histogram by Using distributed Model;A parallel Global TFIDF Feature Selection Using Hadoop for Big Data Text Classification;robust and Accurate Method for Textual Information Extraction Over Video Frames;a Deep Learning Architecture for Profile Enrichment and Content Recommendation;Predictive Data Analysis Model for Employee Satisfaction Using ML Algorithms;a Novel Approach for Big Data Monetization as a Service;ensemble Feature Selection Method Based on Bio-inspired Algorithms for Multi-objective Classification Problem;automated Binary Classification of Diabetic Retinopathy by Convolutional Neural Networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel processing method for receding horizon tracking control

A parallel processing method for receding horizon tracking c...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Zhengjiu Kang Hyeong Jun Lim Wook Hyun Kwon Control Information Systems LaboratorySchool of Electrical Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0818682272

A recursive square root algorithm for Receding Horizon Tracking Control (RHTC) based on state-space model which the original sequential algorithm exhibits O(Nn/sup 2/) complexity is derived and its systolic implementation method is also shown. The parallel processing algorithm needs O(Nn) computations for an n-th order plant and N-step prediction horizon on O(n/sup 2/+nN) processor array.

关键词： Signal processing algorithms parallel processing Control systems Design methodology MIMO Application software Very large scale integration Systolic arrays Concurrent computing Predictive control

来源：评论

学校读者我要写书评

暂无评论

A scalable distributed heterogeneous associative logic programming system

A scalable distributed heterogeneous associative logic progr...

引用

International conference on Tools for Artificial Intelligence (ICTAI)

作者： S.W. Ryan A.K. Bansal Depwimenit of Mathematics and Computer Science Kent University Kent OH USA

This paper describes a distributed implementation of a scalable heterogeneous associative logic programming model, and describes an abstract instruction set for the distributed version of the model. Associative computation exploits data parallel computation. The implementation uses PVM for architecture independence, and uses object oriented programming for modularity and portability. Performance results on a cluster of IBM RS 6000 are presented.

关键词： Logic programming distributed computing Object oriented modeling Concurrent computing High performance computing Computer architecture Filters Mathematical model Object oriented programming parallel processing

来源：评论

学校读者我要写书评

暂无评论

Task scheduling in distributed computing systems with a genetic algorithm

Proceedings of the Conference on High Performance Computing ...

引用

proceedings of the conference on High Performance computing on the Information Superhighway, HPC Asia'97 1997年 301-305页

作者： Woo, Sung-Ho Yang, Sung-Bong Kim, Shin-Dug Han, Tack-Don Yonsei Univ Seoul Korea Republic of

Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Towards a Conceptual Model for Context-Aware Adaptive Services

Towards a Conceptual Model for Context-Aware Adaptive Servic...

引用

The Fourth International conference on parallel and distributed computing, Applications and Technologies

作者： Jun-Zhao Sun Jaakko Sauvola MediaTeam Machine Vision and Media Processing UnitInfotech Oulu P.O.Box 45004SOINFOFIN-90014 University of OuluFinland

Recent advances in both portable devices and wireless networks make mobile computing a reality. Embedded and invisible computing resources are paving the way to a new paradigm known as pervasive computing. More attention needs to be paid to the development of intelligent services in such a highly dynamic environment. This paper aims to present a conceptual model for context awareness based service adaptation *** describe context in context space and represent it with *** then discuss context awareness in terms of both context organization and ***,we introduce the notion of adaptation and present the framework for context-aware adaptive services.

关键词： mobility pervasive computing context context awareness adaptation adaptive service

来源：评论

学校读者我要写书评

暂无评论

CrownFS: a clustered continuous media server

CrownFS: a clustered continuous media server

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Young-Sung Son Yu-Seok Bae Oh-Young Kwon Tae-Geun Kim Chang-Soon Park Network Computing Department Systems Engineering Research Institute Taejon South Korea

ISBN: (纸本)0818682272

CrownFS is a file system for continuous media server in the CROWN (Clustering Resources On Workstations' Network) system. Because of the high I/O bandwidth rate and strict real-time constraints, the design issues of CrownFS are that of efficiently balancing user load against limited disk: bandwidth, network and I/O channel bandwidth. CrownFS accomplishes this balancing by striping continuous data file across several workstations and computing at each workstation in the CROWN system. This paper describes the CROWN system architecture and the CrownFS design. CrownFS runs on a cluster of workstations consisted of Kawaiis, AlphaStations and PCs.

关键词： Network servers Workstations Bandwidth Personal communication networks Costs Streaming media File systems Systems engineering and theory File servers Hardware

来源：评论

学校读者我要写书评

暂无评论

A new interconnection network for parallel computer with low diameter

A new interconnection network for parallel computer with low...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Nak-Keun Joo Hyeong-Seok Lim Department of Computer Science Dong-shin University Choongnam South Korea Department of Computer Science Chonnam National University Kwangju South Korea

ISBN: (纸本)0818682272

In this paper, we propose and analyze the new interconnection network for parallel computer, called graycube. The graycube has the same number of nodes and edges as hypercube, but it's diameter is about one half of the equivalent hypercube. It has simple recursive structure, routing and broadcasting algorithms. Since hypercube can be embedded into graycube with dialation 2, algorithms developed based on hypercube are easily simulated in graycube. The basic properties, routing and broadcasting algorithms, and hypercube embedding are presented.

关键词： Multiprocessor interconnection networks Computer networks Concurrent computing Hypercubes Reflective binary codes Network topology Routing Broadcasting Computer science Joining processes

来源：评论

学校读者我要写书评

暂无评论

A GPGPU algorithm for c-Approximate r-nearest neighbor search in high dimensions

A GPGPU algorithm for c-Approximate r-nearest neighbor searc...

引用

2013 IEEE 37th Annual Computer Software and Applications conference, COMPSAC 2013

作者： Carraher, Lee A. Wilsey, Philip A. Annexstein, Fred S. School of Electronic Computing Systems University of Cincinnati Cincinnati United States

ISBN: (纸本)9780769549798

Nearest Neighbor search is one of the simplest and most intuitive ideas in data mining. Due to it's simplicity and diverse utility, Nearest Neighbor search is often found to be the workhorse of a variety of data mining, machine learning, and computer vision algorithms. For very high dimensional data, the naive linear search tends to be optimal. This is due to the so called curse of dimensionality in database search. To accelerate the search time, may researchers have turned to the power and efficiency of GPGPU computing;mainly for computing the data intensive distance metrics. Though promising speedups are achieved through this method, it fails to capitalize on many of the recent advances in algorithms for bounded error approximate nearest neighbor searches. Approximate nearest neighbor methods give satisfactory results, especially in very large and possibly redundant datasets, while boasting sub-linear search complexities. In this paper we present a c-Approximate r-nearest neighbor search algorithm for CUDA using Locality Sensitive Hash with Nearest Neighbor search (LSH-NN). We implement this system in CUDA and test it on real world image SIFT vector data. Our tests show that we are able to achieve significant speedup over the serial version, with good approximations on scalability, while achieving the near-optimal search complexity of LSH-NN. © 2013 IEEE.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Integrating heterogeneous databases: a distributed model

Integrating heterogeneous databases: a distributed model

引用

IEEE International conference on Algorithms and Architectures for parallel Processing (ICAP)

作者： P.A. Hepner W. Zhou School of Computing and Mathematics Deakin University Geelong VIC Australia

We put forward a distributed model for accessing heterogeneous database systems. Database operations requested by the user are processed in a distributed manner that takes advantage of the inherent parallelism of distributed systems, minimises network traffic and uses almost any general purpose computer on the network. Processing is not confined to DBMS sites but is provided as a distributed service. The design is modular and provides the mechanisms that may be arranged in a variety of ways providing a range of integration paradigms from loosely coupled integrations to more tightly coupled integrations.

关键词： distributed databases Relational databases Database systems distributed computing Tree graphs Mathematical model Computer networks Protocols Mathematics Australia

来源：评论

学校读者我要写书评

暂无评论

GPR-Tree: a global parallel index structure for multiattribute declustering on cluster of workstations

GPR-Tree: a global parallel index structure for multiattribu...

引用

proceedings of the advances in parallel and distributed computing

作者： Xiaodong Fu Dingxing Wang Weimin Zheng Meiming Sheng Comuputer Science Department Tsinghua University Beijing China

ISBN: (纸本)0818678763

R-tree is a very popular dynamic access structure cable of storing multidimensional and spatial data. Considering it's merit of the efficient global balance and dynamic reorganization, we try to use R-tree to decluster the multiattribute data in database system or file system. As many previous multiattribute declustering mechanisms do not take into account the properties of the Cluster of Workstations (COW), we present the Global parallel R-tree (GPR-Tree) under the architecture of COW. Firstly we inspect the issues in efficiency of R-tree and it's variants, we try to enhance the R-Tree efficiency by using heuristics information in the reconstruction of R-Tree during the node splitting and the treatment of the orphan entries of the underfilled node. Then we parallelize the improved R-Tree among the components in the system. The basic thought is to alleviate the bottleneck effect of the I/O subsystem, making use of the high speed network communication and the memory. The GPR-Tree is shared among the processing units (PU) of the system. We use a mixed LRU algorithm to schedule pages in memory to maintain the nodes visited frequently in memory. A write-update-like protocol is used to keep the coherency among multiple copies maintained in the system. This mechanism is proved efficient to improve the salability and performance of the system.

关键词： Database systems Workstations Costs Communication cables Multidimensional systems High-speed networks Clustering algorithms Scheduling algorithm Protocols Availability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：