The fixed-time synchronization problem for a class of second-order nonlinear multi-agent systems with a leader-follower architecture is investigated in this paper. To achieve the fixed-time tracking, the design proced...
详细信息
ISBN:
(纸本)9781509035502
The fixed-time synchronization problem for a class of second-order nonlinear multi-agent systems with a leader-follower architecture is investigated in this paper. To achieve the fixed-time tracking, the design procedure is divided into two steps. At the first step, a distributed fixed-time estimator is designed for each agent to estimate the leader's state in a fixed time. Then, at the second step, based on the technique of adding a power integrator, a fixed-time tracking controller for each agent is proposed such that the estimate leader's state can be tracked in a fixed time. Finally, an estimator-based fixed-time controller is developed such that the leader can be tracked by all the followers in a fixed time. Simulations are presented to verify the effectiveness of the proposed approach.
Mode-mixing, boundary effects and necessary extrema lacking and etc. are the main problems involved in empirical mode decomposition (EMD). The paper presents an improved empirical mode decomposition based on assisted ...
详细信息
ISBN:
(纸本)9781509009749
Mode-mixing, boundary effects and necessary extrema lacking and etc. are the main problems involved in empirical mode decomposition (EMD). The paper presents an improved empirical mode decomposition based on assisted signals: Gaussian noises. Firstly, the given 1D Gaussian noise and its negative counterpart are added to the original respectively to construct the two s to be decomposed. Secondly, the decomposed IMFs from the two signals are added together to get the IMFs, in which the added noises are canceled out with less mode-mixing and boundary effects. Lastly, the efficiency and performance of the method are given through theoretical analysis and experiments.
With the recent development of Device-to-Device (D2D) communication technologies, mobile devices will no longer be treated as pure “terminals”, but they could become an integral part of the network in specific appli...
详细信息
ISBN:
(纸本)9781509007257
With the recent development of Device-to-Device (D2D) communication technologies, mobile devices will no longer be treated as pure “terminals”, but they could become an integral part of the network in specific application scenarios. In this paper, we introduce a novel scheme of using D2D communications for enabling data relay services in partial Not-Spots, where a client without local network access may require data relay by other devices. Depending on specific social application scenarios that can leverage on the D2D technology, we consider tailored algorithms in order to achieve optimised data relay service performance on top of our proposed network-coordinated communication framework. The approach is to exploit the network's knowledge on its local user mobility patterns in order to identify best helper devices participating in data relay operations. This framework also comes with our proposed helper selection optimization algorithm based on reactive predictability of individual user. According to our simulation analysis based on both theoretical mobility models and real human mobility data traces, the proposed scheme is able to flexibly support different service requirements in specific social application scenarios.
Summary form only given. This two-part paper considers the coordination of a population of thermostatically controlled loads (TCLs) with unknown parameters to achieve group objectives. The problem involves designing t...
详细信息
ISBN:
(纸本)9781509041695
Summary form only given. This two-part paper considers the coordination of a population of thermostatically controlled loads (TCLs) with unknown parameters to achieve group objectives. The problem involves designing the bidding and market clearing strategy to motivate self-interested users to realize efficient energy allocation subject to a peak energy constraint. The companion paper (Part I) formulates the problem and proposes a load coordination framework using the mechanism design approach. To address the unknown parameters, Part II of this paper presents a joint state and parameter estimation framework based on the expectation maximization algorithm. The overall framework is then validated using real world weather data and price data, and is compared with other approaches in terms of aggregated load response. Simulation results indicate that our coordination framework can effectively improve the operational efficiency of the distribution system and reduce power congestion at key times.
Top-k join is an essential tool for data analysis, since it enables selective retrieval of the k best combined results that come from multiple different input datasets. In the context of Big Data, processing top-k joi...
详细信息
Top-k join is an essential tool for data analysis, since it enables selective retrieval of the k best combined results that come from multiple different input datasets. In the context of Big Data, processing top-k joins over huge datasets requires a scalable platform, such as the widely popular MapReduce framework. However, such a solution does not necessarily imply efficient processing, due to inherent limitations related to MapReduce. In particular, these include lack of an early termination mechanism for accessing only subset of input data, as well as an appropriate load balancing mechanism tailored to the top-k join problem. Apart from these issues, a significant research problem is how to determine the subset of the inputs that is guaranteed to produce the correct top-k join result. In this paper, we address these challenges by proposing an algorithm for efficient top-k join processing in MapReduce. Our experimental evaluation clearly demonstrates the efficiency of our approach, which does not compromise its scalability nor any other salient feature of MapReduce processing.
An efficient algorithm based on the discontinuous Galerkin time-domain (DGTD) method with a hybrid mesh is proposed to simulate electromagnetic problems. To validate the algorithm and demonstrate its efficiency, a sph...
详细信息
An efficient algorithm based on the discontinuous Galerkin time-domain (DGTD) method with a hybrid mesh is proposed to simulate electromagnetic problems. To validate the algorithm and demonstrate its efficiency, a spherical cavity and a horn antenna are simulated using hybrid meshes.
This paper deals with protection problems in distributed generation systems, it summarizes the protection methods known so far, and it proposes a new protection scheme usable for these systems. First, brief comparison...
详细信息
This paper deals with protection problems in distributed generation systems, it summarizes the protection methods known so far, and it proposes a new protection scheme usable for these systems. First, brief comparison of protection concepts of classical and distributed generation systems based on overcurrent protections is performed, and individual differences in protection settings are discussed. New setting algorithm, based on optimization of appropriately designed objective function, and adaptive directional overcurrent protections with inverse-time characteristics, is performed. Next, validation of proposed optimized setting in SimPoruchy 2.1 program was performed. The software allows for quick and well-arranged output of failure currents in the system and also for simulation of directional protections with inverse-time characteristics used in the model.
The Support Vector Machines (SVMs) dual formulation has a non-separable structure that makes the design of a convergent distributed algorithm a very difficult task. Recently some separable and distributable reformulat...
详细信息
ISBN:
(纸本)9781509006212
The Support Vector Machines (SVMs) dual formulation has a non-separable structure that makes the design of a convergent distributed algorithm a very difficult task. Recently some separable and distributable reformulations of the SVM training problem have been obtained by fixing one primal variable. While this strategy seems effective for some applications, in certain cases it could be weak since it drastically reduces the overall final performance. In this work we present the first fully distributable algorithm for SVMs training that globally converges to a solution of the original (non-separable) SVMs dual formulation. Besides a detailed convergence analysis, we provide a simple demonstrative example showing the advantages of the original SVMs dual formulation with respect to the weak separable one and highlights the practical effectiveness of our method. We report further tests to show practical convergence of the proposed method on real-world datasets.
In this paper, we propose a novel, efficient and fast motion estimation (ME) algorithm for High Efficiency Video Coding (HEVC). The proposed work is based on video content that gives us the provision to select a best ...
详细信息
ISBN:
(纸本)9781509020300
In this paper, we propose a novel, efficient and fast motion estimation (ME) algorithm for High Efficiency Video Coding (HEVC). The proposed work is based on video content that gives us the provision to select a best macro block mode and suitable search pattern for a given slice of the video frame. Each frame is divided into multiple slices based on a tiered scene labelling mechanism and a suitable search pattern is estimated for each slice by investigating texture of the slice. The interspace distance between a macro block in current frame to the candidate macro block in the previous frame is calculated for all the macro blocks in a slice, to find the block movement factor (BMF) which identifies a appropriate search pattern for that slice. Also, the disparity between the neighbouring blocks is measured for each slice to predict the mode to be considered for block matching in next frame. The experimental analysis is performed with x265 video codec, which shows considerable amount (20%) of improvement in compression performance.
Today, the service provider has to serve many users and the increase of the requests or tasks from the users to the cloud providers has become one of the scalable techniques to proposed the services. Many scheduling a...
详细信息
ISBN:
(纸本)9781509046980
Today, the service provider has to serve many users and the increase of the requests or tasks from the users to the cloud providers has become one of the scalable techniques to proposed the services. Many scheduling algorithms have been proposed to schedule the tasks in cloud computing environment such as (SJF) and (FCFS) algorithms. This paper aims to improve the shortest job first scheduling algorithm in the cloud computing. In tasks scheduling (TS), the most important parameters are makespan and response time. Therefore, we have proposed a Modified Shortest Job First algorithm (MSJF) to minimize the completion time of the last task (Makespan) and minimize the average response time with maximizing the resources utilization. MSJF has two functions, one is calculating the average of tasks length and the other one is Load-Balancing between the virtual machines. One of the important advantages of MSJF is sending the longest tasks to the fastest Machine. We compared the result of our proposed algorithm MSJF with SJF and FCFS. The performance of MSJF is better compared to SJF and FCFS.
暂无评论