Miracle-dz/UniFAR-FTUs huggingface dataset:
On Reconstruction and Testing of Read-Once Formulas

An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations aref+;g and each input variable labels at most one leaf. A preprocessed ROF (PROF for short) is a ROF in which we are allowed to replace each variable xi with a univariate polynomial Ti(xi). We obtain a deterministic non-adaptive reconstruction algorithm for PROFs, that is, an algorithm that, given black-box access to a PROF, constructs a PROF computing the same polynomial. The running time of the algorithm is (nd) O(log n) for PROFs of individual degrees at most d. To the best of our knowledge our results give the first subexponential-time deterministic reconstruction algorithms for ROFs. Another question that we study is the following generalization of the polynomial identity testing (PIT) problem. Given an arithmetic circuit computing a polynomial P( ¯ x), decide whether there is a PROF computing P( ¯ x), and find one if one exists. We call this question the read-once testing problem (ROT for short). Previous (randomized) algorithms for reconstruction of ROFs imply that there exists a randomized algorithm for the ROT problem.
A Systematic Analysis of the Relationship of CDH13 Promoter Methylation and Breast Cancer Risk and Prognosis

Background CDH13 (cadherin 13) is a special cadherin cell adhesion molecule, and the methylation of its promoter causes inactivation in a considerable number of human cancers. To explore the association between CDH13 promoter methylation and breast cancer risk and prognosis, we systematically integrated published articles to investigate the diagnostic performance of the CDH13 methylation test for breast cancer. An independent DNA methylation microarray dataset from The Cancer Genome Atlas project (TCGA) project was used to validate the results of the meta-analysis. Methods The relevant literature was searched using the PubMed, Cochrane Library, Web of Science and Google Scholar databases for articles published in English up to May 2015. Data were analyzed using random effect or fixed effect models. The effect sizes were estimated by measuring an odds ratio (OR) or hazard ratio (HR) with a 95% confidence interval (CI). A chi-squared based Q test and sensitivity analysis were performed to examine the between-study heterogeneity and the contribution of single studies to the final results, respectively. Funnel plots were constructed to evaluate publication bias. Results Seven hundred and twenty-six breast tumor samples and 422 controls were collected from 13 published studies. The data from the TCGA set include both tumor and normal samples. A significant association was observed between CDH13 promoter methylation and breast cancer, with an aggregated OR equal to 13.73 (95%CI: 8.09~23.31, z = 9.70, p<0.0001) as measured using the fixed effect model and 14.23 (95%CI: 5.06~40.05, z = 5.03, p<0.0001) as measured using a random effect model. The HR values were calculated as 0.77 (95%CI: 0.27~2.21, z = -0.49, p = 0.622) and 0.38 (95%CI: 0.09~1.69, z = -1.27, p = 0.20) for overall survival (OS) and disease-free survival (DFS), respectively, using the random effect model. This result indicated that breast cancer patients with CDH13 promoter methylation correlated non-significantly with prognosis and is therefore similar to the findings of the TCGA project. Conclusions The methylation status of CDH13 promoter was strongly associated with breast cancer risk. However, CDH13 promoter methylation was not significantly related to the OS and DFS of breast cancer and may have limited prognostic value for breast cancer patients.
Parent Training for Middle Childhood Conduct Problems: Child Opposition to Timeout and Token Fines

Evidence-based treatments for middle childhood disruptive behavior regularly include parent-implemented token fines and timeouts. Child opposition to such discipline procedures has been anticipated, but not systematically described or evaluated for this age group. In the present study, the oppositional behaviors of fifteen 7–11-year-olds occurring in response to token fines and timeouts were systematically recorded in the context of a behavioral parent training program. Children routinely showed opposition to token fine and timeout protocols. Intense and persistent physical resistance to timeout was present in a minority of participants. Two experimental chair timeout enforcement procedures both demonstrated satisfactory feasibility and acceptability.
Improved Methods for Fault Diagnosis in Scan-Based BIST

