A stochastic time-domain model for burst data aggregation in IEEE 802.15.4 wireless sensor networks

In many network applications, the nature of traffic is of burst type. Often, the transient response of network to such traffics is the result of a series of interdependant events whose occurrence prediction is not a trivial task. The previous efforts in IEEE 802.15.4 networks often followed top-down approaches to model those sequences of events, i.e., through making top-view models of the whole network, they tried to track the transient response of network to burst packet arrivals. The problem with such approaches was that they were unable to give station-level views of network response and were usually complex. In this paper, we propose a non-stationary analytical model for the IEEE 802.15.4 slotted CSMA/CA medium access control (MAC) protocol under burst traffic arrival assumption and without the optional acknowledgements. We develop a station-level stochastic time-domain method from which the network-level metrics are extracted. Our bottom-up approach makes finding station-level details such as delay, collision and failure distributions possible. Moreover, network-level metrics like the average packet loss or transmission success rate can be extracted from the model. Compared to the previous models, our model is proven to be of lower memory and computational complexity order and also supports contention window sizes of greater than one. We have carried out extensive and comparative simulations to show the high accuracy of our model.

Incorporating differences in marginal utilities of time across activities in a time allocation model

Most existing activity time allocation models assume that individuals allocate their time to different activities over a period in such a way that the marginal utilities of time across activities are equal. Their argument is that, if not equal, an individual is free to allocate more time to those activities whose marginal utilities of time are higher and, finally allocates the optimal time to each activity with equal marginal utility. However, such an ideal situation may not always prevail in reality, especially when an individual is under income constraint and/or under intense time pressure. In order to incorporate such differences in marginal utilities of time across activities, we enrich the traditional activity time allocation model by explicitly including income constraint and by adding marginal extension activity choice model. As an application, the developed integrated model is used to estimate the value of activity time during weekends in Tokyo. The results are encouraging in that they forecast the individual time allocation more accurately and estimate realistically the value of activity time for each activity in a set of different activities than do by existing traditional models.

A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling

Scientific workflow offers a framework for cooperation between remote and shared resources on a grid computing environment (GCE) for scientific discovery. One major function of scientific workflow is to schedule a collection of computational subtasks in well-defined orders for efficient outputs by estimating task duration at runtime. In this paper, we propose a novel time computation model based on algorithm complexity (termed as TCMAC model) for high-level data intensive scientific workflow design. The proposed model schedules the subtasks based on their durations and the complexities of participant algorithms. Characterized by utilization of task duration computation function for time efficiency, the TCMAC model has three features for a full-aspect scientific workflow including both dataflow and control-flow: (1) provides flexible and reusable task duration functions in GCE;(2) facilitates better parallelism in iteration structures for providing more precise task durations;and (3) accommodates dynamic task durations for rescheduling in selective structures of control flow. We will also present theories and examples in scientific workflows to show the efficiency of the TCMAC model, especially for control-flow. Copyright©2009 John Wiley & Sons, Ltd.

Using information flow model to specify the Kanban-controlled shopfloor control system

The implementation of Kanban-based production control systems may be difficult in make-to-order environments such as job shops. The flexible manufacturing approach constitutes a promising solution to adapt the Kanban method to such environments. This paper presents an information flow modelling approach for specifying the operational planning and control functions of the Kanban-controlled shopfloor control system (KSCS) in a flexible manufacturing environment. By decomposing the KSCS control functionalities, we have created the system information flow model through the data flow diagrams of Structured Systems Analysis Methodology. The data flow diagrams serve effective system specifications for communicating the system operations to participants of different disciplines as well as the system model for the design and development of KSCS.

New cutting-planes for the time-and/or precedence-constrained ATSP and directed VRP

In this paper, we introduce five classes of new valid cutting planes for the precedence-constrained (PC) and/or time-window-constrained (TW) Asymmetric Travelling Salesman Problems (ATSPs) and directed Vehicle Routing Problems (VRPs). We show that all five classes of new inequalities are facet-defining for the directed VRP-TW, under reasonable conditions and the assumption that vehicles are identical. Similar proofs can be developed for the VRP-PC. As ATSP-TW and PC-ATSP can be formulated as directed identical-vehicle VRP-TW and PC-VRP, respectively, this provides a link to study the polyhedral combinatorics for the ATSP-TW and PC-ATSP. The first four classes of these new cutting planes are cycle-breaking inequalities that are lifted from the well-known D^-_k and D⁺_k inequalities (see Grötschel and Padberg in Polyhedral theory. The traveling salesman problem: a guided tour of combinatorial optimization, Wiley, New York, 1985). The last class of new cutting planes, the TW ₂ inequalities, are infeasible-path elimination inequalities. Separation of these constraints will also be discussed. We also present prelimanry numerical results to demonstrate the strengh of these new cutting planes.

