Miracle-dz/UniFAR-FTUs huggingface dataset:
Pharmacokinetics and pharmacodynamics of subcutaneous injection of long-acting human insulin analog glargine, NPH insulin, and ultralente human insulin and continuous subcutaneous infusion of insulin lispro.

To compare the pharmacokinetics/dynamics of the long-acting insulin analog glargine with NPH, ultralente, and continuous subcutaneous (SC) infusion of insulin lispro (continuous subcutaneous insulin infusion [CSII]), 20 C-peptide-negative type 1 diabetic patients were studied on four occasions during an isoglycemic 24-h clamp. Patients received SC injection of either 0.3 U/kg glargine or NPH insulin (random sequence, crossover design). On two subsequent occasions, they received either an SC injection of ultralente (0.3 U/kg) or CSII (0.3 U x kg(-1) x 24 h(-1)) (random sequence, crossover design). After SC insulin injection or CSII, intravenous (IV) insulin was tapered, and glucose was infused to clamp plasma glucose at 130 mg/dl for 24 h. Onset of action (defined as reduction of IV insulin >50%) was earlier with NPH (0.8 +/- 0.2 h), CSII (0.5 +/- 0.1 h), and ultralente (1 +/- 0.2 h) versus glargine (1.5 +/- 0.3 h) (P < 0.05) (mean +/- SE). End of action (defined as an increase in plasma glucose >150 mg/dl) occurred later with glargine (22 +/- 4 h) than with NPH (14 +/- 3 h) (P < 0.05) but was similar with ultralente (20 +/- 6 h). NPH and ultralente exhibited a peak concentration and action (at 4.5 +/- 0.5 and 10.1 +/- 1 h, respectively) followed by waning, whereas glargine had no peak but had a flat concentration/action profile mimicking CSII. Interindividual variability (calculated as differences in SD of plasma insulin concentrations and glucose infusion rates in different treatments) was lower with glargine than with NPH and ultralente (P < 0.05) but was similar with glargine and CSII (NS). In conclusion, NPH and ultralente are both peak insulins. Duration of action of ultralente is greater, but intersubject variability is also greater than that of NPH. Glargine is a peakless insulin, it lasts nearly 24 h, it has lower intersubject variability than NPH and ultralente, and it closely mimics CSII, the gold standard of basal insulin replacement.
Production based pitch modification of voiced speech

Previous research has shown that the voice source is strongly correlated with speech quality [1][2][3]. However in many existing pitch modiﬁcation algorithms only the impulse train excitation is modiﬁed, while the voice source is normally included in vocal tract transfer function and remains unchanged during modiﬁcation. We present a production based pitch-scale modiﬁcation scheme, which modiﬁes the voice source waveform extracted from the speech signal. Experiment on synthesized voice sounds shows that compared to previous methods, better quality can be achieved for a wider pitch modiﬁcation range.
Design of hybrid optical network architectures incorporating line systems

Multiring architectures are widely used as the design approach for survivable optical core networks, particularly when the rings that can be constructed are not constrained by geographical distances between nodes in the network. This is because traffic flows can be rapidly restored using ring protection mechanisms, and costs can be minimised using add-drop multiplexers (ADMs) at the nodes for inserting and extracting optical signals from a ring. There are, however, situations where a network architecture based solely on rings is not cost-effective or even possible. Multiring architectures are not possible where geographical distances are too large for rings to be formed, so the design of such a network must resort to using point-to-point line systems. Also, these architectures may not be cost-effective in the situation where routing traffic demands using shortest paths in the network results in asymmetric link loads within the network. In this paper we investigate the introduction of line systems into a network architecture to absorb traffic load in particularly heavily-loaded corridors within the network. By using ADMs at intermediate nodes along the line system, we are able to extend the concept of point-to-point line systems to multihop line systems, in which optical signals can be added or dropped at these intermediate nodes. We present a tool for designing hybrid architectures, and demonstrate the reduction in cost that can be achieved by the use of hybrid network architectures.
Simplified ML detection scheme for MIMO systems

We propose a simplified maximum likelihood (ML) detection scheme, based on a multi-stage likelihood test, for MIMO systems. The proposed scheme chooses several surviving symbol combinations at each stage by likelihood tests for the restricted sub-streams, feeds them to the next stage, and finally detects whole sub-streams at the last stage. According to simulation results, the proposed scheme can achieve almost the same performance as that of the ML detection scheme, with far less complexity.
Linear Logic and Applications

