The aim of this paper is to investigate a regional constrained optimal control problem for a class of semi[inear distributed systems, which are linear in the control but nonlinear in the state. For a quadratic cost fu...The aim of this paper is to investigate a regional constrained optimal control problem for a class of semi[inear distributed systems, which are linear in the control but nonlinear in the state. For a quadratic cost functional and a closed convex set of admissible controls, the existence of an optimal control is proven, and then this is characterized for three cases of constraints. A useful algorithm is developed, and the approach is illustrated through simulations for a heat equation.展开更多
Numerous edge-chasing deadlock detection algonthms were developed lor the cycle detection in distributed systems, but their detections had the n steps speed limitation and n （ n- 1） overhead limitation to detect a c...Numerous edge-chasing deadlock detection algonthms were developed lor the cycle detection in distributed systems, but their detections had the n steps speed limitation and n （ n- 1） overhead limitation to detect a cycle of size n under the one-resource request model. Since fast deadlock detection is critical, this paper proposed a new algorithm to speed up the detection process. In our algorithm, when the running of a transaction node is blocked, the being requested resource nodes reply it with the waiting or being waited message simultaneously, so the blocked node knows both its predecessors and successors, which helps it detecting a cycle of size 2 directly and locally. For the cycle of size n （ n 〉 2）, a special probe is produced which has the predecessors information of its originator, so the being detected nodes know their indirect predecessors and direct successors, and can detect the cycle within n - 2 steps. The proposed algorithm is formally proved to be correct by the invariant verification method. Performance evaluation shows that the message overhead of our detection is （ n^2 - n - 2）/2, hence both the detection speed and message cost of the proposed algorithm are better than that of the existing al gorithms.展开更多
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 rapid development of artificial intelligence(AI)technology,particularly breakthroughs in branches such as deep learning,reinforcement learning,and federated learning,has provided powerful technical tools for addre...The rapid development of artificial intelligence(AI)technology,particularly breakthroughs in branches such as deep learning,reinforcement learning,and federated learning,has provided powerful technical tools for addressing these core bottlenecks.This paper provides a systematic review of the research background,technological evolution,core systems,key challenges,and future directions of AI technology in the field of distributed photovoltaic power generation system optimization.At the same time,this paper analyzes the current technical bottlenecks and cutting-edge response strategies.Finally,it explores fusion innovation directions such as quantum-classical hybrid algorithms and neural symbolic systems,as well as business model expansion paths such as carbon finance integration and community energy autonomy.展开更多
In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed system does not have a central administrator, all independent pr...In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed system does not have a central administrator, all independent processing units in this system want to cooperate for the best results, but they cannot know the conditions of one another. So in order to undertake the tasks in admirable pro portions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this system is analyzed by Markov chains, and a robust method of self-learning for independent processing units in this kind of systems is presented. This method can lead the tasks of the system to be distributed very well among all the independent processing units, and can also be used to solve the general assignment problem.展开更多
The performance of distributed computing systems is partially dependent on configuration parameters recorded in configuration files. Evolutionary strategies, with their ability to have a global view of the structural ...The performance of distributed computing systems is partially dependent on configuration parameters recorded in configuration files. Evolutionary strategies, with their ability to have a global view of the structural information, have been shown to effectively improve performance. However, most of these methods consume too much measurement time. This paper introduces an ordinal optimization based strategy combined with a back propagation neural network for autotuning of the configuration parameters. The strat- egy was first proposed in the automation community for complex manufacturing system optimization and is customized here for improving distributed system performance. The method is compared with the covariance matrix algorithm. Tests using a real distributed system with three-tier servers show that the strategy reduces the testing time by 40% on average at a reasonable performance cost.展开更多
The paper investigates applicability of the developed high-level model and technology for solution of diverse problems in large distributed dynamic systems which can provide sufficient awareness of their structures,or...The paper investigates applicability of the developed high-level model and technology for solution of diverse problems in large distributed dynamic systems which can provide sufficient awareness of their structures,organization,and functionalities.After the review of meanings of awareness and existing approaches for its expression and support,the paper shows application of the Spatial Grasp Model and Technology(SGT)and its basic Spatial Grasp Language(SGL)for very practical awareness solutions in large distributed dynamic systems,with obtaining any knowledge from any point inside or outside the system.The self-evolving,self-replicating,and self-recovering scenario code in SGL can effectively supervise distributed systems under any circumstances including rapidly changing number of their elements.Examples are provided in SGL for distributed networked systems showing how in any node any information about other nodes and links,including the whole system,can be obtained by using network requesting patterns based on recursive scenarios combining forward and backward network matching and coverage.The returned results may be automatically organized in networked patterns too.The presented exemplary solutions are parallel and fully distributed,without the need of using vulnerable centralized resources,also very compact.This can be explained by fundamentally different philosophy and ideology of SGT which is not based on traditional partitioned systems representation and multiple agent communications.On the contrary,SGT and its basic language supervise and control distributed systems by holistic self-spreading recursive code in wavelike,virus-like,and even“soul-like”mode.展开更多
The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in...The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingthe significance of using cutting-edge technology to meet rising privacy issues in digital identity.展开更多
Referring to a set of real time tasks with arriving time,executing time and deadline,this paperdiscusses the problem of polynomial time initial-allocating approximation algorithms in a distributedsystem and five new r...Referring to a set of real time tasks with arriving time,executing time and deadline,this paperdiscusses the problem of polynomial time initial-allocating approximation algorithms in a distributedsystem and five new results are gained which provide a theory for the designing of initial-allocating algorithmsof real time tasks.展开更多
Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and...Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of processing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel approach to detecting deadlocks in distributed system by using mobile agents, which demonstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD （Mobile Agent Enabled Deadlock Detection） scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detection strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.展开更多
In an addition to the variety of topics in aims and scope of the Journal of International Relations and Diplomacy, we would be happy to offer here some more areas in line with its general orientation, which could be w...In an addition to the variety of topics in aims and scope of the Journal of International Relations and Diplomacy, we would be happy to offer here some more areas in line with its general orientation, which could be worth investigating, encouraging more paper submissions. These relate to effective organization of large distributed dynamic systems of diverse natures which may require innovative solutions reflecting the growing world dynamics in the 21 st century with emerging challenges and threats to local and global prosperity, stability, and safety.展开更多
The exponential stabilization problem for finite dimensional switched systems is extended to the infinite dimensional distributed parameter systems in the Hilbert space. Based on the semigroup theory, by applying the ...The exponential stabilization problem for finite dimensional switched systems is extended to the infinite dimensional distributed parameter systems in the Hilbert space. Based on the semigroup theory, by applying the multiple Lyapunov function method, the exponential stabilization conditions are derived. These conditions are given in the form of linear operator inequalities where the decision variables are operators in the Hilbert space; while the stabilization properties depend on the switching rule. Being applied to the two-dimensional heat switched propagation equations with the Dirichlet boundary conditions, these linear operator inequalities are transformed into standard linear matrix inequalities. Finally, two examples are given to illustrate the effectiveness of the proposed results.展开更多
In this paper,the control problem of distributed parameter systems is investigated by using wireless sensor and actuator networks with the observer-based method.Firstly,a centralized observer which makes use of the me...In this paper,the control problem of distributed parameter systems is investigated by using wireless sensor and actuator networks with the observer-based method.Firstly,a centralized observer which makes use of the measurement information provided by the fixed sensors is designed to estimate the distributed parameter systems.The mobile agents,each of which is affixed with a controller and an actuator,can provide the observer-based control for the target systems.By using Lyapunov stability arguments,the stability for the estimation error system and distributed parameter control system is proved,meanwhile a guidance scheme for each mobile actuator is provided to improve the control performance.A numerical example is finally used to demonstrate the effectiveness and the advantages of the proposed approaches.展开更多
The robust stability and robust sliding mode control problems are studied for a class of linear distributed time-delay systems with polytopic-type uncertainties by applying the parameter-dependent Lyapunov functional ...The robust stability and robust sliding mode control problems are studied for a class of linear distributed time-delay systems with polytopic-type uncertainties by applying the parameter-dependent Lyapunov functional approach combining with a new method of introducing some relaxation matrices and tuning parameters, which can be chosen properly to lead to a less conservative result. First, a sufficient condition is proposed for robust stability of the autonomic system; next, the sufficient conditions of the robust stabilization controller and the existence condition of sliding mode are developed. The results are given in terms of linear matrix inequalities （LMIs）, which can be solved via efficient interior-point algorithms. A numerical example is presented to illustrate the feasibility and advantages of the proposed design scheme.展开更多
A guidance policy for controller performance enhancement utilizing mobile sensor-actuator networks （MSANs） is proposed for a class of distributed parameter systems （DPSs）, which are governed by diffusion partial d...A guidance policy for controller performance enhancement utilizing mobile sensor-actuator networks （MSANs） is proposed for a class of distributed parameter systems （DPSs）, which are governed by diffusion partial differential equations （PDEs） with time-dependent spatial domains. Several sufficient conditions for controller performance enhancement are presented. First, the infinite dimensional operator theory is used to derive an abstract evolution equation of the systems under some rational assumptions on the operators, and a static output feedback controller is designed to control the spatial process. Then, based on Lyapunov stability arguments, guidance policies for collocated and non-collocated MSANs are provided to enhance the performance of the proposed controller, which show that the time-dependent characteristic of the spatial domains can significantly affect the design of the mobile scheme. Finally, a simulation example illustrates the effectiveness of the proposed policy.展开更多
The performance of three wireless local-area network(WLAN) media access control(MAC) protocols is investigated and compared in the context of simulcast radioover-fiber-based distributed antenna systems(RoF-DASs) where...The performance of three wireless local-area network(WLAN) media access control(MAC) protocols is investigated and compared in the context of simulcast radioover-fiber-based distributed antenna systems(RoF-DASs) where multiple remote antenna units(RAUs) are connected to one access point(AP) with different-length fiber links.The three WLAN MAC protocols under investigation are distributed coordination function(DCF) in basic access mode,DCF in request/clear to send(RTS/CTS) exchange mode,and point coordination function(PCF).In the analysis,the inter-RAU hidden nodes problems and fiber-length difference effect are both taken into account.Results show that adaptive PCF mechanism has better throughput performances than the other two DCF modes,especially when the inserted fiber length is short.展开更多
In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth...In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.展开更多
This paper aims to improve the performance of a class of distributed parameter systems for the optimal switching of actuators and controllers based on event-driven control. It is assumed that in the available multiple...This paper aims to improve the performance of a class of distributed parameter systems for the optimal switching of actuators and controllers based on event-driven control. It is assumed that in the available multiple actuators, only one actuator can receive the control signal and be activated over an unfixed time interval, and the other actuators keep dormant. After incorporating a state observer into the event generator, the event-driven control loop and the minimum inter-event time are ultimately bounded. Based on the event-driven state feedback control, the time intervals of unfixed length can be obtained. The optimal switching policy is based on finite horizon linear quadratic optimal control at the beginning of each time subinterval. A simulation example demonstrate the effectiveness of the proposed policy.展开更多
A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environment...A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.展开更多
In recent years, networked distributed control systems（NDCS） have received research attention. Two of the main challenges that such systems face are possible delays in the communication network and the effect of str...In recent years, networked distributed control systems（NDCS） have received research attention. Two of the main challenges that such systems face are possible delays in the communication network and the effect of strong interconnections between agents. This paper considers an NDCS that has delays in the communication network, as well as strong interconnections between its agents. The control objective is to make each agent track efficiently a reference model by attenuating the effect of strong interconnections via feedback based on the delayed information. First, the authors assume that each agent knows its own dynamics, as well as the interconnection parameters, but receives information about the states of its neighbors with some communication delay. The authors propose a distributed control scheme and prove that if the interconnections can be weakened and if the communication delays are small enough, then the proposed scheme guarantees that the tracking error of each agent is bounded with a bound that depends on the size of the weakened interconnections and delays, and reduces to zero as these uncertainties reduce to zero. The authors then consider a more realistic situation where the interconnections between agents are unknown despite the cooperation and sharing of state information. For this case the authors propose a distributed adaptive control scheme and prove that the proposed scheme guarantees that the tracking errors are bounded and small in the mean square sense with respect to the size of the weakened interconnections and delays, provided the weakened interconnections and time delays are small enough. The authors then consider the case that each agent knows neither its dynamics nor the interconnection matrices. For this case the authors propose a distributed adaptive control scheme and prove that the proposed scheme guarantees that the tracking errors are bounded and small in the mean square sense provided the weakened interconnections and time delays are small enough. Finally, the authors present an illustrative example to present the applicability and effectiveness of the proposed schemes.展开更多
文摘The aim of this paper is to investigate a regional constrained optimal control problem for a class of semi[inear distributed systems, which are linear in the control but nonlinear in the state. For a quadratic cost functional and a closed convex set of admissible controls, the existence of an optimal control is proven, and then this is characterized for three cases of constraints. A useful algorithm is developed, and the approach is illustrated through simulations for a heat equation.
文摘Numerous edge-chasing deadlock detection algonthms were developed lor the cycle detection in distributed systems, but their detections had the n steps speed limitation and n （ n- 1） overhead limitation to detect a cycle of size n under the one-resource request model. Since fast deadlock detection is critical, this paper proposed a new algorithm to speed up the detection process. In our algorithm, when the running of a transaction node is blocked, the being requested resource nodes reply it with the waiting or being waited message simultaneously, so the blocked node knows both its predecessors and successors, which helps it detecting a cycle of size 2 directly and locally. For the cycle of size n （ n 〉 2）, a special probe is produced which has the predecessors information of its originator, so the being detected nodes know their indirect predecessors and direct successors, and can detect the cycle within n - 2 steps. The proposed algorithm is formally proved to be correct by the invariant verification method. Performance evaluation shows that the message overhead of our detection is （ n^2 - n - 2）/2, hence both the detection speed and message cost of the proposed algorithm are better than that of the existing al gorithms.
文摘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 rapid development of artificial intelligence(AI)technology,particularly breakthroughs in branches such as deep learning,reinforcement learning,and federated learning,has provided powerful technical tools for addressing these core bottlenecks.This paper provides a systematic review of the research background,technological evolution,core systems,key challenges,and future directions of AI technology in the field of distributed photovoltaic power generation system optimization.At the same time,this paper analyzes the current technical bottlenecks and cutting-edge response strategies.Finally,it explores fusion innovation directions such as quantum-classical hybrid algorithms and neural symbolic systems,as well as business model expansion paths such as carbon finance integration and community energy autonomy.
文摘In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed system does not have a central administrator, all independent processing units in this system want to cooperate for the best results, but they cannot know the conditions of one another. So in order to undertake the tasks in admirable pro portions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this system is analyzed by Markov chains, and a robust method of self-learning for independent processing units in this kind of systems is presented. This method can lead the tasks of the system to be distributed very well among all the independent processing units, and can also be used to solve the general assignment problem.
基金Supported by the National Natural Science Foundation of China(No. 60803017)the National Key Basic Research and Development (973) Program of China (Nos. 2011CB302505 and 2011CB302805)supported by 2010-2011 and 2011-2012 IBM Ph.D. Fellowships
文摘The performance of distributed computing systems is partially dependent on configuration parameters recorded in configuration files. Evolutionary strategies, with their ability to have a global view of the structural information, have been shown to effectively improve performance. However, most of these methods consume too much measurement time. This paper introduces an ordinal optimization based strategy combined with a back propagation neural network for autotuning of the configuration parameters. The strat- egy was first proposed in the automation community for complex manufacturing system optimization and is customized here for improving distributed system performance. The method is compared with the covariance matrix algorithm. Tests using a real distributed system with three-tier servers show that the strategy reduces the testing time by 40% on average at a reasonable performance cost.
文摘The paper investigates applicability of the developed high-level model and technology for solution of diverse problems in large distributed dynamic systems which can provide sufficient awareness of their structures,organization,and functionalities.After the review of meanings of awareness and existing approaches for its expression and support,the paper shows application of the Spatial Grasp Model and Technology(SGT)and its basic Spatial Grasp Language(SGL)for very practical awareness solutions in large distributed dynamic systems,with obtaining any knowledge from any point inside or outside the system.The self-evolving,self-replicating,and self-recovering scenario code in SGL can effectively supervise distributed systems under any circumstances including rapidly changing number of their elements.Examples are provided in SGL for distributed networked systems showing how in any node any information about other nodes and links,including the whole system,can be obtained by using network requesting patterns based on recursive scenarios combining forward and backward network matching and coverage.The returned results may be automatically organized in networked patterns too.The presented exemplary solutions are parallel and fully distributed,without the need of using vulnerable centralized resources,also very compact.This can be explained by fundamentally different philosophy and ideology of SGT which is not based on traditional partitioned systems representation and multiple agent communications.On the contrary,SGT and its basic language supervise and control distributed systems by holistic self-spreading recursive code in wavelike,virus-like,and even“soul-like”mode.
文摘The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingthe significance of using cutting-edge technology to meet rising privacy issues in digital identity.
文摘Referring to a set of real time tasks with arriving time,executing time and deadline,this paperdiscusses the problem of polynomial time initial-allocating approximation algorithms in a distributedsystem and five new results are gained which provide a theory for the designing of initial-allocating algorithmsof real time tasks.
文摘Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of processing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel approach to detecting deadlocks in distributed system by using mobile agents, which demonstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD （Mobile Agent Enabled Deadlock Detection） scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detection strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.
文摘In an addition to the variety of topics in aims and scope of the Journal of International Relations and Diplomacy, we would be happy to offer here some more areas in line with its general orientation, which could be worth investigating, encouraging more paper submissions. These relate to effective organization of large distributed dynamic systems of diverse natures which may require innovative solutions reflecting the growing world dynamics in the 21 st century with emerging challenges and threats to local and global prosperity, stability, and safety.
基金The National Natural Science Foundation of China(No.61273119,61104068,61374038)the Natural Science Foundation of Jiangsu Province(No.BK2011253)
文摘The exponential stabilization problem for finite dimensional switched systems is extended to the infinite dimensional distributed parameter systems in the Hilbert space. Based on the semigroup theory, by applying the multiple Lyapunov function method, the exponential stabilization conditions are derived. These conditions are given in the form of linear operator inequalities where the decision variables are operators in the Hilbert space; while the stabilization properties depend on the switching rule. Being applied to the two-dimensional heat switched propagation equations with the Dirichlet boundary conditions, these linear operator inequalities are transformed into standard linear matrix inequalities. Finally, two examples are given to illustrate the effectiveness of the proposed results.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61174021 and 61473136)the 111 Project of China(Grant No.B12018)
文摘In this paper,the control problem of distributed parameter systems is investigated by using wireless sensor and actuator networks with the observer-based method.Firstly,a centralized observer which makes use of the measurement information provided by the fixed sensors is designed to estimate the distributed parameter systems.The mobile agents,each of which is affixed with a controller and an actuator,can provide the observer-based control for the target systems.By using Lyapunov stability arguments,the stability for the estimation error system and distributed parameter control system is proved,meanwhile a guidance scheme for each mobile actuator is provided to improve the control performance.A numerical example is finally used to demonstrate the effectiveness and the advantages of the proposed approaches.
基金This work was partially supported by the National Natural Science Foundation of China(No.60504008).
文摘The robust stability and robust sliding mode control problems are studied for a class of linear distributed time-delay systems with polytopic-type uncertainties by applying the parameter-dependent Lyapunov functional approach combining with a new method of introducing some relaxation matrices and tuning parameters, which can be chosen properly to lead to a less conservative result. First, a sufficient condition is proposed for robust stability of the autonomic system; next, the sufficient conditions of the robust stabilization controller and the existence condition of sliding mode are developed. The results are given in terms of linear matrix inequalities （LMIs）, which can be solved via efficient interior-point algorithms. A numerical example is presented to illustrate the feasibility and advantages of the proposed design scheme.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61174021 and 61473136)
文摘A guidance policy for controller performance enhancement utilizing mobile sensor-actuator networks （MSANs） is proposed for a class of distributed parameter systems （DPSs）, which are governed by diffusion partial differential equations （PDEs） with time-dependent spatial domains. Several sufficient conditions for controller performance enhancement are presented. First, the infinite dimensional operator theory is used to derive an abstract evolution equation of the systems under some rational assumptions on the operators, and a static output feedback controller is designed to control the spatial process. Then, based on Lyapunov stability arguments, guidance policies for collocated and non-collocated MSANs are provided to enhance the performance of the proposed controller, which show that the time-dependent characteristic of the spatial domains can significantly affect the design of the mobile scheme. Finally, a simulation example illustrates the effectiveness of the proposed policy.
基金supported in part by National 973 Program(2012CB315705)NSFC Program(61302086,61271042,61107058, 61302016,and 61335002)+2 种基金Specialized Research Fund for the Doctoral Program of Higher Education(20130005120007)Program for New Century Excellent Talents in University(NCET-13-0682)Fundamental Research Funds for the Central Universities
文摘The performance of three wireless local-area network(WLAN) media access control(MAC) protocols is investigated and compared in the context of simulcast radioover-fiber-based distributed antenna systems(RoF-DASs) where multiple remote antenna units(RAUs) are connected to one access point(AP) with different-length fiber links.The three WLAN MAC protocols under investigation are distributed coordination function(DCF) in basic access mode,DCF in request/clear to send(RTS/CTS) exchange mode,and point coordination function(PCF).In the analysis,the inter-RAU hidden nodes problems and fiber-length difference effect are both taken into account.Results show that adaptive PCF mechanism has better throughput performances than the other two DCF modes,especially when the inserted fiber length is short.
基金supported in part by the National Natural Science Foundation of China (61640006, 61572188)the Natural Science Foundation of Shaanxi Province, China (2015JM6307, 2016JQ6011)the project of science and technology of Xi’an City (2017088CG/RC051(CADX002))
文摘In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating(MSR) codes and minimum bandwidth regenerating(MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating(LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group(4, 2) or(5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.
基金supported by the National Natural Science Foundation of China(Grant Nos.61174021 and 61104155)the Fundamental Research Funds for theCentral Universities,China(Grant Nos.JUDCF13037 and JUSRP51322B)+1 种基金the Programme of Introducing Talents of Discipline to Universities,China(GrantNo.B12018)the Jiangsu Innovation Program for Graduates,China(Grant No.CXZZ13-0740)
文摘This paper aims to improve the performance of a class of distributed parameter systems for the optimal switching of actuators and controllers based on event-driven control. It is assumed that in the available multiple actuators, only one actuator can receive the control signal and be activated over an unfixed time interval, and the other actuators keep dormant. After incorporating a state observer into the event generator, the event-driven control loop and the minimum inter-event time are ultimately bounded. Based on the event-driven state feedback control, the time intervals of unfixed length can be obtained. The optimal switching policy is based on finite horizon linear quadratic optimal control at the beginning of each time subinterval. A simulation example demonstrate the effectiveness of the proposed policy.
基金Project(20030533011)supported by the National Research Foundation for the Doctoral Program of Higher Education of China
文摘A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.
文摘In recent years, networked distributed control systems（NDCS） have received research attention. Two of the main challenges that such systems face are possible delays in the communication network and the effect of strong interconnections between agents. This paper considers an NDCS that has delays in the communication network, as well as strong interconnections between its agents. The control objective is to make each agent track efficiently a reference model by attenuating the effect of strong interconnections via feedback based on the delayed information. First, the authors assume that each agent knows its own dynamics, as well as the interconnection parameters, but receives information about the states of its neighbors with some communication delay. The authors propose a distributed control scheme and prove that if the interconnections can be weakened and if the communication delays are small enough, then the proposed scheme guarantees that the tracking error of each agent is bounded with a bound that depends on the size of the weakened interconnections and delays, and reduces to zero as these uncertainties reduce to zero. The authors then consider a more realistic situation where the interconnections between agents are unknown despite the cooperation and sharing of state information. For this case the authors propose a distributed adaptive control scheme and prove that the proposed scheme guarantees that the tracking errors are bounded and small in the mean square sense with respect to the size of the weakened interconnections and delays, provided the weakened interconnections and time delays are small enough. The authors then consider the case that each agent knows neither its dynamics nor the interconnection matrices. For this case the authors propose a distributed adaptive control scheme and prove that the proposed scheme guarantees that the tracking errors are bounded and small in the mean square sense provided the weakened interconnections and time delays are small enough. Finally, the authors present an illustrative example to present the applicability and effectiveness of the proposed schemes.
