Miracle-dz/UniFAR-FTUs huggingface dataset:
Logarithmic depth circuits for algebraic functions

This paper describes circuits for computation of various algebraic functions on polynomials, power series, integers, and reals for which it has been a long standing open problem to compute in depth less then (log n)2. Let R[x] be the polynomials and power series over a commutative ring which supports a fast Fourier transform and let L[x] be the polynomials and power series over the rationals L. For polynomials of degree n-1, we give circuits of depth O(log n) for computing - the m-th power of a polynomial and the product of m polynomials in R[x], where m=nO(1) - the symmetric functions on R[x] - the remainder and quotient of division of polynomials in L[x] - interpolation of a polynomial in L[x]. For power series with n given low order terms, we give circuits of depth O(log n) for computing the first n low order terms of - the m-th power of a power series in R[x] and the product of m power series in R[x] where m=nO(1) - the composition of power series in R[x] - the reciprocal of a power series and the division of two power series in L[x] -the reversion of a power series in L[x] - various elementary functions applied to power series in L[x] such as (fixed) powers, roots, exponentation, logarithm, sin, cos, arctangent, and hyperbolic cosine. For integers represented by n bit binary numbers, we give boolean circuits (whose gates compute the boolean operations ∧, ∨, and ¬) of depth O(log n (loglog n) 2) for computing: - the m-th power of an integer and the product of m = nO(1) integers, - the remainder and quotient of the division of two integers. There are many immediate consequences of this result. For reals on a finite interval [a,b] represented as floating point numbers within relative accuracy o(2-n), we have boolean circuits of depth O (log n(loglog n) 2) for computing within relative accuracy o(2-n): - the m-th power of a real and the product of m = nO(1) reals - the reciprocal of a real and division of reals - various elementary functions on reals. Also, as a consequence of the above, for polynomials and power series in L[x] we have uniform boolean circuits of depth O(log n(loglog n)2) for all the above listed problems for polynomials and power series, and also: - evaluation of a polynomial or power series in L[x] at n points, within relative accuracy o(2-n). All our circuits may be uniformly constructed by a deterministic Turning machine with space O(log n) and have constant indegree.
CoreSLAM : a SLAM Algorithm in less than 200 lines of C code

This paper presents a Laser-SLAM algorithm which has been programmed in less than 200 lines of Clanguage code. Our idea was to develop and implement a very simple SLAM algorithm that could be easily integrated into our particle-filter based localization subsystem. For our experiments, we have been using a homebrew robotic platform called MinesRover. It’s a six wheels robot fully equipped with sensors, including a Hokuyo URG04 laser scanner. A typical example of our experiments is presented, showing the good performance of the algorithm. Furthermore, the full source code of the map update and map matching functions are provided in this paper. This work shows the possibility to perform complex tasks using simple and easily programmable algorithms.
Similarity , typicality and fuzzy prototypes for numerical data

In this paper, we consider the notions of similarity, typicality and prototype for numerical data, i.e. vectorial data belonging to R. We study the relationships between these notions and examine various possibilities to define similarity, to deduce typicality from similarity and prototypes from typicality, underlining the semantics and the interpretation of each considered method.
Game Theory Lecture Notes by Cooperative Game Theory Coalitional Games: Introduction 1 Multi-person Bargaining Problem

Let N = {1, . , n} be the set of players. We have already seen the Nash bargaining solution for a two player game. What will this solution look like for an n-player game with n > 2? Let F be the set of feasible allocations that the players can get if they all work together. Let us assume that F is a closed convex subset of R. Let (v1, . . . , vn) be the disagreement payoff allocation the players would expect if they did not cooperate. Also assume that the set {(y1, . . . , yn) ∈ F : yi ≥ vi ∀i ∈ N} is non-empty and bounded. The pair (F, (v1, . . . , vn)) is then called an n-person bargaining problem. The bargaining problem (F, (v1, . . . , vn)) is said to be essential if there exists y ∈ F such that yi > vi ∀i ∈ N . Suppose (F, (v1, . . . , vn)) is essential. Then its Nash bargaining solution can be defined to be the unique strongly efficient allocation vector that maximizes
Scheduling in the dark

Abstract We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when either the jobs all arrive at time zero, or when all the jobs are fully parallelizable, or when the scheduler has considerable knowledge about the jobs. This paper considers for the first time this problem without any of these three restrictions although our algorithm is given more resources than the adversary. We provide new upper and lower bound techniques applicable in this more difficult scenario. The results are of both theoretical and practical interest. In our model, a job can arrive at any arbitrary time and its execution characteristics can change through the life of the job from being anywhere from fully parallelizable to completely sequential. We assume that the scheduler has no knowledge about the jobs except for knowing when a job arrives and when it completes. (This is why we say that the scheduler is completely in the dark.) Given all this, we prove that the scheduler algorithm Equi-partition, though simple, performs within a constant factor as well as the optimal scheduler as long as it is given at least twice as many processors. Moreover, we prove that if none of the jobs are “strictly” fully parallelizable, then Equi-partition performs competitively with no extra processors. We also consider other variations: faster processors; fewer preemptions; and a wider range of execution characteristics.
Crystal Structure of Formate Dehydrogenase H: Catalysis Involving Mo, Molybdopterin, Selenocysteine, and an Fe4S4 Cluster

Formate dehydrogenase H from Escherichia coli contains selenocysteine (SeCys), molybdenum, two molybdopterin guanine dinucleotide (MGD) cofactors, and an Fe4S4 cluster at the active site and catalyzes the two-electron oxidation of formate to carbon dioxide. The crystal structures of the oxidized [Mo(VI), Fe4S4(ox)] form of formate dehydrogenase H (with and without bound inhibitor) and the reduced [Mo(IV), Fe4S4(red)] form have been determined, revealing a four-domain αβ structure with the molybdenum directly coordinated to selenium and both MGD cofactors. These structures suggest a reaction mechanism that directly involves SeCys140 and His141 in proton abstraction and the molybdenum, molybdopterin, Lys44, and the Fe4S4 cluster in electron transfer.
LPLUNC1 Inhibits Nasopharyngeal Carcinoma Cell Growth via Down-Regulation of the MAP Kinase and Cyclin D1/E2F Pathways

Long-palate, lung and nasal epithelium clone 1 (LPLUNC1) gene expression is relatively tissue specific. It is highly expressed in nontumor nasopharyngeal epithelial tissues, but its expression is reduced in nasopharyngeal carcinoma (NPC), indicating that LPLUNC1 may be associated with the tumorigenesis of NPC. To study the effects of LPLUNC1 on NPC tumorigenesis, a full-length LPLUNC1 expression plasmid was stably transfected into the NPC cell line, 5-8F. Our data indicated that LPLUNC1 inhibited NPC cell proliferation in vitro and tumor formation in vivo. LPLUNC1 also delayed cell cycle progression from G1 to S phase and inhibited the expression of cyclin D1, cyclin-dependent kinase 4 (CDK4) and phosphorylated Rb. To further investigate the molecular mechanisms underlying the suppressive effects of LPLUNC1 on NPC tumorigenesis, cDNA microarray was performed. These studies revealed that LPLUNC1 inhibited the expression of certain mitogen-activated protein (MAP) kinases (MAPK) kinases and cell cycle-related molecules. Western blotting confirmed that the expression of MEK1, phosphorylated ERK1/2, phosphorylated JNK1/2, c-Myc and c-Jun were inhibited by LPLUNC1. Furthermore, the transcriptional activity of AP-1 was down-regulated by LPLUNC1, suggesting that the MAPK signaling pathway is regulated by LPLUNC1. Taken together, the present study indicates that LPLUNC1 delays NPC cell growth by inhibiting the MAPK and cyclin D1/E2F pathways and suggests that LPLUNC1 may represent a promising candidate tumor suppressor gene associated with NPC.
Black holes and asymptotics of 2 + 1 gravity coupled to a scalar field

We consider $2+1$ gravity minimally coupled to a self-interacting scalar field. The case in which the fall-off of the fields at infinity is slower than that of a localized distribution of matter is analyzed. It is found that the asymptotic symmetry group remains the same as in pure gravity (i.e., the conformal group). The generators of the asymptotic symmetries, however, acquire a contribution from the scalar field, but the algebra of the canonical generators possesses the standard central extension. In this context, new massive black hole solutions with a regular scalar field are found for a one-parameter family of potentials. These black holes are continuously connected to the standard zero mass black hole.
A general framework for designing image processing algorithms for coherent polarimetric images

We describe a general framework to design optimal image processing algorithms for polarimetric images formed with coherent radiations, which can be optical or microwave. Starting from the classical speckle model for coherent signals, we show that a wide class of algorithms to perform such tasks as detection, localization and segmentation depend on a simple statistics, which is the determinant of the coherency matrix estimated on a given region of the image. We use this property to design computationally efficient techniques for target/edge detection and image segmentation using statistical active contours and the minimum description length principle.
Abscisic Acid and Callose: Team Players in Defence Against Pathogens?

Abscisic acid (ABA) plays an important role as a plant hormone and as such is involved in many different steps of plant development. It has also been shown to modulate plant responses to abiotic stress situations and in recent years, it has become evident that it is partaking in processes of plant defence against pathogens. Although ABA's role in influencing the outcome of plant-pathogen interactions is controversial, with most research pointing into the direction of increased susceptibility, recent results have shown that ABA can also be involved in rendering plants more resistant to pathogen attack. In these cases, ABA interacts with callose deposition allowing an early and efficient build up of papillae at the sites of infection. The present review tries to shed some light on a possible interplay between ABA and callose in the protection of plants against invading pathogens.
Consumption and income in the euro area. Empirical evidence based on panel cointegration methods

