A novel hybrid evolutionary algorithm based on ACO and SA for distribution feeder reconfiguration with regard to DGs

This paper presents an efficient hybrid evolutionary optimization algorithm based on combining Ant Colony Optimization (ACO) and Simulated Annealing (SA), called ACO-SA, for distribution feeder reconfiguration (DFR) considering Distributed Generators (DGs). Due to private ownership of DGs, a cost based compensation method is used to encourage DGs in active and reactive power generation. The objective function is summation of electrical energy generated by DGs and substation bus (main bus) in the next day. The approach is tested on a real distribution feeder. The simulation results show that the proposed evolutionary optimization algorithm is robust and suitable for solving DFR problem.

Distribution feeder reconfiguration for loss minimization based on modified honey bee mating optimization algorithm

This paper presents an efficient algorithm for multi-objective distribution feeder reconfiguration based on Modified Honey Bee Mating Optimization (MHBMO) approach. The main objective of the Distribution feeder reconfiguration (DFR) is to minimize the real power loss, deviation of the nodes’ voltage. Because of the fact that the objectives are different and no commensurable, it is difficult to solve the problem by conventional approaches that may optimize a single objective. So the metahuristic algorithm has been applied to this problem. This paper describes the full algorithm to Objective functions paid, The results of simulations on a 32 bus distribution system is given and shown high accuracy and optimize the proposed algorithm in power loss minimization.

A hybrid evolutionary algorithm based on ACO and SA for distribution feeder reconfiguration

This paper deals with an efficient hybrid evolutionary optimization algorithm in accordance with combining the ant colony optimization (ACO) and the simulated annealing (SA), so called ACO-SA. The distribution feeder reconfiguration (DFR) is known as one of the most important control schemes in the distribution networks, which can be affected by distributed generations (DGs) for the multi-objective DFR. In such a case, DGs is used to minimize the real power loss, the deviation of nodes voltage and the number of switching operations. The approach is carried out on a real distribution feeder, where the simulation results show that the proposed evolutionary optimization algorithm is robust and suitable for solving the DFR problem.

Violence in and around entertainment districts : a longitudinal analysis of the impact of late-night lockout legislation

Violence in entertainment districts is a major problem across urban landscapes throughout the world. Research shows that licensed premises are the third most common location for homicides and serious assaults, accounting for one in ten fatal and nonfatal assaults. One class of interventions that aims to reduce violence in entertainment districts involves the use of civil remedies: a group of strategies that use civil or regulatory measures as legal “levers” to reduce problem behavior. One specific civil remedy used to reduce problematic behavior in entertainment districts involves manipulation of licensed premise trading hours. This article uses generalized linear models to analyze the impact of lockout legislation on recorded violent offences in two entertainment districts in the Australian state of Queensland. Our research shows that 3 a.m. lockout legislation led to a direct and significant reduction in the number of violent incidents inside licensed premises. Indeed, the lockouts cut the level of violent crime inside licensed premises by half. Despite these impressive results for the control of violence inside licensed premises, we found no evidence that the lockout had any impact on violence on streets and footpaths outside licensed premises that were the site for more than 80 percent of entertainment district violence. Overall, however, our analysis suggests that lockouts are an important mechanism that helps to control the level of violence inside licensed premises but that finely grained contextual responses to alcohol-related problems are needed rather than one-size-fits-all solutions.

Distribution harmonic state estimation based on a hybrid PSO and SA algorithm considering parameters uncertainty

This paper presents a new algorithm based on a Hybrid Particle Swarm Optimization (PSO) and Simulated Annealing (SA) called PSO-SA to estimate harmonic state variables in distribution networks. The proposed algorithm performs estimation for both amplitude and phase of each harmonic currents injection by minimizing the error between the measured values from Phasor Measurement Units (PMUs) and the values computed from the estimated parameters during the estimation process. The proposed algorithm can take into account the uncertainty of the harmonic pseudo measurement and the tolerance in the line impedances of the network as well as uncertainty of the Distributed Generators (DGs) such as Wind Turbines (WT). The main feature of proposed PSO-SA algorithm is to reach quickly around the global optimum by PSO with enabling a mutation function and then to find that optimum by SA searching algorithm. Simulation results on IEEE 34 bus radial and a realistic 70-bus radial test networks are presented to demonstrate the speed and accuracy of proposed Distribution Harmonic State Estimation (DHSE) algorithm is extremely effective and efficient in comparison with the conventional algorithms such as Weight Least Square (WLS), Genetic Algorithm (GA), original PSO and Honey Bees Mating Optimization (HBMO) algorithm.

