Miracle-dz/UniFAR-FTUs huggingface dataset:
Multicast Extension to Proxy Mobile IPv6 for Mobile Multicast Services

Recently, Proxy Mobile TPv6 (pMIPv6) has received much attention as a mobility management protocol in next-generation all-If" mobile networks. While the current research related to PMTPv6 mainly focuses on providing efficient handovers for unicast-based applications, there has been relatively little interest in supporting multicast services with PMIPv6. To provide support for multicast services with PMIPv6, there are two alternative approaches called Mobile Access Gateway (MAG)-based subscription and Local Mobility Anchor (LMA)-based subscription. However, MAG-based subscription causes a large overhead for multicast joining and LMA-based subscription provides non-optimal multicast routing paths. The two approaches may also cause a high packet loss rate. In this paper, we propose an efficient PMIPv6-based multicast protocol that aims to provide an optimal delivery path for multicast data and to reduce handover delay and packet loss rate. Through simulation studies, we found that the proposed protocol outperforms existing multicast solutions for PMIPv6 in terms of end-to-end delay, service disruption period, and the number of lost packets during handovers.
DIFFERENT STAR FORMATION LAWS FOR DISKS VERSUS STARBURSTS AT LOW AND HIGH REDSHIFTS

We present evidence that bona fide disks and starburst systems occupy distinct regions in the gas mass versus star formation rate (SFR) plane, both for the integrated quantities and for the respective surface densities. This result is based on carbon monoxide (CO) observations of galaxy populations at low and high redshifts, and on the current consensus for the CO luminosity to gas mass conversion factors. The data suggest the existence of two different SF regimes: a long-lasting mode for disks and a more rapid mode for starbursts, the latter probably occurring during major mergers or in dense nuclear SF regions. Both modes are observable over a large range of SFRs. The detection of CO emission from distant near-IR selected galaxies reveals such bimodal behavior for the first time, as they allow us to probe gas in disk galaxies with much higher SFRs than are seen locally. The different regimes can potentially be interpreted as the effect of a top-heavy initial mass function in starbursts. However, we favor a different physical origin related to the fraction of molecular gas in dense clouds. The IR luminosity to gas mass ratio (i.e., the SF efficiency) appears to be inversely proportional to the dynamical (rotation) timescale. Only when accounting for the dynamical timescale, a universal SF law is obtained, suggesting a direct link between global galaxy properties and the local SFR.
Analytical survey on automated software test data evaluation

Automated software test data optimization has become a major aspect in quality of any software. For quality different test cases has to be performed for testing. In order to evaluate every aspect of the software program the number of test cases has increased tremendously. In this paper author have tried to evaluate different proposed techniques for automated software test data optimization and emphasize is made to extract the critical factors which need to be present in any technique to make the technique optimized one. These factors are then evaluated on the basis of different papers and concluded some results which are beneficial to work for the creation of an optimized technique.
Semi-supervised learning with an explicit label-error model for misclassified data

This paper investigates a new approach for training discriminant classifiers when only a small set of labeled data is available together with a large set of unlabeled data. This algorithm optimizes the classification maximum likelihood of a set of labeledunlabeled data, using a variant form of the Classification Expectation Maximization (CEM) algorithm. Its originality is that it makes use of both unlabeled data and of a probabilistic misclassification model for these data. The parameters of the labelerror model are learned together with the classifier parameters. We demonstrate the effectiveness of the approach on four data-sets and show the advantages of this method over a previously developed semi-supervised algorithm which does not consider imperfections in the labeling process.
What are Fidelity Requirements ? Why Do We Need Them ?

