Miracle-dz/UniFAR-FTUs huggingface dataset:
A Positive-weight next-to-leading-order Monte Carlo for heavy flavour hadroproduction

We present a next-to-leading order calculation of heavy flavour production in hadronic collisions that can be interfaced to shower Monte Carlo programs. The calculation is performed in the context of the POWHEG method [1]. It is suitable for the computation of charm, bottom and top hadroproduction. In the case of top production, spin correlations in the decay products are taken into account.
Simulation Control of Concrete Pump Truck Boom Based on PSO and Gravity Compensation

In the actual operating work of the concrete pump truck, there are many ill factors impact on the control quality that are environment interference, drive saturation, measurement error, rounding error and sampling delay. To overcome disadvantage, prove mathematical model accurate and identify parameters full, the group control was used; PSO algorithm was used to calculate the final value of every joint point, because the entire search is the process that updates the current optimal solution; all the particles are likely to faster convergence on the optimal solution; The PD control based on the gravity compensation for concrete pump truck boom was used, the advantage of control law are simple and easy to implement and can guarantee a good dynamic and static quality; In order to improve the joint operation real-time and accuracy, using cubic polynomial interpolation method described trajectory; Through the simulation examples analysis, the conclusion is that the method of combination PSO and gravity compensation is suitable for concrete pump truck boom control.
Towards Unifying Rules and Policies for Semantic Web Services

Simplifying the discovery of web services on one hand and protecting them from misuse on the other hand has initiated several lines of research in the area of policyaware semantic web services. However, the diversity of approaches, ontologies and languages chosen for defining Semantic Web services and policies has made the research area cluttered. It is now ambiguous how different registries and agents with different policy languages and Semantic Web service ontologies would share their information. In this paper we try to solve the problem of exchanging information between the registries by defining an interchange framework to transform business rules and concepts from one language to another using a third intermediary language called R2ML. The expressivity of the new framework exempts any service provider or service requester from the difficulties it may encounter during the process of transformation from one business rule language to the other. It also guarantees that information loss during transformation would be
Mass Outflows from Dissipative Shocks in Hot Accretion Flows

We consider stationary, axisymmetric hydrodynamic accretion flows in Kerr geometry. As a plausible means of efficiently separating a small population of nonthermal particles from the bulk accretion flows, we investigate the formation of standing dissipative shocks, i.e., shocks at which fraction of the energy, angular momentum, and mass fluxes do not participate in the shock transition of the flow that accretes onto the compact object but are lost into collimated (jets) or uncollimated (winds) outflows. The mass-loss fraction (at a shock front) is found to vary over a wide range (0%-95%), depending on flow's angular momentum and energy. On the other hand, the associated energy-loss fraction appears to be relatively low (≲1%) for a flow onto a nonrotating black hole case, whereas the fraction could be an order of magnitude higher (≲10%) for a flow onto a rapidly rotating black hole. By estimating the escape velocity of the outflowing particles with a mass-accretion rate relevant for typical active galactic nuclei, we find that nearly 10% of the accreting mass could escape to form an outflow in a disk around a nonrotating black hole, while as much as 50% of the matter may contribute to outflows in a disk around a rapidly rotating black hole. In the context of disk-jet paradigm, our model suggests that shock-driven outflows from accretion can occur in regions not too far from a central engine. Our results imply that a shock front under some conditions could serve as a plausible site where (nonthermal) seed particles of the outflows (jets/winds) are efficiently decoupled from bulk accretion.
Desingularization by minimum projection method and its application to rigid body control

Stabilization on a non-contractible manifold is a difficult control problem. We have proposed the minimum projection method for asymptotic stabilization of nonlinear systems on manifolds. The minimum projection method requires the strict condition for a control Lyapunov function (CLF) on another manifold. In this paper, we relax the condition by desingularization of the function on the other manifold. We consider a rigid body control problem as an application of desingularization based control method. S3 is a double covering space of SO(3). Stabilization on SO(3) is a difficult problem; however, the strong CLF design on S3 is not difficult. Then, we design a strict CLF from the CLF on S3 by desingularization. Finally, we confirm the effectiveness of the desingularization based control method by computer simulation.
Pyrroloquinoline-Quinone Suppresses Liver Fibrogenesis in Mice

