Bifocal lens control of myopia progression in children

This research investigated underlying issues that were critical to the success of the bifocal trial and comprised of three studies. The first study evaluated if Chinese-Canadian children were suitable subjects for the bifocal trial. The high prevalence of myopia in Chinese children suggests that genetic input plays a role in myopia development, but the rapid increase in prevalence over the last few decades indicates environmental factors are also important. Since this bifocal trial was conducted in Canada, this work aimed to determine whether Chinese children who had migrated to Canada would still have high myopia prevalence and a high rate of myopia progression. The second study determined the optimal bifocal lens power for myopia treatment and the effect of incorporating base-in prism into the bifocal. In the majority of published myopia control studies, the power of the prescribed near addition was usually predetermined in the belief that the near addition would always help to improve the near focus. In fact, the effect of near addition on the accommodative error might be quite different even for individuals in which the same magnitude of accommodation lag had been measured. Therefore, this work was necessary to guide the selection of bifocal and prism powers most suitable for the subsequent bifocal trial. The third study, the ultimate goal of this research, was to conduct a longitudinal clinical trial to determine if bifocals and prismatic bifocals could control myopia progression in children.

The effects of sensing and seizing of market opportunities and reconfiguring activities on the organisational resource base

This study has important implications for marketing theory and practice. In an era of turbulent market environments, the organisational ability to sense and seize market opportunities and to reconfigure the resource base accordingly, has significant effects on performance. This paper uses a dynamic capability framework to explain more explicitly the intricacies of the relationship between sensing and seizing of market opportunities and reconfiguring the resource base (i.e. dynamic capabilities) and the resource base. We investigate how the attributes of dynamic capability deployment, timing, frequency and speed, influence the resource base. We test the proposed framework using survey data from 228 large organisations. Findings show that the timing and frequency of dynamic capability deployment have significant effects on the resource base.

QoS-based web service composition accommodating inter-service dependencies using minimal-conflict , hill-climbing repair genetic algorithm

In the field of semantic grid, QoS-based Web service composition is an important problem. In semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the composition consider not only QoS properties of Web services, but also inter service dependencies and conflicts which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address the Web service composition optimization problem in the presence of domain constraints and inter service dependencies and conflicts. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

Will they know enough? Pre-service primary teachers' knowledge base for teaching intergrated social sciences

A significant issue in primary teacher education is developing a knowledge base which prepares teachers to teach in a range of subject areas. In Australia, the problem in primary social science education is compounded by the integrated nature of the key learning area of Studies of Society and Environment (SOSE). Recent debates on teaching integrated social sciences omit discussions on the knowledge base for teaching. In this paper, a case study approach is used to investigate primary pre-service teachers’ approaches to developing a knowledge base in designing a SOSE curriculum unit. Data from five teacher-educators who taught primary SOSE curriculum indicates that novice teachers’ subject content knowledge, as revealed through their curriculum planning, lacked a disciplinary basis. However, understanding of inquiry learning, which is fundamental to social science education, was much stronger. This paper identifies a gap in the scholarship on teaching integrated social science and illustrates the need to support and develop primary teachers’ disciplinary knowledge in teacher education.

Regulatory approaches to genetic testing in insurance

Rapid advancements in the field of genetic science have engendered considerable debate, speculation, misinformation and legislative action worldwide. While programs such as the Human Genome Project bring the prospect of seemingly miraculous medical advancements within imminent reach, they also create the potential for significant invasions of traditional areas of privacy and human dignity through laying the potential foundation for new forms of discrimination in insurance, employment and immigration regulation. The insurance industry, which has of course, traditionally been premised on discrimination as part of its underwriting process, is proving to be the frontline of this regulatory battle with extensive legislation, guidelines and debate marking its progress.

Improved joint control using a genetic algorithm for a humanoid robot

This paper describes experiments conducted in order to simultaneously tune 15 joints of a humanoid robot. Two Genetic Algorithm (GA) based tuning methods were developed and compared against a hand-tuned solution. The system was tuned in order to minimise tracking error while at the same time achieve smooth joint motion. Joint smoothness is crucial for the accurate calculation of online ZMP estimation, a prerequisite for a closedloop dynamically stable humanoid walking gait. Results in both simulation and on a real robot are presented, demonstrating the superior smoothness performance of the GA based methods.

