A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have implemented a Firewall with this architecture in reconflgurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results in both speed and area improvement when it is implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields. High throughput classification invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly in terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for the worst case packet size. The Firewall rule update involves only memory re-initialization in software without any hardware change.

Australian court holds Google is responsible for linking to defamatory website

The South Australian Supreme Court this week found that Google is legally responsible when its search results link to defamatory content on the web. In this long-running case, Dr Janice Duffy has been trying for more than six years to clear her name and remove links to defamatory material when people search for her using Google. The main culprit is the US based website Ripoff Reports, where people have posted negative reviews of Dr Duffy. Under United States law, defamation is very hard to prove, and US websites are not liable for comments made by their users. Since it was not possible to get harmful or abusive comments removed from the source, Dr Duffy instead asked Google to remove the links from its search results. Google removed some of these links, but only from its Australian domain (google.com.au), and it left many of them active. This latest court decision is a big win for Dr Duffy. The court found that once Google was alerted to the defamatory material, it was then under an obligation to act to censor its search results and prevent further harm to Dr Duffy’s reputation.

N-Phenylnicotinamide

In the title compound, C12H10N2O, the dihedral angle between the phenyl and pyridine rings is 64.81 (1)degrees. Intermolecular N-H center dot center dot center dot O hydrogen bonds connect the molecules into chains running along the b axis.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have Implemented a Firewall with this architecture in reconfigurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using, our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results In both speed and area Improvement when It is Implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields.High throughput classification Invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly In terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware Implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for file worst case packet size. The Firewall rule update Involves only memory re-initialiization in software without any hardware change.

Effect of shoes' heel height on the energy cost during jogging

The purpose of this study is to examine the changes of energy cost during a high-heeled continuous jogging.Thirteen healthy female volunteers jointed in this study with heel height of the shoes varied from 1, 4.5 and 7 cm, respectively. Each subjects jogged on the treadmill with K4b2 portable gas analysis system. The results of this study showed that ventilnation, relative oxygen consumption and energy expenditure increased with the increase of heel height and these values shows significantly larger when the heel height reached to 7 cm. Present study suggest that wearing high heel shoes jogging could directly increase energy consumption, causing neuromuscular fatigue.

The ninth 48hr game making challenge (2015)

The 48 hour game making challenge has been running since 2007. In recent years, we have not only been running a 'game jam' for the local community but we have also been exploring the way in which the event itself and the place of the event has the potential to create its own stories. The 2015 challenge is part of a series of data collection opportunities focussed on the game jam itself and the meaning making that the participants engage in about the event. We are continuing the data collection commenced in 2012: "Game jams are the creative festivals of the game development community and a game jam is very much an event or performance; its stories are those of subjective experience. Participants return year after year and recount personal stories from previous challenges; arrival in the 48hr location typically inspires instances of individual memory and narration more in keeping with those of a music festival or an oft frequented holiday destination. Since its inception, the 48hr has been heavily documented, from the photo-blogging of our first jam and the twitter streams of more recent events to more formal interviews and documentaries (see Anderson, 2012). We have even had our own moments of Gonzo journalism with an on-site press room one year and an ‘embedded’ journalist another year (Keogh, 2011). In the last two years of the 48hr we have started to explore ways and means to collect more abstract data during the event, that is, empirical data about movement and activity. The intent behind this form of data collection was to explore graphic and computer generated visualisations of the event, not for the purpose of formal analysis but in the service of further story telling." [exerpt from truna aka j.turner, Thomas & Owen, 2013) See: truna aka j.turner, Thomas & Owen (2013) Living the indie life: mapping creative teams in a 48 hour game jam and playing with data, Proceedings of the 9th Australasian Conference on Interactive Entertainment, IE'2013, September 30 - October 01 2013, Melbourne, VIC, Australia

The effect of an in–shoe orthotic heel lift on loading of the Achilles tendon during shod walking

