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

arXiv 2020年

作者： Chen, Lei Farajollahi, Mohammad Ghamkhari, Mahdi Zhao, Wei Huang, Songling Mohsenian-Rad, Hamed State Key Lab. of Power System Department of Electrical Engineering Tsinghua University Beijing100084 China Department of Electrical and Computer Engineering University of California RiversideCA United States Electrical and Computer Engineering Department University of Louisiana at Lafayette LafayetteLA United States

Topology identification (TI) in distribution networks is a challenging task due to the limited measurement resources and therefore the inevitable need to use pseudo-measurements that are often inaccurate. To address this issue, a new method is proposed in this paper to integrate harmonic synchrophasors into the TI problem in order to enhance TI accuracy in distribution networks. In this method, topology identification is done jointly based on both fundamental synchrophasor measurements and harmonic synchrophasor measurements. This is done by formulating and then solving a mixed-integer linear programming (MILP) problem. Furthermore, an analysis is provided to capture the number of and the location of harmonic sources and sensors that are needed to ensure full observability. The benefits of the proposed TI scheme are compared against those of the traditional scheme that utilizes only the fundamental measurements. Finally, through numerical simulations on the IEEE 33-Bus power system, it is shown that the proposed scheme is considerably accurate compared to the traditional scheme in topology identification. Copyright © 2020, The Authors. All rights reserved.

关键词： Phasor measurement units

来源：评论

学校读者我要写书评

暂无评论

Minimax regret 1-sink location problems in dynamic path networks

Minimax regret 1-sink location problems in dynamic path netw...

引用

10th International Conference on Theory and Applications of Models of Computation, TAMC 2013

作者： Cheng, Siu-Wing Higashikawa, Yuya Katoh, Naoki Ni, Guanqun Su, Bing Xu, Yinfeng Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong Department of Architecture and Architectural Engineering Kyoto University Japan Business School Sichuan University Chengdu 610065 China School of Economics and Management Xi'an Technological University Xi'an 710032 China School of Management Xi'an Jiaotong University Xi'an 710049 China State Key Lab. for Manufacturing Systems Engineering Xi'an 710049 China

ISBN: (纸本)9783642382352

This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, called weight, is unknown but only the interval of weight is known. A particular assignment of weight to each vertex is called a scenario. Under any scenario, the cost of a sink is defined as the minimum time to complete evacuation for all weights (evacuees), and the regret of a sink location x is defined as the cost of x minus the cost of an optimal sink. Then, the problem is to find a point as a sink such that the maximum regret for all possible scenarios is minimized. We present an O(n log2 n) time algorithm for minimax regret 1-sink location problems in dynamic path networks, where n is the number of vertices in the network. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

DQ-RM: Deep Reinforcement Learning-based Route Mutation Scheme for Multimedia Services

DQ-RM: Deep Reinforcement Learning-based Route Mutation Sche...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Tao Zhang Changqiao Xu Bingchi Zhang Xiaohui Kuang Yue Wang Shujie Yang Gabriel-Miro Muntean State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China School of International Beijing University of Posts and Telecommunications Beijing China State key Laboratory of Science and Technology on Information System Security Beijing China Beijing Key Laboratory of Network System Architecture and Convergence Beijing China Performance Engineering Lab. School of Electronic Engineering Dublin City University Dublin Ireland

ISBN: (数字)9781728131290

ISBN: (纸本)9781728131306

Increasingly growing various multimedia services (e.g., interactive live video and so on) have brought tremendous pressure on existing static defense techniques. To cope with inherent drawback of static defense techniques, Network Moving Target Defense (NMTD) such as route mutation (RM) was proposed. What's more, applying reinforcement learning (RL) into RM has been proved feasible in our previous work. But two main problems still need to be considered in this combination of RL with RM: 1) It lacks the consideration of multiple flows situation. 2) With the state-action space grow larger, current solution can't handle efficiently. In this paper, we propose a deep Q-learning method for RM (DQ-RM) to solve above two problems. Firstly, benefited from the satisfiability module theory, we formalize RM space considering single flow and multiple flows concurrently. Then we further propose a deep reinforcement learning-based RM scheme based on our previous work, which is suitable for large-scale state-action space. Finally, extensive experimental results highlight the improvement of DQ-RM in defense performance and convergence speed compared to the representative solution.

关键词： Routing Streaming media Machine learning Frequency modulation computer crime Convergence Quality of service

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Invariant Clusters for Polynomial Programs by Semidefinite Programming

