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

An improved reference point sampling method on Pareto optimal front

学校读者我要写书评

暂无评论

An improved reference point sampling method on Pareto optima...

Congress on Evolutionary Computation

作者： Cheng He Linqiang Pan Hang Xu Ye Tian Xingyi Zhang Laboratory of Image Information Processing and Intelligent Control Huazhong University of Science and Technology Wuhan Hubei China Huazhong University of Science and Technology Wuhan Hubei CN Department of Computer Science Xiamen University Xiamen Fujian China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui China

ISBN: (纸本)9781509006243

In this paper, we propose a sampling approach of reference points used for performance metrics of multi-objective evolutionary algorithms. Traditional reference point sampling methods, such as the Das and Dennis method, usually sample the reference points via a set of uniformly distributed weight vectors generated on an ideal hyper-plane in objective space, which however often ignore the geometric shape of a specific Pareto front. Therefore, we propose a novel reference point sampling approach by taking the specific shape of the Pareto optimal front to be tackled into account for measuring the performance of multi-objective evolutionary algorithms. The performance of the proposed reference point sampling method against the other two state-of-the-art sampling methods is tested on six test instances in various conditions, which clearly demonstrate the effectiveness and superiority of the proposed sampling method.

关键词： Sampling methods Shape Convergence Evolutionary computation Optimization Euclidean distance

FACOS: Enabling Privacy Protection Through Fine-Grained Access Control with On-chain and Off-chain System

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Chao Hou, Cankun Jiang, Tianyu Ning, Jianting Qiao, Hui Wu, Yusen Fujian Provincial Key Laboratory of Data Intensive Computing the Key Laboratory of Intelligent Computing and Information Processing Fujian China The School of Computer Science and Technology Xidian University Shaanxi Xi’an710071 China The Department of Computer Science University of Miami MiamiFL33146 United States College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China The Faculty of Data Science City University of Macau China

Data-driven landscape across finance, government, and healthcare, the continuous generation of information demands robust solutions for secure storage, efficient dissemination, and fine-grained access control. Blockchain technology emerges as a significant tool, offering decentralized storage while upholding the tenets of data security and accessibility. However, on-chain and off-chain strategies are still confronted with issues such as untrusted off-chain data storage, absence of data ownership, limited access control policy for clients, and a deficiency in data privacy and auditability. To solve these challenges, we propose a permissioned blockchain-based privacy-preserving fine-grained access control on-chain and off-chain system, namely FACOS. We applied three fine-grained access control solutions and comprehensively analyzed them in different aspects, which provides an intuitive perspective for system designers and clients to choose the appropriate access control method for their systems. Compared to similar work that only stores encrypted data in centralized or non-fault-tolerant IPFS systems, we enhanced off-chain data storage security and robustness by utilizing a highly efficient and secure asynchronous Byzantine fault tolerance (BFT) protocol in the off-chain environment. As each of the clients needs to be verified and authorized before accessing the data, we involved the Trusted Execution Environment (TEE)-based solution to verify the credentials of clients. Additionally, our evaluation results demonstrated that our system1 offers better scalability and practicality than other state-of-the-art designs. We deployed our system on Alibaba Cloud and Tencent Cloud and conducted multiple evaluations. The results indicate that it takes about 2.79 seconds for a client to execute the protocol for uploading and about 0.96 seconds for downloading. Compared to other decentralized systems, our system exhibits efficient latency for both download and upload operations.

关键词： Access control

Anatomy of an online misinformation network

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shao, Chengcheng Hui, Pik-Mai Wang, Lei Jiang, Xinwen Flammini, Alessandro Menczer, Filippo Ciampaglia, Giovanni Luca College of Computer National University of Defense Technology China School of Informatics Computing and Engineering Indiana University Bloomington United States MOE Key Laboratory of Intelligent Computing and Information Processing Xiangtan University China Indiana University Network Science Institute Bloomington United States

Massive amounts of fake news and conspiratorial content have spread over social media before and after the 2016 US Presidential Elections despite intense fact-checking efforts. How do the spread of misinformation and fact-checking compete? What are the structural and dynamic characteristics of the core of the misinformation diffusion network, and who are its main purveyors? How to reduce the overall amount of misinformation? To explore these questions we built Hoaxy, an open platform that enables large-scale, systematic studies of how misinformation and fact-checking spread and compete on Twitter. Hoaxy filters public tweets that include links to unverified claims or fact-checking articles. We perform k-core decomposition on a diffusion network obtained from two million retweets produced by several hundred thousand accounts over the six months before the election. As we move from the periphery to the core of the network, fact-checking nearly disappears, while social bots proliferate. The number of users in the main core reaches equilibrium around the time of the election, with limited churn and increasingly dense connections. We conclude by quantifying how effectively the network can be disrupted by penalizing the most central nodes. These findings provide a first look at the anatomy of a massive online misinformation diffusion network. Copyright © 2018, The Authors. All rights reserved.

