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

International Conference on Information Systems and Computer Aided Education (ICISCAE)

作者： Peng Liu Guangxian Lyu Jian Du Xianguo Kang Sumei Guo Yong Wei Chongyou Xu Beijing Key Laboratory of Distribution Transformer Energy-saving Technology China Electric Power Research Institute Beijing China Dispatching Center State Grid Handan Electric Power Supply Company Handan Hebei China Software Development Division Beijing HiTarget Information Technology Co. Ltd. Beijing China Maintenance and Repair Department State Grid Ningbo Electric Power Supply Company Ningbo Zhejiang China

ISBN: (纸本)9781538657393;9781538657386

Barriers are existed in information exchange of distribution application system for long times. This paper proposed a method of information interaction using multi-protocols conversion based on IEC61968 series standard. Combined with message bus technology, it solved the problem of information interaction between advanced distribution automation and its related business system existing in the current project. At same time, it applied to change message of distribution device in any power supply company, and its achievements also can be used for information interoperability among all power systems. The basic ideas and methods presented in this paper have become parts of the enterprise standard of SGCC, which provide guidance of distribution network in the planning, construction, acceptance and operation.

关键词： IEC Standards Information exchange Power systems Automation Protocols Interoperability

来源：评论

学校读者我要写书评

暂无评论

A fine-grained data set and analysis of tangling in bug fixing commits

arXiv

引用

arXiv 2020年

作者： Herbold, Steffen Trautsch, Alexander Ledel, Benjamin Aghamohammadi, Alireza Ghaleb, Taher Ahmed Chahal, Kuljit Kaur Bossenmaier, Tim Nagaria, Bhaveet Makedonski, Philip Ahmadabadi, Matin Nili Szabados, Kristof Spieker, Helge Madeja, Matej Hoy, Nathaniel G. Lenarduzzi, Valentina Wang, Shangwen Rodríguez-Pérez, Gema Colomo-Palacios, Ricardo Verdecchia, Roberto Singh, Paramvir Qin, Yihao Chakroborti, Debasish Davis, Willard Walunj, Vijay Wu, Hongjun Marcilio, Diego Alam, Omar Aldaeej, Abdullah Amit, Idan Turhan, Burak Eismann, Simon Wickert, Anna-Katharina Malavolta, Ivano Sulír, Matúš Fard, Fatemeh Henley, Austin Z. Kourtzanidis, Stratos Tuzun, Eray Treude, Christoph Shamasbi, Simin Maleki Pashchenko, Ivan Wyrich, Marvin Davis, James C. Serebrenik, Alexander Albrecht, Ella Aktas, Ethem Utku Strüber, Daniel Erbel, Johannes Institute for Software and Systems Engineering TU Clausthal Clausthal-Zellefeld Germany Institute of Computer Science University of Goettingen Goettingen Germany Department of Computer Engineering Sharif University of Technology Tehran Iran School of Computing Queen's University Kingston Canada Department of Computer Science Guru Nanak Dev University Amritsar India Karlsruhe Germany Brunel University London Uxbridge United Kingdom Institute of Computer Science University of Goettingen Germany University of Tehran Tehran Iran Ericsson Hungary Ltd. Budapest Hungary Simula Research Laboratory Fornebu Norway Technical University of Košice Košice Slovakia LUT University Finland National University of Defense Technology Changsha China University of British Columbia Kelowna Canada Østfold University College Halden Norway Vrije Universiteit Amsterdam Amsterdam Netherlands University of Auckland Auckland New Zealand University of Saskatchewan Saskatoon Canada IBM Boulder United States University of Missouri-Kansas City Kansas City United States Università della Svizzera italiana Lugano Switzerland Trent University Peterborough Canada University of Maryland Baltimore County United States Imam Abdulrahman Bin Faisal University Saudi Arabia The Hebrew University Acumen Jerusalem Israel University of Oulu Oulu Finland Monash University Melbourne Australia University of Würzburg Würzburg Germany Technische Universität Darmstadt Darmstadt Germany University of Tennessee Knoxville United States University of Macedonia Thessaloniki Greece Department of Computer Engineering Bilkent University Ankara Turkey University of Melbourne Melbourne Australia Independent Researcher Tehran Iran University of Trento Trento Italy University of Stuttgart Stuttgart Germany Purdue University West LafayetteIN United States Eindhoven University of Technology Eindhoven Netherlands Softtech Inc. Research and Development Center Istanbul34947 Turkey Radboud Universi

