Miracle-dz/UniFAR-FTUs huggingface dataset:
Intraoperative qRT-PCR for Detection of Lymph Node Metastasis in Head and Neck Cancer

Purpose: Sentinel node biopsy (SNB) has been shown to accurately stage the regional lymphatics in oral carcinoma. However, intraoperative pathology is only moderately sensitive and final pathology takes several days to complete. The purpose of this study was to develop a rapid, automated, and quantitative real-time PCR (qRT-PCR) assay that can match final pathology in an intraoperative time frame. Experimental Design: Four hundred forty-eight grossly tumor-negative lymph nodes were evaluated for expression of 3 markers [PVA (pemphigus vulgaris antigen), PTHrP (parathyroid hormone-related protein), and TACSTD1 (tumor-associated calcium signal transducer 1)]. Conformity of metastasis detection by qRT-PCR was determined using hematoxylin and eosin and immunohistochemistry staining as the gold standard. PVA and TACSTD1 were then multiplexed with β-glucuronidase to develop a rapid, automated single-tube qRT-PCR assay using the Cepheid GeneXpert system. This assay was used to analyze 103 lymph nodes in an intraoperative time frame. Results: Four hundred forty-two nodes produced an informative result for both qRT-PCR and pathologic examination. Concordance of qRT-PCR for individual markers with final pathology ranged from 93% to 98%. The best marker combination was TACSTD1 and PVA. A rapid, multiplex assay for TACSTD1 and PVA was developed on the Cepheid GeneXpert and demonstrated an excellent reproducibility and linearity. Analysis of 103 lymph nodes demonstrated 94.2% accuracy of this assay for identifying positive and negative nodes. The average time for each assay to yield results was 35 minutes. Conclusions: A rapid, automated qRT-PCR assay can detect lymph node metastasis in head and neck cancer with high accuracy compared to pathologic analysis and may be more accurate than intraoperative pathology. Combined, SNB and rapid qRT-PCR could more appropriately guide surgical treatment of patients with head and neck cancer. Clin Cancer Res; 17(7); 1858–66. ©2011 AACR.
Customer order dependent supplier selection

This paper develops a multi-criteria decision making (MCDM) model for a manufacturing company to select suppliers based on customer orders. A customer order dependent weighting method is developed to determine the weights of the supplier selection criteria. This is achieved by modeling the relationship between the customer order factors and supplier selection criteria, using a knowledge base with if-then rules. With the elicited selection criteria weights, an MCDM model is used to select among suitable suppliers for a given customer order. An empirical study on an auto parts manufacturing company is conducted to demonstrate the effectiveness of the model. The customer order dependent weighting method provides significant insights in addressing the supplier selection problem of a supply chain.
Classification of German Newspaper Comments

Online news has gradually become an inherent part of many people’s every day life, with the media enabling a social and interactive consumption of news as well. Readers openly express their perspectives and emotions for a current event by commenting news articles. They also form online communities and interact with each other by replying to other users’ comments. Due to their active and significant role in the diffusion of information, automatically gaining insights of these comments’ content is an interesting task. We are especially interested in finding systematic differences among the user comments from different newspapers. To this end, we propose the following classification task: Given a news comment thread of a particular article, identify the newspaper it comes from. Our corpus consists of six well-known German newspapers and their comments. We propose two experimental settings using SVM classifiers build on commentand article-based features. We achieve precision of up to 90% for individual newspapers.
Generalized Linear Mixed Models for Ratemaking: A Means of Introducing Credibility into a Generalized Linear Model Setting

GLMs that include explanatory classification variables with sparsely populated levels assign large standard errors to these levels but do not otherwise shrink estimates toward the mean in response to low credibility. Accordingly, actuaries have attempted to superimpose credibility on a GLM setting, but the resulting methods do not appear to have caught on. The Generalized Linear Mixed Model (GLMM) is yet another way of introducing credibility-like shrinkage toward the mean in a GLM setting. Recently available statistical software, such as SAS PROC GLIMMIX, renders these models more readily accessible to actuaries. This paper offers background on GLMMs and presents a case study displaying shrinkage towards the mean very similar to Buhlmann-Straub credibility.
Se p 20 03 3-dimensional Cauchy-Riemann structures and 2 nd order ordinary differential equations

The equivalence problem for second order ODEs given modulo point transformations is solved in full analogy with the equivalence problem of nondegenerate 3-dimensional CR structures. This approach enables an analog of the Feffereman metrics to be defined. The conformal class of these (split signature) metrics is well defined by each point equivalence class of second order ODEs. Its conformal curvature is interpreted in terms of the basic point invariants of the corresponding class of ODEs.
An Effective Method for Foreground Segmentation of Video

