检索结果-南通市图书馆

A proof system of the CaIT calculus

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

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

作者： Ningning CHEN Huibiao ZHU shanghai {1. 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

Partially-hiding functional encryption for degree-2 polynomials with fine-grained access control

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第3期18卷 231-233页

作者： Haifeng QIAN Cheng LIN Qiaohan CHU Jie CHEN shanghai {1. laboratory of trustworthy computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

1.Introduction Boneh et al.[1.first systematically introduce the concept of Functional Encryption(FE)which overcomes all-or-nothing limitation of traditional public key ***,FE hides a potential problem:even if the secret key is obtained legitimately,once it is released,it can be used *** leads to that the secret key may leak information *** deal with this problem and make FE more practical,Abdalla et al.[2]recently constructed inner-product FE(IPFE)with fine-grained access control achieving strong security guarantees under standard assumptions.

关键词： grain Encryption encryption

EMPSI:Efficient multiparty private set intersection(with cardinality)

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第1期18卷 199-213页

作者： Yunbo YANG Xiaolei DONG Zhenfu CAO Jiachen SHEN Ruofan LI Yihao YANG Shangmin DOU shanghai {1. laboratory of trustworthy computing East China Normal UniversityShanghai 200062China Kunyao Academy of shanghai Kunyao Network Technology Co. Ltd.Shanghai 201203China PwC US Advisory shanghai AC Shanghai 200233China

Multiparty private set intersection(PSI)allows several parties,each holding a set of elements,to jointly compute the intersection without leaking any additional *** the development of cloud computing,PSI has a wide range of applications in privacy ***,it is complex to build an efficient and reliable scheme to protect user *** address this issue,we propose EMPSI,an efficient PSI(with cardinality)protocol in a multiparty *** avoids using heavy cryptographic primitives(mainly rely on symmetric-{1. encryption)to achieve better *** addition,both PSI and PSI with the cardinality of EMPSI are secure against semi-honest adversaries and allow any number of colluding clients(at least one honest client).We also do experiments to compare EMPSI with some state-of-the-art *** experimental results show that proposed EMPSI(-CA)has better performance and is scalable in the number of clients and the set size.

关键词： intersection cardinal primitive

Global Optimization for Heilbronn Problem of Convex Polygons Based on Bilinear Matrix Inequalities Solving

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2024年

作者： QI Niuniu DEHBI Lydia LIU Banglong YANG Zhengfeng ZENG Zhenbing shanghai {1. laboratory of trustworthy computing East China Normal University Department of Mathematics Shanghai University

This paper primarily focuses on solving the Heilbronn problem of convex polygons,which involves minimizing the area of a convex polygon P1.2···P_n while satisfying the condition that the areas of all triangles formed by consecutive vertices are equal to 1.*** problem is reformulated as a polynomial optimization problem with a bilinear objective function and bilinear constraints.A new method is presented to verify the upper and lower bounds for the optimization *** upper bound is obtained by the affine regular *** Bilinear Matrix Inequalities （BMI） theory and the branch-and-bound technique are used to verify the lower bound of the *** paper concludes by proving that the lower bound for the area minimization problem of a convex polygon with1. vertices is *** relative error compared to the global optimum is 0.1.4%.

关键词：

Theoretical and Experimental Performance Analysis on Error-Bounded Quantum Search Process

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2024年

作者： FU Jianling XU Ming QIAN Haifeng LI Zhibin shanghai Institute for AI Education East China Normal University shanghai {1. laboratory of trustworthy computing East China Normal University

Grover's algorithm(a. k. a. quantum search process) is one of the most distinguished quantum algorithms, addressing the fundamental problem — How to find goal records from a huge but unstructured database efficiently. It can achieve a relatively optimal success probability after a few Grover iterations for amplitude amplification, which results in a quadratic speed-up in the whole process in terms of the size of database. However, it does not guarantee to achieve that probability within a user-specified error tolerance. So error-bounded quantum search process comes into being. The existing methods introduce extra qubits to meet that tolerance, or exploit high-precision(nonbasic) gates,each of which would be converted to a sequence of basic gates and thus costs much more computational units. In this paper, the authors employ the strategy of performing more Grover iterations expecting one of a series of local optima to meet the tolerance. To ensure that it works rigorously, the authors identify and exclude three exceptional instances by algebraic number theory, which is reported for the first time. Then the authors analyze the theoretical complexity of the employed method. It turns out to be in time exponential in the encoding size of the tolerance using basic gates, comparable to the existing method's, while extra space consumption is saved. The experimental performance is validated by extensive examples from real-world data sets ASRS and public Amazon review.

关键词：

Reasoning about Software Trustworthiness with Derivation Trees

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of shanghai Jiaotong university(Science) 2024年第3期29卷 579-587页

作者：邓玉欣陈泽众汪洋杜文杰毛碧飞梁智章林秋诗李静辉 shanghai {1. laboratory of trustworthy computing East China Normal UniversityShanghai 200062China shanghai Normal University Shanghai 200233China Trustworthiness Theory Research Center Huawei Technologies Co.Ltd.Shenzhen 518129GuangdongChina

In order to analyze the trustworthiness of complex software systems,we propose a model of evidence-based software trustworthiness called trustworthiness derivation tree(TDT).The basic idea of constructing a TDT is to refine main properties into key ingredients and continue the refinement until basic facts such as evidences are *** skeleton of a TDT can be specified by a set of rules,which are convenient for automated reasoning in *** develop a visualization tool that can construct the skeleton of a TDT by taking the rules as input,and allow a user to edit the TDT in a graphical user *** a software development life cycle,TDTs can serve as a communication means for different stakeholders to agree on the properties about a system in the requirement analysis phase,and they can be used for deductive reasoning so as to verify whether the system achieves trustworthiness in the product validation *** have piloted the approach of using TDTs in more than a dozen real scenarios of software ***,using TDTs helped us to discover and then resolve some subtle problems.

关键词： trustworthiness refinement evidence visualization

Decoupled deep hough voting for point cloud registration

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第2期18卷 147-155页

作者： Mingzhi YUAN Kexue FU Zhihao LI Manning WANG Digital Medical Research Center School of Basic Medical SciencesFudan UniversityShanghai 200032China shanghai {1. laboratory of Medical Image computing and Computer Assisted Intervention Shanghai 200032China

Estimating rigid transformation using noisy correspondences is critical to feature-based point cloud ***,a series of studies have attempted to combine traditional robust model fitting with deep *** them,DHVR proposed a hough voting-based method,achieving new state-of-the-art ***,we find voting on rotation and translation simultaneously hinders achieving better ***,we proposed a new hough voting-based method,which decouples rotation and translation ***,we first utilize hough voting and a neural network to estimate *** based on good initialization on rotation,we can easily obtain accurate rigid *** experiments on 3DMatch and 3DLoMatch datasets show that our method achieves comparable performances over the state-of-the-art *** further demonstrate the generalization of our method by experimenting on KITTI dataset.

关键词： point cloud registration robust model fitting deep learning hough voting

Experimental demonstration of a quantum downstream access network in continuous variable quantum key distribution with a local local oscillator

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Photonics Research 2024年第6期12卷 1262-1273页

作者： DENGKE QI XIANGYU WANG ZHENGHUA LI JIAYU MA ZIYANG CHEN YUEMING LU SONG YU State key {1. of Information Photonics and Optical Communications Beijing University of Posts and TelecommunicationsBeijing 100876China key {1. of trustworthy Distributed computing and Service(MoE) Beijing University of Posts and TelecommunicationsBeijing 100876China State key {1. of Advanced Optical Communication Systems and Networks School of Electronicsand Center for Quantum Information TechnologyPeking UniversityBeijing 100871China

Quantum networks provide opportunities and challenges across a range of intellectual and technical frontiers,including quantum computation,communication,and *** traditional communication networks,quantum networks utilize quantum bits rather than classical bits to store and transmit *** key distribution(QKD)relying on the principles of quantum mechanics is a key component in quantum networks and enables two parties to produce a shared random secret key,thereby ensuring the security of data *** this work,we propose a cost-effective quantum downstream access network structure in which each user can get their corresponding key information through terminal *** on this structure,we demonstrate the first four-end-users quantum downstream access network in continuous variable QKD with a local local *** contrast to point-to-point continuous variable QKD,the network architecture reevaluates the security of each user and accounts for it accordingly,and each user has a lower tolerance for excess noise as the overall network expands with more ***,the feasibility of the experiment is based on the analysis of the theoretical model,noise analysis,and multiple techniques such as the particle filter and adaptive equalization algorithm used to suppress excess *** results show that each user can get a low level of excess noise and can achieve secret key rates of 546 kbps,535 kbps,522.5 kbps,and 51..5 kbps under a transmission distance of 1. km,respectively,with the finite-size block of 1.1.~*** not only verifies the good performance but also provides the foundation for the future multi-user quantum downstream access networks.

关键词： quantum oscillator local

维普期刊数据库

Superposed probabilistically shaped QAM constellation design based on nonlinear coding for MIMO visible light communication systems

在线全文

学校读者我要写书评

暂无评论

Chinese Optics Letters 2024年第6期22卷 109-115页

作者： Xinyue Guo Meixia Lu Qibin Zheng key {1. of Optical Technology and Instrument for Medicine Ministry of EducationSchool of Optical-Electrical and Computing EngineeringUniversity of Shanghai for Science and TechnologyShanghai 200093China laboratory of Radiation Detection and Medical Imaging School of Health Science and EngineeringUniversity of Shanghai for Science and TechnologyShanghai 200093China

In this study, we propose a superposed probabilistically shaped(PS) quadrature amplitude modulation(QAM) constellation scheme for multiple-input multiple-output visible light communication systems. PS QAM signals are generated from a nonlinear coding equation that converts uniformly distributed 8-level signals into PS 9-or 1.-level signals, which are then mapped into PS 9QAM or 1.QAM signals. Square-shaped 9QAM and trapezoid-shaped 1.QAM constellations are introduced to maximize the minimum Euclidean distance(MED) of the superposed constellation. Finally, the PS 9QAM and 1.QAM signals are superposed with the 4QAM signals in a flipped manner to obtain PS 36QAM or 40QAM signals at the receiver, *** exploit the temporal correlation of the resulting signal from nonlinear coding, we developed a detection algorithm based on Viterbi decoding. Experimental results confirmed the superiority of the proposed schemes by achieving a higher MED and stronger ability to resist nonlinearity. Compared with the traditional scheme, the peak-to-peak voltage dynamic ranges of the superposed 36QAM and 40QAM constellation schemes were improved by 52% and 48%, respectively.

关键词： visible light communication superposed constellation nonlinear coding

维普期刊数据库