Changing epidemiology of HIV anonymous testing in Switzerland for 1996-2006

QUESTIONS UNDER STUDY: To assess whether the prevalence of HIV positive tests in clients at five anonymous testing sites in Switzerland had increased since the end of the 1990s, and ascertain whether there had been any concurrent change in the proportions of associated risk factors. METHODS: Baseline characteristics were analysed, by groups of years, over the eleven consecutive years of data collected from the testing sites. Numbers of HIV positive tests were presented as prevalence/1000 tests performed within each category. Multivariable analyses, stratified by African nationality and risk group of heterosexuals or men who have sex with men (MSM), were done controlling simultaneously for a series of variables. Odds ratios (ORs) were reported together with their 95% confidence intervals (CI). P values were calculated from likelihood ratio tests. RESULTS: There was an increase in the prevalence of positive tests in African heterosexuals between 1996-1999 and 2004-2006, rising from 54.2 to 86.4/1000 and from 5.6 to 25.2/1000 in females and males respectively. The proportion of MSM who knew that one or more of their sexual partners was infected with HIV increased from 2% to 17% and the proportion who reported having more than five sexual partners in the preceding two years increased from 44% to 51%. CONCLUSIONS: Surveillance data from anonymous testing sites continue to provide useful information on the changing epidemiology of HIV and thus inform public health strategies against HIV.

Reputation Formation and the Evolution of Cooperation in Anonymous Online Markets

Theoretical propositions stressing the importance of trust, reciprocity, and reputation for cooperation in social exchange relations are deeply rooted in classical sociological thought. Today’s online markets provide a unique opportunity to test these theories using unobtrusive data. Our study investigates the mechanisms promoting cooperation in an online-auction market where most transactions can be conceived as one-time-only exchanges. We first give a systematic account of the theoretical arguments explaining the process of cooperative transactions. Then, using a large dataset comprising 14,627 mobile phone auctions and 339,517 DVD auctions, we test key hypotheses about the effects of traders’ reputations on auction outcomes and traders’ motives for leaving feedback. Our statistical analyses show that sellers with better reputations have higher sales and obtain higher prices. Furthermore, we observe a high rate of participation in the feedback system, which is largely consistent with strong reciprocity—a predisposition to unconditionally reward (or punish) one’s interaction partner’s cooperation (or defection)—and altruism—a predisposition to increase one’s own utility by elevating an interaction partner’s utility. Our study demonstrates how strong reciprocity and altruism can mitigate the free-rider problem in the feedback system to create reputational incentives for mutually beneficial online trade.

CHROMOSOMAL MAPPING, LINKAGE RELATIONSHIPS, AND EVOLUTIONARY STUDIES OF THE HUMAN ANONYMOUS DNA CLONE D1S1 (IN SITU HYBRIDIZATION, PRIMATES, GENE MAPPING, AUTOSOMAL DOMINANT RETINITIS PIGMENTOSA, GENE DUPLICATION)

D1S1, an anonymous human DNA clone originally called (lamda)Ch4-H3 or (lamda)H3, was the first single copy mapped to a human chromosome (1p36) by in situ hybridization. The chromosomal assignment has been confirmed in other laboratories by repeating the in situ hybridization but not by another method. In the present study, hybridization to a panel of hamster-human somatic cell hybrids revealed copies of D1S1 on both chromosomes 1 and 3. Subcloning D1S1 showed that the D1S1 clone itself is from chromosome 3, and the sequence detected by in situ hybridization is at least two copies of part of the chromosome 3 copy. This finding demonstrates the importance of verifying gene mapping with two methods and questions the accuracy of in situ hybridization mapping.^ Non-human mammals have only one copy of D1S1, and the non-human primate D1S1 map closely resembles the human chromosome 3 copy. Thus, the human chromosome 1 copies appear to be part of a very recent duplication that occurred after the divergence between humans and the other great apes.^ A moderately informative HindIII D1S1 RFLP was mapped to chromosome 3. This marker and 12 protein markers were applied to a linkage study of autosomal dominant retinitis pigmentosa (ADRP). None of the markers proved linkage, but adding the three families examined to previously published data raises the ADRP:Rh lod score to 1.92 at (THETA) = 0.30. ^

Now You See it, Now You Don't: Why Do Real Estate Agents Withhold Available Houses from Black Customers?

Potential home buyers may initiate contact with a real estate agent by asking to see a particular advertised house. This paper asks whether an agent's response to such a request depends on the race of the potential buyer or on whether the house is located in an integrated neighborhood. We build on previous research about the causes of discrimination in housing by using data from fair housing audits, a matched-pair technique for comparing the treatment of equllay qualified black and white home buyers. However, we shift the focus from differences in the treatment of paired buyers to agent decisions concerning an individual housing unit using a sample of all houses seen during he 1989 Housing Discrimination study. We estimate a random effect, multinomial logit model to explain a real estate agent's joint decisions concerning whether to show each unit to a black auditor and to a white auditor. We find evidence that agents withhold houses in suburban, integrated neighborhoods from all customers (redlining), that agents' decisions to show houses in integrated neighborhoods are not the same for black and white customers (steering), and that the houses agents show are more likely to deviate from the initial request when the customeris black than when the customer is white. These deviations are consistent with the possibility that agents act upon the belief that some types of transactions are relatively unlikely for black customers (statistical discrimination).

Eventual election of multiple leaders for solving consensus in anonymous systems

In classical distributed systems, each process has a unique identity. Today, new distributed systems have emerged where a unique identity is not always possible to be assigned to each process. For example, in many sensor networks a unique identity is not possible to be included in each device due to its small storage capacity, reduced computational power, or the huge number of devices to be identified. In these cases, we have to work with anonymous distributed systems where processes cannot be identified. Consensus cannot be solved in classical and anonymous asynchronous distributed systems where processes can crash. To bypass this impossibility result, failure detectors are added to these systems. It is known that ? is the weakest failure detector class for solving consensus in classical asynchronous systems when amajority of processes never crashes. Although A? was introduced as an anonymous version of ?, to find the weakest failure detector in anonymous systems to solve consensus when amajority of processes never crashes is nowadays an open question. Furthermore, A? has the important drawback that it is not implementable. Very recently, A? has been introduced as a counterpart of ? for anonymous systems. In this paper, we show that the A? failure detector class is strictly weaker than A? (i.e., A? provides less information about process crashes than A?). We also present in this paper the first implementation of A? (hence, we also show that A? is implementable), and, finally, we include the first implementation of consensus in anonymous asynchronous systems augmented with A? and where a majority of processes does not crash.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

In silico identification and characterisation of 17 polymorphic anonymous non-coding sequence markers (ANMs) for red grouse (Lagopus lagopus scotica)

Peer reviewed