Miracle-dz/UniFAR-FTUs huggingface dataset:
American Society of Clinical Oncology/College of American Pathologists guideline recommendations for human epidermal growth factor receptor 2 testing in breast cancer.

PURPOSE To develop a guideline to improve the accuracy of human epidermal growth factor receptor 2(HER2) testing in invasive breast cancer and its utility as a predictive marker. METHODS The American Society of Clinical Oncology and the College of American Pathologists convened an expert panel, which conducted a systematic review of the literature and developed recommendations for optimal HER2 testing performance. The guideline was reviewed by selected experts and approved by the board of directors for both organizations. RESULTS Approximately 20% of current HER2 testing may be inaccurate. When carefully validated testing is performed, available data do not clearly demonstrate the superiority of either immunohistochemistry(IHC) or in situ hybridization (ISH) as a predictor of benefit from anti-HER2 therapy. RECOMMENDATIONS The panel recommends that HER2 status should be determined for all invasive breast cancer. A testing algorithm that relies on accurate, reproducible assay performance, including newly available types of brightfield ISH, is proposed. Elements to reliably reduce assay variation (for example, specimen handling, assay exclusion, and reporting criteria) are specified. An algorithm defining positive, equivocal, and negative values for both HER2 protein expression and gene amplification is recommended: a positive HER2 result is IHC staining of 3 + (uniform, intense membrane staining of 30% of invasive tumor cells), a fluorescent in situ hybridization (FISH) result of more than six HER2 gene copies per nucleus or a FISH ratio (HER2 gene signals to chromosome 17 signals) of more than 2.2; a negative result is an IHC staining of 0 or 1 +, a FISH result of less than 4.0 HER2 gene copies per nucleus, or FISH ratio of less than 1.8. Equivocal results require additional action for final determination. It is recommended that to perform HER2 testing, laboratories show 95% concordance with another validated test for positive and negative assay values. The panel strongly recommends validation of laboratory assay or modifications, use of standardized operating procedures, and compliance with new testing criteria to be monitored with the use of stringent laboratory accreditation standards, proficiency testing, and competency assessment. The panel recommends that HER2 testing be done in a CAP-accredited laboratory or in a laboratory that meets the accreditation and proficiency testing requirements set out by this document.
Addition of Intrathecal Magnesium Sulfate to Bupivacaine for Spinal Anesthesia in Cesarean Section

Background: Spinal anesthesia is widely used for caesarean section. Addition of intrathecal magnesium sulfate to local anesthetics seems to improve the quality of block and prolong the duration of analgesia. Objectives: The present study was designed to examine whether addition of intrathecal magnesium sulfate enhances the analgesic efficacy of intrathecal bupivacaine in patients undergoing cesarean section. Patients and Methods: We conducted a randomized, prospective, double-blind, case-control, clinical trial. Eighty patients were scheduled for cesarean section under spinal anesthesia. The patients were randomly allocated to receive either 10 mg of hyperbaric bupivacaine 0.5% (control group) or 10 mg of hyperbaric bupivacaine 0.5% plus 50 mg magnesium sulfate (case group) intrathecally. Hemodynamic variability, onset and duration of block and duration of analgesia were evaluated. Results: The onset of sensory blockade was delayed in case group compared with control group, and this was statistically significant. The onset of motor blockade had no difference in both groups. The duration of motor blockade was similar. Post-operative analgesia was longer in magnesium sulfate group but the difference was not meaningful. The intraoperative hemodynamic variability showed no significant differences between groups. Conclusions: This study showed that the addition of intrathecal magnesium sulfate to bupivacaine is not desirable in patients undergoing cesarean section due to the delay in the onset of sensory blockade and the lack of significant effects of magnesium on post-operative pain.
Price Discrimination and Quality Improvement

This paper models quality improvements when multiple quality levels can sell, owing to differences in consumers' valuations of quality improvements. Firms can collude to price discriminate, so that consumers with high valuations pay a price premium, while others receive a quality level below the highest available. Imposing minimum quality standards or price ceilings can ensure that only the highest quality level of each product is sold. Such intervention reduces the quality-adjusted price paid by consumers but also reduces the incentives for firms to innovate. When enough consumers have high valuations, such intervention must be welfare reducing, owing to reduced innovation.
Accurate Maximum-Margin Training for Parsing With Context-Free Grammars

