Miracle-dz/UniFAR-FTUs huggingface dataset:
Evaluation of the cost of cervical cancer at the National Institute of Oncology, Rabat

Introduction The Cervical Cancer (CC) is one of the heavy and costly diseases for the population and the health system. We want to know through this study, the first in Morocco, the annual cost of the treatment of this disease at the National Institute of Oncology (NIO) in Rabat, we also want to explore the possibility of flat-rate management of this disease in order to standardize medical practices and improve reimbursement by health insurance funds. Methods 550 patients were treated for their cervical cancer in the Rabat's NIO. Data of all of medical and surgical services offered to patients were collected from the NIO registry. The cost of care was assessed using the method of micro-costing. We will focus to the total direct cost of all the services lavished to patients in NIO. Results The global cost was about US$ 1,429,673 with an average estimated at US$ 2,599 ± US$ 839. Radiotherapy accounts for 55% of total costs, followed by brachytherapy (27%) and surgery (7%). This three services plus chemotherapy influence the overall cost of care (p <0.001). Other services (radiology, laboratory tests and consultations) represent only 10%. The overall cost is influenced by the stage of the disease, this cost decreased significantly evolving in the stage of CC (p <0.001). Conclusion The standardization of medical practices is essential to the equity and efficiency in access to care. The flat-rate or lump sum by stage of disease is possible and interesting for standardizing medical practices and improving the services of the health insurance plan.
TemplateNet for Depth-Based Object Instance Recognition

We present a novel deep architecture termed templateNet for depth based object instance recognition. Using an intermediate template layer we exploit prior knowledge of an object's shape to sparsify the feature maps. This has three advantages: (i) the network is better regularised resulting in structured filters; (ii) the sparse feature maps results in intuitive features been learnt which can be visualized as the output of the template layer and (iii) the resulting network achieves state-of-the-art performance. The network benefits from this without any additional parametrization from the template layer. We derive the weight updates needed to efficiently train this network in an end-to-end manner. We benchmark the templateNet for depth based object instance recognition using two publicly available datasets. The datasets present multiple challenges of clutter, large pose variations and similar looking distractors. Through our experiments we show that with the addition of a template layer, a depth based CNN is able to outperform existing state-of-the-art methods in the field.
On the Rank of Ideal Class Groups in Memory of Lawrence G. Roberts 1. Some Questions of Shafarevich Acknowledgments. I Would like to Thank Professor Duke for Some Useful

We review some questions of Shafarevich on the structure of ideal class groups of number elds, and discuss results that provide evidence in support of these questions. The analogy between number elds and algebraic function elds of one variable has long been a fruitful source of inspiration for the development of algebraic number theory. Hilbert's pioneering work in class eld theory, for instance, was motivated in part by the search for an arithmetic analog of the theory of (Abelian) covering spaces of compact Riemann surfaces 11]. In an attempt to gain insights into the non-Abelian extensions of number elds, Shafarevich, in his 1962 ICM address 14], revisited this analogy and was led to a number of questions: Let K=Q be a number eld, and let S be a nite set of places of K (possibly empty). 1. Fix a prime p, and consider the Galois group of the maximal prop extension of K unramiied outside S. How is the minimal number of generators of this Galois group related to the minimal number of relations? 2. Denote by M K;S the maximal extension of K unramiied outside S. Is Gal(M K;S =M) topologically generated by nitely many elements? 3. Suppose it is; can we nd a bound for the number of such generators that depends only on the cardinality of S? The Golod-Shafarevich theorem 7] provides a satisfactory answer to question 1. As for question 2, an inequality of Ihara 10] shows that Gal(M K;S =M) is topologically generated by nitely many Frobenius conjugacy classes. Note that if S is empty, then M K;S contains the Hilbert class eld of M, so an aarmative answer to question 3 would imply that the number of generators of the class group of M is bounded by a function that depends only on the number of prime divisors of the discriminant of M. In particular, it would answer the following very interesting question, also posed by Shafarevich: 3'. Is there an absolute bound on the number of generators of the class group of a quadratic eld of prime discriminant? Note that this does not contradict the Cohen-Lenstra heuristics on the density of quadratic elds with a given p-class rank 3], since this density is taken over all quadratic elds. In the spirit of Shafarevich's questions, we would like to put forth the following Question 1. For any integers n; s > 0, does there …
Perceptual segregation of a harmonic from a vowel by interaural time difference in conjunction with mistuning and onset asynchrony.