- Study Design Controlled laboratory study - Objective To investigate the effect of a 12–mm in–shoe orthotic heel lift on Achilles tendon loading during shod walking using transmission–mode ultrasonography. - Background Orthotic heel lifts are thought to lower tension in the Achilles tendon but evidence for this effect is equivocal. - Methods The propagation speed of ultrasound, which is governed by the elastic modulus and density of tendon and is proportional to the tensile load to which it is exposed, was measured in the right Achilles tendon of twelve recreationally–active males during shod treadmill walking at matched speeds (3.4±0.7 km/h), with and without addition of a heel lift. Vertical ground reaction force and spatiotemporal gait parameters were simultaneously recorded. Data were acquired at 100Hz during 10s of steady–state walking. Statistical comparisons were made using paired t–tests (α=.05). - Results Ultrasound transmission speed in the Achilles tendon was characterized by two maxima (P1, P2) and minima (M1, M2) during walking. Addition of a heel lift to footwear resulted in a 2% increase and 2% decrease in the first vertical ground reaction force peak and the local minimum, respectively (P<.05). Peak ultrasonic velocity in the Achilles tendon (P1, P2, M2) was significantly lower with addition of an orthotic heel lift (P<.05). - Conclusions Peak ultrasound transmission speed in the Achilles tendon was lower with the addition of a 12–mm orthotic heel lift, indicating the heel lift reduced tensile load in the Achilles tendon, thereby counteracting the effect of footwear. These findings support the addition of orthotic heel lifts to footwear in the rehabilitation of Achilles tendon disorders where management aims to lower tension within the tendon. - Level of Evidence Therapy, level 2a

Simulation of the supply capability of sheep on the Mitchell grass downs of north west Queensland

Sheep in western Queensland have been predominantly reared for wool. When wool prices became depressed interest in the sheep meat industry, increased. For north west Queensland producers, opportunities may exist to participate in live sheep and meat export to Asia. A simulation model was developed to determine whether this sheep producing area has the capability to provide sufficient numbers of sheep under variable climatic conditions while sustaining the land resources. Maximum capacity for sustainability of resources (as described by stock numbers) was derived from an in-depth study of the agricultural and pastoral potential of Queensland. Decades of sheep production and climatic data spanning differing seasonal conditions were collated for analysis. A ruminant biology model adapted from Grazplan was used to simulate pregnancy rate. Empirical equations predict mortalities, marking rates, and weight characteristics of sheep of various ages from simple climatic measures, stocking rate and reproductive status. The initial age structure of flocks was determined by running the model for several years with historical climatic conditions. Drought management strategies such as selling a proportion of wethers progressively down to two-tooth and oldest ewes were incorporated. Management decisions such as time of joining, age at which ewes were cast-for-age, wether turn-off age and turning-off rate of lambs vary with geographical area and can be specified at run time. The model is run for sequences of climatic conditions generated stochastically from distributions based on historical climatic data correlated in some instances. The model highlights the difficulties of sustaining a consistent supply of sheep under variable climatic conditions.

Serendipitous road trips: Enhancing tourists’ experiences through social interaction

Driving can be a lonely activity. While there has been a lot of research and technical inventions concerning car-to-car communication and passenger entertainment, there is still little work concerning connecting drivers. Whereas tourism is very much a social activity, drive tourists have few options to communicate with fellow travellers. The proposed project is placed at the intersection of tourism and driving and aims to enhance the trip experience during driving through social interaction. This thesis explores how a mobile application that allows instant messaging between travellers sharing similar context can add to road trip experiences. To inform the design of such an application, the project adopted the principle of the user-centred design process. User needs were assessed by running an ideation workshop and a field trip. Findings of both studies have shown that tourists have different preferences and diverse attitudes towards contacting new people. Yet all participants stressed the value of social recommendations. Based on those results and a later expert review, three prototype versions of the system were created. A prototyping session with potential end users highlighted the most important features including the possibility to view user profiles, choose between text and audio input and receive up-to-date information. An implemented version of the prototype was evaluated in an exploratory study to identify usability related problems in an actual use case scenario as well as to find implementation bugs. The outcomes of this research are relevant for the design of future mobile tourist guides that leverage from benefits of social recommendations.

Assessing the cost-effectiveness of water quality interventions in South-East Queensland

The focus of this article is on the cost-effectiveness of mitigation strategies to reduce pollution loads and improve water quality in South-East Queensland. Scenarios were developed about the types of catchment interventions that could be considered, and the resulting changes in water quality indicators that may result. Once these catchment scenarios were modelled, the range of expected outcomes was assessed and the costs of mitigation interventions were estimated. Strategies considered include point and non-point source interventions. Predicted reductions in pollution levels were calculated for each action based on the expected population growth. The cost of the interventions included the full investment and annual running costs as well as planned public investment by the state agencies. Cost-effectiveness of strategies is likely to vary according to whether suspended sediments, nitrogen or phosphorus loads are being targeted.

