Finite-time consensus algorithm of multi-agent networks

This paper is concerned with leader-follower finite-time consensus control of multi-agent networks with input disturbances. Terminal sliding mode control scheme is used to design the distributed control law. A new terminal sliding mode surface is proposed to guarantee finite-time consensus under fixed topology, with the common assumption that the position and the velocity of the active leader is known to its neighbors only. By using the finite-time Lyapunov stability theorem, it is shown that if the directed graph of the network has a directed spanning tree, then the terminal sliding mode control law can guarantee finite-time consensus even under the assumption that the time-varying control input of the active leader is unknown to any follower.

Channel estimation scheme for 3.9G wireless communication systems using RLS algorithm

Main challenges for a terminal implementation are efficient realization of the receiver, especially for channel estimation (CE) and equalization. In this paper, training based recursive least square (RLS) channel estimator technique is presented for a long term evolution (LTE) single carrier-frequency division multiple access (SC-FDMA) wireless communication system. This CE scheme uses adaptive RLS estimator which is able to update parameters of the estimator continuously, so that knowledge of channel and noise statistics are not required. Simulation results show that the RLS CE scheme with 500 Hz Doppler frequency has 3 dB better performances compared with 1.5 kHz Doppler frequency.

Extracting common subtrees from decision trees

This paper explores an efficient technique for the extraction of common subtrees in decision trees. The method is based on a Suffix Tree string matching process and the algorithm is applied to the problem of finding common decision rules in path planning.

Modeling of a stereo vision system using a genetic algorithm based fuzzy linear regression

In this paper a fuzzy linear regression (FLR) model integrated with a genetic algorithm (GA) is proposed. The proposed GA-FLR model is applied to modeling of a stereo vision system. A set of empirical data from stereo vision object measurement is collected based on the full factorial design technique. Three regression models, namely ordinary least-squares regression (OLS), FLR, and GA-FLR, are developed, and with their performances compared. The results show that the proposed GA-FLR model performs better than OLS and FLR in modeling of a stereo vision system.

EFP-M2 : efficient model for mining frequent patterns in transactional database

Discovering frequent patterns plays an essential role in many data mining applications. The aim of frequent patterns is to obtain the information about the most common patterns that appeared together. However, designing an efficient model to mine these patterns is still demanding due to the capacity of current database size. Therefore, we propose an Efficient Frequent Pattern Mining Model (EFP-M2) to mine the frequent patterns in timely manner. The result shows that the algorithm in EFP-M2l is outperformed at least at 2 orders of magnitudes against the benchmarked FP-Growth.

IPMA : Indirect patterns mining algorithm

Indirect pattern is considered as valuable and hidden information in transactional database. It represents the property of high dependencies between two items that are rarely occurred together but indirectly appeared via another items. Indirect pattern mining is very important because it can reveal a new knowledge in certain domain applications. Therefore, we propose an Indirect Pattern Mining Algorithm (IPMA) in an attempt to mine the indirect patterns from data repository. IPMA embeds with a measure called Critical Relative Support (CRS) measure rather than the common interesting measures. The result shows that IPMA is successful in generating the indirect patterns with the various threshold values.

Developing an empirical algorithm for protecting text-based CAPTCHAs against segmentation attacks

In this paper, we aim to provide an effective and efficient method to generate text-based Captchas which are resilient against segmentation attack. Different to the popular industry practice of using very simple color schemes, we advocate to use multiple colors in our Captchas. We adopt the idea of brush and canvas when coloring our Captchas. Furthermore, we choose to use simple accumulating functions to achieve diffusion on painted colors and DES encryption to achieve a good level of confusion on the brush pattern. To facilitate ordinary users and developers, we propose an empirical algorithm with support of Taguchi method to guarantee the quality of the chosen color schemes. Our proposed methodology has at least three advantages — 1) the settings of color schemes can be fully customized by the user or developer; 2) the quality of selected colors have desirable statistical features that are ensured by Taguchi method; 3) the algorithm can be fully automated into computer programs. Moreover, our included examples and experiments prove the practicality and validity of our algorithm.

Maximum power point tracking of partial shaded photovoltaic array using an evolutionary algorithm: a particle swarm optimization technique

 Partial shading is one of the unavoidable complications in the field of solar power generation. Although the most common approach in increasing a photovoltaic (PV) array’s efficiency has always been to introduce a bypass diode to the said array, this poses another problem in the form of multi-peaks curves whenever the modules are partially shaded. To further complicate matters, most conventional Maximum Power Point Tracking methods develop errors under certain circumstances (for example, they detect the local Maximum Power Point (MPP) instead of the global MPP) and reduce the efficiency of PV systems even further. Presently, much research has been undertaken to improve upon them. This study aims to employ an evolutionary algorithm technique, also known as particle swarm optimization, in MPP detection. VC 2014 Author(s).