Incremental and adaptive clustering stream data over sliding window

Cluster analysis has played a key role in data stream understanding. The problem is difficult when the clustering task is considered in a sliding window model in which the requirement of outdated data elimination must be dealt with properly. We propose SWEM algorithm that is designed based on the Expectation Maximization technique to address these challenges. Equipped in SWEM is the capability to compute clusters incrementally using a small number of statistics summarized over the stream and the capability to adapt to the stream distribution’s changes. The feasibility of SWEM has been verified via a number of experiments and we show that it is superior than Clustream algorithm, for both synthetic and real datasets.

Effects of subjective evaluation for weekday time use onto time allocation and value of activity time on weekends

This study has formulated a behavioral model of individual activity time allocation on weekends, and has extended it to incorporate the latent determinants of time use decisions during weekdays by using a latent variable model. The ultimate goals in developing this model are to improve the individual weekend activity time allocation model by introducing latent variables, and to estimate the value of activity time of different activity types. We conducted a pilot empirical investigation using a small data set regarding time use and expenditure both for weekdays and weekends, and a few indicators of the latent variables collected from individuals in Yokohama, Japan. The empirical findings suggest that the proposed model is valuable not only for modeling activity time allocation, but also in calculating the value of activity time.

Understanding the link between body dissatisfaction and binge eating: a model comparison approach

 This thesis explored the association between body dissatisfaction and binge eating by comparing three competing theoretical frameworks. Study I utilised a cross-sectional design and collectively these findings suggest the superiority of the dual pathway model (dietary restraint and negative affect) over the objectification theory and the escape model. The purpose of Study II was then to extend on the findings from Study I by further examining in real-time the model/theory that most strongly explained the body dissatisfaction-binge eating relationship. Participants were prompted at random intervals seven times daily across the course of a week to self-report their state body dissatisfaction, current mood experiences, and eating practices. Results revealed that negative mood, but not dietary restraint, significantly mediated the state body dissatisfaction-binge eating relationship. These results highlight that the dual pathway model is robust, but raise the possibility that the dietary restraint path in the model is not well operationalized. In light of the non-significant mediating effect of dietary restraint, this led the researcher to identify various modeling alternatives to further understand the mediating influences of the pathways of negative affect and dietary restraint.

A predictive framework for modeling healthcare data with evolving clinical interventions

Medical interventions critically determine clinical outcomes. But prediction models either ignore interventions or dilute impact by building a single prediction rule by amalgamating interventions with other features. One rule across all interventions may not capture differential effects. Also, interventions change with time as innovations are made, requiring prediction models to evolve over time. To address these gaps, we propose a prediction framework that explicitly models interventions by extracting a set of latent intervention groups through a Hierarchical Dirichlet Process (HDP) mixture. Data are split in temporal windows and for each window, a separate distribution over the intervention groups is learnt. This ensures that the model evolves with changing interventions. The outcome is modeled as conditional, on both the latent grouping and the patients' condition, through a Bayesian logistic regression. Learning distributions for each time-window result in an over-complex model when interventions do not change in every time-window. We show that by replacing HDP with a dynamic HDP prior, a more compact set of distributions can be learnt. Experiments performed on two hospital datasets demonstrate the superiority of our framework over many existing clinical and traditional prediction frameworks.

Energy consumption prediction based on time-series models for CPU-intensive activities in the cloud

Due to the increasing energy consumption in cloud data centers, energy saving has become a vital objective in designing the underlying cloud infrastructures. A precise energy consumption model is the foundation of many energy-saving strategies. This paper focuses on exploring the energy consumption of virtual machines running various CPU-intensive activities in the cloud server using two types of models: traditional time-series models, such as ARMA and ES, and time-series segmentation models, such as sliding windows model and bottom-up model. We have built a cloud environment using OpenStack, and conducted extensive experiments to analyze and compare the prediction accuracy of these strategies. The results indicate that the performance of ES model is better than the ARMA model in predicting the energy consumption of known activities. When predicting the energy consumption of unknown activities, sliding windows segmentation model and bottom-up segmentation model can all have satisfactory performance but the former is slightly better than the later.

An EM-based algorithm for clustering data streams in sliding windows

Cluster analysis has played a key role in data understanding. When such an important data mining task is extended to the context of data streams, it becomes more challenging since the data arrive at a mining system in one-pass manner. The problem is even more difficult when the clustering task is considered in a sliding window model which requiring the elimination of outdated data must be dealt with properly. We propose SWEM algorithm that exploits the Expectation Maximization technique to address these challenges. SWEM is not only able to process the stream in an incremental manner, but also capable to adapt to changes happened in the underlying stream distribution.