The task of natural language parsing can naturally be embedded in the maximum-margin framework for structured output prediction using an appropriate joint feature map and a suitable structured loss function. While there are efficient learning algorithms based on the cutting-plane method for optimizing the resulting quadratic objective with potentially exponential number of linear constraints, their efficiency crucially depends on the inference algorithms used to infer the most violated constraint in a current iteration. In this paper, we derive an extension of the well-known Cocke-Kasami-Younger (CKY) algorithm used for parsing with probabilistic context-free grammars for the case of loss-augmented inference enabling an effective training in the cutting-plane approach. The resulting algorithm is guaranteed to find an optimal solution in polynomial time exceeding the running time of the CKY algorithm by a term, which only depends on the number of possible loss values. In order to demonstrate the feasibility of the presented algorithm, we perform a set of experiments for parsing English sentences.
Comparison of Quebec’s Project Delivery Methods: Relational Contract Law and Differences in Contractual Language

The province of Quebec, Canada, seeks to implement relational alternate project delivery methods to achieve sustainability and energy efficiency in public construction. However, the relational differences between the formal written parts of different delivery methods have yet to be analyzed and understood, as is the case with the relational aspects of contracts and the achievement of sustainable and energy-efficient infrastructure. Using a hermeneutic interpretation of Macneil’s relational contract norms and grounded theory, 26 contracts involving Quebec’s largest public client of vertical infrastructure and representing three different types of project delivery methods (design–bid–build (DBB), design–Build (DB), and construction manager–general contractor/integrated project delivery (CMGC/IPD)) were analyzed using NVivo. It was found that CMGC/IPD is the most relational project delivery method available to Quebec’s public clients, namely because of the public client’s active involvement in the realization process, the increasing complexity of roles, the multitude of common management structures, and the internalization of sustainability measures and conflict resolution. Furthermore, Quebec’s CMGC/IPD was found to be an IPD-ish delivery method, lacking the early involvement of the construction manager and the risk/reward sharing mechanisms necessary to achieve pure IPD status. The findings and theoretical considerations discussed here will help policymakers, contract drafters, and public clients interested in implementing relational contracting practices in public construction projects.
Dynamics of Panax ginseng Rhizospheric Soil Microbial Community and Their Metabolic Function

The bacterial communities of 1- to 6-year ginseng rhizosphere soils were characterized by culture-independent approaches, random amplified polymorphic DNA (RAPD), and amplified ribosomal DNA restriction analysis (ARDRA). Culture-dependent method (Biolog) was used to investigate the metabolic function variance of microbe living in rhizosphere soil. Results showed that significant genetic and metabolic function variance were detected among soils, and, with the increasing of cultivating years, genetic diversity of bacterial communities in ginseng rhizosphere soil tended to be decreased. Also we found that Verrucomicrobia, Acidobacteria, and Proteobacteria were the dominants in rhizosphere soils, but, with the increasing of cultivating years, plant disease prevention or plant growth promoting bacteria, such as Pseudomonas, Burkholderia, and Bacillus, tended to be rare.
Detection of extracellular matrix modification in cancer models with inverse spectroscopic optical coherence tomography

In cancer biology, there has been a recent effort to understand tumor formation in the context of the tissue microenvironment. In particular, recent progress has explored the mechanisms behind how changes in the cell-extracellular matrix ensemble influence progression of the disease. The extensive use of in vitro tissue culture models in simulant matrix has proven effective at studying such interactions, but modalities for non-invasively quantifying aspects of these systems are scant. We present the novel application of an imaging technique, Inverse Spectroscopic Optical Coherence Tomography, for the non-destructive measurement of in vitro biological samples during matrix remodeling. Our findings indicate that the nanoscale-sensitive mass density correlation shape factor D of cancer cells increases in response to a more crosslinked matrix. We present a facile technique for the non-invasive, quantitative study of the micro- and nano-scale structure of the extracellular matrix and its host cells.
ON SOLVING DYNAMIC SHORTEST PATH PROBLEMS

Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic short- est path problem is to determine a path from a specified source node to every other node with minimal to- tal cost, subject to the constraint that the total traverse time is at most T. This problem can be formulated in two ways depending on whether a discrete or continuous representation of time is used. In this paper, we present an O(nT(n+T)) time algorithm for solving the discrete-time version of dynamic shortest path problem.
Cognition and Emotion over twenty-five years

In the 25 years since its foundation, Cognition and Emotion has become a leading psychological journal of research on emotion. Here we review some of the ways in which this has occurred. Questions have included how parallel systems of cognition and emotion can operate in emotion regulation and psychological therapies (including the issue of free will), how the cognitive approach to emotion works, how emotion affects attention, memory, and decision making, and how emotion research is moving beyond the individual mind into the space of the interpersonal.
Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models

