Outcome of different treatment mixes in a multidimensional neuropsychological rehabilitation program.

Within a clinical demonstration program, 59 traumatically brain-injured patients were treated with 1 of 3 mixes of treatment. Mix 1 included cognitive remediation (CGR), small-group interpersonal (SGI) communication training, therapeutic community activities, and personal counseling. Mix 2 was similar to Mix 1 but stressed SGI exercises and eliminated CGR. Mix 3 emphasized CGR and eliminated SGI exercises. The efficacy of the treatment mixes was evaluated with performance on neuropsychological tests, improved independence in functional activities, measures of intra- and interpersonal functioning, and vocational outcome. Ss' participation in the program, irrespective of treatment mix, yielded improvements in (1) self-image, (2) quality of interpersonal relatedness and interaction, (3) involvement with others in naturalistic settings, and (4) vocational outcome. Overall, data point to the superiority of the balanced mix (Mix 1) over Mixes 2 and 3. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.     

数据安全治理现状研究与分析

近年来,国内外数据泄露事件频发,大量企业的商业利益、声誉受损。数据安全法律法规相继颁布,监管力度不断升级,企业逐渐意识到数据安全治理的重要性与紧迫性。通过对2021年开展的企业数据安全治理能力评估现状进行整理,总结企业数据安全治理工作在组织建设、人才培养、技术工具等方面的现状与趋势,提供能力提升思路,以供业界参考。     

The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem.     

Renaming and the weakest family of failure detectors

We address the question of the weakest failure detector to circumvent the impossibility of $(2n-2)$ -renaming in a system of up to $n$ participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest family of oracles $\zeta _n$ : every two oracles in $\zeta _n$ are incomparable, and every oracle that allows for solving renaming provides at least as much information about failures as one of the oracles in $\zeta _n$ . As a by product, we obtain one more evidence that renaming is strictly easier to solve than set agreement.     

Probabilistic risk analysis of corrosion associated failures in cast iron water mains

This paper proposes a method using probabilistic risk analysis for application to corrosion associated failures in grey cast iron water mains. External corrosion reduces the capacity of the pipeline to resist stresses. When external stresses exceed the residual ultimate strength, pipe breakage becomes imminent, and the overall reliability of a water distribution network is reduced. Modelling stresses and external corrosion acting on a pipe involves uncertainties inherent in the mechanistic/statistical models and their input parameters. Monte Carlo (MC) simulations were used to perform the probabilistic analysis. The reduction in the factor of safety (FOS) of water mains over time was computed, with a failure defined as a situation in which FOS becomes smaller than 1. The MC simulations yielded an empirical probability density function of time to failure, to which a lognormal distribution was fitted leading to the derivation of a failure hazard function. A sensitivity analysis revealed that the contribution of corrosion parameters to the variability of time to failure was more significant than the combined contributions of all other parameters. Areas where more research is needed are identified.     

Thermodiffusion‐Assisted Pyroelectrics—Enabling Rapid and Stable Heat and Radiation Sensing

Sensors for monitoring temperature, heat flux, and thermal radiation are essential for applications such as electronic skin. While pyroelectric and thermoelectric effects are suitable candidates as functional elements in such devices, both concepts show individual drawbacks in terms of zero equilibrium signals for pyroelectric materials and small or slow response of thermoelectric materials. Here, these drawbacks are overcome by introducing the concept of thermodiffusion‐assisted pyroelectrics, which combines and enhances the performance of pyroelectric and ionic thermoelectric materials. The presented integrated concept provides both rapid initial response upon heating and stable synergistically enhanced signals upon prolonged exposure to heat stimuli. Likewise, incorporation of plasmonic metasurfaces enables the concept to provide both rapid and stable signals for radiation‐induced heating. The performance of the concept and its working mechanism can be explained by ion–electron interactions at the interface between the pyroelectric and ionic thermoelectric materials.     

Enablers and barriers of the multi-user virtual environment for exploratory creativity in architectural design collaboration

Pioneering psychology and co-design research has highlighted the potential that multi-user virtual environment (MUVE) may help architects’ exploratory creativity that is a recursive search to discover an optimal match of novel and appropriate solutions. However, it has been not reported hitherto in what ways MUVE helps or obstructs architects’ exploratory creativity in individual and collaborative modes of collaboration. To investigate this issue, we compared MUVE and sketching media in face-to-face and remote collaboration modes, involving 22 pairs of architecture major students. Based on interview and video-observation, we discovered that (1) in MUVE, anthropomorphic avatars, which other media do not have, enabled individual and collaborative explorations to discover unexpected affordances of new solutions, with evaluation on physical properties and layouts of solutions. In addition, (2) co-presence with collaborator’s avatars enabled inspiration on new ways of problem-solving and puzzle-making through shared design processes and events, with co-evaluation on social aspects of design solutions. (3) Co-presence in a shared environment also allowed mutual co-exploration that promotes emerging creative solutions, with co-modification on design errors. As barriers of MUVE, (4) avatar’s immersion caused inconvenient perception to explore large-scaled environments and track collaborators’ different experiences, but the barriers were not reported in remote collaboration.