Miracle-dz/UniFAR-FTUs huggingface dataset:
“Doing” and “Undoing” Gender: The Meaning and Division of Housework in Same‐Sex Couples

Research on same-sex couples and housework can add nuance to our understanding of gender and housework. This analytic review highlights what can be gained from research on same-sex couples and housework. Specifically, this review reveals how same-sex couples both “do” and “undo” gender through housework. It illustrates how partners in same-sex couples are influenced by heteronormative meaning systems surrounding housework, yet it also points to ways housework can be redefined in the context of same-sex couples. For example, same-sex couples who enact arrangements with more specialized divisions of labor tend to reject the notion that their labor arrangements are imitative or derivative of those of heterosexual couples. Instead, they interpret their arrangements as pragmatic and chosen, as well as uniquely defined by the fact that they are enacted in a same-sex relational context. This review also underscores the need to attend to the social and temporal contexts that shape how same-sex couples give meaning to and enact housework. Finally, this review challenges us to think beyond simplistic classification systems of housework as feminine or masculine, or as gendered or nongendered, and, likewise, to move beyond characterizations of same-sex couples as either “doing” or “undoing” gender.
Tutorial on cutting plane methods for economic dispatch problems

In this article, three economic dispatch examples will be given to show the philosophy and general steps on cutting plane methods (Bender’s decomposition and Branch and Bound (B&B) algorithm). Bender’s decomposition employs duality to generate cuts, while B&B employs linear programming (LP) relaxation to find lower bound for a minimization problem and generate subregions. We will show a continuous variable problem solved by Bender’s decomposition and then show a mixed integer programming (MIP) problem solved by both Bender’s decomposition and B&B algorithm. In addition, demo codes in CVX will be given. This article also serves as an example how to tackle a new area and how to learn a new algorithm or method. Our approach is learning by simple examples.
Surface engineering of microfluidic systems for cellular biochips

In this paper, we describe a rapid and cost-effective hydrophilic surface modification method for PDMS microsystems that is both durable and biocompatible. The method involves a combination of an oxygen plasma treatment followed by coating the activated surfaces with a hydrophilic and biocompatible polymer. In this case, poly(vinylpyrrolidone) (PVP) is used to increase the surface energy of PDMS microchannels and render them hydrophilic. Contact angle experiments show that the surface of the PDMS remains hydrophilic for an extended period of time under dry conditions. Uses for microfluidic and cell chip applications are demonstrated.
Continuous Intercostal Nerve Blocks for Postoperative Pain Relief

OSTOPERATIVE pain following major abP dominal and thoracic surgery frequently results in pulmonary complications because of muscle splinting and hypoventilation, and in spite of the development of new anesthetic agents and technics, about 13 to 25 per cent of all postoperative deaths are still due to pulmonary complications. ' The narcotic drugs used to provide pain relief in the postoperative period may also cause hypoventilation, constant tidal volume ventilation, depression of the sighing mechairism, and obtundation of cough. All these are factors in the production of postoperative atelectasis, pneumonitis, and respiratory insufficiency.
Detection of a Single Genetically Modified Bacterial Cell in Soil by Using Charge Coupled Device-Enhanced Microscopy

Genes encoding bioluminescence from Vibrio harveyi were cloned into Pseudomonas syringae pv. phaseoli-cola, resulting in high levels of bioluminescence. After inoculation of sterile and nonsterile soil slurries with bioluminescent P. syringae, cells could not be identified by conventional light microscopy. However, when we used charge coupled device-enhanced microscopy, bioluminescent single cells were detected easily in dark fields despite masking by soil particulate matter, and in addition, the extent of competition from indigenous soil bacteria could be monitored. The technique which we describe offers great potential for tracking and determining the spatial distribution of genetically marked microorganisms in the environment.
Relationships among Faculty Training, Faculty Degree, Faculty Longevity, and Student Satisfaction in Online Higher Education

With the ever-increasing availability of online -education opportunities, understanding the factors that influence online student satisfaction and success is vital to enable administrators to engage and retain this important stakeholder group. The purpose of this ex-post-facto, nonexperimental quantitative study was to investigate the impact of faculty professional development, faculty degree status, and faculty longevity upon online student satisfaction and success. A large, archived dataset from an online public state university was analyzed. Repeated measures Hierarchical Linear Modeling (HLM) analysis was used to explore changes in student satisfaction over time. Results showed that both training and degree were not significant predictors of student satisfaction. On the contrary, faculty longevity was found to be a predictor of student satisfaction. Recommendations for future research include incorporating qualitative analysis and expanding the study to diverse institutional types to determine whether findings are consistent.
Hierarchical Steiner tree construction in uniform orientations