关键词： Social networking (online)

Gaf-Net: Graph Attention Fusion network for Multi-View Semi-Supervised Classification

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Song, Na Du, Shide Wu, Zhihao Zhong, Luying Wang, Shiping School of Computer Science and Technology Hainan University Hainan570228 China School of Mechanical Electrical and Information Engineering Putian University Putian351100 China College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

Multi-view semi-supervised classification is a typical task to classify data using a small amount of supervised information, which has attracted a lot of attention from researchers in past years. In practice, existing methods focus more on extracting spatial or spectral features using graph convolutional neural networks without considering the diversity and variability of graph structures and the contributions of different views. To address this challenge, a network framework termed graph attention fusion network is proposed, which is comprised of two phases: view-specific feature embedding and graph embedding fusion. In the former feature extraction stage, view-specific feature embedding module can flexibly focus on the neighborhood calculation operation to learn a weight for each neighboring node. In the latter feature fusion stage, the graph embedding fusion module is performed by complementarity and consistency to fuse these embeddings for semi-supervised classification tasks. We conduct extensive experiments in terms of semi-supervised classification on real-world datasets to validate the superiority of the proposed method over various existing state-ofthe-art methods. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

Fair and autonomous sharing of federate learning models in mobile Internet of Things

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hao, Xiaohan Ren, Wei Xiong, Ruoting Zheng, Xianghan Zhu, Tianqing Xiong, Neal N. School of Computer Science China University of Geoscience Wuhan China Guangxi Key Laboratory of Cryptography and Information Security Guilin541004 China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Mingbyte Technology QingDao China School of Software University of Technology Sydney UltimoNSW2007 Australia Dept. of Mathematics and Computer Science Northeastern State University United States

Federate learning can conduct machine learning as well as protect the privacy of self-owned training data on corresponding ends, instead of having to upload to a central trusted data aggregation server. In mobile scenarios, a centralized trusted server may not be existing, and even though it exists, the delay will not be manageable, e.g., smart driving cars. Thus, mobile federate learning at the edge with privacy-awareness is attracted more and more attentions. It then imposes a problem - after data are trained on a mobile terminal to obtain a learned model, how to share the model parameters among others to create more accurate and robust accumulative final model. This kind of model sharing confronts several challenges, e.g., the sharing must be conducted without a third trusted party (autonomously), and the sharing must be fair as model training (by training data)is valuable. To tackle the above challenges, we propose a smart contract and IPFS (Inter-Planetary File System) based model sharing protocol and algorithms to address the challenges. The proposed protocol does not rely on a trusted third party, where individual-learned models are shared/stored in corresponding ends. Conducted through extensive experiments, three main steps of the proposed protocol are evaluated. The average executive time of the three steps are 0.059s, 0.060s and 0.032s, demonstrating its efficiency. Copyright © 2020, The Authors. All rights reserved.

关键词： Smart contract

Label Distribution Feature Selection Based on Neighborhood Rough Set

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Wu, Yilin Guo, Wenzhong Lin, Yaojin College of Computer and Data Science Fuzhou University Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Minnan Normal University Zhangzhou363000 China

In label distribution learning, an instance is involved with many labels in different importance degrees, and the feature space of instances is accompanied with thousands of redundant and/or irrelevant features. Therefore, the main characteristic of feature selection in label distribution learning is to evaluate the discriminable ability of each feature. Motivated by neighborhood rough set, which can be used to measure the dependency degree of feature via constructing neighborhood relations on feature space and label space, respectively, this paper proposes a novel lable distribution feature selection method. In this paper, the neighborhood class of instance in label distribution space is defined, which is beneficial to recognize the logical class of target instance. Then, a new neighborhood rough set model for label distribution learning is proposed. Specially, the dependency degree of feature combining label weight is defined. Finally, a label distribution feature selection based on neighborhood rough set is presented. Extensive experiments on 12 data sets show the effectiveness of the proposed algorithm. © 2024, The Authors. All rights reserved.

关键词： Feature Selection

Risk Management Using Big Real Time Data

学校读者我要写书评

暂无评论

Risk Management Using Big Real Time Data

