Automatic metro map layout using multicriteria optimization

This paper describes an automatic mechanism for drawing metro maps. We apply multicriteria optimization to find effective placement of stations with a good line layout and to label the map unambiguously. A number of metrics are defined, which are used in a weighted sum to find a fitness value for a layout of the map. A hill climbing optimizer is used to reduce the fitness value, and find improved map layouts. To avoid local minima, we apply clustering techniques to the map-the hill climber moves both stations and clusters when finding improved layouts. We show the method applied to a number of metro maps, and describe an empirical study that provides some quantitative evidence that automatically-drawn metro maps can help users to find routes more efficiently than either published maps or undistorted maps. Moreover, we have found that, in these cases, study subjects indicate a preference for automatically-drawn maps over the alternatives.     

Evaluation of trend localization with multi-variate visualizations

Multi-valued data sets are increasingly common, with the number of dimensions growing. A number of multi-variate visualization techniques have been presented to display such data. However, evaluating the utility of such techniques for general data sets remains difficult. Thus most techniques are studied on only one data set. Another criticism that could be levied against previous evaluations of multi-variate visualizations is that the task doesn't require the presence of multiple variables. At the same time, the taxonomy of tasks that users may perform visually is extensive. We designed a task, trend localization, that required comparison of multiple data values in a multi-variate visualization. We then conducted a user study with this task, evaluating five multivariate visualization techniques from the literature (Brush Strokes, Data-Driven Spots, Oriented Slivers, Color Blending, Dimensional Stacking) and juxtaposed grayscale maps. We report the results and discuss the implications for both the techniques and the task.     

Perceived stress,sensation seeking,and college students’ abuse of the Internet

College students (n = 140) were examined to test whether sensation seeking and perceived stress would predict abuse of the Internet. Previous studies have found that disinhibition, boredom susceptibility, and total sensation seeking scores were related to Internet abuse ( 9 and 30). Because stress has been documented to have a negative effect on students ( Pierceall & Keim, 2007), and may be linked to Internet use ( Lavoie & Pychyl, 2001), it was tested as a possible predictor of Internet abuse. This study also analyzed abuse of the Internet for sexual purposes, because sexuality is prevalent online, and college students are in an age of sexual exploration. Results of stepwise regression analyses revealed that disinhibition and total perceived stress were predictive of Internet abuse for sexual purposes, and perceived hopelessness and boredom susceptibility were predictive of Internet abuse for non-sexual purposes. Implications for students and Internet abuse are discussed.     

Composable continuous-space programs for robotic swarms

Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behaviors. The Proto spatial computing language, however, already provides this sort of aggregate behavior programming for non-mobile systems using an abstraction of the network as a continuous-space-filling device. We extend this abstraction to mobile systems and show that Proto can be applied to multi-robot systems with an actuator that turns a vector field into device motion. Proto programs operate on fields of values over an abstract device called the amorphous medium and can be joined together using functional composition. These programs are then automatically transformed for execution by individual devices, producing an approximation of the specified continuous-space behavior. We are thus able to build up a library of simple swarm behaviors, and to compose them together into highly succinct programs that predictably produce the desired complex swarm behaviors, as demonstrated in simulation and on a group of 40 iRobot SwarmBots.     

A generic approach for developing process-level hydrologic modeling components

Component software architectures offer an alternative approach for building large, complex hydrologic modeling systems. In contrast to more traditional software paradigms (i.e. procedural or object-oriented approaches), using component-based approaches allows individuals to construct autonomous modeling units that can be linked together through shared boundary conditions during a simulation run. One of the challenges in component-based modeling is designing a simple yet robust means for authoring model components. We address this challenge by presenting an approach for efficiently creating standards-based, process-level hydrologic modeling components. Using this approach, a hydrologic process is implemented as a modeling component by (1) authoring a configuration file that defines the properties of the component and (2) creating a class with three methods that define the pre-run, runtime, and post-run behavior of the modeling component. We present the design and implementation of this approach, which we call the Simple Model Wrapper (SMW), and demonstrate how it can be applied to create an Open Modeling Interface (OpenMI)-compliant modeling component for a basic hydrologic process.     

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks.     

Linking denotational semantics with operational semantics for web services

Web Services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. The denotational semantics and operational semantics have been explored for BPEL. The two semantic models should be consistent. This paper considers the linking of these two semantics. Our approach is to derive the denotational semantics from operational semantics for BPEL, which aims for the consistency of the two models. Moreover, the derivation can be applied in exploring the program equivalence easily, especially for parallel programs.     

Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry

Many research initiatives carried out in production management consider process planning and operations scheduling as two separate and sequential functions. However, in certain contexts, the two functions must be better integrated. This is the case in divergent production systems with co-production (i.e. production of different products at the same time from a single product input) when alternative production processes are available. This paper studies such a context and focuses on the case of drying and finishing operations in a softwood lumber facility. The situation is addressed using a single model that simultaneously performs process planning and scheduling. We evaluate two alternative formulations. The first one is based on mixed integer programming (MIP) and the second on constraint programming (CP). We also propose a search procedure to improve the performance of the CP approach. Both approaches are compared with respect to their capacity to generate good solutions in short computation time.     

The Effect of Subfilter-Scale Physics on Regularization Models

The subfilter-scale (SFS) physics of regularization models are investigated to understand the regularizations’ performance as SFS models. Suppression of spectrally local SFS interactions and conservation of small-scale circulation in the Lagrangian-averaged Navier-Stokes α-model (LANS-α) is found to lead to the formation of rigid bodies. These contaminate the superfilter-scale energy spectrum with a scaling that approaches k ⁺¹ as the SFS spectra is resolved. The Clark-α and Leray-α models, truncations of LANS-α, do not conserve small-scale circulation and do not develop rigid bodies. LANS-α, however, is closest to Navier-Stokes in intermittency properties. All three models are found to be stable at high Reynolds number. Differences between L ² and H ¹ norm models are clarified. For magnetohydrodynamics (MHD), the presence of the Lorentz force as a source (or sink) for circulation and as a facilitator of both spectrally nonlocal large to small scale interactions as well as local SFS interactions prevents the formation of rigid bodies in Lagrangian-averaged MHD (LAMHD-α). LAMHD-α performs well as a predictor of superfilter-scale energy spectra and of intermittent current sheets at high Reynolds numbers. It may prove generally applicable as a MHD-LES.