This talk consists of three parts. The ﬁrst part reviews the use of substructural logics in formal approaches to natural language grammar and semantics. In particular, labelled deductive systems of the form h label, formula i are considered as a means to model substructural logics. Employing diﬀer-ent algebras over the labels that guide the inference over the formulas they are attached to, a whole landscape of substructural logics arise that spans from the non-associateve Lambek calculus NL (weakest) to the Lambek-van Benthem calculus LP (strongest). t The latter has a correspondence to multiplicative linear logic (MLL). In the second part of the talk a tabular deduction method is presented. Its aim is to provide an eﬃcient means of processing with grammars that are modelled as LDS-style substructural logics. The method is based on a method proposed by Hepple (see also talks by Hepple, Crouch). The method presented here extends Hepple’s method by including the means for handling directional implications, structural rules and many modals. Finally in the third part we raise several questions regarding various formal characteristics we would like to establish for complex systems in which substructural logics of various strengths coexist and interact.
Evaluating the Use of Sound as a Navigational Aid on a Mobile Device-Discussion

The use of sound has obvious advantages when considering interaction with a mobile device and yet it remains under utilised. One reason may be that the sounds commonly evaluated are not aesthetically pleasing [6]. This paper discusses a second possibility – that users may prefer not to use sound regardless of its effectiveness – and describes a proposed experiment to determine whether this is the case. The two stage experiment will initially investigate whether users are able to navigate at least as effectively using audio cues as they are with visual cues. The participants will then be presented with both audio and visual cues to see if they choose to use the visual cues regardless of how well they performed using the audio cues only.
Enhancing Context-Aware Recommendation via a Unified Graph Model

In order to assist the development and use of context-aware recommendation capabilities, we propose a unified graph model which incorporates contextual information in an advantageous way. Basic RWR and Context RWR are specifically designed to estimate the relevance between the target user and the items against the contextual graph. Also, we propose two post-processing strategies to filter recommendation results given contextual conditions. Being dependent on experimental results on two datasets, all proposed methods are effective to enhance the quality of context-aware recommendations.
Comparative study of two 3D reconstruction methods for underwater archaeology

The underwater 3D reconstruction cartography has made great progress in the last decade. The work presented in this paper is about the analysis and 3D reconstruction of archeological objects. Using a calibrated single camera and an uncalibrated system, we propose to describe a method to perform the Euclidian 3D reconstruction of unknown objects. A comparison of two methods is presented and tested on synthetic and real underwater pictures. Filters are proposed to simulate underwater environment and inherent problems. Finally, robust and stable features have been extracted from underwater pictures and used to perform the 3D model.
Tagging and Searching:

Many Web sites have begun allowing users to submit items to a collection and tag them with keywords. The folksonomies built from these tags are an interesting topic that has seen little empirical research. This study compared the search information retrieval (IR) performance of folksonomies from social bookmarking web sites against search engines and subject directories. Thirty-four participants created 103 queries for various information needs. Results from each IR system were collected and participants judged relevance. Folksonomy search results overlapped with those from the other systems, and documents found by both search engines and folksonomies were significantly more likely to be judged relevant than those returned by any single IR system type. The search engines in the study had the highest precision and recall, but the folksonomies fared surprisingly well. Del.icio. us was statistically indistinguishable from the directories in many cases. Overall the directories were more precise than the folksonomies but they had similar recall scores. Better query handling may enhance folksonomy IR performance further. The folksonomies studied were promising, and may be able to improve Web search performance.
Behaviour modelling notation for information system design

Problems related to behaviour modelling within the platform independent model (PIM) during the model driven design are discussed in the paper. The emphasis is on design problems for information systems, especially on building a behaviour draft. At first issues in the traditional approach using sequence diagrams are discussed. Then a new approach based on activity diagrams is proposed. An extension of activity diagram notation specifically oriented towards comprehensive and readable behaviour design description is presented.
Asylum policy in the European Union

principles of the White Paper were not always easy to measure, and the White Paper does not specify how in fact these principles should be measured. For instance, it is hard to give an objective mark with regard to the „openness‟ of an organization, or to say what amount of participation from societal actors in the policy process would be sufficient. A complicating yet also interesting factor was that recently there have been many developments on the field of asylum policy, particularly on the European level. For instance the recently effectuated Treaty of Lisbon has also had implications for the decision making on the field of asylum policy. The results of this research could be useful for the European Union. Ideally the EU would get more power and means to tackle issues regarding asylum, since the European level would be the most appropriate and effective level on this policy field. However first it would be better if the EU improves their own governance practices, particularly on the field of accountability. Across the EU this is a sensitive political subject. Hopefully these political obstacles can be overcome to come to a better European asylum policy in the future.
Author Manuscript, Published in "'international Joint Conferences on Computer, Information, and Systems Sciences, and Engineering' Cis2e 06, United States (2006)" an Efficient Fault-tolerant Scheduling Algorithm for Precedence Constrained Tasks in Heterogeneous Distributed Systems