A hierarchical approach to Steiner tree construction in lambda -geometry is proposed. The algorithm runs in time O(n log n) and the length of the constructed tree is at most ( sigma /cos( pi /2 lambda )) times (for lambda =2, 3/2 times) the length of the optimal Steiner tree where n is the cardinality of the point set and it was recently proved that sigma is (2/ square root 3). How to trade off between the running time of the algorithm and the length of the produced Steiner tree is shown. Given enough time, an optimal Steiner tree will be obtained. The algorithm is extended to construct a Steiner tree of a set of subtrees (i.e., partial trees) and runs in O( lambda N log N) time, where N is the total number of edges of the subtrees. >
Highlights of the Second International Conference on “Immunotherapy in Pediatric Oncology”

The Second International Conference on Immunotherapy in Pediatric Oncology was held in Houston, Texas, USA, October 11–12, 2010, to discuss the progress and challenges that have occurred in cutting edge immunotherapeutic strategies currently being developed for pediatric oncology. Major topics included immune targeting of acute lymphoblastic leukemia and pediatric solid tumors, chimeric antigen receptors (CARs) for hematologic malignancies and solid tumors, enhancing graft-versus-leukemia for pediatric cancers, overcoming hurdles of immunotherapy, strategies to active the innate immune system, and moving immunotherapy beyond phase I studies. Significant progress has been made in the last 2 years both in the development of novel immunobiologics such as CARs, and in establishing survival benefits of an anti-GD2 monoclonal antibody in randomized studies. Although there is much excitement going forward, a great deal of laboratory and regulatory challenges lie ahead in improving the efficacy of each of these modalities as well as getting them to patients in a timely and cost-effective fashion. The resulting discussions will hopefully lead to new collaborations and insight for further translational and clinical studies.
Weighted weak-type inequalities and a conjecture of Sawyer

In 1985 Sawyer [15] proved the following weighted weak-type inequality for the Hardy-Littlewood maximal function on R: for all u, v ∈ A1, uv { x ∈ R : M(fv)(x)v(x)−1 > t } ≤ C t ∫ R |f(x)|u(x)v(x) dx. He conjectured that the same inequality held for the Hilbert transform. We give a positive answer to this conjecture. We do so by showing that these inequalities extend to the Hardy-Littlewood maximal function and Calderón-Zygmund operators in R, and hold for a larger class of weights. We also extend to higher dimensions the related results of Muckenhoupt and Wheeden in [14]. Our proof uses extrapolation arguments based on techniques developed in [5]; as a consequence we get vector-valued extensions of our results with no extra work. To appear in Int. Math. Res. Not.
The summary of diabetes self-care activities measure: results from 7 studies and a revised scale.

OBJECTIVE To review reliability, validity, and normative data from 7 different studies, involving a total of 1,988 people with diabetes, and provide a revised version of the Summary of Diabetes Self-Care Activities (SDSCA) measure. RESEARCH DESIGN AND METHODS The SDSCA measure is a brief self-report questionnaire of diabetes self-management that includes items assessing the following aspects of the diabetes regimen: general diet, specific diet, exercise, blood-glucose testing, foot care, and smoking. Normative data (means and SD), inter-item and test-retest reliability, correlations between the SDSCA subscales and a range of criterion measures, and sensitivity to change scores are presented for the 7 different studies (5 randomized interventions and 2 observational studies). RESULTS Participants were typically older patients, having type 2 diabetes for a number of years, with a slight preponderance of women. The average inter-item correlations within scales were high (mean = 0.47), with the exception of specific diet; test-retest correlations were moderate (mean = 0.40). Correlations with other measures of diet and exercise generally supported the validity of the SDSCA subscales (mean = 0.23). CONCLUSIONS There are numerous benefits from standardization of measures across studies. The SDSCA questionnaire is a brief yet reliable and valid self-report measure of diabetes self-management that is useful both for research and practice. The revised version and its scoring are presented, and the inclusion of this measure in studies of diabetes self-management is recommended when appropriate.
A parallel hybrid genetic algorithm for multiple protein sequence alignment

This paper presents a parallel hybrid genetic algorithm (GA) for solving sum-of-pairs multiple protein sequence alignment. The method is based on a multiple population GENITOR-type GA and involves local search heuristics. It is then extended to parallel to exploit the benefit of a multiprocessor system. Benchmarks from the BAliBASE library are used to validate the method.
Analysis and Modeling of MapReduce ’ s Performance on Hadoop YARN