Context: Tangled commits are changes to software that address multiple concerns at once. For researchers interested in bugs, tangled commits mean that they actually study not only bugs, but also other concerns irrelevant for the study of bugs. Objective: We want to improve our understanding of the prevalence of tangling and the types of changes that are tangled within bug fixing commits. Methods: We use a crowd sourcing approach for manual labeling to validate which changes contribute to bug fixes for each line in bug fixing commits. Each line is labeled by four participants. If at least three participants agree on the same label, we have consensus. Results: We estimate that between 17% and 32% of all changes in bug fixing commits modify the source code to fix the underlying problem. However, when we only consider changes to the production code files this ratio increases to 66% to 87%. We find that about 11% of lines are hard to label leading to active disagreements between participants. Due to confirmed tangling and the uncertainty in our data, we estimate that 3% to 47% of data is noisy without manual untangling, depending on the use case. Conclusion: Tangled commits have a high prevalence in bug fixes and can lead to a large amount of noise in the data. Prior research indicates that this noise may alter results. As researchers, we should be skeptics and assume that unvalidated data is likely very noisy, until proven otherwise. Copyright © 2020, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Ensemble kernel method：SVM classification based on game theory

引用

Journal of Systems Engineering and Electronics 2016年第1期27卷 251-259页

作者： Yufei Liu Dechang Pi Qiyou Cheng College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Department of Computer Science and Technology Tangshan College Tangshan 063000 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 211106 China China Helicopter Research and Development Institute Jingdezhen 333001 China

With the development of the support vector machine（SVM）,the kernel function has become one of the cores of the research on *** a large extent,the kernel function determines the generalization ability of the classifier,but there is still no general theory to guide the choice and structure of the kernel *** ensemble kernel function model based on the game theory is proposed,which is used for the SVM classification *** model can effectively integrate the advantages of the local kernel and the global kernel to get a better classification result,and can provide a feasible way for structuring the kernel *** making experiments on some standard datasets,it is verified that the new method can significantly improve the accuracy of classification.

关键词： game theory classification radial basis kernel polynomial kernel.

来源：评论

学校读者我要写书评

暂无评论

Transmit Beamforming and Power Control for Optimizing the Outage Probability Fairness in MISO Networks

Transmit Beamforming and Power Control for Optimizing the Ou...

引用

作者： Zhai, Xiangping Tan, Chee Wei Huang, Yichao Rao, Bhaskar D. College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing210023 China College of Science and Engineering City University of Hong Kong Hong Kong Hong Kong Qualcomm Corporate Research and Development San DiegoCA92093 United States Department of Electrical and Computer Engineering University of California at San Diego San DiegoCA92093 United States

This paper studies the joint beamforming and power control in a multiuser multi-input single-output network by utilizing the only statistical channel distribution information. Such information consists of slowly varying covariance matrices in the beamforming network that can be employed to reduce instantaneous feedback overhead in transmission. Utilizing solely the statistical channel information, we study how to minimize the maximum outage probability under a weighted sum power constraint that guarantees max-min fairness to all users. This problem is, however, generally hard to solve due to the nonconvexity and nonlinear coupling between beamformer and power variables. First, assuming a fixed beamformer set, we use the nonlinear Perron-Frobenius theory to design a decentralized algorithm with provable geometrically fast convergence rate to compute the optimal power. Then, for the general case, we examine a certainty-equivalent margin counterpart with outage-mapped thresholds that incorporate the statistical channel information. We show that a network duality for this certainty-equivalent problem can be useful to decouple the coupling between the beamformer and power variables. This nonlinear Perron-Frobenius theory motivated approach yields a feasible beamformer and power allocation that are near-optimal as compared to Monte Carlo averaging simulations. © 1972-2012 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Innovating R tree and multicast routing to make QOS multiple paths for service based routing 4th

Innovating R tree and multicast routing to make QOS multiple...

引用

4th International Conference on Context-Aware Systems and Applications, ICCASA 2015

