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

25th International Conference on parallel Processing, ICPP 1996

作者： Sinha, A. Chase, C. Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering University of Texas AustinTX78712 United States

ISBN: (纸本)081867623X

We analyze the scheduling aspects of database queries submitted to an abstract model of a very large distributed system. The essential elements of this model are: (a) a finite number of identical processing nodes with limited storage capacity, (b) a finite number of queries to be serviced, (c) a very large read-only data set that is shared by all queries and (d) a fixed inter-node communication latency. This framework models an important class of applications that use distributed processing of very large data sets. Examples of these applications exist in the very large database and multimedia problem domains. To meet the objective of minimizing flow time of queries while exploiting inter-query locality, various heuristics are proposed and evaluated through extensive simulation. © 1996 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: All-to-all gradecast using coding with byzantine failures 12

Brief announcement: All-to-all gradecast using coding with b...

引用

2012 ACM Symposium on Principles of distributed Computing, PODC'12

作者： Bridgman III, John F. Garg, Vijay K. Parallel and Distributed Systems Lab. Electrical and Computer Engineering University of Texas at Austin Austin TX United States

No abstract available.

ISBN: (纸本)9781450314503

No abstract available.

关键词： fault tolerance broadcast distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

All-to-all gradecast using coding with byzantine failures

All-to-all gradecast using coding with byzantine failures

引用

14th International Symposium on Stabilization, Safety, and Security of distributed systems, SSS 2012

作者： Bridgman III, John F. Garg, Vijay K. Parallel and Distributed Systems Lab. Electrical and Computer Engineering University of Texas at Austin Austin TX United States

ISBN: (纸本)9783642335358

This paper presents a method that uses forward error correction codes to minimize the message bit complexity when acquiring consistent global information in the presence of faulty processes. We show a modification to the gradecast algorithm that implements our method. Gradecast, first proposed by Feldman and Micali, is a broadcast algorithm for distributed systems that can handle Byzantine failures. It can be used as a basic building block to solve many important problems in distributed computing in the presence of Byzantine failures, such as agreement, clock synchronization, and approximate agreement. Many of these problems require a step where all processes need to send information to all other processes. We refer to the version of gradecast where all processes broadcast to all other processes as all-to-all gradecast. In a distributed system with n processes, n instances of the original gradecast algorithm to perform all-to-all gradecast has a message bit complexity of O(mn3), where m is the length of the message. In this paper, we present an all-to-all gradecast algorithm that takes O(mtn2) message bits, where t is the maximum number of faulty processes. This is a significant reduction in message bit complexity in real systems where t n. Our all-to-all gradecast algorithm uses coding theory to mask Byzantine failures and has wide applicability in distributed systems. For example, by replacing the original gradecast in the byzantine agreement algorithm proposed by Ben-Or, Dolev and Hoch with O(mtn3) message bit complexity, we get a new byzantine agreement algorithm with O(mt2 n2) message bit complexity. Also, this algorithm can be used with their approximate agreement algorithm to get O(kn2 t) instead of O(kn3) message bit complexity. © 2012 Springer-Verlag.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Democratic elections in faulty distributed systems

Democratic elections in faulty distributed systems

引用

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Himanshu, Chauhan Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas Austin TX United States

ISBN: (纸本)9783642356674

In this paper, we show that for elections in distributed systems the conversion from non-binary choices to binary choices does not always provide optimal results when the preferences of nodes are not identical. With this observation, we study the problem of conducting democratic elections in distributed systems in the form of social choice and social welfare functions with three or more candidates. We present some impossibility and possibility results for distributed democratic elections in presence of Byzantine behavior. We also discuss some existing election schemes, and present a new approach that attempts to mitigate the effects of Byzantine *** analyze the performance of these schemes through simulations to compare their efficacy in producing the most desirable social welfare rankings. © Springer-Verlag 2013.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Implicit Multi-Scale Swin Transformer Network for Image Denoising

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Qi Ding, Yuwei Zhang, Weiqi Zhu, Yian Zhang, Bob Lin, Jerry Chun-Wei Harbin Institute of Technology at Weihai School of Economics and Management Weihai China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Northwestern Polytechnical University School of Computer Science Xi’an China Northwestern Polytechnical University Yangtze River Delta Research Institute Taicang China University of Macau PAMI Research Group Department of Computer and Information Science Taipa China Department of Distributed Systems and IT Devices Electrical Engineering and Mathematical Sciences Silesian university of technology Poland

