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

International Symposium on parallel and Distributed processing (IPDPS)

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Laboratory Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA Mobile Computing and Parallel Processing Lab Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

Summary form only given. Mobile ad hoc networks (MANET) and the Internet exhibit differences in their network architecture. These differences concern the various sorts of assumptions imposed not only on the structure and topology of the underlying networks, but also on communication patterns of mobile nodes in both networks. Integrating MANET and the Internet into a hybrid network is a challenging problem due to these differences. We propose a three-layer approach that uses both mobile IP and dynamic destination-sequenced distance vector (DSDV) to integrate these two types of networks into a hybrid environment, in order to provide MANET nodes with Internet connectivity and access to the Internet resources. Our approach is based on the use of mobile gateways as an interface between MANET and the Internet. These mobile gateways can use mobile IP when they communicate with the Internet and DSDV when they interact with MANET. We also show the results of several simulation experiments that were conducted to study the integrated environment.

关键词： Mobile ad hoc networks IP networks Internet Mobile computing computer networks Mobile communication Routing protocols Concurrent computing parallel processing computer science

来源：评论

学校读者我要写书评

暂无评论

A multicast protocol for mobile ad hoc networks using location information

A multicast protocol for mobile ad hoc networks using locati...

引用

Workshop on Applications and Services in Wireless Networks, ASWN

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Laboratory Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

Multicasting is a one-to-many process by wbich a node can send the same packet to a subset of nodes, called multicast group, which have already registered to the same multicast group address. The goal of this paper is to propose a multicast algorithm for mobile ad hoc networks using location information, where a multicast group is definro with respect to a specific network space area, called millticost domain. A mohile ad hoc network (MANET) is a set of nodes that agrero upon fonning a spontaneous, temporar y network so that they can communicate over wireless Iinks despite the lack of any centraIized administration and any fonn or infrastructure. The proposed algorithm benefits from the location-oriented service offered by a glohal positioning system (GPS), which provides MANET nodes (or nodes for short) with their location information when needed. Moreover, the protocol makes use of the Vorono; diagram properties in order to multicast a packet in a selective manner towards its target multicast dOmain, where ouly a small subset of nodes is involved in the forwarding process. These nodes, called authorized forwarders, are identified from the *** Voronoi graph that a multicast source node or an authorized forwarder constructs based on the location infonnation of its neighborhood as well as the target multicast domain. The analysis bas shown that fhe protocol helps minimize the transmission overhead, which would be caused during the forwarding of a multicast packet, while guaranteeing convergence and correctness. Compared to other existing location-based multicast protocols, the proposed one yields more reduction of transmission overhead and perfonns correctly even with particular MANET topologies. Keywords - Multicasting, mobile ad hoc networks, locationbased service, Voronoi diagmms, global positioning system.

关键词： Multicast protocols Mobile ad hoc networks Routing protocols Multicast algorithms Network topology Mobile computing computer networks Concurrent computing parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

An adaptive predictive control strategy for RMPPT under partially shaded conditions 19

An adaptive predictive control strategy for RMPPT under part...

引用

19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014

作者： Ma, Chao Wu, Jing Li, Ning Li, Shaoyuan Li, Kang Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China School of Electronics Electrical Engineering and Computer Science Queen's University Belfast United Kingdom

ISBN: (纸本)9783902823625

As one of key technologies in photovoltaic converter control, Maximum Power Point Tracking (MPPT) methods can keep the power conversion efficiency as high as nearly 99% under the uniform solar irradiance condition. However, these methods may fail when shading conditions occur and the power loss can over as much as 70% due to the multiple maxima in I-P curve in shading conditions v.s. single maximum point in uniformly solar irradiance. In this paper, a Real Maximum Power Point Tracking (RMPPT) strategy under Partially Shaded Conditions (PSCs) is introduced to deal with this kind of problems. An optimization problem, based on a predictive model which will change adaptively with environment, is developed to tracking the global maxima and corresponding adaptive control strategy is presented. No additional circuits are required to obtain the environment uncertainties. Finally, simulations show the effectiveness of proposed method. © IFAC.

关键词： Adaptive control systems

来源：评论

