Distribution of Value of Time and Ways to Model Value of Time in Long-Range Planning Models

As managed lanes (ML) become more integrated in regional urban networks with existing general purpose (GP) lanes, the distribution of travelers’ value of time (VOT) is becoming more important for transportation planning agencies to quantify in order to accurately predict future travel patterns. Since travelers’ VOT varies depending on a multitude of factors, this study investigates ways that we can determine the VOT distribution of a region from existing travel data as well as effective ways that we can model VOT using traffic assignment algorithms. In networks with available link volumes and toll data on segments where travelers have the option of choosing to stay on the GP lanes or entering a ML facility, a VOT distribution can be inferred assuming that travelers who enter the ML choose to do so based on a certain “threshold” VOT. When modeling these VOT distributions, errors are observed in the traffic assignment results when both the continuous nature of VOT distributions are discretized, and when varying toll values are assumed to be constant. Specifically in the context of TransCAD software, link travel time errors appear to be much less significant than flow errors when tested on a nine node network. Additional experimentation on larger regional networks is needed to verify the significance of these errors and their impact on predicted travel patterns.Civil, Architectural, and Environmental Engineerin

Cosmetic use of botulinum toxin type A in the elderly

Botulinum toxin type A injections are one of the most popular cosmetic procedures for diminishing the appearance of facial lines caused by habitual facial muscle contractions. Although the manufacturer’s labeling recommends botulinum toxin only for the treatment of glabellar lines among adults younger than 65 years of age, there is widespread use of the toxin for other cosmetic purposes and for patients who may be older than 65. Evidence-based safety and efficacy data on botulinum toxin use in elderly patients is limited. However, given the age-related skin changes and multifactorial causes of wrinkles in the elderly, as well as the higher risk for potential side effects due to concomitant diseases and medications, a careful risk-benefit assessment should precede the decision to use botulinum toxin in the elderly patient

The degradation of trace pollutants in wastewater

The effect of different treatments on the degradation of chlorinated organic pollutants in wastewater has been studied. The model compound investigated was para-chlorophenol. The different treatments used were ozone, UV irradiation, ultrasound, air flow and pure oxygen. It is concluded that ozone has the greatest effect, ozone-UV irradiation follows closely behind, and UV irradiation has much less of an effect in degrading the p-chlorophenol. P-chlorophenol was found to have an immeasureably slow degradation rate when treated with air even at an elevated temperature of 55°C. The oxygen, at room temperature, showed a degradation of p-chlorophenol which, although small, was much greater than that of air at the higher temperature

Stable Matchings with Restricted Preferences: Structure and Complexity

It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset $P$, an instance $I(P)$ can be constructed efficiently so that the rotation poset of $I(P)$ is isomorphic to $P$. In this case, we say that $I(P)$ realizes $P$. Many researchers exploit the rotation poset of an instance to develop fast algorithms or to establish the hardness of stable matching problems. In order to gain a parameterized understanding of the complexity of sampling stable matchings, Bhatnagar et al. [SODA 2008] introduced stable matching instances whose preference lists are restricted but nevertheless model situations that arise in practice. In this paper, we study four such parameterized restrictions; our goal is to characterize the rotation posets that arise from these models: $k$-bounded, $k$-attribute, $(k_1, k_2)$-list, $k$-range. We prove that there is a constant $k$ so that every rotation poset is realized by some instance in the first three models for some fixed constant $k$. We describe efficient algorithms for constructing such instances given the Hasse diagram of a poset. As a consequence, the fundamental problem of counting stable matchings remains $\#$BIS-complete even for these restricted instances. For $k$-range preferences, we show that a poset $P$ is realizable if and only if the Hasse diagram of $P$ has pathwidth bounded by functions of $k$. Using this characterization, we show that the following problems are fixed parameter tractable when parametrized by the range of the instance: exactly counting and uniformly sampling stable matchings, finding median, sex-equal, and balanced stable matchings.Comment: Various updates and improvements in response to reviewer comment

Stable Matchings with Restricted Preferences: Structure and Complexity