Image denoising has been used in various edge computing scenarios such as consumer electronics to improve the image quality and user experience. Existing image denoising methods based on Convolutional Neural Networks (CNNs) and vision Transformers achieve good performance by empirically utilizing residual neural network (ResNet) as basic component. However, ResNet lacks interpretability in network design and also long-term memory of features, potentially restricting the performance of denoising networks. In this paper, we propose an Implicit Multi-scale Swin Transformer Network (IMSNet) for image denoising, which introduces the implicit Euler scheme from the feature memory perspective. Specifically, densely connected implicit feature extraction blocks (IFEBs) are designed to learn the residual mapping between noisy and clean images. The IFEB reformulates the initial skip connection of ResNet based on the implicit Euler discretization, providing both network interpretability and long-term memory. In IFEB, the multi-scale swin Transformer block (MSB) is designed as the implicit layer to capture spatial details and non-local contextual information at different scales. Additionally, a cross-layer feature fusion block (CLFF) is proposed to further improve feature reuse capabilities. Compared to existing denoising networks, the extensive experiments demonstrate the superior performance of our IMSNet in various image denoising tasks, and the flexibility in the practical applications with proposed light model on resource-restricted platforms such as consumer electronic devices. © 1975-2011 IEEE.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Lattice completion algorithms for distributed computations

Lattice completion algorithms for distributed computations

引用

16th International Conference on Principles of distributed systems, OPODIS 2012

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642354755

A distributed computation is usually modeled as a finite partially ordered set (poset) of events. Many operations on this poset require computing meets and joins of subsets of events. The lattice of normal cuts of a poset is the smallest lattice that embeds the poset such that all meets and joins are defined. In this paper, we propose new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed for distributed computing applications and have lower time or space complexity than those of existing algorithms. We also show applications of this lattice to the problems in distributed computing such as finding the extremal events and detecting global predicates. © 2012 Springer-Verlag.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Maximal antichain lattice algorithms for distributed computations

Maximal antichain lattice algorithms for distributed computa...

引用

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642356674

