Size versus truthfulness in the house allocation problem

We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We focus on truthful mechanisms without monetary transfers for finding large Pareto optimal matchings. It is straightforward to show that no deterministic truthful mechanism can approximate a maximum cardinality Pareto optimal matching with ratio better than 2. We thus consider randomized mechanisms. We give a natural and explicit extension of the classical Random Serial Dictatorship Mechanism (RSDM) specifically for the House Allocation problem where preference lists can include ties. We thus obtain a universally truthful randomized mechanism for finding a Pareto optimal matching and show that it achieves an approximation ratio of eovere-1. The same bound holds even when agents have priorities (weights) and our goal is to find a maximum weight (as opposed to maximum cardinality) Pareto optimal matching. On the other hand we give a lower bound of 18 over 13 on the approximation ratio of any universally truthful Pareto optimal mechanism in settings with strict preferences. In the case that the mechanism must additionally be non-bossy, an improved lower bound of eovere-1 holds. This lower bound is tight given that RSDM for strict preference lists is non-bossy. We moreover interpret our problem in terms of the classical secretary problem and prove that our mechanism provides the best randomized strategy of the administrator who interviews the applicants

Overview of Instruments of Measurement for Perceived Discrimination

The purpose of this study is to examine the current tools of measurement for perceived discrimination. Specifically, to investigate the number of tools of measurement available, similarities and differences between different tools available, and possible gaps in these tools of measurement. Literature shows the impact of perceived discrimination on both physical and mental health, but little literature exists on the quality and quantity of tools of measurement for perceived discrimination. By investigating current tools of measurement improvements may be made in the collection and analysis of such data

Application of Self Tuning Fuzzy Logic Control to Full Railway Vehicle Model

AbstractThis paper presents the dynamic modeling and intelligent control of the full railway vehicle against the railway irregularities. In order to safe and comfortable transportation of passengers, vibration analysis and control studies are investigated by using Matlab–Simulink software. The 54 degrees of freedom railway vehicle model is used for analysis. The controllers are placed between the car body and bogies. For reducing the car body vibrations caused by a lateral and two vertical sinusoidal track irregularities, fuzzy logic and self-tuning fuzzy logic control schemes are applied to railway vehicle. The fuzzy logic based algorithms herein are used for realizing the active control of car body vibrations. The simulations of vibration analysis are obtained in time and frequency domains and compared with uncontrolled case. A good vibration reduction performance is achieved by using applied control algorithms

A Case Study on Agro-based E-Commerce Portal

This paper has investigated the practice of E-Commerce portal named Metrotarkari for marketing vegetables and fruit items in Kathmandu valley. A case study approach underpinned the study so as to identify current issues and practice of E-Commerce portal for vegetable and fruit items thereby adopt appropriate strategies for its sustainability in this sector. The study used explanatory form of analysis on the issues of business model, payment system, distribution system, overall challenges and marketing strategies based on the face to face interview with chief operating officer of Metrotarkari. The result shows that their B2B feature is serving more customers than B2C feature does in daily basis. The cash on delivery has been the preferable option of payment system although they have facility of Paypal, E-Sewa and Sctmoco. The main reason behind the problem in maintaining and delivering quality items is the lack of their own inventory and their dependency on others vendors. Establishing their own cold store or inventory and appending the C2C feature in their existing portal are major suggestions made to provide benefit to farmers and customers thereby sustain in this sector

Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations

Cake cutting is one of the most fundamental settings in fair division and mechanism design without money. In this paper, we consider different levels of three fundamental goals in cake cutting: fairness, Pareto optimality, and strategyproofness. In particular, we present robust versions of envy-freeness and proportionality that are not only stronger than their standard counter-parts but also have less information requirements. We then focus on cake cutting with piecewise constant valuations and present three desirable algorithms: CCEA (Controlled Cake Eating Algorithm), MEA (Market Equilibrium Algorithm) and CSD (Constrained Serial Dictatorship). CCEA is polynomial-time, robust envy-free, and non-wasteful. It relies on parametric network flows and recent generalizations of the probabilistic serial algorithm. For the subdomain of piecewise uniform valuations, we show that it is also group-strategyproof. Then, we show that there exists an algorithm (MEA) that is polynomial-time, envy-free, proportional, and Pareto optimal. MEA is based on computing a market-based equilibrium via a convex program and relies on the results of Reijnierse and Potters [24] and Devanur et al. [15]. Moreover, we show that MEA and CCEA are equivalent to mechanism 1 of Chen et. al. [12] for piecewise uniform valuations. We then present an algorithm CSD and a way to implement it via randomization that satisfies strategyproofness in expectation, robust proportionality, and unanimity for piecewise constant valuations. For the case of two agents, it is robust envy-free, robust proportional, strategyproof, and polynomial-time. Many of our results extend to more general settings in cake cutting that allow for variable claims and initial endowments. We also show a few impossibility results to complement our algorithms.Comment: 39 page