The two experiments reported here examine how an inter-aural time difference (ITD) interacts with two other cues, mistuning and onset asynchrony, in reducing the contribution of a single frequency component to the perception of a vowel's identity. Previous experiments have shown that although ITD is generally rather ineffective at segregating a simultaneous harmonic frequency component from a vowel, it can produce some segregation when listeners have already been exposed to the isolated segregated component. A difference in ITD increases segregation overall in experiment 1 where the to-be-segregated component can also have a different onset time from the remainder of the vowel, and experiment 2 shows a similar result when the to-be-segregated component is mistuned. However, segregation by ITD is present just as strongly on trials when there is neither mistuning nor a difference in onset-time as on trials where these additional cues are present. Segregation on trials when there is neither mistuning nor a difference in onset-time is however larger in the present experiment which mixed all conditions together than in similar trials in an earlier experiment that had a blocked design [C.J. Darwin and R.W. Hukin, J. Acoust. Soc. Am. 102, 2316-2324 (1997)]. The results show that segregation by ITD increases when other more potent cues are present in the experiment.
Investigation of airborne foot-and-mouth disease virus transmission during low-wind conditions in the early phase of the UK 2001 epidemic

Abstract. Foot-and-mouth disease (FMD) is a highly contagious viral disease of cloven-hoofed domesticated and wild animals. The highly contagious nature of FMD is a reflection of the wide range of host species, the enormous quantities of virus liberated by infected animals, the range of excretions and secretions which can be infectious, the stability of the virus in the environment, the multiplicity of routes of infection and the very small doses of the virus that can initiate infection. One of the mechanisms of spread is the carriage of droplets and droplet nuclei exhaled in the breath of infected animals. Such spread can be rapid and extensive, and it is known in certain circumstances to have transmitted disease over a distance of several hundred kilometres. During the 2001 FMD epidemic in the United Kingdom (UK), atmospheric dispersion models were applied in real time in order to assess the potential for atmospheric dispersion of the disease. The operational value of such modelling is primarily to identify premises which may have been exposed so that the human resources for surveillance and disease control purposes are employed most effectively. The paper describes the combined modelling techniques and presents the results obtained of detailed analyses performed during the early stages of the UK 2001 epidemic. This paper investigates the potential for disease spread in relation to two outbreaks (Burnside Farm, Heddon-on-the-Wall and Prestwick Hall Farm, Ponteland, Northumberland). A separate paper (Gloster et al., 2002) provides a more detailed analysis of the airborne disease transmission in the vicinity of Burnside Farm. The combined results are consistent with airborne transmission of disease to livestock in the Heddon-on-the-Wall area. Local topography may have played a significant role in influencing the pattern of disease spread.
One-click vocal tract mapping interface for vowels and its usefulness as a signal converter

This paper describes an effective application of a vocal tract mapping interface to signal conversion. The vocal tract mapping interface is a kind of vocal tract shape generator that provides users with easy and effective setting of the vocal tract shape with a simple mouse click on its interface window. Utilizing a one-click operation to generate the vocal tract shape, an incoming signal can be easily converted into vowel sounds through the vocal tract shape. In this paper, signals obtained from finger motions during a finger-nose test were converted into vowel sounds as an application of the vocal tract mapping interface. Paired comparison experiments showed that vowel sounds generated from the finger motions are useful to judge the severity of movement disorders of patients.
A robust tensor-based edge detection method for noisy remote sensing images

Traditional gradient based edge detection methods such as Sobel, Laplacian of Gaussian and Canny detectors which have charming applications in common images are not satisfactory in dealing with noisy remote sensing images. Aiming to solve this problem, we introduce the trace of the nonlinear local structure tensor to sort edges out of noises. Then we extracted the contours of the trace and fill the gaps in the contours. At last, edge thinning is applied to the contour map to suppress the non-maximum pixels. Experiment results demonstrate that our robust tensor-based edge detection algorithm is effective under noisy condition.
Adaptative Matching of Database Web Services Export Schemas

This paper proposes an approach and a mediator architecture for adaptively matching export schemas of database Web services. Differently from traditional mediator approaches, the mediated schema is constructed from the mappings adaptively elicited from user query responses. That is, query results are postprocessed to identify reliable mappings and to build the mediated schema on the fly. The approach is illustrated with two case studies from rather different application domains.
An efficient model for DSP code generation: performance, code size, estimated energy

The paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model, along with logical propositions is used to create an optimization model. Code is generated in fast cpu times and is optimized for minimum code size, maximum performance or estimated energy dissipation. Code generated for realistic DSP applications provides performance and code size improvements from 1.09 up to 2.18 times for the TMS320C2x processor compared to previous research and a commercial compiler. In all examples, up to 106 instructions are generated in under one cpu minute. This research is important for industry since DSP code can be efficiently generated with constraints on code size, performance and energy dissipation.
Evaluating multimodal driver displays under varying situational urgency

Previous studies have investigated audio, visual and tactile driver warnings, indicating the importance of communicating the appropriate level of urgency to the drivers. However, these modalities have never been combined exhaustively and tested under conditions of varying situational urgency to assess their effectiveness both in the presence and absence of critical driving events. This paper describes an experiment evaluating all multimodal combinations of such warnings under two contexts of situational urgency: a lead car braking and not braking. The results showed that participants responded quicker to more urgent warnings, especially in the presence of a car braking. They also responded faster to the multimodal as opposed to unimodal signals. Driving behaviour improved in the presence of the warnings and the absence of a car braking. These results highlight the influence of urgency and number of modalities in warning design and indicate the utility of non-visual warnings in driving.
W-band 65-nm CMOS and SiGe BiCMOS transmitter and receiver with lumped I-Q phase shifters

This paper describes 80–94 GHz and 70–77 GHz I-Q phase shifters and the corresponding transmitter and receiver ICs, fabricated in 65-nm CMOS and SiGe BiCMOS technologies, respectively. Lumped inductors and transformers are employed to realize small-form factor 90° hybrids as needed in high density phased arrays. The CMOS transmitter operates with a saturated output power of +3 dBm and exhibits maximum absolute phase and amplitude errors of 14° and 5.5 dB, respectively, when the phase is varied from 0° to 360° in steps of 22.5°. The absolute phase error in the SiGe BiCMOS receiver is less than 8°, with a maximum gain imbalance below 3 dB over its 3-dB bandwidth of 70–77 GHz. The peak gain and power consumption are 3.8 dB and 142 mW from 1.2V supply for the CMOS transmitter, and 17 dB and 128 mW from 1.5V and 2.5V supplies for the SiGe BiCMOS receiver.
A simple ABR switch algorithm for the weighted max-min fairness policy

An important concept in the ABR service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection. Due to the MCR and PCR requirements, the well-known max-min fairness policy is not sufficient to determine the fair rate allocation in the ABR service model. We present the weighted max-min (WMM) fairness policy, which supports both the MCR and PCR requirements for each ABR virtual connection. A centralized algorithm is presented to compute network-wide bandwidth allocation to achieve this policy. Furthermore, a simple ABR algorithm based on the intelligent marking technique is developed with the aim of achieving the WMM fairness policy in the distributed ABR environment. The effectiveness of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the ATM Forum.
The Impact of Suppressive Surrounds on Chromatic Properties of Cortical Neurons

Stimulation of the suppressive surround of a cortical neuron affects the responsivity and tuning of the classical receptive field (CRF) on several stimulus dimensions. In V1 and V2 of macaques prepared for acute electrophysiological experiments, we explored the chromatic sensitivity of the surround and its influence on the chromatic tuning of the CRF. We studied receptive fields of single neurons with patches of drifting grating of optimal spatial frequency and orientation and variable size, modulated along achromatic or isoluminant color directions. The responses of most neurons declined as the patch was enlarged beyond the optimal size (surround suppression). In V1 the suppression evoked by isoluminant gratings was less than one-half that evoked by achromatic gratings. Consequently, many cells were most sensitive to achromatic modulation when patches just covered the CRF but were most sensitive to isoluminant modulation when patches were enlarged to cover the suppressive surround. Non-oriented neurons that were strongly chromatically opponent generally lacked suppressive surrounds. In V2 most neurons showed equal surround suppression from isoluminant gratings and achromatic gratings. This makes the relative sensitivity of V2 neurons to achromatic and isoluminant gratings mainly independent of the size of the grating. We also measured the chromatic properties of the CRF in the presence of differently colored surrounds. In neither V1 nor V2 did the surround alter the chromatic tuning of the CRF. Cortical mechanisms sensitive to chromatic contrast seem to provide little input to the suppressive surrounds of V1 neurons but substantial input to those of V2 neurons.
The V–J Recombination of  T Cell Receptor-γ Genes Is Blocked in Interleukin-7 Receptor–deficient Mice

