A global shallow water model using high order multi-moment constrained finite volume method and icosahedral grid

A novel accurate numerical model for shallow water equations on sphere have been developed by implementing the high order multi-moment constrained finite volume (MCV) method on the icosahedral geodesic grid. High order reconstructions are conducted cell-wisely by making use of the point values as the unknowns distributed within each triangular cell element. The time evolution equations to update the unknowns are derived from a set of constrained conditions for two types of moments, i.e. the point values on the cell boundary edges and the cell-integrated average. The numerical conservation is rigorously guaranteed. in the present model, all unknowns or computational variables are point values and no numerical quadrature is involved, which particularly benefits the computational accuracy and efficiency in handling the spherical geometry, such as coordinate transformation and curved surface. Numerical formulations of third and fourth order accuracy are presented in detail. The proposed numerical model has been validated by widely used benchmark tests and competitive results are obtained. The present numerical framework provides a promising and practical base for further development of atmospheric and oceanic general circulation models. (C) 2009 Elsevier Inc. All rights reserved.

adaptive location update mechanism for network-constrained moving objects in changeful traffic conditions

Natl Chiao Tung Univ, Dept Comp Sci

Confined intra-molecular clustering in orientated polyethylene after annealing

Deuterated polyethylene tracer molecules with small amount of branches (12 C2H5- branches per 1000 backbone carbon atoms) were blended with a hydrogenated polyethylene matrix to form a homogenous mixture. The conformational evolution of the deuterated chains in a stretched semi-cry stall me film was observed via online small angle neutron scattering measurements during annealing at high temperatures close to the melting point. Because the sample was annealed at a temperature closely below its melting point, the crystalline lamellae were only partially molten and the system could not fully relax. The global chain dimensions were preserved during annealing. Recrystallization of released polymeric chain segments allows for local phase separation thus driving the deuterated chain segments into the confining interlamellar amorphous layers giving rise to an interesting intra-molecular clustering effect of the long deuterated chain. This clustering is deduced from characteristic small angle neutron scattering patterns. The confined phase separation has its origin in primarily the small amount of the branches on the deuterated polymers which impede the crystallization of the deuterated chain segments.

Estimation of gas hydrate saturation using constrained sparse spike inversion: Case study from the northern South China Sea

Bottom-simulating reflectors (BSRs) were observed beneath the seafloor in the northern continental margin of the South China Sea (SCS). Acoustic impedance profile was derived by Constrained Sparse Spike Inversion (CSSI) method to provide information on rock properties and to estimate gas hydrate or free gas saturations in the sediments where BSRs are present. In general, gas hydrate-bearing sediments have positive impedance anomalies and free gas-bearing sediments have negative impedance anomalies. Based on well log data and Archie's equation, gas hydrate saturation can be estimated. But in regions where well log data is not available, a quantitative estimate of gas hydrate or free gas saturation is inferred by fitting the theoretical acoustic impedance to sediment impedance obtained by CSSI. Our study suggests that gas hydrate saturation in the Taixinan Basin is about 10 - 20% of the pore space, with the highest value of 50%, and free gas saturation below BSR is about 2 - 3% of the pore space, that can rise to 8 - 10% at a topographic high. The free gas is non-continuous and has low content in the southeastern slope of the Dongsha Islands. Moreover, BSR in the northern continental margin of the SCS is related to the presence of free gas. BSR is strong where free gas occurs.

Prediction of marine sediment corrosion by fuzzy clustering analysis

Along with the development of marine industries, especially marine petroleum exploitation, more and more pipelines are buried in the marine sediment. It is necessary and useful to know the corrosion environment and corrosiveness of marine sediment. In this paper, field corrosion environmental factors were investigated in Liaodong Bay marine sediment containing sulfate-reducing bacteria (SRB) and corrosion rate of steel in the partly sediment specimens were determined by the transplanting burying method. Based on the data, the fuzzy clustering analysis (FCA) was applied to evaluate and predict the corrosiveness of marine sediment. On that basis, the influence factors of corrosion damage were discussed.

Hierarchical Multi-classification with Predictive Clustering Trees in Functional Genomics

Struyf, J., Dzeroski, S. Blockeel, H. and Clare, A. (2005) Hierarchical Multi-classification with Predictive Clustering Trees in Functional Genomics. In proceedings of the EPIA 2005 CMB Workshop

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies

Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, this paper investigates the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 67%, compared to approaches that do not consider physical link costs. We are in the process of developing a method for adaptive node placement in the overlay topology, based upon the locations of publishers, subscribers, physical link costs and per-subscriber QoS constraints. One such method for repositioning nodes in logical space is discussed, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers. Future work will evaluate the benefits of such techniques more thoroughly.

A Virtual Deadline Scheduler for Window-Constrained Service Guarantees

This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), that attempts to guarantee no more than x out of y deadlines are missed for real-time jobs such as periodic CPU tasks, or delay-constrained packet streams. While DWCS is capable of generating a feasible window-constrained schedule that utilizes 100% of resources, it requires all jobs to have the same request periods (or intervals between successive service requests). We describe a new algorithm called Virtual Deadline Scheduling (VDS), that provides window-constrained service guarantees to jobs with potentially different request periods, while still maximizing resource utilization. VDS attempts to service m out of k job instances by their virtual deadlines, that may be some finite time after the corresponding real-time deadlines. Notwithstanding, VDS is capable of outperforming DWCS and similar algorithms, when servicing jobs with potentially different request periods. Additionally, VDS is able to limit the extent to which a fraction of all job instances are serviced late. Results from simulations show that VDS can provide better window-constrained service guarantees than other related algorithms, while still having as good or better delay bounds for all scheduled jobs. Finally, an implementation of VDS in the Linux kernel compares favorably against DWCS for a range of scheduling loads.

Extraction and Clustering of Motion Trajectories in Video

A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clusters of similar trajectories in the video dataset. Objects' motion trajectories are extracted via an EKF formulation that provides each object's 3D trajectory up to a constant factor. To increase accuracy when occlusions occur, multiple tracking hypotheses are followed. For trajectory-based clustering and retrieval, a modified version of edit distance, called longest common subsequence (LCSS) is employed. Similarities are computed between projections of trajectories on coordinate axes. Trajectories are grouped based, using an agglomerative clustering algorithm. To check the validity of the approach, experiments using real data were performed.