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

Refining near-native protein-protein docking decoys by local resampling and energy minimization

How to refine a near-native structure to make it closer to its native conformation is an unsolved problem in protein-structure and protein-protein complex-structure prediction. In this article, we first test several scoring functions for selecting locally resampled near-native protein-protein docking conformations and then propose a computationally efficient protocol for structure refinement via local resampling and energy minimization. The proposed method employs a statistical energy function based on a Distance-scaled Ideal-gas REference state (DFIRE) as an initial filter and an empirical energy function EMPIRE (EMpirical Protein-InteRaction Energy) for optimization and re-ranking. Significant improvement of final top-1 ranked structures over initial near-native structures is observed in the ZDOCK 2.3 decoy set for Benchmark 1.0 (74% whose global rmsd reduced by 0.5 angstrom or more and only 7% increased by 0.5 angstrom or more). Less significant improvement is observed for Benchmark 2.0 (38% versus 33%). Possible reasons are discussed.

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.

A Nondeterministic Minimization Algorithm

The problem of minimizing a multivariate function is recurrent in many disciplines as Physics, Mathematics, Engeneering and, of course, Computer Science. In this paper we describe a simple nondeterministic algorithm which is based on the idea of adaptive noise, and that proved to be particularly effective in the minimization of a class of multivariate, continuous valued, smooth functions, associated with some recent extension of regularization theory by Poggio and Girosi (1990). Results obtained by using this method and a more traditional gradient descent technique are also compared.

Hypothesizing Device Mechanisms: Opening Up the Black Box

I describe an approach to forming hypotheses about hidden mechanism configurations within devices given external observations and a vocabulary of primitive mechanisms. An implemented causal modelling system called JACK constructs explanations for why a second piece of toast comes out lighter, why the slide in a tire gauge does not slip back inside when the gauge is removed from the tire, and how in a refrigerator a single substance can serve as a heat sink for the interior and a heat source for the exterior. I report the number of hypotheses admitted for each device example, and provide empirical results which isolate the pruning power due to different constraint sources.

A Case-Based Approach to Black-Box Control Learning

Garrett S.M. and Lee M.H., A Case-Based Approach to Black-Box Control Learning, Proc. Int. Conf. on Comutational Intelligence for Modelling, Control and Automation (CIMCA`99), 17-19 Feb. 1999. Vienna.

Thinking with and outside the box: developing computer support for evidence teaching

B. Schafer, J. Keppens and Q. Shen. Thinking with and outside the Box: Developing Computer Support for Evidence Teaching. P. Robert and M. Redmayne (Eds.), Innovations in Evidence and Proof: Integrating Theory, Research and Teaching, pp. 139-158, 2007.

Corporate Responsibility for Crimes - Thinking Outside the Box

Emeseh, Engobo, 'Corporate Responsibility for Crime: Thinking outside the Box' I University of Botswana Law Journal (2005) 28-49 RAE2008

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.

Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors

Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance.