Chongqing International Circus City

The design grows out of the rich culture of circus and the rugged dynamic topography of Chongqing. The site for this project is nestled on the banks of the mighty Yangzte, China's longest river: a vast sweeping watery ribbon carving its way through the mountainous terrain. This swirling sinuous environmental thread replicates in nature the tweisting ribbons circling the gyrating circus gymnast. The project grows from intertwining these swirling parallel conceptions of 'ribbon'. A multi-layered envelope of glass and steel ribbons creates a dome like enclosure that wraps itself around the dynamic performing heart of the circus. The main auditorium and stage area are accommodated in this space. Key public elements and facilities are located adjacent to the new riverfront boulevard maximising the positive relationship with this attractive landscape zone. Service and support areas are located along the southern boundary. Key Statistics; Client: Chongqing Broadcast Bureau Developer: Chongqing Real Estate Site: 3.3 Ha Development: Total G.F.A.: 36,800m2 Project Cost: Total Investment: RMB 300 Million (A$48 million) Other competition participants were BIG-Bjarke Ingels Group (Denmark)/arquitectonica (USA)/Beijing Architectural Design Institute/East China Architectural Design Institute/China Architectural Design Academy.

Modeling key compromise impersonation attacks on group key exchange protocols

Two-party key exchange (2PKE) protocols have been rigorously analyzed under various models considering different adversarial actions. However, the analysis of group key exchange (GKE) protocols has not been as extensive as that of 2PKE protocols. Particularly, an important security attribute called key compromise impersonation (KCI) resilience has been completely ignored for the case of GKE protocols. Informally, a protocol is said to provide KCI resilience if the compromise of the long-term secret key of a protocol participant A does not allow the adversary to impersonate an honest participant B to A. In this paper, we argue that KCI resilience for GKE protocols is at least as important as it is for 2PKE protocols. Our first contribution is revised definitions of security for GKE protocols considering KCI attacks by both outsider and insider adversaries. We also give a new proof of security for an existing two-round GKE protocol under the revised security definitions assuming random oracles. We then show how to achieve insider KCIR in a generic way using a known compiler in the literature. As one may expect, this additional security assurance comes at the cost of an extra round of communication. Finally, we show that a few existing protocols are not secure against outsider KCI attacks. The attacks on these protocols illustrate the necessity of considering KCI resilience for GKE protocols.

Microstrip to parallel strip balun as spiral antenna feed

This paper presents the design and implementation of a microstrip to parallel strip balun which are frequently used as balanced antennas feed. This wideband balun transition is composed of a parallel strip which is connected to the spiral antenna and a microstrip line where the width of the ground plane is gradually reduced to eventually resemble the parallel strip. The taper accomplishes the mode and impedance transformation. This balun has significantly improved bandwidth characteristics. The entire circuit was fabricated on RT Duriod 5880 substrate. The circuit designs were simulated and optimised using CST Microwave Studio and the simulated results are compared with the measured results. The back-to-back microstrip to parallel strip has a return loss of better than 10 dB over a wide bandwidth from 1.75 to 15 GHz. The performance of the proposed balun was validated with the spiral antenna. The measured results were compared with the simulated results and it shows that the antenna operates well in wideband frequency range from 2.5 to 15 GHz.

Scheduling Trains with Priorities : a no-wait blocking parallel-machine job-shop scheduling model

The paper investigates train scheduling problems when prioritised trains and non-prioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, non-prioritised trains such as freight trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available, which is thought of as a relaxation of no-wait conditions. With thorough analysis of the structural properties of the No-Wait Blocking Parallel-Machine Job-Shop-Scheduling (NWBPMJSS) problem that is originated in this research, an innovative generic constructive algorithm (called NWBPMJSS_Liu-Kozan) is proposed to construct the feasible train timetable in terms of a given order of trains. In particular, the proposed NWBPMJSS_Liu-Kozan constructive algorithm comprises several recursively-used sub-algorithms (i.e. Best-Starting-Time-Determination Procedure, Blocking-Time-Determination Procedure, Conflict-Checking Procedure, Conflict-Eliminating Procedure, Tune-up Procedure and Fine-tune Procedure) to guarantee feasibility by satisfying the blocking, no-wait, deadlock-free and conflict-free constraints. A two-stage hybrid heuristic algorithm (NWBPMJSS_Liu-Kozan-BIH) is developed by combining the NWBPMJSS_Liu-Kozan constructive algorithm and the Best-Insertion-Heuristic (BIH) algorithm to find the preferable train schedule in an efficient and economical way. Extensive computational experiments show that the proposed methodology is promising because it can be applied as a standard and fundamental toolbox for identifying, analysing, modelling and solving real-world scheduling problems.

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Verbal instruction abolishes fear conditioned to racial out-group faces

