The Oscillatory Squeeze flow rheometer: Comprehensive theory and a new experimental facility

Binding, David; Bell, D.; Walters, K., (2006) 'The Oscillatory Squeeze flow rheometer: Comprehensive theory and a new experimental facility', Rheologica Acta 46 pp.111-121 RAE2008

Market allocations of location choice: an example

The purpose of this paper is to make an example which, first, illustrates Starret’s Spatial Imposibility Theorem, when agents have free mobility; and second, allowes us to get a competitive equilibrium with transportation when agents move only if there is a noticeable difference in utilities that justifies the change of location.

On the Geographic Location of Internet Resources

One relatively unexplored question about the Internet's physical structure concerns the geographical location of its components: routers, links and autonomous systems (ASes). We study this question using two large inventories of Internet routers and links, collected by different methods and about two years apart. We first map each router to its geographical location using two different state-of-the-art tools. We then study the relationship between router location and population density; between geographic distance and link density; and between the size and geographic extent of ASes. Our findings are consistent across the two datasets and both mapping methods. First, as expected, router density per person varies widely over different economic regions; however, in economically homogeneous regions, router density shows a strong superlinear relationship to population density. Second, the probability that two routers are directly connected is strongly dependent on distance; our data is consistent with a model in which a majority (up to 75-95%) of link formation is based on geographical distance (as in the Waxman topology generation method). Finally, we find that ASes show high variability in geographic size, which is correlated with other measures of AS size (degree and number of interfaces). Among small to medium ASes, ASes show wide variability in their geographic dispersal; however, all ASes exceeding a certain threshold in size are maximally dispersed geographically. These findings have many implications for the next generation of topology generators, which we envisage as producing router-level graphs annotated with attributes such as link latencies, AS identifiers and geographical locations.

Extracting Location from Contact Traces

Localization is essential feature for many mobile wireless applications. Data collected from applications such as environmental monitoring, package tracking or position tracking has no meaning without knowing the location of this data. Other applications have location information as a building block for example, geographic routing protocols, data dissemination protocols and location-based services such as sensing coverage. Many of the techniques have the trade-off among many features such as deployment of special hardware, level of accuracy and computation power. In this paper, we present an algorithm that extracts location constraints from the connectivity information. Our solution, which does not require any special hardware and a small number of landmark nodes, uses two types of location constraints. The spatial constraints derive the estimated locations observing which nodes are within communication range of each other. The temporal constraints refine the areas, computed by the spatial constraints, using properties of time and space extracted from a contact trace. The intuition of the temporal constraints is to limit the possible locations that a node can be using its previous and future locations. To quantify this intuitive improvement in refine the nodes estimated areas adding temporal information, we performed simulations using synthetic and real contact traces. The results show this improvement and also the difficulties of using real traces.

A Fully Distributed Location Management Scheme for Large PCS

In [previous papers] we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully replicating location information is both appropriate and efficient for small PCS networks. In this paper, we analyze the performance of this scheme. Then, we extend the scheme in a hierarchical environment so as to scale to large PCS networks. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard.

A knowledge management system to optimise comfort throughout the building life-cycle

