This paper investigates large-scale distributed system design. It looks at features, main design considerations and provides the Netflix API, Cassandra and Oracle as examples of such systems. Moreover, the paper inves...This paper investigates large-scale distributed system design. It looks at features, main design considerations and provides the Netflix API, Cassandra and Oracle as examples of such systems. Moreover, the paper investigates the challenges of designing, developing, deploying, and maintaining such systems, in regard to the features presented. Finally, the paper discusses aspects of available solutions and current practices to challenges that large-scale distributed systems face.展开更多
The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context ...The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context of large-scale distributed renewable energy integration into the power grid,conventional island power grid line layouts can no longer meet actual demands.It is necessary to combine the operational characteristics of island power systems and historical load data to perform load forecasting,thereby generating power grid line layout paths.This article focuses on large-scale distributed renewable energy integration,summarizing optimization strategies for island power grid line layouts,and providing a solid guarantee for the safe and stable operation of island power systems.展开更多
Protein-protein interactions are of great significance for human to understand the functional mechanisms of proteins.With the rapid development of high-throughput genomic technologies,massive protein-protein interacti...Protein-protein interactions are of great significance for human to understand the functional mechanisms of proteins.With the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them efficiently.To address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using MapReduce.To do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and prediction.Respective solutions are then devised to overcome these limitations.In particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of proteins.After that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and accuracy.Experimental results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.展开更多
In this paper a short-circuit computation(SCC) procedure for large-scale distribution systems with high penetration of distributed generators based on contemporary technologies is proposed. The procedure is suitable f...In this paper a short-circuit computation(SCC) procedure for large-scale distribution systems with high penetration of distributed generators based on contemporary technologies is proposed. The procedure is suitable for real-time calculations.Modeling of modern distributed generators differs from the modeling of traditional synchronous and induction generators.Hence, SCC procedures found on the presumption of distribution systems with only traditional generators are not suitable in nowadays systems. In the work presented in this paper, for computation of the state of the system with short-circuit, the improved backward/forward sweep(IBFS) procedure is used.Computation results show that the IBFS procedure is much more robust than previous SCC procedures, as it takes into account all distribution system elements, including modern distributed generators.展开更多
Distributed photovoltaic power (PV) is the main development model of distributed generation. It is necessary to research on dispatching and operation management with large-scale distributed PV connected. This paper an...Distributed photovoltaic power (PV) is the main development model of distributed generation. It is necessary to research on dispatching and operation management with large-scale distributed PV connected. This paper analyzes development status, technical requirement and dispatching and operation management situation of distributed PV in Germany and China. Then introduce the preparation of distributed PV dispatching and operation management criterion. Through summarizing the experiences and lessons of large-scale distributed PV development in Germany, it gives advice to the development of distributed PV dispatching and operation management in China.展开更多
This paper examines the results of the distributed generation penetration in large-scale medium-voltage power distribution networks. The network examined as a study case consists of twenty one lines fed by three power...This paper examines the results of the distributed generation penetration in large-scale medium-voltage power distribution networks. The network examined as a study case consists of twenty one lines fed by three power substations. The injected power comes mainly from photovoltaic units. Specifically, the influences of distributed generation on the network branch currents, losses and voltage profile as well as on the short-circuit level at the medium voltage busbars of the infeeding substations are examined according to international and national standards. The arising problems are explored and technical solutions are proposed. This paper is a pilot application as general conclusions concerning the extended distributed generation penetration in real power distribution networks are set out.展开更多
In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously pe...In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.展开更多
An antenna selection algorithm based on large-scale fading between the transmitter and receiver is proposed for the uplink receive antenna selection in distributed multiple-input multiple-output(D-MIMO) systems. By ut...An antenna selection algorithm based on large-scale fading between the transmitter and receiver is proposed for the uplink receive antenna selection in distributed multiple-input multiple-output(D-MIMO) systems. By utilizing the radio access units(RAU) selection based on large-scale fading,the proposed algorithm decreases enormously the computational complexity. Based on the characteristics of distributed systems,an improved particle swarm optimization(PSO) has been proposed for the antenna selection after the RAU selection. In order to apply the improved PSO algorithm better in antenna selection,a general form of channel capacity was transformed into a binary expression by analyzing the formula of channel capacity. The proposed algorithm can make full use of the advantages of D-MIMO systems,and achieve near-optimal performance in terms of channel capacity with low computational complexity.展开更多
In the large-scale Distributed Virtual Environment(DVE)multimedia systems,one of key challenges is to distributedly preserve causal order delivery of messages in real time.Most of the existing causal order control app...In the large-scale Distributed Virtual Environment(DVE)multimedia systems,one of key challenges is to distributedly preserve causal order delivery of messages in real time.Most of the existing causal order control approaches with real-time constraints use vector time as causal control information which is closely coupled with system scales.As the scale expands,each message is attached a large amount of control information that introduces too much network transmission overhead to maintain the real-time causal order delivery.In this article,a novel Lightweight Real-Time Causal Order(LRTCO)algorithm is proposed for large-scale DVE multimedia systems.LRTCO predicts and compares the network transmission times of messages so as to select the proper causal control information of which the amount is dynamically adapted to the network latency variations and unconcerned with system scales.The control information in LRTCO is effective to preserve causal order delivery of messages and lightweight to maintain the real-time property of DVE systems.Experimental results demonstrate that LRTCO costs low transmission overhead and communication bandwidth,reduces causal order violations efficiently,and improves the scalability of DVE systems.展开更多
This paper introduces several related distributed algorithms,generalised from the celebrated belief propagation algorithm for statistical learning.These algorithms are suitable for a class of computational problems in...This paper introduces several related distributed algorithms,generalised from the celebrated belief propagation algorithm for statistical learning.These algorithms are suitable for a class of computational problems in largescale networked systems,ranging from average consensus,sensor fusion,distributed estimation,distributed optimisation,distributed control,and distributed learning.By expressing the underlying computational problem as a sparse linear system,each algorithm operates at each node of the network graph and computes iteratively the desired solution.The behaviours of these algorithms are discussed in terms of the network graph topology and parameters of the corresponding computational problem.A number of examples are presented to illustrate their applications.Also introduced is a message-passing algorithm for distributed convex optimisation.展开更多
A distributed model predictive control(MPC) scheme with one-step delay communication is proposed for on-line optimization and control of large-scale systems in this paper. Cooperation between subsystems is achieved by...A distributed model predictive control(MPC) scheme with one-step delay communication is proposed for on-line optimization and control of large-scale systems in this paper. Cooperation between subsystems is achieved by exchanging information with neighbor-to-neighbor communication and by optimizing the local problem with the improved performance index in the neighborhood. A distributed MPC algorithm with one-step delay communication is developed for the situation that there is a one-step delay in the information available from its neighbors when a subsystem solves the local optimization problem. The nominal stability is employed for the whole system under the distributed MPC algorithm without the inequality constraints. Finally, the case study of the reactor-storage-separator(RSS) system is illustrated to test the practicality of the presented control algorithm.展开更多
Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often on...Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.展开更多
The rigid structure of the traditional relational database leads to data redundancy,which seriously affects the efficiency of the data query and cannot effectively manage massive data.To solve this problem,we use dist...The rigid structure of the traditional relational database leads to data redundancy,which seriously affects the efficiency of the data query and cannot effectively manage massive data.To solve this problem,we use distributed storage and parallel computing technology to query RDF data.In order to achieve efficient storage and retrieval of large-scale RDF data,we combine the respective advantage of the storage model of the relational database and the distributed query.To overcome the disadvantages of storing and querying RDF data,we design and implement a breadth-first path search algorithm based on the keyword query on a distributed platform.We conduct the LUBM query statements respectively with the selected data sets.In experiments,we compare query response time in different conditions to evaluate the feasibility and correctness of our approaches.The results show that the proposed scheme can reduce the storage cost and improve query efficiency.展开更多
1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Int...1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.展开更多
The recent upsurge in metro construction emphasizes the necessity of understanding the mechanical performance of metro shield tunnel subjected to the influence of ground fissures.In this study,a largescale experiment,...The recent upsurge in metro construction emphasizes the necessity of understanding the mechanical performance of metro shield tunnel subjected to the influence of ground fissures.In this study,a largescale experiment,in combination with numerical simulation,was conducted to investigate the influence of ground fissures on a metro shield tunnel.The results indicate that the lining contact pressure at the vault increases in the hanging wall while decreases in the footwall,resulting in a two-dimensional stress state of vertical shear and axial tension-compression,and simultaneous vertical dislocation and axial tilt for the segments around the ground fissure.In addition,the damage to curved bolts includes tensile yield,flexural yield,and shear twist,leading to obvious concrete lining damage,particularly at the vault,arch bottom,and hance,indicating that the joints in these positions are weak areas.The shield tunnel orthogonal to the ground fissure ultimately experiences shear failure,suggesting that the maximum actual dislocation of ground fissure that the structure can withstand is approximately 20 cm,and five segment rings in the hanging wall and six segment rings in the footwall also need to be reinforced.This study could provide a reference for metro design in ground fissure sites.展开更多
Three-dimensional normal grain growth was appropriately simulated using a Potts model Monte Carlo algorithm. The quasi-stationary grain size distribution obtained from simulation agreed well with the experimental resu...Three-dimensional normal grain growth was appropriately simulated using a Potts model Monte Carlo algorithm. The quasi-stationary grain size distribution obtained from simulation agreed well with the experimental result of pure iron. The Weibull function with a parameter β=2.77 and the Yu-Liu function with a parameter v =2.71 fit the quasi-stationary grain size distribution well. The grain volume distribution is a function that decreased exponentially with increasing grain volume. The distribution of boundary area of grains has a peak at S/〈S〉=0.5, where S is the boundary area of a grain and 〈S〉 is the mean boundary area of all grains in the system. The lognormal function fits the face number distribution well and the peak of the face number distribution is f=10. The mean radius off-faced grains is not proportional to the face number, but appears to be related by a curve convex upward. In the 2D cross-section, both the perimeter law and the Aboav-Weaire law are observed to hold.展开更多
Large-scale detachment faults on mid-ocean ridges （MORs） provide a window into the deeper earth. They have megamullion on their corrugated surfaces, with exposed lower crustal and upper mantle rocks, rela- tively hi...Large-scale detachment faults on mid-ocean ridges （MORs） provide a window into the deeper earth. They have megamullion on their corrugated surfaces, with exposed lower crustal and upper mantle rocks, rela- tively high residual Bouguer gravity anomaly and P-wave velocity, and are commonly associated with ocean- ic core complex. According to 30 detachment faults identified on MORs, we found that their distances to the axis mostly range from 5 to 50 km, half-spreading rates range from 6.8 to 17 mm/a, and activity time ranges from recent to 3 Ma. Most of the detachment faults are developed on the slow spreading Mid-Atlantic Ridge （MAR） and ultra-slow spreading Southwest Indian Ridge （SWIRl, with the dominant half-spreading rates of 7-13 mm/a, especially 10-13 mm/a. Furthermore, they mostly occur at the inside corner of one segment end and result in an asymmetric seafloor spreading. The detachment faults on MORs are mainly controlled by the tectonism and influenced by the magmatism. Long-lived detachment faults tend to be formed where the ridge magma supply is at a moderate level, although the tectonism is a first-order controlling factor. At the slow spreading ridges, detachment faults tend to occur where local magma supply is relatively low, whilst at the ultra-slow spreading ridges, they normally occur where local magma supply is relatively high. These faults are accompanied by hydrothermal activities, with their relationships being useful in the study of hydrothermal polymetallic sulfides and their origin.展开更多
The 5.12 Wenchuan Earthquake in 2008 induced hundreds of large-scale landslides. This paper systematically analyzes 112 large-scale landslides (surface area > 50000 m2), which were identified by interpretation of r...The 5.12 Wenchuan Earthquake in 2008 induced hundreds of large-scale landslides. This paper systematically analyzes 112 large-scale landslides (surface area > 50000 m2), which were identified by interpretation of remote sensing imagery and field investigations. The analysis suggests that the distribution of large-scale landslides is affected by the following four factors: (a) distance effect: 80% of studied large-scale landslides are located within a distance of 5 km from the seismic faults. The farther the distance to the faults, the lower the number of large-scale landslides; (b) locked segment effect: the large-scale landslides are mainly located in five concentration zones closely related with the crossing, staggering and transfer sections between one seismic fault section and the next one, as well as the end of the NE fault section. The zone with the highest concentration was the Hongbai-Chaping segment, where a great number of large-scale landslides including the two largest landslides were located. The second highest concentration of large-scale landslides was observed in the Nanba-Donghekou segment at the end of NE fault, where the Donghekou landslide and the Woqian landslide occurred; (c) Hanging wall effect: about 70% of the large-scale landslides occurred on the hanging wall of the seismic faults; and (d) direction effect: in valleys perpendicular to the seismic faults, the density of large-scale landslides on the slopes facing the seismic wave is obviously higher than that on the slopes dipping in the same direction as the direction of propagation of the seismic wave. Meanwhile, it is found that the sliding and moving directions of large-scale landslides are related to the staggering direction of the faults in each section. In Qingchuan County where the main fault activity was horizontal twisting and staggering, a considerable number of landslides showed the feature of sliding and moving in NE direction which coincides with the staggering direction of the seismic faults.展开更多
With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become ...With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become a research hotspot, and the security of the oracle responsible for providing reliable data has attracted much attention. The most widely used centralized oracles in blockchain, such as Provable and Town Crier, all rely on a single oracle to obtain data, which suffers from a single point of failure and limits the large-scale development of blockchain. To this end, the distributed oracle scheme is put forward, but the existing distributed oracle schemes such as Chainlink and Augur generally have low execution efficiency and high communication overhead, which leads to their poor applicability. To solve the above problems, this paper proposes a trusted distributed oracle scheme based on a share recovery threshold signature. First, a data verification method of distributed oracles is designed based on threshold signature. By aggregating the signatures of oracles, data from different data sources can be mutually verified, leading to a more efficient data verification and aggregation process. Then, a credibility-based cluster head election algorithm is designed, which reduces the communication overhead by clarifying the function distribution and building a hierarchical structure. Considering the good performance of the BLS threshold signature in large-scale applications, this paper combines it with distributed oracle technology and proposes a BLS threshold signature algorithm that supports share recovery in distributed oracles. The share recovery mechanism enables the proposed scheme to solve the key loss issue, and the setting of the threshold value enables the proposed scheme to complete signature aggregation with only a threshold number of oracles, making the scheme more robust. Finally, experimental results indicate that, by using the threshold signature technology and the cluster head election algorithm, our scheme effectively improves the execution efficiency of oracles and solves the problem of a single point of failure, leading to higher scalability and robustness.展开更多
The titanium alloy strut serves as a key load-bearing component of aircraft landing gear,typically manufactured via forging.The friction condition has important influence on material flow and cavity filling during the...The titanium alloy strut serves as a key load-bearing component of aircraft landing gear,typically manufactured via forging.The friction condition has important influence on material flow and cavity filling during the forging process.Using the previously optimized shape and initial position of preform,the influence of the friction condition(friction factor m=0.1–0.3)on material flow and cavity filling was studied by numerical method with a shear friction model.A novel filling index was defined to reflect material flow into left and right flashes and zoom in on friction-induced results.The results indicate that the workpiece moves rigidly to the right direction,with the displacement decreasing as m increases.When m<0.18,the underfilling defect will occur in the left side of strut forging,while overflow occurs in the right forging die cavity.By combining the filling index and analyses of material flow and filling status,a reasonable friction factor interval of m=0.21–0.24 can be determined.Within this interval,the cavity filling behavior demonstrates robustness,with friction fluctuations exerting minimal influence.展开更多
文摘This paper investigates large-scale distributed system design. It looks at features, main design considerations and provides the Netflix API, Cassandra and Oracle as examples of such systems. Moreover, the paper investigates the challenges of designing, developing, deploying, and maintaining such systems, in regard to the features presented. Finally, the paper discusses aspects of available solutions and current practices to challenges that large-scale distributed systems face.
文摘The construction of island power grids is a systematic engineering task.To ensure the safe operation of power grid systems,optimizing the line layout of island power grids is crucial.Especially in the current context of large-scale distributed renewable energy integration into the power grid,conventional island power grid line layouts can no longer meet actual demands.It is necessary to combine the operational characteristics of island power systems and historical load data to perform load forecasting,thereby generating power grid line layout paths.This article focuses on large-scale distributed renewable energy integration,summarizing optimization strategies for island power grid line layouts,and providing a solid guarantee for the safe and stable operation of island power systems.
基金This work was supported in part by the National Natural Science Foundation of China(61772493)the CAAI-Huawei MindSpore Open Fund(CAAIXSJLJJ-2020-004B)+4 种基金the Natural Science Foundation of Chongqing(China)(cstc2019jcyjjqX0013)Chongqing Research Program of Technology Innovation and Application(cstc2019jscx-fxydX0024,cstc2019jscx-fxydX0027,cstc2018jszx-cyzdX0041)Guangdong Province Universities and College Pearl River Scholar Funded Scheme(2019)the Pioneer Hundred Talents Program of Chinese Academy of Sciencesthe Deanship of Scientific Research(DSR)at King Abdulaziz University(G-21-135-38).
文摘Protein-protein interactions are of great significance for human to understand the functional mechanisms of proteins.With the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them efficiently.To address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using MapReduce.To do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and prediction.Respective solutions are then devised to overcome these limitations.In particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of proteins.After that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and accuracy.Experimental results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.
文摘In this paper a short-circuit computation(SCC) procedure for large-scale distribution systems with high penetration of distributed generators based on contemporary technologies is proposed. The procedure is suitable for real-time calculations.Modeling of modern distributed generators differs from the modeling of traditional synchronous and induction generators.Hence, SCC procedures found on the presumption of distribution systems with only traditional generators are not suitable in nowadays systems. In the work presented in this paper, for computation of the state of the system with short-circuit, the improved backward/forward sweep(IBFS) procedure is used.Computation results show that the IBFS procedure is much more robust than previous SCC procedures, as it takes into account all distribution system elements, including modern distributed generators.
文摘Distributed photovoltaic power (PV) is the main development model of distributed generation. It is necessary to research on dispatching and operation management with large-scale distributed PV connected. This paper analyzes development status, technical requirement and dispatching and operation management situation of distributed PV in Germany and China. Then introduce the preparation of distributed PV dispatching and operation management criterion. Through summarizing the experiences and lessons of large-scale distributed PV development in Germany, it gives advice to the development of distributed PV dispatching and operation management in China.
文摘This paper examines the results of the distributed generation penetration in large-scale medium-voltage power distribution networks. The network examined as a study case consists of twenty one lines fed by three power substations. The injected power comes mainly from photovoltaic units. Specifically, the influences of distributed generation on the network branch currents, losses and voltage profile as well as on the short-circuit level at the medium voltage busbars of the infeeding substations are examined according to international and national standards. The arising problems are explored and technical solutions are proposed. This paper is a pilot application as general conclusions concerning the extended distributed generation penetration in real power distribution networks are set out.
基金supported by National Natural Science Foundation of China(Grant No.61761011)Natural Science Foundation of Guangxi(Grant No.2020GXNSFBA297078).
文摘In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(No.61201086,61272495)the China Scholarship Council(No.201506375060)+1 种基金the Planned Science and Technology Project of Guangdong Province(No.2013B090500007) the Dongguan Project on the Integration of Industry,Education and Research(No.2014509102205)
文摘An antenna selection algorithm based on large-scale fading between the transmitter and receiver is proposed for the uplink receive antenna selection in distributed multiple-input multiple-output(D-MIMO) systems. By utilizing the radio access units(RAU) selection based on large-scale fading,the proposed algorithm decreases enormously the computational complexity. Based on the characteristics of distributed systems,an improved particle swarm optimization(PSO) has been proposed for the antenna selection after the RAU selection. In order to apply the improved PSO algorithm better in antenna selection,a general form of channel capacity was transformed into a binary expression by analyzing the formula of channel capacity. The proposed algorithm can make full use of the advantages of D-MIMO systems,and achieve near-optimal performance in terms of channel capacity with low computational complexity.
基金This research work is supported by Hunan Provincial Natural Science Foundation of China(Grant No.2017JJ2016)Hunan Provincial Education Science 13th Five-Year Plan(Grant No.XJK016BXX001)+3 种基金Social Science Foundation of Hunan Province(Grant No.17YBA049)2017 Hunan Provincial Higher Education Teaching Re-form Research Project(Grant No.564)Scientific Research Fund of Hunan Provin-cial Education Department(Grant No.16C0269 and No.17B046)The work is also sup-ported by Open foundation for University Innovation Platform from Hunan Province,China(Grand No.16K013)and the 2011 Collaborative Innovation Center of Big Data for Finan-cial and Economical Asset Development and Utility in Universities of Hunan Province.We also thank the anonymous reviewers for their valuable comments and insightful sug-gestions.
文摘In the large-scale Distributed Virtual Environment(DVE)multimedia systems,one of key challenges is to distributedly preserve causal order delivery of messages in real time.Most of the existing causal order control approaches with real-time constraints use vector time as causal control information which is closely coupled with system scales.As the scale expands,each message is attached a large amount of control information that introduces too much network transmission overhead to maintain the real-time causal order delivery.In this article,a novel Lightweight Real-Time Causal Order(LRTCO)algorithm is proposed for large-scale DVE multimedia systems.LRTCO predicts and compares the network transmission times of messages so as to select the proper causal control information of which the amount is dynamically adapted to the network latency variations and unconcerned with system scales.The control information in LRTCO is effective to preserve causal order delivery of messages and lightweight to maintain the real-time property of DVE systems.Experimental results demonstrate that LRTCO costs low transmission overhead and communication bandwidth,reduces causal order violations efficiently,and improves the scalability of DVE systems.
基金supported in part by the of National Natural Science Foundation of China(U21A20476,U1911401,U22A20221,62273100,62073090).
文摘This paper introduces several related distributed algorithms,generalised from the celebrated belief propagation algorithm for statistical learning.These algorithms are suitable for a class of computational problems in largescale networked systems,ranging from average consensus,sensor fusion,distributed estimation,distributed optimisation,distributed control,and distributed learning.By expressing the underlying computational problem as a sparse linear system,each algorithm operates at each node of the network graph and computes iteratively the desired solution.The behaviours of these algorithms are discussed in terms of the network graph topology and parameters of the corresponding computational problem.A number of examples are presented to illustrate their applications.Also introduced is a message-passing algorithm for distributed convex optimisation.
基金the National Natural Science Foundation of China(No.61203110)the Shanghai Natural Science Foundation(No.13ZR1418900)the Innovation Programs of Shanghai Municipal Education Commission(Nos.12ZZ155 and 14YZ107)
文摘A distributed model predictive control(MPC) scheme with one-step delay communication is proposed for on-line optimization and control of large-scale systems in this paper. Cooperation between subsystems is achieved by exchanging information with neighbor-to-neighbor communication and by optimizing the local problem with the improved performance index in the neighborhood. A distributed MPC algorithm with one-step delay communication is developed for the situation that there is a one-step delay in the information available from its neighbors when a subsystem solves the local optimization problem. The nominal stability is employed for the whole system under the distributed MPC algorithm without the inequality constraints. Finally, the case study of the reactor-storage-separator(RSS) system is illustrated to test the practicality of the presented control algorithm.
基金partially supported by US NSF under Grant No.NSF-CNS-1066391and No.NSF-CNS-0914371,NSF-CPS-1135814 and NSF-CDI-1125165
文摘Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.
基金This work is supported in part by National Natural Science Foundation of China(61728204)Innovation Funding(NJ20160028,NT2018027,NT2018028,NS2018057)+1 种基金Aeronautical Science Foundation of China(2016551500)State Key Laboratory for smart grid protection and operation control Foundation,Association of Chinese Graduate Education(ACGE).
文摘The rigid structure of the traditional relational database leads to data redundancy,which seriously affects the efficiency of the data query and cannot effectively manage massive data.To solve this problem,we use distributed storage and parallel computing technology to query RDF data.In order to achieve efficient storage and retrieval of large-scale RDF data,we combine the respective advantage of the storage model of the relational database and the distributed query.To overcome the disadvantages of storing and querying RDF data,we design and implement a breadth-first path search algorithm based on the keyword query on a distributed platform.We conduct the LUBM query statements respectively with the selected data sets.In experiments,we compare query response time in different conditions to evaluate the feasibility and correctness of our approaches.The results show that the proposed scheme can reduce the storage cost and improve query efficiency.
基金supported by the National Key Research and Development Program of China(2022YFE0206700)。
文摘1.Introduction Climate change mitigation pathways aimed at limiting global anthropogenic carbon dioxide(CO_(2))emissions while striving to constrain the global temperature increase to below 2℃—as outlined by the Intergovernmental Panel on Climate Change(IPCC)—consistently predict the widespread implementation of CO_(2)geological storage on a global scale.
基金supported by the National Key Research&Development Program of China(Grant No.2023YFC3008404)the Key Laboratory of Earth Fissures Geological Disaster,Ministry of Natural Resources,China(Grant Nos.EFGD20240609 and EFGD20240610).
文摘The recent upsurge in metro construction emphasizes the necessity of understanding the mechanical performance of metro shield tunnel subjected to the influence of ground fissures.In this study,a largescale experiment,in combination with numerical simulation,was conducted to investigate the influence of ground fissures on a metro shield tunnel.The results indicate that the lining contact pressure at the vault increases in the hanging wall while decreases in the footwall,resulting in a two-dimensional stress state of vertical shear and axial tension-compression,and simultaneous vertical dislocation and axial tilt for the segments around the ground fissure.In addition,the damage to curved bolts includes tensile yield,flexural yield,and shear twist,leading to obvious concrete lining damage,particularly at the vault,arch bottom,and hance,indicating that the joints in these positions are weak areas.The shield tunnel orthogonal to the ground fissure ultimately experiences shear failure,suggesting that the maximum actual dislocation of ground fissure that the structure can withstand is approximately 20 cm,and five segment rings in the hanging wall and six segment rings in the footwall also need to be reinforced.This study could provide a reference for metro design in ground fissure sites.
基金supported by the National Natural Science Foundation of China (No.50671010)
文摘Three-dimensional normal grain growth was appropriately simulated using a Potts model Monte Carlo algorithm. The quasi-stationary grain size distribution obtained from simulation agreed well with the experimental result of pure iron. The Weibull function with a parameter β=2.77 and the Yu-Liu function with a parameter v =2.71 fit the quasi-stationary grain size distribution well. The grain volume distribution is a function that decreased exponentially with increasing grain volume. The distribution of boundary area of grains has a peak at S/〈S〉=0.5, where S is the boundary area of a grain and 〈S〉 is the mean boundary area of all grains in the system. The lognormal function fits the face number distribution well and the peak of the face number distribution is f=10. The mean radius off-faced grains is not proportional to the face number, but appears to be related by a curve convex upward. In the 2D cross-section, both the perimeter law and the Aboav-Weaire law are observed to hold.
基金The National Natural Science Foundation of China under contract Nos 91028006 and 41206046the Dayang 115 under contact No.DYXM-115-02-3-01
文摘Large-scale detachment faults on mid-ocean ridges （MORs） provide a window into the deeper earth. They have megamullion on their corrugated surfaces, with exposed lower crustal and upper mantle rocks, rela- tively high residual Bouguer gravity anomaly and P-wave velocity, and are commonly associated with ocean- ic core complex. According to 30 detachment faults identified on MORs, we found that their distances to the axis mostly range from 5 to 50 km, half-spreading rates range from 6.8 to 17 mm/a, and activity time ranges from recent to 3 Ma. Most of the detachment faults are developed on the slow spreading Mid-Atlantic Ridge （MAR） and ultra-slow spreading Southwest Indian Ridge （SWIRl, with the dominant half-spreading rates of 7-13 mm/a, especially 10-13 mm/a. Furthermore, they mostly occur at the inside corner of one segment end and result in an asymmetric seafloor spreading. The detachment faults on MORs are mainly controlled by the tectonism and influenced by the magmatism. Long-lived detachment faults tend to be formed where the ridge magma supply is at a moderate level, although the tectonism is a first-order controlling factor. At the slow spreading ridges, detachment faults tend to occur where local magma supply is relatively low, whilst at the ultra-slow spreading ridges, they normally occur where local magma supply is relatively high. These faults are accompanied by hydrothermal activities, with their relationships being useful in the study of hydrothermal polymetallic sulfides and their origin.
基金sponsored by the project of the Chinese National Key Basic Research Program on "The failure mechanism and distribution rule of slopes under strong earthquakes" (Grant No. 2008CB425801)the Education Department Innovation Research Team Program (Grant No. IRT0812)
文摘The 5.12 Wenchuan Earthquake in 2008 induced hundreds of large-scale landslides. This paper systematically analyzes 112 large-scale landslides (surface area > 50000 m2), which were identified by interpretation of remote sensing imagery and field investigations. The analysis suggests that the distribution of large-scale landslides is affected by the following four factors: (a) distance effect: 80% of studied large-scale landslides are located within a distance of 5 km from the seismic faults. The farther the distance to the faults, the lower the number of large-scale landslides; (b) locked segment effect: the large-scale landslides are mainly located in five concentration zones closely related with the crossing, staggering and transfer sections between one seismic fault section and the next one, as well as the end of the NE fault section. The zone with the highest concentration was the Hongbai-Chaping segment, where a great number of large-scale landslides including the two largest landslides were located. The second highest concentration of large-scale landslides was observed in the Nanba-Donghekou segment at the end of NE fault, where the Donghekou landslide and the Woqian landslide occurred; (c) Hanging wall effect: about 70% of the large-scale landslides occurred on the hanging wall of the seismic faults; and (d) direction effect: in valleys perpendicular to the seismic faults, the density of large-scale landslides on the slopes facing the seismic wave is obviously higher than that on the slopes dipping in the same direction as the direction of propagation of the seismic wave. Meanwhile, it is found that the sliding and moving directions of large-scale landslides are related to the staggering direction of the faults in each section. In Qingchuan County where the main fault activity was horizontal twisting and staggering, a considerable number of landslides showed the feature of sliding and moving in NE direction which coincides with the staggering direction of the seismic faults.
基金supported by the National Natural Science Foundation of China(Grant No.62102449)the Central Plains Talent Program under Grant No.224200510003.
文摘With the increasing popularity of blockchain applications, the security of data sources on the blockchain is gradually receiving attention. Providing reliable data for the blockchain safely and efficiently has become a research hotspot, and the security of the oracle responsible for providing reliable data has attracted much attention. The most widely used centralized oracles in blockchain, such as Provable and Town Crier, all rely on a single oracle to obtain data, which suffers from a single point of failure and limits the large-scale development of blockchain. To this end, the distributed oracle scheme is put forward, but the existing distributed oracle schemes such as Chainlink and Augur generally have low execution efficiency and high communication overhead, which leads to their poor applicability. To solve the above problems, this paper proposes a trusted distributed oracle scheme based on a share recovery threshold signature. First, a data verification method of distributed oracles is designed based on threshold signature. By aggregating the signatures of oracles, data from different data sources can be mutually verified, leading to a more efficient data verification and aggregation process. Then, a credibility-based cluster head election algorithm is designed, which reduces the communication overhead by clarifying the function distribution and building a hierarchical structure. Considering the good performance of the BLS threshold signature in large-scale applications, this paper combines it with distributed oracle technology and proposes a BLS threshold signature algorithm that supports share recovery in distributed oracles. The share recovery mechanism enables the proposed scheme to solve the key loss issue, and the setting of the threshold value enables the proposed scheme to complete signature aggregation with only a threshold number of oracles, making the scheme more robust. Finally, experimental results indicate that, by using the threshold signature technology and the cluster head election algorithm, our scheme effectively improves the execution efficiency of oracles and solves the problem of a single point of failure, leading to higher scalability and robustness.
基金National Natural Science Foundation of China(52375378)National Key Laboratory of Metal Forming Technology and Heavy Equipment(S2308100.W12)Huxiang High-Level Talent Gathering Project of Hunan Province(2021RC5001)。
文摘The titanium alloy strut serves as a key load-bearing component of aircraft landing gear,typically manufactured via forging.The friction condition has important influence on material flow and cavity filling during the forging process.Using the previously optimized shape and initial position of preform,the influence of the friction condition(friction factor m=0.1–0.3)on material flow and cavity filling was studied by numerical method with a shear friction model.A novel filling index was defined to reflect material flow into left and right flashes and zoom in on friction-induced results.The results indicate that the workpiece moves rigidly to the right direction,with the displacement decreasing as m increases.When m<0.18,the underfilling defect will occur in the left side of strut forging,while overflow occurs in the right forging die cavity.By combining the filling index and analyses of material flow and filling status,a reasonable friction factor interval of m=0.21–0.24 can be determined.Within this interval,the cavity filling behavior demonstrates robustness,with friction fluctuations exerting minimal influence.