作者： Long, Nguyen Thanh Thuy, Nguyen Duc Hoang, Pham Huy Software Development Division III Informatics Center of Hanoi Telecommunications Hoan Kiem Hanoi Viet Nam Center for Applied Research and Technology Development Research Institute of Posts and Telecommunications Hanoi Viet Nam Information Technology Institute Ha Noi University of Science Technology Hanoi Viet Nam

ISBN: (纸本)9783319292359

In the advanced routing of new networks communication and network technologies, it not only operates on some lower levels of a network protocol. But it also operates on some upper layers such as the application layer the highest level layer in network protocol stack of OSI model. The routing process can be known by a more abstract concept. It can process on many layers on network’s stack of OSI model. So this kind of routing may be called the upper layer routing protocol. As the content based routing, in the service based routing protocol, the information can be classified by categories or service classes. Subscribers and publishers can communicate with each other but they don’t know other’s address. So it is more dynamical in processing and more comfortable for ad-hoc network. However the upper routing must be based on lower layers to make routing decisions. But normal routing protocols are used for most static network or rather small wireless networks or not high mobility networks. In mobile ad-hoc networks, nodes move very often and fast, so bandwidth of connection between them may be reduced. Therefore the transmission delay may be increased. The paper aims at purpose to increate QOS of routing by hierarchical clustering routing by using R+ tree in addition with some advanced techniques multicast routing, multiple paths, use GEN/ BEE/ ANT to optimize routes to transmit data. In R+ tree model, the network’s nodes are managed by Bottom-Up model from leaf nodes to root of the tree. All the leaf nodes, inner nodes and root of this tree are used for two roles: (i) Manage a cluster that consists all nodes that have direct connections with this node;(ii) Operate as a normal node. The paper mentions: (i) Setup hierarchical clustering network by using R tree structure. (ii) Making multicast tree from some cluster heads for fast routing. (iii) Making optimized route by Ant Colony Optimization. © ICST Institute for Computer Sciences, Social Informatics and Telecommunicatio

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

The need to implement FAIR principles in biomolecular simulations

arXiv

引用

arXiv 2024年

