New route for light olefins production from chloromethane over HSAPO-34 molecular sieve

HSAPO-34 molecular sieve was employed in chloromethane conversion and showed high performance in activity and selectivity in production of light olefins. Our detailed IR investigation allowed the identification of the active sites and the adsorbed species and demonstrated that the conversion started from 350 degrees C with alkoxy group as the intermediate. The fixed-bed catalytic testing evidenced that in the range of 350-500 degrees C, 70-80% of chloromethane was transferred to ethylene, propylene and butenes. Increasing reaction temperature favors the conversion and enhances the yield of lighter olefins. A very important reversible phenomenon, the breaking of Al-O-P bonds upon adsorption of HCl, a main product of reaction to generate a large amount of P-OH groups and the recovery of Al-O-P upon removal of HCI was revealed. (c) 2005 Elsevier B.V. All rights reserved.

Load Profiling for Efficient Route Selection in Multi-Class Networks

High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow applications to reserve the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these bandwidth-reservation algorithms assign VCs to routes using the least-loaded concept, and thus result in balancing the load over the set of all candidate routes. In this paper, we show that for such reservation-based protocols|which allow for the exclusive use of a preset fraction of a resource's bandwidth for an extended period of time-load balancing is not desirable as it results in resource fragmentation, which adversely affects the likelihood of accepting new reservations. In particular, we show that load-balancing VC routing algorithms are not appropriate when the main objective of the routing protocol is to increase the probability of finding routes that satisfy incoming VC requests, as opposed to equalizing the bandwidth utilization along the various routes. We present an on-line VC routing scheme that is based on the concept of "load profiling", which allows a distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. We show the effectiveness of our load-profiling approach when compared to traditional load-balancing and load-packing VC routing schemes.

A Neural Model of Visually Guided Steering, Obstacle Avoidance, and Route Selection

A neural model is developed to explain how humans can approach a goal object on foot while steering around obstacles to avoid collisions in a cluttered environment. The model uses optic flow from a 3D virtual reality environment to determine the position of objects based on motion discotinuities, and computes heading direction, or the direction of self-motion, from global optic flow. The cortical representation of heading interacts with the representations of a goal and obstacles such that the goal acts as an attractor of heading, while obstacles act as repellers. In addition the model maintains fixation on the goal object by generating smooth pursuit eye movements. Eye rotations can distort the optic flow field, complicating heading perception, and the model uses extraretinal signals to correct for this distortion and accurately represent heading. The model explains how motion processing mechanisms in cortical areas MT, MST, and VIP can be used to guide steering. The model quantitatively simulates human psychophysical data about visually-guided steering, obstacle avoidance, and route selection.

A Neural Model of Visually Guided Steering, Obstacle Avoidance, and Route Selection

A neural model is developed to explain how humans can approach a goal object on foot while steering around obstacles to avoid collisions in a cluttered environment. The model uses optic flow from a 3D virtual reality environment to determine the position of objects based on motion discontinuities, and computes heading direction, or the direction of self-motion, from global optic flow. The cortical representation of heading interacts with the representations of a goal and obstacles such that the goal acts as an attractor of heading, while obstacles act as repellers. In addition the model maintains fixation on the goal object by generating smooth pursuit eye movements. Eye rotations can distort the optic flow field, complicating heading perception, and the model uses extraretinal signals to correct for this distortion and accurately represent heading. The model explains how motion processing mechanisms in cortical areas MT, MST, and posterior parietal cortex can be used to guide steering. The model quantitatively simulates human psychophysical data about visually-guided steering, obstacle avoidance, and route selection.

Energy-aware dynamic route management for THAWS

In this research we focus on the Tyndall 25mm and 10mm nodes energy-aware topology management to extend sensor network lifespan and optimise node power consumption. The two tiered Tyndall Heterogeneous Automated Wireless Sensors (THAWS) tool is used to quickly create and configure application-specific sensor networks. To this end, we propose to implement a distributed route discovery algorithm and a practical energy-aware reaction model on the 25mm nodes. Triggered by the energy-warning events, the miniaturised Tyndall 10mm data collector nodes adaptively and periodically change their association to 25mm base station nodes, while 25mm nodes also change the inter-connections between themselves, which results in reconfiguration of the 25mm nodes tier topology. The distributed routing protocol uses combined weight functions to balance the sensor network traffic. A system level simulation is used to quantify the benefit of the route management framework when compared to other state of the art approaches in terms of the system power-saving.

A cycle route planner mobile-app for Dublin city

In a road network, cyclists are the group exposed to the maximum amount of risk. Route choice of a cyclist is often based on level of expertise, perceived or actual road risks, personal decisions, weather conditions and a number of other factors. Consequently, cycling tends to be the only significant travel mode where optimised route choice is not based on least-path or least-time. This paper presents an Android platform based mobile-app for personalised route planning of cyclists in Dublin. The mobile-app, apart from its immediate advantage to the cyclists, acts as the departure point for a number of research projects and aids in establishing some critical calibration values for the cycling network in Dublin. 

Multi-party actions as a route to collective redress for mass arm, having particular regard to environmental mass harm

Accepted Version

Associations between BMI and home, school and route environmental exposures estimated using GPS and GIS: do we see evidence of selective daily mobility bias in children?

BACKGROUND: This study examined whether objective measures of food, physical activity and built environment exposures, in home and non-home settings, contribute to children's body weight. Further, comparing GPS and GIS measures of environmental exposures along routes to and from school, we tested for evidence of selective daily mobility bias when using GPS data. METHODS: This study is a cross-sectional analysis, using objective assessments of body weight in relation to multiple environmental exposures. Data presented are from a sample of 94 school-aged children, aged 5-11 years. Children's heights and weights were measured by trained researchers, and used to calculate BMI z-scores. Participants wore a GPS device for one full week. Environmental exposures were estimated within home and school neighbourhoods, and along GIS (modelled) and GPS (actual) routes from home to school. We directly compared associations between BMI and GIS-modelled versus GPS-derived environmental exposures. The study was conducted in Mebane and Mount Airy, North Carolina, USA, in 2011. RESULTS: In adjusted regression models, greater school walkability was associated with significantly lower mean BMI. Greater home walkability was associated with increased BMI, as was greater school access to green space. Adjusted associations between BMI and route exposure characteristics were null. The use of GPS-actual route exposures did not appear to confound associations between environmental exposures and BMI in this sample. CONCLUSIONS: This study found few associations between environmental exposures in home, school and commuting domains and body weight in children. However, walkability of the school neighbourhood may be important. Of the other significant associations observed, some were in unexpected directions. Importantly, we found no evidence of selective daily mobility bias in this sample, although our study design is in need of replication in a free-living adult sample.

A nested location-routing heuristic using route length estimation

A nested heuristic approach that uses route length approximation is proposed to solve the location-routing problem. A new estimation formula for route length approximation is also developed. The heuristic is evaluated empirically against the sequential method and a recently developed nested method for location routing problems. This testing is carried out on a set of problems of 400 customers and around 15 to 25 depots with good results.

Heuristics for short route job shop scheduling problems

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2.

A 3/2 algorithm for two-machine open shop with route-dependent processing times

This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3=2.