A penalty-based genetic algorithm for the composite SaaS placement problem in the cloud

Cloud computing is a latest new computing paradigm where applications, data and IT services are provided over the Internet. Cloud computing has become a main medium for Software as a Service (SaaS) providers to host their SaaS as it can provide the scalability a SaaS requires. The challenges in the composite SaaS placement process rely on several factors including the large size of the Cloud network, SaaS competing resource requirements, SaaS interactions between its components and SaaS interactions with its data components. However, existing applications’ placement methods in data centres are not concerned with the placement of the component’s data. In addition, a Cloud network is much larger than data center networks that have been discussed in existing studies. This paper proposes a penalty-based genetic algorithm (GA) to the composite SaaS placement problem in the Cloud. We believe this is the first attempt to the SaaS placement with its data in Cloud provider’s servers. Experimental results demonstrate the feasibility and the scalability of the GA.

A hybrid genetic algorithm for the optimal constrained web service selection problem in web service composition

Web service composition is an important problem in web service based systems. It is about how to build a new value-added web service using existing web services. A web service may have many implementations, all of which have the same functionality, but may have different QoS values. Thus, a significant research problem in web service composition is how to select a web service implementation for each of the web services such that the composite web service gives the best overall performance. This is so-called optimal web service selection problem. There may be mutual constraints between some web service implementations. Sometimes when an implementation is selected for one web service, a particular implementation for another web service must be selected. This is so called dependency constraint. Sometimes when an implementation for one web service is selected, a set of implementations for another web service must be excluded in the web service composition. This is so called conflict constraint. Thus, the optimal web service selection is a typical constrained ombinatorial optimization problem from the computational point of view. This paper proposes a new hybrid genetic algorithm for the optimal web service selection problem. The hybrid genetic algorithm has been implemented and evaluated. The evaluation results have shown that the hybrid genetic algorithm outperforms other two existing genetic algorithms when the number of web services and the number of constraints are large.

An examination of the base rates of post-concussion symptoms : the influence of demographics and depression

Post-concussion syndrome (PCS) is a controversial constellation of cognitive, emotional, and physical symptoms that some patients experience following a mild traumatic brain injury or concussion. PCS-like symptoms are commonly found in individuals with depression, pain, and stress, as well as healthy individuals. This study investigated the base rate of PCS symptoms in a healthy sample of 96 participants and examined the relationship between these symptoms, depression, and sample demographics. PCS symptoms were assessed using the British-Columbia Post-Concussion Symptom Inventory. Depression was measured using the Beck Depression Inventory II. Results demonstrated that: The base rate of PCS was very high; there was a strong positive relationship between depression and PCS; and demographic characteristics were not related to PCS in this sample. These findings are broadly consistent with literature suggesting a significant role for non-neurological factors in the expression of PCS symptomatology. This study adds to the growing body of literature that calls for caution in the clinical interpretation of results from PCS symptom inventories.

Partitioning composite web services for decentralized execution using a genetic algorithm

Composite web services comprise several component web services. When a composite web service is executed centrally, a single web service engine is responsible for coordinating the execution of the components, which may create a bottleneck and degrade the overall throughput of the composite service when there are a large number of service requests. Potentially this problem can be handled by decentralizing execution of the composite web service, but this raises the issue of how to partition a composite service into groups of component services such that each group can be orchestrated by its own execution engine while ensuring acceptable overall throughput of the composite service. Here we present a novel penalty-based genetic algorithm to solve the composite web service partitioning problem. Empirical results show that our new algorithm outperforms existing heuristic-based solutions.

QoS-oriented sesource allocation and scheduling of multiple composite web services in a hybrid cloud using a random-key genetic algorithm

In cloud computing resource allocation and scheduling of multiple composite web services is an important challenge. This is especially so in a hybrid cloud where there may be some free resources available from private clouds but some fee-paying resources from public clouds. Meeting this challenge involves two classical computational problems. One is assigning resources to each of the tasks in the composite web service. The other is scheduling the allocated resources when each resource may be used by more than one task and may be needed at different points of time. In addition, we must consider Quality-of-Service issues, such as execution time and running costs. Existing approaches to resource allocation and scheduling in public clouds and grid computing are not applicable to this new problem. This paper presents a random-key genetic algorithm that solves new resource allocation and scheduling problem. Experimental results demonstrate the effectiveness and scalability of the algorithm.