Funds of knowledge of sorting and patterning : networks of exchange in a Torres Strait Island community

The purpose of this article is to describe a project with one Torres Strait Islander Community. It provides some insights into parents’ funds of knowledge that are mathematical in nature, such as sorting shells and giving fish. The idea of funds of knowledge is based the premise that people are competent and have knowledge that has been historically and culturally accumulated into a body of knowledge and skills essential for their functioning and well-being. This knowledge is then practised throughout their lives and passed onto the next generation of children. Through using a community research approach, funds of knowledge that can be used to validate the community’s identities as knowledgeable people, can be used as foundations for future learnings for teachers, parents and children in the early years of school. They can be the bridge that joins a community’s funds of knowledge with schools validating that knowledge.

A non-linear dynamic analysis of heavy haul track line sleepers under wheel flat

Significant wheel-rail dynamic forces occur because of imperfections in the wheels and/or rail. One of the key responses to the transmission of these forces down through the track is impact force on the sleepers. Dynamic analysis of nonlinear systems is very complicated and does not lend itself easily to a classical solution of multiple equations. Trying to deduce the behaviour of track components from experimental data is very difficult because such data is hard to obtain and applies to only the particular conditions of the track being tested. The finite element method can be the best solution to this dilemma. This paper describes a finite element model using the software package ANSYS for various sized flat defects in the tread of a wheel rolling at a typical speed on heavy haul track. The paper explores the dynamic response of a prestressed concrete sleeper to these defects.

A dynamic wheel-rail impact analysis of railway track under wheel flat by Finite Element Analysis

Wheel–rail interaction is one of the most important research topics in railway engineering. It involves track impact response, track vibration and track safety. Track structure failures caused by wheel–rail impact forces can lead to significant economic loss for track owners through damage to rails and to the sleepers beneath. Wheel–rail impact forces occur because of imperfections in the wheels or rails such as wheel flats, irregular wheel profiles, rail corrugations and differences in the heights of rails connected at a welded joint. A wheel flat can cause a large dynamic impact force as well as a forced vibration with a high frequency, which can cause damage to the track structure. In the present work, a three-dimensional (3-D) finite element (FE) model for the impact analysis induced by the wheel flat is developed by use of the finite element analysis (FEA) software package ANSYS and validated by another validated simulation. The effect of wheel flats on impact forces is thoroughly investigated. It is found that the presence of a wheel flat will significantly increase the dynamic impact force on both rail and sleeper. The impact force will monotonically increase with the size of wheel flats. The relationships between the impact force and the wheel flat size are explored from this finite element analysis and they are important for track engineers to improve their understanding of the design and maintenance of the track system.

Combinatorial design of key distribution mechanisms for wireless sensor networks

Secure communications in wireless sensor networks operating under adversarial conditions require providing pairwise (symmetric) keys to sensor nodes. In large scale deployment scenarios, there is no prior knowledge of post deployment network configuration since nodes may be randomly scattered over a hostile territory. Thus, shared keys must be distributed before deployment to provide each node a key-chain. For large sensor networks it is infeasible to store a unique key for all other nodes in the key-chain of a sensor node. Consequently, for secure communication either two nodes have a key in common in their key-chains and they have a wireless link between them, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path have a key in common. Length of the key-path is the key factor for efficiency of the design. This paper presents novel deterministic and hybrid approaches based on Combinatorial Design for deciding how many and which keys to assign to each key-chain before the sensor network deployment. In particular, Balanced Incomplete Block Designs (BIBD) and Generalized Quadrangles (GQ) are mapped to obtain efficient key distribution schemes. Performance and security properties of the proposed schemes are studied both analytically and computationally. Comparison to related work shows that the combinatorial approach produces better connectivity with smaller key-chain sizes.

International entrepreneurship for SME business growth : a resource and dynamic capability view of the firm : an internet context

