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

Multimedia systems 1995年第6期2.0卷 280-287页

作者： Little, T.D.C. Venkatesh, D. Multimedia Communications Laboratory Department of Electrical Computer and Systems Engineering Boston University Boston 02215 MA United States

A video-on-demand server must satisfy a large customer base and a diverse archive of movies under changing movie popularity and daily load peaks. These requirements must be satisfied under the constraints imposed by storage device costs, capacities, I/O bandwidths, and geographic locations. In this paper we describe a partitioning of video data (movies) onto a video-on-demand storage hierarchy to achieve efficient storage and I/O bandwidth use. Our approach uses a probabilistic model of movie popularity in data distribution and replication to balance user requests with available disk I/O bandwidth. The results can be applied in the design of a general, distributed video-on-demand system. © 1995 Springer-Verlag.

关键词： Multimedia Storage architectures Video servers Video-on-demand

来源：评论

学校读者我要写书评

暂无评论

Iterative Design of Hyperuniform Materials Using Wannier Functions 16

Iterative Design of Hyperuniform Materials Using Wannier Fun...

引用

16th Pacific Rim Conference on Lasers and Electro-Optics, CLEO-PR 2024

作者： Lee, Gitae Park, Hyungchul Park, Seungkyun Park, Namkyoo Yu, Sunkyu Seoul National University Intelligent Wave Systems Laboratory Department of Electrical and Computer Engineering Seoul08826 Korea Republic of Seoul National University Photonic Systems Laboratory Department of Electrical and Computer Engineering Seoul08826 Korea Republic of

We propose the algorithm for hyperuniform point process by using Wannier functions in photonic crystals. Our study provides the transformation of the point process from Poisson to stealthy hyperuniformity. © 2024... 详细信息

ISBN: (纸本)9798350372076

关键词： Photonic crystals

来源：评论

学校读者我要写书评

暂无评论

Multi-AUVs Cooperative Complete Coverage Path Planning Based on GBNN Algorithm 29

Multi-AUVs Cooperative Complete Coverage Path Planning Based...

引用

第29届中国控制与决策会议

作者： Daqi Zhu Chen Tian Xiaofei Jiang Chaomin Luo Laboratory of Underwater Vehicles and Intelligent Systems Shanghai Maritime University Department of Electrical and Computer Engineering University of Detroit Mercy

ISBN: (纸本)9781509046584

For the complete coverage path planning of multi-AUVs(autonomous underwater vehicles),a method of cooperative complete coverage path planning for multi-AUVs based on GBNN algorithm is proposed in this paper,where all AUVs share the common working environment information,and each AUV treats other AUVs as moving ***,a grid map is constructed by discretizing the underwater ***,the corresponding dynamic neural networks are built on the grid map,and there are N neural networks for N AUVs,***,each AUV plans its reasonable coverage path according to its own neural activity through GBNN strategy,until work together to cover the entire *** simulation results show that multi-AUVs can not only cooperatively accomplish the common coverage tasks without any mutual collision and overlapped coverage,but also automatically avoid obstacles and escape from deadlocks,and effectively improve work efficiency of each single AUV,reduce complete coverage time and save AUVs' power.

关键词： Multi-AUVs Complete coverage path planning GBNN algorithm Neural network

来源：评论

学校读者我要写书评

暂无评论

A decentralized computational infrastructure for grid-based parallel asynchronous iterative applications

引用

Journal of Grid Computing 2006年第4期4卷 355-372页

作者： Li, Zhen Parashar, Manish The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University Piscataway NJ 08854 United States

parallel asynchronous iterative algorithms relax synchronization and communication requirements, and can potentially extend Desktop Grids beyond embarrassingly parallel applications to support a broader class of parallel iterative applications. This paper presents the design and implementation of CometG, a decentralized (peer-to-peer) computational infrastructure that extends Desktop Grid environments to support these applications. CometG provides a decentralized and scalable tuple space, efficient communication and coordination support, and application-level abstractions that can be used to implement Desktop Grid applications based on parallel asynchronous iterative algorithms using the master-worker/BOT paradigm. The deployment and evaluations of CometG and a CometG-based application in a wide-area environment using the PlanetLab [7] test bed, as well as a campus network are presented. © Springer Science + Business Media, Inc. 2006.

关键词： Decentralized (peer-to-peer) tuple space Desktop Grids parallel asynchronous iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Feature-Based Plant Recognition

IEEE Transactions on AgriFood Electronics

引用

IEEE Transactions on AgriFood Electronics 2024年第2期2卷 335-346页