arXiv

引用

arXiv 2019年

作者： Wang, Qiuye Xue, Bai Zhan, Naijun Zhi, Lihong Yang, Zhi-Hong Department of Computer Science Duke University United States State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences University of CAS Beijing China Mathematics Mechanization Research Center Institute of System Science Academy of Mathematics and System Sciences Academia Sinica Beijing China Department of Mathematics NC State University NC United States

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for repeatedly synthesizing new invariants when the specifications and programs are evolving. To that end, we search for sets of parameters Rk w.r.t. a parameterized multivariate polynomial I (a, x) (i.e. a template) such that I (a, x) ≤ 0 is a valid program invariant for all a ∈ Rk. Instead of using time-consuming symbolic routines such as quantifier eliminations, we show that such sets of parameters can be synthesized using a hierarchy of semidefinite programming (SDP). Moreover, we show that, under some standard non-degenerate assumptions, almost all possible valid parameters can be included in the synthesized sets. Such kind of completeness result has previously only been provided by symbolic approaches. Further extensions such as using semialgebraic and general algebraic templates (instead of polynomial ones) and allowing non-polynomial continuous functions in programs are also discussed. Copyright © 2019, The Authors. All rights reserved.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Model Predictive Control with Reach-avoid Analysis

arXiv

引用

arXiv 2023年

作者： Ren, Dejin Lu, Wanli Lv, Jidong Zhang, Lijun Xue, Bai State Key Lab. of Computer Science Institute of Software CAS Beijing China University of Chinese Academy of Sciences Beijing China National Engineering Research Center of Rail Transportation Operation and Control System Beijing Jiaotong University Beijing China

In this paper we investigate the optimal controller synthesis problem, so that the system under the controller can reach a specified target set while satisfying given constraints. Existing model predictive control (MPC) methods learn from a set of discrete states visited by previous (sub-)optimized trajectories and thus result in computationally expensive mixed-integer nonlinear optimization. In this paper a novel MPC method is proposed based on reach-avoid analysis to solve the controller synthesis problem iteratively. The reach-avoid analysis is concerned with computing a reach-avoid set which is a set of initial states such that the system can reach the target set successfully. It not only provides terminal constraints, which ensure feasibility of MPC, but also expands discrete states in existing methods into a continuous set (i.e., reach-avoid sets) and thus leads to nonlinear optimization which is more computationally tractable online due to the absence of integer variables. Finally, we evaluate the proposed method and make comparisons with state-of-the-art ones based on several examples. Copyright © 2023, The Authors. All rights reserved.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Grid information integration scheme based on virtual client access mode

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2007年第SUPPL. 2期35卷 8-11页

作者： Sun, Aobing Jin, Hai Zheng, Ran Zhang, Qin Services Computing Technology and System Key Lab. College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Key Lab. College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

VCA (virtual client access) based grid information integration strategy is proposed in this paper that brings forward one efficient application framework with loosely coupled architecture. It encapsulates the virtual clients that are realized based on the API of the information systems as grid services to enable the grid can access the information systems as real client. VCA mode can be combined with local access control and task management seamlessly, and solve the resource conflicts between grid and local users so as to support the information sharing and cooperation widely and efficiently. The experiment shows that VCA modes can support the information sharing and cooperation widely and efficiently.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

A simulator for swarm AUVs acoustic communication networking 11

A simulator for swarm AUVs acoustic communication networking

引用

11th ACM International Conference on Underwater Networks and systems, WUWNet 2016

作者： Li, Guannan Liu, Jun Wang, Xue Xu, Hongli Cui, Jun-Hong Shenyang Institute of Automation CAS University of Chinese Academy of Sciences No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University State Key Laboratory of Robotics Key Laboratory of System Control and Information Processing Ministry of Education of China Changchun China Shenyang Institute of Automation CAS Northeast University No. 114 Nanta Street Shenhe District Shenyang China Shenyang Institute of Automation CAS No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University Changchun China Underwater Sensor Network Lab. University of Connecticut StorrsCT06269 United States

ISBN: (纸本)9781450346375

This paper presents a simulator for swarm operations designed to verify algorithms for a swarm of autonomous underwater robots (AUVs), specifically for constructing an underwater communication network with AUVs carrying acoustic communication devices. This simulator consists of three nodes: a virtual vehicle node (VV), a virtual environment node (VE), and a visual showing node (VS). The modular design treats AUV models as a combination of virtual equipment. An expert acoustic communication simulator is embedded in this simulator, to simulate scenarios with dynamic acoustic communication nodes. The several simulations we have performed demonstrate that this simulator is easy to use and can be further improved.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Detecting JVM JIT Compiler Bugs via Exploring Two-Dimensional Input Spaces

