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

Building a Private Cloud Based on Microservices for Computer Science laboratory in Universities

学校读者我要写书评

暂无评论

Building a Private Cloud Based on Microservices for Computer...

International Conference on Information Science and Control engineering (ICISCE)

作者： Hao Liu Zhe Wang Lan Huang Kangping Wang School of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun China

Computer science labs in universities have different demands in cloud computing compared with typical IT companies. They differ greatly in software requirements and resource utilization. As an instance, we propose building a private cloud based on microservices with Docker and Kubernetes in our laboratory to match our labs’ typical *** private cloud proposed in this paper is composed of multiple components such as authentication, service gateway, distributed storage, knowledge management, code management, etc. Furthermore, some typical research software systems are deployed as microservices in the private cloud. To satisfy complex software environment requirements, a multi version microservice is implemented. In our microservices platform, users can submit their own microservices and manage these microservices’ life cycle through a web interface. In addition, the platform will automatically start and stop low frequency services to improve resource utilization rate. We use laboratory resources to conduct experiments and build a platform. With deploying the platform in our laboratory, it shows that the platform meets most of typical demands in research work and improves research efficiency.

关键词： Computer science Cloud computing Information science Control engineering Buildings Companies Logic gates

Grid Partition and Agglomeration for Bidirectional Hierarchical Clustering 2nd

学校读者我要写书评

暂无评论

Grid Partition and Agglomeration for Bidirectional Hierarchi...

2nd EAI International Conference on Security and Privacy in New Computing Environments, SPNCE 2019

作者： Wu, Lei Chen, Hechang Yu, Xiangchun Chao, Sun Yu, Zhezhou Dou, RuiTing College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)9783030213725

Clustering is an important data processing tool, which can be used to reveal the distribution structure of unfamiliar domain data, or as preprocess methods to magnify data object to accelerate subsequent processing or simplify models. However, the distribution of many real-world data in feature space is very complex or uneven. Besides, the similarity/distance is not easy to be properly defined in feature space with different dimensional quantity. Therefore, many existing clustering algorithms are not stable in real datasets, and better performance of different datasets relies on artificial special design, such as scale normalization. In this paper, we propose a bidirectional hierarchical clustering (BHC) algorithm with two phases. In the first phase (Top-down), based on the probability density function of data in different dimensions, the feature space is divided into over-segmented grids to adapt to the complex distribution of data. In the second phase (Bottom-up), based on statistical information, a robust distance instead of geometrical distance is defined to agglomerate the grids into a dendrogram. Compared with the individual data points, grids created in the first phase can carry more statistical information, and the magnified processing objects can accelerate the clustering process. The second phase enhances the algorithm’s ability by the ability of recognize arbitrary shape data clusters. The effectiveness of BHC is compared with 20 popular or recent clustering algorithms on 8 artificial datasets and 6 real-world datasets. And the results show that our algorithm can achieve good results on most datasets. In particular, BHC surpasses all the comparison algorithms involved in the experiment on all real-world datasets. In addition, in order to test the efficiency of the algorithm, we design an experiment which can test the influence of dimension and data size on the operation time. © 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommuni

关键词： Clustering algorithms

A new SAT Encoding Scheme for Exactly-one Constraints 5

学校读者我要写书评

暂无评论

A new SAT Encoding Scheme for Exactly-one Constraints

5th Annual International Conference on Network and Information Systems for Computers, ICNISC 2019

作者： Cai, Jiatong Su, Yating Yang, Xixi Min, Jionghao Lai, Yong College of Software Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

Exactly-one constraints have comprehensive applications for the fields of artificial intelligence and operations research. For many encoded SAT problems generated by the existing encoding schemes of exactly-one constraints, the state-of-the-art knowledge compilers cannot complete compilation. In this paper, we propose a new encoding scheme of exactly-one constraints. We introduce two-dimensional auxiliary variables (represented as a matrix) to denote the constraint that exactly one of some variables can be assigned as true. The clauses generated by our scheme is significantly less than those generated by three other existing encoding schemes. The experimental results on the exact cover problems show that the encoded CNF formulas generated by our scheme requires less compilation time, compared with the other three coding schemes. © Published under licence by IOP Publishing Ltd.

关键词： Operations research