When selecting the best suited algorithm for an unknown optimization problem, it is useful to possess some a priori knowledge of the problem at hand. In the context of single-objective, continuous optimization problems such knowledge can be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically identifies properties of a landscape, e.g., the so-called funnel structures, based on an initial sample. In this paper, we extract the relevant features (for detecting funnels) out of a large set of landscape features when only given a small initial sample consisting of 50 x D observations, where D is the number of decision space dimensions. This is already in the range of the start population sizes of many evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used for training the classifier, and the approach is then very successfully validated on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching competition problems.
Function Computation Through a Bidirectional Relay

We consider a function computation problem in a three-node wireless network. Nodes A and B observe two correlated sources <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula>, respectively, and want to compute a function <inline-formula> <tex-math notation="LaTeX">$f(X,Y)$ </tex-math></inline-formula>. To achieve this, nodes A and B send messages to a relay node C at rates <inline-formula> <tex-math notation="LaTeX">$R_{A}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$R_{B}$ </tex-math></inline-formula>, respectively. The relay C then broadcasts a message to A and B at rate <inline-formula> <tex-math notation="LaTeX">$R_{C}$ </tex-math></inline-formula>. We allow block coding and study the achievable region of rate triples under both zero-error and <inline-formula> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula>-error. As a preparation, we first consider a broadcast network from the relay to A and B. A and B have side information <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula>, respectively. The relay node C observes both <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula> and broadcasts an encoded message to A and B. We want to obtain the optimal broadcast rate such that A and B can recover the function <inline-formula> <tex-math notation="LaTeX">$f(X,Y)$ </tex-math></inline-formula> from the received message and their individual side information <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula>, respectively. For this problem, we show equivalence between <inline-formula> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula>-error and zero-error computations–this gives a rate characterization for zero-error computation. As a corollary, this also gives a rate characterization for the relay network under zero error for a class of functions called <italic>component-wise one-to-one functions</italic> when the support set of <inline-formula> <tex-math notation="LaTeX">$p_{XY}$ </tex-math></inline-formula> is full. For the relay network, the zero-error rate region for arbitrary functions is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We then give a single-letter inner bound to this rate region. Furthermore, we extend the graph theoretic ideas to address the <inline-formula> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula>-error problem and obtain a single-letter inner bound.
Automatic Mapping of OWL Ontologies into Java

We present an approach for mapping an OWL ontology into Java. The basic idea is to create a set of Java interfaces and classes from an OWL ontology such that an instance of a Java class represents an instance of a single class of the ontology with most of its properties, classrelationships and restriction-definitions maintained. We note that there exist some fundamental semantic differences between Description Logic (DL) and Object Oriented (OO) systems, primarily related to completeness and satisfiability. We present various ways in which we aim to minimize the impact of such differences, and show how to map a large part of the much richer OWL semantics into Java. Finally, we sketch the HarmonIA framework, which is used for the automatic generation of agent systems from institution specifications, and whose OWL Ontology Creation module was the basis for the tool presented in this paper.
On the Use of Spectral Clustering for Prostate Tissue Characterization

Prostate cancer is the second most diagnosed malignancy in men over the age of fifty. Trans-rectal ultra-sound (TRUS) is among the routine tests that are used for prostate cancer diagnosis as well as for directing prostate biopsy. To identify suspicious cancerous regions, TRUS images are usually segmented manually by an expert radiologist which can be a laborious process. In this paper, we investigate the use of spectral clustering for identifying suspicious cancerous regions in prostate TRUS images. Our preliminary results confirm that there is a high correlation between the desired segmentation and the second smallest eigenvector of the affinity matrix of the TRUS image
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints

Given a constraint satisfaction problem (CSP) on $n$ variables, $x_1, x_2, \dots, x_n \in \{\pm 1\}$, and $m$ constraints, a global cardinality constraint has the form of $\sum_{i = 1}^{n} x_i = (1-2p)n$, where $p \in (\Omega(1), 1 - \Omega(1))$ and $pn$ is an integer. Let $AVG$ be the expected number of constraints satisfied by randomly choosing an assignment to $x_1, x_2, \dots, x_n$, complying with the global cardinality constraint. The CSP above average with the global cardinality constraint problem asks whether there is an assignment (complying with the cardinality constraint) that satisfies more than $(AVG+t)$ constraints, where $t$ is an input parameter. In this paper, we present an algorithm that finds a valid assignment satisfying more than $(AVG+t)$ constraints (if there exists one) in time $(2^{O(t^2)} + n^{O(d)})$. Therefore, the CSP above average with the global cardinality constraint problem is fixed-parameter tractable.
Comparison of success of tracheal intubation using Macintosh laryngoscope-assisted Bonfils fiberscope and Truview video laryngoscope in simulated difficult airway

