Supporting collaboration on very large-scale interactive wall surfaces

In this paper we describe CubIT, a multi-user presentation and collaboration system installed at the Queensland University of Technology’s (QUT) Cube facility. The ‘Cube’ is an interactive visualisation facility made up of five very large-scale interactive multi-panel wall displays, each consisting of up to twelve 55-inch multi-touch screens (48 screens in total) and massive projected display screens situated above the display panels. The paper outlines the unique design challenges, features, implementation and evaluation of CubIT. The system was built to make the Cube facility accessible to QUT’s academic and student population. CubIT enables users to easily upload and share their own media content, and allows multiple users to simultaneously interact with the Cube’s wall displays. The features of CubIT were implemented via three user interfaces, a multi-touch interface working on the wall displays, a mobile phone and tablet application and a web-based content management system. Each of these interfaces plays a different role and offers different interaction mechanisms. Together they support a wide range of collaborative features including multi-user shared workspaces, drag and drop upload and sharing between users, session management and dynamic state control between different parts of the system. The results of our evaluation study showed that CubIT was successfully used for a variety of tasks, and highlighted challenges with regards to user expectations regarding functionality as well as issues arising from public use.

Open problem: Shifting experts on easy data

A number of online algorithms have been developed that have small additional loss (regret) compared to the best “shifting expert”. In this model, there is a set of experts and the comparator is the best partition of the trial sequence into a small number of segments, where the expert of smallest loss is chosen in each segment. The regret is typically defined for worst-case data / loss sequences. There has been a recent surge of interest in online algorithms that combine good worst-case guarantees with much improved performance on easy data. A practically relevant class of easy data is the case when the loss of each expert is iid and the best and second best experts have a gap between their mean loss. In the full information setting, the FlipFlop algorithm by De Rooij et al. (2014) combines the best of the iid optimal Follow-The-Leader (FL) and the worst-case-safe Hedge algorithms, whereas in the bandit information case SAO by Bubeck and Slivkins (2012) competes with the iid optimal UCB and the worst-case-safe EXP3. We ask the same question for the shifting expert problem. First, we ask what are the simple and efficient algorithms for the shifting experts problem when the loss sequence in each segment is iid with respect to a fixed but unknown distribution. Second, we ask how to efficiently unite the performance of such algorithms on easy data with worst-case robustness. A particular intriguing open problem is the case when the comparator shifts within a small subset of experts from a large set under the assumption that the losses in each segment are iid.

Polly Pocket

Comprised of ten 3 minute and two 12 minutes animated episodes, featuring Polly Pockets and her friend in numerous adventures.

Food futures: Three provocations to challenge HCI interventions

Our contemporary concerns about food range from food security to agricultural sustainability to getting dinner on the table for family and friends. This book investigates food issues as they intersect with participatory Internet culture--blogs, wikis, online photo- and video-sharing platforms, and social networks in efforts to bring about a healthy, socially inclusive, and sustainable food future. Focusing on our urban environments provisioned with digital and network capacities, and drawing on such "bottom-up" sociotechnical trends as DIY and open source, the chapters describe engagements with food and technology that engender (re-)creative interactions.

LunaRoo: A Proposal for the Google Lunar XPrize Payload Opportunity with the Part Time Scientists team

This proposal describes the innovative and competitive lunar payload solution developed at the Queensland University of Technology (QUT)–the LunaRoo: a hopping robot designed to exploit the Moon's lower gravity to leap up to 20m above the surface. It is compact enough to fit within a 10cm cube, whilst providing unique observation and mission capabilities by creating imagery during the hop. This first section is deliberately kept short and concise for web submission; additional information can be found in the second chapter.

Integration of Opinion Mining into customer analysis model

This research proposes a multi-dimensional model for Opinion Mining, which integrates customers' characteristics and their opinions about products (or services). Customer opinions are valuable for companies to deliver right products or services to their customers. This research presents a comprehensive framework to evaluate opinions' orientation based on products' hierarchy attributes. It also provides an alternative way to obtain opinion summaries for different groups of customers and different categories of produces.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Study on the elastic-plastic behavior of a porous hierarchical bioscaffold used for bone regeneration

A perfectly plastic von Mises model is proposed to study the elastic-plastic behavior of a porous hierarchical scaffold used for bone regeneration. The proposed constitutive model is implemented in a finite element (FE) routine to obtain the stress-strain relationship of a uniaxially loaded cube of the scaffold, whose constituent is considered to be composed of cortical bone. The results agree well with experimental data for uniaxial loading case of a cancellous bone. We find that the unhomogenized stress distribution results in different mechanical properties from but still comparable to our previous theory. The scaffold is a promising candidate for bone regeneration.

