Introduction to the special issue

Creative productivity emerges from human interactions (Hartley, 2009, p. 214). In an era when life is lived in rather than with media (Deuze, this issue), this productivity is widely distributed among ephemeral social networks mediated through the internet. Understanding the underlying dynamics of these networks of human interaction is an exciting and challenging task that requires us to come up with new ways of thinking and theorizing. For example, inducting theory from case studies that are designed to show the exceptional dynamics present within single settings can be augmented today by largescale data generation and collections that provide new analytic opportunities to research the diversity and complexity of human interaction. Large-scale data generation and collection is occurring across a wide range of individuals and organisations. This offers a massive field of analysis which internet companies and research labs in particular are keen on exploring. Lazer et al (2009: 721) argue that such analytic potential is transformational for many if not most research fields but that the use of such valuable data must neither remain confined to private companies and government agencies nor to a privileged set of academic researchers whose studies cannot be replicated nor critiqued. In fact, the analytic capacity to have data of such unprecedented scope and scale available not only requires us to analyse what is and could be done with it and by whom (1) but also what it is doing to us, our cultures and societies (2). Part (1) of such analysis is interested in dependencies and their implications. Part (2) of the enquiry embeds part (1) in a larger context that analyses the long-term, complex dynamics of networked human interaction. From the latter perspective we can treat specific phenomena and the methods used to analyse them as moments of evolution.

Domain-specific application analysis for customized instruction identification

With the increasing importance of Application Domain Specific Processor (ADSP) design, a significant challenge is to identify special-purpose operations for implementation as a customized instruction. While many methodologies have been proposed for this purpose, they all work for a single algorithm chosen from the target application domain. Such algorithm-specific approaches are not suitable for designing instruction sets applicable to a whole family of related algorithms. For an entire range of related algorithms, this paper develops a methodology for identifying compound operations, as a basis for designing “domain-specific” Instruction Set Architectures (ISAs) that can efficiently run most of the algorithms in a given domain. Our methodology combines three different static analysis techniques to identify instruction sequences common to several related algorithms: identification of (non-branching) instruction sequences that occur commonly across the algorithms; identification of instruction sequences nested within iterative constructs that are thus executed frequently; and identification of commonly-occurring instruction sequences that span basic blocks. Choosing different combinations of these results enables us to design domain-specific special operations with different desired characteristics, such as performance or suitability as a library function. To demonstrate our approach, case studies are carried out for a family of thirteen string matching algorithms. Finally, the validity of our static analysis results is confirmed through independent dynamic analysis experiments and performance improvement measurements.

Effect of physical activity and other stressors on appetite: Overcoming underconsumption of military operational rations revisited.

Recognizing the importance of good nutrition for physical and mental status, the Department of Defense asked the Institute of Medicine to guide the design of the nutritional composition of a ration for soldiers on short-term, high-stress missions. Nutrient Composition of Rations for Short-Term, High-Intensity Combat Operations considers military performance, health concerns, food intake, energy expenditure, physical exercise, and food technology issues. The success of military operations depends to a large extent on the physical and mental status of the individuals involved.

Introduction to special issue on what criminology can say about the war on terror

On 20 September 2001, the former US President, George W. Bush, declared what is now widely, and arguably infamously, known as a ‘war on terror’. In response to the fatal 9/11 attacks in New York and Washington, DC, President Bush identified the US military response as having far-reaching and long-lasting consequences. It was, he argued, ‘our war on terror’ that began ‘with al Qaeda, but … it will not end until every terrorist group of global reach has been found, stopped and defeated’ (CNN 2001). This was to be a war that would, in the words of former British Prime Minister, Tony Blair, seek to eliminate a threat that was ‘aimed at the whole democratic world’ (Blair 2001). Blair claimed that this threat is of such magnitude that unprecedented measures would need to be taken to uphold freedom and security. Blair would later admit that it was a war that ‘divided the country’ and was based on evidence ‘about Saddam having actual biological and chemical weapons, as opposed to the capability to develop them, has turned out to be wrong’ (Blair 2004). The failures of intelligence ushered in new political rhetoric in the form of ‘trust me’ because ‘instinct is no science’ (Blair 2004). The war on terror has been one of the most significant international events in the past three decades, alongside the collapse of the former Soviet Union, the end of apartheid in South Africa, the unification of Europe and the marketization of the People's Republic of China. Yet, unlike the other events, it will not be remembered for advancing democracy or sovereignty, but for the conviction politics of particular politicians who chose to dispense with international law and custom in pursuit of personal instincts that proved fatal. Since the invasions of Afghanistan in October 2001 and …

Editorial for the JFR special issue on low altitude flight of UAVs