作者： Amaro, R. Åqvist, J. Bahar, I. Battistini, F. Bellaiche, A. Beltran, D. Biggin, P.C. Bonomi, M. Bowman, G.R. Bryce, R. Bussi, G. Carloni, P. Case, D. Cavalli, A. Chang, C.A. Cheatham, T.E. Cheung, M.S. Chipot, C. Chong, L.T. Choudhary, P. Cisneros, G.A. Clementi, C. Collepardo-Guevara, R. Coveney, P. Covino, R. Crawford, T.D. Dal Peraro, M. de Groot, B. Delemotte, L. De Vivo, M. Essex, J. Fraternali, F. Gao, J. Gelpí, J.L. Gervasio, F.L. Gonzalez-Nilo, F.D. Grubmüller, H. Guenza, M.G. Guzman, H.V. Harris, S. Head-Gordon, T. Hernandez, R. Hospital, A. Huang, N. Huang, X. Hummer, G. Iglesias-Fernández, J. Jensen, J.H. Jha, S. Jiao, W. Jorgensen, W.L. Kamerlin, S.C.L. Khalid, S. Laughton, C. Levitt, M. Limongelli, V. Lindahl, E. Lindorff-Larsen, K. Loverde, S. Lundborg, M. Luo, Y.L. Luque, F.J. Lynch, C.I. MacKerell, A. Magistrato, A. Marrink, S.J. Martin, H. McCammon, J.A. Merz, K. Moliner, V. Mulholland, A. Murad, S. Naganathan, A.N. Nangia, S. Noe, F. Noy, A. Oláh, J. O'Mara, M. Ondrechen, M.J. Onuchic, J.N. Onufriev, A. Osuna, S. Palermo, G. Panchenko, A.R. Pantano, S. Parish, C. Parrinello, M. Perez, A. Perez-Acle, T. Perilla, J.R. Pettitt, B.M. Pietropaolo, A. Piquemal, J.-P. Poma, A. Praprotnik, M. Ramos, M.J. Ren, P. Reuter, N. Roitberg, A. Rosta, E. Rovira, C. Roux, B. Röthlisberger, U. Sanbonmatsu, K. Schlick, T. Shaytan, A.K. Simmerling, C. Smith, J.C. Sugita, Y. Świderek, K. Taiji, M. Tao, P. Tikhonova, I.G. Tirado-Rives, J. Tuñón, I. Van Der Kamp, M.W. Van der Spoel, D. Velankar, S. Voth, G.A. Wade, R. Warshel, A. Welborn, V.V. Wetmore, S. Wong, C.F. Yang, L.-W. Zacharias, M. Orozco, M. Department of Molecular Biology University of California San DiegoCA United States Department of Cell and Molecular Biology Uppsala University Uppsala Sweden Laufer Center for Physical and Quantitative Biology Renaissance School of Medicine Stony Brook University Stony BrookNY United States Department of Biochemistry and Cell Biology Renaissance School of Medicine Stony Brook University Stony BrookNY United States Barcelona Spain European Molecular Biology Laboratory European Bioinformatics Institute Hinxton United Kingdom Structural Bioinformatics and Computational Biochemistry Department of Biochemistry University of Oxford Oxford United Kingdom Institut Pasteur Université Paris Cité CNRS UMR 3528 Computational Structural Biology Unit Paris France Department of Biochemistry and Biophysics University of Pennsylvania PhiladelphiaPA United States Division of Pharmacy and Optometry University of Manchester Manchester United Kingdom Scuola Internazionale Superiore di Studi Avanzati-SISSA Trieste Italy Computational Biomedicine Institute of Advanced Simulations IAS-5 Institute for Neuroscience and Medicine INM-9 Forschungszentrum Jülich GmbH Jülich Germany Department of Physics and Universitätsklinikum RWTH Aachen University Aachen Germany Department of Chemistry & Chemical Biology Rutgers University PiscatawayNJ United States Istituto Italiano di Tecnologia Drug Discovery and Development Bologna Italy Lausanne Switzerland Department of Chemistry University of California RiversideCA United States Department of Medicinal Chemistry College of Pharmacy University of Utah Salt Lake CityUT United States Department of Physics University of Washington SeattleWA United States Pacific Northwest National Laboratory RichlandWA United States LIA CNRS-UIUC UMR n°7019 Université de Lorraine Vandœuvre-lès-Nancy France Department of Physics University of Illinois at Urbana-Champaign UrbanaIL United States Department of Biochemistry and Molecular Biol

The communities that embraced data archiving efforts decades ago are now, in the era of data-driven biology, those gaining the most from the AI revolution. The structural biology community was a pioneer in this regard by establishing the Protein Data Bank (PDB) in 1971 and making data accessible using the FAIR (Findable, Accessible, Interoperable and Reusable) principles even before these were articulated [1, 2]. The genomics/bioinformatics community has followed the example, establishing many widely used databases [3, 4]. By contrast, molecular simulation has been anchored in usage paradigms dating back to the seventies, when molecular dynamics (MD) simulation was first applied to study biomacromolecules [5]. At that time, MD was used by theoretical physicists and chemists in "proof of concept" simulations. Still, fifty years later, MD has evolved into a cornerstone molecular biology technique that can provide accurate quantitative analysis and property prediction. MD is now employed by tens of thousands of researchers worldwide, accounting for roughly 15% of global supercomputer usage. Unfortunately, these rich and costly data are not systematically maintained, and when further analyses are required, simulations have to be rerun-an unacceptable situation from scientific, environmental and sustainability standpoints. In this letter, we argue for a collaborative endeavor to archive MD simulation data and describe ongoing efforts to establish cost-effective and sustainable data archiving strategies. © 2024, CC BY-NC-SA.

关键词： Biotic

来源：评论

学校读者我要写书评

暂无评论

Building multiple multicast trees with Guarranteed QOS for service based routing using artificial algorithms 4th

Building multiple multicast trees with Guarranteed QOS for s...

引用

4th International Conference on Context-Aware Systems and Applications, ICCASA 2015

ISBN: (纸本)9783319292359

