Partial mediation role of self-efficacy between positive social interaction and mental health in family caregivers for dementia patients in Shanghai

We explored the mediation effect of caregiver self-efficacy on the influences of behavioral and psychological symptoms (BPSD) of dementia care recipients (CRs) or family caregivers’ (CGs) social supports (informational, tangible and affectionate support and positive social interaction) on CGs’ mental health. We interviewed 196 CGs, using a battery of measures including demographic data of the dyads, CRs’ dementia-related impairments, and CGs’ social support, self-efficacy and the Medical Outcome Study (MOS) Short-Form (SF-36) Health Survey. Multiple regression analyses showed that gathering information on self-efficacy and managing CG distress self-efficacy were the partial mediators of the relationship between positive social interaction and CG mental health. Managing caregiving distress self-efficacy also partial mediated the impact of BPSD on CG mental health. We discuss implications of the results for improving mental health of the target population in mainland China.

Expression and in vitro functions of the ghrelin axis in endometrial cancer

Ghrelin is a peptide hormone produced in the stomach and a range of other tissues, where it has endocrine, paracrine and autocrine roles in both normal and disease states. Ghrelin has been shown to be an important growth factor for a number of tumours, including prostate and breast cancers. In this study, we examined the expression of the ghrelin axis (ghrelin and its receptor, the growth hormone secretagogue receptor, GHSR) in endometrial cancer. Ghrelin is expressed in a range of endometrial cancer tissues, while its cognate receptor, GHSR1a, is expressed in a small subset of normal and cancer tissues. Low to moderately invasive endometrial cancer cell lines were examined by RT-PCR and immunoblotting, demonstrating that ghrelin axis mRNA and protein expression correlate with differentiation status of Ishikawa, HEC1B and KLE endometrial cancer cell lines. Moreover, treatment with ghrelin potently stimulated cell proliferation and inhibited cell death. Taken together, these data indicate that ghrelin promotes the progression of endometrial cancer cells in vitro, and may contribute to endometrial cancer pathogenesis and represent a novel treatment target.

MöBIUS-α commutative functions and partially coincident functions

The M¨obius transform of Boolean functions is often involved in cryptographic design and analysis. As studied previously, a Boolean function f is said to be coincident if it is identical with its M¨obius transform fμ, i.e., f = fμ...

Calibration functions for estimating soil moisture from GPR dielectric constant measurements

Ground-penetrating radar (GPR) is widely used for assessment of soil moisture variability in field soils. Because GPR does not measure soil water content directly, it is common practice to use calibration functions that describe its relationship with the soil dielectric properties and textural parameters. However, the large variety of models complicates the selection of the appropriate function. In this article an overview is presented of the different functions available, including volumetric models, empirical functions, effective medium theories, and frequency-specific functions. Using detailed information presented in summary tables, the choice for which calibration function to use can be guided by the soil variables available to the user, the frequency of the GPR equipment, and the desired level of detail of the output. This article can thus serve as a guide for GPR practitioners to obtain soil moisture values and to estimate soil dielectric properties.

LCC15-MB : a vimentin-positive human breast cancer cell line from a femoral bone metastasis

The LCC15-MB cell line was established from a femoral bone metastasis that arose in a 29-year-old woman initially diagnosed with an infiltrating ductal mammary adenocarcinoma. The tumor had a relatively high (8%) S-phase fraction and 1/23 positive lymph nodes (LN). Both the primary tumor and LN metastasis were positive for estrogen receptor (ER) and progesterone receptor (PgR), but lacked erbB2 expression. Approximately one year later, the patient presented with a 0.8 cm comedo-type intraductal mammary adenocarcinoma in the left breast that was negative for ER and PgR, but positive for erbB2. Thirty-five months after the initial diagnosis she was treated for acute skeletal metastasis, and stabilized with a hip replacement. At this time, tumor cells were removed from surplus involved bone, inoculated into cell culture, and developed into the LCC15-MB cell line. The bone metastasis was a poorly differentiated adenocarcinoma lacking ER, PgR, and erbB2, characteristics shared by the LCC15-MB cells, although ER can be re-expressed by treatment of the LCC15-MB cells for 5 days with 75 μM 5-aza-2'-deoxycytidine. The LCC15-MB cell line is tumorigenic when implanted subcutaneously in NCr nu/nu mice and produces long-bone metastases after intracardiac injection. Although the bone metastasis from which the LCC15-MB cell line was derived lacked vimentin (VIM) expression, the original primary tumor and lymph node metastasis were strongly VIM positive, as are LCC15-MB cells in vitro and in nude mice. The karyotype and isozyme profiles of LCC15-MB cells are consistent with its origin from a human female, with most chromosome counts in the hypertriploid range. Thirty-two marker chromosomes are present. These cells provide an in vitro/in vivo model in which to study the inter-relationships between ER, VIM, and bone metastasis in human breast cancer.

Predicting positive and negative impacts of cancer among long-term endometrial cancer survivors