PepHarmony: A Multi-View Contrastive Learning Framework for Integrated Sequence and Structure-Based Peptide Encoding

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Ruochi Wu, Haoran Liu, Chang Li, Huaping Wu, Yuqian Li, Kewei Wang, Yifan Deng, Yifan Chen, Jiahui Zhou, Fengfeng Gao, Xin Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Jilin Changchun130012 China Syneron Technology Guangzhou510700 China Beijing Life Science Academy Beijing102209 China School of Biomedical Sciences LKS Faculty of Medicine The University of Hong Kong Hong Kong Thuwal23955 Saudi Arabia Thuwal23955 Saudi Arabia College of Software Jilin University Jilin Changchun130012 China College of Computer Science and Technology Jilin University Jilin Changchun130012 China

Recent advances in protein language models have catalyzed significant progress in peptide sequence representation. Despite extensive exploration in this field, pre-trained models tailored for peptide-specific needs remain largely unaddressed due to the difficulty in capturing the complex and sometimes unstable structures of peptides. This study introduces a novel multi-view contrastive learning framework PepHarmony for the sequence-based peptide encoding task. PepHarmony innovatively combines both sequence- and structure-level information into a sequence-level encoding module through contrastive learning. We carefully select datasets from the Protein Data Bank (PDB) and AlphaFold database to encompass a broad spectrum of peptide sequences and structures. The experimental data highlights PepHarmony's exceptional capability in capturing the intricate relationship between peptide sequences and structures compared with the baseline and fine-tuned models. The robustness of our model is confirmed through extensive ablation studies, which emphasize the crucial roles of contrastive loss and strategic data sorting in enhancing predictive performance. The proposed PepHarmony framework serves as a notable contribution to peptide representations, and offers valuable insights for future applications in peptide drug discovery and peptide engineering. We have made all the source code utilized in this study publicly accessible via GitHub at https://***/zhangruochi/PepHarmony or http://***/supp/. © 2024, CC BY-NC-ND.

关键词： Peptides

Reducing Fault-tolerant Overhead for Distributed Stream Processing with Approximate Backup

学校读者我要写书评

暂无评论

Reducing Fault-tolerant Overhead for Distributed Stream Proc...

International Conference on Computer Communications and Networks (ICCCN)

作者： Yuan Zhuang Xiaohui Wei Hongliang Li Mingkai Hou Yundi Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (数字)9781728166070

ISBN: (纸本)9781728166087

The stream processing model continuously processes online data in an on-pass fashion that can be more vulnerable to failures than other offline-data processing schemes. Checkpoint-based fault-tolerant methods have been widely used to enhance the reliability of stream processing systems. To ensure exact data recoveries upon failures, full-backup mechanisms are used to store a complete copy of data, which introduces substantial runtime overhead and increases output latency. In the meantime, a wide range of online processing applications prefer quick-and-dirty results with a slight degradation inaccuracy to delayed exact results. This paper introduces a novel approximate fault-tolerant problem (OAFP) with the objective of reducing the failure-free fault-tolerant overhead and ensuring user-defiled output accuracy requirement upon failure at the same time. We present an approximate fault-tolerant scheme based on sampling backup mechanism and study the trade-off between fault-tolerant overhead and output accuracy in stream processing systems. We proposed two algorithms to compute backup plans for both single-node failure and correlated failure scenarios. Extensive experiments with different types of stream topologies are conducted on our simulator to verify the correctness and effectiveness of our approach. We prove our solution guarantees the output accuracy requirement with minimum FT latency for directed acyclic graph (DAG) stream topologies with single-node failures.

关键词： Task analysis Fault tolerance Fault tolerant systems Topology Checkpointing computational modeling Data models

Using prior knowledge to guide BERT's attention in semantic textual matching tasks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xia, Tingyu Tian, Yuan Wang, Yue Chang, Yi School of Artificial Intelligence Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University China School of Information and Library Science University of North Carolina Chapel Hill United States International Center of Future Science Jilin University China

We study the problem of incorporating prior knowledge into a deep Transformer-based model, i.e., Bidirectional Encoder Representations from Transformers (BERT), to enhance its performance on semantic textual matching tasks. By probing and analyzing what BERT has already known when solving this task, we obtain better understanding of what task-specific knowledge BERT needs the most and where it is most needed. The analysis further motivates us to take a different approach than most existing works. Instead of using prior knowledge to create a new training task for fine-tuning BERT, we directly inject knowledge into BERT’s multi-head attention mechanism. This leads us to a simple yet effective approach that enjoys fast training stage as it saves the model from training on additional data or tasks other than the main task. Extensive experiments demonstrate that the proposed knowledge-enhanced BERT is able to consistently improve semantic textual matching performance over the original BERT model, and the performance benefit is most salient when training data is scarce. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

