Media-independent knowledge representation via UMART : unified mental annotation and retrieval tool

Multimedia information is now routinely available in the forms of text, pictures, animation and sound. Although text objects are relatively easy to deal with (in terms of information search and retrieval), other information bearing objects (such as sound, images, animation) are more difficult to index. Our research is aimed at developing better ways of representing multimedia objects by using a conceptual representation based on Schank's conceptual dependencies. Moreover, the representation allows for users' individual interpretations to be embedded in the system. This will alleviate the problems associated with traditional semantic networks by allowing for coexistence of multiple views of the same information. The viability of the approach is tested, and the preliminary results reported.

A two stage vector quantization approach via self-organizing map

In this paper, a two-stage algorithm for vector quantization is proposed based on a self-organizing map (SOM) neural network. First, a conventional self-organizing map is modified to deal with dead codebooks in the learning process and is then used to obtain the codebook distribution structure for a given set of input data. Next, subblocks are classified based on the previous structure distribution with a prior criteria. Then, the conventional LBG algorithm is applied to these sub-blocks for data classification with initial values obtained via the SOM. Finally, extensive simulations illustrate that the proposed two-stage algorithm is very effective.

Network and traffic engineering in emerging distributed computing applications

This book focuses on network management and traffic engineering for Internet and distributed computing technologies, as well as present emerging technology trends and advanced platform

Dematerialised data and human desire : the Internet and copy culture

Since Licklider in the 1960s [27] influential proponents of networked computing have envisioned electronic information in terms of a relatively small (even singular) number of 'sources', distributed through technologies such as the Internet. Most recently, Levy writes, in Becoming Virtual, that "in cyberspace, since any point is directly accessible from any other point, there is an increasing tendency to replace copies of documents with hypertext links. Ultimately, there will only need to be a single physical exemplar of the text" [13 p.61]. Hypertext implies, in theory, the end of 'the copy', and the multiplication of access points to the original. But, in practice, the Internet abounds with copying, both large and small scale, both as conscious human practice, and also as autonomous computer function. Effective and cheap data storage that encourages computer users to keep anything of use they have downloaded, lest the links they have found, 'break'; while browsers don't 'browse' the Internet - they download copies of everything to client machines. Not surprisingly, there is significant regulation against 'copying' - regulation that constrains our understanding of 'copying' to maintain a legal fiction of the 'original' for the purposes of intellectual property protection. In this paper, I will firstly demonstrate, by a series of examples, how 'copying' is more than just copyright infringement of music and software, but is a defining, multi-faceted feature of Internet behaviour. I will then argue that the Internet produces an interaction between dematerialised, digital data and human subjectivity and desire that fundamentally challenges notions of originality and copy. Walter Benjamin noted about photography: "one can make any number of prints [from a negative]; to ask for the 'authentic' print makes no sense" [4 p.224]. In cyberspace, I conclude, it makes no sense to ask which one is the copy.

Australia-Indonesia cooperation on asylum-seekers: a case of 'incentivised policy transfer'

Australia and Indonesia have engaged in cooperation on asylum policy since the late 1990s, bilaterally on immigration detention and people-smuggling agreements, and multilaterally through the Bali Process. Seen from a global perspective, this form of cooperation is one of many such bilateral and multilateral agreements that stymie the ability of asylum-seekers to gain effective and durable protection. This article argues that policy transfer theory can explain how these agreements are achieved, their political implications, and their outcome for the refugee regime and the asylum-seekers reliant on the regime for protection. In the case study of Australia and Indonesia, the authors argue that the cooperation is best understood as a form of ‘incentivised policy transfer’, whereby Australia has provided substantial financial and diplomatic incentives to Indonesia to adopt policies consistent with Australia's own. The implications for asylum-seekers in the Asia-Pacific region are substantial, and include an increase in the use of immigration detention in Indonesia and the introduction of border security measures that restrict the ability of asylum-seekers to reach territory where they may claim protection under the Convention Relating to the Status of Refugees.

VGraph: graph virtualization towards big data

Virtualization brought an immense commute in the modern technology especially in computer networks since last decade. The enormity of big data has led the massive graphs to be increased in size exponentially in recent years so that normal tools and algorithms are going weak to process it. Size diminution of the massive graphs is a big challenge in the current era and extraction of useful information from huge graphs is also problematic. In this paper, we presented a concept to design the virtual graph vGraph in the virtual plane above the original plane having original massive graph and proposed a novel cumulative similarity measure for vGraph. The use of vGraph is utile in lieu of massive graph in terms of space and time. Our proposed algorithm has two main parts. In the first part, virtual nodes are designed from the original nodes based on the calculation of cumulative similarity among them. In the second part, virtual edges are designed to link the virtual nodes based on the calculation of similarity measure among the original edges of the original massive graph. The algorithm is tested on synthetic and real-world datasets which shows the efficiency of our proposed algorithms.

