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

Cloud computing, Big Data Applications and Software Engineering (CBASE), International Conference on

作者： Yi Wei Yingxiong Nong Zhe Li Jian Pan Zhenyu Yang Xiaoqi Lu Ningjiang Chen China Tobacco Guangxi Industrial Co. Ltd Nanning China School of Computer Electronics and Information Guangxi University Nanning China School of Computer Electronics and Information Guangxi University Guangxi Intelligent Digital Services Research Center of Engineering Technology Key Laboratory of Parallel Distributed and Intelligent Computing (Guangxi University) Nanning China

To prevent the serious impact on production efficiency caused by service interruption, data loss, and other issues resulting from server faults, this paper proposes a server fault prediction model named Wavelet Packet Transform Probabilistic Neural Network(WPT-PNN). WPT-PNN loosely mixes wavelet packet transform and probabilistic neural network to achieve quick fault localization and signal denoising effects. The proposed model is validated using server operational data gathered. The experimental results suggest that the WPT-PNN model can effectively manage the challenges of complicated, non-stationary, and noisy signals in the feature extraction stage and extract signal features reliably. In the fault classification prediction stage, our method improves fault prediction accuracy to 81%, and limits the error range within [-2, 4], better matching the requirements for precise and low false-positive fault prediction in servers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Deep Belief Networks Intrusion Detection Method Based on Generative Adversarial Networks

A Deep Belief Networks Intrusion Detection Method Based on G...

引用

Artificial Intelligence, Networking and Information Technology (AINIT), International Seminar on

作者： Yi Wei Yingxiong Nong Zhe Li Jian Pan Zhenyu Yang Zezhang Zheng Ningjiang Chen China Tobacco Guangxi Industrial Co. Ltd Nanning China School of Computer Electronics and Information Guangxi University Nanning China Guangxi Intelligent Digital Services Research Center of Engineering Technology Key Laboratory of Parallel Distributed and Intelligent Computing School of Computer Electronics and Information Guangxi University (Guangxi University) Nanning China

ISBN: (数字)9798350385557

ISBN: (纸本)9798350385564

In response to the substantial threat that Internet attacks pose to data center network security, researchers have proposed several deep learning-based methods for detecting network intrusions. However, while algorithms are constantly improving in terms of accuracy, their stability in the face of insufficient attack samples is a major obstacle. To solve the issues of insufficient attack samples and low detection accuracy in network intrusion detection, this paper proposes a deep confidence network intrusion detection method G-DBN based on GAN. The model is based on the malicious sample extension of the generative adversarial network, and it can produce adversarial samples using malicious network flows as original samples. Furthermore, this paper uses deep belief network technology to create and assess the efficacy of the G-DBN model in detecting network attacks, comparing it to standard DBN models and other network intrusion detection techniques. Experimental results show that compared to the standard three-layer DBN method, the G-DBN method described in this paper improves the detection accuracy of attack samples by 6.46% and better meets the performance requirements of current practical applications.

关键词： Seminars Learning systems Data centers Accuracy Network intrusion detection Network security Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

On Implementation of a scalable wallet-size cluster computing system for multimedia applications

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3333卷 697-704页

作者： Lee, Liang-Teh Li, Kuan-Ching Yang, Chao-Tung Tseng, Chia-Ying Liu, Kang-Yuan Hung, Chih- Dept. of Computer Science and Engineering Tatung University Taipei 104 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung 433 Taiwan High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung 407 Taiwan Networks and Multimedia Institute Institute for Information Industry Taipei 106 Taiwan

In order to obtain a low-cost, low-power consumption and small sized digital home processing center, especially for multimedia applications, we propose a scalable wallet-size cluster computing system in this paper. Such system uses low-cost, low-power consumption and small sized microprocessors as computing nodes to form a cluster system. The main reason why we are interested to investigate and build such system is to increase the computing power and to accelerate the H.264 video processing. We analyzed the H.264 decoder scheme and distributed the most heavy-load computations in the decoder scheme to each computing node (or microprocessor) of the cluster system for the processing of signals, in parallel. To run multimedia applications in this cluster system, an efficient real-time video processing is implemented. © Springer-Verlag 2004.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Symmetric Encryption for Cloud Storage

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Sy...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Panyu Wu Zhenfu Cao Jiachen Shen Xiaolei Dong Yihao Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan

Since data outsourcing poses privacy concerns with data leakage, searchable symmetric encryption (SSE) has emerged as a powerful solution that enables clients to perform query operations on encrypted data while preserving their privacy. Dynamic SSE schemes have been proposed to handle update operations. However, it is shown that updates might increase the risk of information leakage. Meanwhile, to meet the requirement of real-world applications, it is desirable to have the searchable encryption scheme which supports both multiple clients and multi-keyword queries. To address these issues, this paper proposes MMDSSE, a multi-client forward secure dynamic SSE scheme that supports multi-keyword queries. MMDSSE allows the clients narrow down the results by providing an arbitrary subset of the entire archive, and thus suitable for cloud storage environment. Security analysis and experimental evaluations show that MMDSSE is secure and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The demand for consistent web-based workflow editors 8

The demand for consistent web-based workflow editors

引用

8th Workshop on Workflows in Support of Large-Scale Science, WORKS 2013

作者： Gesing, Sandra Atkinson, Malcolm Klampanos, Iraklis Galea, Michelle Berthold, Michael R. Barbera, Roberto Scardaci, Diego Terstyanszky, Gabor Kiss, Tamas Kacsuk, Peter University of Notre Dame Ctr for Research Computing University of Edinburgh Informatics Forum 111 Information Technology Center Notre DameIN46556 United States University of Edinburgh Informatics Forum EdinburghEH8 9AB United Kingdom Universität Konstanz FB Informatik and Informationswissenschaft Box 712 Konstanz78457 Germany Italian National Institute of Nuclear Physics Catania95123 Italy University of Westminster 115 New Cavendish Street LondonW1W 6UW United Kingdom Laboratory of Parallel and Distributed Systems MTA SZTAKI Kende Street 13-17 Budapest1111 Hungary

ISBN: (纸本)9781450325028

This paper identifies the high value to researchers in many disciplines of having web-based graphical editors for scientific workflows and draws attention to two technological transitions: good quality editors can now run in a browser and workflow enactment systems are emerging that manage multiple workflow languages and support multi-lingual workflows. We contend that this provides a unique opportunity to introduce multi-lingual graphical workflow editors which in turn would yield substantial benefits: workflow users would find it easier to share and combine methods encoded in multiple workflow languages, the common framework would stimulate conceptual convergence and increased workflow component sharing, and the many workflow communities could share a substantial part of the effort of delivering good quality graphical workflow editors in browsers. The paper examines whether such a common framework is feasible and presents an initial design for a web-based editor, tested with a preliminary prototype. It is not a fait accompli but rather an urgent rallying cry to explore collaboratively a generic web-based framework before investing in many divergent individual implementations.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for Highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yanlong Qiu Siqi Wang Xi Yang Xinyuan Qiu Chengkun Wu Yingbo Cui Canqun Yang Institute for Quantum Information & State Key Laboratory of High-Performance Computing College of Computer Science National University of Defense Technology Changsha P. R. China National Supercomputer Center in Tianjin Tianjin P. R. China National Key Laboratory of Parallel and Distributed Computing College of Computer Science National University of Defense Technology Changsha P. R. China Department of Biology and Chemistry College of Science National University of Defense Technology Changsha P. R. China

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词：

来源：评论

学校读者我要写书评

暂无评论

Algorithms and Architectures for parallel Processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Jesus Carretero Javier Garcia-Blas José Daniel Garcia Sánchez Victor Gergel Vladimir Voevodin Iosif Meyerov Juan A. Rico-Gallego Juan C. Díaz-Martín Pedro Alonso Juan Durillo Alexey L. Lastovetsky Fabrizio Marozzo Qin Liu Zakirul Alam Bhuiyan Karl Fürlinger Josef Weidendorfer José Gracia

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2024年

作者： Ren, Yingying Li, Qiuli Guo, Yangyang Pedrycz, Witold Xing, Lining Liu, Anfeng Song, Yanjie School of Computer Electronics and Information Guangxi University Nanning China Guangxi Key Laboratory of Multimedia Communications and Network Technology China Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University China School of Systems Science Beijing Jiaotong University Beijing China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Poland Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer Istanbul Turkey School of Electronic Engineering Xidian University Xian China School of Electronic Engineering Central South University Changsha China National Engineering Research Center of Maritime Navigation System Dalian Maritime University Dalian China

