The access control double bind: how everyday interfaces regulate access and privacy, enable surveillance, and enforce identity.

Access controls are an inescapable and deceptively mundane requirement for accessing digital applications and platforms. These systems enable and enforce practices related to access, ownership, privacy, and surveillance. Companies use access controls to dictate and enforce terms of use for digital media, platforms, and technologies. The technical implementation of these systems is well understood. However, this paper instead uses digital game software and platforms as a case study to analyze the broader socio-technical, and often inequitable, interactions these elements regulate across software systems. Our sample includes 200 digital games and seven major digital gaming platforms. We combine close reading and content analysis to examine the processes of authentication and authorization within our samples. While the ubiquity of these systems is a given in much academic and popular discourse, our data help empirically ground this understanding and examine how these systems support user legibility and surveillance, and police identities in under-examined ways. We suggest changes to the policies and practices that shape these systems to drive more transparent and equitable design

Paramecium: An Extensible Object-Based Kernel

In this paper we describe the design of an extensible kernel, called Paramecium. This kernel uses an object-based software architecture which together with instance naming, late binding and explicit overrides enables easy reconfiguration. Determining which components reside in the kernel protection domain is up to the user. An certification authority or one of its delegates certifies which components are trustworthy and therefore permitted to run in the kernel protection domain. These delegates may include validation programs, correctness provers, and system administrators. The main advantage of certifications is that it can handle trust and sharing in a non-cooperative environment

An Object Model for Flexible Distributed Systems

this paper we describe a new model for constructing operating systems and applications in an integrated fashion. Compared to current approaches we provide high-level primitives for supporting distributed and parallel applications. We also provide the flexibility to configure both applications and kernels to only include the functionality that is actually used. The model we describe is based on objects. Objects are used to structure both applications programs and operating system kernels. They also provide the application interface to the operating system kernel, and access to hardware devices for both kernels and applications. By providing structuring mechanisms for large (distributed) objects, we believe that applications will be are easier to build. At the same time we provide flexibility by allowing extensions of operating system kernels and applications with new objects at run time[8], and by providing a way to bind to objects dynamically. An important aspect of a distributed system is the scalability of the system [6]. A scalable system should not depend on centralized resources or on algorithms that need global information. At the same time, a flexible system can use different algorithms depending on the situation. For example, the use of broadcasting and multicasting on a local Ethernet can be quite effective but should be avoided on a world wide scale. In this paper we discuss an object model that provides two kinds of objects: local objects and distributed objects. In Section 2 we describe the nondistributed (local) objects, followed by distributed objects in Section 3. We compare our work to that of others in Section 4. 2 Local object

Towards Object-based Wide Area Distributed Systems

In order to facilitate the construction of wide area distributed systems, it is necessary that we adopt a model that simplifies application development. In this position paper we advocate an object-based approach. Our approach allows for flexibility because many of the technical details of distribution, such as communication protocols, consistency rules, etc. can be hidden behind the objects' interfaces. In addition, we allow distributed objects to offer alternative implementations for an interface. A client may choose the most suitable implementation. We discuss the use of distributed objects as the means to this end, and compare our approach to existing ones. 1 Introduction Wide area distributed applications pose varying demands on the underlying operating systems, often making the development of the application itself a difficult task. For example, development of distributed applications often requires the following: ffl Support for expressing communication at a sufficiently high..

Experience with burdens of diabetes device use that affect uptake and optimal use in people with type 1 diabetes

Diabetes technology continues to advance, with more individuals with type 1 diabetes (T1D) adopting insulin pumps, continuous glucose monitoring (CGM), and automated insulin delivery (AID) systems that integrate real-time glucose data with an algorithm to assist with insulin dosing decisions. These technologies are linked with benefits to glycemic outcomes (e.g. increased time in target range), diabetes management behaviors, and quality of life. However, current devices and systems are not without barriers and hassles for the user. The intent of this review is to describe the personal challenges and reactions that users experience when interacting with current diabetes technologies, which can affect their acceptance and motivation to engage with their devices. This review will discuss user experiences and strategies to address three main areas: (i) the emotional burden of utilizing a wearable device; (ii) the perceived and experienced negative social consequences of device use; and (iii) the practical challenges of wearing devices

Concurrent Computing with Shared Replicated Memory

The behavioural theory of concurrent systems states that any concurrent system can be captured by a behaviourally equivalent concurrent Abstract State Machine (cASM). While the theory in general assumes shared locations, it remains valid, if different agents can only interact via messages, i.e. sharing is restricted to mailboxes. There may even be a strict separation between memory managing agents and other agents that can only access the shared memory by sending query and update requests to the memory agents. This article is dedicated to an investigation of replicated data that is maintained by a memory management subsystem, whereas the replication neither appears in the requests nor in the corresponding answers. We show how the behaviour of a concurrent system with such a memory management can be specified using concurrent communicating ASMs. We provide several refinements of a high-level ground model addressing different replication policies and internal messaging between data centres. For all these refinements we analyse their effects on the runs such that decisions concerning the degree of consistency can be consciously made.Comment: 23 page

Hot and repulsive traffic flow

We study a message passing model, applicable also to traffic problems. The model is implemented in a discrete lattice, where particles move towards their destination, with fluctuations around the minimal distance path. A repulsive interaction between particles is introduced in order to avoid the appearance of traffic jam. We have studied the parameter space finding regions of fluid traffic, and saturated ones, being separated by abrupt changes. The improvement of the system performance is also explored, by the introduction of a non-constant potential acting on the particles. Finally, we deal with the behavior of the system when temporary failures in the transmission occurs.Comment: 22 pages, uuencoded gzipped postscript file. 11 figures include

Electromagnetic form factors in the J/\psi mass region: The case in favor of additional resonances

Using the results of our recent analysis of e^+e^- annihilation, we plot the curves for the diagonal and transition form factors of light hadrons in the time-like region up to the production threshold of an open charm quantum number. The comparison with existing data on the decays of J/\psi into such hadrons shows that some new resonance structures may be present in the mass range between 2 GeVand the J/\psi mass. Searching them may help in a better understanding of the mass spectrum in both the simple and a more sophisticated quark models, and in revealing the details of the three-gluon mechanism of the OZI rule breaking in K\bar K channel.Comment: Formulas are added, typo is corrected, the text is rearranged. Replaced to match the version accepted in Phys Rev