检索结果-南通市图书馆

A proof system of the CaIT calculus

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第2期18卷 123-137页

作者： Ningning CHEN Huibiao ZHU Shanghai Key laboratory of Trustworthy computing East China Normal UniversityShanghai 200062China

The Internet of Things(IoT)can realize the interconnection of people,machines,and things anytime,*** of the existing research mainly focuses on the practical applications of IoT,and there is a lack of research on modeling and reasoning about IoT systems from the perspective of formal ***,the Calculus of the Internet of Things(CaIT)has been proposed to specify and analyze IoT systems before the actual implementation,which can effectively improve development efficiency,and enhance system quality and *** verify the correctness of IoT systems described by CaIT,this paper presents a proof system for CaIT,in which specifications and verifications are based on the extended Hoare Logic with ***,we explore the cooperation between isolated proofs to validate the postconditions of the communication actions occurring in these proofs,with a particular focus on broadcast *** also demonstrate the soundness of our proof system.A simple“smart home”is given to illustrate the availability of our proof system.

关键词： Internet of Things(loT) Calculus of the Internet of Things(CalT) extended hoare logic cooperation smart home

Privacy Preserving Algorithm for Spectrum Sensing in Cognitive Vehicle Networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 30-42页

作者： Hongning LI Tonghui HU Jiexiong CHEN Xiuqiang WU Qingqi PEI Guangzhou Institute of Technology Xidian University Guangzhou CEPREI Shaanxi Key laboratory of Blockchain and Secure computing

The scarcity of spectrum resources fails to meet the increasing throughput demands of vehicular networks. There is an urgent need to maximize the utilization of spectrum bands in mobile networks. To ascertain the availability of spectrum bands, users should engage in wireless channel sensing and collaboration. However, spectrum sensing data always involves users’ privacy, such as their location. This paper first introduces sensing trajectory inference attack in cognitive vehicular networks and then proposes a data confusion-based privacy-preserving algorithm and a cryptonym array-based privacy-preserving aggregation scheme for spectrum sensing in cognitive vehicular networks. Unlike existing methods, the proposed schemes transmit confused data during the aggregation process. This deliberate obfuscation makes it almost impossible to infer users’ location from the transmitted data. The analysis demonstrates the resilience of the proposed schemes against sensing trajectory inference attack.

关键词： Privacy Data privacy Wireless sensor networks Authentication Data aggregation Throughput Inference algorithms

Extracting Integrated Features of Electronic Medical Records Big Data for Mortality and Phenotype Prediction

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第3期33卷 776-792页

作者： Fei LI Yiqiang CHEN Yang GU Yaowei WANG Institute of computing Technology University of Chinese Academy of Sciences Pengcheng laboratory

The key to synthesizing the features of electronic medical records(EMR) big data and using them for specific medical purposes,such as mortality and phenotype prediction,is to integrate the individual medical event and the overall multivariate time series feature extraction automatically,as well as to alleviate data imbalance *** paper provides a general feature extraction method to reduce manual intervention and automatically process large-scale *** processing uses two variational auto-encoders(VAEs) to automatically extract individual and global *** avoids the well-known posterior collapse problem of Transformer VAE through a uniquely designed "proportional and stabilizing" mechanism and forms a unique means to alleviate the data imbalance *** conducted experiments using ICU-STAY patients' data from the MIMIC-Ⅲ database and compared them with the mainstream EMR time series processing *** results show that the method extracts visible and comprehensive features,alleviates data imbalance problems and improves the accuracy in specific predicting tasks.

关键词： Databases Time series analysis MIMICs Manuals Big Data Feature extraction Transformers

Combo Packet:An Encryption Traffic Classification Method Based on Contextual Information

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 1223-1243页

作者： Yuancong Chai Yuefei Zhu Wei Lin Ding Li State Key laboratory of Mathematical Engineering and Advanced computing Information Engineering UniversityZhengzhou450001China