With the rapid development of the satellite industry, the information transmission network based on communication satellites has gradually become a major and important part of the future satellite ground integration network. However, the low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system and needs to be solved urgently. Effectively planning the task of satellite ground networking by reasonably scheduling resources is crucial for the efficient transmission of task data. In this paper, we hope to provide a task execution scheme that maximizes the profit of the networking task for satellite ground network planning considering feeding mode (SGNPFM). To solve the SGNPFM problem, a mixed-integer planning model with the objective of maximizing the gain of the link-building task is constructed, which considers various constraints of the satellite in the feed-switching mode. Based on the problem characteristics, we propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks. To obtain more high-quality solutions, different similarity evaluation methods are designed to assist the algorithm in intelligently screening individuals. The DSGAalso uses an adaptive crossover strategy based on similarity mechanism, which guides the algorithm to achieve efficient population search. In addition, a task scheduling algorithm considering the feed-switching mode is designed for decoding the algorithm to generate a highquality scheme. The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem. Compared to other algorithms, the proposed algorithm not only obtains higher quality planning schemes but also has faster algorithm convergence speed. The proposed algorithm improves data trans

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Foundational Competencies and Responsibilities of a Research Software Engineer

arXiv

引用

arXiv 2023年

作者： Goth, Florian Alves, Renato Braun, Matthias Castro, Leyla Jael Chourdakis, Gerasimos Christ, Simon Cohen, Jeremy Druskat, Stephan Erxleben, Fredo Grad, Jean-Noël Hagdorn, Magnus Hodges, Toby Juckeland, Guido Kempf, Dominic Lamprecht, Anna-Lena Linxweiler, Jan Löffler, Frank Martone, Michele Schwarzmeier, Moritz Seibold, Heidi Thiele, Jan Philipp Waldow, Harald von Wittke, Samantha Institute for Theoretical Physics and Astrophysics University of Würzburg Germany European Molecular Biology Laboratory Heidelberg Germany Cluster of Excellence IntCDC University of Stuttgart Germany ZB MED Information Centre for Life Sciences Cologne Germany School of Computation Information and Technology Technical University of Munich Garching Germany Institute for Parallel and Distributed Systems University of Stuttgart Stuttgart Germany Leibniz University Hannover Department of Cell Biology and Biophysics Computational Biology Germany Imperial College London London United Kingdom Institute for Software Technology Berlin Germany Humboldt-Universität zu Berlin Department of Computer Science Berlin Germany Helmholtz-Zentrum Dresden-Rossendorf Germany Institute for Computational Physics University of Stuttgart Germany Geschäftsbereich IT Charité Universitätsmedizin Berlin Germany The Carpentries United States Heidelberg University Scientific Software Center Germany Institute of Computer Science University of Potsdam Germany Technische Universität Braunschweig Germany Michael Stifel Center Jena Friedrich Schiller University Jena Germany Leibniz Supercomputing Centre Garching Germany Mathematical Modeling and Analysis TU Darmstadt Germany IGDORE Munich Germany Weierstrass Institute Berlin Germany Leibniz University Hannover Institute of Applied Mathematics Scientific Computing Hannover Germany Johann Heinrich von Thünen Institute Centre for Information Management Germany

The term Research Software Engineer, or RSE, emerged a little over 10 years ago as a way to represent individuals working in the research community but focusing on software development. The term has been widely adopted and there are a number of high-level definitions of what an RSE is. However, the roles of RSEs vary depending on the institutional context they work in. At one end of the spectrum, RSE roles may look similar to a traditional research role. At the other extreme, they resemble that of a software engineer in industry. Most RSE roles inhabit the space between these two extremes. Therefore, providing a straightforward, comprehensive definition of what an RSE does and what experience, skills and competencies are required to become one is challenging. In this community paper we define the broad notion of what an RSE is, explore the different types of work they undertake, and define a list of foundational competencies as well as values that outline the general profile of an RSE. Further research and training can build upon this foundation of skills and focus on various aspects in greater detail. We expect that graduates and practitioners will have a larger and more diverse set of skills than outlined here. On this basis, we elaborate on the progression of these skills along different dimensions. We look at specific types of RSE roles, propose recommendations for organisations, and give examples of future specialisations. An appendix details how existing curricula fit into this framework. © 2023, CC BY.

关键词： Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：