IL-7R-deficient mice have severely impaired expansion of early lymphocytes and lack γδ T cells. To elucidate the role of IL-7R on γδ T cell development, we analyzed the rearrangements of TCR-α, β, γ, and δ genes in the thymus of the IL-7R-deficient mice. Southern blot analysis with a Jγ1 probe revealed that more than 70% of Jγ1 and Jγ2 alleles are recombined to form distinct Vγ1. 2–Jγ2 and Vγ2–Jγ1 fragments in control mice. On the contrary, no such recombination was detected in the mutant mice. The rearrangements in the TCR-α, β, and δ loci were comparably observed in control and mutant mice. PCR analysis indicated that the V–J recombination of all the Vγ genes is severely hampered in the mutant mice. The mRNA of RAG-1, RAG-2, Ku-80, and terminal deoxynucleotidyl transferase (TdT) genes was equally detected between control and mutant thymi, suggesting that the expression of common recombination machinery is not affected. These data demonstrated that the V–J recombination of the TCR γ genes is specifically blocked in the IL-7R-deficient mice and suggested the presence of highly specific regulation for TCR γ gene rearrangement.
Implied Multivariate Value-at-risk

This paper proposes methods for computing multivariate risk-neutral distributions from option prices. We illustrate the differences between the risk-neutral pdfs obtained from multivariate estimation and those from the use of univariate techniques. The estimation of multivariate distributions has important useful applications for financial hedging, derivative pricing, and the evaluation of correlation, contagion, and other measurements of comovement among the underlying securitires. We use an example with options on the dollar-mark, dollar-streling and mark-sterling exchange rates to highlight the differences in the estimated measures of comovement from the multivariate distribution and those obtained from historical estimation and univariate techniques. In general, the risk-neutral measures imply fatter distribution tails and higher correlations of large movements of the underlying securities than those suggested by historical prices. ____________ * 44 West 4th Street, New York, NY 10012. (212) 998-0429. jcampa@stern.nyu. edu For helpful comments, we are grateful to Jens Carsten Jackwerth, Joshua Rosenberg, Charlie Thomas, and conference participants at the Wharton Risk Management Workshop, and the BIS conference on “Estimating and Interpreting Probability Density Functions”. We also thank seminar participants at the Bank of England, Bank of Spain, MEFF, New York University and Federal Reserve Bank of New York. For data, we thank Richard Holmes of Citibank and John Slee and John Quayle of NatWest Markets.
Are Transient Explosive Roots the Signature of a Bubble? A Markov Regime Switching Approach with Bayesian Model Averaging

We investigate the behaviour of a range of economic time series using a Bayesian Markov Switching model that allows for explosive regimes and alternative levels of error variance with potentially t-distributed errors. Our results, generated by Bayesian Model Averaging, find explosive root regimes only in a minority of data series that have previously been found to contain bubbles, once regime switching error variance is permitted. While we find that many of the series appear to display regime switching that could quite possibly be induced by ‘bubble’ processes we argue that while some bubbles might be explosive, the recent trend towards viewing transient explosive roots as a generic bubble signature is problematic.
Approximate Implicitization Using Linear Algebra

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating point implementation in computer aided geometric design (CAGD) systems. We unify the approaches under the names of commonly known polynomial basis functions, and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.
Incorporating Advice into Agents that Learn from Reinforcements

Learning from reinforcements is a promising approach for creating intelligent agents. However, reinforcement learning usually requires a large number of training episodes. We present an approach that addresses this shortcoming by allowing a connectionist Q-learner to accept advice given, at any time and in a natural manner, by an external observer. In our approach, the advice-giver watches the learner and occasionally makes suggestions, expressed as instructions in a simple programming language. Based on techniques from knowledge-based neural networks, these programs axe inserted directly into the agent's utility function. Subsequent reinforcement learning further integrates and refines the advice. We present empirical evidence that shows our approach leads to statistically-significant gains in expected reward. Importantly, the advice improves the expected reward regardless of the stage of training at which it is given.
A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks

As advanced in the technologies of predicting protein-protein interactions, huge data sets portrayed as networks have been generated. Identification of functional modules from such networks is crucial for understanding principles of cellular organization and functions. In this paper, we presented a new fast agglomerate algorithm of identifying functional modules based on the edge clustering coefficients, named FAG-EC. We applied algorithm FAG-EC to the core protein interaction network of budding yeast collected from DIP database. Many significant functional modules were detected. Algorithm FAG-EC had a high precision of more than 59% and had a recall of more than 27%. The f-measure was more than 37%. Most importantly, algorithm FAG-EC is extremely fast, which can be used in large protein interaction networks.