This research explores the relationship between international business Internet capabilities and international entrepreneurial characteristics. It has been suggested, that the accumulation of a firms Internet capability can assist international operations, especially when operating in fast changing dynamic environments. However, the international entrepreneurial characteristics which are seen as a precursor to leveraging such capabilities are still vague. Given this finding a conceptual framework is constructed and research issues are then developed in order to focus attention on the relationship between the Internet and a firm’s resource base, dynamic capabilities and international market performance.

A dynamic mapping of the UK's creative industries

This paper argues that, despite its strengths, the UK Department of Culture, Media and Sport (DCMS) classification of the creative industries contains inconsistencies which need to be addressed to make it fully fit for purpose. It presents an improved methodology which retains the strengths of the DCMS's approach while addressing its deficiencies. We focus on creative intensity: the proportion of total employment within an industry that is engaged in creative occupations.

A reliable real-time transport protocol for control systems over wireless networks

Deploying networked control systems (NCSs) over wireless networks is becoming more and more popular. However, the widely-used transport layer protocols, Transmission Control Protocol (TCP) and User Datagram Protocol (UDP), are not designed for real-time applications. Therefore, they may not be suitable for many NCS application scenarios because of their limitations on reliability and/or delay performance, which real-control systems concern. Considering a typical type of NCSs with periodic and sporadic real-time traffic, this paper proposes a highly reliable transport layer protocol featuring a packet loss-sensitive retransmission mechanism and a prioritized transmission mechanism. The packet loss-sensitive retransmission mechanism is designed to improve the reliability of all traffic flows. And the prioritized transmission mechanism offers differentiated services for periodic and sporadic flows. Simulation results show that the proposed protocol has better reliability than UDP and improved delay performance than TCP over wireless networks, particularly when channel errors and congestions occur.

Key Management in Wireless Sensor Networks

This chapter presents a comparative survey of recent key management (key distribution, discovery, establishment and update) solutions for wireless sensor networks. We consider both distributed and hierarchical sensor network architectures where unicast, multicast and broadcast types of communication take place. Probabilistic, deterministic and hybrid key management solutions are presented, and we determine a set of metrics to quantify their security properties and resource usage such as processing, storage and communication overheads. We provide a taxonomy of solutions, and identify trade-offs in these schemes to conclude that there is no one-size-fits-all solution.

Grouping people in social networks using a weighted multi-constraints clustering method

Grouping users in social networks is an important process that improves matching and recommendation activities in social networks. The data mining methods of clustering can be used in grouping the users in social networks. However, the existing general purpose clustering algorithms perform poorly on the social network data due to the special nature of users' data in social networks. One main reason is the constraints that need to be considered in grouping users in social networks. Another reason is the need of capturing large amount of information about users which imposes computational complexity to an algorithm. In this paper, we propose a scalable and effective constraint-based clustering algorithm based on a global similarity measure that takes into consideration the users' constraints and their importance in social networks. Each constraint's importance is calculated based on the occurrence of this constraint in the dataset. Performance of the algorithm is demonstrated on a dataset obtained from an online dating website using internal and external evaluation measures. Results show that the proposed algorithm is able to increases the accuracy of matching users in social networks by 10% in comparison to other algorithms.

Combinatorial design of key distribution mechanisms for wireless sensor networks

Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pairwise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighboring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools.

Dynamic lifecycle strategies for target date retirement funds

Target date retirement funds have gained favor with retirement plan investors in recent years. Typically, these funds initially have a high allocation to stocks but move towards less volatile assets, such as bonds and cash, as the target retirement date approaches. Empirical research has generally found that a switch to low-risk assets prior to retirement can reduce the risk of confronting the most extreme negative outcomes. This article questions the rationale for lifecycle switching based solely on age or target retirement date as is the prevalent practice among target date funds. The authors argue that a dynamic switching strategy, which takes into consideration achieved investment returns, will produce superior returns for most investors compared to conventional lifecycle switching. In this article, the authors put forward a dynamic lifecycle switching strategy that is conditional on the attainment of the plan member's wealth accumulation objective at every stage of switching.