Detecting JVM JIT Compiler Bugs via Exploring Two-Dimensiona...

引用

International Conference on Software Engineering (ICSE)

作者： Haoxiang Jia Ming Wen Zifan Xie Xiaochen Guo Rongxin Wu Maolin Sun Kang Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab. Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System School of Informatics Xiamen University China School of Computer Science and Technology Huazhong University of Science and Technology China

Java Virtual Machine (JVM) is the fundamental software system that supports the interpretation and execution of Java bytecode. To support the surging performance demands for the increasingly complex and large-scale Java programs, Just-In-Time (JIT) compiler was proposed to perform sophisticated runtime optimization. However, this inevitably induces various bugs, which are becoming more pervasive over the decades and can often cause significant consequences. To facilitate the design of effective and efficient testing techniques to detect JIT compiler bugs. This study first performs a preliminary study aiming to understand the characteristics of JIT compiler bugs and the corresponding triggering test cases. Inspired by the empirical findings, we propose JOpFuzzer, a new JVM testing approach with a specific focus on JIT compiler bugs. The main novelty of JOpFuzzer is embodied in three aspects. First, besides generating new seeds, JOpFuzzer also searches for diverse configurations along the new dimension of optimization options. Second, JOpFuzzer learns the correlations between various code features and different optimization options to guide the process of seed mutation and option exploration. Third, it leverages the profile data, which can reveal the program execution information, to guide the fuzzing process. Such nov-elties enable JOpFuzzer to effectively and efficiently explore the two-dimensional input spaces. Extensive evaluation shows that JOpFuzzer outperforms the state-of-the-art approaches in terms of the achieved code coverages. More importantly, it has detected 41 bugs in OpenJDK, and 25 of them have already been confirmed or fixed by the corresponding developers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Route search algorithm on P2P networks based on Gnutella protocol: Light-flooding

引用

Jisuanji Gongcheng/computer Engineering 2005年第11期31卷 112-114页

作者： Yue, Guangxue Department of Computer Science Huaihua University Huaihua 418000 China Key Lab. of Embedded Computing and System of Hunan Hunan University Changsha 410082 China

By analyzing search algorithm on Gnutella networks protocol, combining its advantages both the Gossip distributed forward search and spanning tree algorithm, this paper realizes a kind of high-efficient route searches for algorithms: Light-Flooding, presents simulations of both Light-Flooding and Gossip search algorithm, the results show that Light-Flooding algorithm improves efficiently search about 63.4%, lower redundant information about 60%, average packet delay is 2.6 s. So as to make the whole comprehensive composite performance of the networks maintain a fine state.

关键词： Hops Light-Flooding Peer-to-Peer network Route search Spanning tree

来源：评论

学校读者我要写书评

暂无评论

BTI Aging Monitoring based on SRAM Start-up Behavior

BTI Aging Monitoring based on SRAM Start-up Behavior

引用

Asian Test Symposium (ATS)

作者： Shengyu Duan Peng Wang Gaole Sai School of Computer Engineering and Science Shanghai University Shanghai China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology China

ISBN: (数字)9781728174679

ISBN: (纸本)9781728174686

Bias Temperature Instability (BTI) is one of the dominant CMOS aging mechanisms. It causes time-dependent variation, threatening circuit lifetime reliability. BTI-induced circuit errors are not detectable at the fabrication stage. On-line monitoring schemes are therefore necessary to capture the degradations during the operational time. Traditional aging monitoring techniques exhibit high implementation complexity and low stability. In this paper, we propose a BTI monitoring approach by simply tracking the start-up behavior of SRAM cells. SRAM is a widely used on-chip device in many applications. We study the impact of BTI for SRAM start-up values and age some cells in a manipulated manner. The BTI degradation is evaluated based on the number of SRAM cells starting with a certain value. This technique can be used to estimate the degradation for on-chip logic circuits without introducing additional circuitry, and thus has very low implementation complexity. We use an SRAM array with 1024 cells to estimate the degradations for multiple logic circuits, and show the average mean absolute percentage error as 8.48%. In addition, this technique is robust considering process, voltage and temperature variations.

关键词： Degradation Monitoring Logic circuits Transistors SRAM cells Aging system-on-chip

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：