Previous research has shown resistance to extinction of fear conditioned to racial out-group faces, suggesting that these stimuli may be subject to prepared fear learning. The current study replicated and extended previous research by using a different racial out-group, and testing the prediction that prepared fear learning is unaffected by verbal instructions. Four groups of Caucasian participants were trained with male in-group (Caucasian) or out-group (Chinese) faces as conditional stimuli; one paired with an electro-tactile shock (CS+) and one presented alone (CS). Before extinction, half the participants were instructed that no more shocks would be presented. Fear conditioning, indexed by larger electrodermal responses to, and blink startle modulation during the CS+, occurred during acquisition in all groups. Resistance to extinction of fear learning was found only in the racial out-group, no instruction condition. Fear conditioned to a racial out-group face was reduced following verbal instructions, contrary to predictions for the nature of prepared fear learning.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Has increasing the age for child passengers to wear child restraints improved the extent to which they are used? Results from an Australian focus group and survey study.

Acknowledgement that many children in Australia travel in restraints that do not offer them the best protection has led to recent changes in legislation such that the type of restraint for children under 7 years is now specified. This paper reports the results of two studies (observational; focus group/ survey) carried out in the state of Queensland to evaluate the effectiveness of these changes to the legislation. Observations suggested that almost all of the children estimated as aged 0-12 years were restrained (95%). Analysis of the type of restraint used for target-aged children (0-6 year olds) suggests that the proportion using an age-appropriate restraint has increased by an estimated 7% since enactment of the legislation. However, around 1 in 4 children estimated as aged under 7 years were using restraints too large for good fit. Results from the survey and focus group suggested parents were supportive of the changes in legislation. Non-Indigenous parents agreed that the changes had been necessary, were effective at getting children into the right restraints, were easy to understand as well as making it clear what restraint to use with children. Moreover, they did not see the legislation as too complicated or too hard to comply with. Indigenous parents who participated in a focus group also regarded the legislation as improving children’s safety. However, they identified the cost of restraints as an important barrier to compliance. In summary, the legislation appears to have had a positive effect on compliance levels and on raising parental awareness of the need to restrain children child-specific restraints for longer. However, it would seem that an important minority of parents transition their children into larger restraints too early for optimal protection. Intervention efforts should aim to better inform these parents about appropriate ages for transition, especially from forward facing childseats. This could potentially be through use of other important transitions that occur at the same age, such as starting school. The small proportion of parents who do not restrain their children at all are also an important community sector to target. Finally, obtaining restraints presents a significant barrier to compliance for parents on limited incomes and interventions are needed to address this.

Group law computations on Jacobians of hyperelliptic Curves

We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor’s general composition involves arithmetic in the polynomial ring F_q[x], the algorithm we propose solves a linear system over the base field which can be written down directly from the Mumford coordinates of the group elements. We apply this method to give more efficient formulas for group operations in both affine and projective coordinates for cryptographic systems based on Jacobians of genus 2 hyperelliptic curves in general form.

Negotiating group dynamics for better safety performance

Safety psychology and workplace safety Commitment, Motivational and attitudinal components of safety Leadership Group Dynamics and Group Change Case Study from Construction

Promoting Adult Resilience (PAR): Group Leaders Manual

RAP-A was developed to meet the need for a universal resilience building program for teenagers which could be readily implemented in a school setting. A universal program targets all teenagers in a particular grade as opposed to those at higher risk for depression (indicated or selective approaches) or a treatment group. It is easier to recruit and engage adolescents in a universal approach where students do not face the risk of stigmatisation by being singled out for intervention. The Resourceful Adolescent Program (RAP: Shochet, Holland & Whitefield, 1997) was developed to meet this need.

4-Amino-N-(4,6-dimethylpyrimidin-2-yl)benzenesulfonamide-4-nitrobenzoic acid

In the asymmetric unit of the title co-crystal, C12H14N4O2S . C7H5NO4 there are two independent but conformationally similar heterodimers, which are formed through intermolecular N-H...O(carboxy) and carboxyl O-H...N hydrogen-bond pairs, giving a cyclic motif [graph set R2/2(8)]. The dihedral angles between the rings in the sulfonamide molecules are 78.77(8) and 82.33(9)deg. while the dihedral angles between the ring and the CO2H group in the acids are 2.19(9) and 7.02(10)deg. A two-dimensional structure parallel to the ab plane is generated from the heterodimer units through hydrogen-bonding associations between NH2 and sulfone groups. Between neighbouring two-dimensional arrays there are two types of aromatic pi-pi stacking interactions involving either one of the pyrimidine rings and a 4-nitrobenzoic acid molecule [minimum ring centroid separation = 3.5886(9)A] or two acid molecules [minimum ring centroid separation = 3.7236(10)A].