Quality of analytical performance in inherited metabolic disorders: the role of ERNDIM

Summary: External quality assurance (EQA) schemes are essential for improvement of accuracy, reliability and comparability of results of biochemical genetic tests. ERNDIM (European Research Network for evaluation and improvement of screening, Diagnosis and treatment of Inherited disorders of Metabolism), established in 1994, operates nine EQA schemes for biochemical genetic testing according to international norms and recommendations. These comprise qualitative schemes for amino acids, organic acids, purines and pyrimidines, special assays in serum and urine and white cell cystine, qualitative organic acid and acylcarnitine schemes, as well as diagnostic proficiency testing. The total number of participants has increased from 123 in 1994 to 268 in 2007. Additional activities include participation in the Eurogentest project, a laboratory directory, training, education and development of guidelines. Results from the quantitative amino acid scheme with 170 participants reveal good variation within and between laboratories of below 10% for 10 amino acids; good within-laboratory variation but intermediate inter-laboratory variation of 10-22% for 11 amino acids; and higher variation within and between laboratories for 8 amino acids. Results on samples from 51 inherited metabolic disorders from two of five centres organizing diagnostic proficiency testing indicate overall diagnostic efficiency above 80% and improved performance of individual laboratories. Comparison of results for 10 and 12 compounds in the serum and urine special assay schemes respectively for 2000 and 2007 reveal clear improvement of precision within laboratories and in inter-laboratory variation. There is considerable evidence that performance in biochemical genetic testing has improved since the introduction of ERNDIM scheme

Molecular networks discriminating mouse bladder responses to intravesical bacillus Calmette-Guerin (BCG), LPS, and TNF-α

<p>Abstract</p> <p>Background</p> <p>Despite being a mainstay for treating superficial bladder carcinoma and a promising agent for interstitial cystitis, the precise mechanism of Bacillus Calmette-Guerin (BCG) remains poorly understood. It is particularly unclear whether BCG is capable of altering gene expression in the bladder target organ beyond its well-recognized pro-inflammatory effects and how this relates to its therapeutic efficacy. The objective of this study was to determine differentially expressed genes in the mouse bladder following chronic intravesical BCG therapy and to compare the results to non-specific pro inflammatory stimuli (LPS and TNF-α). For this purpose, C57BL/6 female mice received four weekly instillations of BCG, LPS, or TNF-α. Seven days after the last instillation, the urothelium along with the submucosa was removed from detrusor muscle and the RNA was extracted from both layers for cDNA array experiments. Microarray results were normalized by a robust regression analysis and only genes with an expression above a conditional threshold of 0.001 (3SD above background) were selected for analysis. Next, genes presenting a 3-fold ratio in regard to the control group were entered in Ingenuity Pathway Analysis (IPA) for a comparative analysis in order to determine genes specifically regulated by BCG, TNF-α, and LPS. In addition, the transcriptome was precipitated with an antibody against RNA polymerase II and real-time polymerase chain reaction assay (Q-PCR) was used to confirm some of the BCG-specific transcripts.</p> <p>Results</p> <p>Molecular networks of treatment-specific genes generated several hypotheses regarding the mode of action of BCG. BCG-specific genes involved small GTPases and BCG-specific networks overlapped with the following canonical signaling pathways: axonal guidance, B cell receptor, aryl hydrocarbon receptor, IL-6, PPAR, Wnt/β-catenin, and cAMP. In addition, a specific detrusor network expressed a high degree of overlap with the development of the lymphatic system. Interestingly, TNF-α-specific networks overlapped with the following canonical signaling pathways: PPAR, death receptor, and apoptosis. Finally, LPS-specific networks overlapped with the LPS/IL-1 mediated inhibition of RXR. Because NF-kappaB occupied a central position in several networks, we further determined whether this transcription factor was part of the responses to BCG. Electrophoretic mobility shift assays confirmed the participation of NF-kappaB in the mouse bladder responses to BCG. In addition, BCG treatment of a human urothelial cancer cell line (J82) also increased the binding activity of NF-kappaB, as determined by precipitation of the chromatin by a NF-kappaB-p65 antibody and Q-PCR of genes bearing a NF-kappaB consensus sequence. Next, we tested the hypothesis of whether small GTPases such as LRG-47 are involved in the uptake of BCG by the bladder urothelium.</p> <p>Conclusion</p> <p>As expected, BCG treatment induces the transcription of genes belonging to common pro-inflammatory networks. However, BCG also induces unique genes belonging to molecular networks involved in axonal guidance and lymphatic system development within the bladder target organ. In addition, NF-kappaB seems to play a predominant role in the bladder responses to BCG therapy. Finally, in intact urothelium, BCG-GFP internalizes in LRG-47-positive vesicles.</p> <p>These results provide a molecular framework for the further study of the involvement of immune and nervous systems in the bladder responses to BCG therapy.</p