We examine the long run relation between private consumption and disposable income in the euro area and the United Kingdom. The cointegrating relationship is tested at the individual and panel level. For the ordinary model the Pedroni (1999) statistics usually reject the null of no cointegration; while the Kao and McCoskey (1998) test rejects the null of cointegration. Moreover, the cointegration vector reflects a decline in the savings rate over time. Extending the model by the stock of financial wealth improves the ordinary approach. All tests support the existence of a long run relationship, and the income elasticity is more in line with the permanent income hypothesis. * Institute for Economic Research Halle (IWH), Kleine Markerstr. 8, 06108 Halle, Germany. Phone: +49345-7753854, E-Mail: cdr@iwh-halle.de. ** Hochschule Wismar, University of Technique, Business and Design, Faculty of Economics, Postfach 1210, 23952 Wismar, Germany. Phone: +49-3841-753601, E-Mail: h.reimers@wi.hs-wismar.de. The research for this paper was carried out as part of the project "Integrationsund Kointegrationsanalyse bei Paneldaten" sponsored by the German Science Foundation (DFG). The financial support is gratefully acknowledged.
Reliable and Distributed Power Optimized Routing in Multihop Cooperative Networks

In this paper focusing on multihop decode and forward ad hoc network, a distributed power optimized cooperative algorithm based on greedy geographical routing (POCGR) is proposed. We are concerned about optimizing the transmit power and reducing the total number of hops in a multihop wireless relay network jointly. We propose POCGR routing algorithm which minimizes the total power consumption while guarantying the certain outage probability. Moreover, POCGR brings the network coverage improvement of cooperative transmission to reduce the number of required hops per route. The relay selection and power allocation schemes are analytically derived and implemented in a distributed manner in the proposed algorithm. The main contribution of the proposed POCGR is to utilize two aforementioned advantages of cooperative transmission together from physical to network layer. Simulation results reveal that POCGR achieves 67.05% up to 81.8% power efficiency with respect to non-cooperative well-known greedy geographical routing algorithm. Furthermore, the number of total end-to-end hops can reduce by half compared to the existing geographical routing algorithms.
Integrating Body and Organ Size in Drosophila: Recent Advances and Outstanding Problems

Over the past two decades, fundamental strides in physiology and genetics have allowed us to finally grasp the developmental mechanisms regulating body size, primarily in one model organism: the fruit fly Drosophila melanogaster. In Drosophila, as in all animals, final body size is regulated by the rate and duration of growth. These studies have identified important roles for the insulin and the target of rapamycin (TOR) signaling pathways in regulating the growth rate of the larva, the stage most important in determining final adult size. Furthermore, they have shown that the insulin/TOR pathway interacts with hormonal systems, like ecdysone and juvenile hormone, to regulate the timing of development and hence the duration of growth. This interaction allows the growing larvae to integrate cues from the environment with environmentally sensitive developmental windows to ensure that optimal size and proportions are reached given the larval rearing conditions. Results from this work have opened up new avenues of studies, including how environmental cues are integrated to regulate developmental time and how organs maintain proportional growth. Other researchers interested in the evolution of body size are beginning to apply these results to studies of body size evolution and the generation of allometry. With these new findings, and with the developments to come, the field of size control finds itself in the fortunate position of finally being able to tackle century old questions of how organisms achieve final adult size and proportions. This review discusses the state of the art of size control from a Drosophila perspective, and outlines an approach to resolving outstanding issues.
Online word-spotting in continuous speech with recurrent neural networks

In this paper we introduce a simplified architecture for gated recurrent neural networks that can be used in single-pass applications, where word-spotting needs to be done in real-time and phoneme-level information is not available for training. The network operates as a self-contained block in a strictly forward-pass configuration to directly generate keyword labels. We call these simple networks causal networks, where the current output is only weighted by the the past inputs and outputs. Since the basic network has a simpler architecture as compared to traditional memory networks used in keyword spotting, it also requires less data to train. Experiments on a standard speech database highlight the behavior and efficacy of such networks. Comparisons with a standard HMM-based keyword spotter show that these networks, while simple, are still more accurate.
Plane Waves and Vacuum Interpolation

A 1 -BPS family of time dependent plane wave spacetimes which give rise to exactly solvable string backgrounds is presented. In particular a solution which interpolates between Minkowski spacetime and the maximally supersymmetric homogeneous plane wave along a timelike direction is analyzed. We work in d = 4, N = 2 supergravity, but the results can be easily extended to d = 10,11. The conformal boundary of a particular class of solutions is studied.
Revolutionary impact of XML on biomedical information interoperability

