Reexamination of College Student Mental Health docx

Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering, 2006

The replication of experiments is a key undertaking in SE. Successful replications enable a discipline's body of knowledge to grow, as the results are added to those of earlier replications. However, replication is extremely difficult in SE, primarily because it is difficult to get a setting that is exactly the same as in the original experiment. Consequently, changes have to be made to the experiment to adapt it to the new site. To be able to replicate an experiment, information also has to be transmitted (usually orally and in writing) between the researchers who ran the experiment earlier and the ones who are going to replicate the experiment. This article examines the influence of the type of communication there is between experimenters on how successful a replication is. We have studied three replications of the same experiment in which different types of communication were used.

2007

As service-oriented architectures become more important in parallel and distributed computing systems, individual service instance reliability as well as appropriate service redundancy becomes an essential necessity in order to increase overall system availability. This paper focuses on providing redundancy strategies using service-level replication techniques. Based on previous research using symmetric active/active replication, this paper proposes a transparent symmetric active/active replication approach that allows for more reuse of code between individual service-level replication implementations by using a virtual communication layer. Serviceand client-side interceptors are utilized in order to provide total transparency. Clients and servers are unaware of the replication infrastructure as it provides all necessary mechanisms internally. *

2013 International Conference on Computing, Networking and Communications (ICNC), 2013

In this paper we study the problem of assigning users to servers and data replication in a distributed manner for online social networking (OSN) applications. Typical OSN applications such as Facebook and Twitter are built on top of an infrastructure of servers, which handle the users data storage and communications. Thus, for a given user's communication pattern, the loads of the servers depend critically on the assignment of users to servers. A good assignment will reduce the overall load of the system. Furthermore, by replicating data across the servers judiciously, the overall load can also be further reduced. Unfortunately, this optimal assignment and data replication problem is NP-hard. Therefore, we introduce a distributed heuristic algorithm in which the servers perform local computations and exchange information among each other iteratively in such a way that the algorithm converges to a good assignment and replication in terms of reducing the overall system load as well as balancing the loads among the servers. In contrast with a centralized algorithm, a distributed algorithm offers the advantage of balancing the computations among all the servers as well as the ability to naturally adapt to timevarying user's communication patterns. Simulations results show promising performance for the proposed algorithm.

Human Communication Research, 2021

Because political incivility is so consequential and those consequences depend on observers’ perceptions, we must know what Americans perceive as uncivil. Stryker, Conway, and Danielson (2016) conducted one of the first studies addressing this using confirmatory factor analysis on 23 types of potential incivility, but the authors used a local sample representing undergraduates at one southwestern university. Using 20 of their 23 measures and replicating their analyses on a national sample of more than 2000 respondents representing U.S. whites, Blacks, and Latinx, this study finds the same conceptual structure for perceived political incivility with very similar response patterns as Stryker et al. (2016). Perceived political incivility is an overarching construct with three analytically distinct, inter-correlated dimensions: insulting utterances, deception, and behaviors that tend to shut down ongoing and inclusive discussion.

Lecture Notes in Computer Science, 2009

In this paper, we propose a reliable group communication solution dedicated to a data replication algorithm to adapt it to unreliable environments. The data replication algorithm, named Adaptive Data Replication (ADR), has already an adaptiveness mechanism encapsulated in its dynamic replica placement strategy. Our extension of ADR to unreliable environments provides a data replication solution that is adaptive both in terms of replica placement and in terms of request routing. At the routing level, this solution takes the unreliability of the environment into account, in order to maximize reliable delivery of requests. At the replica placement level, the dynamically changing origin and frequency of read/write requests are analyzed, in order to define a set of replica that minimizes communication cost. Performance evaluation shows that this original combination of two adaptive strategies makes it possible to ensure high request delivery, while minimizing communication costs in the system.

2008 Third International Conference on Availability, Reliability and Security, 2008

During the last several years, we have established the symmetric active/active replication model for servicelevel high availability and implemented several proofof-concept prototypes. One major deficiency of our model is its inability to deal with dependent services, since its original architecture is based on the clientservice model. This paper extends our model to dependent services using its already existing mechanisms and features. The presented concept is based on the idea that a service may also be a client of another service, and multiple services may be clients of each other. A high-level abstraction is used to illustrate dependencies between clients and services, and to decompose dependencies between services into respective client-service dependencies. This abstraction may be used for providing high availability in distributed computing systems with complex service-oriented architectures.

ACM SIGPLAN Notices, 2012

Checkpoint-recovery based virtual machine (VM) replication is an attractive technique for accommodating VM installations with high-availability. It provides seamless failover for the entire software stack executed in the VM regardless the application or the underlying operating system (OS), it runs on commodity hardware, and it is inherently capable of dealing with shared memory nondeterminism of symmetric multiprocessing (SMP) configurations. There have been several studies aiming at alleviating the overhead of replication, however, due to consistency requirements, network performance of the basic replication mechanism remains extremely poor. In this paper we revisit the replication protocol and extend it with speculative communication. Speculative communication silently acknowledges TCP packets of the VM, enabling the guest's TCP stack to progress with transmission without exposing the messages to the clients before the corresponding execution state is checkpointed to the backup host. Furthermore, we propose replication aware congestion control, an extension to the guest's TCP stack that aggressively fills up the VMM's replication buffer so that speculative packets can be backed up and released earlier to the clients. We observe up to an order of magnitude improvement in bulk data transfer with speculative communication, and close to native VM network performance when replication awareness is enabled in the guest OS. We provide results of micro-, as well as application-level benchmarks.

Proceedings of the 2009 EDBT/ICDT Workshops on - EDBT/ICDT '09, 2009

17th International Conference on Database and Expert Systems Applications (DEXA'06), 2006

Availability of databases benefits from distributed replication. Each application and user require different degrees of data availability, consistency and integrity. The latter are perceived as competing objectives that need to be reconciled by appropriate replication strategies. We outline work in progress on a replication middleware architecture for distributed databases. It simultaneously maintains several protocols, so that it can be reconfigured on the fly to the actual needs of availability, consistency and integrity of possibly simultaneous applications and users.