作者： Shirzi, Moteaal Asadi Kermani, Mehrdad R. Western University Advanced Robotics and Mechatronic Systems Laboratory Electrical and Computer Engineering Department LondonONN6A 5B9 Canada Western University Advanced Robotics and Mechatronic Systems Laboratory The Department of Electrical and Computer Engineering LondonONN6A 5B9 Canada

In this article, we propose a new algorithm to improve plant recognition through the use of feature descriptors. The accurate results from this identification method are essential for enabling autonomous tasks, such as stem-stake coupling, in precision agriculture. The proposed method divides the input seedling color image into subimages within the International Commission on Illumination, for three color axes, L for lightness, A for the green-red component, and B for the blue-yellow component, color space and extracts seven key feature descriptors for each subimage. It then uses feature descriptors to create a matrix, which is employed to train an artificial neural network to determine optimized cutoff values. This network suggests cutoff values for a multilevel threshold segmentation for plant recognition. The method provides robust and real-time adaptive segmentation adaptable to various seedlings, backgrounds, and lighting conditions. By enabling accurate segmentation of the plant, morphological image processing can more effectively eliminate leaves to locate the seedling stem. This methodology automates image analysis in seedling propagation facilities and greenhouses and enables a wide range of precision agricultural tasks. © 2023 IEEE.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

Design of reliable storage and compute systems with lightweight group testing based non-binary error correction codes

Design of reliable storage and compute systems with lightwei...

引用

作者： Bu, Lake Karpovsky, Mark G. Kinsy, Michel A. Adaptive and Secure Computing Systems Laboratory Department of Electrical and Computer Engineering Boston University Boston United States Reliable Computing Laboratory Department of Electrical and Computer Engineering Boston University Boston United States

In this study, the authors propose a new group testing based (GTB) error control codes (ECCs) approach for improving the reliability of memory structures in computing systems. Compared with conventional single- A nd double-bit error correcting codes, the GTB codes provide higher reliability at the multi-byte error correction granularity. The proposed codes are cost-efficient in their encoding and decoding procedures. Instead of requiring multiplication or inversion over Galois finite field like most multi-byte ECC schemes, the proposed technique only involves bitwise XOR operations, therefore, significantly reducing the computation complexity and latency. For instance, to correct m errors in a Q-ary codeword of length N, where $Q \ge 2$Q≥2, the compute complexity is mere $O\lpar mN\log Q\rpar $O(mNlog. âiQ). The GTB codes trade redundancy for encoding and decoding simplicity, and are able to achieve better code rate than other ECCs of the same trade-off. The proposed GTB codes lend themselves well to designs with high reliability and low computation complexity requirements, such as storage systems with strong fault tolerance, or compute systems with straggler tolerance, and so on. © 2019 Institution of engineering and Technology. All rights reserved.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A 64-bit, shared disk file system for Linux

A 64-bit, shared disk file system for Linux

引用

IEEE Symposium on Mass Storage systems

作者： K.W. Preslan A.P. Barry J.E. Brassow G.M. Erickson E. Nygaard C.J. Sabol S.R. Soltis D.C. Teigland M.T. O'Keefe Parallel Computer Systems Laboratory Department of Electrical and Computer Engineering University of Minnesota USA

In computer systems today, speed and responsiveness is often determined by network and storage subsystem performance. Faster, more scalable networking interfaces like Fibre Channel and Gigabit Ethernet provide the scaffolding from which higher performance implementations may be constructed, but new thinking is required about how machines interact with network-enabled storage devices. We have developed a Linux file system called GFS (the Global File System) that allows multiple Linux machines to access and share disk and tape devices on a Fibre Channel or SCSI storage network. We plan to extend GFS by transporting packetized SCSI commands over IP so that any GFS-enabled Linux machine can access shared network devices. GFS will perform well as a local file system, as a traditional network file system running over LP, and as a high-performance cluster file system running over storage networks like Fibre Channel. GFS device sharing provides a key cluster-enabling technology for Linux, helping to bring the availability, scalability, and load balancing benefits of clustering to Linux. Our goal is to develop a scalable, (in number of clients and devices, capacity, connectivity, and bandwidth) server-less file system that integrates IF-based network attached storage (NAS) and Fibre-Channel-based storage area networks (SAN). We call this new architecture Storage Area InterNetworking (SAINT). It exploits the speed and device scalability of SAN clusters, and provides the client scalability and network interoperability of NAS appliances. Our Linux port shows that the GFS architecture is portable across different platforms, and we are currently working on a port to NetBSD. The GFS code is open source (GPL) software freely available on the Internet at http://***.

