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..

Efficient routing on complex networks

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.Comment: 4 pages, 4 figure

On the Particle Data Group evaluation of Psi' and chi_c Branching Ratios

I propose a new evaluation of $\psi'(2S)$ and $\chi_c(1P)$ branching ratios which avoids the correlations affecting the current Particle Data Group evaluation. These correlations explain the apparent technique-dependent discrepancies between the available determinations of the ${\cal B}(\chi_c(1P)\to p\bar p)$ and $\Gamma(\chi_c(1P)\to \gamma\gamma)$ under the hypotesis that the current values of the $\psi'(2S)\to\chi_c(1P)\gamma$ branching ratios are overestimated. In the process I also noticed that Particle Data Group has not restated many of the older measurements, when necessary, for the new value of ${\cal B}(J/\psi\to l^+l^-)$, which significantly affects the evaluation of some relevant $\psi'(2S)$ and $\chi_c(1P)$ exclusive branching ratios.Comment: 13 pages. Revised version. Submitted to Phys. Rev.

Classification in sparse, high dimensional environments applied to distributed systems failure prediction

Network failures are still one of the main causes of distributed systems’ lack of reliability. To overcome this problem we present an improvement over a failure prediction system, based on Elastic Net Logistic Regression and the application of rare events prediction techniques, able to work with sparse, high dimensional datasets. Specifically, we prove its stability, fine tune its hyperparameter and improve its industrial utility by showing that, with a slight change in dataset creation, it can also predict the location of a failure, a key asset when trying to take a proactive approach to failure management

Computerized cognitive training in prostate cancer patients on androgen deprivation therapy: a pilot study

© 2017, Springer-Verlag GmbH Germany, part of Springer Nature. Purpose: Prostate cancer patients who have undergone androgen deprivation therapy (ADT) may experience cognitive impairment, yet there is an unmet need for nonpharmacological interventions to address cognitive impairment in this population. This study examines the feasibility, acceptability, and preliminary efficacy of a home-based computerized cognitive training (CCT) program to treat cancer-related cognitive impairment. Methods: Sixty men who had received ≥ 3 months of ADT were screened for at least mild cognitive or neurobehavioral impairment and randomized to 8 weeks of CCT or usual care. Follow-up assessments occurred immediately post-intervention or equivalent (T2) and 8 weeks later (T3). The acceptability of CCT was also assessed. Results: Feasibility:A priori feasibility thresholds were partially met (i.e., randomization rate \u3e 50%, retention rate \u3e 70% excluding CCT drop-outs, but \u3c 70% for intent-to-treat). Acceptability: Participants were mostly satisfied with CCT and found it somewhat enjoyable, though barriers to uptake existed. Preliminary efficacy: Linear mixed models indicated significant time by group effects favorable to CCT in reaction time (p =.01), but unfavorable to CCT in verbal and visual memory (ps \u3c .05). Memory was temporarily suppressed in the CCT group at T2, but normalized by T3. There was no effect of CCT on self-reported cognitive functioning, neurobehavioral functioning, nor quality of life. Conclusions: This study provides tentative support for the feasibility and acceptability of CCT to treat mild cognitive impairment in ADT patients. CCT had a beneficial effect on reaction time, but temporarily suppressed memory. CCT’s benefits may be limited to a narrow area of functioning. Larger-scale studies are needed