More than just a transaction: conceptualising industry-based networks for virtual trading communities

This paper addresses the questions of why failure in industry-based networks has been so persistent and whether it is possible to avoid failure and achieve success in internet based markets [iMarketplaces]. A better explanation of implementation failures is important for both improved empirical outcomes and theory building. We construct a theoretical framework based on Bijker’s technology frame (1995) and a contextualization typology developed by Nowotny, Scott and Gibbons (2001). The framework helps us understand how industry-based networks function, why they fail and how we can apply the framework to assist better empirical outcomes. In this paper we apply our framework to Food Connect Australia, a vertically integrated marketplace, representative of the first wave of B2B markets. Sponsors of these iMarketplaces were quick to see and exploit the opportunities online access offered to bring together large numbers of buyers and sellers in new ways. However a lack of understanding of firstly, what represented true value in these networks and secondly, how to achieve buy-in at sustainable levels, meant that many of these first wave sites failed. Application of our framework reveals why there has been a radical shift from the trading role originally envisioned for these sites to the information hub model of the iMarketplace that industry is now being urged to adopt (Berryman and Heck, 2001).

Time cumulative complexity modeling and analysis for space-based networks

In this paper, the notion of the cumulative time varying graph (C-TVG) is proposed to model the high dynamics and relationships between ordered static graph sequences for space-based information networks (SBINs). In order to improve the performance of management and control of the SBIN, the complexity and social properties of the SBIN's high dynamic topology during a period of time is investigated based on the proposed C-TVG. Moreover, a cumulative topology generation algorithm is designed to establish the topology evolution of the SBIN, which supports the C-TVG based complexity analysis and reduces network congestions and collisions resulting from traditional link establishment mechanisms between satellites. Simulations test the social properties of the SBIN cumulative topology generated through the proposed C-TVG algorithm. Results indicate that through the C-TVG based analysis, more complexity properties of the SBIN can be revealed than the topology analysis without time cumulation. In addition, the application of attack on the SBIN is simulated, and results indicate the validity and effectiveness of the proposed C-TVG and C-TVG based complexity analysis for the SBIN.

Exponential stability for markovian jumping stochastic BAM neural networks with mode-dependent probabilistic time-varying delays and impulse control

Abstract
In this article, an exponential stability analysis of Markovian jumping stochastic bidirectional associative memory (BAM) neural networks with mode-dependent probabilistic time-varying delays and impulsive control is investigated. By establishment of a stochastic variable with Bernoulli distribution, the information of probabilistic time-varying delay is considered and transformed into one with deterministic time-varying delay and stochastic parameters. By fully taking the inherent characteristic of such kind of stochastic BAM neural networks into account, a novel Lyapunov-Krasovskii functional is constructed with as many as possible positive definite matrices which depends on the system mode and a triple-integral term is introduced for deriving the delay-dependent stability conditions. Furthermore, mode-dependent mean square exponential stability criteria are derived by constructing a new Lyapunov-Krasovskii functional with modes in the integral terms and using some stochastic analysis techniques. The criteria are formulated in terms of a set of linear matrix inequalities, which can be checked efficiently by use of some standard numerical packages. Finally, numerical examples and its simulations are given to demonstrate the usefulness and effectiveness of the proposed results.

Stability analysis and resource allocation for space-based multi-access systems

In space-based networks, the data relay satellites can assist low-earth-orbit satellites in relaying data to other satellites or the ground station and improve the real time system throughput. To take full advantage of transmission resource of the cooperative relays, this paper proposes a multiple access and resource allocation strategy, in which relays can receive and transmit simultaneously according to channel characteristics of space-based systems. Based on the queueing theoretic formulation, the stability of the proposed protocol is analyzed and the maximum stable throughput region is derived, which would provide the appropriate guidance for the design of the system optimal control. Simulation results exhibit multiple factors that affect the stable throughput and verify the theoretical analysis.

Building virtual learning communities

This chapter introduces the concept of virtual learning communities and discusses and further enhances the theory and definitions presented in related literature. A model comprising four criteria essential to virtual learning communities is presented and discussed in detail. Theory and case studies relating to the impact of virtual learning communities on distance education and students from diverse cultural groups are also examined. In addition, this chapter investigates the enabling technologies and facilitation that is required to build virtual learning communities. Other case studies are used to illustrate the process of building virtual learning communities. Emerging technologies such as wikis and video lectures are also analysed to determine the effects they have on building and sustaining effective virtual learning communities.

Reduction of vividness and associated craving in personalized food imagery

This study aimed to extend recent experimental work on the efficacy of visuo-spatial working memory-based techniques for reducing food cravings by adopting a more naturalistic methodology. Fifty undergraduate women formed images of their favorite foods while performing a visuo-spatial task across six successive trials. Vividness and craving intensity were rated for each food image. Concurrent visuo-spatial processing reduced the vividness of, and craving reactivity to, personally relevant food images. Forehead tracking, a novel self-administered task, proved to be as effective in reducing vividness and craving ratings as the established visuo-spatial working memory laboratory tasks of eye movements, dynamic visual noise, and spatial tapping, and thus presents a simple, accessible technique potentially applicable in the home environment. All four tasks maintained their reducing effect over multiple trials. Individual differences in imaging ability and habitual food craving did not impact upon their effectiveness, indicating that visuo-spatial tasks can be successfully used to reduce food cravings across a range of people.