The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previously known algorithm by Nourine and Raynoud [NR99, NR02] to construct the lattice takes O (n2m) time where n is the number of events in the computation, and m is the size of the lattice of maximal antichains. The algorithm by Jourdan, Rampon and Jard [JRJ94] takes O ((n + w2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new online incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes O (mw2 log w L) time and O (wL w log n) space where wL is the width of the lattice of maximal antichains. The lower space complexity makes our algorithm applicable for online global predicate detection in a distributed system. For the purposes of analyzing offline traces, we also propose new enumeration algorithms to traverse the lattice. © Springer-Verlag 2013.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A survey of script learning

引用

Frontiers of Information Technology & Electronic engineering 2021年第3期22卷 341-373页

作者： Yi HAN Linbo QIAO Jianming ZHENG Hefeng WU Dongsheng LI Xiangke LIAO Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangsha 410000China Science and Technology on Information Systems Engineering Laboratory National University of Defense TechnologyChangsha 410000China School of Data and Computer Science Sun Yat-sen UniversityGuangzhou 510006China

Script is the structured knowledge representation of prototypical real-life event *** the commonsense knowledge inside the script can be helpful for machines in understanding natural language and drawing commonsensible *** learning is an interesting and promising research direction,in which a trained script learning system can process narrative texts to capture script knowledge and draw ***,there are currently no survey articles on script learning,so we are providing this comprehensive survey to deeply investigate the standard framework and the major research topics on script *** research field contains three main topics:event representations,script learning models,and evaluation *** each topic,we systematically summarize and categorize the existing script learning systems,and carefully analyze and compare the advantages and disadvantages of the representative *** also discuss the current state of the research and possible future directions.

关键词： Script learning Natural language processing Commonsense knowledge modeling Event reasoning

来源：评论

学校读者我要写书评

暂无评论

Web-based multimedia databases: Prospects and challenges

Web-based multimedia databases: Prospects and challenges

引用

MMDB 2004: Proceedings of the Second ACM International Workshop on Multimedia Databases

作者： Ghafoor, Arif Distributed Multimedia Systems Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN 47907

ISBN: (纸本)1581139756

Development of Web-based multimedia applications is expected to hold central importance for engineering and technological progress during the rest of this decade. It is already opening up new research frontiers in a number of areas such as multimedia data modeling and indexing, data mining, multimedia document management, semantic Web, pervasive computing, distributed sensor networks, computer security, real-time operating systems, human-computer interaction, and storage technology etc. As a result of concerted effort in these areas, many Web-accessible multimedia applications involving different media types, e.g., video, audio, text, images, animation and graphics, are rapidly emerging Examples of such applications abound in the domains of health care, education, entertainment, manufacturing, e-commerce, digital libraries as well as military and critical national infrastructures. The premise is that the integration of Web and multimedia technologies can provide cost effective solutions for management and dissemination of information, which is a primary tool for increasing economic efficiency. Development of Web-based multimedia applications needs a broad range of technological solutions that deal with organizing, storing, and delivering multimedia information in an integrated, secure and timely manner with guaranteed quality of service (QoS). Multimedia database management, when viewed in conjunction with integration of contents from independent Web-based data sources, present formidable research and development challenges. Key challenges include: content analysis and indexing of distributed multimedia data and documents semantic modeling and knowledge-based representation of multimedia data transformation and organization of multimedia data semantics as a part of Semantic Web security, privacy and QoS related issues concerning Web-based multimedia database applications emerging Web standards and their role in managing distributed multimedia databases In this talk,

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Social Energy:Mining Energy From the Society

引用

IEEE/CAA Journal of Automatica Sinica 2017年第3期4卷 466-482页

作者： Jun Jason Zhang David Wenzhong Gao Yingchen Zhang Xiao Wang Xiangyang Zhao Dongliang Duan Xiaoxiao Dai Jun Hao Fei-Yue Wang Department of Electrical and Computer Engineering Ritchie School of Engineering and Computer ScienceUniversity of Denver IEEE National Renewable Energy Laboratory Qingdao Academy of Intelligent Industries(QAII) QingdaoShandongChinaand SKL-MCCSCASIA School of Automation Science and Electrical Engineering Beihang University Department of Electrical and Computer Engineering College of Engineering and Applied ScienceUniversity of Wyoming State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences(SKL-MCCSCASIA) Research Center of Computational Experiments and Parallel Systems National University of Defense Technology

The inherent nature of energy,i.e.,physicality,sociality and informatization,implies the inevitable and intensive interaction between energy systems and social *** this perspective,we define "social energy" as a complex sociotechnical system of energy systems,social systems and the derived artificial virtual systems which characterize the intense intersystem and intra-system *** recent advancement in intelligent technology,including artificial intelligence and machine learning technologies,sensing and communication in Internet of Things technologies,and massive high performance computing and extreme-scale data analytics technologies,enables the possibility of substantial advancement in socio-technical system optimization,scheduling,control and *** this paper,we provide a discussion on the nature of energy,and then propose the concept and intention of social energy systems for electrical power.A general methodology of establishing and investigating social energy is proposed,which is based on the ACP approach,i.e., "artificial systems"(A), "computational experiments"(C) and "parallel execution"(P),and parallel system methodology.A case study on the University of Denver(DU) campus grid is provided and studied to demonstrate the social energy *** the concluding remarks,we discuss the technical pathway,in both social and nature sciences,to social energy,and our vision on its future.

关键词： ACP distribution locational marginal pricing intelligent operation in power systems parallel control parallel intelligence parallel management social energy socio-technical energy systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：