Background and Aims: Restriction of head and neck movements prevents the alignment of the oral, pharyngeal, and laryngeal axes and increases the incidence of difficult tracheal intubation in patients with cervical spine fractures. Video laryngoscopes have gained an important role in the management of difficult intubation, especially in situations with limited head and neck movements. This study compares the success of intubation using Macintosh laryngoscope assisted Bonfils® fiberscope (ML-BF) with TruviewPCD video laryngoscope (TV) in patients with simulated restricted head and neck movements. Material and Methods: One hundred and fifty-two patients satisfying the inclusion criteria were randomly allocated to two groups of 76 each. Patients were made to lie supine on the table without a pillow and a soft collar was used to restrict head and neck movements. After a standardized premedication-induction sequence, tracheal intubation was done either with ML-BF or TV. Success of intubation, time taken for successful intubation, hemodynamic changes, airway trauma, and postoperative oropharyngeal morbidity were noted. Results: Intubation was successful in all the 76 patients in direct laryngoscopy-Bonfils fiberscope group and 75 out of 76 patients in TV group within the specified time (90 s). The median time taken for successful intubation with TV and ML-BF were 44 (range 26–80) s and 49 (range 28–83) s, respectively. Hemodynamic changes, airway trauma, and postoperative oropharyngeal morbidity were similar in both groups. Conclusion: Both TV and ML-BF are equally effective for successful tracheal intubation in patients with simulated restricted head and neck movements. In cases of difficult laryngeal visualization with routine Macintosh laryngoscope, Bonfils can be used as an adjunct to achieve successful intubation in the same laryngoscopy attempt.
Renovating word vectors to build Chinese sentiment lexicon

Sentiment lexicon is the core of many academic and commercial sentiment analysis system. But compared with the plentiful English sentiment resources, Chinese sentiment lexicon is scarce which limits the application of lexicon-based method in Chinese sentiment analysis. In this work, we proposed a novel architecture to produce Chinese sentiment lexicon. At first, we trained word vectors from distributional information of words in large corpora. The capacity of these word vectors in sentiment analysis is confined because of the noisy information in their feature space. So a feature selection method was used to renovate the word vectors. After that, the renovated word vectors was used with a similarity-based method to produce the Chinese sentiment lexicon. To evaluate the usefulness of our lexicon, both qualitative and quantitative experiments were designed. The results show that it outperforms previously studied lexicons and indicate that our sentiment lexicon could be used as an important resource for sentiment classification tasks.
A PSO-based approach to cooperative foraging tasks of multi-robots in completely unknown environments

Cooperative foraging tasks in unknown environments are fundamentally important in robotics, where the real-time path planning and proper task allocation strategies are desirable for multi-robot cooperation. In this paper, an improved potential field-based PSO (IPPSO) approach is applied to accomplish the cooperative foraging tasks in completely unknown environments, compared to the cases using the PPSO approach. The proposed cooperation strategy for a multi-robot system makes use of the potential field function as the fitness function of PSO, while the added dynamic parameter tuning and district-difference degree can increase the work efficiency, and help the multi-robot system to complete the tasks in complex environments. In the simulation studies, various scenarios are investigated. The effectiveness of the proposed approach is demonstrated by the experiment results.
Attribute-Based Routing in Clustered SNETs

We posit that SNETs are, like early embedded computing systems, hardwired using minimalist techniques to save energy and minimize system cost and thus lack flexibility and reconfigurability more typical of modern computer system design (hardware and software). While the desire to economize energy consumption for system longevity will dictate spartan hardware resources, we believe there is an opportunity to improve flexibility in system operation, especially in data egress and dissemination within the SNET. We seek to enable flexibility and reconfigurability, conserve energy via limiting unnecessary SNET communications. Our proposal relies on the use of attributed data sourced from individual sensor nodes and the use of attribute-based routing via a set of elected and rotated clusterheads. By understanding the mission requirements of the SNET application we can configure routing pathways that are matched to an energy-efficient topology and sleep-wake schedule for participating nodes. Finally, the attributebased routing rules allow reconfigurabilty and convergence to energy conserving states of the SNET during changing SNET application missions. In this paper we describe the core routing function achieved by our proposal and illustrate how it enables a rich set of capabilities not present in current SNET deployments.