This special issue of the Journal of Field Robotics focuses on low altitude flight of UAVs with a particular emphasis on fully implemented systems that were tested in relevant environments or deployed in regular operations.

Uncritical framing : lesson and knowledge structure in school science

There is clearly contention over the shape and formation of science curriculum and over, ultimately, what will count as scientific knowledge, skill, capacity and world view. The Cold War set the policy context for an ongoing focus on science education across Western nations. Sputnik-era US and UK educational policy offered a broad premise for the purpose of school science: in a risky geopolitical environment, high levels of advanced scientific expertise were central to the national interest and necessary for the maintenance of military/industrial and technological power. Half a century on, in the context of global economic and environmental crisis, as a justification for digital, industrial and biomedical innovation, the rationale for the production of scientific capital is central to curriculum settlements and educational policy in Europe, Asia and the Americas.

Faster group operations on elliptic curves

This paper improves implementation techniques of Elliptic Curve Cryptography. We introduce new formulae and algorithms for the group law on Jacobi quartic, Jacobi intersection, Edwards, and Hessian curves. The proposed formulae and algorithms can save time in suitable point representations. To support our claims, a cost comparison is made with classic scalar multiplication algorithms using previous and current operation counts. Most notably, the best speeds are obtained from Jacobi quartic curves which provide the fastest timings for most scalar multiplication strategies benefiting from the proposed 12M + 5S + 1D point doubling and 7M + 3S + 1D point addition algorithms. Furthermore, the new addition algorithm provides an efficient way to protect against side channel attacks which are based on simple power analysis (SPA). Keywords: Efficient elliptic curve arithmetic,unified addition, side channel attack.

Faster pairings on special Weierstrass curves

This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations.

Australian Association for Exercise and Sport Science position stand : optimising cancer outcomes through exercise

Cancer represents a major public health concern in Australia. Causes of cancer are multifactorial with lack of physical activity being considered one of the known risk factors, particularly for breast and colorectal cancers. Participating in exercise has also been associated with benefits during and following treatment for cancer, including improvements in psychosocial and physical outcomes, as well as better compliance with treatment regimens, reduced impact of disease symptoms and treatment-related side effects, and survival benefits for particular cancers. The general exercise prescription for people undertaking or having completed cancer treatment is of low to moderate intensity, regular frequency (3-5 times/week) for at least 20 minutes per session, involving aerobic, resistance or mixed exercise types. Future work needs to push the boundaries of this exercise prescription, so that we can better understand what constitutes optimal, desirable and necessary frequency, duration, intensity and type, and how specific characteristics of the individual (e.g., age, cancer type, treatment, presence of specific symptoms) influence this prescription. What follows is a summary of the cancer and exercise literature, in particular the purpose of exercise following diagnosis of cancer, the potential benefits derived by cancer patients and survivors from participating in exercise programs, and exercise prescription guidelines and contraindications or considerations for exercise prescription with this special population. This report represents the position stand of the Australian Association of Exercise and Sport Science on exercise and cancer recovery and has the purpose of guiding Accredited Exercise Physiologists in their work with cancer patients.

Frontiers in Materials Science and Technology

This special issue aims to provide up-to-date knowledge and the latest scientific concepts and technological developments in the processing, characterization, testing, mechanics, modeling and applications of a broad range of advanced materials. The many contributors, from Denmark, Germany, UK, Iran, Saudi Arabia, Malaysia, Japan, the People’s Republic of China, Singapore, Taiwan, USA, New Zealand and Australia, present a wide range of topics including: nanomaterials, thin films and coatings, metals and alloys, composite materials, materials processing and characterization, biomaterials and biomechanics, and computational materials science and simulation. The work will therefore be of great interest to a broad spectrum of researchers and technologists.

Teaching and learning science and mathematics through technology practice

In this chapter we review studies of the engagement of students in design projects that emphasise integration of technology practice and the enabling sciences, which include physics and mathematics. We give special attention to affective and conceptual outcomes from innovative interventions of design projects. This is important work because of growing international concern that demand for professionals with technological expertise is increasing rapidly, while the supply of students willing to undertake the rigors of study in the enabling sciences is proportionally reducing (e.g., Barringtion, 2006; Hannover & Kessels, 2004; Yurtseven, 2002). The net effect is that the shortage in qualified workers is having a detrimental effect upon economic and social potential in Westernised countries (e.g., Department of Education, Science and Training [DEST], 2003; National Numeracy Review Panel and National Numeracy Review Secretarial, 2007; Yurtseven, 2002). Interestingly, this trend is reversed in developing economies including China and India (Anderson & Gilbride, 2003).

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.