UAV Swarm-enabled Collaborative Secure Relay Communications with Time-domain Colluding Eavesdropper

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Chuang Sun, Geng Wu, Qingqing Li, Jiahui Liang, Shuang Niyato, Dusit Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China Pillar of Engineering Systems and Design Singapore University of Technology and Design 487372 Singapore The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) as aerial relays are practically appealing for assisting Internet of Things (IoT) network. In this work, we aim to utilize the UAV swarm to assist the secure communication between the micro base station (MBS) equipped with the planar array antenna (PAA) and the IoT terminal devices by collaborative beamforming (CB), so as to counteract the effects of collusive eavesdropping attacks in time-domain. Specifically, we formulate a UAV swarm-enabled secure relay multi-objective optimization problem (US2RMOP) for simultaneously maximizing the achievable sum rate of associated IoT terminal devices, minimizing the achievable sum rate of the eavesdropper and minimizing the energy consumption of UAV swarm, by jointly optimizing the excitation current weights of both MBS and UAV swarm, the selection of the UAV receiver, the position of UAVs and user association order of IoT terminal devices. Furthermore, the formulated US2RMOP is proved to be a non-convex, NP-hard and large-scale optimization problem. Therefore, we propose an improved multi-objective grasshopper algorithm (IMOGOA) with some specific designs to address the problem. Simulation results exhibit the effectiveness of the proposed UAV swarm-enabled collaborative secure relay strategy and demonstrate the superiority of IMOGOA. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

Understanding the Runtime Overheads of Deep Learning Inference on Edge Devices

学校读者我要写书评

暂无评论

Understanding the Runtime Overheads of Deep Learning Inferen...

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Xiu Ma Guangli Li Lei Liu Huaxiao Liu Xiaobing Feng College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China SKL of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

With the growing ubiquity of the Internet of Things, in-the-edge inference of deep neural network models has been a major driver for promoting the widespread use of intelligent applications. As model inference characteristics are crucial for optimizing and deploying deep neural networks on hardware platforms, many studies focus on analyzing the performance of neural networks such as latency, accuracy, throughput, and energy consumption. However, few existing works have ever discussed the runtime overheads hidden in neural network inference, despite the overheads are non-negligible for edge applications. The lack of in-depth analysis of the overheads hinders the understanding of how hardware designs and model structures impact on-device inference performance. In this paper, we characterize the runtime overheads of deep learning inference on representative edge devices by leveraging state-of-the-art neural network models, performing a systematical analysis from the perspective of end-to-end performance, hardware platforms, memory bandwidth, and neural network model structures. Based on experimental results, the crucial insights are offered to facilitate the design and configure of resource-efficient networks and pick appropriate models on the specific platform, which provides a comprehensive view of runtime overheads of in-the- edge neural network inference for architects and developers.

关键词： Deep learning Performance evaluation Analytical models Runtime Roads Neural networks Throughput

Joint Task Offloading and Resource Allocation in Aerial-Terrestrial UAV Networks with Edge and Fog Computing for Post-Disaster Rescue

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sun, Geng He, Long Sun, Zemin Wu, Qingqing Liang, Shuang Li, Jiahui Niyato, Dusit Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The School of Information Science and Technology Northeast Normal University Changchun130024 China Pillar of Engineering Systems and Design Singapore University of Technology and Design 487372 Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) play an increasingly important role in assisting fast-response post-disaster rescue due to their fast deployment, flexible mobility, and low cost. However, UAVs face the challenges of limited battery capacity and computing resources, which could shorten the expected flight endurance of UAVs and increase the rescue response delay during performing mission-critical tasks. To address this challenge, we first present a three-layer post-disaster rescue computing architecture by leveraging the aerial-terrestrial edge capabilities of mobile edge computing (MEC) and vehicle fog computing (VFC), which consists of a vehicle fog layer, a UAV client layer, and a UAV edge layer. Moreover, we formulate a joint task offloading and resource allocation optimization problem (JTRAOP) with the aim of maximizing the time-average system utility. Since the formulated JTRAOP is proved to be NP-hard, we propose an MEC-VFC-aided task offloading and resource allocation (MVTORA) approach, which consists of a game theoretic algorithm for task offloading decision, a convex optimization-based algorithm for MEC resource allocation, and an evolutionary computation-based hybrid algorithm for VFC resource allocation. Simulation results validate that the proposed approach can achieve superior system performance compared to the other benchmark schemes, especially under heavy system workloads. Copyright © 2023, The Authors. All rights reserved.

关键词： Fog computing