IEEE International Conference on Cloud computing Technology and Science (CloudCom)

作者： Jie Cheng Chunming Rong Huijuan Ye Xianghan Zheng Department of Electrical Engineering and Computer Science Risk Management Using Big Real Time Data Department of Computer Science and Electronic Engineering University of Stavanger Stavanger Norway College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

Adding to societal changes today, are the miscellaneous big data produced in different fields. Coupled with these data is the appearance of risk management. Admittedly, to predict future trend by using these data is conducive to make everything more efficient and easy. Now, no matter companies or individuals, they increasingly focus on identifying risks and managing them before risks. Effective risk management will lead them to deal with potential problems. This thesis focuses on risk management of flight delay area using big real time data. It proposes two different prediction models, one is called General Long Term Departure Prediction Model and the other is named as Improved Real Time Arrival Prediction Model. By studying the main factors lead to flight delay, this thesis takes weather, carrier, National Aviation System, security and previous late aircraft as analysis factors. By utilizing our models can do not only long time but also short term flight delay predictions. The results demonstrate goodness of fit. Besides the theory part, it also presents a practical and beautiful web application for real time flight arrival prediction based on our second model.

关键词： Delays Biological system modeling Meteorology Atmospheric modeling Predictive models Airports Splines (mathematics)

A Cost-Driven Fuzzy Scheduling Strategy for intelligent Workflow Decision Making Systems in Uncertain Edge-Cloud Environments

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Lin, Bing Lin, Chaowei Chen, Xing College of Physics and Energy Fujian Normal University Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China School of Computer Science Peking University 100871 China College of Mathematics and Computer Science Fuzhou University Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China

Workflow decision making is critical to performing many practical workflow applications. Scheduling in edge-cloud environments can address the high complexity problem of workflow applications, while decreasing the data transmission delay between the cloud and end devices. However, because of the heterogeneous resources in edge-cloud environments and the complicated data dependencies among the tasks in a workflow, significant challenges for workflow scheduling remain, including the selection of an optimal tasks-servers solution from the possible numerous combinations. The existing studies have been mainly done subject to rigorous conditions without fluctuations, ignoring the fact that workflow scheduling is typically present in uncertain environments. In this study, we focus on reducing the execution cost of workflow applications mainly caused by task computation and data transmission, while satisfying the workflow deadline in uncertain edge-cloud environments. The Triangular Fuzzy Numbers (TFNs) are adopted to represent the task processing time and data transferring time. A cost-driven fuzzy scheduling strategy based on an Adaptive Discrete Particle Swarm Optimization (ADPSO) algorithm is proposed, which employs the operators of Genetic Algorithm (GA). This strategy introduces the randomly two-point crossover operator, neighborhood mutation operator, and adaptive multipoint mutation operator of GA to effectively avoid converging on local optima. The experimental results show that our strategy can effectively reduce the workflow execution cost in uncertain edge-cloud environments, compared with other benchmark solutions. Copyright © 2021, The Authors. All rights reserved.

关键词： Decision making

Interpretable multi-view attention network for drug-drug interaction prediction

学校读者我要写书评

暂无评论

Interpretable multi-view attention network for drug-drug int...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xuan Lin Qi Wen Sijie Yang Zu-Guo Yu Yahui Long Xiangxiang Zeng College of Computer Science Xiangtan University China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University China Singapore Immunology Network (SIgN) Agency for Science Technology and Research(A*STAR) Singapore College of Information Science and Engineering Hunan University China

Drug-drug interaction (DDI) plays an increasingly crucial role in drug discovery. Predicting potential DDI is also essential for clinical research. Given the high cost and risk of wet-lab experiments, in-silico DDI prediction is an alternative choice. Recently, deep learning methods have been developed for DDI prediction. However, most of existing methods focus on feature extraction from either molecular SMILES sequences or drug interactive networks, ignoring the valuable complementary information that can be derived from these two views. In this paper, we propose a novel interpretable Multi-View Attention network (MVA-DDI) for DDI prediction. MVA-DDI can effectively extracts drug representations from different perspectives to improve DDI prediction. Specifically, for a given drug, we design a transformer-based encoder and a graph convolutional networkbased encoder to learn sequence and graph representations from SMILES sequence and molecular graph, respectively. To fully exploit the complementary information between the sequence and molecular views, an attention mechanism is further adopted to adaptively aggregate the sequence and graph representations by taking the importance of different views into accounts, generating the final drug representations. Comparison experiments demonstrated that our MVA-DDI 1 model achieved superior performance to state-of-the-art models on DDI prediction.

关键词：