Agility of the firm : customer's perspective

Agility is emerging as an important determinant of success and achieving sustained competitive advantage in hyper-competition. Whilst the digital natives are on the rise, ubiquitous technologies, networks and associated systems are increasingly weaving themselves into the very fabric of everyday life of both individuals and corporations. With a global shift towards “everywhere retailing”, ubiquitous contemporary information systems such as mobile CRM systems (C-CRMS) are evolving. Unlike in traditional CRMS, customers are becoming an important user group in this new paradigm. Draws on agility literature, this study examine how customers’ use of C-CRMS influence firm’s customer sensing capability, firm’s customer responding capability, and how customer-perceived firm’s responsiveness influence customers use of C-CRMS. Following the notions of agility we theorized firm’s customer agility from customers’ standpoint where we use customers’ use of C-CRMS and customer-perceived firm’s responsiveness for sensing and responding components of agility respectively. This research-in-progress paper investigates how C-CRMS facilitates firm’s customer agility, and reports the approach pursued in adopting sense and response measures of customer agility taking the customers perspective derived through extant literature.

An RFID-based traceability system

Traceability system in the food supply chain is becoming more necessary. RFID and EPCglobal Network Standards are emerging technologies that bring new opportunities to develop the high performance traceability system. This research proposes the analysis, design, and development of the RFID and EPCglobal Network Standards based traceability system that adheres to the requirements of global food traceability in terms of completeness of traceability information. The additional components, including lot management system and electronic transaction management system, encourage the traditional system in order to fulfill the missing information. The proposed system was developed and applied in a rice supply chain. Results from experimentation showed that the additional components can significantly improve the completeness of traceability information. The collaboration between EPCglobal Network Standards and electronic transaction management system can improve the performances in RFID operations.

The influence of critical infrastructure interdependencies on post-disaster reconstruction: Elements of infrastructure interdependency that impede the post-disaster recovery effort

The importance of developing effective disaster management strategies has significantly grown as the world continues to be confronted with unprecedented disastrous events. Factors such as climate instability, recent urbanization along with rapid population growth in many cities around the world have unwittingly exacerbated the risks of potential disasters, leaving a large number of people and infrastructure exposed to new forms of threats from natural disasters such as flooding, cyclones, and earthquakes. With disasters on the rise, effective recovery planning of the built environment is becoming imperative as it is not only closely related to the well-being and essential functioning of society, but it also requires significant financial commitment. In the built environment context, post-disaster reconstruction focuses essentially on the repair and reconstruction of physical infrastructures. The reconstruction and rehabilitation efforts are generally performed in the form of collaborative partnerships that involve multiple organisations, enabling the restoration of interdependencies that exist between infrastructure systems such as energy, water (including wastewater), transport, and telecommunication systems. These interdependencies are major determinants of vulnerabilities and risks encountered by critical infrastructures and therefore have significant implications for post-disaster recovery. When disrupted by natural disasters, such interdependencies have the potential to promote the propagation of failures between critical infrastructures at various levels, and thus can have dire consequences on reconstruction activities. This paper outlines the results of a pilot study on how elements of infrastructure interdependencies have the potential to impede the post-disaster recovery effort. Using a set of unstructured interview questionnaires, plausible arguments provided by seven respondents revealed that during post-disaster recovery, critical infrastructures are mutually dependent on each other’s uninterrupted availability, both physically and through a host of information and communication technologies. Major disruption to their physical and cyber interdependencies could lead to cascading failures, which could delay the recovery effort. Thus, the existing interrelationship between critical infrastructures requires that the entire interconnected network be considered when managing reconstruction activities during the post-disaster recovery period.

Greedy Scheduling in Multihop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

Throughput performance of distributed applications in switched networks in presence of end-system bottlenecks

The steady state throughput performance of distributed applications deployed in switched networks in presence of end-system bottlenecks is studied in this paper. The effect of various limitations at an end-system is modelled as an equivalent transmission capacity limitation. A class of distributed applications is characterised by a static traffic distribution matrix that determines the communication between various components of the application. It is found that uniqueness of steady state throughputs depends only on the traffic distribution matrix and that some applications (e.g., broadcast applications) can yield non-unique values for the steady state component throughputs. For a given switch capacity, with traffic distribution that yield fair unique throughputs, the trade-off between the end-system capacity and the number of application components is brought out. With a proposed distributed rate control, it has been illustrated that it is possible to have unique solution for certain traffic distributions which is otherwise impossible. Also, by proper selection of rate control parameters, various throughput performance objectives can be realised.