In the report from the SISO Implementation Study Group on Fidelity Definition and Metrics (FDM-ISG) simulation fidelity is put forward as a major tool for the development and validation of simulations. Critical in both activities is the usage of well-defined fidelity requirements. Fidelity requirements represent the level of realism the simulation must display in order to fulfil the user’s needs and objectives. Without being able to specify them formally, fidelity’s potential as a validation technique or a tool for making design decisions becomes questionable. This paper discusses the role of fidelity requirements in the simulation development process and proposes a structured approach for the identification, specification and validation of fidelity requirements. The approach presented here builds on a previous paper describing a fidelity management process overlay onto the federation development and execution process (FEDEP) and provides a more detailed view of several activities from this overlay concerning fidelity requirements characterisation and usage. Much emphasis is placed on how to utilise the recent achievements of the FDM-ISG in specifying better simulation requirements.
Detection of Rhythmic Discharges in Newborn EEG Signals

This paper presents a scalp eletroencephalogram (EEG) rhythmic pattern detection scheme based on neural networks. rhythmic discharges detection is applicable to the majority of seizures seen in newborns, and is listed as detecting 90% of all the seizures. In this approach some features based on various methods are extracted and compared by a modified multilayer neural network in order to find rhythmic discharges. Statistical performance comparison with seizure detection schemes of Gotman et al. and Liu et al. is performed.
An Effect System for Algebraic Effects and Handlers

We present an effect system for algebraic effects and handlers. Because handlers may transform an effectful computation into a pure one, the effect system is non-monotone in the sense that effects do not just accumulate, but may also be deleted from types or generally transformed. We also provide denotational semantics for the effect system, based on a domain-theoretic model with partial equivalence relations. The semantics validates equational reasoning about effectful computations.
Development and Experimental Validation of a Haptic Compass Based on Asymmetric Torque Stimuli

This paper presents the design, control, and experimental validation of a haptic compass, designed as a guiding device for all environments. The proposed device uses the principle of asymmetric torques. Its design is based on a direct drive motor and a pre-calibrated open-loop control, which allows the generation of stimuli in a wide range of frequencies. User studies are presented and show optimum effectiveness in the frequency range 5-15 <inline-formula> <tex-math notation="LaTeX">$\mathrm{\mathrm{Hz}\;a}$</tex-math><alternatives> <inline-graphic xlink:href="gosselin-ieq1-2580144.gif"/></alternatives></inline-formula>nd for torques over <inline-formula><tex-math notation="LaTeX">$40\; \mathrm{m}\mathrm{N}\mathrm{m}$</tex-math><alternatives> <inline-graphic xlink:href="gosselin-ieq2-2580144.gif"/></alternatives></inline-formula>. The use of a haptic feedback proportional to the angle error is then shown to significantly improve the results. An experimental validation by a group of‘ subjects with the portable device using these stimuli is reported. The results show that all subjects met all route objectives with small lateral deviations (avg. <inline-formula><tex-math notation="LaTeX"> $\mathrm{0.39\;\mathrm{m}}$</tex-math><alternatives><inline-graphic xlink:href="gosselin-ieq3-2580144.gif"/> </alternatives></inline-formula>).
Personalization of Statistical Face Models for Tracking and Animation

Linear and multilinear geometric models of human faces (e.g. blend shapes) are one of the prime representations for facial action in conputer vision and graphics. Well-crafted, person-specific models involve lots of manual labour but enable photorealistic animations. On the other hand, simple and generic models are well established for tracking facial action in video since they are robust and allow the estimation of facial geometry even from monocular data, e.g. [Pighin et al. 1999]. Between those extremes, statistical models created from semantically aligned sets of 3D face scans can cover a part of the variety of shapes and expressions that human faces may take on while still looking rather realistic, e.g. [Bolkart and Wuhrer 2013]. However, the number of shapes they can resemble is limited and they often lack detail since they mainly represent lower order subspaces of the data used to create them.
From the Telegraph to Twitter Group Chats