Analysis of multilateral service conversations in global business networks

The rapid growth of services available on the Internet and exploited through ever globalizing business networks poses new challenges for service interoperability. New services, from consumer “apps”, enterprise suites, platform and infrastructure resources, are vying for demand with quickly evolving and overlapping capabilities, and shorter cycles of extending service access from user interfaces to software interfaces. Services, drawn from a wider global setting, are subject to greater change and heterogeneity, demanding new requirements for structural and behavioral interface adaptation. In this paper, we analyze service interoperability scenarios in global business networks, and propose new patterns for service interactions, above those proposed over the last 10 years through the development of Web service standards and process choreography languages. By contrast, we reduce assumptions of design-time knowledge required to adapt services, giving way to run-time mismatch resolutions, extend the focus from bilateral to multilateral messaging interactions, and propose declarative ways in which services and interactions take part in long-running conversations via the explicit use of state.

Expander graph based key distribution mechanisms in wireless sensor networks

Secure communications between large number of sensor nodes that are randomly scattered over a hostile territory, necessitate efficient key distribution schemes. However, due to limited resources at sensor nodes such schemes cannot be based on post deployment computations. Instead, pairwise (symmetric) keys are required to be pre-distributed by assigning a list of keys, (a.k.a. key-chain), to each sensor node. If a pair of nodes does not have a common key after deployment then they must find a key-path with secured links. The objective is to minimize the keychain size while (i) maximizing pairwise key sharing probability and resilience, and (ii) minimizing average key-path length. This paper presents a deterministic key distribution scheme based on Expander Graphs. It shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expander Graph to the desired properties of a key distribution scheme for a physical network topology.

STALKERBOT : learning to navigate dynamic human environments by following people

Service robots that operate in human environments will accomplish tasks most efficiently and least disruptively if they have the capability to mimic and understand the motion patterns of the people in their workspace. This work demonstrates how a robot can create a humancentric navigational map online, and that this map re ects changes in the environment that trigger altered motion patterns of people. An RGBD sensor mounted on the robot is used to detect and track people moving through the environment. The trajectories are clustered online and organised into a tree-like probabilistic data structure which can be used to detect anomalous trajectories. A costmap is reverse engineered from the clustered trajectories that can then inform the robot's onboard planning process. Results show that the resultant paths taken by the robot mimic expected human behaviour and can allow the robot to respond to altered human motion behaviours in the environment.

Animating and sustaining niche social networks

Within the communicative space online Social Network Sites (SNS) afford, Niche Social Networks Sites (NSNS) have emerged around particular geographic, demographic or topic-based communities to provide what broader SNS do not: specified and targeted content for an engaged and interested community. Drawing on a research project developed at the Queensland University of Technology in conjunction with the Australian Smart Services Cooperative Research Centre that produced an NSNS based around Adventure Travel, this paper outlines the main drivers for community creation and sustainability within NSNS. The paper asks what factors motivate users to join and stay with these sites and what, if any, common patterns can be noted in their formation. It also outlines the main barriers to online participation and content creation in NSNS, and the similarities and differences in SNS and NSNS business models. Having built a community of 100 registered members, the staywild.com.au project was a living laboratory, enabling us to document the steps taken in producing a NSNS and cultivating and retaining active contributors. The paper incorporates observational analysis of user-generated content (UGC) and user profile submissions, statistical analysis of site usage, and findings from a survey of our membership pool in noting areas of success and of failure. In drawing on our project in this way we provide a template for future iterations of NSNS initiation and development across various other social settings: not only niche communities, but also the media and advertising with which they engage and interact. Positioned within the context of online user participation and UGC research, our paper concludes with a discussion of the ways in which the tools afforded by NSNS extend earlier understandings of online ‘communities of interest’. It also outlines the relevance of our research to larger questions about the diversity of the social media ecology.