With the increasing proportion of encrypted traffic in cyberspace, the classification of encrypted traffic has becomea core key technology in network supervision. In recent years, many different solutions have emerged in this *** methods identify and classify traffic by extracting spatiotemporal characteristics of data flows or byte-levelfeatures of packets. However, due to changes in data transmission mediums, such as fiber optics and satellites,temporal features can exhibit significant variations due to changes in communication links and transmissionquality. Additionally, partial spatial features can change due to reasons like data reordering and *** with these challenges, identifying encrypted traffic solely based on packet byte-level features is significantlydifficult. To address this, we propose a universal packet-level encrypted traffic identification method, ComboPacket. This method utilizes convolutional neural networks to extract deep features of the current packet andits contextual information and employs spatial and channel attention mechanisms to select and locate effectivefeatures. Experimental data shows that Combo Packet can effectively distinguish between encrypted traffic servicecategories (e.g., File Transfer Protocol, FTP, and Peer-to-Peer, P2P) and encrypted traffic application categories (e.g.,BitTorrent and Skype). Validated on the ISCX VPN-non VPN dataset, it achieves classification accuracies of 97.0%and 97.1% for service and application categories, respectively. It also provides shorter training times and higherrecognition speeds. The performance and recognition capabilities of Combo Packet are significantly superior tothe existing classification methods mentioned.

关键词： Encrypted traffic classification packet-level convolutional neural network attention mechanisms

TULAM:trajectory-user linking via attention mechanism

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第1期67卷 51-68页

作者： Hao LI Shuyu CAO Yaqing CHEN Min ZHANG Dengguo FENG Trusted computing and Information Assurance laboratory Institute of SoftwareChinese Academy of Sciences university of Chinese Academy of Sciences

Recently,the application of location-based services(LBS) has become a prevalent means to provide convenience in customers’ everyday ***,because massive volumes of location information are collected by LBS applications,users may suffer from serious privacy *** studies have shown that the identities of users can be inferred from historical anonymous trajectories,which is formulated as the trajectory-user linking(TUL) *** some recurrent neural network(RNN)-based models have been proposed to capture implicit movement patterns among trajectories to improve TUL performance,they cannot learn the sequential and contextual semantics within any individual trajectory completely,leaving the advantages of RNNs *** therefore propose an RNN model with an attention mechanism called TULAM to improve the accuracy of the TUL *** learns sequential relationships within individual trajectories via RNN and captures contextual semantics from trajectories via a multi-head attention ***,we propose a novel location encoding method called approximate one-hot to solve the corpus shortage problem of trajectory *** were conducted on real datasets from the Gowalla and Foursquare LBS *** experimental results indicate that TULAM is a practical solution that achieves significant improvements over existing methods with satisfactory model complexity and convergence.

关键词： information security data security and privacy trajectory-user linking deep learning recurrent neural network attention mechanism

Wavelet-domain feature decoupling for weakly supervised multi-object tracking

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第8期67卷 339-340页

作者： Yu-Lei LI Yan YAN Yang LU Hanzi WANG Fujian Key laboratory of Sensing and computing for Smart City School of InformaticsXiamen University

Multi-object tracking(MOT) aims to discover interesting foreground targets and meanwhile generate robust trajectories of these targets with different data association algorithms based on identity embedding features(Re-ID features) [1] or motion cues [2]. During the past few decades,some advanced MOT methods have achieved considerable progress due to their wide range of applications in modern autonomous driving and intelligent video analysis.

关键词： Tracking (position)

同方期刊数据库

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

在线全文

学校读者我要写书评

暂无评论

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

作者： Keyu Zhong Fen Xiao Xieping Gao Key laboratory of computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key laboratory of Intelligent computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

The quantum Ising model for perfect matching and solving it with variational quantum eigensolver

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第9期67卷 306-320页

作者： Qilin ZHENG Pingyu ZHU Chao WU Miaomiao YU Weihong LUO Ping XU Institute for Quantum Information and State Key laboratory of High Performance computing College of Computer Science and Technology National University of Defense Technology Hefei National laboratory

Obtaining all perfect matchings of a graph is a tough problem in graph theory, and its complexity belongs to the #P-Complete class. The problem is closely related to combinatorics, marriage matching problems, dense subgraphs, the Gaussian boson sampling, chemical molecular structures, and dimer *** this paper, we propose a quadratic unconstrained binary optimization formula of the perfect matching problem and translate it into the quantum Ising model. We can obtain all perfect matchings by mapping them to the ground state of the quantum Ising Hamiltonian and solving it with the variational quantum eigensolver. Adjusting the model's parameters can also achieve the maximum or minimum weighted perfect matching. The experimental results on a superconducting quantum computer of the Origin Quantum computing Technology Company show that our model can encode 2~n dimensional optimization space with only O（n） qubits consumption and achieve a high success probability of the ground state corresponding to all perfect matchings. In addition, the further simulation results show that the model can support a scale of more than 14 qubits, effectively resist the adverse effects of noise, and obtain a high success probability at a shallow variational depth. This method can be extended to other combinatorial optimization problems.

关键词： perfect matching Ising model quantum Hamiltonian variational quantum eigensolver quadratic unconstrained binary optimization