学校读者我要写书评

暂无评论

Mitigate the obstructing effect of vehicles on the propagation of VANETs safety-related information

Mitigate the obstructing effect of vehicles on the propagati...

引用

作者： Huang, Rui Wu, Jing Long, Chengnian Zhu, Yanmin Li, Bo Lin, Yi-Bing Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Department of Computer Science School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Computer Science and Information Engineering National Chiao Tung University Taiwan

As physical obstacles, vehicles have significant impacts on the efficient propagations of safety-related information in vehicular ad hoc networks (VANETs) by frequently obstructing the LOS links between transmitters and receivers. Obstructing effect will diminish the effective coverage of safety-related information and incur severe impact on road safety. However, this impact has not been addressed effectively. In this paper, we first present the definition of broadcast efficiency as the metric for quantizing the obstructing effect. We investigate the optimization issue for mitigating the impact of obstructing effect on the propagation of safety-related information and propose a graph theory-based optimization algorithm. For a distributed implementation of this optimization in VANETs, we further propose the maximum broadcast efficiency relaying (MBER) algorithm. MBER maximizes the effective coverage of information, meanwhile, meets delay and reliability constraints by incorporating broadcast efficiency and propagation distance in relay contention. Simulation results demonstrate that MBER promotes the effective coverage of safety-related information in VANETs with varying vehicular distribution. © 1967-2012 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A continuous stream service and high service availability mechanism for continuous media servers

A continuous stream service and high service availability me...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Sung-In Jung Cheol-Hoon Lee Computer System Division Electronics and Telecommunications Research Institute Daejeon South Korea Parallel Processing Laboratory Department of Computer Engineering Chungnam National University Daejeon South Korea

ISBN: (纸本)8955191197

Due to the explosive growth of the Internet, stream services are becoming more popular. The large media servers supporting thousands of concurrent media streams have to satisfy us with both good throughout and high availability. Although they are reciprocal from the viewpoint of system performance, the stream service continuity, as well as throughput, should be considered in clustered media servers. This is because media stream services should be continuously available to the clients even on the event of system failure. In this paper, we introduce service availability as the gauge of service degree on media servers, and present the basic scheme for guaranteeing continuous stream service. To do this, we propose LSS(Log Stream Status) and RRD(Ready Resource for instant Delivery) mechanisms. They are classified according to the status management method of stream service and the resumption method of closed service. Although these mechanisms require additional overhead, we found that they can be applied to clustered media servers with minimum overhead. Additionally, we concluded that they can provide higher quality of service availability on traditional clustered media servers.

关键词： Availability Streaming media Web server Concurrent computing Telecommunication computing Quality of service Network servers Monitoring parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

A selective temporal and aggressive spatial cache system based on time interval

A selective temporal and aggressive spatial cache system bas...

引用

IEEE International Conference on computer Design: VLSI in computers and Processors, (ICCD)

作者： Jung Hoon Lee Jang-Soo Lee Shin-Dug Kim Dept. of Comput. Sci. Yonsei Univ. Seoul South Korea Department of Computer Science Parallel Processing System Laboratory Yonsei University Seoul South Korea

This paper proposes a new cache system that can increase the effect by temporal and spatial locality by using only simple hardware control without any locality detection hardware or compiler aid. The proposed cache system consists of two caches with different associativities and different block sizes, i.e., a direct-mapped cache with small block size and a fully associative spatial buffer with large block size as a multiple of small blocks. Therefore, the spatial locality can be exploited by aggressively fetching large blocks including any missed small block into the buffer, and the temporal locality can also be exploited by selectively storing small blocks that were referenced at the spatial buffer in the past. To determine the blocks to be stored at the direct-mapped cache, the proposed cache system uses a time interval-based selection mechanism. According to the simulation results, similar performance can be achieved by using four times smaller cache size compared with the conventional direct-mapped cache.

关键词： Buffer storage Hardware parallel processing Laboratories computer science Control systems Computational modeling Cache memory Delay Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional euler PCA for face recognition 21