In this paper, we propose a novel foreground segmentation approach for applications using static cameras. The foreground segmentation is modeled as an energy function optimum process, where energy function is based on Markov Random Field (MRF) and efficiently optimized by Gibbs sampling. The essence of our method is that we fuse four foreground/background models based on color and texture. This allows composing a robust likelihood term that not only reflects the appearance of foreground/background, but also models the shadow removal process, together with a spatial contrast term and a better temporal persistence term, which achieves a more accurate segmentation. This method has been run on both indoor and outdoor sequences, and the results have proved its effectiveness.
Effect of Plyometric Training on Handspring Vault Performance and Functional Power in Youth Female Gymnasts

This study aimed to determine the effect of plyometric training (PT) when added to habitual gymnastic training (HT) on handspring vault (HV) performance variables. Twenty youth female competitive gymnasts (Age: 12.5 ± 1.67 y) volunteered to participate and were randomly assigned to two independent groups. The experimental plyometric training group (PTG) undertook a six-week plyometric program, involving two additional 45 min PT sessions a week, alongside their HT, while the control group (CG) performed regular HT only. Videography was used (120 Hz) in the sagittal plane to record both groups performing three HVs for both the baseline and post-intervention trials. Furthermore, participants completed a countermovement jump test (CMJ) to assess the effect of PT on functional power. Through the use of Quintic biomechanics software, significant improvements (P < 0.05) were found for the PTG for run-up velocity, take-off velocity, hurdle to board distance, board contact time, table contact time and post-flight time and CMJ height. However, there were no significant improvements on pre-flight time, shoulder angle or hip angle on the vault for the PTG. The CG demonstrated no improvement for all HV measures. A sport-specific PT intervention improved handspring vault performance measures and functional power when added to the habitual training of youth female gymnasts. The additional two hours plyometric training seemingly improved the power generating capacity of movement-specific musculature, which consequently improved aspects of vaulting performance. Future research is required to examine the whether the improvements are as a consequence of the additional volume of sprinting and jumping activities, as a result of the specific PT method or a combination of these factors.
A Tight Bound on Time Complexity of Mutual Exclusion

In distributed shared memory multiprocessors, remote memory accesses generate processor-tomemory trac which may result in a bottleneck. It is therefore important to design algorithms that minimize the number of remote memory accesses. We establish a lower bound of 3 on remote access time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general read-modify-write primitive. Since a general read-modify-write primitive is a generalization of all atomic primitives that access at most one shared variable, our lower bound holds for any set of such primitives. Furthermore, this lower bound is tight because it matches the upper bound of Huang’s algorithm proposed in 1999.
OPTIMIZATION OF DATABASE CAPABILITY IN THE E-GOVERNMENTAL SPATIAL AIDED DECISION-MAKING SYSTEM

: E-governmental Spatial Aided Decision-making System based on GIS and DSS is a representative paradigm in the fields of e-government application.Oracle9i database is adopted is an important aspect of system application. It is a big and complicated run database system whose run efficiency is of great importance to system capability. There are lots of methods of optimization for oracle9i database. This paper proposed some optimizational principles and methods of oracle9i database capability in the aspects of database structure, SQL Sentence and memory assignation, etc. And the system capability has been enhanced to comparatively great extent by using these above-mentioned methods of optimizing database during the course of system application. At last, this paper gave some integrated and further conclusion about optimization of oracle9i database.
Price/cooling aware and delay sensitive scheduling in geographically distributed data centers

Servers in data centers consume large amount of energy which increase the operational cost for cloud service providers, that spend a major portion of their revenue to pay bills due to inefficient workload assignment and wastage of resources. In order to minimize the operational cost of data centers, it is essential to optimize the scheduling of the jobs. In this paper, we address the problem of inefficient cooling system, SLA violations due to network delays and processing delays in geographically distributed data centers. We propose scheduling algorithms that aim to minimize the cooling cost by exploiting the temperature variations within the data centers and electricity cost by taking advantage of time-space-varying fluctuation of electricity prices. SLA violations are aimed to be minimized by assigning jobs considering deadlines, network delays and queuing delays. Experiments conducted on CloudSim show that price/cooling aware and delay sensitive scheduling reduces the overall cost by 22% as compared to random scheduling.
Limits in FIR subband beamforming for spatially spread near-field speech sources

This paper analyses optimal subband beamforming performance mainly aimed at speech enhancement and acoustic echo suppression for personal communication devices, personal computers and wireless cellular telephones. The focus is on theoretical limits of finite impulse response (FIR) beamformers for spatially spread sources in the array near-field. Performance of the Wiener solution is compared to the direct maximization of the array gain for different lengths of the FIR filters and different source interference spreads. The evaluation is performed individually in subbands with constant increasing logarithmic bandwidth. Results show that the difference between the Wiener solution and the direct array gain maximization is less than 2 dB in the measure of Signal-to-Noise plus Interference Ratio (SNIR), for small interference spread. With increasing interference spread the difference in SNIR performance increases, in favor of the array gain maximization.
Studies on implementation of the Katsevich algorithm for spiral cone-beam CT

