CHEMICAL-IONIZATION MASS-SPECTROMETRY OF SOME NITRO-CONTAINING BIFUNCTIONAL AROMATIC-COMPOUNDS - LOCATION OF PROTONATION SITE

It is found that the nitro substituent of some aromatic bifunctional compounds shows unusual reactivity towards protonation. In the chemical ionization mass spectra of nitrobenzoic acids and their esters and amides, and of nitrophenols and their ethers, protonations on the carboxyl, ester, amide, hydroxyl or alkoxyl groups are highly suppressed by that on the nitro group. As a result, fragmentations based on protonation on these groups unexpectedly become negligible. Ortho effects were observed for all the ortho isomers where the initial protonation on the nitro group is followed by an intramolecular proton transfer reaction, which leads to the expected 'normal' fragmentations. Protonation on the nitro substituent is much more favourable in energy than on any of the other substituents. The interaction of the two substituents through the conjugating benzene ring is found to be responsible for this 'unfair' competitive protonation. The electron-attracting nitro group strongly destabilizes the MH+ ions formed through protonation on the other substituent; although the COR (R = OH, OMe, OEt, NH2) groups are also electron-withdrawing, their effects are weaker than that of NO2; thus protonation on the latter group produces more-stable MH+ ions. On the other hand, an electron-releasing group OR (R = H, Me, Et) stabilizes the nitro-protonated species; the stronger the electron-donating effect of this group the more stable the nitro-protonated ions.

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 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.

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.

The many-to-many location-routing problem

In this paper the many to many location routing problem is introduced, and its relationship to various problems in distribution management is emphasised. Useful mathematical formulations which can be easily extended to cater for other related problems are produced. Techniques for tackling this complex distribution problem are also outlined.