Infrared broadband emission of bismuth-doped barium-aluminum-borate glasses

We report near infrared broadband emission of bismuth-doped barium-aluminum-borate glasses. The broadband emission covers 1.3 mum window in optical telecommunication systems. And it possesses wide full width at half maximum (FWHM) of similar to 200nm and long lifetime as long as 350 mus. The luminescent properties are quite sensitive to glass compositions and excitation wavelengths. Based on energy matching conditions, we suggest that the infrared emission may be ascribed to P-3(1) --> P-3(0) transition of Bi+. The broad infrared emission characteristics of this material indicate that it might be a promising candidate for broadband optical fiber amplifiers and tunable lasers. (C) 2005 Optical Society of America.

移动复制数据库系统冲突检测及消解策略

复制技术是提高移动数据库系统性能的一项关键技术 .该文提出了一种新的移动复制数据库系统模型——事务级结果集传递 (TL RSP)移动复制模型 ,重点分析了该模型中的冲突检测及消解策略 ,并给出了具体的实现算法 ;TL RSP移动复制模型允许移动用户在系统断连时存取数据库的本地副本并提交事务 ,重新连接时进行冲突的检测及消解 ,同时进行事务结果集的合并 ,最后通过增量刷新的方式进行同步处理 ,使得系统最终收敛于一致性的状态 .此外 ,通过引入简化的事务日志、数据版本号以及权限控制等概念 ,TL RSP模型有效地降低了移动数据库系统的资源消耗 ,保证了数据库的一致性 ,从而为移动数据库系统复制提供了一个可行的解决方案

移动数据库系统乐观事务处理策略

在移动数据库系统中 ,计算平台的移动性、频繁的断接性以及长事务等特性使得传统的事务处理模式不再适用 .为了解决移动数据库中的事务处理问题 ,提出了一种新的移动事务处理模型——乐观两阶段提交移动事务模型 ( O2 PC-MT) .该模型采用乐观并发控制与两阶段提交协议相结合的方法 ,对移动事务的长事务特性提供了灵活与有效的支持 ;此外 ,该模型允许移动计算机分多次发送事务操作 ,且在事务执行的过程中可以任意移动 ,从而提供了对交互式事务及随意移动性的支持 .实验结果表明 ,与基于两段锁协议及其变形的其它移动事务处理模型相比 ,O2 PC-MT提高了系统的事务吞吐率并改善了系统的总体性能

复制的移动数据库系统事务级同步处理策略

同步处理技术是保持复制的移动数据库系统一致性的一项关键技术,但现有的事务级同步处理算法存在着一定的局限性.为了克服这些缺陷,并增强其实用性,提出了一种新的移动数据库同步处理模型──基于双时间印的事务级同步(DTSTLS)模型.DTSTLS模型采用了一种三级复制体系结构,系统可以直接使用通用的数据库产品作为其数据库服务器,因此具有良好的可扩充性.作为一种异步的多主副本复制方法,DTSTLS模型允许移动计算机在断连的情况下存取本地副本,从而造成系统短暂的不一致,重新连接时进行冲突检测及同步处理,使系统重新收敛于一致性的状态.此外,通过一种独特的时间印处理策略,DTSTLS模型减少了通信代价,并降低了资源消耗.实验结果表明,DTSTLS模型提高了移动数据库系统的资源利用效率,保证了事务调度的可串行性和数据库的一致性.

移动机器人人机互助行走监控方法研究及其实际应用

由于行走监控在移动机器人技术中的独特地位和作用，使得其问题解决路线与最终性能极大地影响着构成系统的实用性及用户接受程度．本文通过剖析行走监控同其他模块的内在联系，深入地讨论了研究此问题的必要性和困难所在．最后，结合一个实际应用系统，给出了行之有效的指导思想、实现策略和关键问题解决途径。