Recently, Katsevich proposed the first exact helical cone-beam reconstruction algorithm that takes longitudinally truncated data collected from part of a scanning turn. A key theoretical basis is that any point inside the scanning helix belongs to one and only one PI-line. Unfortunately, he only provided a general formulation and did not describe the implementation details. To make this complicated algorithm more transparent, we report here specifically how to program the Katsevich algorithm in the planar detector geometry. As an important component, we also analyze the effects of various implementation parameters on the image quality. Our results are intended to be valuable for those who are interested in evaluating, improving and extending the Katsevich approach.
Human Replication Protein A−Rad52−Single-Stranded DNA Complex: Stoichiometry and Evidence for Strand Transfer Regulation by Phosphorylation†

The eukaryotic single-stranded DNA-binding protein, replication protein A (RPA), is essential in DNA metabolism and is phosphorylated in response to DNA-damaging agents. Rad52 and RPA participate in the repair of double-stranded DNA breaks (DSBs). It is known that human RPA and Rad52 form a complex, but the molecular mass, stoichiometry, and exact role of this complex in DSB repair are unclear. In this study, absolute molecular masses of individual proteins and complexes were measured in solution using analytical size-exclusion chromatography coupled with multiangle light scattering, the protein species present in each purified fraction were verified via sodium dodecyl sulfate−polyacrylamide gel electrophoresis (SDS−PAGE)/Western analyses, and the presence of biotinylated ssDNA in the complexes was verified by chemiluminescence detection. Then, employing UV cross-linking, the protein partner holding the ssDNA was identified. These data show that phosphorylated RPA promoted formation of a complex with monomeric Rad52 and caused the transfer of ssDNA from RPA to Rad52. This suggests that RPA phosphorylation may regulate the first steps of DSB repair and is necessary for the mediator function of Rad52.
Generalized Fleming-Viot processes with immigration via stochastic flows of partitions

The generalized Fleming-Viot processes were defined in 1999 by Donnelly and Kurtz using a particle model and by Bertoin and Le Gall in 2003 using stochastic flows of bridges. In both methods, the key argument used to characterize these processes is the duality between these processes and exchangeable coalescents. A larger class of coalescent processes, called distinguished coalescents, was set up recently to incorporate an immigration phenomenon in the underlying population. The purpose of this article is to define and characterize a class of probability-measure valued processes called the generalized Fleming-Viot processes with immigration. We consider some stochastic flows of partitions of Z_{+}, in the same spirit as Bertoin and Le Gall's flows, replacing roughly speaking, composition of bridges by coagulation of partitions. Identifying at any time a population with the integers $\mathbb{N}:=\{1,2,. \}$, the formalism of partitions is effective in the past as well as in the future especially when there are several simultaneous births. We show how a stochastic population may be directly embedded in the dual flow. An extra individual 0 will be viewed as an external generic immigrant ancestor, with a distinguished type, whose progeny represents the immigrants. The "modified" lookdown construction of Donnelly-Kurtz is recovered when no simultaneous multiple births nor immigration are taken into account. In the last part of the paper we give a sufficient criterion for the initial types extinction.
Investigate the Effect of Thawing Process on the Self-Assembly of Silk Protein for Tissue Applications

Biological self-assembly is a process in which building blocks autonomously organize to form stable supermolecules of higher order and complexity through domination of weak, noncovalent interactions. For silk protein, the effect of high incubating temperature on the induction of secondary structure and self-assembly was well investigated. However, the effect of freezing and thawing on silk solution has not been studied. The present work aimed to investigate a new all-aqueous process to form 3D porous silk fibroin matrices using a freezing-assisted self-assembly method. This study proposes an experimental investigation and optimization of environmental parameters for the self-assembly process such as freezing temperature, thawing process, and concentration of silk solution. The optical images demonstrated the possibility and potential of −80ST48 treatment to initialize the self-assembly of silk fibroin as well as controllably fabricate a porous scaffold. Moreover, the micrograph images illustrate the assembly of silk protein chain in 7 days under the treatment of −80ST48 process. The surface morphology characterization proved that this method could control the pore size of porous scaffolds by control of the concentration of silk solution. The animal test showed the support of silk scaffold for cell adhesion and proliferation, as well as the cell migration process in the 3D implantable scaffold.
Risk-based authenticator for web applications

