Daddies, assistants and foolsbdifferentiation of male representations in present-day advertising.

This paper explores the way men are represented in present-day advertising. Most gender related studies have concentrated in studying women in advertising and claim that men are still represented as the dominant gender and in more active, independent and functional roles than women. This paper asks whether this still holds for advertising in the beginning of 21st century. Many cultural changes may have broken the earlier stereotypes, for example changes in the family life, attitudes toward various sexual identities, concepts of masculinity and femininity, and changes in cultural style.

Practical Transformations and Transformational Practices : Globalization, Postmodernism, and Early Childhood Education : Advances in Early Education and Day Care

Both traditional and progressive curricula are inadequate for the task of responding to the economic, political, social, and cultural changes that have occurred as a result of globalization. This book documents some of the ongoing work occurring in early childhood settings that is aimed at improving, and ultimately transforming, early childhood practice in these changed and changing times. The authors do not simply critique developmental approaches or the increasing standardization of the field. Instead, they describe how they are playing around with postmodern ideas in practice and developing unique approaches to the diverse educational circumstances that confront early childhood educators. Whether it is preparing teachers, using materials, or developing policies, each chapter provides readers with possibilities for enacting pedagogies that are responsive to the contemporary circumstances shaping the lives of young children.

QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm

In the filed of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem.However, in semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the scheduling consider not only quality properties of Web services, but also inter service dependencies 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 scheduling optimization problems in workflow applications in the presence of domain constraints and inter service dependencies. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

Understanding China : navigating the road ahead

This paper proposes an alternative way of understanding China’s emergence, drawing on the idea of the creative industries. It looks at China’s embrace of the idea of cultural and creative industries and argues that this paradigm demonstrates that structures of domination (i.e. the commanding heights of political economy exemplified in political economy of the media) are being replaced by geographical development initiatives, mostly led by local governments and councils. In this decentralisation of power we find the seedlings of a more open and democratic society.

Within- and between-day repeatability and variability in children's physiological responses during submaximal treadmill exercise

The purpose of this study was to verify within- and between-day repeatability and variability in children's oxygen uptake (VO^sub 2^), gross economy (GE; VO^sub 2^ divided by speed) and heart rate (HR) during treadmill walking based on self-selected speed (SS). Fourteen children (10.1 ± 1.4 years) undertook three testing sessions over 2 days in which four walking speeds, including SS were tested. Within- and between-day repeatability were assessed using the Bland and Altman method, and coefficients of variability (CV) were determined for each child across exercise bouts and averaged to obtain a mean group CV value for VO^sub 2^, GE, and HR per speed. Repeated measures analysis of variance showed no statistically significant differences in within- or between-day CV for VO^sub 2^, GE, or HR at any speed. Repeatability within- and between-day for VO^sub 2^, GE, and HR for all speeds was verified. These results suggest that submaximal VO^sub 2^ during treadmill walking is stable and reproducible at a range of speeds based on children's SS.

Scheduling trains as a blocking parallel-machine job shop scheduling problem

In this paper, the train scheduling problem is modelled as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the model, trains, single-track sections and multiple-track sections, respectively, are synonymous with jobs, single machines and parallel machines, and an operation is regarded as the movement/traversal of a train across a section. Due to the lack of buffer space, the real-life case should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold the train until next section on the routing becomes available. Based on literature review and our analysis, it is very hard to find a feasible complete schedule directly for BPMJSS problems. Firstly, a parallel-machine job-shop-scheduling (PMJSS) problem is solved by an improved shifting bottleneck procedure (SBP) algorithm without considering blocking conditions. Inspired by the proposed SBP algorithm, feasibility satisfaction procedure (FSP) algorithm is developed to solve and analyse the BPMJSS problem, by an alternative graph model that is an extension of the classical disjunctive graph models. The proposed algorithms have been implemented and validated using real-world data from Queensland Rail. Sensitivity analysis has been applied by considering train length, upgrading track sections, increasing train speed and changing bottleneck sections. The outcomes show that the proposed methodology would be a very useful tool for the real-life train scheduling problems

A robust reactive scheduling model for intensive care units

The ICU is an integral part of any hospital and is under great load from patient arrivals as well as resource limitations. Scheduling of patients in the ICU is complicated by the two general types; elective surgery and emergency arrivals. This complicated situation is handled by creating a tentative initial schedule and then reacting to uncertain arrivals as they occur. For most hospitals there is little or no flexibility in the number of beds that are available for use now or in the future. We propose an integer programming model to handle a parallel machine reacting system for scheduled and unscheduled arrivals.

A new day breaks for the Aussie film industry

The Australian film industry is evolving. The days when government film agencies handed out millions of taxpayers' dollars for filmmakers to produce "Australian stories" with little regard to commercial returns are limited. If the Australian film industry is to reach mainstream audiences – and increase its relevance – then filmmakers need to take greater notice of genre movies and the possibilities they create within the financial restraints of the local industry. The $20 million Aussie vampire movie, Daybreakers, is a prototype for how this can be achieved.

FAB-MAP + RatSLAM : appearance-based SLAM for multiple times of day

Appearance-based mapping and localisation is especially challenging when separate processes of mapping and localisation occur at different times of day. The problem is exacerbated in the outdoors where continuous change in sun angle can drastically affect the appearance of a scene. We confront this challenge by fusing the probabilistic local feature based data association method of FAB-MAP with the pose cell filtering and experience mapping of RatSLAM. We evaluate the effectiveness of our amalgamation of methods using five datasets captured throughout the day from a single camera driven through a network of suburban streets. We show further results when the streets are re-visited three weeks later, and draw conclusions on the value of the system for lifelong mapping.

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.