A deterministic-partitioning technique and an improved analysis scheme for fault diagnosis in Scan-Based BIST is proposed. The incorporation of the superposition principle to the analysis phase of the diagnosis algorithm improves diagnosis times significantly; furthermore, the deterministic partitioning approach results in even further reductions in diagnosis times together with higher predictability.
Depth from HDR: depth induction or increased realism?

Many people who first see a high dynamic range (HDR) display get the impression that it is a 3D display, even though it does not produce any binocular depth cues. Possible explanations of this effect include contrast-based depth induction and the increased realism due to the high brightness and contrast that makes an HDR display "like looking through a window". In this paper we test both of these hypotheses by comparing the HDR depth illusion to real binocular depth cues using a carefully calibrated HDR stereoscope. We confirm that contrast-based depth induction exists, but it is a vanishingly weak depth cue compared to binocular depth cues. We also demonstrate that for some observers, the increased contrast of HDR displays indeed increases the realism. However, it is highly observer-dependent whether reduced, physically correct, or exaggerated contrast is perceived as most realistic, even in the presence of the real-world reference scene. Similarly, observers differ in whether reduced, physically correct, or exaggerated stereo 3D is perceived as more realistic. To accommodate the binocular depth perception and realism concept of most observers, display technologies must offer both HDR contrast and stereo personalization.
Enhancing the Measurement of Composite Indicators of Corporate Social Performance

The aggregation of multiple metrics of corporate social performance (CSP) poses one of the major problems in CSP research. In this paper we propose a new method to compute a composite indicator of CSP from an efficiency perspective using data envelopment analysis. The new approach makes it possible to appropriately account for both positive and negative aspects of CSP, and also to measure CSP for firms for which some of the metrics are exhibiting zero values. Within the new method, we propose measuring global (metafrontier) CSP inefficiency with regard to all firms in the sample and decomposing it into within-industry CSP inefficiency measured with regard to own industry group and industry gap CSP inefficiency. In this way, we measure inefficiencies due to shortcomings in managerial practices and due to the differences between industries in relation to CSP. Using a sample of United States firms in a variety of economic sectors from 2004 to 2015, as covered by the Kinder, Lydenberg and Domini database, we find considerable potential for improvement in CSP practices, with the most CSP-efficient firms representing mining and manufacturing sectors, and the most inefficient belonging to the construction sector. We also find that CSP inefficiency dropped in the period related to the recent financial crisis.
On integrated semigroups and age structured models in {$L^p$} spaces

In this paper, we first develop some techniques and results for integrated semigroups when the generator is not a Hille-Yosida opera- tor and is non-densely defined. Then we establish a theorem of Da Prato and Sinestrari's type for the nonhomogeneous Cauchy problem and prove a perturbation theorem. In particular, we obtain necessary and suffi- cient conditions for the existence of mild solutions for non-densely de- fined non-homogeneous Cauchy problems. Next we extend the results to L p spaces and consider the semilinear and non-autonomous prob- lems. Finally we apply the results to studying age-structured models with dynamic boundary conditions in L p spaces. We also demonstrate that neutral delay differential equations in L p can be treated as special cases of the age-structured models in an L p space.
The More Closely we are Watched, the Better we Behave?

, a game-theoretic setting where a principal (the citizens, shareholders, etc) wants an agent (the government, the CEO, etc.) to perform a certain task. In this setting, transparency corresponds to the ability of the principal to observe what the agent does. We can then ask what happens when transparency improves. The survey begins with the key theoretical result in this area. Holmstrom (1982) provides a powerful and general rationale for full transparency. More information about the agent’s behavior makes the agent more accountable and more likely to work for the common good. The rest of the contribution discusses a long list of objections to this result, from both a conceptual and a practical viewpoint. Given that Holmstrom asserts that transparency improves accountability, possible criticism belongs to two broad classes. First, one can argue that the increase in accountability is not sufficient to offset other drawbacks such as the violation of privacy, the direct cost of disclosure, or the revelation of sensitive information. Alternatively, one can attack the link between transparency and accountability: it is not necessarily true that more disclosure makes the agent behave better. We will discuss both classes of objections, with a particular emphasis on the latter because it can be analysed within the principal-agent setting. The survey concludes with a tentative appraisal of the validity of the Holmstrom benchmark and its relevance for politics and corporate governance.
Is the Company You Are Investing Trustworthy ?