关键词： File systems Linux Optical fiber devices Scalability Storage area networks computer networks Delay Ethernet networks Availability Load management

来源：评论

学校读者我要写书评

暂无评论

Decentralized control in active distribution grids via supervised and reinforcement learning

引用

Energy and AI 2024年第2期16卷 137-149页

作者： Stavros Karagiannopoulos Petros Aristidou Gabriela Hug Audun Botterud Laboratory for Information and Decision Systems(LIDS) Massachusetts Institute of TechnologyCambridgeUSA EEH-Power Systems Laboratory ETH Zurichhysikstrasse 38092 ZurichSwitzerland Department of Electrical Engineering Computer Engineering&InformaticsCyprus

While moving towards a low-carbon, sustainable electricity system, distribution networks are expected to host a large share of distributed generators, such as photovoltaic units and wind turbines. These inverter-based resources are intermittent, but also controllable, and are expected to amplify the role of distribution networks together with other distributed energy resources, such as storage systems and controllable loads. The available control methods for these resources are typically categorized based on the available communication network into centralized, distributed, and decentralized or local. Standard local schemes are typically inefficient, whereas centralized approaches show implementation and cost concerns. This paper focuses on optimized decentralized control of distributed generators via supervised and reinforcement learning. We present existing state-of-the-art decentralized control schemes based on supervised learning, propose a new reinforcement learning scheme based on deep deterministic policy gradient, and compare the behavior of both decentralized and centralized methods in terms of computational effort, scalability, privacy awareness, ability to consider constraints, and overall optimality. We evaluate the performance of the examined schemes on a benchmark European low voltage test system. The results show that both supervised learning and reinforcement learning schemes effectively mitigate the operational issues faced by the distribution network.

关键词： Supervised learning Reinforcement learning Deep deterministic policy gradient Decentralized control Active distribution systems

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Symposium on Multiple-Valued Logic, MVL 1978

作者： Atkins, D.E. Program in Computer Information and Control Engineering Systems Engineering Laboratory Department of Electrical and Computer Engineering University of Michigan Ann ArborMI48109 United States

An approach to the topic of computer arithmetic is suggested which may have a particular conceptual, pedagodical, and practical appeal to the designer of multiple-valued logic processors. computer arithmetic deals with the physical representation of finite sets of numbers and the design, analysis, and implementation of algorithms for mechanizing arithmetic operations on these sets. Finite number representation systems (FNRS) are specified by defining a set of symbols and a mapping from the elements of this symbol set to a subset of the real numbers. A formal definition of a FNRS provides a basis for a set of definitions which in turn provide the framework for the classification of a large set of number systems. Emphasis in this paper is on the following positive, fixed radix systems: unsigned, sign and magnitude, radix complement, and diminished radix complement. We offer an annotated listing of primitive digit vector algorithms for the four common number representation systems with an arbitrary, positive integer, fixed radix. These digit vector algorithms are ones which the designer of multi-valued logic arithmetic processors will need to implement to provide general arithmetic computation. © 1978 Advanced Automotive Batteries. All rights reserved.

关键词： Numbering systems

来源：评论

学校读者我要写书评

暂无评论

Set stability for switched Boolean networks with open-loop and closed-loop switching signals

引用

Science China(Information Sciences) 2018年第9期61卷 232-240页

作者： Xiaohua LI Jianquan LU Jianlong QIU Xiangyong CHEN Xiaodi LI Fuad E.ALSAADI School of Automation and Engineering and Key Laboratory of Complex Systems and Intelligent Computing in Universities of Shandong Linyi University School of Mathematics and Statistics Shandong Normal University School of Mathematics Southeast University Department of Electrical and Computer Engineering King Abdulaziz University

This paper mainly analyzes the set stability of switched Boolean networks(SBNs) by considering two different methods of switching signals in the form of open-loop and closed-loop switching. First, the definitions of set stability are proposed for SBNs with such switching signals. Then, we propose two different algorithms to find the largest open-loop switching invariant set and largest closed-loop switching invariant set. Furthermore, the corresponding set stability conditions for SBNs are given in each case. In addition,the constructive procedures are presented to design the switching signal sequence to achieve set stability under the two different methods of switching signals. Finally, the effectiveness of the proposed algorithms and research results are demonstrated using two numerical examples.

关键词： switched Boolean network set stability semi-tensor product switching signal design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：