Two-dimensional euler PCA for face recognition

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Tan, Huibin Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation and Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Principal component analysis (PCA) projects data on the directions with maximal variances. Since PCA is quite effective in dimension reduction, it has been widely used in computer vision. However, conventional PCA suffers from following deficiencies: 1) it spends much computational costs to handle high-dimensional data, and 2) it cannot reveal the nonlinear relationship among different features of data. To overcome these deficiencies, this paper proposes an efficient two-dimensional Euler PCA (2D-ePCA) algorithm. Particularly, 2D-ePCA learns projection matrix on the 2D pixel matrix of each image without reshaping it into 1D long vector, and uncovers nonlinear relationships among features by mapping data onto complex representation. Since such 2D complex representation induces much smaller kernel matrix and principal subspaces, 2D-ePCA costs much less computational overheads than Euler PCA on large-scale dataset. Experimental results on popular face datasets show that 2D-ePCA outperforms the representative algorithms in terms of accuracy, computational overhead, and robustness. © Springer International Publishing Switzerland 2015.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Method Combining Blockchain and Multi-Agent system to Ensure Data Integrity and Deduplication in the Cloud Environment

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2024年第10期18卷 90-105页

作者： El Ghazouani, Mohamed Ikidid, Abdelouafi Zaouiat, Charafeddine Ait Aziz, Layla Ichahane, Moulay Youssef Er-Rajy, Latifa ESIM Polydisciplinary Faculty of Sidi Bennour Chouaîb Doukkali University El Jadida Morocco Laboratory of System Analysis Information Processing and Industrial Management EST Salé Mohammed V University Salé Morocco Information Technology Laboratory National School of Applied Sciences Chouaîb Doukkali University El Jadida Morocco Computer Science Department Laboratory of Information Systems Engineering Cadi Ayyad University Marrakesh Morocco

Cloud computing (CC) refers to the transmission, storage, and processing of any type of information at a location that is not owned or controlled by the information owner. This information can be stored and accessed anytime, from anywhere, and using any device. However, several challenges threaten the deployment of cloud computing technology within organizations, including user privacy, data integrity, and managing the retention of the vast amount of data that will be stored and analyzed in this environment. In recent years, various data integrity checking systems and data storage mechanisms have been proposed to address these diverse challenges. Nevertheless, some protocols do not guarantee data confidentiality against auditors during the auditing process, while others do not provide batch auditing. Additionally, the majority of these protocols do not support the deduplication technique. Therefore, in this research work, the security features of blockchain technology and those of multi-agent systems (MAS) have prompted us to propose models that enable both data deduplication, saving storage space, and data integrity auditing, efficiently verifying the accuracy of data outsourced to CC environments. Implementation findings indicate that the suggested system is highly feasible and applicable in real-world scenarios. © 2024 by the authors of this article.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Non-negative low-rank and group-sparse matrix factorization 21

Non-negative low-rank and group-sparse matrix factorization

引用

21st International Conference on MultiMedia Modeling, MMM 2015

作者： Wu, Shuyi Zhang, Xiang Guan, Naiyang Tao, Dacheng Huang, Xuhui Luo, Zhigang Science and Technology on Parallel Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan410073 China Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia

ISBN: (纸本)9783319144412

Non-negative matrix factorization (NMF) has been a popular data analysis tool and has been widely applied in computer vision. However, conventional NMF methods cannot adaptively learn grouping structure froma *** paper proposes a non-negative low-rank and group-sparse matrix factorization (NLRGS) method to overcome this deficiency. Particularly, NLRGS captures the relationships among examples by constraining rank of the coefficients meanwhile identifies the grouping structure via group sparsity regularization. By both constraints, NLRGS boosts NMF in both classification and clustering. However, NLRGS is difficult to be optimized because it needs to deal with the low-rank constraint. To relax such hard constraint, we approximate the low-rank constraint with the nuclear norm and then develop an optimization algorithm for NLRGS in the frame of augmented Lagrangian method(ALM). Experimental results of both face recognition and clustering on four popular face datasets demonstrate the effectiveness of NLRGS in quantities. © Springer International Publishing Switzerland 2015.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： laser fusion neutron sources particle beam focusing ELECTROSTATIC CONFINEMENT FUSION DEVICE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：