A Satellite Selection Algorithm for Achieving High Reliability of Ambiguity Resolution with GPS and Beidou Constellations

Reliability of carrier phase ambiguity resolution (AR) of an integer least-squares (ILS) problem depends on ambiguity success rate (ASR), which in practice can be well approximated by the success probability of integer bootstrapping solutions. With the current GPS constellation, sufficiently high ASR of geometry-based model can only be achievable at certain percentage of time. As a result, high reliability of AR cannot be assured by the single constellation. In the event of dual constellations system (DCS), for example, GPS and Beidou, which provide more satellites in view, users can expect significant performance benefits such as AR reliability and high precision positioning solutions. Simply using all the satellites in view for AR and positioning is a straightforward solution, but does not necessarily lead to high reliability as it is hoped. The paper presents an alternative approach that selects a subset of the visible satellites to achieve a higher reliability performance of the AR solutions in a multi-GNSS environment, instead of using all the satellites. Traditionally, satellite selection algorithms are mostly based on the position dilution of precision (PDOP) in order to meet accuracy requirements. In this contribution, some reliability criteria are introduced for GNSS satellite selection, and a novel satellite selection algorithm for reliable ambiguity resolution (SARA) is developed. The SARA algorithm allows receivers to select a subset of satellites for achieving high ASR such as above 0.99. Numerical results from a simulated dual constellation cases show that with the SARA procedure, the percentages of ASR values in excess of 0.99 and the percentages of ratio-test values passing the threshold 3 are both higher than those directly using all satellites in view, particularly in the case of dual-constellation, the percentages of ASRs (>0.99) and ratio-test values (>3) could be as high as 98.0 and 98.5 % respectively, compared to 18.1 and 25.0 % without satellite selection process. It is also worth noting that the implementation of SARA is simple and the computation time is low, which can be applied in most real-time data processing applications.

Hidden credential retrieval from a reusable password

We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access keys and tokens in a connected world. Although many existing solutions can be employed to protect a long secret using a short password, those solutions typically require certain assumptions on the distribution of the secret and/or the password, and are helpful against only a subset of the possible attackers. After briefly reviewing a variety of approaches, we propose a user-centric comprehensive model to capture the possible threats posed by online and offline attackers, from the outside and the inside, against the security of both the plaintext and the password. We then propose a few very simple protocols, adapted from the Ford-Kaliski server-assisted password generator and the Boldyreva unique blind signature in particular, that provide the best protection against all kinds of threats, for all distributions of secrets. We also quantify the concrete security of our approach in terms of online and offline password guesses made by outsiders and insiders, in the random-oracle model. The main contribution of this paper lies not in the technical novelty of the proposed solution, but in the identification of the problem and its model. Our results have an immediate and practical application for the real world: they show how to implement single-sign-on stateless roaming authentication for the internet, in a ad-hoc user-driven fashion that requires no change to protocols or infrastructure.

A new human identification protocol and Coppersmith's baby-step giant-step algorithm

We propose a new protocol providing cryptographically secure authentication to unaided humans against passive adversaries. We also propose a new generic passive attack on human identification protocols. The attack is an application of Coppersmith’s baby-step giant-step algorithm on human identification protcols. Under this attack, the achievable security of some of the best candidates for human identification protocols in the literature is further reduced. We show that our protocol preserves similar usability while achieves better security than these protocols. A comprehensive security analysis is provided which suggests parameters guaranteeing desired levels of security.

Hybrid genetic algorithm for elimination of severe stress concentration in railhead ends

This paper presents a computational method for eliminating severe stress concentration at the unsupported railhead ends in rail joints through innovative shape optimization of the contact zone, which is complex due to near field nonlinear contact. With a view to minimizing the computational efforts, hybrid genetic algorithm method coupled with parametric finite element has been developed and compared with the traditional genetic algorithm (GA). The shape of railhead top surface where the wheel contacts nonlinearly was optimized using the hybridized GA method. Comparative study of the optimal result and the search efficiency between the traditional and hybrid GA methods has shown that the hybridized GA provides the optimal shape in fewer computational cycles without losing accuracy. The method will be beneficial to solving complex engineering problems involving contact nonlinearity.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.