Web applications for consumers often require authenticated users in order to offer their services. In this context, consumers expect authentication to be easy to use and their resources to be secured properly. But, authentication in web applications is often vulnerable, e.g., passwords can be stolen, fingerprints can be imitated or the authentication protocol implementation may have a security flaw. Several best practices solving this problem evolved in several web applications. We analyzed such solutions that continuously and transparently collect data on the user to learn their typical behavior and detect anomalies. Based on this analysis, we describe the security pattern risk-based authenticator and exemplify its application in the SmartCampus, a service-oriented web application.
Estimation Illumination Chromaticity

Color constancy is important for pattern recognition and image understanding. Based on simplified BRDF model, we use voting method to detect the high light areas. Then the pixels in the high light areas are projected to the inverse-intensity space. In the inverse-intensity space, the correlation of image chromaticity, inverse-intensity, and illumination chromaticity is linear. So we can estimate the Illumination chromaticity. The experiments demonstrate that our algorithm have no limit on the objects' material and texture and contain the color constancy after the illumination chromaticity correction.
Loss of controlled nuclear division in BHK21 cells passed in vivo.

Low-passage BHK21/C13 cells respond to cytochalasin B (CB) by undergoing limited or controlled nuclear division. These cells respond to CB as normal cells do since nuclear division usually occurs only once. Premature chromosome condensation, a result of mitoses in highly multinucleate cells, occurs in less than 0.5% of the cells. When they are inoculated into weanling hamsters, s. c. tumors appear within 3 to 4 weeks with as few as 10(3) cells. When these cells are returned to cell culture they respond to CB with uncontrolled nuclear division and premature chromosome condensation. All cultured tumors respond in this manner regardless of the number of cells originally inoculated into animals. This suggests at least two possibilities: (a) that loss of controlled nuclear division in BHK cells is closely associated with or required for tumorigenicity, with in vivo passage selecting for a rare tumorigenic variant or (b) that loss of controlled nuclear division is secondary to tumorigenicity and results when cells are passed in vivo, i.e., in vivo passage has the direct effect of causing cells to lose controlled nuclear division. If the first possibility is operating, then it would be expected that a very small fraction of BHK21/C13 cells show uncontrolled nuclear division (approximately 1 of 1000 CB-treated cells). Also, clones of C13 should be nontumorigenic if only 1 of 1000 cells is tumorigenic. Extensive examination of CB-treated C13 cells shows 1 of 1250 cells to be highly multinucleated although not as highly multinucleated as tumor cells. This provides some evidence in support of the first possibility. However, three separate clones of C13 cells were found to be tumorigenic providing evidence supporting the second possibility. BHK21/C13 and various BHK21 tumors all appeared to grow to concentration densities markedly higher than hamster embryo fibroblasts. However, the tumor cells usually grew to the same density as did BHK21/C13 or only slightly higher. This suggests that loss of contact inhibition is not sufficient for loss of controlled nuclear division. It also suggests that the hypothetical 1 of 1000 tumorigenic cells and 1 of 1250 cells with uncontrolled nuclear division do not overgrow the "normal" cells because all cells grow to similar densities. The relationship between the ability to grow in agar and uncontrolled nuclear division was also examined. Approximately 1 of 2500 C13 cells were able to form colonies in agar. All three colonies isolated showed normal control of nuclear division. These results show that the ability to grow in agar may be separate from the expression of uncontrolled nuclear division. They also suggest a fundamental difference between tumor cells and cells that have been grown in agar.
How the Tiwi Construct the Deceased’s Postself in Mortuary Ritual

ABSTRACT In this paper I will discuss Tiwi mortuary rites as a transformative, relational process in which the deceased’s postself is created. The deceased’s self is fashioned and manifested after death through a series of ritual practices performed by specific relatives. This approach allows me not only to stress the concern Tiwi people show about being remembered after death but also how this concern defines each participant’s ceremonial role and constitutes one of the mortuary ritual’s major aims. The deceased will be remembered as portrayed in the final rites.
An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities

This paper presents a new energy-aware algorithm that integrates Dynamic Voltage and Frequency Scaling (DVFS) and Dynamic Power Management (DPM) techniques to further reduce energy consumption in embedded systems. It consists of an off-line DVFS-stage, for computing the speed that minimizes energy consumption during active intervals while guaranteeing timing constraints, and an online DPM-stage, for prolonging sleep intervals by postponing task execution. Moreover, limited preemptive scheduling is exploited to reduce preemption costs and further extend sleep intervals under fixed-priority systems, with respect to fully preemptive schedulers. The online algorithm has a constant complexity and preemption costs are taken into account in the analysis. A set of simulation experiments are reported to illustrate the behavior of the proposed approach as a function of different parameters and compare its performance with the state-of-art methods available in the literature.