Author(s): Cook, James Alexander | Advisor(s): Rao, Satish | Abstract: Communication now is easier than ever before. One consequence of this is the emergence of virtual communities, unconstrained by physical proximity. We perform two investigations into changing social trends. We study a corpus of 100 years of newspaper articles to see if we can find evidence to support the popular intuition that as news cycles have sped up, the public's attention span has gotten shorter. We find no such evidence: to the contrary, we find that the typical length of time that a person's name stays in the news has not changed over time, and celebrities now stay in the news for longer than ever before. We also investigate a new kind of community on Twitter called a group chat, where members have regular meetings to discuss a broad range of topics, from medical conditions to hobbies. We find that the phenomenon is growing over time, and paint a broad picture of the topics which one could find a group chat to discuss. With a view to helping connect new participants to group chats they may not have been able to find or might not have been aware of, we design an algorithm to rank group chats in the context of a topic given as a query.
Excision Repair Cross-Complementation Group 1 Polymorphism Predicts Overall Survival in Advanced Non-Small Cell Lung Cancer Patients Treated With Platinum-Based Chemotherapy

DNA repair is a critical mechanism of resistance to platinum-based chemotherapy. Excision repair cross-complementation group 1 (ERCC1) is the lead enzyme in the nucleotide excision repair process. Increased ERCC1 mRNA levels are related directly to platinum resistance in various cancers. We examined the association between two polymorphisms of ERCC1, codon 118 C/T and C8092A, which are associated with altered ERCC1 mRNA levels and mRNA stability, and overall survival (OS) in 128 advanced non-small cell lung cancer patients treated with platinum-based chemotherapy. The two polymorphisms were in linkage disequilibrium. There was a statistically significant association between the C8092A polymorphism and OS (P = 0.006, by log-rank test), with median survival times of 22.3 (C/C) and 13.4 (C/A or A/A) months, respectively, suggesting that any copies of the A allele were associated with poor outcome. No statistically significant association was found for the codon 118 polymorphism and OS (P = 0.41, by log-rank test), with median survival times of 19.9 (T/T), 16.1 (C/T), and 13.3 (C/C) months, respectively. In conclusion, the ERCC1 C8092A polymorphism may be a useful predictor of OS in advanced non-small cell lung cancer patients treated with platinum-based chemotherapy.
Does Video Gaming Affect Orthopaedic Skills Acquisition? A Prospective Cohort-Study

Introduction Previous studies have suggested that there is a positive correlation between the extent of video gaming and efficiency of surgical skill acquisition on laparoscopic and endovascular surgical simulators amongst trainees. However, the link between video gaming and orthopaedic trauma simulation remains unexamined, in particular dynamic hip screw (DHS) stimulation. Objective To assess effect of prior video gaming experience on virtual-reality (VR) haptic-enabled DHS simulator performance. Methods 38 medical students, naïve to VR surgical simulation, were recruited and stratified relative to their video gaming exposure. Group 1 (n = 19, video-gamers) were defined as those who play more than one hour per day in the last calendar year. Group 2 (n = 19, non-gamers) were defined as those who play video games less than one hour per calendar year. Both cohorts performed five attempts on completing a VR DHS procedure and repeated the task after a week. Metrics assessed included time taken for task, simulated flouroscopy time and screw position. Median and Bonett-Price 95% confidence intervals were calculated for seven real-time objective performance metrics. Data was confirmed as non-parametric by the Kolmogorov-Smirnov test. Analysis was performed using the Mann-Whitney U test for independent data whilst the Wilcoxon signed ranked test was used for paired data. A result was deemed significant when a two-tailed p-value was less than 0.05. Results All 38 subjects completed the study. The groups were not significantly different at baseline. After ten attempts, there was no difference between Group 1 and Group 2 in any of the metrics tested. These included time taken for task, simulated fluoroscopy time, number of retries, tip-apex distance, percentage cut-out and global score. Conclusion Contrary to previous literature findings, there was no correlation between video gaming experience and gaining competency on a VR DHS simulator.
A Novel Routing Technique against Packet Dropping Attack in Adhoc Networks