We studied the trustworthiness of Chinese companies by processing court files. Results of SVM and Naı̈ve Bayes are compared. We start with the related work that has been done in the literature. After that, we describe the data collection process for this project in detail. Next we explain the methods we used to classify the instance and their results. Finally we discuss the effect of feature selection.
An Mto Planning Model Considering Timing Association Rules in Orders

Due to the uncertainty of future demand, companies have changed their production planning mode from pre-planning to produce according to the accepted orders, which is named as make-to-order (MTO) or build-to-order (BTO). The hypothesis of independent demand, which falls short of the real state, has been widely introduced in the model of traditional production planning. In general, the future demand and current orders are not completely independent. This paper introduces the data mining method of timing association rules to the model of MTO production planning. Through timing association rules, the relevancy of the future demand and current orders is considered and the future order demand can be forecasted from the history order data by association rules. The heuristic algorithm based on genetic algorithm (GA) is proposed to solve the model. A numeric example is built to demonstrate the proposed model and algorithm.
A version of Beale's method avoiding the free-variables

Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.
Eigenmode Tomlinson-Harashima Precoding for multi-antenna multi-user MIMO broadcast channel

In the previous works, performance of different transmission algorithms in multi-antenna multi-user MIMO broadcast channel were investigated. The result showed that Eigenmode Dirty Paper Coding (EM-DPC) algorithm was superior to the others. Nevertheless, the problem of EM-DPC is that the precoding algorithm significantly increases Peak-to- Average Power Ratio (PAPR). In this paper, to face with the PAPR problem, we propose a new algorithm called Eigenmode Tomlinson-Harashima Precoding (EM-THP), by introduction of modulo operations at both the transmitter and the receiver. It is found from numerical analyses that the proposed method can approximately achieve the throughput performance of the ideal EM-DPC while limiting the PAPR to a lower level.
A nonlinear cryptosystem based on elliptic curves *

We propose a new system that is applicable to public key cryptography. The system is a variant of the Discrete Logarithm Problem (DLP) with the elements of a certain group, formed with points of an elliptic curve, and the elements of a certain finite field related to the curve. The nonlinear term refers to the coefficient that we use as the problem to solve because it is obtained with a nonlinear combination of two scalar elements chosen at random. Also, we expose the Diffie-Hellman key agreement protocol with this system act as the underlying mathematical problem. Key-Words: Public key cryptography, elliptic curves, ECDLP, discrete logarithm problem, finite fields, DiffieHellman key agreement
Xcastor: Secure and scalable group communication in ad hoc networks

Mobile ad hoc networks (MANETs) are emerging as a practical technology for emergency response communication in the case a centralized infrastructure malfunctions or is not available. Using smartphones as communication devices, MANETs may be readily established among the civilian population of affected areas. Beneficiaries would be civilian first responders, which may form small collaborating groups. Communication in such groups must be reliable for disaster response to be effective. In this paper, we address the issue of reliable group communication on the network layer. We design and implement the first secure explicit multicast routing protocol called Xcastor, in which we extend the secure and scalable routing concept of the Castor unicast routing protocol towards supporting reliable communication for large numbers of small groups. By simulation, we show significant performance improvements over Castor.
Atomic resolution structure of the cytoplasmic domain of Yersinia pestis YscU, a regulatory switch involved in type III secretion