Pareto Optimal Matchings in Many-to-Many Markets with Ties

We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the \emph{Generalized Serial Dictatorship Mechanism with Ties (GSDT)} that effectively handles ties via properties of network flows. We show that GSDT can generate all POMs using different priority orderings over the applicants, but it satisfies truthfulness only for certain such orderings. This shortcoming is not specific to our mechanism; we show that any mechanism generating all POMs in our setting is prone to strategic manipulation. This is in contrast to the one-to-one case (with or without ties), for which truthful mechanisms generating all POMs do exist

Bladder inflammatory transcriptome in response to tachykinins: Neurokinin 1 receptor-dependent genes and transcription regulatory elements

Background Tachykinins (TK), such as substance P, and their neurokinin receptors which are ubiquitously expressed in the human urinary tract, represent an endogenous system regulating bladder inflammatory, immune responses, and visceral hypersensitivity. Increasing evidence correlates alterations in the TK system with urinary tract diseases such as neurogenic bladders, outflow obstruction, idiopathic detrusor instability, and interstitial cystitis. However, despite promising effects in animal models, there seems to be no published clinical study showing that NK-receptor antagonists are an effective treatment of pain in general or urinary tract disorders, such as detrusor overactivity. In order to search for therapeutic targets that could block the tachykinin system, we set forth to determine the regulatory network downstream of NK1 receptor activation. First, NK1R-dependent transcripts were determined and used to query known databases for their respective transcription regulatory elements (TREs). Methods: An expression analysis was performed using urinary bladders isolated from sensitized wild type (WT) and NK1R-/- mice that were stimulated with saline, LPS, or antigen to provoke inflammation. Based on cDNA array results, NK1R-dependent genes were selected. PAINT software was used to query TRANSFAC database and to retrieve upstream TREs that were confirmed by electrophoretic mobility shift assays. Results: The regulatory network of TREs driving NK1R-dependent genes presented cRel in a central position driving 22% of all genes, followed by AP-1, NF-kappaB, v-Myb, CRE-BP1/c-Jun, USF, Pax-6, Efr-1, Egr-3, and AREB6. A comparison between NK1R-dependent and NK1R-independent genes revealed Nkx-2.5 as a unique discriminator. In the presence of NK1R, Nkx2-5 _01 was significantly correlated with 36 transcripts which included several candidates for mediating bladder development (FGF) and inflammation (PAR-3, IL-1R, IL-6, α-NGF, TSP2). In the absence of NK1R, the matrix Nkx2-5_02 had a predominant participation driving 8 transcripts, which includes those involved in cancer (EYA1, Trail, HSF1, and ELK-1), smooth-to-skeletal muscle trans-differentiation, and Z01, a tight-junction protein, expression. Electrophoretic mobility shift assays confirmed that, in the mouse urinary bladder, activation of NK1R by substance P (SP) induces both NKx-2.5 and NF-kappaB translocations. Conclusion: This is the first report describing a role for Nkx2.5 in the urinary tract. As Nkx2.5 is the unique discriminator of NK1R-modulated inflammation, it can be imagined that in the near future, new based therapies selective for controlling Nkx2.5 activity in the urinary tract may be used in the treatment in a number of bladder disorders