Liver fibrosis represents the consequences of a sustained wound healing response to chronic liver injuries, and its progression toward cirrhosis is the major cause of liver-related morbidity and mortality worldwide. However, anti-fibrotic treatment remains an unconquered area for drug development. Accumulating evidence indicate that oxidative stress plays a critical role in liver fibrogenesis. In this study, we found that PQQ, a natural anti-oxidant present in a wide variety of human foods, exerted potent anti-fibrotic and ROS-scavenging activity in Balb/C mouse models of liver fibrosis. The antioxidant activity of PQQ was involved in the modulation of multiple steps during liver fibrogenesis, including chronic liver injury, hepatic inflammation, as well as activation of hepatic stellate cells and production of extracellular matrix. PQQ also suppressed the up-regulation of RACK1 in activated HSCs in vivo and in vitro. Our data suggest that PQQ suppresses oxidative stress and liver fibrogenesis in mice, and provide rationale for the clinical application of PQQ in the prevention and treatment of liver fibrosis.
Overcoming the problems of special interviews on sensitive topics: computer-assisted interviewing tailored for young children and adolescents

Self-administered questionnaires have many advantages, especially when sensitive questions are asked. However, paper self-administered questionnaires have a serious draw-back: only relatively simple questionnaires can be used. Computer Assisted Self-Interviewing (CASI) can overcome these problems, and make it possible to use very complex self-administered question-naires. CASI can take several forms, for instance, it can be a part of a personal (CAPI) interview where the interviewer hands over the computer to the respondent for specific questions. Another form is a computerized version of the mail survey: Disk-by-Mail. We have used both forms in an application for very special populations. In the first study we implemented a Disk-by-Mail sur-vey on bullying in primary schools; the respondents were 6428 pupils aged 8-12 years. The second study was a survey on personal networks, dating, and well-being of adolescents and young adults with a visual handicap (aged 14-24). This study was a mixed-mode CAPI and CASI survey. This paper presents a literature review of data quality in CASI-surveys, describes the general logistic of both surveys and the special adaptations we had to make, and presents empirical findings on data quality and general recommendations for the adaptation of computer assisted (self) interviewing for special populations.
Relationship bank behavior during borrower distress and bankruptcy∗

This paper provides a comprehensive examination of differences between relationship bank behavior for a set of borrowers that either underwent distress or filed for bankruptcy relative to normal times. Prior to distress, banks offer preferential contract terms in the form of lower interest rates and less collateral requirement to their relationship borrowers. After the onset of distress, banks offer identical loan contract terms to their relationship borrowers and outside borrowers. Further, loan availability from relationship lenders (relative to outside lenders) is significantly lower after the onset of distress. However, after filing for bankruptcy, banks again offer preferential terms to their relationship borrowers in terms of collateral requirement. Further, availability of loans from relationship lenders is comparable to that in normal times. Our findings contribute to both the literature on soft budget constraints as well as that on DIP financing. ∗We would like to thank Yakov Amihud, Miao Bin, Edmund Cheung, Allaudeen Hameed, Michael Lemmon, Srinivasan Sankaraguruswamy and seminar participants at Korea University, Financial Management Association and CEPR-UBC-UA conference on competition in banking markets for their comments. Srinivasan thanks NUS Faculty Research Grants R-315-000-066-112 and R-315-000-066-133 for financial support for this project. †Korea University Business School, Anam-Dong, Seongbuk-Gu, Seoul, 136-701, Korea, Tel: 82-23290-2622 E-mail: liyan09@korea.ac. kr ‡Dept of Finance, NUS Business School and Risk Management Institute, National University of Singapore, 1 Business Link, BIZ1 Building 04-34, Singapore 117592, Tel: (65) 6516 8434, Email:bizas@nus.edu. sg Relationship bank behavior during borrower distress and bankruptcy
Current issues of photorealistic rendering for virtual and augmented reality in minimally invasive surgery

In surgery, virtual and augmented reality are increasingly being used as new ways of training, preoperative planning, diagnosis and surgical navigation. Further development of virtual and augmented reality in medicine is moving towards photorealistic rendering and patient specific modeling, permitting high fidelity visual examination and user interaction. This coincides with the current development in computer vision and graphics where image information is used directly to render novel views of a scene. These techniques require extensive use of geometric information about the scene and provide a comprehensive review of the underlying techniques required for building patient specific models with photorealstic rendering. It also highlights some of the opportunities that image based modeling and rendering techniques can offer in the context of minimally invasive surgery.
A neural network that embeds its own meta-levels

A recurrent neural network is presented which (in principle) can, besides learning to solve problems posed by the environment, also use its own weights as input data and learn new (arbitrarily complex) algorithms for modifying its own weights in response to the environmental input and evaluations. The network uses subsets of its input and output units for observing its own errors and for explicitly analysing and manipulating all of its own weights, including those weights responsible for analyzing and manipulating weights. This effectively embeds a chain of meta-networks and meta-meta-. -networks into the network itself. <<ETX>>
Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