Crystal structures of cleaved and uncleaved forms of the YscU cytoplasmic domain, an essential component of the type III secretion system (T3SS) in Yersinia pestis, have been solved by single‐wavelength anomolous dispersion and refined with X‐ray diffraction data extending up to atomic resolution (1.13 Å). These crystallographic studies provide structural insights into the conformational changes induced upon auto‐cleavage of the cytoplasmic domain of YscU. The structures indicate that the cleaved fragments remain bound to each other. The conserved NPTH sequence that contains the site of the N263‐P264 peptide bond cleavage is found on a β‐turn which, upon cleavage, undergoes a major reorientation of the loop away from the catalytic N263, resulting in altered electrostatic surface features at the site of cleavage. Additionally, a significant conformational change was observed in the N‐terminal linker regions of the cleaved and noncleaved forms of YscU which may correspond to the molecular switch that influences substrate specificity. The YscU structures determined here also are in good agreement with the auto‐cleavage mechanism described for the flagellar homolog FlhB and E. coli EscU.
Risk Factors for Mortality among Adult HIV/AIDS Patients Following Antiretroviral Therapy in Southwestern Ethiopia: An Assessment through Survival Models

Introduction: Efforts have been made to reduce HIV/AIDS-related mortality by delivering antiretroviral therapy (ART) treatment. However, HIV patients in resource-poor settings are still dying, even if they are on ART treatment. This study aimed to explore the factors associated with HIV/AIDS-related mortality in Southwestern Ethiopia. Method: A non-concurrent retrospective cohort study which collected data from the clinical records of adult HIV/AIDS patients, who initiated ART treatment and were followed between January 2006 and December 2010, was conducted, to explore the factors associated with HIV/AIDS-related mortality at Jimma University Specialized Hospital (JUSH). Survival times (i.e., the time from the onset of ART treatment to the death or censoring) and different characteristics of patients were retrospectively examined. A best-fit model was chosen for the survival data, after the comparison between native semi-parametric Cox regression and parametric survival models (i.e., exponential, Weibull, and log-logistic). Result: A total of 456 HIV patients were included in the study, mostly females (312, 68.4%), with a median age of 30 years (inter-quartile range (IQR): 23–37 years). Estimated follow-up until December 2010 accounted for 1245 person-years at risk (PYAR) and resulted in 66 (14.5%) deaths and 390 censored individuals, representing a median survival time of 34.0 months ( IQR: 22.8–42.0 months). The overall mortality rate was 5.3/100 PYAR: 6.5/100 PYAR for males and 4.8/100 PYAR for females. The Weibull survival model was the best model for fitting the data (lowest AIC). The main factors associated with mortality were: baseline age (>35 years old, AHR = 3.8, 95% CI: 1.6–9.1), baseline weight (AHR = 0.93, 95% CI: 0.90–0.97), baseline WHO stage IV (AHR = 6.2, 95% CI: 2.2–14.2), and low adherence to ART treatment (AHR = 4.2, 95% CI: 2.5–7.1). Conclusion: An effective reduction in HIV/AIDS mortality could be achieved through timely ART treatment onset and maintaining high levels of treatment adherence.
Towards an autonomous, humanoid, and dynamically walking robot: modeling, optimal trajectory planning, hardware architecture, and experiments

The complete development process for achieving walking motion with a recently constructed humanoid robot is discussed. The desired motion is based on the solution of an optimal control problem whose constraints depend upon the high-dimensional nonlinear multibody system dynamics of a 17 DoF humanoid and physical contact constraints with the environment. On-line control strategies are developed for tracking the precalculated trajectories. Experimental walking results with the humanoid robot are presented.
STALKER: Learning Extraction Rules for Semistructured, Web-based Information Sources *