Comfort is, in essence, satisfaction with the environment, and with respect to the indoor environment it is primarily satisfaction with the thermal conditions and air quality. Improving comfort has social, health and economic benefits, and is more financially significant than any other building cost. Despite this, comfort is not strictly managed throughout the building lifecycle. This is mainly due to the lack of an appropriate system to adequately manage comfort knowledge through the construction process into operation. Previous proposals to improve knowledge management have not been successfully adopted by the construction industry. To address this, the BabySteps approach was devised. BabySteps is an approach, proposed by this research, which states that for an innovation to be adopted into the industry it must be implementable through a number of small changes. This research proposes that improving the management of comfort knowledge will improve comfort. ComMet is a new methodology proposed by this research that manages comfort knowledge. It enables comfort knowledge to be captured, stored and accessed throughout the building life-cycle and so allowing it to be re-used in future stages of the building project and in future projects. It does this using the following: Comfort Performances – These are simplified numerical representations of the comfort of the indoor environment. Comfort Performances quantify the comfort at each stage of the building life-cycle using standard comfort metrics. Comfort Ratings - These are a means of classifying the comfort conditions of the indoor environment according to an appropriate standard. Comfort Ratings are generated by comparing different Comfort Performances. Comfort Ratings provide additional information relating to the comfort conditions of the indoor environment, which is not readily determined from the individual Comfort Performances. Comfort History – This is a continuous descriptive record of the comfort throughout the project, with a focus on documenting the items and activities, proposed and implemented, which could potentially affect comfort. Each aspect of the Comfort History is linked to the relevant comfort entity it references. These three components create a comprehensive record of the comfort throughout the building lifecycle. They are then stored and made available in a common format in a central location which allows them to be re-used ad infinitum. The LCMS System was developed to implement the ComMet methodology. It uses current and emerging technologies to capture, store and allow easy access to comfort knowledge as specified by ComMet. LCMS is an IT system that is a combination of the following six components: Building Standards; Modelling & Simulation; Physical Measurement through the specially developed Egg-Whisk (Wireless Sensor) Network; Data Manipulation; Information Recording; Knowledge Storage and Access.Results from a test case application of the LCMS system - an existing office room at a research facility - highlighted that while some aspects of comfort were being maintained, the building’s environment was not in compliance with the acceptable levels as stipulated by the relevant building standards. The implementation of ComMet, through LCMS, demonstrates how comfort, typically only considered during early design, can be measured and managed appropriately through systematic application of the methodology as means of ensuring a healthy internal environment in the building.

A navigation and object location device for the blind

Gemstone Team Vision

cDNA for the human beta 2-adrenergic receptor: a protein with multiple membrane-spanning domains and encoded by a gene whose chromosomal location is shared with that of the receptor for platelet-derived growth factor.

We have isolated and sequenced a cDNA encoding the human beta 2-adrenergic receptor. The deduced amino acid sequence (413 residues) is that of a protein containing seven clusters of hydrophobic amino acids suggestive of membrane-spanning domains. While the protein is 87% identical overall with the previously cloned hamster beta 2-adrenergic receptor, the most highly conserved regions are the putative transmembrane helices (95% identical) and cytoplasmic loops (93% identical), suggesting that these regions of the molecule harbor important functional domains. Several of the transmembrane helices also share lesser degrees of identity with comparable regions of select members of the opsin family of visual pigments. We have localized the gene for the beta 2-adrenergic receptor to q31-q32 on chromosome 5. This is the same position recently determined for the gene encoding the receptor for platelet-derived growth factor and is adjacent to that for the FMS protooncogene, which encodes the receptor for the macrophage colony-stimulating factor.

The effect of correctional facility programming on nonviolent beliefs

Gemstone Team Peace in Prisons

When the library is located in prime real estate: a case study on the loss of space from the Duke University Medical Center Library and Archives.

The Duke University Medical Center Library and Archives is located in the heart of the Duke Medicine campus, surrounded by Duke Hospital, ambulatory clinics, and numerous research facilities. Its location is considered prime real estate, given its adjacency to patient care, research, and educational activities. In 2005, the Duke University Library Space Planning Committee had recommended creating a learning center in the library that would support a variety of educational activities. However, the health system needed to convert the library's top floor into office space to make way for expansion of the hospital and cancer center. The library had only five months to plan the storage and consolidation of its journal and book collections, while working with the facilities design office and architect on the replacement of key user spaces on the top floor. Library staff worked together to develop plans for storing, weeding, and consolidating the collections and provided input into renovation plans for users spaces on its mezzanine level. The library lost 15,238 square feet (29%) of its net assignable square footage and a total of 16,897 (30%) gross square feet. This included 50% of the total space allotted to collections and over 15% of user spaces. The top-floor space now houses offices for Duke Medicine oncology faculty and staff. By storing a large portion of its collection off-site, the library was able to remove more stacks on the remaining stack level and convert them to user spaces, a long-term goal for the library. Additional space on the mezzanine level had to be converted to replace lost study and conference room spaces. While this project did not match the recommended space plans for the library, it underscored the need for the library to think creatively about the future of its facility and to work toward a more cohesive master plan.

A location-based communication platform: integrating file sharing with interpersonal contact

Gemstone Team FLIP (File Lending in Proximity)

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.

Nested heuristic methods for the location-routeing problem

The concept of 'nested methods' is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired from computational geometry are presented. A simple version of tabu search is also embedded into our methods to improve the solutions further. Computational testing is carried out on five sets of problems of 400 customers with five levels of depot fixed costs, and the results obtained are encouraging.