With the rapid growth of technology, scientists have realized the challenge of efficiently analyzing large data sets since the beginning of 21 century. Increases in data volume and data complexity shift scientists’ focus to parallel, distributed algorithms running on clusters. In 2004, Jeffrey Dean and Sanjay Ghemawat from Google introduced a new programming model to store and process large data sets, called MapReduce[2]. Apache Hadoop, an opensource software framework, which uses MapReduce as its data-processing layer, was developed at Yahoo as early as 2006 and evolved to a stable platform by 2011. Although Hadoop has been widely used in industry, its performance characteristics are not well understood. This paper, following Hadoop’s workflow, analyzes the factors that influence the running time of each phase in Hadoop execution. Given those factors, our goal is to model the performance of MapReduce applications.
Cell-free synthesis of mouse mammary tumor virus Pr77 from virion and intracellular mRNA

Mouse mammary tumor virus (MuMTV) was purified from two cell lines (GR and Mm5MT/c1), and the genomic RNA was isolated and translated in vitro in cell-free systems derived from mouse L cells and rabbit reticulocytes. The major translation product in both systems was a protein with the molecular weight 77,000. Several other products were also detected, among them a 110,000-dalton and in minor amounts a 160,000-dalton protein. All three polypeptides were specifically immunoprecipitated by antiserum raised against the major core protein of MuMTV (p27), but they were not precipitated by antiserum against the virion glycoprotein gp52. Analysis of the in vitro products by tryptic peptide mapping established their relationship to the virion non-glycosylated structural proteins. The 77,000-dalton polypeptide was found to be similar, if not identical, to an analogous precursor isolated from MuMTV-producing cells. Peptide mapping of the 110,000-dalton protein shows that it contains all of the methionine-labeled peptides found in the 77,000-dalton protein plus some additional peptides. We conclude that the products synthesized in vitro from the genomic MuMTV RNA are related to the non-glycosylated virion structural proteins. Polyadenylic acid-containing RNA from MuMTV-producing cells also directed the synthesis of the 77,000-dalton polypeptide in the L-cell system. If this RNA preparation was first fractionated by sucrose gradient centrifugation the 77,000-dalton protein appeared to be synthesized from mRNA with a sedimentation coefficient between 25 and 35S.
Fundamental lower bound for node buffer size in intermittently connected wireless networks

We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite network capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability p to be inactive during each time slot, there exists a critical value pc(λ) for this probability from a percolation-based perspective. When p &#60; pc(λ), the network is in the supercritical case, and there is an achievable lower bound for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If p > pc(λ), the network is in the subcritical case, and there is a tight lower bound Θ(√n)for buffer occupation, where n is the number of nodes in the network.
A Modified Alkaline Comet Assay for Measuring DNA Repair Capacity in Human Populations

Abstract Trzeciak, A. R. , Barnes, J. and Evans, M. K. A Modified Alkaline Comet Assay for Measuring DNA Repair Capacity in Human Populations. Radiat. Res. 169, 110–121 (2008). Use of the alkaline comet assay to assess DNA repair capacity in human populations has been limited by several factors, including lack of methodology for use of unstimulated cryopreserved peripheral blood mononuclear cells (PBMCs), insufficient control of interexperimental variability, and limited analysis of DNA repair kinetics. We show that unstimulated cryopreserved PBMCs can be used in DNA repair studies performed using the comet assay. We have applied data standardization for the analysis of DNA repair capacity using negative and positive internal standards as controls for interexperimental variability. Our standardization procedure also uses negative controls, which provides a way to minimize the interference of interindividual variation in baseline DNA damage levels on DNA repair capacity measurements in populations. DNA repair capacity was assessed in a small human cohort using the parameters described in the literature including initial DNA damage, half-time of DNA repair, and residual DNA damage after 30 and 60 min. We have also introduced new DNA repair capacity parameter, initial rate of DNA repair. There was no difference in DNA repair capacity between fresh and cryopreserved PBMCs when measured by the Olive tail moment and tail DNA. The use of DNA repair capacity parameters in assessment of fast and slow single-strand break repair components is discussed.
SimpleTrPPI: A simple method for transferring knowledge between interaction networks for PPI prediction

Maps of protein-protein interactions (PPIs) are essential to uncover cellular processes and metabolic processes in a cell. However, various high-throughput biological experiments are time-consuming and labor-intensive, resulting in interactions of high false positive and false negative rates. The fact that most interaction networks remain sparse and incomplete motivates scientists to develop computational methods to predict protein-protein interactions accurately and automatically. However, state-of-the-art prediction algorithms cannot make satisfactory predictions. In this paper, we propose a simple yet effective approach SimpleTrPPI, to improve the accuracy of predicting protein-protein interactions in the target PPI network with the aid of another source PPI network. We attempt to transfer and borrow useful knowledge from the source PPI network using similarities of protein nodes between two protein interaction networks. Similarities are computed taking both protein sequence similarities and topological structures of protein networks into account. Two protein-protein interaction networks, Helicobacter pylori (target network) and Human (source network), are used to verify the feasibility of our proposed method. Our experimental results show that SimpleTrPPI can achieve more than 5% accuracy improvement compared to the baseline methods.
Port-controlled Hamiltonian optimal control of induction motor system for electric vehicles