In this paper, we propose an efficient scheduling algorithm for problems in which tasks with precedence constraints and communication delays have to be scheduled on an heterogeneous distributed system with one fault hypothesis. Our algorithm combines the DSS_OPT algorithm and the eFRCD algorithm. To provide a fault-tolerant capability, we employ primary and backup copies. In this scheme, backup copies can overlap other backup copies, and backup copies are not established for tasks that have more than one primary copy. The result is a schedule in polynomial time that is optimal when there is no failure, and is a good resilient schedule in the case of one failure.
TreeLogit Model for Customer Churn Prediction

For the purpose of improving the predictive accuracy and interpret ability of churn prediction model, TreeLogit model, which integrates the advantage of AD tree model and logistic regression model, is proposed in this paper to predict customers' churn propensities. Compared with TreeNetreg, a model which won the gold prize in the 2003 mobile customer churn prediction modeling contest (The Duke/NCR Teradata Churn Modeling Tournament) , the overall predictive accuracy of TreeLogit model is not inferior. In fact, the predictive accuracy of TreeLogit is superior to the one of TreeNetreg on two important observation points (i.e. the captured rates in 10% and 50% of the most likely churn groups respectively)
Clustering Human Association

We combined a novel associations strength ranking algorithm and an unsupervised Self Organizing Maps technique to cluster free associations. We tested the algorithm on 171 seed terms and showed a very good clustering performance. The algorithm suggests a linkage between the two biggest known databases the human mind and the Internet. The cluster labels can be used as highly informative aspects of the seed terms used for query expansion and off-line data retrieval algorithms.
The Use of Remote Sensing and Landscape Metrics to Describe Structures and Changes in Urban Land Uses

Remote sensing technology has great potential for acquisition of detailed and accurate land-use information for management and planning of urban regions. However, the determination of land-use data with high geometric and thematic accuracy is generally limited by the availability of adequate remote sensing data, in terms of spatial and temporal resolution, and digital image analysis techniques. This study introduces a methodology using information on image spatial form—landscape metrics—to describe urban land-use structures and land-cover changes that result from urban growth. The analysis is based on spatial analysis of land-cover structures mapped from digitally classified aerial photographs of the urban region Santa Barbara, CA. Landscape metrics were calculated for segmented areas of homogeneous urban land use to allow a further characterization of the land use of these areas. The results show a useful separation and characterization of three urban land-use types: commercial development, high-density residential, and low-density residential. Several important structural land-cover features were identified for this study. These were: the dominant general land cover (built up or vegetation), the housing density, the mean structure and plot size, and the spatial aggregation of built-up areas. For two test areas in the Santa Barbara region, changes (urban growth) in the urban spatial land-use structure can be described and quantified with landscape metrics. In order to discriminate more accurately between the three land-cover types of interest, the landscape metrics were further refined into what are termed ‘landscape metric signatures’ for the land-use categories. The analysis shows the importance of the spatial measurements as second-order image information that can contribute to more detailed mapping of urban areas and towards a more accurate characterization of spatial urban growth pattern.
Bayesian Combinatorial Auctions

We study the following simple Bayesian auction setting: m items are sold to n selfish bidders in m independent second-price auctions. Each bidder has a private valuation function that specifies his or her complex preferences over all subsets of items. Bidders only have beliefs about the valuation functions of the other bidders, in the form of probability distributions. The objective is to allocate the items to the bidders in a way that provides a good approximation to the optimal social welfare value. We show that if bidders have submodular or, more generally, fractionally subadditive (aka XOS) valuation functions, every Bayes-Nash equilibrium of the resulting game provides a 2-approximation to the optimal social welfare. Moreover, we show that in the full-information game, a pure Nash always exists and can be found in time that is polynomial in both m and n.
Iteratively reweighted least squares minimization for sparsely corrupted measurements

In this paper we have studied an alternative method of determining a sparse signal from sparsely corrupted measurements using iteratively reweighted least squares (IRLS). It is well known that the theory of compressive sensing (CS) has shown that if a signal having length N has a sparse representation on an orthonormal basis, then it is possible to recover this signal exactly from M≪N measurements. Using lp minimization with p&#60;1 instead of l1 minimization can further decrease the number of measurements. Simulation results are given for different values of p for IRLS and compare it to iteratively reweighted l1 minimization for sparsely corrupted measurements. Simulations show that fewer measurements are needed for exact reconstruction compared to iteratively reweighted l1 minimization.
Stretched horizons, quasiparticles and quasinormal modes