Problem Statement: Mobile adhoc networks (MANETs) were extensively used in defense and rescue applications. The dynamic topology of MANETs allows nodes to join and leave the network at any point of time. This dynamic property of MANET has rendered it vulnerable to various security attacks. Many trust establishment methods were proposed to increase the security in MANET. In this paper we propose a new trust based relationship among the nodes to combat the packet dropping attack. Approach: In the proposed scheme we considered the dynamic source routing protocol for simulation due to its common usage and flexible nature. Network simulator-2 was used for the simulation and the standard DSR and proposed relationship enhanced DSR were compared. Results: The result of the proposed scheme was compared with the standard DSR protocol. The performance metrics such as normalized throughput, packet delivery ratio, dropped data packets and ratio between the total drop and malicious drops were used for the comparison study. The results obtained prove that the proposed scheme outscores the traditional DSR protocol in all aspects. Conclusions/Recommendations: The proposed trust enhanced dynamic source routing protocol provides the solution for the possible packet dropping attack in an adhoc network. As the results show it has enhanced technique for encountering such type of attacks when compared to the traditional DSR protocol.
Incorporating valley filling and peak shaving in a utility function based management of an electric vehicle aggregator

Shifting load away from the system peak into evening hours when the load is low and the network's capacity is high is referred to as peak shaving and valley filling. This paper develops an approach to enforce such a charging behavior to a large fleet of individual electric vehicles. The vehicles move in a transportation network which is mapped to a realistic urban electricity distribution system. Each vehicle features a utility function based on which the charging is controlled. The algorithm tunes the utility function parameters order to initiate the desired charging behavior. Individual behavioral constraints, such as a desired state of charge when leaving, are fully considered.
Automatic Labeling of Semantic Role on Chinese FrameNet Using Conditional Random Fields

Given an input sentence and a target word and its frame, automatic semantic role labeling on the Chinese FrameNet (CFN) database can be divided into two subtasks. One is identification of the boundaries of semantic roles, and the other is the classification of semantic roles. In this paper, the tasks are regarded as a sequential tagging problem in the sentence at word-level, so the model of conditional random fields was adopted. The best feature templates of the model were chosen by applying orthogonal arrays. The training and testing data sets consist of the sample sentences of 25 frames selected from the current CFN corpus. The experimental results in our test data set show that the F-measure for identifying boundaries of semantic roles reached 70.42\%, and the accuracy in classifying semantic roles achieved 80.4\%, but when the two subtasks were sequential automatically processed, the result was 59.48\% F-measure.
Salt-mediated two-site ligand binding by the cocaine-binding aptamer

Abstract Multisite ligand binding by proteins is commonly utilized in the regulation of biological systems and exploited in a range of biochemical technologies. Aptamers, although widely utilized in many rationally designed biochemical systems, are rarely capable of multisite ligand binding. The cocaine-binding aptamer is often used for studying and developing sensor and aptamer-based technologies. Here, we use isothermal titration calorimetry (ITC) and NMR spectroscopy to demonstrate that the cocaine-binding aptamer switches from one-site to two-site ligand binding, dependent on NaCl concentration. The high-affinity site functions at all buffer conditions studied, the low-affinity site only at low NaCl concentrations. ITC experiments show the two ligand-binding sites operate independently of one another with different affinities and enthalpies. NMR spectroscopy shows the second binding site is located in stem 2 near the three-way junction. This ability to control ligand binding at the second site by adjusting the concentration of NaCl is rare among aptamers and may prove a useful in biotechnology applications. This work also demonstrates that in vitro selected biomolecules can have functions as complex as those found in nature.
Spectroscopic Observations of Optically Selected Clusters of Galaxies from the Palomar Distant Cluster Survey

We have conducted a redshift survey of 16 cluster candidates from the Palomar Distant Cluster Survey (PDCS) to determine both the density of PDCS clusters and the accuracy of the estimated redshifts presented in the PDCS catalog. We find that the matched-filter redshift estimate presented in the PDCS has an error σz = 0.06 in the redshift range 0.1 ≤ z ≤ 0.35 based on eight cluster candidates with three or more concordant galaxy redshifts. We measure the low-redshift (0.1 ≤ z ≤ 0.35) space density of PDCS clusters to be 31.3 × 10-6 h3 Mpc-3 (68% confidence limits for a Poisson distribution) for richness class 1 systems. We find a tentative space density of 10.4 × 10-6 h3 Mpc-3 for richness class 2 clusters. These densities compare favorably with those found for the whole of the PDCS and support the finding that the space density of clusters in the PDCS is a factor of ≃5 above that of clusters in the Abell catalog. These new space density measurements were derived as independently as possible from the original PDCS analysis and therefore demonstrate the robustness of the original work. Based on our survey, we conclude that the PDCS matched-filter algorithm is successful in detecting real clusters and in estimating their true redshifts in the redshift range we surveyed.
Incorporating Fault Tolerance with Replication on Very Large Scale Grids

