Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

Computing systems are increasingly distributed, real-time, and embedded (DRE) and must operate under highly unpredictable and changeable conditions. To provide predictable mission-critical quality of service (QoS) end-to-end, QoS-enabled middleware services and mechanisms have begun to emerge. However, the current generation of commercial-off-the-shelf middleware lacks adequate support for appl...

Data envelopment analysis (DEA) measures the relative efficiency of decision making units (DMUs) with multiple inputs and multiple outputs. DEA-based Malmquist productivity index measures the productivity change over time. We propose a dynamic DEA model involving network structure in each period within the framework a DEA. We have previously published the network DEA (NDEA) and the dynamic DEA ...

Applications such as multimedia streaming for mobile users, or video conferencing, require support within the network for transcoding, compression etc. Proxylets running on servers within the network may be used to transform the media flows in order to meet application or QoS requirements. In this paper we examine the feasibility of performing constraint based configuration of the required prox...

Typical applications of the mobile ad-hoc network, MANET, are in disaster recovery operations which have to respect time constraint needs. Since MANET is affected by limited resources such as power constraints, it is a challenge to respect the deadline of a real-time data. This paper proposes the Energy and Delay aware based on Dynamic Source Routing protocol, ED-DSR. ED-DSR efficiently utilize...

We present a first simplified version of the MultiObjective Dynamic Routing (MODR) method, more suitable for a realistic network environment as the computational effort is very much reduced while good results can still be reached. The simplified version presented herein is based on the results obtained from a discrete event simulation study which shows that, in case of overload, more important ...

Theories of visual form have been plagued with the problem of the correspondence between aspects of the form across time and across spatial location. Following Bateson's idea that knowledge emerges from the relations among multiple flows of difference, our computational model illustrates how visual form can emerge from the phase relations between two such flows in a way that eliminates the corr...

Real-time optimization of the dynamic flow of vehicle traffic through a network of signalized intersections is an important practical problem. In this paper, we take a decentralized, schedule-driven coordination approach to address the challenge of achieving scalable network-wide optimization. To be locally effective, each intersection is controlled independently by an on-line scheduling agent....

In this paper, a dynamic and stochastic notion of public transport network vulnerability is develoepd. While previous studies have considered only the network topology, the non-continuous availability of services requires a more refined model for supply and demand interactions in order to evaluate the impacts of disruptions. We extend the measures of betweenness centrality (often used to identi...

We consider a model of random access (slotted-aloha-type) communication networks of general topology. Assuming that network links receive exogenous arrivals of packets for transmission, we seek dynamic distributed random access strategies whose goal is to keep all network queues stable. We prove that two dynamic strategies, which we collectively call queue length based random access (QRA), ensu...