Neurons at rest can exhibit diverse firing activities patterns in response to various external deterministic and random stimuli, especially additional currents. In this paper, neuronal firing patterns from bursting to...Neurons at rest can exhibit diverse firing activities patterns in response to various external deterministic and random stimuli, especially additional currents. In this paper, neuronal firing patterns from bursting to spiking, induced by additional direct and stochastic currents, are explored in rest states corresponding to two values of the parameter VK in the Chay neuron system. Three cases are considered by numerical simulation and fast/slow dynamic analysis, in which only the direct current or the stochastic current exists, or the direct and stochastic currents coexist. Meanwhile, several important bursting patterns in neuronal experiments, such as the period-1 ＂circle/homoclinic＂ bursting and the integer multiple ＂fold/homoclinic＂ bursting with onc spike per burst, as well as the transition from integer multiple bursting to period-1 ＂circle/homoclinic＂ bursting and that from stochastic ＂Hopf/homoclinic＂ bursting to ＂Hopf/homoclinic＂ bursting, are investigated in detail.展开更多
In this paper,a new quasi-interpolation with radial basis functions which satis- fies quadratic polynomial reproduction is constructed on the infinite set of equally spaced data.A new basis function is constructed by ...In this paper,a new quasi-interpolation with radial basis functions which satis- fies quadratic polynomial reproduction is constructed on the infinite set of equally spaced data.A new basis function is constructed by making convolution integral with a constructed spline and a given radial basis function.In particular,for twicely differ- entiable function the proposed method provides better approximation and also takes care of derivatives approximation.展开更多
Solving large radial basis function （RBF） interpolation problem with non-customized methods is computationally expensive and the matrices that occur are typically badly conditioned. In order to avoid these difficult...Solving large radial basis function （RBF） interpolation problem with non-customized methods is computationally expensive and the matrices that occur are typically badly conditioned. In order to avoid these difficulties, we present a fitting based on radial basis functions satisfying side conditions by least squares, although compared with interpolation the method loses some accuracy, it reduces the computational cost largely. Since the fitting accuracy and the non-singularity of coefficient matrix in normal equation are relevant to the uniformity of chosen centers of the fitted RBE we present a choice method of uniform centers. Numerical results confirm the fitting efficiency.展开更多
An adaptive mesh refinement algorithm based on a continuous adjoint ap- proach is developed. Both the primal equation and the adjoint equation are approximated with the discontinuous Galerkin （DG） method. The propos...An adaptive mesh refinement algorithm based on a continuous adjoint ap- proach is developed. Both the primal equation and the adjoint equation are approximated with the discontinuous Galerkin （DG） method. The proposed adaptive algorithm is used in compressible Euler equations. Numerical tests are made to show the superiority of the proposed adaptive algorithm.展开更多
Crowd management and analysis(CMA)systems have gained a lot of interest in the vulgarization of unmanned aerial vehicles(UAVs)use.Crowd tracking using UAVs is among the most important services provided by a CMA.In thi...Crowd management and analysis(CMA)systems have gained a lot of interest in the vulgarization of unmanned aerial vehicles(UAVs)use.Crowd tracking using UAVs is among the most important services provided by a CMA.In this paper,we studied the periodic crowd-tracking(PCT)problem.It consists in usingUAVs to follow-up crowds,during the life-cycle of an open crowded area(OCA).Two criteria were considered for this purpose.The first is related to the CMA initial investment,while the second is to guarantee the quality of service(QoS).The existing works focus on very specified assumptions that are highly committed to CMAs applications context.This study outlined a new binary linear programming(BLP)model to optimally solve the PCT motivated by a real-world application study taking into consideration the high level of abstraction.To closely approach different real-world contexts,we carefully defined and investigated a set of parameters related to the OCA characteristics,behaviors,and theCMAinitial infrastructure investment(e.g.,UAVs,charging stations(CSs)).In order to periodically update theUAVs/crowds andUAVs/CSs assignments,the proposed BLP was integrated into a linear algorithm called PCTs solver.Our main objective was to study the PCT problem fromboth theoretical and numerical viewpoints.To prove the PCTs solver effectiveness,we generated a diversified set of PCTs instances with different scenarios for simulation purposes.The empirical results analysis enabled us to validate the BLPmodel and the PCTs solver,and to point out a set of new challenges for future research directions.展开更多
Signature,widely used in cloud environment,describes the work as readily identifying its creator.The existing signature schemes in the literature mostly rely on the Hardness assumption which can be easily solved by qu...Signature,widely used in cloud environment,describes the work as readily identifying its creator.The existing signature schemes in the literature mostly rely on the Hardness assumption which can be easily solved by quantum algorithm.In this paper,we proposed an advanced quantum-resistant signature scheme for Cloud based on Eisenstein Ring(ETRUS)which ensures our signature scheme proceed in a lattice with higher density.We proved that ETRUS highly improve the performance of traditional lattice signature schemes.Moreover,the Norm of polynomials decreases significantly in ETRUS which can effectively reduce the amount of polynomials convolution calculation.Furthermore,storage complexity of ETRUS is smaller than classical ones.Finally,according to all convolution of ETRUS enjoy lower degree polynomials,our scheme appropriately accelerate 56.37%speed without reducing its security level.展开更多
Blockchain is an emerging decentralized architecture and distributed computing paradigm underlying Bitcoin and other cryptocurrencies,and has recently attracted intensive attention from governments,financial instituti...Blockchain is an emerging decentralized architecture and distributed computing paradigm underlying Bitcoin and other cryptocurrencies,and has recently attracted intensive attention from governments,financial institutions,high-tech enterprises,and the capital markets.Its cryptographic security relies on asymmetric cryptography,such as ECC,RSA.However,with the surprising development of quantum technology,asymmetric cryptography schemes mentioned above would become vulnerable.Recently,lattice-based cryptography scheme was proposed to be secure against attacks in the quantum era.In 2018,with the aid of Bonsai Trees technology,Yin et al.[Yin,Wen,Li et al.(2018)]proposed a lattice-based authentication method which can extend a lattice space to multiple lattice spaces accompanied by the corresponding key.Although their scheme has theoretical significance,it is unpractical in actual situation due to extremely large key size and signature size.In this paper,aiming at tackling the critical issue of transaction size,we propose a post quantum blockchain over lattice.By using SampleMat and signature without trapdoor,we can reduce the key size and signature size of our transaction authentication approach by a significant amount.Instead of using a whole set of vectors as a basis,we can use only one vector and rotate it enough times to form a basis.Based on the hardness assumption of Short Integer Solution(SIS),we demonstrate that the proposed anti-quantum transaction authentication scheme over lattice provides existential unforgeability against adaptive chosen-message attacks in the random oracle.As compared to the Yin et al.[Yin,Wen,Li et al.(2018)]scheme,our scheme has better performance in terms of energy consumption,signature size and signing key size.As the underlying lattice problem is intractable even for quantum computers,our scheme would work well in the quantum age.展开更多
With the rapid increase in demand for data trustworthiness and data security,distributed data storage technology represented by blockchain has received unprecedented attention.These technologies have been suggested fo...With the rapid increase in demand for data trustworthiness and data security,distributed data storage technology represented by blockchain has received unprecedented attention.These technologies have been suggested for various uses because of their remarkable ability to offer decentralization,high autonomy,full process traceability,and tamper resistance.Blockchain enables the exchange of information and value in an untrusted environment.There has been a significant increase in attention to the confidentiality and privacy preservation of blockchain technology.Ensuring data privacy is a critical concern in cryptography,and one of the most important protocols used to achieve this is the secret-sharing method.By dividing the secret into shares and distributing them among multiple parties,no one can access the secret without the cooperation of the other parties.However,Attackers with quantum computers in the future can execute Grover’s and Shor’s algorithms on quantum computers that can break or reduce the currently widely used cryptosystems.Furthermore,centralized management of keys increases the risk of key leakage.This paper proposed a post-quantum threshold algo-rithm to reduce the risk of data privacy leakage in blockchain Systems.This algorithm uses distributed key management technology to reduce the risk of individual node private key leakage and provide post-quantum security.The proposed privacy-preserving cryptographic algorithm provides a post-quantum threshold architecture for managing data,which involves defining users and interaction processes within the system.This paper applies a linear secret-sharing solution to partition the private key of the Number Theory Research Unit(NTRU)algorithm into n parts.It constructs a t–n threshold that allows recovery of the plaintext only when more than t nodes participate in decryption.The characteristic of a threshold makes the scheme resistant to collusion attacks from members whose combined credibility is less than the threshold.This mitigates the risk of single-point private key leakage.During the threshold decryption process,the private key information of the nodes will not be leaked.In addition,the fact that the threshold algorithm is founded on the NTRU lattice enables it to withstand quantum attacks,thus enhancing its security.According to the analysis,the proposed scheme provides superior protection compared to currently availablemethods.This paper provides postquantum security solutions for data security protection of blockchain,which will enrich the use of blockchain in scenarios with strict requirements for data privacy protection.展开更多
A major limitation for deep space communication is the limited bandwidths available. The downlinkrate using X-band with an L2 halo orbit is estimated to be of only 5.35 GB/d. However, the Next GenerationSpace Telescop...A major limitation for deep space communication is the limited bandwidths available. The downlinkrate using X-band with an L2 halo orbit is estimated to be of only 5.35 GB/d. However, the Next GenerationSpace Telescope (NGST) will produce about 600 GB/d. Clearly the volume of data to downlink must be re-duced by at least a factor of 100. One of the resolutions is to encode the data using very low bit rate image com-pression techniques. An very low bit rate image compression method based on region of interest(ROI) has beenproposed for deep space image. The conventional image compression algorithms which encode the original datawithout any data analysis can maintain very good details and haven' t high compression rate while the modernimage compressions with semantic organization can have high compression rate even to be hundred and can' tmaintain too much details. The algorithms based on region of interest inheriting from the two previews algorithmshave good semantic features and high fidelity, and is therefore suitable for applications at a low bit rate. Theproposed method extracts the region of interest by texture analysis after wavelet transform and gains optimal localquality with bit rate control. The Result shows that our method can maintain more details in ROI than generalimage compression algorithm(SPIHT) under the condition of sacrificing the quality of other uninterested areas.展开更多
In recent years,artificial intelligence has fueled the development of numerous applications[1,2].Person re-identification(re-ID)is a typical artificial intelligence system designed to automatically retrieve images of ...In recent years,artificial intelligence has fueled the development of numerous applications[1,2].Person re-identification(re-ID)is a typical artificial intelligence system designed to automatically retrieve images of specific individuals from galleries captured by different cameras[3].While supervised(in-domain)person re-ID methods have achieved considerable success in recent years[4],they remain susceptible to domain shifts.This means a model trained on one domain may fail to identify the person in another distinct domain.Collecting annotating data for every possible domain variation(e.g.,resolutions,lighting,and cameras)is impractical.展开更多
Managing scientific names in ontologies that represent species taxonomies is challenging due to the ever-evolving nature of these taxonomies.Manually maintaining these names becomes increasingly difficult when dealing...Managing scientific names in ontologies that represent species taxonomies is challenging due to the ever-evolving nature of these taxonomies.Manually maintaining these names becomes increasingly difficult when dealing with thousands of scientific names.To address this issue,this paper investigates the use of ChatGPT-4 to automate the development of the Organism module in the Agricultural Product Types Ontology(APTO)for species classification.Our methodology involved leveraging ChatGPT-4 to extract data from the GBIF Backbone API and generate OWL files for further integration in APTO.Two alternative approaches were explored:(1)issuing a series of prompts for ChatGPT-4 to execute tasks via the BrowserOP plugin and(2)directing ChatGPT-4 to design a Python algorithm to perform analogous tasks.Both approaches rely on a prompting method where we provide instructions,context,input data,and an output indicator.The first approach showed scalability limitations,while the second approach used the Python algorithm to overcome these challenges,but it struggled with typographical errors in data handling.This study highlights the potential of Large language models like ChatGPT-4 to streamline the management of species names in ontologies.Despite certain limitations,these tools offer promising advancements in automating taxonomy-related tasks and improving the efficiency of ontology development.展开更多
Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications. At present, the method of measurement and assessment of software trustworthin...Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications. At present, the method of measurement and assessment of software trustworthiness cannot guarantee safe and reliable operations of software systems completely and effectively. Based on the dynamical system study, this paper interprets the characteristics of be- haviors of software systems and the basic scientific problems of software trustworthiness complexity, analyzes the characteristics of complexity of software trustworthiness, and proposes to study the soft- ware trustworthiness measurement in terms of the complexity of software trustworthiness. Using the dynamical statistical analysis methods, the paper advances an invariant-measure based assessment method of software trustworthiness by statistical indices, and hereby provides a dynamical criterion for the untrustworthiness of software systems. By an example, the feasibility of the proposed dynamical statistical analysis method in software trustworthiness measurement is demonstrated using numerical simulations and theoretical analysis.展开更多
This paper is devoted to the finite-time disturbance attenuation problem of affine nonlinear systems. Based on the finite time Lyapunov stability theory, some finite-time H∞ performance criterions are derived. Then t...This paper is devoted to the finite-time disturbance attenuation problem of affine nonlinear systems. Based on the finite time Lyapunov stability theory, some finite-time H∞ performance criterions are derived. Then the state-feedback control law is designed and the structure of such a controller is investigated. Furthermore, it is shown that the H∞ controller can also make the closed-loop system satisfy finite-time H∞ performance for nonlinear homogeneous systems. An example is provided to demonstrate the effectiveness of the presented results.展开更多
In this paper, by using multivariate divided differences to approximate the partial derivative and superposition, we extend the multivariate quasi-interpolation scheme based on dimension-splitting technique which can ...In this paper, by using multivariate divided differences to approximate the partial derivative and superposition, we extend the multivariate quasi-interpolation scheme based on dimension-splitting technique which can reproduce linear polynomials to the scheme quadric polynomials. Furthermore, we give the approximation error of the modified scheme. Our multivariate multiquadric quasi-interpolation scheme only requires information of lo- cation points but not that of the derivatives of approximated function. Finally, numerical experiments demonstrate that the approximation rate of our scheme is significantly im- proved which is consistent with the theoretical results.展开更多
Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications, and software trustworthiness modeling has become a prerequisite and necessary...Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications, and software trustworthiness modeling has become a prerequisite and necessary means. To discuss and explain the basic scientific problems in software trustworthiness and to establish theoretical foundations for software trustworthiness measurement, combining the ideas of dynamical system study, this paper studies evolutionary laws of software trustworthiness and the dynamical mechanism under the effect of various internal and external factors, and proposes dynamical models for software trustworthiness, thus, software trustworthiness can be considered as the statistical characteristics of behaviors of software systems in the dynamical and open environment. By analyzing two simple examples, the paper explains the relationship between the limit evolutionary behaviors of software trustworthiness attributes and dynamical system characteristics, and interprets the dynamical characteristics of software trustworthiness and their evolutionary complexity.展开更多
Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw datasets.To enhance privacy in federated learning,multi-party comp...Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw datasets.To enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model training.This survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training efficiency.We also pinpoint future directions to deploy federated learning to a wider range of applications.展开更多
We show in a certain Lie-algebra, the connections between the Lie subalgebra G＋ ：= G-t-G＊ 4- [G, G＊], generated by a Lie subalgebra G, and the properties of G. This allows us to investigate some useful information...We show in a certain Lie-algebra, the connections between the Lie subalgebra G＋ ：= G-t-G＊ 4- [G, G＊], generated by a Lie subalgebra G, and the properties of G. This allows us to investigate some useful information about the structure of such two Lie subalgehras. Some results on the relations between the two Lie subalgebras are obtained. As an application, we get the following conclusion： Let ,4 C /3（2d） be a space of self-adjoint operators and L： ：= A ~ i^4 the corresponding complex Lie＊-algebra. G＋ = G 4- G＊ 4- [G, G＊] and G are two LM-decomposable Lie subalgebras of L： with the decomposition 6＋ = 7^（6＋） 4- S, G -- T~~ 4- 86, and T^6 C T^（6＋）. Then 6＋ is ideally finite iff T~ ：= 7~6 4- ~ 4- [T^6,7~] is a quasisolvable Lie subalgebra, S^- ：= 86 4- S~ 4- [$6, $~] is an ideally finite semisimple Lie subalgebra, and [7~6,86] = [R.~, 86] = {0}.展开更多
DCAT is an RDF vocabulary designed to facilitate interoperability between data catalogs published on the Web.Since its first release in 2014 as a W3C Recommendation,DCAT has seen a wide adoption across communities and...DCAT is an RDF vocabulary designed to facilitate interoperability between data catalogs published on the Web.Since its first release in 2014 as a W3C Recommendation,DCAT has seen a wide adoption across communities and domains,particularly in conjunction with implementing the FAIR data principles(forfindable,accessible,interoperable and reusable data).These implementation experiences,besides demonstrating the fitness of DCAT to meet its intended purpose,helped identify existing issues and gaps.Moreover,over the last few years,additional requirements emerged in data catalogs,given the increasing practice of documenting not only datasets but also data services and APls.This paper illustrates the new version of DCAT,explaining the rationale behind its main revisions and extensions,based on the collected use cases and requirements,and outlines the issues yet to be addressed in future versions of DCAT.展开更多
The use of traditional positioning technologies, such as GPS and wireless local positioning, rely on un- derlying infrastructure. However, in a subway environment, such positioning systems are not available for the po...The use of traditional positioning technologies, such as GPS and wireless local positioning, rely on un- derlying infrastructure. However, in a subway environment, such positioning systems are not available for the position- ing tasks, such as the detection of the train arrivals for the passengers in the train. An alternative approach is to exploit the contextual information available in the mobile devices of subway riders to detect train arrivals. To this end, we pro- pose to exploit multiple contextual features extracted from the mobile devices of subway riders to precisely detecting train arrivals. Following this line, we first investigate poten- tial contextual features which may be effective to detect train arrivals according to the observations from 3D accelerome- ters and GSM radio. Furthermore, we propose to explore the maximum entropy （MaxEnt） model for training a train ar- rival detector by learning the correlation between contextual features and train arrivals. Finally, we perform extensive ex- periments on several real-world data sets collected from two major subway lines in the Beijing subway system. Experi- mental results validate both the effectiveness and efficiency of the proposed approach.展开更多
Motivated by the fact that not all nonconvex optimization problems are difficult to solve,we survey in this paper three widely used ways to reveal the hidden convex structure for different classes of nonconvex optimiz...Motivated by the fact that not all nonconvex optimization problems are difficult to solve,we survey in this paper three widely used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.Finally,ten open problems are raised.展开更多
基金Project supported by the National Natural Science Foundation of China （Grant Nos 10432010 and 10526002）.Acknowledgement The bifurcation diagrams in this paper are obtained by means of the package C0NTENT.
文摘Neurons at rest can exhibit diverse firing activities patterns in response to various external deterministic and random stimuli, especially additional currents. In this paper, neuronal firing patterns from bursting to spiking, induced by additional direct and stochastic currents, are explored in rest states corresponding to two values of the parameter VK in the Chay neuron system. Three cases are considered by numerical simulation and fast/slow dynamic analysis, in which only the direct current or the stochastic current exists, or the direct and stochastic currents coexist. Meanwhile, several important bursting patterns in neuronal experiments, such as the period-1 ＂circle/homoclinic＂ bursting and the integer multiple ＂fold/homoclinic＂ bursting with onc spike per burst, as well as the transition from integer multiple bursting to period-1 ＂circle/homoclinic＂ bursting and that from stochastic ＂Hopf/homoclinic＂ bursting to ＂Hopf/homoclinic＂ bursting, are investigated in detail.
文摘In this paper,a new quasi-interpolation with radial basis functions which satis- fies quadratic polynomial reproduction is constructed on the infinite set of equally spaced data.A new basis function is constructed by making convolution integral with a constructed spline and a given radial basis function.In particular,for twicely differ- entiable function the proposed method provides better approximation and also takes care of derivatives approximation.
基金Supported by National Natural Science Youth Foundation (10401021).
文摘Solving large radial basis function （RBF） interpolation problem with non-customized methods is computationally expensive and the matrices that occur are typically badly conditioned. In order to avoid these difficulties, we present a fitting based on radial basis functions satisfying side conditions by least squares, although compared with interpolation the method loses some accuracy, it reduces the computational cost largely. Since the fitting accuracy and the non-singularity of coefficient matrix in normal equation are relevant to the uniformity of chosen centers of the fitted RBE we present a choice method of uniform centers. Numerical results confirm the fitting efficiency.
基金Project supported by the National Natural Science Foundation of China(No.91530325)the International Cooperation Project(No.2010DFR00700)the Fundamental Research of Civil Aircraft(No.MJ-F-2012-04)
文摘An adaptive mesh refinement algorithm based on a continuous adjoint ap- proach is developed. Both the primal equation and the adjoint equation are approximated with the discontinuous Galerkin （DG） method. The proposed adaptive algorithm is used in compressible Euler equations. Numerical tests are made to show the superiority of the proposed adaptive algorithm.
基金supported by the Deputyship for Research&Innovation,Ministry of Education in Saudi Arabia under Grant No.MoE-IF-G-20-08.
文摘Crowd management and analysis(CMA)systems have gained a lot of interest in the vulgarization of unmanned aerial vehicles(UAVs)use.Crowd tracking using UAVs is among the most important services provided by a CMA.In this paper,we studied the periodic crowd-tracking(PCT)problem.It consists in usingUAVs to follow-up crowds,during the life-cycle of an open crowded area(OCA).Two criteria were considered for this purpose.The first is related to the CMA initial investment,while the second is to guarantee the quality of service(QoS).The existing works focus on very specified assumptions that are highly committed to CMAs applications context.This study outlined a new binary linear programming(BLP)model to optimally solve the PCT motivated by a real-world application study taking into consideration the high level of abstraction.To closely approach different real-world contexts,we carefully defined and investigated a set of parameters related to the OCA characteristics,behaviors,and theCMAinitial infrastructure investment(e.g.,UAVs,charging stations(CSs)).In order to periodically update theUAVs/crowds andUAVs/CSs assignments,the proposed BLP was integrated into a linear algorithm called PCTs solver.Our main objective was to study the PCT problem fromboth theoretical and numerical viewpoints.To prove the PCTs solver effectiveness,we generated a diversified set of PCTs instances with different scenarios for simulation purposes.The empirical results analysis enabled us to validate the BLPmodel and the PCTs solver,and to point out a set of new challenges for future research directions.
基金This work was supported by the Major Program of National Natural Science Foundation of China(11290141).
文摘Signature,widely used in cloud environment,describes the work as readily identifying its creator.The existing signature schemes in the literature mostly rely on the Hardness assumption which can be easily solved by quantum algorithm.In this paper,we proposed an advanced quantum-resistant signature scheme for Cloud based on Eisenstein Ring(ETRUS)which ensures our signature scheme proceed in a lattice with higher density.We proved that ETRUS highly improve the performance of traditional lattice signature schemes.Moreover,the Norm of polynomials decreases significantly in ETRUS which can effectively reduce the amount of polynomials convolution calculation.Furthermore,storage complexity of ETRUS is smaller than classical ones.Finally,according to all convolution of ETRUS enjoy lower degree polynomials,our scheme appropriately accelerate 56.37%speed without reducing its security level.
基金This work was supported by the Major Program of National Natural Science Foundation of China(11290141).
文摘Blockchain is an emerging decentralized architecture and distributed computing paradigm underlying Bitcoin and other cryptocurrencies,and has recently attracted intensive attention from governments,financial institutions,high-tech enterprises,and the capital markets.Its cryptographic security relies on asymmetric cryptography,such as ECC,RSA.However,with the surprising development of quantum technology,asymmetric cryptography schemes mentioned above would become vulnerable.Recently,lattice-based cryptography scheme was proposed to be secure against attacks in the quantum era.In 2018,with the aid of Bonsai Trees technology,Yin et al.[Yin,Wen,Li et al.(2018)]proposed a lattice-based authentication method which can extend a lattice space to multiple lattice spaces accompanied by the corresponding key.Although their scheme has theoretical significance,it is unpractical in actual situation due to extremely large key size and signature size.In this paper,aiming at tackling the critical issue of transaction size,we propose a post quantum blockchain over lattice.By using SampleMat and signature without trapdoor,we can reduce the key size and signature size of our transaction authentication approach by a significant amount.Instead of using a whole set of vectors as a basis,we can use only one vector and rotate it enough times to form a basis.Based on the hardness assumption of Short Integer Solution(SIS),we demonstrate that the proposed anti-quantum transaction authentication scheme over lattice provides existential unforgeability against adaptive chosen-message attacks in the random oracle.As compared to the Yin et al.[Yin,Wen,Li et al.(2018)]scheme,our scheme has better performance in terms of energy consumption,signature size and signing key size.As the underlying lattice problem is intractable even for quantum computers,our scheme would work well in the quantum age.
基金supported by the National Key R&D Program of China(2022YFB2703400).
文摘With the rapid increase in demand for data trustworthiness and data security,distributed data storage technology represented by blockchain has received unprecedented attention.These technologies have been suggested for various uses because of their remarkable ability to offer decentralization,high autonomy,full process traceability,and tamper resistance.Blockchain enables the exchange of information and value in an untrusted environment.There has been a significant increase in attention to the confidentiality and privacy preservation of blockchain technology.Ensuring data privacy is a critical concern in cryptography,and one of the most important protocols used to achieve this is the secret-sharing method.By dividing the secret into shares and distributing them among multiple parties,no one can access the secret without the cooperation of the other parties.However,Attackers with quantum computers in the future can execute Grover’s and Shor’s algorithms on quantum computers that can break or reduce the currently widely used cryptosystems.Furthermore,centralized management of keys increases the risk of key leakage.This paper proposed a post-quantum threshold algo-rithm to reduce the risk of data privacy leakage in blockchain Systems.This algorithm uses distributed key management technology to reduce the risk of individual node private key leakage and provide post-quantum security.The proposed privacy-preserving cryptographic algorithm provides a post-quantum threshold architecture for managing data,which involves defining users and interaction processes within the system.This paper applies a linear secret-sharing solution to partition the private key of the Number Theory Research Unit(NTRU)algorithm into n parts.It constructs a t–n threshold that allows recovery of the plaintext only when more than t nodes participate in decryption.The characteristic of a threshold makes the scheme resistant to collusion attacks from members whose combined credibility is less than the threshold.This mitigates the risk of single-point private key leakage.During the threshold decryption process,the private key information of the nodes will not be leaked.In addition,the fact that the threshold algorithm is founded on the NTRU lattice enables it to withstand quantum attacks,thus enhancing its security.According to the analysis,the proposed scheme provides superior protection compared to currently availablemethods.This paper provides postquantum security solutions for data security protection of blockchain,which will enrich the use of blockchain in scenarios with strict requirements for data privacy protection.
文摘A major limitation for deep space communication is the limited bandwidths available. The downlinkrate using X-band with an L2 halo orbit is estimated to be of only 5.35 GB/d. However, the Next GenerationSpace Telescope (NGST) will produce about 600 GB/d. Clearly the volume of data to downlink must be re-duced by at least a factor of 100. One of the resolutions is to encode the data using very low bit rate image com-pression techniques. An very low bit rate image compression method based on region of interest(ROI) has beenproposed for deep space image. The conventional image compression algorithms which encode the original datawithout any data analysis can maintain very good details and haven' t high compression rate while the modernimage compressions with semantic organization can have high compression rate even to be hundred and can' tmaintain too much details. The algorithms based on region of interest inheriting from the two previews algorithmshave good semantic features and high fidelity, and is therefore suitable for applications at a low bit rate. Theproposed method extracts the region of interest by texture analysis after wavelet transform and gains optimal localquality with bit rate control. The Result shows that our method can maintain more details in ROI than generalimage compression algorithm(SPIHT) under the condition of sacrificing the quality of other uninterested areas.
基金supported by the National Natural Science Foundation of China(Grant Nos.62276013,62141605)。
文摘In recent years,artificial intelligence has fueled the development of numerous applications[1,2].Person re-identification(re-ID)is a typical artificial intelligence system designed to automatically retrieve images of specific individuals from galleries captured by different cameras[3].While supervised(in-domain)person re-ID methods have achieved considerable success in recent years[4],they remain susceptible to domain shifts.This means a model trained on one domain may fail to identify the person in another distinct domain.Collecting annotating data for every possible domain variation(e.g.,resolutions,lighting,and cameras)is impractical.
基金the Fundação de AmparoàPesquisa do Estado de São Paulo(FAPESP)under grant numbers 21/15125-0 and 22/08385-8.K.R.B.received funding from FAPESP(Grant n.2023/00779-0)F.M.S.,D.P.D.,K.R.B.,F.E.C.,D.A.M.,A.C.B.D.,and A.M.S.thank the Center for Artificial Intelligence(C4AI),a partnership of USP,IBM,and FAPESP(Grant 2019/07665-4).
文摘Managing scientific names in ontologies that represent species taxonomies is challenging due to the ever-evolving nature of these taxonomies.Manually maintaining these names becomes increasingly difficult when dealing with thousands of scientific names.To address this issue,this paper investigates the use of ChatGPT-4 to automate the development of the Organism module in the Agricultural Product Types Ontology(APTO)for species classification.Our methodology involved leveraging ChatGPT-4 to extract data from the GBIF Backbone API and generate OWL files for further integration in APTO.Two alternative approaches were explored:(1)issuing a series of prompts for ChatGPT-4 to execute tasks via the BrowserOP plugin and(2)directing ChatGPT-4 to design a Python algorithm to perform analogous tasks.Both approaches rely on a prompting method where we provide instructions,context,input data,and an output indicator.The first approach showed scalability limitations,while the second approach used the Python algorithm to overcome these challenges,but it struggled with typographical errors in data handling.This study highlights the potential of Large language models like ChatGPT-4 to streamline the management of species names in ontologies.Despite certain limitations,these tools offer promising advancements in automating taxonomy-related tasks and improving the efficiency of ontology development.
基金the National Basic Research Program of China (Grant No. 2005CB321900)the National Natural Science Foundation of China (Grant No. 60473091)
文摘Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications. At present, the method of measurement and assessment of software trustworthiness cannot guarantee safe and reliable operations of software systems completely and effectively. Based on the dynamical system study, this paper interprets the characteristics of be- haviors of software systems and the basic scientific problems of software trustworthiness complexity, analyzes the characteristics of complexity of software trustworthiness, and proposes to study the soft- ware trustworthiness measurement in terms of the complexity of software trustworthiness. Using the dynamical statistical analysis methods, the paper advances an invariant-measure based assessment method of software trustworthiness by statistical indices, and hereby provides a dynamical criterion for the untrustworthiness of software systems. By an example, the feasibility of the proposed dynamical statistical analysis method in software trustworthiness measurement is demonstrated using numerical simulations and theoretical analysis.
基金Supported by the National Basic Research Program of China (Grant No. 2005CB321902)the National Natural Science Foundation of China(Grant No. 60374001)the Doctoral Fund of Ministry of Education of China (Grant No. 20030006003)
文摘This paper is devoted to the finite-time disturbance attenuation problem of affine nonlinear systems. Based on the finite time Lyapunov stability theory, some finite-time H∞ performance criterions are derived. Then the state-feedback control law is designed and the structure of such a controller is investigated. Furthermore, it is shown that the H∞ controller can also make the closed-loop system satisfy finite-time H∞ performance for nonlinear homogeneous systems. An example is provided to demonstrate the effectiveness of the presented results.
文摘In this paper, by using multivariate divided differences to approximate the partial derivative and superposition, we extend the multivariate quasi-interpolation scheme based on dimension-splitting technique which can reproduce linear polynomials to the scheme quadric polynomials. Furthermore, we give the approximation error of the modified scheme. Our multivariate multiquadric quasi-interpolation scheme only requires information of lo- cation points but not that of the derivatives of approximated function. Finally, numerical experiments demonstrate that the approximation rate of our scheme is significantly im- proved which is consistent with the theoretical results.
基金Supported partially by the National Basic Research Program of China (Grant No. 2005CB321900) the National Natural Science Foundation of China (Grant No. 60473091)
文摘Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications, and software trustworthiness modeling has become a prerequisite and necessary means. To discuss and explain the basic scientific problems in software trustworthiness and to establish theoretical foundations for software trustworthiness measurement, combining the ideas of dynamical system study, this paper studies evolutionary laws of software trustworthiness and the dynamical mechanism under the effect of various internal and external factors, and proposes dynamical models for software trustworthiness, thus, software trustworthiness can be considered as the statistical characteristics of behaviors of software systems in the dynamical and open environment. By analyzing two simple examples, the paper explains the relationship between the limit evolutionary behaviors of software trustworthiness attributes and dynamical system characteristics, and interprets the dynamical characteristics of software trustworthiness and their evolutionary complexity.
基金partially supported by the National Natural Science Foundation of China(NSFC)(Grant Nos.U21A20516,62076017,and 62141605)the Funding of Advanced Innovation Center for Future Blockchain and Privacy Computing(No.ZF226G2201)+1 种基金the Beihang University Basic Research Funding(No.YWF-22-L-531)the Funding(No.22-TQ23-14-ZD-01-001)and WeBank Scholars Program.
文摘Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw datasets.To enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model training.This survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training efficiency.We also pinpoint future directions to deploy federated learning to a wider range of applications.
基金Supported by National Natural Science Foundation of China （Grant No. 10571011）
文摘We show in a certain Lie-algebra, the connections between the Lie subalgebra G＋ ：= G-t-G＊ 4- [G, G＊], generated by a Lie subalgebra G, and the properties of G. This allows us to investigate some useful information about the structure of such two Lie subalgehras. Some results on the relations between the two Lie subalgebras are obtained. As an application, we get the following conclusion： Let ,4 C /3（2d） be a space of self-adjoint operators and L： ：= A ~ i^4 the corresponding complex Lie＊-algebra. G＋ = G 4- G＊ 4- [G, G＊] and G are two LM-decomposable Lie subalgebras of L： with the decomposition 6＋ = 7^（6＋） 4- S, G -- T~~ 4- 86, and T^6 C T^（6＋）. Then 6＋ is ideally finite iff T~ ：= 7~6 4- ~ 4- [T^6,7~] is a quasisolvable Lie subalgebra, S^- ：= 86 4- S~ 4- [$6, $~] is an ideally finite semisimple Lie subalgebra, and [7~6,86] = [R.~, 86] = {0}.
基金partially supported by TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215funded by refinitiv.com (previously Thomson Reuters)
文摘DCAT is an RDF vocabulary designed to facilitate interoperability between data catalogs published on the Web.Since its first release in 2014 as a W3C Recommendation,DCAT has seen a wide adoption across communities and domains,particularly in conjunction with implementing the FAIR data principles(forfindable,accessible,interoperable and reusable data).These implementation experiences,besides demonstrating the fitness of DCAT to meet its intended purpose,helped identify existing issues and gaps.Moreover,over the last few years,additional requirements emerged in data catalogs,given the increasing practice of documenting not only datasets but also data services and APls.This paper illustrates the new version of DCAT,explaining the rationale behind its main revisions and extensions,based on the collected use cases and requirements,and outlines the issues yet to be addressed in future versions of DCAT.
文摘The use of traditional positioning technologies, such as GPS and wireless local positioning, rely on un- derlying infrastructure. However, in a subway environment, such positioning systems are not available for the position- ing tasks, such as the detection of the train arrivals for the passengers in the train. An alternative approach is to exploit the contextual information available in the mobile devices of subway riders to detect train arrivals. To this end, we pro- pose to exploit multiple contextual features extracted from the mobile devices of subway riders to precisely detecting train arrivals. Following this line, we first investigate poten- tial contextual features which may be effective to detect train arrivals according to the observations from 3D accelerome- ters and GSM radio. Furthermore, we propose to explore the maximum entropy （MaxEnt） model for training a train ar- rival detector by learning the correlation between contextual features and train arrivals. Finally, we perform extensive ex- periments on several real-world data sets collected from two major subway lines in the Beijing subway system. Experi- mental results validate both the effectiveness and efficiency of the proposed approach.
基金This research was supported by the National Natural Science Foundation of China(Nos.11822103,11571029)Natural Science Foundation of Beijing(No.Z180005).
文摘Motivated by the fact that not all nonconvex optimization problems are difficult to solve,we survey in this paper three widely used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.Finally,ten open problems are raised.