In the stable marriage (SM) problem, there are two sets of agents–traditionally referred to as men and women–and each agent has a preference list that ranks (a subset of) agents of the opposite sex. The goal is to find a matching between men and women that is stable in the sense that no man-woman pair mutually prefer each other to their assigned partners. In a seminal work, Gale and Shapley showed that stable matchings always exist, and described an efficient algorithm for finding one. Irving and Leather defined the rotation poset of an SM instance and showed that it determines the structure of the set of stable matchings of the instance. They further showed that every finite poset can be realized as the rotation poset of some SM instance. Consequently, many problems–such as counting stable matchings and finding certain “fair” stable matchings–are computationally intractable (NP-hard) in general. In this paper, we consider SM instances in which certain restrictions are placed on the preference lists. We show that three natural preference models?k-bounded, k-attribute, and (k1, k2)-list–can realize arbitrary rotation posets for constant values of k. Hence even in these highly restricted preference models, many stable matching problems remain intractable. In contrast, we show that for any fixed constant k, the rotation posets of k-range instances are highly restricted. As a consequence, we show that exactly counting and uniformly sampling stable matchings, finding median, sex-equal, and balanced stable matchings are fixed-parameter tractable when parameterized by the range of the instance. Thus, these problems can be solved in polynomial time on instances of the k-range model for any fixed constant k

The effect of the dust size distribution on asteroid polarization

We have developed a theoretical description of how of an asteroid's polarization-phase curve will be affected by the removal of the dust from the surface due to a size-dependent phenomenon such as radiation pressure-driven escape of levitated particles. We test our calculations against new observations of four small (D ~ 1 km) near-Earth asteroids [(85236), (142348), (162900) and 2006 SZ_217] obtained with the Dual Beam Imaging Polarimeter on the University of Hawaii's 2.2 m telescope, as well as previous observations of (25143) Itokawa and (433) Eros. We find that the polarization of the light reflected from an asteroid is controlled by the mineralogical and chemical composition of the surface and is independent of dust particle. The relation between the slope of the polarization-phase curve beyond the inversion angle and the albedo of an asteroid is thus independent of the surface regolith size distribution and is valid for both Main Belt and Near-Earth asteroids.Comment: accepted to A

SoyXpress: A database for exploring the soybean transcriptome

Abstract Background Experiments using whole transcriptome microarrays produce massive amounts of data. To gain a comprehensive understanding of this gene expression data it needs to be integrated with other available information such as gene function and metabolic pathways. Bioinformatics tools are essential to handle, organize and interpret the results. To date, no database provides whole transcriptome analysis capabilities integrated with terms describing biological functions for soybean (Glycine max (L) Merr.). To this end we have developed SoyXpress, a relational database with a suite of web interfaces to allow users to easily retrieve data and results of the microarray experiment with cross-referenced annotations of expressed sequence tags (EST) and hyperlinks to external public databases. This environment makes it possible to explore differences in gene expression, if any, between for instance transgenic and non-transgenic soybean cultivars and to interpret the results based on gene functional annotations to determine any changes that could potentially alter biological processes. Results SoyXpress is a database designed for exploring the soybean transcriptome. Currently SoyXpress houses 380,095 soybean Expressed Sequence Tags (EST), linked with metabolic pathways, Gene Ontology terms, SwissProt identifiers and Affymetrix gene expression data. Array data is presently available from an experiment profiling global gene expression of three conventional and two genetically engineered soybean cultivars. The microarray data is linked with the sequence data, for maximum knowledge extraction. SoyXpress is implemented in MySQL and uses a Perl CGI interface. Conclusion SoyXpress is designed for the purpose of exploring potential transcriptome differences in different plant genotypes, including genetically modified crops. Soybean EST sequences, microarray and pathway data as well as searchable and browsable gene ontology are integrated and presented. SoyXpress is publicly accessible at http://soyxpress.agrenv.mcgill.ca.</p

A Low-Valent Molybdenum Nitride Complex: Reduction Promotes Carbonylation Chemistry

Toward nitrogen functionalization, reactive terminal transition metal nitrides with high d‐electron counts are of interest. A series of terminal Mo^(IV) nitride complexes were prepared within the context of exploring nitride/carbonyl coupling to cyanate. Reduction affords the first Mo^(II) nitrido complex, an early metal nitride with four valence d‐electrons. The binding mode of the para‐terphenyl diphosphine ancillary ligand changes to stabilize an electronic configuration with a high electron count and a formal M−N bond order of three. Even with an intact Mo≡N bond, this low‐valent nitrido complex proves to be highly reactive, readily undergoing N‐atom transfer upon addition of CO, releasing cyanate anion