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

Grid Edge Technologies Conference & Exposition (Grid Edge), IEEE PES

作者： Midrar Adham Sean J. Keene Tylor Slay Jaime T. Kolln Robert B. Bass Department of Electrical & Computer Engineering Portland State University Portland OR Distributed Systems Pacific Northwest National Laboratory Richland WA

ISBN: (数字)9798350352528

ISBN: (纸本)9798350352535

This work demonstrates four grid service use cases using a service-oriented DER Management System within an Energy Grid of Things network. Imposed by a set of rules referred to as the Energy Service Interface, the DER Management System uses IEEE 2030.5 as its primary communication protocol. To simulate the efforts of Grid Operators, Grid Service Providers, and consumers to provide grid services, a co-simulation environment that leverages the GridAPPS-D simulation platform was developed. The results show that a service-oriented DER Management System provides a means of achieving reliable and impactful grid services while protecting customers' privacy and ensuring their agency over their distributed Energy Resources.

关键词： Privacy Protocols Real-time systems distributed power generation Servers Reliability Information exchange

来源：评论

学校读者我要写书评

暂无评论

Monitoring functions on global states of distributed programs

引用

JOURNAL OF parallel AND distributed COMPUTING 1997年第2期41卷 173-189页

作者： Tomlinson, AI Garg, VK Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering 4 The University of Texas at Austin Austin Texas 78712

The domain of a global function is the set of all global states of an execution of a distributed program, We show how to monitor a program in order to determine if there exists a global state in which the sum x(1) + x(2) +...+ x(N), exceeds some constant K, where x(i) is defined in process i. We examine the cases where x(i) is an integer variable for N = 2 and where x(i) is a boolean variable for general N, For both cases we provide algorithms, prove their correctness, and analyze their complexity. (C) 1997 Academic Press.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fretting wear mechanism of GH4169 dovetail joint specimens treated with hybrid laser shock peening

引用

Tribology International 2025年 209卷

作者： Fang, Xiuyang Wang, Zheng Wahab, Magd Abdel Gong, Jianen Liu, Xiong Liu, Xing Cai, Zhenbing School of Mechanical Engineering Southwest Jiaotong University Chengdu610031 China Tribology Research Institute Key Lab of Advanced Technologies of Materials Southwest Jiaotong University Chengdu610031 China Soete Laboratory Department of Electrical Energy Metals Mechanical Constructions and Systems Faculty of Engineering and Architecture Ghent University Gent9000 Belgium College of Engineering Yuan Ze University Taiwan China Parallel and Distributed Systems Laboratory Jožef Stefan Institute Jamova cesta 39 LjubljanaSI-1000 Slovenia DongFang Electric Machinery Co. LTD Deyang618000 China State Key Laboratory of Advanced Electromagnetic Technology Huazhong University of Science and Technology Hubei Wuhan430074 China

Aero engine blade structure is prone to severe fretting wear under centrifugal forces and vibration loads, resulting in greatly reduced engine service life, which is a typical fretting damage problem. In this paper, without Absorbing layer Nanosecond Laser Shock Peening (wAN-LSP) and without Absorbing layer Nanosecond superimposed Femtosecond hybrid Laser Shock Peening (NF-LSP) are utilized to strengthen the surface of GH4169 dovetail joint specimens, which is a common material for engine blades, to explore its strengthening mechanism and fretting wear evolution law. The findings indicate that the surface roughness of the wAN-LSP specimen rises from 0.28 μm to 1.16 μm. The thermal effects of wAN-LSP lead to the formation of a molten layer roughly 10.97 μm thick on the surface, accompanied by numerous pits, ablation holes, and micro-cracks. In contrast, NF-LSP treatment effectively eliminates the surface oxidation defects made by the thermal effects of wAN-LSP, leading to a slight decrease in surface roughness. Both wAN-LSP and NF-LSP treatments enhance the surface hardness of the specimens, creating a plastic deformation layer roughly 400 μm deep, but the near surface hardness of NF-LSP treated specimen is further improved compared to that of the wAN-LSP specimen. The wear mechanism observed in the GH4169 dovetail joint specimens following wAN-LSP and NF-LSP treatment are identified as abrasive wear and oxidation wear. Initially, as the number of cycles raises, the wear volume of GH4169 specimen treated with wAN-LSP is higher than that of untreated specimen, but subsequently, it becomes lesser than that of the untreated specimen. This phenomenon results from the interplay between the molten layer and hardened layer. In the initial stage of wear, despite the surface strengthening of the wAN-LSP specimen, the presence of molten layer significantly diminishes the fretting wear resistance of the material. As wear progresses, the molten layer is removed, revealing the be

关键词： Abrasion

来源：评论

学校读者我要写书评

暂无评论

Using the causal domain to specify and verify distributed programs

引用

ACTA INFORMATICA 1997年第9期34卷 667-686页

作者： Garg, VK Tomlinson, AI Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering The University of Texas at Austin Austin TX 78712 USA (http://maple.ece.utexas.edu) US

A system for specification and proof of distributed programs is presented. The method is based directly on the partial order of local states (poset) and avoids the notions of time and simultaneity. Programs are specified by documenting the relationship between local states which are adjacent to each other in the poset. Program properties are defined by stating properties of the poset. Many program properties can be expressed succinctly and elegantly using this method because poset properties inherently account for varying processor execution speeds. The system utilizes a proof technique which uses induction on the complement of the causally precedes relation and is shown to be useful in proving poset properties. We demonstrate the system on three example algorithms: vector clocks, mutual exclusion, and direct dependency clocks.

关键词： ALGORITHMS PARTIALLY ordered sets

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of restricted classes of global predicates 9th

Efficient detection of restricted classes of global predicat...

引用

9th International Workshop on distributed Algoriths, WDAG 1995

作者： Chase, Craig M. Garg, Vijay K. Parallel and Distributed Systems Laboratory Electrical and Computer Engineering Department The University of Texas at Austin United States

ISBN: (纸本)3540602747

We show that the problem of predicate detection in distributed systems is NP-complete. We introduce a class of predicates, linear predicates, such that for any linear predicate B there exists an efficient detection of the least cut satisfying B. The dual of linearity is post-linearity. These properties generalize several known properties of distributed systems, such as the set of consistent cuts forms a lattice, and the WCP and GCP predicate detection results given in earlier work. We define a more general class of predicates, semi-linear predicates, for which efficient algorithms are known to detect whether a predicate has occurred during an execution of a distributed program. However, these methods may not identify the least such cut. Any stable predicate is an example of a semi-linear predicate. In addition, we show that certain unstable predicates can also be semi-linear, such as mutual exclusion violation. Finally, we show application of max-flow to the predicate detection problem. This result solves a previously open problem in predicate detection, establishing the existence of an efficient algorithm to detect predicates of the form X1 + x2… +xn i are variables on different processes, k is some constant, and n is larger than 2. © Springer-Verlag Berlin Heidelberg 1995.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Prefetching and caching for query scheduling in a special class of distributed applications 25

Prefetching and caching for query scheduling in a special cl...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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 Macao 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 implicit Euler discretization long-term memory residual neural network swin Transformer

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：