The secure end-to-end route discovery in the decentralized Mobile Adhoc Networks (MANETs) should have to meet the requirements of prevention of DoS attacks on data traffic, should be adaptive and fault tolerant and must have high speed, low energy overhead and scalability for future development. In this research a secure routing using antnet mechanism and mutual authentication using Elliptic Curve Cryptography (ECC) has been proposed to meet the above requirements. The common perception of public key cryptography is that it is not well suited for adhoc networks as they are very complex and slow. Against this popular belief, this research implements Elliptic Curve Cryptography -a public key cryptography scheme. ECC provides a similar level of security to conventional integer-based public-key algorithms, but with much shorter keys. Because of the shorter keys ECC algorithms run faster, require less space and consume less energy. These advantages make ECC a better choice of public key cryptography, especially for a resource constrained systems like MANETs. Using the antnet routing algorithm, the highly trustable route will be selected for data transfer and each Mobile Node (MN) in MANET maintains the trust value of its one-hop neighbors. The mutual authentication between source and destination is done by master key exchange using Elliptic Curve Cryptography (ECC). v
A Novel Prefix Graph Based Closed Frequent Itemsets Mining Algorithm

The key points of the frequent closed itemsets mining are based on two main steps: search space browsing and closed itemsets detecting. This paper presents NPG_mining, a novel prefix graph based algorithm for mining closed frequent itemsets. The new approach has constructed an effiecient prefix graph structure and use variable length bit vectors to present the relationship between the database and its items. Based on the closure equivalence concept, the algorithm has created a efficient closed core item generating technology, which can identify the possiblity of a prefix itemset turning into a closed frequent itemset without keeping the existing closed frequent itemsets in the main memory. Our performance study shows that the pruning efficience amd scalability using NPG_mingning is better than PGMiner. Keywords-closed frequent itemsets; prefix graph; data mining I. PROBLEM SETTING AND PRELIMINARIES Frequent itemsets mining is a fundamental task in the area of data mining especially for applications, such as association rules, correlations, classification, clustering and etc[1,2,3,4]. The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets[5]. Let I’ be the universe of items, I’ = {A1, A2,. , Am} be a finite set of items, D is a finite set of transactions over I, where each transaction d∈D is a list of distinct items d= {I0, I1, . , In }, Ij∈I. We give the following definition[4]. Definition 1. A formal context is a triple K: (I’, D, R ), R ⊆ I’×D is a binary relation between items and transactions. Each couple(i, d)∈R denotes the fact that the item i∈ I’ is related to the transaction d∈D. Definition 2. The concept of closed itemset is based on the two following functions f and g: f(T) = {i∈I’ |∀ t∈T , i R t}. (1) g(I) = {t ∈D |∀i ∈ I’, i R t}. (2) where T and I, T⊆D and I⊆ I' are, respectively, subsets of all the transactions and items occurring in dataset D. Function f returns the set of itemsets included in all the transactions in T, while function g returns the set of transactions supporting a given itemset I. Since the set of transaction g(I) can be represented by a list of transaction identifiers, we refer to g(I) as the tid-list of I. We now introduce the following definition. Definition 3. An itemset I is said to be closed if and only if c(I) = f (g(I)) = fοg(I) = I Here, the composite function f ο g is called Galois operator. Definition 4. Let X be a subset of I called a item set, g(X) = { t∈T | X R t } be the set of transactions including X, for a given constant α≥0, an closed item set X is called closed frequent itemsets if |g (X)|≥α. We denote by F and C the sets of all frequent itemsets and all frequent closed item sets, respectively. Compared with the frequent itemsets, frequent closed itemsets offer a compact and also lossless representation of the former, thus frequent itemsets mining problem can be switched to find all closed itemsets that pass the support threshold α.
Robust Automated Human Activity Recognition and Its Application to Sleep Research

Human Activity Recognition (HAR) is a powerful tool for understanding human behaviour. Pervasive sensors, such as wearable devices, have an increasing market penetration and generate a tremendous amount of data. The myriad of available clinical and consumer-grade wearables generate a continuous time series of a person's daily physical exertion and rest. Applying HAR to the activity time series can provide new insights by enriching the feature set in health studies, and enhancing the personalisation and effectiveness of health, wellness, and fitness applications. The analyses of complex health behaviours such as sleep, traditionally require a time-consuming manual interpretation by experts. This manual work is necessary due to the erratic periodicity and persistent noisiness of human behaviour. In this paper, we present a robust automated human activity recognition algorithm, which we call RAHAR. We test our algorithm in the application area of sleep research by providing a novel framework for evaluating sleep quality and examining the correlation between the aforementioned and an individual's physical activity. Our results improve the state-of-the-art procedure in sleep research by 15% for area under ROC and by 30% for F1 score on average. However, application of RAHAR is not limited to sleep analysis and can be used for understanding other health problems such as obesity, diabetes, and cardiac diseases.
Constraints on star formation theories from the Serpens molecular cloud and protocluster