Composite SaaS scaling in cloud computing using a hybrid genetic algorithm

A Software-as-a-Service or SaaS can be delivered in a composite form, consisting of a set of application and data components that work together to deliver higher-level functional software. Components in a composite SaaS may need to be scaled – replicated or deleted, to accommodate the user’s load. It may not be necessary to replicate all components of the SaaS, as some components can be shared by other instances. On the other hand, when the load is low, some of the instances may need to be deleted to avoid resource underutilisation. Thus, it is important to determine which components are to be scaled such that the performance of the SaaS is still maintained. Extensive research on the SaaS resource management in Cloud has not yet addressed the challenges of scaling process for composite SaaS. Therefore, a hybrid genetic algorithm is proposed in which it utilises the problem’s knowledge and explores the best combination of scaling plan for the components. Experimental results demonstrate that the proposed algorithm outperforms existing heuristic-based solutions.

The role of the ethnic enclave in facilitating immigrant business performance and social integration

Chinese immigrant entrepreneurs, known the world over for their successful business practices (Kee, 1994), tend to start businesses within their ethnic enclave. But in a move away from multiculturalism, host countries increasingly fear that immigration and asylum pose a threat to social integration resulting in a lack of social cohesion and a plethora of government programs (Cheong, Edwards, Goulbourne & Solomos, 2007). For many immigrant entrepreneurs, the EE is an integral part of their social and cultural context and the location where ethnic resources reside (Logan, Alba & Stults, 2003). Immigrant entrepreneurs can harness the networks for labor and customers through various ties in their EE (Portes and Zhou, 1996). Yang, Ho and Chang (2010) illustrate in their paper that the Chinese immigrant entrepreneurs (IE) were able to utilize ethnic network resources as their social capital in order to reduce transaction costs and thus enhance business performance. Tilly (1990) explains that immigrants’ reliance on such networks for business or other information minimizes the socioeconomic hardships they would experience in host countries (Raijman & Tienda, 2000). Acquiring jobs in ethnic businesses and establishing businesses within an EE may facilitate migrants’ social integration into the host country (Tian & Shan, 1999). Although an EE has distinct economic advantages for immigrant entrepreneurs, Sequeira and Rasheed (2006: 367) argue that ‘Exclusive reliance on strong ties within the immigrant enclave has a negative effect on growth outside the enclave community.’ Similarly, Drori, Honig and Ginsberg (2010: 20) also propose that ‘The greater the reliance of transnational entrepreneurs on ethnic (versus societal) embedded resources and network structure, the narrower their possibilities of expanding the scope of their business.’ This research asks, ‘What is the role of the ethnic enclave in facilitating immigrant business growth and social integration? This project has the following important aims: A1 To better understand the role of IE, in particular Chinese IE in the Australian economy A2 To investigate the role of the EE in facilitating or inhibiting immigrant business performance A3 To understand how locating their firm inside or outside of the EE will affect the IE’s embeddedness in co-ethnic and nonco-ethnic networks and social integration A4 To understand how an IE’s social network affects business performance and social integration

Ethnic enclave lifecycle : a case study of Chinese restaurants in south east Queensland

Immigrant entrepreneurs tend to start businesses within their ethnic enclave (EE), as it is an integral part of their social and cultural context and the location where ethnic resources reside (Logan, Alba, & Stults, 2003). Ethnic enclaves can be seen as a form of geographic cluster, China Towns are exemplar EEs, easily identified by the clustering of Chinese restaurants and other ethnic businesses in one central location. Studies on EE thus far have neglected the life cycles stages of EE and its impact on the business experiences of the entrepreneurs. In this paper, we track the formation, growth and decline of a EE. We argue that EE is a special industrial cluster and as such it follows the growth conditions proposed by the cluster life cycle theory (Menzel & Fornahl, 2009). We report a mixed method study of Chinese Restaurants in South East Queensland. Based on multiple sources of data, we concluded that changes in government policies leading to a sharp increase of immigrant numbers from a distinctive culture group can lead to the initiation and growth of the EE. Continuous incoming of new immigrants and increase competition within the cluster mark the mature stage of the EE, making the growth condition more favourable “inside” the cluster. A decline in new immigrants from the same ethnic group and the increased competition within the EE may eventually lead to the decline of such an industrial cluster, thus providing more favorable condition for growth of business outside the cluster.