New records of the River Shark Glyphis (Carcharhinidae) reported from Cape York Peninsula, northern Australia

The distribution of the river shark Glyphis in northern Australia is extended with new records of occurrence in the Gulf of Carpentaria and a reassessment of historical survey data from Cape York Peninsula. Nine new specimens of Glyphis sp. A were collected in 2005 from the Weipa region on the Queensland coast of the Gulf of Carpentaria. A re-examination of archival records from 1978-86 marine and estuarine fish surveys in the Gulf of Carpentaria and along the northern Queensland East Coast allowed a further nineteen Glyphis specimens to be identified. Combined this gives twenty-eight new records of Glyphis specimens from the coasts of Cape York Peninsula, Queensland. Common habitat characteristics for all captures were turbid, shallow, fast running tidal water in the upper reaches of coastal rivers. The substrate was generally muddy and the rivers lined with mangrove. In all surveys the representation of Glyphis was low, being less than 1% of the total shark captures historically and 0.002 sharks 50 m net hour-1 in Weipa 2005. The size range captured was 1000-1800 mm total length historically and 705-1200 mm total length from Weipa 2005, with none recorded as sexually mature. Diagnostic characteristics of the Weipa specimens, identified as Glyphis sp. A, were: lower jaw teeth protruding and "spear-like"; second dorsal fin greater than half the height of the first dorsal fin; the snout relatively short and fleshy in the lateral view; pectoral fin ventral surface black in colouration; the precaudal vertebral count between 118 and 123; and the total vertebral count between 204 and 209.

Social and physical environments in senior communities: The Finnish experience

Purpose – The purpose of this paper is to discuss residents’ views of social and physical environments in a co-housing and in a senior housing setting in Finland. Also, the study aims to point out important connections between well-being and built environment. Design/methodology/approach – The data include interviews and survey responses gathered in the cases. The results and analysis are presented at different case study levels, with the discussion and conclusions following this. Findings – The findings show that the physical environment and common areas have an important role to activate residents. When well-designed common areas exist, a higher level of engagement can be achieved by getting residents involved in the planning and running of activities. Research limitations/implications – This paper discusses residents’ experiences in two Finnish housing settings and it focuses on the housing market in Finland. Practical implications – The findings encourage investors and housing operators to design and invest common areas which could activate residents and create social contacts. Also, investors have to pay attention to the way these developments are managed. Originality/value – This study is the first to investigate the Finnish co-housing setting and compare social and physical environments in a co-housing and a senior house.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Performance of graphic aluminium particulate composite materials

Friction characteristics of journal bearings made from cast graphic aluminum particulate composite alloy were determined under mixed lubrication and compared with those of the base alloy (without graphite) and leaded phosphor bronze. All three materials ran without seizure while the performance of the particulate composite and leaded phosphor bronze improved with running. Temperature rise in the journal bearing under mixed/boundary lubrication was also measured. It was found that with 0.3D/1000 to 1.5D/1000 clearance and a low lubrication rate (typical value for a bearing of diameter 35 mm × length 35 mm is 80 mm3/min) and at a PV value of 73 × 106 Nm m−2 min−1 graphitic aluminium alloy journal bearings operate satisfactorily without seizure and excessive temperature rise. In comparison, the bronze bearings, with all the other parameters remaining the same, could not run without excessive temperature rise at clearances below D/1000 at lubrication rates lower than 200 mm3/min

Comprehensive Path-sensitive Data-flow Analysis

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. W initially perform data-flow analysis to determine those control-flow merges which cause the loss in data-flow analysis precision. The control-flow graph of the program is then restructured such that performing data-flow analysis on the resulting restructured graph gives more precise results. The proposed framework is both simple, involving the familiar notion of product automata, and also general, since it is applicable to any forward data-flow analysis. Apart from proving that our restructuring process is correct, we also show that restructuring is effective in that it necessarily leads to more optimization opportunities. Furthermore, the framework handles the trade-off between the increase in data-flow precision and the code size increase inherent in the restructuring. We show that determining an optimal restructuring is NP-hard, and propose and evaluate a greedy strategy. The framework has been implemented in the Scale research compiler, and instantiated for the specific problem of Constant Propagation. On the SPECINT 2000 benchmark suite we observe an average speedup of 4% in the running times over Wegman-Zadeck conditional constant propagation algorithm and 2% over a purely path profile guided approach.