A port-controlled Hamiltonian optimal control scheme for electric vehicle induction motor drives is presented in this paper. First, a stabilization controller is designed by using the method of interconnection and damping assignment based on the dissipative Hamiltonian model of the electric vehicle drive system. Then, an optimal tracking controller is designed by solving a state dependent Riccati equation for the Hamiltonian error system. Finally, the theoretical proof is provided and the simulation on the optimal controller is carried out. Both of them show that the controller proposed in the paper works well in optimal tracking of induction motor for electric vehicle.
Kinetics of the Cell Cycle of Saccharomyces cerevisiae a

Growth and product formation of populations of microorganisms have traditionally been described by nonsegregated models that neglect cell-to-cell variability. In this approach, the behavior of the cell population as a whole is approximated by that of a cell with average properties. Frequently, a mechanistic basis, suggested by the knowledge that is available on the biology of single cells, is used for constructing such models. However, the validity of such an approach is questionable, as cell populations are generally heterogeneous, to a large extent because of the operation of the cell cycle. It is well known that the composition of cells, particularly that of eukaryotic cells, changes both spatially and with cell cycle age. ' Little, however, is known about the dynamics of these changes that presumably play a central role in the control and regulation of the growth process as suggested by recent molecular biological discoveries. * Whereas exponentially growing cell populations must on average double all cellular constituents within a constant doubling time, it is still not known how individual cells accomplish the complicated task of replicating themselves. It is not uncommon to accept that yeast cells, as well as other eukaryotic cells, grow exponentially throughout the cell cycle in terms of protein ~ o n t e n t . ~ This is supported by experimental data that indicate first-order kinetics for protein synthes ~ s ; ~ however, several studies have indicated that the situation is more complicated.s Although the theoretical framework for a segregated treatment of growing cell populations has been developed in p r i n ~ i p l e , ~ . ~ little effort has been made in the past to apply the theory for describing the growth dynamics of microbial populations. From an engineering perspective, this population dynamics represents the link between events occurring in individual cells and the performance of the bioreactor because the overall productivity depends on the contribution made by each individual. The essential elements in the description of cell populations at this level are (i) information on the distribution of states of the cells in the entire population, (ii) knowledge of the pattern of rates at which the state of the cells changes during the
Web Services Matchmaking Based on a Partial Ontology Alignment

The fast development and the huge number of existing web services have raised the problem of the urgent need for matchmaking mechanisms. However state-of-the-art matchmakers are unsuitable for locating web services that use different ontologies. This aspect is important since it is not realistic to assume that Web services will always be defined by the same ontology, as the Web service requester and provider operate independently, each defines their own ontologies to describe their services. This is an emergent research issue that has not been well addressed. This work is a contribution to achieve semantic interoperability in a multi-ontology environment. This paper describes a Web service multi-ontology matchmaker for SAWSDL services, called SAWSDL-MOM which locates web services that use different ontologies. The matchmaker engine incorporates a novel partial ontology alignment algorithm with syntax, linguistic and original structural matchers. In determining the 1:1 mappings the Hungarian algorithm is used. Finally a matchmaking strategy is utilized in finding the score of each service. Experimental evaluation and comparison provide strong evidence that SAWSDL-MOM can significantly improve results, achieve better interoperability and scalability.
Clinical Characteristics and Outcomes of Patients with Primary Signet-Ring Cell Carcinoma of the Urinary Bladder

Objective: The aim of this study was to examine the epidemiology, natural history, treatment pattern and predictors of long-term survival of patients with signet-ring cell carcinoma (SRCC) of the urinary bladder based on the analysis of the national Surveillance, Epidemiology, and End Results (SEER) database. Methods and Results: In total, 230 patients with pathologically confirmed SRCC of the urinary bladder were identified between 1973 and 2004. The mean age was 65 ± 13 years. Overall, 75.7% of the patients had a poorly differentiated or undifferentiated histology grade, 26.5% presented with metastatic disease, 59 (25.7%) underwent transurethral resection for bladder tumor only and 107 (46.5%) had partial or radical cystectomy. The 1-, 3- and 10-year cancer-specific survival rates were 66.8, 40.6 and 25.8%, respectively. Using multivariable Cox proportional hazard model, age (HR 1.024; p = 0.004), stage (distant vs. local, HR 6.2; p < 0.001) and cystectomy (HR 0.53; p = 0.002) were identified as independent predictors for cancer-specific survival. Conclusions: Receipt of cystectomy was strongly associated with improved survival in the patients with SRCC of urinary bladder. However, many patients with localized tumors did not receive potentially curative cystectomy. Further studies to address the barriers to the delivery of appropriate care to these patients are warranted.