The use of Extensible Markup Language (XML) to implement data sharing and semantic interoperability in healthcare and life sciences has become ubiquitous in recent years. Because in many areas there was no preexisting data format, XML has been readily embraced and is having a great impact. Biomedical data is very heterogeneous, varying from administrative information to clinical data, and recently to genomic data, making information exchange a great challenge. In particular, it is hard to achieve semantic interoperability among disparate and dispersed systems-a common constellation in the fragmented world of healthcare. Moreover, the emerging patient-centric and information-based medicine approach is posing another challenge-the development and use of an integrated health record for each patient. This means that diverse data from many systems has to be generated, integrated, and become available at the point of care. This paper presents the case that XML is becoming the integration "glue" for biomedical information interoperability, which can lead to improvements in pharmaceuticals, genomic-based clinical research, and personalized medicine, which, for the first time, can be fine-tuned to serve individuals through their longitudinal electronic health records.
Some Experiments on the Usage of a Deductive Database for RDFS Querying and Reasoning

Ontologies are pervading many areas of knowledge representation and management. To date, most research efforts have been spent on the development of sufficiently expressive languages for the representation and querying of ontologies; however, querying efficiency has received attention only recently, especially for ontologies referring to large amounts of data. In fact, it is still uncertain how reasoning tasks will scale when applied on massive amounts of data. This work is a first step toward this setting: based on a previous result showing that the SPARQL query language can be mapped to a Datalog, we show how efficient querying of big ontologies can be accomplished with a database oriented extension of the well known system DLV, recently developed. We report our initial results and we discuss about benefits of possible alternative data structures for representing RDF graphs in our architecture.
The single Drosophila ZO-1 protein Polychaetoid regulates embryonic morphogenesis in coordination with Canoe/afadin and Enabled

Analysis of the function of the fly ZO-1 homologue Polychaetoid shows that it is not essential for junctional assembly or maintenance but does play an important role in embryonic morphogenesis. The data suggest that it works with Canoe/afadin and the actin regulator Enabled to regulate actin anchoring at junctions.
Analysis of the Functional Morphology of Mouthparts of the Beetle Priacma serrata, and a Discussion of Possible Food Sources

Abstract With the help of scanning electron microscopy, high resolution X-ray tomography (µCT), and finite element analysis, the mechanical and functional properties of the mandibles and associated muscles of the beetle Priacma serrata (LeConte) (Coleoptera: Archostemata) were studied. The combination of these techniques allowed for studying mechanical properties of the headmandible- system without using living animals. The µCT analysis delivered precise volumetric data of the geometry of the system to be studied. Dimensions of the cuticle of the parts involved could be readily deduced from the µCT-data. Thus, an exact representation of the specimen without significant artifacts like deformations and misalignments, usually resulting from histological sectioning, could be reconstructed. A virtual 3D model built from these data allowed for investigating different stress scenarios with finite element analysis. Combining these methods showed that P. serrata most likely uses its robustly-built mandibles for cutting hard material. In combination with available information on its habitat, possible food sources are discussed.
Prediction of Internet Addiction for Undergraduates in Hong Kong

In a highly digitized era, people can hardly live without computers and the Internet. While we are admiring the conveniences and advantages brought by the Internet, there is growing concern about problematic Internet use and whether this can lead to an addiction. In psychological field, the concept “Internet addiction” has been used to explain uncontrollable and damaging use of the Internet. As reviewed from some literatures, the problem of Internet addiction is widespread among local students and is expected to be deteriorating. Although some researchers have investigated such issue in Hong Kong, very few of them have concentrated on finding out the predictors of Internet addiction. Therefore, the focus of current study is to identify any predictors of Internet addiction, intending to explain the addictive behavior of Internet users. Four hundred and ten data samples were collected through questionnaires from undergraduates of eight local universities. Using Young’s Internet Addiction Test (IAT), 18% of the respondents were identified as excessive Internet users, showing the prevalence of Internet addiction among undergraduates in Hong Kong. Data collected were analyzed using Chi-square, correlation and multiple regression. Results of statistical analyses show that academic performance is the most important predictor of Internet addiction, followed by perceived behavioral control, gender, and attitude toward using the Internet. Apart from this, the study of predictors for the excessive IAT group has also been performed and the result shows that the level of Internet addiction for this group is predicted by a different combination of variables. This indicates there may be some behavioral differences that discriminates the excessive users from the others. The findings here provide explanations on some addictive behavior of the Internet users and open up new paths for further research.
Information Transfer Bounds on Iterative Thresholds of Staircase Codes

We consider staircase codes and study their performance using an analysis of the decoding information flow. We derive bounds on the information transfer functions for long binary linear codes serving as component codes for staircase ensembles and compute them for several BCH codes and bounded distance decoding. The resulting expressions are used to obtain upper bounds on the iterative thresholds of staircase code ensembles used for communication over the binary symmetric channel.