In Service Based Routing (SBR), data is transmitted from a source node to destination nodes are not depended on destination addresses. Hence, it is comfortable with new advanced technology as cloud computing and also flexible and reliable. Multicast routing is advanced technique to deliver data simultaneously from one source node to multiple destination nodes with QOS (quality of service). In this paper, we introduce a technique that is extended from multicast technique with multiple multicast trees that are conformed quality of service routing. This technique is based on Greedy, Ant Colony Optimization, and fuzzy logic to get optimal routes to transmit data from one source to multiple destination node very effectively. The usage of the ANT Colony optimization, Greedy, fuzzy logic algorithms to find cyclic or multiple paths routes on each trunk by multiple criterions to transmit data effectively. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Equipment Maintenance Predictive Model Based on Machine Learning

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期466卷

作者： Xiang Li Li Wei Jianfeng He Jiangxi Engineering Research Center of Process and Equipment for New Energy East China University of Technology Nanchang 330013 China School of Software East China University of Technology No.418 Guanglan Avenue Nanchang Economic and Technological Development Zone Nanchang 330013 China

Equipment replacement is a fundamental problem in the current industrial Internet of Things application and development and has very practical application significance and value. This paper takes the service life of equipment as the research object, applies machine learning theory, builds the equipment maintenance prediction model based on random forest regression on the basis of analysis and comparison, and gives the typical technology implementation and verification of the model, which has good adaptability and reference value.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Results of the research project AssiSt

引用

Journal of Physics: Conference Series 2018年第2期1037卷 022040-022040页

作者： Kühn, Timo Altmikus, Andree Daboul, Hussam Radi, Alexander Raasch, Siegfried Knigge, Christoph Böske, Lennart Schwarz, Thorsten Heister, Christoph Länger-Möller, Annika Lutz, Thorsten Weihing, Pascal Schulz, Christoph Thiemeier, Jakob Mockett, Charles Fuchs, Marian Thiele, Frank Wobben Research & Development GmbH Teerhof 59 28199 Bremen Germany Wobben Research & Development GmbH Borsigstr. 26 26607 Aurich Germany Institute of Meteorology & Climatology Leibniz University Hannover Herrenhäuser Str. 2 30419 Hannover Germany Institute of Aerodynamics and Flow Technology German Aerospace Center (DLR) Lilienthalplatz 7 38108 Braunschweig Germany Institute of Aerodynamics and Gas Dynamics University of Stuttgart Pfaffenwaldring 21 70569 Stuttgart Germany CFD Software E+F GmbH Charlottenburger Innovations Centrum (CHIC) Bismarckstraße 10-12 10625 Berlin Germany

This article gives an overview of the results of the wind energy research project AssiSt. Results of the four work packages include flow in complex terrain, wind energy converters (WEC) in complex terrain subject to atmospheric inflow, laminar-turbulent transition, generator cooling, hub aerodynamics, and passive flow control devices. Four different flow solvers (PALM, FLOWer, THETA, OpenFOAM) are in use during the course of the project depending on the corresponding problem requiring specific solver features. Key achievements of the project are the coupling of atmospheric LES (PALM) and URANS simulations of the complete WEC (FLOWer as well as THETA) in order to impose the external turbulent flow fields to the inflow of the WEC for physics resolved load simulations, numerical replication of complex flows over blades with vortex generators using OpenFOAM and efficiency-augmented pressure loss simulations on very complex industrial geometries of ENERCON’s direct drive WEC generators for precise cooling analyses. Industrial validity of all methods, model and process developments were key objectives of this research project.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Strategy for Middleman Attack Prevention in Remote Desktop Protocol

引用

Journal of Shanghai Jiaotong university(Science) 2015年第1期20卷 82-85页

作者：何泾沙徐琛张伊璇周世义 School of Software Engineering Beijing University of Technology Low Carbon Research Center Beijing Development Area Co. Ltd.

This paper introduces the middleman attack methods which are against the remote desktop protocol(RDP),discusses advantages and disadvantages of several current mainstream prevention strategies,and puts forward a new prevention *** strategy,taking advantage of the original key agreement process of the RDP,designs a piecewise authentication scheme of the key *** the strategy can achieve the purpose of prevention and detection of middleman ***,the security of the strategy is analyzed.

关键词： remote desktop protocol(RDP) key agreement middleman attack prevention and detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：