We propose that stretched horizons can be described in terms of a gas of non-interacting quasiparticles. The quasiparticles are unstable, with a lifetime set by the imaginary part of the lowest quasinormal mode frequency. If the horizon arises from an AdS/CFT style duality the quasiparticles are also the effective low-energy degrees of freedom of the finite-temperature CFT. We analyze a large class of models including Schwarzschild black holes, non-extremal Dp-branes, the rotating BTZ black hole and de Sitter space, and we comment on degenerate horizons. The quasiparticle description makes manifest the relationship between entropy and area.
Speaker independent robust phoneme recognition using Higher-Order statistics and entropic-based features in adverse environments

In this work we present an algorithmic scheme for speaker independent robust phoneme recognition in noisy environments. The main modules of our proposal are composed by computing novel features that are based on Higher-order statistics, Rényi and Shannon's entropy and then by using Random Forests as classifier of the system. The main motivation is to combine ideas from different fields, that have been partially successful, in order to characterize, shed light and tackle the hardness of robust phoneme recognition. Our experiments were carried out over a subset of phonemes of the TIMIT database and the results show potential of the method in environments of varying degrees in the presence of noise and even competing and surpassing state of the art methodologies found in the literature.
Moments Invariant for Expression Invariant Thermal Human Recognition

Recent advancement of technologies in the field of bioinformatics and pattern recognition provides the opportunities for researchers and scientists to explore in depth the thermal human face image signals and to convert information into a meaningful knowledge through computational-based models, for the task of identification and recognition. Despite successes in indoor access control applications, imaging in the visible spectrum demonstrates difficulties in recognizing the faces in conditions of varying illumination and expression. Recently, researchers have investigated the use of thermal imagery for face recognition with good results. The use of thermal infrared images can improve the performance of face recognition in uncontrolled conditions. In this paper, we present a new technique for face recognition based on histogram distribution and moments invariants of thermal images of varying expressions. The new method has been tested on a new database comprising of images of different expressions and were taken within different time-lapse. Further, the database is challenged with images suffering from opaqueness. The experimental results have shown Rank-1 success rate of 98%.
Glimepiride Versus Metformin as Monotherapy in Pediatric Patients With Type 2 Diabetes

OBJECTIVE—To compare the efficacy and safety of glimepiride versus metformin in pediatric subjects with type 2 diabetes inadequately controlled with diet and exercise alone or oral monotherapy. RESEARCH DESIGN AND METHODS—This 26-week, single-blind, active-controlled, multinational study randomized 285 subjects to receive glimepiride (1–8 mg once daily) or metformin (500–1000 mg twice daily) for 24 weeks. The primary end point was mean change in A1C from baseline to week 24. Safety was assessed by incidence of hypoglycemia and other adverse events. RESULTS—Significant reductions from baseline A1C were seen in both the glimepiride (−0.54%, P = 0.001) and metformin (−0.71%, P = 0.0002) groups. A total of 42.4% (56 of 132) and 48.1% (63 of 131) of subjects in the glimepiride and metformin groups, respectively, in the intent-to-treat population achieved A1C <7.0% at week 24. No significant differences were observed between groups in reductions in A1C and self-monitored blood glucose levels, changes in serum lipid concentrations, or hypoglycemia incidence. Significant differences were observed in mean changes from baseline in BMI between groups (0.26 kg/m2 for glimepiride and −0.33 kg/m2 for metformin; P = 0.003). The adjusted mean body weight increase was 1.97 kg for glimepiride and 0.55 kg for metformin (P = 0.005). A hypoglycemic episode with blood glucose <50 mg/dl (<2.8 mmol/l) was experienced by 4.9 and 4.2% of glimepiride- and metformin-treated subjects, respectively. A single severe hypoglycemic event occurred in each group. CONCLUSIONS—Glimepiride reduced A1C similarly to metformin with greater weight gain, and there was comparable safety over 24 weeks in the treatment of pediatric subjects with type 2 diabetes.
Reconstruction of Walking People Images by Principal Component Analysis

The Principal Component Analysis (PCA) is a useful statistic technique that has found applications in fields such as recognition, classification and image data compression. It is also a common technique in extracting features from data in a high dimensional space. By linearly transforming the images into eigenspace, we project the images into a new N Dimensional space, which exhibits the properties of the samples most clearly along the coordinate axes. The most significant features /information of the images will be in the first few principal components. We can do image data compression by only keeping the first few principal components. In this project, we will show that we can compress the walking people images and later reconstruct the original images without much loss from the reduced data.