It's all in the Team: Collaborations driving success in learning – a first year case

First year medical laboratory science students (up to 120) undertake a group e-poster project, based in a blended learning model Google Drive, encompassing Google’s cloud computing software, provides a readily accessible, transparent online space for students to collaborate with each other and realise tangible outcomes from their learning The Cube provides an inspiring digital learning display space for student ‘conference style’ presentations

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G,denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R-1 x R-2 x ... x R-k where each Ri is a closed interval on the real line of the form [a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G) <= t + inverted right perpendicularlog(n - t)inverted left perpendicular - 1 and box(G) <= left perpendiculart/2right perpendicular + 1, where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds. F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, box(G) <= left perpendicularn/2right perpendicular and cub(G) <= inverted right perpendicular2n/3inverted left perpendicular, where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then box(G) <= inverted right perpendicularn/4inverted left perpendicular and this bound is tight. We also show that if G is a bipartite graph then cub(G) <= n/2 + inverted right perpendicularlog n inverted left perpendicular - 1. We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to n/4. Interestingly, if boxicity is very close to n/2, then chromatic number also has to be very high. In particular, we show that if box(G) = n/2 - s, s >= 0, then chi (G) >= n/2s+2, where chi (G) is the chromatic number of G.

The Expanding Live Cattle Trade in Northern Australian

The north Australian beef industry is complex and dynamic. It is strategically positioned to access new and existing export markets. To prosper in a global economy, it will require strong processing and live cattle sectors, continued rationalisation of infrastructure, uptake of appropriate technology, and the synergy obtained when industry sectors unite and cooperate to maintain market advantage. Strategies to address food safety, animal welfare, the environment and other consumer concerns must be delivered. Strategic alliances with quality assurance systems will develop. These alliances will be based on economies of scale and on vertical cooperation, rather than vertical integration. Industry sectors will need to increase their contribution to Research, Development and Extension. These contributions need to be global in outlook. Industry sectors should also be aware that change (positive or negative) in one sector will impact on other sectors. Feedback along the food chain is essential to maximise productivity and market share.

Teatteri liikkeessä : Työväenteatterit Suomen teatterikentällä ja työväenliikkeessä kaksiteatterijärjestelmän syntyyn asti vuonna 1922

Workers' theatres in Finland until 1922 The topic of this dissertation is the workers' theatres in Finland before the year 1922. The main question is: why did these amateur theatres within the workers' associations become part of the professional theatre field in the 1910s by getting state subsidy as local theatre institutions? How is it possible that they received this status even after the civil war in 1918 when new professional theatres were founded all over the country? The study also asks, what kind of position did workers' theatres have in the workers' associations and in the workers' movement, what did the Social Democrats and Communists think of theatre and in particular of workers' theatre, and what kind of repertoire did the workers' theatres perform? It is a particular feature of Finland that the professional theatre field was not organised and that the workers’ movement had a relatively strong political position. The study concludes that some workers' theatres were the only steady theatre institutions in their surroundings, and thus functioned as local popular theatres performing to all social groups. Although amateur-based, they started to resemble professional theatres. Even though the Social Democratic Party did not have a specific theatre policy, the leaders of the Party appreciated and supported the workers' theatres as educational institutions and worked for their artistic improvement. The workers' theatres were also largely approved of and seen as people's theatres thought to unite and educate the nation and the working class. This reveals the need for national consensus, in the 1910s against the Russian government who worked to dissolve the autonomous position of the Finnish state, and after the civil war (1918) against the threat of a communist revolution. A wave of agitating proletarian theatre was felt in Finland in the early 1920s but it was marginalised by the large anti-communist majority.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

Central America: Labor Reports and Child Labor Reports Pursuant to the Trade Act of 2002, Section 2102(c)(8)-(9)

[Excerpt] These comments are in response to the “Request for Information Concerning Labor Rights in Costa Rica, El Salvador, Guatemala, Honduras and Nicaragua and their Laws Governing Exploitative Child Labor” published at 68 Fed. Reg. 19580 (April 21, 2003). This Request for Information was issued pursuant to Section 2102(c)(8) and (9) of the Trade Act of 2002, Pub. L. 107-210, which requires the President, with respect to any proposed trade agreement, to submit to Congress a “meaningful labor rights report” and a “report describing the extent to which the country or countries that are parties to the agreement have in effect laws governing exploitative child labor.”