OBJECTIVE Although the survival outcomes among women diagnosed with endometrial cancer are very favorable, little is known about the long-term impact of their cancer experience. This study identifies the extent of positive and negative impacts of cancer and factors associated with this, amongst long-term survivors of endometrial cancer. METHODS Australian women diagnosed with endometrial cancer (N=632) were sent questionnaires at the time of diagnosis and 3-5 years later. Hierarchical multiple regression models were used to examine whether a range of variables at diagnosis/treatment predicted subsequent scores on the Impact of Cancer Scale, which examines positive (e.g. health awareness) and negative (e.g. appearance concerns) impacts amongst cancer survivors. RESULTS Overall, women had a higher mean score for the positive than negative impact scales (M=3.5 versus M=2.5, respectively). An intermediate grade of endometrial cancer, a prior diagnosis of cancer and lower levels of education were significant, but weak, predictors of higher scores on the positive impact scale. Higher scores on the negative impact scale were predicted by a higher grade of cancer, poor physical and mental health, a younger age, being single or having lower levels of education. CONCLUSIONS The study demonstrates that factors that predict positive impact in cancer survivors differ to those that predict negative impact, suggesting that interventions to optimize cancer survivors' quality of life will need to be multi-dimensional, and this supports the need for tailored intervention.

Exploring the fundamental theorem of arithmetic in excel 2007

This paper discusses how fundamentals of number theory, such as unique prime factorization and greatest common divisor can be made accessible to secondary school students through spreadsheets. In addition, the three basic multiplicative functions of number theory are defined and illustrated through a spreadsheet environment. Primes are defined simply as those natural numbers with just two divisors. One focus of the paper is to show the ease with which spreadsheets can be used to introduce students to some basics of elementary number theory. Complete instructions are given to build a spreadsheet to enable the user to input a positive integer, either with a slider or manually, and see the prime decomposition. The spreadsheet environment allows students to observe patterns, gain structural insight, form and test conjectures, and solve problems in elementary number theory.

The SOS screen in Arabidopsis: a search for functions involved in DNA metabolism

The SOS screen, as originally described by Perkins et al. (1999), was setup with the aim of identifying Arabidopsis functions that might potentially be involved in the DNA metabolism. Such functions, when expressed in bacteria, are prone to disturb replication and thus trigger the SOS response. Consistently, expression of AtRAD51 and AtDMC1 induced the SOS response in bacteria, even affecting E. coli viability. 100 SOS-inducing cDNAs were isolated from a cDNA library constructed from an Arabidopsis cell suspension that was found to highly express meiotic genes. A large proportion of these SOS+ candidates are clearly related to the DNA metabolism, others could be involved in the RNA metabolism, while the remaining cDNAs encode either totally unknown proteins or proteins that were considered as irrelevant. Seven SOS+ candidate genes are induced following gamma irradiation. The in planta function of several of the SOS-inducing clones was investigated using T-DNA insertional mutants or RNA interference. Only one SOS+ candidate, among those examined, exhibited a defined phenotype: silenced plants for DUT1 were sensitive to 5-fluoro-uracil (5FU), as is the case of the leaky dut-1 mutant in E. coli that are affected in dUTPase activity. dUTPase is essential to prevent uracil incorporation in the course of DNA replication.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

Homogeneous bent functions of degree n in 2n variables do not exist for n>3

We prove that homogeneous bent functions f:GF(2)^2n --> GF(2) of degree n do not exist for n>3. Consequently homogeneous bent functions must have degree 3.

The eight variable homogeneous degree three bent functions

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.

How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are randomised and allow many possible signatures for a single message. In this case, it may be possible to produce a new signature on a previously signed message. Some applications require that this type of forgery also be prevented – this requirement is called strong unforgeability. At PKC2006, Boneh Shen and Waters presented an efficient transform based on any randomised trapdoor hash function which converts a weakly unforgeable signature into a strongly unforgeable signature and applied it to construct a strongly unforgeable signature based on the CDH problem. However, the transform of Boneh et al only applies to a class of so-called partitioned signatures. Although many schemes fall in this class, some do not, for example the DSA signature. Hence it is natural to ask whether one can obtain a truly generic efficient transform based on any randomised trapdoor hash function which converts any weakly unforgeable signature into a strongly unforgeable one. We answer this question in the positive by presenting a simple modification of the Boneh-Shen-Waters transform. Our modified transform uses two randomised trapdoor hash functions.

Lawyering and Positive Professional Identities

Lawyering and Positive Professional Identities aims to help law students successfully navigate the demands of law studies and legal practice through the development of positive professional legal identities. It does this by focusing on the knowledge, skills and attitudes necessary for law students to be motivated and engaged learners, and psychologically healthy individuals. The text will fill an important gap for many law schools seeking to enact the threshold learning outcomes for law by addressing these important topics in their curricula. It is a valuable guide for all law students who wish to maximise their success and chances of thriving at law school and beyond. Positive lawyering knowledge and practice are central themes of this book, with a particular emphasis on lawyers’ roles as upholders of the rule of law, as dispute resolvers and as ethical professionals. Throughout, the authors provide practical, experience-based advice on the development of core skills for legal education and practice.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tfunctions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.