Assuring virtual network reliability and resilience

A framework developed that uses reliability block diagrams and continuous-time Markov chains to model and analyse the reliability and availability of a Virtual Network Environment (VNE). In addition, to minimize the unpredicted failures and reduce the impact of failure on a virtual network, a dynamic solution proposed for detecting a failure before it occurs in the VNE. Moreover, to predict failure and establish a tolerable maintenance plan before failure occurs in the VNE, a failure prediction method for VNE can be used to minimise the unpredicted failures, reduce backup redundancy and maximise system performance.

Self adjusted security architecture for mobile ad hoc networks (MANETs)

In this work we present a novel security architecture for MANETs that merges the clustering and the threshold key management techniques. The proposed distributed authentication architecture reacts with the frequently changing topology of the network and enhances the process of assigning the node's public key. In the proposed architecture, the overall network is divided into clusters where the clusterheads (CH) are connected by virtual networks and share the private key of the Central Authority (CA) using Lagrange interpolation. Experimental results show that the proposed architecture reaches to almost 95.5% of all nodes within an ad-hoc network that are able to communicate securely, 9 times faster than other architectures, to attain the same results. Moreover, the solution is fully decentralized to operate in a large-scale mobile network.

Security authentication for on-line internet banking

The advent of Internet Banking has shown the importance of effective method of authenticating a users in a remote environment. There are many different countenances to contemplate when examining Internet based security. One of the most tried and trusted techniques of protecting the safety of systems and data is to control people's access. The foundation for such measures is authentication. Specifically for Internet banking there is a real need for a way to uniquely identify and authenticate users without the possibility of their authenticity being cloned. This paper proposes a framework concerning how to identify security requirements for Internet Banking.

Classifying DDoS packets in high-speed networks

Recently high-speed networks have been utilized by attackers as Distributed Denial of Service (DDoS) attack infrastructure. Services on high-speed networks also have been attacked by successive waves of the DDoS attacks. How to sensitively and accurately detect the attack traffic, and quickly filter out the attack packets are still the major challenges in DDoS defense. Unfortunately most current defense approaches can not efficiently fulfill these tasks. Our approach is to find the network anomalies by using neural network and classify DDoS packets by a Bloom filter-based classifier (BFC). BFC is a set of spaceefficient data structures and algorithms for packet classification. The evaluation results show that the simple complexity, high classification speed and accuracy and low storage requirements of this classifier make it not only suitable for DDoS filtering in high-speed networks, but also suitable for other applications such as string matching for intrusion detection systems and IP lookup for programmable routers.

Responding to terrorism through networks at sites of critical infrastructure : a case study of Australian airport security networks

The importance of effective multilateral security networks is widely recognised in Australia and internationally as being essential to facilitate the large-scale sharing of information required to respond to the threat of terrorism. Australian national security agencies are currently constructing networks in order to bring the diverse national and international security agencies together to achieve this. This paper examines this process of security network formation in the area of critical infrastructure protection, with particular emphasis on airport security. We address the key issues and factors shaping network formation and the dynamics involved in network practice. These include the need for the networks to extend membership beyond the strictly defined elements of national security; the integration of public and private ‘nodes’ in counter-terrorism ‘networks’; and the broader ‘responsibilisation’ of the private sector and the challenges with ‘enabling’ them in counter-terrorism networks. We argue that the need to integrate public and private agencies in counter-terrorism networks is necessary but faces considerable organisational, cultural, and legal barriers.

Input and output analysis of complex conveyor networks

Material transfer networks are at the heart of critical infrastructure in many modern service and manufacturing industries. This research identified key performance measures, while deriving generalised analysis methodologies, for simulation models. The technology was validated for international airports, and used to determine operational capacity constraints under varied demand conditions.

Lightweight authentication for recovery in wireless sensor networks

Wireless sensor networks (WSNs) suffer from a wide range of security attacks due to their limited processing and energy capabilities. Their use in numerous mission critical applications, however, requires that fast recovery from such attacks be achieved. Much research has been completed on detection of security attacks, while very little attention has been paid to recovery from an attack. In this paper, we propose a novel, lightweight authentication protocol that can secure network and node recovery operations such as re-clustering and reprogramming. Our protocol is based on hash functions and we compare the performance of two well-known lightweight hash functions, SHA-1 and Rabin. We demonstrate that our authentication protocol can be implemented efficiently on a sensor network test-bed with TelosB motes. Further, our experimental results show that our protocol is efficient both in terms of computational overhead and execution times which makes it suitable for low resourced sensor devices.