A general pose estimation algorithm in a multi-Kinect system

 Microsoft Kinect which has been primarily aimed at the computer gaming industry has been used in bio-kinematic research related implementations. A multi-Kinect system can be useful in exploiting spatial diversity to increase measurement accuracy. One of the main problems in deploying multi-Kinect systems is to estimate the pose, including the position and orientation of each Kinect. In this paper, a singular value decomposition (SVD) least-squares algorithm is extended to a more generic time-series based approach to solve this pose estimation problem utilising 3D positions of one or more joints in skeletons obtained from a multi-Kinect system. Additionally, computer simulations are performed to demonstrate the use and to evaluate the efficiency of the proposed algorithm. The former is further validated with a commercial Vicon system.

A primer on phylogenetic generalised least squares

Phylogenetic generalised least squares (PGLS) is one of the most commonly employed phylogenetic comparative methods. The technique, a modification of generalised least squares, uses knowledge of phylogenetic relationships to produce an estimate of expected covariance in cross-species data. Closely related species are assumed to have more similar traits because of their shared ancestry and hence produce more similar residuals from the least squares regression line. By taking into account the expected covariance structure of these residuals, modified slope and intercept estimates are generated that can account for interspecific autocorrelation due to phylogeny. Here, we provide a basic conceptual background to PGLS, for those unfamiliar with the approach. We describe the requirements for a PGLS analysis and highlight the packages that can be used to implement the method. We show how phylogeny is used to calculate the expected covariance structure in the data and how this is applied to the generalised least squares regression equation. We demonstrate how PGLS can incorporate information about phylogenetic signal, the extent to which closely related species truly are similar, and how it controls for this signal appropriately, thereby negating concerns about unnecessarily ‘correcting’ for phylogeny. In addition to discussing the appropriate way to present the results of PGLS analyses, we highlight some common misconceptions about the approach and commonly encountered problems with the method. These include misunderstandings about what phylogenetic signal refers to in the context of PGLS (residuals errors, not the traits themselves), and issues associated with unknown or uncertain phylogeny.

A new algorithm to design minimal multi-functional observers for linear systems

Designing minimum possible order (minimal) observers for Multi-Input Multi-Output (MIMO) linear systems have always been an interesting subject. In this paper, a new methodology to design minimal multi-functional observers for Linear Time-Invariant (LTI) systems is proposed. The approach is applicable, and it also helps in regulating the convergence rate of the observed functions. It is assumed that the system is functional observable or functional detectable, which is less conservative than assuming the observability or detectability of the system. To satisfy the minimality of the observer, a recursive algorithm is provided that increases the order of the observer by appending the minimum required auxiliary functions to the desired functions that are going to be estimated. The algorithm increases the number of functions such that the necessary and sufficient conditions for the existence of a functional observer are satisfied. Moreover, a new methodology to solve the observer design interconnected equations is elaborated. Our new algorithm has advantages with regard to the other available methods in designing minimal order functional observers. Specifically, it is compared with the most common schemes, which are transformation based. Using numerical examples it is shown that under special circumstances, the conventional methods have some drawbacks. The problem partly lies in the lack of sufficient numerical degrees of freedom proposed by the conventional methods. It is shown that our proposed algorithm can resolve this issue. A recursive algorithm is also proposed to summarize the observer design procedure. Several numerical examples and simulation results illustrate the efficacy, superiority and different aspects of the theoretical findings.

Negative appraisals of insulin therapy are common among adults with Type 2 diabetes using insulin: results from diabetes MILES - Australia cross-sectional survey

AIM: To identify insulin therapy appraisals among adults with Type 2 diabetes using insulin and how negative appraisals relate to clinical, self-care and psychosocial outcomes. METHODS: Diabetes MILES - Australia 2011 was a national survey of adults with diabetes, focused on behavioural and psychosocial issues. Subgroup analyses were conducted on the responses of 273 adults with Type 2 diabetes using insulin (46% women; mean ± sd age: 59 ± 9 years; diabetes duration: 12 ± 7 years; years using insulin: 4 ± 4). They completed validated measures of insulin therapy appraisals (ITAS), depression (PHQ-9), anxiety (GAD-7), diabetes distress (PAID) and diabetes-specific self-efficacy (DES-SF). RESULTS: Insulin was perceived to be very important, and its benefits (e.g. improves health) were endorsed by most (82%). Fifty-one per cent believed that taking insulin means their diabetes has become worse; 51% that insulin causes weight gain; 39% that they have 'failed to manage' their diabetes. Those with the greatest and least 'ITAS negative' scores did not differ by diabetes duration or years using insulin, or by average number of insulin injections or blood glucose checks per day. Those with more negative insulin appraisals were significantly younger (Mean Diff. = 5 years, P < 0.001), less satisfied with recent blood glucose levels (P < 0.001, d = 0.63), had reduced diabetes-specific self-efficacy (P < 0.001, d = 0.7), and were more likely to report depressive symptoms, anxiety or diabetes distress (all P < 0.001, d = 0.65-1.1). CONCLUSIONS: Negative insulin therapy appraisals are common among adults with Type 2 diabetes using insulin, and are associated with lower general and diabetes-specific emotional well-being, reduced diabetes-specific self-efficacy and satisfaction with blood glucose.