Mini-micro unmanned aerial vehicle intelligence: a threat to land vehicles

Increasing use of commercial off-the-shelf Mini-Micro Unmanned Aerial Vehicle (MAV) systems with enhanced intelligence methodologies can potentially be a threat, if this technology falls into the wrong hands. In this study, we investigate the level of threat imposed on critical infrastructure using different MAV swarm artificial intelligence traits and coordination methodologies. The critical infrastructure in consideration is a moving commercial land vehicle that may be transporting for example an important civil servant or politician. Non-dimensional fitness functions used for measuring MAV mission effectiveness have been established for the case studies considered in this paper. The findings indicated that increased in intelligent and coordination level elevate teams' efficiency, therefore poses a higher degree of threat to targeted land vehicle. Observations from the study have suggested that memory-based cooperative technique provides a consistent efficiency compared to other methods for the mission objectives considered in this paper. © 2014 The authors and IOS Press. All rights reserved.

Factors affecting perceived level of virtuality in hybrid construction project teams (HCPTs) : a qualitative study

Purpose-Deploying hybrid construction project teams (HCPTs) in which the common pattern of interactions is a blend of face-to-face and virtual communications has been increasingly gaining momentum in the construction context. Evidence has demonstrated that effectiveness of HCPTs is affected by a perceived level of virtuality, i.e. the perception of distance and boundaries between members where teams shift towards working virtually as opposed to purely collocated teams. This study aims to provide an integrated model of the factors affecting perceived virtuality in HCPTs, to address the conspicuous absence of studies on virtuality in the construction context. Design/methodology/approach-An a priori list of factors extracted from existing literature on virtuality was subjected to the scrutiny of 17 experts with experiences of working in HCPTs through semi-structured interviews. Nvivo 10 was deployed for analysing the interview transcripts. Findings-The fndings outline the factors affecting virtuality in HCPTs and map the patterns of their associations as an integrated model. This leads to discovering a number of novel factors, which exert moderating impacts upon perceived virtuality in HCPTs. Practical implications-The fndings assist managers and practitioners dealing with any form of HCPTs (including building information modelling-based networks and distributed design teams) in identifying the variables manipulating the effectiveness of their teams. This enables them of designing more effective team arrangements. Originality/value-As the frst empirical study on virtuality in the construction context, this paper contributes to the sphere by conceptualising and contextualising the concept of virtuality in the construction industry. The study presents a new typology for the factors affecting perceived virtuality by categorising them into predictors and moderators.

Hierarchical directory-based shared memory architecture

We describe the design of a directory-based shared memory architecture on a hierarchical network of hypercubes. The distributed directory scheme comprises two separate hierarchical networks for handling cache requests and transfers. Further, the scheme assumes a single address space and each processing element views the entire network as contiguous memory space. The size of individual directories stored at each node of the network remains constant throughout the network. Although the size of the directory increases with the network size, the architecture is scalable. The results of the analytical studies demonstrate superior performance characteristics of our scheme compared with those of other schemes.

Inter-Frame Change Directing online clustering of multiple moving objects for video-based sensor networks

Recognition of multiple moving objects is a very important task for achieving user-cared knowledge to send to the base station in wireless video-based sensor networks. However, video based sensor nodes, which have constrained resources and produce huge amount of video streams continuously, bring a challenge to segment multiple moving objects from the video stream online. Traditional efficient clustering algorithms such as DBSCAN cannot run time-efficiently and even fail to run on limited memory space on sensor nodes, because the number of pixel points is too huge. This paper provides a novel algorithm named Inter-Frame Change Directing Online clustering (IFCDO clustering) for segmenting multiple moving objects from video stream on sensor nodes. IFCDO clustering only needs to group inter-frame different pixels, thus it reduces both space and time complexity while achieves robust clusters the same as DBSCAN. Experiment results show IFCDO clustering excels DBSCAN in terms of both time and space efficiency. © 2008 IEEE.

Robust extended Kalman filter based technique for location management in PCS networks

Provisioning of real-time multimedia sessions over wireless cellular network poses unique challenges due to frequent handoff and rerouting of a connection. For this reason, the wireless networks with cellular architecture require efficient user mobility estimation and prediction. This paper proposes using Robust Extended Kalman Filter as a location heading altitude estimator of mobile user for next cell prediction in order to improve the connection reliability and bandwidth efficiency of the underlying system. Through analysis we demonstrate that our algorithm reduces the system complexity (compared to existing approach using pattern matching and Kalman filter) as it requires only two base station measurements or only the measurement from the closest base station. Further, the technique is robust against system uncertainties due to inherent deterministic nature in the mobility model. Through simulation, we show the accuracy and simplicity in implementation of our prediction algorithm.

A mesh based anycast routing protocol for ad hoc networks

Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.

Prediction based location aided routing for mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P-LAR) protocol. Simulation study and analytical results of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.