Similarity in cognitive complexity and attraction to friends and lovers: Experimental and correlational studies

Abstract OnlyTwo studies are reported examining whether similarities in cognitive complexity foster different forms of interpersonal attraction. Study 1 provided an experimental test of the hypothesis that perceivers would be more attracted to targets with similar levels of complexity than to targets with dissimilar levels of complexity. Participants read interpersonal impressions reflecting low and high levels of cognitive complexity and completed 3 assessments of attraction (social, task, and intellectual) to the source of the impressions. As predicted, there were significant interactions between perceiver complexity and target complexity such that high-complexity perceivers were more attracted to high-complexity targets than were low-complexity perceivers, whereas low-complexity perceivers were more attracted to low-complexity targets than were high-complexity perceivers. Unexpectedly, however, low-complexity perceivers were more attracted to a high-complexity target than a low-complexity target. Study 2 examined the effects of similarities in cognitive complexity on attraction among 126 pairs of dating partners. Partners having similar levels of cognitive complexity expressed significantly greater intellectual attraction to one another than partners having dissimilar levels of cognitive complexity

A Milking Procedure for the Diary Herd.

8pg

Role of Process Control in Improving Space Vehicle Safety A Space Shuttle External Tank Example

Developing a safe and reliable space vehicle requires good design and good manufacturing, or in other words "design it right and build it right". A great design can be hard to build or manufacture mainly due to difficulties related to quality. Specifically, process control can be a challenge. As a result, the system suffers from low quality which leads to low reliability and high system risk. The Space Shuttle has experienced some of those cases, but has overcome these difficulties through extensive redesign efforts and process enhancements. One example is the design of the hot gas temperature sensor on the Space Shuttle Main Engine (SSME), which resulted in failure of the sensor in flight and led to a redesign of the sensor. The most recent example is the Space Shuttle External Tank (ET) Thermal Protection System (TPS) reliability issues that contributed to the Columbia accident. As a result, extensive redesign and process enhancement activities have been performed over the last two years to minimize the sensitivities and difficulties of the manual TPS application process

Cotton Irrigation in the Lower Rio Grande Valley.

16 p

Hardpan Formation In Coarse and Medium-textured Soils In the Lower Rio Grande Valley of Texas.

12 p

Programmable access-controlled and generic erasable PUF design and its applications

Physical unclonable functions (PUFs) have not only been suggested as a new key storage mechanism, but—in the form of so-called strong PUFs—also as cryptographic primitives in advanced schemes, including key exchange, oblivious transfer, or secure multi-party computation. This notably extends their application spectrum, and has led to a sequence of publications at leading venues such as IEEE S&P, CRYPTO, and EUROCRYPT in the past. However, one important unresolved problem is that adversaries can break the security of all these advanced protocols if they gain physical access to the employed strong PUFs after protocol completion. It has been formally proven that this issue cannot be overcome by techniques on the protocol side alone, but requires resolution on the hardware level—the only fully effective known countermeasure being so-called erasable PUFs. Building on this work, this paper is the first to describe a generic method of how any given silicon strong PUF with digital CRP-interface can be turned into an erasable PUF. We describe how the strong PUF can be surrounded with a trusted control logic that allows the blocking (or “erasure”) of single CRP. We implement our approach, which we call “GeniePUF,” on FPGA, reporting detailed performance data and practicality figures. Furthermore, we develop the first comprehensive definitional framework for erasable PUFs. Our work so re-establishes the effective usability of strong PUFs in advanced cryptographic applications, and in the realistic case, adversaries get access to the strong PUF after protocol completion. As an extension to earlier versions of this work, we also introduce a generalization of erasable PUFs in this paper, which we call programmable access-controlled PUFs (PAC PUFs). We detail their definition, and discuss various exemplary applications of theirs

Cotton Irrigation in the Lower Rio Grande Valley.

16 p