3D motion matching algorithm using signature feature descriptor

This paper introduces a basic frame for rehabilitation motion practice system which detects 3D motion trajectory with the Microsoft Kinect (MSK) sensor system and proposes a cost-effective 3D motion matching algorithm. The rehabilitation motion practice system displays a reference 3D motion in the database system that the player (patient) tries to follow. The player’s motion is traced by the MSK sensor system and then compared with the reference motion to evaluate how well the player follows the reference motion. In this system, 3D motion matching algorithm is a key feature for accurate evaluation for player’s performance. Even though similarity measurement of 3D trajectories is one of the most important tasks in 3D motion analysis, existing methods are still limited. Recent researches focus on the full length 3D trajectory data set. However, it is not true that every point on the trajectory plays the same role and has the same meaning. In this situation, we developed a new cost-effective method that only uses the less number of features called ‘signature’ which is a flexible descriptor computed from the region of ‘elbow points’. Therefore, our proposed method runs faster than other methods which use the full length trajectory information. The similarity of trajectories is measured based on the signature using an alignment method such as dynamic time warping (DTW), continuous dynamic time warping (CDTW) or longest common sub-sequence (LCSS) method. In the experimental studies, we applied the MSK sensor system to detect, trace and match the 3D motion of human body. This application was assumed as a system for guiding a rehabilitation practice which can evaluate how well the motion practice was performed based on comparison of the patient’s practice motion traced by the MSK system with the pre-defined reference motion in a database. In order to evaluate the accuracy of our 3D motion matching algorithm, we compared our method with two other methods using Australian sign word dataset. As a result, our matching algorithm outperforms in matching 3D motion, and it can be exploited for a base framework for various 3D motion-based applications at low cost with high accuracy.

Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design

This paper describes the formulation of a Multi-objective Pipe Smoothing Genetic Algorithm (MOPSGA) and its application to the least cost water distribution network design problem. Evolutionary Algorithms have been widely utilised for the optimisation of both theoretical and real-world non-linear optimisation problems, including water system design and maintenance problems. In this work we present a pipe smoothing based approach to the creation and mutation of chromosomes which utilises engineering expertise with the view to increasing the performance of the algorithm whilst promoting engineering feasibility within the population of solutions. MOPSGA is based upon the standard Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and incorporates a modified population initialiser and mutation operator which directly targets elements of a network with the aim to increase network smoothness (in terms of progression from one diameter to the next) using network element awareness and an elementary heuristic. The pipe smoothing heuristic used in this algorithm is based upon a fundamental principle employed by water system engineers when designing water distribution pipe networks where the diameter of any pipe is never greater than the sum of the diameters of the pipes directly upstream resulting in the transition from large to small diameters from source to the extremities of the network. MOPSGA is assessed on a number of water distribution network benchmarks from the literature including some real-world based, large scale systems. The performance of MOPSGA is directly compared to that of NSGA-II with regard to solution quality, engineering feasibility (network smoothness) and computational efficiency. MOPSGA is shown to promote both engineering and hydraulic feasibility whilst attaining good infrastructure costs compared to NSGA-II.

Common currency and economic integration in Mercosur

A América Latina tem uma longa história de tentativas de alcançar uma integração regional, embora seu sucesso tenha sido modesto. Este trabalho procura mostrar que isso essencialmente ocorre não tanto pelas práticas protecionistas nos vários países, mas devido à falta de uma moeda comum, ou, pelo menos, de uma taxa de câmbio rigorosamente administrada. Os autores analisaram o critério da área ótima de moeda que mostra ser prudente aumentar a integração econômica antes de tentar implementar a coordenação das taxas de câmbio. Entretanto, nós mostramos que no Mercosul já existem as condições mínimas para começar a trabalhar nessa direção. A diminuição da instabilidade cambial pode encorajar a entrada de investimentos e o comércio nas economias latino-americanas. Os autores também desenvolveram um exercício simplificado para entender como poderia ser viável alcançar estabilidade da taxa de câmbio em nos dois maiores países da região (Brasil e Argentina) e avançar na adoção de uma moeda comum.