This work evaluates an architecture for decentralized authentication of Internet of Things(IoT)devices in Low Earth Orbit(LEO)satellite networks using IOTA Identity technology.To the best of our knowledge,it is the fi...This work evaluates an architecture for decentralized authentication of Internet of Things(IoT)devices in Low Earth Orbit(LEO)satellite networks using IOTA Identity technology.To the best of our knowledge,it is the first proposal to integrate IOTA’s Directed Acyclic Graph(DAG)-based identity framework into satellite IoT environments,enabling lightweight and distributed authentication under intermittent connectivity.The system leverages Decentralized Identifiers(DIDs)and Verifiable Credentials(VCs)over the Tangle,eliminating the need for mining and sequential blocks.An identity management workflow is implemented that supports the creation,validation,deactivation,and reactivation of IoT devices,and is experimentally validated on the Shimmer Testnet.Three metrics are defined and measured:resolution time,deactivation time,and reactivation time.To improve robustness,an algorithmic optimization is introduced that minimizes communication overhead and reduces latency during deactivation.The experimental results are compared with orbital simulations of satellite revisit times to assess operational feasibility.Unlike blockchain-based approaches,which typically suffer from high confirmation delays and scalability constraints,the proposed DAG architecture provides fast,cost-free operations suitable for resource-constrained IoT devices.The results show that authentication can be efficiently performed within satellite connectivity windows,positioning IOTA Identity as a viable solution for secure and scalable IoT authentication in LEO satellite networks.展开更多
To protect user privacy and data security,the integration of Federated Learning(FL)and blockchain has become an emerging research hotspot.However,the limited throughput and high communication complexity of traditional...To protect user privacy and data security,the integration of Federated Learning(FL)and blockchain has become an emerging research hotspot.However,the limited throughput and high communication complexity of traditional blockchains limit their application in large-scale FL tasks,and the synchronous traditional FL will also reduce the training efficiency.To address these issues,in this paper,we propose a Directed Acyclic Graph(DAG)blockchain-enabled generalized Federated Dropout(FD)learning strategy,which could improve the efficiency of FL while ensuring the model generalization.Specifically,the DAG maintained by multiple edge servers will guarantee the security and traceability of the data,and the Reputation-based Tips Selection Algorithm(RTSA)is proposed to reduce the blockchain consensus delay.Second,the semi-asynchronous training among Intelligent Devices(IDs)is adopted to improve the training efficiency,and a reputation-based FD technology is proposed to prevent overfitting of the model.In addition,a Hybrid Optimal Resource Allocation(HORA)algorithm is introduced to minimize the network delay.Finally,simulation results demonstrate the effectiveness and superiority of the proposed algorithms.展开更多
The ultra-high speed,ultra-low latency,and massive connectivity of the 6 th Generation Mobile Network(6G)present unprecedented challenges to network security.In addition,the deep integration of Artificial Intelligence...The ultra-high speed,ultra-low latency,and massive connectivity of the 6 th Generation Mobile Network(6G)present unprecedented challenges to network security.In addition,the deep integration of Artificial Intelligence(AI)into 6G networks introduces AI-native features that further complicate the design and implementation of secure network architectures.To meet the security demands posed by the massive number of devices and edge nodes in 6G networks,a decentralized security architecture is essential,as it effectively mitigates the performance bottlenecks typically associated with centralized systems.Blockchain technology offers a promising trust mechanism among devices in 6G networks.However,conventional blockchain systems suffer from limited scalability under high-load conditions,making them inadequate for supporting a large volume of nodes and frequent data exchanges.To overcome these limitations,We propose Shard-DAG,a scalable architecture that structurally integrates Directed Acyclic Graphs(DAG)and sharding.Each shard adopts a Block-DAG structure for parallel block processing,effectively overcoming the performance bottlenecks of traditional chain-based blockchains.Furthermore,we introduce a DAG-based transaction ordering mechanism within each shard to defend against double-spending attacks.To ensure inter-shard security,Block-DAG adopts a black-box interaction approach to prevent cross-shard double-spending.Theoretical analysis and experimental evaluations demonstrate that Shard-DAG achieves near-linear scalability.In a network of 1,200 nodes with 8 shards,Shard-DAG achieves peak throughput improvements of 14.64 times over traditional blockchains,8.61 times over standalone BlockDAG,and 2.05 times over conventional sharded blockchains.The results validate Shard-DAG's ability to scale efficiently while maintaining robust security properties.展开更多
Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(M...Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(ML)nature,causal models hope to tie the cause(s)to the effect(s)pertaining to a phenomenon(i.e.,data generating process)through causal principles.This paper presents one of the first works at creating causal models in the area of structural and construction engineering.To this end,this paper starts with a brief review of the principles of causality and then adopts four causal discovery algorithms,namely,PC(Peter-Clark),FCI(fast causal inference),GES(greedy equivalence search),and GRa SP(greedy relaxation of the sparsest permutation),have been used to examine four phenomena,including predicting the load-bearing capacity of axially loaded members,fire resistance of structural members,shear strength of beams,and resistance of walls against impulsive(blast)loading.Findings from this study reveal the possibility and merit of discovering complete and partial causal models.Finally,this study also proposes two simple metrics that can help assess the performance of causal discovery algorithms.展开更多
This paper presents an algorithm named the dependency-aware offloading framework(DeAOff),which is designed to optimize the deployment of Gen-AI decoder models in mobile edge computing(MEC)environments.These models,suc...This paper presents an algorithm named the dependency-aware offloading framework(DeAOff),which is designed to optimize the deployment of Gen-AI decoder models in mobile edge computing(MEC)environments.These models,such as decoders,pose significant challenges due to their interlayer dependencies and high computational demands,especially under edge resource constraints.To address these challenges,we propose a two-phase optimization algorithm that first handles dependencyaware task allocation and subsequently optimizes energy consumption.By modeling the inference process using directed acyclic graphs(DAGs)and applying constraint relaxation techniques,our approach effectively reduces execution latency and energy usage.Experimental results demonstrate that our method achieves a reduction of up to 20%in task completion time and approximately 30%savings in energy consumption compared to traditional methods.These outcomes underscore our solution’s robustness in managing complex sequential dependencies and dynamic MEC conditions,enhancing quality of service.Thus,our work presents a practical and efficient resource optimization strategy for deploying models in resourceconstrained MEC scenarios.展开更多
The search for the generating compatibility conditions (CC) of a given operator is a very recent problem met in general relativity in order to study the Killing operator for various standard useful metrics. Accordingl...The search for the generating compatibility conditions (CC) of a given operator is a very recent problem met in general relativity in order to study the Killing operator for various standard useful metrics. Accordingly, this paper can be considered as a natural continuation of a previous paper recently published in JMP under the title Minkowski, Schwarschild and Kerr metrics revisited. In particular, we prove that the intrinsic link existing between the lack of formal exactness of an operator sequence on the jet level, the lack of formal exactness of its corresponding symbol sequence and the lack of formal integrability (FI) of the initial operator is of a purely homological nature as it is based on the long exact connecting sequence provided by the so-called snake lemma in homological algebra. It is therefore quite difficult to grasp it in general and even more difficult to use it on explicit examples. It does not seem that any one of the results presented in this paper is known as most of the other authors who studied the above problem of computing the total number of generating CC are confusing this number with the degree of generality introduced by A. Einstein in his 1930 letters to E. Cartan. One of the motivating examples that we provide is so striking that it is even difficult to imagine that such an example could exist. We hope this paper could be used as a source of testing examples for future applications of computer algebra in general relativity and, more generally, in mathematical physics.展开更多
Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance...Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency（e.g.,observation tasks orienting to the earthquake area and military conflict area）,have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search（ACO-ILS） is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm.展开更多
In the blockchain,the consensus mechanism plays a key role in maintaining the security and legitimation of contents recorded in the blocks.Various blockchain consensus mechanisms have been proposed.However,there is no...In the blockchain,the consensus mechanism plays a key role in maintaining the security and legitimation of contents recorded in the blocks.Various blockchain consensus mechanisms have been proposed.However,there is no technical analysis and comparison as a guideline to determine which type of consensus mechanism should be adopted in a specific scenario/application.To this end,this work investigates three mainstream consensus mechanisms in the blockchain,namely,Proof of Work(PoW),Proof of Stake(PoS),and Direct Acyclic Graph(DAG),and identifies their performances in terms of the average time to generate a new block,the confirmation delay,the Transaction Per Second(TPS)and the confirmation failure probability.The results show that the consensus process is affected by both network resource(computation power/coin age,buffer size)and network load conditions.In addition,it shows that PoW and PoS are more sensitive to the change of network resource while DAG is more sensitive to network load conditions.展开更多
Due to the excellent performance in complex systems modeling under small samples and uncertainty,Belief Rule Base(BRB)expert system has been widely applied in fault diagnosis.However,the fault diagnosis process for co...Due to the excellent performance in complex systems modeling under small samples and uncertainty,Belief Rule Base(BRB)expert system has been widely applied in fault diagnosis.However,the fault diagnosis process for complex mechanical equipment normally needs multiple attributes,which can lead to the rule number explosion problem in BRB,and limit the efficiency and accuracy.To solve this problem,a novel Combination Belief Rule Base(C-BRB)model based on Directed Acyclic Graph(DAG)structure is proposed in this paper.By dispersing numerous attributes into the parallel structure composed of different sub-BRBs,C-BRB can effectively reduce the amount of calculation with acceptable result.At the same time,a path selection strategy considering the accuracy of child nodes is designed in C-BRB to obtain the most suitable submodels.Finally,a fusion method based on Evidential Reasoning(ER)rule is used to combine the belief rules of C-BRB and generate the final results.To illustrate the effectiveness and reliability of the proposed method,a case study of fault diagnosis of rolling bearing is conducted,and the result is compared with other methods.展开更多
A new acyclic peroxide derivative asperoxide A(1),along with 13 known compounds,namely,microperfuranone(2),9-hydroxymicroperfuranone(3),gibellulin A(4),lecanoric acid(5),terrequinone A(6),sterigmatocystin(7),isosecost...A new acyclic peroxide derivative asperoxide A(1),along with 13 known compounds,namely,microperfuranone(2),9-hydroxymicroperfuranone(3),gibellulin A(4),lecanoric acid(5),terrequinone A(6),sterigmatocystin(7),isosecosterigmatocystin(8),arugosin C(9),curvularin(10),3,3'-diindolylmethane(11),austinol(12),austin(13),and dehydroaustin(14),were isolated and identified from the culture extract of Aspergillus nidulans SD-531,a fungus obtained from the deep-sea sediment of cold spring in the South China Sea.Their structures were determined based on detailed interpretation of nuclear magnetic resonance(NMR)spectroscopic and mass spectrometry data analysis.All the isolated compounds were evaluated for antimicrobial activities against human and aquatic bacteria as well as plant pathogenic fungi.Compounds 1–8,10,and 11 exhibited antimicrobial activities against some of the tested strains with minimum inhibitory concentration(MIC)values ranging from^2 to 64μg/mL.Compounds 4 and 6 displayed strongest activities among the tested samples and might be used as promising molecules for the development of natural antimicrobial agents.展开更多
By employing a fixed point theorem due to Ding, Park and Jung, some existence theorems of solutions for equilibrium problems with lower and upper bounds are proved in noncompact topological spaces. These results furth...By employing a fixed point theorem due to Ding, Park and Jung, some existence theorems of solutions for equilibrium problems with lower and upper bounds are proved in noncompact topological spaces. These results further answer the open problem raised by Isac, Sehgal and Singh under much weaker assumptions.展开更多
An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge c...An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ’ a（G）.In this paper we prove that χ ’ a（G） ≤（G） ＋ 5 for planar graphs G without adjacent triangles.展开更多
A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of ...A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.展开更多
In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on pa...In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.展开更多
Some new coincidence theorems involving a new class of set-valued mappingscontaining composites of acyclic mappings defined on a contractible space are proved.As applications, some existence theorems of maximal elemen...Some new coincidence theorems involving a new class of set-valued mappingscontaining composites of acyclic mappings defined on a contractible space are proved.As applications, some existence theorems of maximal elements and solutions of abstract variational inequalities, and best approximation theorems are proved. These theorems improve and generalize a number of known results in recent literature.展开更多
A series of novel mono（2,2,2-trifluoroethyl） esters,mono L-amino acid ester prodrugs of acyclic nucleoside phosphonates was synthesized and their in vitro anti-HBVactivity was evaluated in HepG 2 2.2.15 cells.Compou...A series of novel mono（2,2,2-trifluoroethyl） esters,mono L-amino acid ester prodrugs of acyclic nucleoside phosphonates was synthesized and their in vitro anti-HBVactivity was evaluated in HepG 2 2.2.15 cells.Compound 1d exhibited more potent anti-HBV activity and lower cytotoxicity than those of adefovir dipivoxil and alamifovir（MCC-478） with EC_（50） and CC_（50） values of 0.01μmol/L and 8000μmol/L respectively.展开更多
Herein we reported that ferrocene-containing polymers could be synthesized via acyclic diene metathesis （ADMET） polymerization of ferrocene-containing bis-styryl monomers. The all-trans-configured vinylene bonds of ...Herein we reported that ferrocene-containing polymers could be synthesized via acyclic diene metathesis （ADMET） polymerization of ferrocene-containing bis-styryl monomers. The all-trans-configured vinylene bonds of stilbene segment were proven by means of ^13C-NMR, ^1H-NMR, MALDI-TOF mass spectrometry and FTIR. Poly（1） showed maxima for absorption at 320 nm and emission at 430 nm which are structurally very similar to trans-stilbene, but 24 and 16 nm red shifted respectively. CIE chromaticity diagram shows that emission color could be adjusted by controlling the molecular weight. The polymer showed excellent solubility in common organic solvents and good thermal stability evidenced by TGA and DSC. The results of CV suggested the polymer possessed noninteracting metal centers which was confirmed by a reversible one-electron redox wave observed for the polymer.展开更多
基金This work is part of the‘Intelligent and Cyber-Secure Platform for Adaptive Optimization in the Simultaneous Operation of Heterogeneous Autonomous Robots(PICRAH4.0)’with reference MIG-20232082,funded by MCIN/AEI/10.13039/501100011033supported by the Universidad Internacional de La Rioja(UNIR)through the Precompetitive Research Project entitled“Nuevos Horizontes en Internet de las Cosas y NewSpace(NEWIOT)”,reference PP-2024-13,funded under the 2024 Call for Research Projects.
文摘This work evaluates an architecture for decentralized authentication of Internet of Things(IoT)devices in Low Earth Orbit(LEO)satellite networks using IOTA Identity technology.To the best of our knowledge,it is the first proposal to integrate IOTA’s Directed Acyclic Graph(DAG)-based identity framework into satellite IoT environments,enabling lightweight and distributed authentication under intermittent connectivity.The system leverages Decentralized Identifiers(DIDs)and Verifiable Credentials(VCs)over the Tangle,eliminating the need for mining and sequential blocks.An identity management workflow is implemented that supports the creation,validation,deactivation,and reactivation of IoT devices,and is experimentally validated on the Shimmer Testnet.Three metrics are defined and measured:resolution time,deactivation time,and reactivation time.To improve robustness,an algorithmic optimization is introduced that minimizes communication overhead and reduces latency during deactivation.The experimental results are compared with orbital simulations of satellite revisit times to assess operational feasibility.Unlike blockchain-based approaches,which typically suffer from high confirmation delays and scalability constraints,the proposed DAG architecture provides fast,cost-free operations suitable for resource-constrained IoT devices.The results show that authentication can be efficiently performed within satellite connectivity windows,positioning IOTA Identity as a viable solution for secure and scalable IoT authentication in LEO satellite networks.
基金supported in part by the National Key R&D Program of China under Grant 2021YFB1714100in part by the National Natural Science Foundation of China(NSFC)under Grant 62371082 and 62001076in part by the Natural Science Foundation of Chongqing under Grant CSTB2023NSCQ-MSX0726 and cstc2020jcyjmsxmX0878.
文摘To protect user privacy and data security,the integration of Federated Learning(FL)and blockchain has become an emerging research hotspot.However,the limited throughput and high communication complexity of traditional blockchains limit their application in large-scale FL tasks,and the synchronous traditional FL will also reduce the training efficiency.To address these issues,in this paper,we propose a Directed Acyclic Graph(DAG)blockchain-enabled generalized Federated Dropout(FD)learning strategy,which could improve the efficiency of FL while ensuring the model generalization.Specifically,the DAG maintained by multiple edge servers will guarantee the security and traceability of the data,and the Reputation-based Tips Selection Algorithm(RTSA)is proposed to reduce the blockchain consensus delay.Second,the semi-asynchronous training among Intelligent Devices(IDs)is adopted to improve the training efficiency,and a reputation-based FD technology is proposed to prevent overfitting of the model.In addition,a Hybrid Optimal Resource Allocation(HORA)algorithm is introduced to minimize the network delay.Finally,simulation results demonstrate the effectiveness and superiority of the proposed algorithms.
基金supported by National Natural Science Foundation of China:Education Big Data Analysis based on Software Defined Networking Architecture(No.62177019,F0701)。
文摘The ultra-high speed,ultra-low latency,and massive connectivity of the 6 th Generation Mobile Network(6G)present unprecedented challenges to network security.In addition,the deep integration of Artificial Intelligence(AI)into 6G networks introduces AI-native features that further complicate the design and implementation of secure network architectures.To meet the security demands posed by the massive number of devices and edge nodes in 6G networks,a decentralized security architecture is essential,as it effectively mitigates the performance bottlenecks typically associated with centralized systems.Blockchain technology offers a promising trust mechanism among devices in 6G networks.However,conventional blockchain systems suffer from limited scalability under high-load conditions,making them inadequate for supporting a large volume of nodes and frequent data exchanges.To overcome these limitations,We propose Shard-DAG,a scalable architecture that structurally integrates Directed Acyclic Graphs(DAG)and sharding.Each shard adopts a Block-DAG structure for parallel block processing,effectively overcoming the performance bottlenecks of traditional chain-based blockchains.Furthermore,we introduce a DAG-based transaction ordering mechanism within each shard to defend against double-spending attacks.To ensure inter-shard security,Block-DAG adopts a black-box interaction approach to prevent cross-shard double-spending.Theoretical analysis and experimental evaluations demonstrate that Shard-DAG achieves near-linear scalability.In a network of 1,200 nodes with 8 shards,Shard-DAG achieves peak throughput improvements of 14.64 times over traditional blockchains,8.61 times over standalone BlockDAG,and 2.05 times over conventional sharded blockchains.The results validate Shard-DAG's ability to scale efficiently while maintaining robust security properties.
文摘Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(ML)nature,causal models hope to tie the cause(s)to the effect(s)pertaining to a phenomenon(i.e.,data generating process)through causal principles.This paper presents one of the first works at creating causal models in the area of structural and construction engineering.To this end,this paper starts with a brief review of the principles of causality and then adopts four causal discovery algorithms,namely,PC(Peter-Clark),FCI(fast causal inference),GES(greedy equivalence search),and GRa SP(greedy relaxation of the sparsest permutation),have been used to examine four phenomena,including predicting the load-bearing capacity of axially loaded members,fire resistance of structural members,shear strength of beams,and resistance of walls against impulsive(blast)loading.Findings from this study reveal the possibility and merit of discovering complete and partial causal models.Finally,this study also proposes two simple metrics that can help assess the performance of causal discovery algorithms.
文摘This paper presents an algorithm named the dependency-aware offloading framework(DeAOff),which is designed to optimize the deployment of Gen-AI decoder models in mobile edge computing(MEC)environments.These models,such as decoders,pose significant challenges due to their interlayer dependencies and high computational demands,especially under edge resource constraints.To address these challenges,we propose a two-phase optimization algorithm that first handles dependencyaware task allocation and subsequently optimizes energy consumption.By modeling the inference process using directed acyclic graphs(DAGs)and applying constraint relaxation techniques,our approach effectively reduces execution latency and energy usage.Experimental results demonstrate that our method achieves a reduction of up to 20%in task completion time and approximately 30%savings in energy consumption compared to traditional methods.These outcomes underscore our solution’s robustness in managing complex sequential dependencies and dynamic MEC conditions,enhancing quality of service.Thus,our work presents a practical and efficient resource optimization strategy for deploying models in resourceconstrained MEC scenarios.
文摘The search for the generating compatibility conditions (CC) of a given operator is a very recent problem met in general relativity in order to study the Killing operator for various standard useful metrics. Accordingly, this paper can be considered as a natural continuation of a previous paper recently published in JMP under the title Minkowski, Schwarschild and Kerr metrics revisited. In particular, we prove that the intrinsic link existing between the lack of formal exactness of an operator sequence on the jet level, the lack of formal exactness of its corresponding symbol sequence and the lack of formal integrability (FI) of the initial operator is of a purely homological nature as it is based on the long exact connecting sequence provided by the so-called snake lemma in homological algebra. It is therefore quite difficult to grasp it in general and even more difficult to use it on explicit examples. It does not seem that any one of the results presented in this paper is known as most of the other authors who studied the above problem of computing the total number of generating CC are confusing this number with the degree of generality introduced by A. Einstein in his 1930 letters to E. Cartan. One of the motivating examples that we provide is so striking that it is even difficult to imagine that such an example could exist. We hope this paper could be used as a source of testing examples for future applications of computer algebra in general relativity and, more generally, in mathematical physics.
基金supported by the National Natural Science Foundation of China (61104180)the National Basic Research Program of China(973 Program) (97361361)
文摘Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency（e.g.,observation tasks orienting to the earthquake area and military conflict area）,have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search（ACO-ILS） is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm.
基金the National Natural Science Foundation of China under Grant 61701059,Grant 61941114,and Grant 61831002,in part by the Fundamental Research Funds for the Central Universities of New TeachersProject,in part by the Chongqing Technological Innovation and Application Development Projects under Grant cstc2019jscx-msxm1322,and in part by the Eighteentg Open Foundation of State Key Lab of Integrated Services Networks of Xidian University under Grant ISN20-05.
文摘In the blockchain,the consensus mechanism plays a key role in maintaining the security and legitimation of contents recorded in the blocks.Various blockchain consensus mechanisms have been proposed.However,there is no technical analysis and comparison as a guideline to determine which type of consensus mechanism should be adopted in a specific scenario/application.To this end,this work investigates three mainstream consensus mechanisms in the blockchain,namely,Proof of Work(PoW),Proof of Stake(PoS),and Direct Acyclic Graph(DAG),and identifies their performances in terms of the average time to generate a new block,the confirmation delay,the Transaction Per Second(TPS)and the confirmation failure probability.The results show that the consensus process is affected by both network resource(computation power/coin age,buffer size)and network load conditions.In addition,it shows that PoW and PoS are more sensitive to the change of network resource while DAG is more sensitive to network load conditions.
基金supported by the Natural Science Foundation of China(Nos.61773388,61751304,61833016,61702142,U1811264 and 61966009)the Shaanxi Outstanding Youth Science Foundation,China(No.2020JC-34)+2 种基金the Key Research and Development Plan of Hainan,China(No.ZDYF2019007)China Postdoctoral Science Foundation(No.2020M673668)Guangxi Key Laboratory of Trusted Software,China(No.KX202050)。
文摘Due to the excellent performance in complex systems modeling under small samples and uncertainty,Belief Rule Base(BRB)expert system has been widely applied in fault diagnosis.However,the fault diagnosis process for complex mechanical equipment normally needs multiple attributes,which can lead to the rule number explosion problem in BRB,and limit the efficiency and accuracy.To solve this problem,a novel Combination Belief Rule Base(C-BRB)model based on Directed Acyclic Graph(DAG)structure is proposed in this paper.By dispersing numerous attributes into the parallel structure composed of different sub-BRBs,C-BRB can effectively reduce the amount of calculation with acceptable result.At the same time,a path selection strategy considering the accuracy of child nodes is designed in C-BRB to obtain the most suitable submodels.Finally,a fusion method based on Evidential Reasoning(ER)rule is used to combine the belief rules of C-BRB and generate the final results.To illustrate the effectiveness and reliability of the proposed method,a case study of fault diagnosis of rolling bearing is conducted,and the result is compared with other methods.
基金the National Key R&D Program of China(No.2018YFC0310800)。
文摘A new acyclic peroxide derivative asperoxide A(1),along with 13 known compounds,namely,microperfuranone(2),9-hydroxymicroperfuranone(3),gibellulin A(4),lecanoric acid(5),terrequinone A(6),sterigmatocystin(7),isosecosterigmatocystin(8),arugosin C(9),curvularin(10),3,3'-diindolylmethane(11),austinol(12),austin(13),and dehydroaustin(14),were isolated and identified from the culture extract of Aspergillus nidulans SD-531,a fungus obtained from the deep-sea sediment of cold spring in the South China Sea.Their structures were determined based on detailed interpretation of nuclear magnetic resonance(NMR)spectroscopic and mass spectrometry data analysis.All the isolated compounds were evaluated for antimicrobial activities against human and aquatic bacteria as well as plant pathogenic fungi.Compounds 1–8,10,and 11 exhibited antimicrobial activities against some of the tested strains with minimum inhibitory concentration(MIC)values ranging from^2 to 64μg/mL.Compounds 4 and 6 displayed strongest activities among the tested samples and might be used as promising molecules for the development of natural antimicrobial agents.
文摘By employing a fixed point theorem due to Ding, Park and Jung, some existence theorems of solutions for equilibrium problems with lower and upper bounds are proved in noncompact topological spaces. These results further answer the open problem raised by Isac, Sehgal and Singh under much weaker assumptions.
文摘An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ’ a（G）.In this paper we prove that χ ’ a（G） ≤（G） ＋ 5 for planar graphs G without adjacent triangles.
基金supported by NSFC of China (No. 19871036 and No. 40301037)Faculty Research Grant,Hong Kong Baptist University
文摘A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.
基金The National Natural Science Foundation of China(No.61741102,61471164,61601122)the Fundamental Research Funds for the Central Universities(No.SJLX_160040)
文摘In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.
文摘Some new coincidence theorems involving a new class of set-valued mappingscontaining composites of acyclic mappings defined on a contractible space are proved.As applications, some existence theorems of maximal elements and solutions of abstract variational inequalities, and best approximation theorems are proved. These theorems improve and generalize a number of known results in recent literature.
基金supported by the grants from the National Natural Science Foundation of China(No.20962004)the Provincial Social Development Foundation of Guizhou,China(No.QKHSYZ[2009]3081)+1 种基金Provincial Special Assistant Foundation for High-level Talents of Guizhou,China(No.TZJF-2009-36)Science and Technology Foundation of Guizhou Province,China(No.QKHJZ[2008]2140)
文摘A series of novel mono（2,2,2-trifluoroethyl） esters,mono L-amino acid ester prodrugs of acyclic nucleoside phosphonates was synthesized and their in vitro anti-HBVactivity was evaluated in HepG 2 2.2.15 cells.Compound 1d exhibited more potent anti-HBV activity and lower cytotoxicity than those of adefovir dipivoxil and alamifovir（MCC-478） with EC_（50） and CC_（50） values of 0.01μmol/L and 8000μmol/L respectively.
基金financially supported by the National Natural Science Foundation of China(No.21364005)Startup Foundation for Outstanding Young Scientists of Inner Mongolia University(Z20080213No.115110)
文摘Herein we reported that ferrocene-containing polymers could be synthesized via acyclic diene metathesis （ADMET） polymerization of ferrocene-containing bis-styryl monomers. The all-trans-configured vinylene bonds of stilbene segment were proven by means of ^13C-NMR, ^1H-NMR, MALDI-TOF mass spectrometry and FTIR. Poly（1） showed maxima for absorption at 320 nm and emission at 430 nm which are structurally very similar to trans-stilbene, but 24 and 16 nm red shifted respectively. CIE chromaticity diagram shows that emission color could be adjusted by controlling the molecular weight. The polymer showed excellent solubility in common organic solvents and good thermal stability evidenced by TGA and DSC. The results of CV suggested the polymer possessed noninteracting metal centers which was confirmed by a reversible one-electron redox wave observed for the polymer.
