Multi-objective optimisation of bijective s-boxes

In this paper we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to generate bijective s-boxes with the best known tradeoffs among the considered criteria. The s-boxes found are suitable for use directly in modern encryption algorithms.

Drugs, labels and (p)ill-fitting boxes : ADHD and children who are hard to teach

In offering a critical review of the problem we call “ADHD” this paper progresses in three stages. The first two parts juxtapose the dominant voices emanating from the literature in medicine and psychology, highlighting some interdependency between these otherwise competing interest groups. In part three, the nature of the relationship between these groups and the institution of the school is considered, as is the role that the school may play in the psycho-pathologisation of fidgety, distractible, active children who prove hard to teach. In so doing, the author provides an insight as to why the problem we call “ADHD” has achieved celebrity status in Australia and what the effects of that may be for children who come to be described in these ways.

Characterisations of extended resiliency and extended immunity of S-boxes

New criteria of extended resiliency and extended immunity of vectorial Boolean functions, such as S-boxes for stream or block ciphers, were recently introduced. They are related to a divide-and-conquer approach to algebraic attacks by conditional or unconditional equations. Classical resiliency turns out to be a special case of extended resiliency and as such requires more conditions to be satisfied. In particular, the algebraic degrees of classically resilient S-boxes are restricted to lower values. In this paper, extended immunity and extended resiliency of S-boxes are studied and many characterisations and properties of such S-boxes are established. The new criteria are shown to be necessary and sufficient for resistance against the divide-and-conquer algebraic attacks by conditional or unconditional equations.

Little boxes : changing perceptions and including young people in socially sustainable participatory planning

In recent years, a great deal has been written about the benefits and ethics of including young people in participative decision-making. This has been accompanied by a burgeoning interest in including their views in participatory planning exercises that has not always been realised in practice. Drawing on a detailed analysis of the perceptions of adults and young people involved in a participatory planning exercise on Australia‟s Gold Coast, we believe that there are two major hurdles to the „full‟ engagement of young people that are in some respects two sides of the same coin: the sometimes paternalistic perceptions and often dismissive attitude that many adults have towards the participation of young people; and the perceptions that young people may have of themselves and their subordinate place in an adult-dominated planning environment. Together, such views act to place limitations on the participation of young people because they set up unrealistic expectations for both adult and younger participants in terms of how and why young people participate, and what this participation should „look and feel‟ like. In this paper, through the metaphor of boxes, we propose a number of issues that should be addressed when involving young people in participatory planning processes to ensure the most from their participation for all involved.

Volunteers and collection boxes; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"3000 Buechsen werden aufgestellt"

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

The design and synthesis of redox core-alpha amino acid composites based on thiol-disulfide exchange mechanism and a comparative study of their zinc abstraction potential from [CCXX] boxes in proteins

The design and synthesis of agents that can abstract zinc from their [CCXX] (C=cysteine; X=cysteine/histidine) boxes by thioldisulfide exchange-having as control, the redox parities of the core sulfur ligands of the reagent and the enzyme, has been illustrated, and their efficiency demonstrated by monitoring the inhibition of the transcription of calf thymus DNA by E. coli RNA polymerase, which harbors two zinc atoms in their [CCXX] boxes of which one is exchangeable. Maximum inhibition possible with removal of the exchangeable zinc was seen with redox-sulfanilamide-glutamate composite. In sharp contrast, normal chelating agents (EDTA, phenanthroline) even in a thousand fold excess showed only marginal inhibition, thus supporting an exchange mechanism for the metal removal. (C) 2002 Elsevier Science Ltd. All rights reserved.

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes just touch at their boundaries. Further, this construction can be realized in linear time.

On piercing (pseudo)lines and boxes

We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable.

REPRESENTING A CUBIC GRAPH AS THE INTERSECTION GRAPH OF AXIS-PARALLEL BOXES IN THREE DIMENSIONS

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes touch just at their boundaries.