We have mapped the large-scale structure of the Serpens cloud core using moderately optically thick ( 13 CO(1-0) and CS(2-1)) and optically thin tracers (C 18 O(1-0), C 34 S(2-1), and N2H + (1-0)), using the 16-element focal plane array operating at a wavelength of 3 mm at the Five College Radio Astronomy Observatory. Our main goal was to study the large-scale distribution of the molecular gas in the Serpens region and to understand its relation with the denser gas in the cloud cores, previously studied at high angular resolution. All our molecular tracers show two main gas condensations, or sub-clumps, roughly corresponding to the North-West and South-East clusters of submillimeter continuum sources. We also carried out a kinematical study of the Serpens cloud. The 13 CO and C 18 O(1-0) maps of the centroid velocity show an increasing, smooth gradient in velocity from East to West, which we think may be caused by a global rotation of the Serpens molecular cloud whose rotation axis is roughly aligned in the SN direction. Although it appears that the cloud angular momentum is not sucient for being dynamically important in the global evolution of the cluster, the fact that the observed molecular outflows are roughly aligned with it may suggest a link between the large-scale angular momentum and the circumstellar disks around individual protostars in the cluster. We also used the normalized centroid velocity dierence as an infall indicator. We find two large regions of the map, approximately coincident with the SE and NW sub-clumps, which are undergoing an infalling motion. Although our evidence is not conclusive, our data appear to be in qualitative agreement with the expectation of a slow contraction followed by a rapid and highly ecient star formation phase in localized high density regions.
SkeletonNet: Mining Deep Part Features for 3-D Action Recognition

This letter presents SkeletonNet, a deep learning framework for skeleton-based 3-D action recognition. Given a skeleton sequence, the spatial structure of the skeleton joints in each frame and the temporal information between multiple frames are two important factors for action recognition. We first extract body-part-based features from each frame of the skeleton sequence. Compared to the original coordinates of the skeleton joints, the proposed features are translation, rotation, and scale invariant. To learn robust temporal information, instead of treating the features of all frames as a time series, we transform the features into images and feed them to the proposed deep learning network, which contains two parts: one to extract general features from the input images, while the other to generate a discriminative and compact representation for action recognition. The proposed method is tested on the SBU kinect interaction dataset, the CMU dataset, and the large-scale NTU RGB+D dataset and achieves state-of-the-art performance.
Minimum Information about a Genotyping Experiment (MIGEN)

Genotyping experiments are widely used in clinical and basic research laboratories to identify associations between genetic variations and normal/abnormal phenotypes. Genotyping assay techniques vary from single genomic regions that are interrogated using PCR reactions to high throughput assays examining genome-wide sequence and structural variation. The resulting genotype data may include millions of markers of thousands of individuals, requiring various statistical, modeling or other data analysis methodologies to interpret the results. To date, there are no standards for reporting genotyping experiments. Here we present the Minimum Information about a Genotyping Experiment (MIGen) standard, defining the minimum information required for reporting genotyping experiments. MIGen standard covers experimental design, subject description, genotyping procedure, quality control and data analysis. MIGen is a registered project under MIBBI (Minimum Information for Biological and Biomedical Investigations) and is being developed by an interdisciplinary group of experts in basic biomedical science, clinical science, biostatistics and bioinformatics. To accommodate the wide variety of techniques and methodologies applied in current and future genotyping experiment, MIGen leverages foundational concepts from the Ontology for Biomedical Investigations (OBI) for the description of the various types of planned processes and implements a hierarchical document structure. The adoption of MIGen by the research community will facilitate consistent genotyping data interpretation and independent data validation. MIGen can also serve as a framework for the development of data models for capturing and storing genotyping results and experiment metadata in a structured way, to facilitate the exchange of metadata.
Programming Techniques and Data Structures

Algorithms in computational geometry are of increasing importace in computer-aided design, for example, in the layout of integrated circuits. The efficient computation of the intersection of several superimposed figures is a basic problem. We consider plane figures defined by points connected by straight line segments, for example, polygons (not necessarily simple) and maps (embedded planar graphs). The regions into which the plane is partitioned by these intersecting figures are to be processed in various ways such as listing the boundary of each region in cyclic order or sweeping the interior of each region. Let n be the total number of points of all the figures involved and s be the total number of intersections of all line segments. We present two planesweep algorithms that solve the problems above; in the general case (no convexity) in time O((n + s)log n) and space O(n + s); when the regions of each given figure are convex, the same can be achieved in time O(n log n + s) and space O(n).