Providing fault tolerance for message passing parallel application on a distributed environment is a rule rather than an exception. A node failure can cause the whole computation to stop and has to be restarted from the beginning if no fault tolerance is available. However, introducing fault tolerance has some overhead on speedup that can be achieved. In this paper, we introduce a new technique called replication with cross-over packets for reliability and to increase fault tolerance over Very Large Scale Grids (VLSG). This technique has two pronged effect of avoiding single point of failure and single link of failure. We incorporate this new technique into the L-BSP model and show the possible speedup of parallel process. We also derive the achievable speedup for some fundamental parallel algorithms using this technique.
Accounting for background nucleotide composition when measuring codon usage bias.

The phenomenon of codon usage bias has been important in the study of evolution because it provides examples of weak selection working at the molecular level. During the last two decades, evidence has accumulated that some examples of codon usage bias are driven by selection, particularly for species of fungi (e.g., Bennetzen and Hall 1982; Ikemura 1985), bacteria (e.g., Ikemura 1981; Sharp and Li 1987), and insects (e.g., Akashi 1997; Moriyama and Powell 1997). This connection between codon usage bias and selection has been important in stimulating the development of alternatives to strictly neutral theories of molecular evolution (Ohta and Gillespie 1996; Kreitman and Antezana 2000). Uncertainty persists, however, regarding the phylogenetic distribution of codon usage bias (such as whether selection-based codon usage bias is present in mammals; e.g., Karlin and Mrazek 1996; Iida and Akashi 2000; Sueoka and Kawanishi 2000; Smith and EyreWalker 2001a; Urrutia and Hurst 2001). Questions also remain as to what models of selection underlie codon preferences (Kreitman and Antezana 2000), and specifically whether the presence of suboptimal codons is the result of mutation and drift, variation in selection pressure across sites, or antagonistic selection pressures (Smith and Eyre-Walker 2001b). For investigating certain questions regarding the evolution of codon usage bias, it is useful to have a summary statistic describing the pattern of codon usage across all amino acids. Many summary statistics have already been developed to describe the patterns of codon usage. They can be divided roughly into two classes (Comeron and Aguade 1998). One class summarizes the usage of certain preferred codons, and the other compares every codon’s usage to a null distribution (typically uniform usage of synonymous codons). The former class of methods has the disadvantage that it requires a prior knowledge of the preferred codons. With summary statistics one can explore general patterns, such as the relationship of codon usage bias to recombination rate, gene length, or synonymous substitution rate. Observing broad patterns such as these has already provided insight into the evolutionary dynamics of codon usage bias (Kliman and Hey 1993; Akashi and Eyre-Walker 1998; Kreitman and Comeron 1999).
An Improved Extreme Learning Machine with Parallelized Feature Mapping Structures

Compared with deep neural network which is trained using back propagation, the extreme learning machine (ELM) learns thousands of times faster but still produces good generalization performance. To better understand the ELM, this paper studies the effect of noise on the input nodes or hidden neurons. It was found that there is no effect on the performance of ELM when small amount of noise is added to the input or the neurons in the hidden layer. Although the performance of ELM would improve with an increase in the number of neurons in the hidden layer, beyond a certain limit, this could lead to overfitting. In view of this, a parallel ELM (P-ELM) is proposed to improve the system performance. P-ELM has better robustness to noise due to the ensemble nature and is less susceptible to overfitting since each parallel hidden layer has only a moderate number of hidden neurons. Experimental results have indicated that the proposed P-ELM can achieve better classification performance than ELM without large increase in training time.