Information mediators are systems capable of providing a unified view of several information sources. Central to any mediator that accesses Web-based sources is a set of wrappers that can extract relevant information from Web pages. In this paper, we present a wrapper-induction algorithm that generates extraction rules for Web-based information sources. We introduce landmark automata, a formalism that describes classes of extraction rules. Our wrapper induction algorithm, STALKER, generates extraction rules that are expressed as simple landmark grammars, which are a class of landmark automata that is more expressive than the existing extraction languages. Based on just a few training examples STALKER learns extraction rules for documents with multiple levels of embedding. The experimental results show that our approach successfully wraps classes of documents that can not be wrapped by existing techniques.
Space-eecient Scheduling of Nested Parallelism

Many of today's high level parallel languages support dynamic, ne-grained parallelism. These languages allow the user to expose all the parallelism in the program, which is typically of a much higher degree than the number of processors. Hence an eecient scheduling algorithm is required to assign computations to processors at runtime. Besides having low overheads and good load balancing, it is important for the scheduling algorithm to minimize the space usage of the parallel program. This paper presents an on-line scheduling algorithm that is provably space-eecient and time-eecient for nested parallel languages. For a computation with depth D and serial space requirement S 1 , the algorithm generates a schedule that requires at most S 1 + O(p D) space (including scheduler space) on p processors. To allow the scheduler to scale with the number of processors, we also parallelize the scheduler and analyze the space and time bounds of the computation to include scheduling costs. In addition to showing that the scheduling algorithm is space and time eecient in theory, we demonstrate that it is eeective in practice. We have implemented a runtime system that uses our algorithm to schedule lightweight parallel threads. The results of executing parallel programs on this system show that our scheduling algorithm signiicantly reduces memory usage compared to previous techniques, without compromising performance.
Fast nonnegative tensor factorization based on graph-preserving for 3D facial expression recognition

In this paper, we utilize 4D tensor structure to explore efficient structure information for 3D facial expression recognition. As a powerful tool to analyze multidimensional nonnegative tensor data, nonnegative tensor factorization (NTF) aims to obtain a partly localized representation of high-dimensional tensors. However, the NTF algorithms often suffer from both high computational complexity and memory requirements for high-order tensor data. To overcome these disadvantages, we present a low-rank approximation method to decrease the computation complexity. Meanwhile, we extract local geometric and discriminant information to improve facial recognition. Therefore, we propose fast nonnegative tensor factorization based on graph-preserving (FNTFGP) algorithm for 3D facial expression recognition (FER). It is a trial to explore and apply the proposed method into 3D FER. Experiments are conducted on the BU-3DFE database. The result of experiments shows the validity and efficiency of the proposed approaches. The proposed algorithm opens a promising direction for the higher performance of 3D facial expression recognition.
An all-digital DLL with dual-loop control for multiphase clock generator

This paper describes a low power and low area multiphase digital DLL. The architecture of the proposed DLL uses coarse tune loop and fine tune loop to reduce the static phase error and accomplish faster locking time. The DLL was designed using a 0.35 μm standard CMOS process with a 3.3V supply voltage. Simulation results show that the proposed DLL can generate four-phase clock signals ranging from 320 MHz to 500 MHz within a single cycle. At 500 MHz, the peak-to-peak jitter is 6 ps and the total power consumption is 28.3 mW. Moreover, the proposed DLL's locking time is less than 24 clock cycles and the core area is 0.17 mm2.
Using computational critics to facilitate long-term collaboration in user interface design

User interface design and end-user adaptation during the use of the system should be viewed as an ongoing collaborative design process . among interface designers and end-users. Existing approaches have focused on the two activities separately and paid little attention to integration of the two by supporting their asynchronous collaboration over a long period of time throughout the evolution of the interface design. Our knowledge-based domain-oriented user interface design environments serve both as design media and as communication media among interface designers and endusers. An embedded computational critiquing mechanism not only identifies possible problematic situations in a design for user interface designers and end-users but also facilitates asynchronous communication among stakeholders. The presentation of critiquing messages often triggers designers and end-users to articulate design rationale by describing how they responded to the critiques. The recorded design rationale mediates collaboration among end-users and user interface designers during the end-user adaptation and redesign of the interface by providing background context for a design decision.