Miracle-dz/UniFAR-FTUs huggingface dataset:
Inductive Power Transfer for Automotive Applications: State-of-the-Art and Future Trends

The paper discusses the development status of the inductive power transmission for automotive applications. This technology is, in fact, gaining the interest of electric vehicle manufacturers as an effective strategy to improve the market penetration of electric mobility. Starting from the origin of this technology, the paper presents an overview of the current state of the art as well as the current research and industrial projects. Particular attention is devoted to the description of a prototypal system for the dynamic inductive power transmission whose goal is to extend the battery range by a fast partial recharging during the movement of the vehicle.
Timetable scheduling using graph coloring

The problem of constructing an automated system for timetabling is a particularly well known one. Timetabling is a common example of a scheduling problem and can manifest itself in several different forms; the particular form of timetable required is specific to the environment or organization in which it is needed. Many programs exist for this task but they perform well only in particular isolated environment. With the help of graph coloring, it is proposed to develop a general system that can cope with the ever changing requirements of large educational institutions. Timetabling problem is a NP-hard problem. many combinatorial problems (optimization problems) are NPhard. It is generally believed that NP-hard problems cannot be solved to optimality within times which are polynomial bounded functions of input size. Therefore there is much interest in heuristic algorithms which can find near optimal solutions within reasonable running time. One of the most studied NP-hard problems is the “graph coloring problem”. Graph coloring has numerous applications in scheduling and other practical problem; “timetabling” is one of them. One of the heuristic approaches to solve graph coloring is “Ant algorithm” [1].
Too Pretty for Homework: The Academic Correlates of Sexualized Gender Stereotypes Among Adolescent Girls

OF THESIS TOO PRETTY FOR HOMEWORK: THE ACADEMIC CORRELATES OF SEXUALIZED GENDER STEREOTYPES AMONG ADOLESCENT GIRLS Girls grow up in a culture of ubiquitous female sexualization, and this culture propagates stereotypes that could interfere with their academic outcomes. The current study examined the academic correlates of these sexualized gender stereotypes (SGS) among early adolescent girls. Girls (N = 99) aged 11 to 14 (Mage = 12.4 years, SD = .57 years) completed a survey assessing their academic performance, attitudes, and beliefs. The survey also assessed the degree to which girls believed that boys and girls should act in accordance with these sexualized gender stereotypes. Results indicated that higher endorsement of sexualized gender stereotypes was associated with lower academic performance, more negative academic attitudes, and less adaptive approaches to learning. Implications for girls’ academic trajectories are discussed.
EVOLUTION OF TRIPLOIDY IN APIOS AMERICANA (LEGUMINOSAE) REVEALED BY GENEALOGICAL ANALYSIS OF THE HISTONE H3‐D GENE

Abstract Autotriploidy is normally considered to be maladaptive in plants because of its association with high levels of sterility. Nonetheless, triploid individuals are found in many plant species and play important roles in plant evolution, in particular as a first step toward tetraploid formation. However, few studies have addressed the evolutionary potential of triploid lineages, which may principally suffer from the impossibility of combining useful mutations in a single genome due to their low fertility. Therefore, triploids acquire genetic diversity only via recurrent evolution and somaclonal mutation. This study evaluates the potential of multiple origins of polyploidy as a source of genetic diversity in Apios americana, a North American legume that possesses both diploid and triploid populations. Ploidy level determination via flow cytometry shows that triploids are mainly restricted to the portion of eastern North America that was covered by ice during the Wisconsinan glaciation 18,000 years ago. This distribution implies that either selection or postglaciation colonization played a role in shaping this cytogeographic pattern. A haplotype network of the single copy nuclear histone H3‐D gene reconstructed using statistical parsimony, together with single‐strand conformational polymorphism analysis, shows that autotriploidy evolved at least three times in this species and that heterozygosity is high in triploids. The genetic diversity found in A americana resulting from recurrent evolution and fixed heterozygosity increases the likelihood of producing successful genotypes and may give the opportunity for triploids to be better fit than diploids in new habitats. This suggests that triploid lineages can exhibit evolutionary potential of their own, and do not serve solely as a first step toward tetraploid formation.
HPRA: A pro-active Hotspot-Preventive high-performance routing algorithm for Networks-on-Chips

The inherent spatio-temporal unevenness of traffic flows in Networks-on-Chips (NoCs) can cause unforeseen, and in cases, severe forms of congestion, known as hotspots. Hotspots reduce the NoC's effective throughput, where in the worst case scenario, the entire network can be brought to an unrecoverable halt as a hotspot(s) spreads across the topology. To alleviate this problematic phenomenon several adaptive routing algorithms employ online load-balancing functions, aiming to reduce the possibility of hotspots arising. Most, however, work passively, merely distributing traffic as evenly as possible among alternative network paths, and they cannot guarantee the absence of network congestion as their reactive capability in reducing hotspot formation(s) is limited. In this paper we present a new pro-active Hotspot-Preventive Routing Algorithm (HPRA) which uses the advance knowledge gained from network-embedded Artificial Neural Network-based (ANN) hotspot predictors to guide packet routing across the network in an effort to mitigate any unforeseen near-future occurrences of hotspots. These ANNs are trained offline and during multicore operation they gather online buffer utilization data to predict about-to-be-formed hotspots, promptly informing the HPRA routing algorithm to take appropriate action in preventing hotspot formation(s). Evaluation results across two synthetic traffic patterns, and traffic benchmarks gathered from a chip multiprocessor architecture, show that HPRA can reduce network latency and improve network throughput up to 81% when compared against several existing state-of-the-art congestion-aware routing functions. Hardware synthesis results demonstrate the efficacy of the HPRA mechanism.
Observer design for rectangular discrete-time singular systems with time-varying delay

In this paper, observer design problem for rectangular discrete-time singular systems with time-varying delay is discussed. Based on restricted system equivalent (RSE) transformations and by introducing new state vectors, the problem is transformed into observer design problem for time-varying delay discrete-time standard state-space systems. By Lyapunov function method and linear matrix inequality (LMI) technique, the delay-dependent sufficient condition that there exists a state observer is established. The design method of matrix K is discussed and the coefficient matrices of function observer are given. Finally, a numerical example is given showing the effectiveness of the method given in the paper.
AN EXPERIMENT ON VISIBLE CHANGES OF WEB PAGES

Since web pages are created, changed, and destroyed constantly, web databases (local collections of web pages) should be updated to maintain web pages up-to-date. In order to effectively keep web databases fresh, a number of studies on the change detection of web pages have been carried out, and various web statistics have been reported in the literature. This paper considers the issues of web page changes in terms of user visuality. First, we consider the effect of a number of tags that do not make difference in terms of user visuality. We learned that approximately 4.5% of web page changes under the byte-wise comparison were unnecessarily determined. Secondly, we investigated the relationship between ‘TITLE’ tags and ‘BODY’ tags in terms of web page changes. We found out that an inspection of ‘TITLE’ tags could allow users to sufficiently determine the change of web pages, so that we can significantly reduce the comparison time of web pages.
The Relative Biological Effectiveness of Low-Dose Mammography Quality X Rays in the Human Breast MCF-10A Cell Line

Mammography is used to screen a large fraction of the population for breast cancer, and mammography quality X rays are speculated to be more damaging than the higher energy X rays used for other diagnostic procedures. The radiation dose delivered to breast cells as a result of these screening exposures may be a concern. The purpose of this current study was to determine the relative biological effectiveness (RBE) of low-energy mammography X rays for radiation-induced DNA double-strand breaks evaluated using a highly sensitive automated 53BP1 assay. Automation of the 53BP1 assay enabled the quantification and analysis of meaningful image-based features, including foci counting, within the cell nuclei. Nontumorigenic, human breast epithelial MCF-10A cells were irradiated in the low-dose range with approximately 3–30 mGy of 29 kVp mammography X rays or 137Cs (662 keV) gamma rays. The induction and resolution of the 53BP1 foci did not differ significantly between exposures to 137Cs gamma rays and 29 kVp X rays. The RBE was calculated to be 1.1 with a standard deviation of 0.2 for the initial number of radiation-induced double-strand breaks. The radiation dose from a single mammogram did not yield a significant change in the number of detectable foci. However, analysis of additional features revealed subtle differences in the distribution of 53BP1 throughout the nuclei after exposure to the different radiation qualities. A single mammogram was sufficient to alter the distribution of 53BP1 within the nuclear area, but not into discrete foci, while a dose-matched gamma exposure was not sufficient to alter the distribution of 53BP1. Our results indicate that exposure to clinically relevant doses of low-energy mammography quality X rays does not induce more DNA double-strand breaks than exposure to higher energy photons.
Effects of emotion regulation strategies on sexual risk-taking

Sexual risk-taking is a growing problem and an area where there are significant individual differences in behavior. One contributing factor to isky sexual behavior may be emotion regulation difficulties. For example, suppression h as negative effects on emotion experience, while reappraisal leads to increased well-being. Pr evious research has demonstrated the use of sexual behavior as an emotion regulation strateg y in victimized populations. This study investigated whether emotion regulation strategies influence sexual risk-taking in a nonclinical college population. Individuals with highe r l vels of emotion regulation difficulties and higher suppression use engaged in more frequent sexual risk-taking behavior, whereas individuals who used reappraisal more frequently en gaged in less sexual risk-taking. In addition, the use of reappraisal partially mediated the relationship between difficulties in emotion regulation and risky sexual behavior, for f emales. The gender differences suggest that females may benefit most significantly from ri sk-taking interventions focused on increasing positive emotion regulation strategies.
Search Results Clustering without External Resources

Our unsupervised Search Results Clustering (SRC) system partitions into clusters the top-n results returned by a search engine. We present the results of experiments with our SRC system that performs incremental clustering on document titles and snippets only and does not use external resources, yet which outperforms the best performers to date on the SemEval-2013 Task 11 gold standard. We include Latent Semantic Analysis (LSA) as an optional step, using the snippets themselves as the background corpus. We demonstrate that better results are achieved by leaving the query terms out of the clustering process, and that currently, the version without LSA outperforms the version with LSA.
Experiences in Software Testing Education: Some Observations from an International Cooperation

This paper examines the outcomes of teaching a course in software testing in Ireland and China over a two-year period. In both institutions the delivery of the course is constrained to two-week duration. The learning objectives for this course are explained. The outcomes of the courses in terms of student learning are compared and analyzed. A number of observations are made that lead to recommendations as to how the educational experience can be improved for the students in both countries.
Fault Management in Functionally Distributed Transport Networking for Large Scale Networks

We propose a fault management method in functionally distributed transport networking that separates the control-plane processing part (control element, CE) from the forwarding-plane processing part (forwarding element, FE) of the router. In this architecture, one path-control process in the CE consolidates and processes the path computations and the path settings for multiple routers. This leads to reduction in the path-control complexity and efficient operation of large scale networks. On the other hand, if faults occur in a CE and the CE become unable to serve a routing function, all of the FEs controlled by the CE will be affected. Therefore, it is absolutely critical to ensure the high reliability of the CE in this architecture. The proposed method takes the redundant configuration of N+m CEs and switches from a fault CE to a standby CE. Additionally, we describe the operation of each component in the proposed method and evaluate its feasibility by using software implementation.
Exploring the Guessability of Image Passwords Using Verbal Descriptions

One claimed advantage of the image passwords used in recognition based graphical authentication systems (RBGSs) over text passwords is that they cannot be written down or verbally disclosed. However, there is no empirical evidence to support this claim. In this paper, we present the first published comparison of the vulnerability of four different image types -Mikon, doodle, art and everyday object images to verbal/spoken descriptions, when used as passwords in RBGS. This paper considers one of the human factors in security i.e. password sharing through spoken descriptions. The user study conducted with 126 participants (56 callers/ describer and 70 listeners/ attacker) measures how easy it is for an attacker to guess a password in a RBGS, if the passwords are verbally described. The experimental set up is a two way dialogue between a caller and a listener over telephone using repeated measures protocol, which measures mean successful login percentage. The results of the study show the object images to be most guessable, and doodles follow close behind. Mikon images are less guessable than doodle followed by art images, which are the least guessable. We believe that unless, the human factors in security like the one considered in this paper is taken into account, the RBGSs will always look secure on paper, but fail in practice.
A Novel Shared Path Protection Scheme for Reliability Guaranteed Connection

In this paper, we study the shared path protection (SPP) problem in wavelength division multiplexing (WDM) optical networks, and propose a novel SPP algorithm with differentiated reliability (DiR) called SPP-DiR. Differing from previous work, SPP-DiR algorithm effectively adapts to the diversity demands of customer requests and has higher resource utilization than SPP algorithm. Therefore, SPP-DiR algorithm outperforms the previous work. Simulation results have shown to be promising.
An Approach to Parallel Simulation of Ordinary Differential Equations

Cyber-physical systems (CPS) represent a class of complex engineered systems where functionality and behavior emerge through the interaction between the computational and physical domains. Simulation provides design engineers with quick and accurate feedback on the behaviors generated by their designs. However, as systems become more complex, simulating their behaviors becomes computation all complex. But, most modern simulation environments still execute on a single thread, which does not take advantage of the processing power available on modern multi-core CPUs. This paper investigates methods to partition and simulate differential equation-based models of cyber-physical systems using multiple threads on multi-core CPUs that can share data across threads. We describe model partitioning methods using fixed step and variable step numerical in-tegration methods that consider the multi-layer cache structure of these CPUs to avoid simulation performance degradation due to cache conflicts. We study the effectiveness of each parallel simu-lation algorithm by calculating the relative speedup compared to a serial simulation applied to a series of large electric circuit models. We also develop a series of guidelines for maximizing performance when developing parallel simulation software intended for use on multi-core CPUs.
Characterizing Structural Descriptions Produced by Various Grammatical Formalisms

We consider the structural descriptions produced by various grammatical formalisms in terms of the complexity of the paths and the relationship between paths in the sets of structural descriptions that each system can generate. In considering the relationship between formalisms, we show that it is useful to abstract away from the details of the formalism, and examine the nature of their derivation process as reflected by properties of their derivation trees. We find that several of the formalisms considered can be seen as being closely related since they have derivation tree sets with the same structure as those produced by Context-Free Grammars. On the basis of this observation, we describe a class of formalisms which we call Linear Context-Free Rewriting Systems, and show they are recognizable in polynomial time and generate only semilinear languages.
Theory of Cognitive Aging in Parkinson Disease

Objective: While cognitive deficits are well documented in Parkinson disease (PD), identifying a theoretical framework in which to interpret these findings has been less studied. Theories of cognitive aging suggest that processing speed is likely a critical factor in normal cognitive function that explains a large portion of the interindividual variance associated with age-related cognitive decline. We tested the hypotheses that measures of processing speed underlie deficits in working memory and inhibition in PD as well. Methods: We measured cognitive function in a group of 77 medicated individuals with PD without dementia and 54 controls. Participants completed a battery of behavioral tests, including measures of processing speed (SDMT), working memory (Digit Span Backward), inhibition (DKEFS Color Word Interference), attention (Digit Span Forward) and depression (GDS). We compared performance across groups using analysis of variance. In addition, we used mediation analysis to examine the effect of processing speed on the relationship between age and both working memory and inhibition. Results: Groups were similar for age, years of education, MMSE score and premorbid IQ. Performance on measures of processing speed and inhibition were significantly worse in the PD than control group. Furthermore, we found that processing speed mediated the relationship between age and inhibition in the PD and control groups. However, the decrease in working memory performance in the PD group was a statistical trend and the relationship between working memory and age was not mediated by processing speed in either group. Conclusion: The pattern of cognitive aging consistent with the processing speed theory may be exacerbated in PD. However, while the working memory measure was correlated with processing speed, it was not correlated with age. The processing speed theory of cognitive decline provides a framework for hypothesis testing about the complex concept of bradyphrenia.
The Role of Gas in the Merging of Massive Black Holes in Galactic Nuclei. II. Black Hole Merging in a Nuclear Gas Disk

Using high-resolution SPH numerical simulations, we investigate the effects of gas on the in-spiral and merger of a massive black hole binary. This study is motivated by the very massive nuclear gas disks observed in the central regions of merging galaxies. Here we present results that expand on the treatment in a previous work by studying models in which the gas is in a disk. We run a variety of models, ranging from simulations with a relatively smooth gas disk to cases in which the gas has a more clumpy spatial distribution. We also vary the inclination angle between the plane of the binary and the plane of the disk, and the mass ratio between the MBHs and the gaseous disk. We find that, as in our previous work, in the early evolution of the system the binary separation diminishes mainly due to dynamical friction exerted by the background gas, and in the later stages the gaseous medium responds by forming an ellipsoidal density enhancement whose axis lags behind the binary axis. This offset produces a gravitational torque on the binary that causes continuing loss of angular momentum and is able to reduce the separation to distances at which gravitational radiation is efficient. The main difference is that between these two regimes we now find a new transition regime that was not apparent in our previous paper, in which the evolution is temporarily slowed down when neither of these mechanisms is fully effective. In the variety of simulations that we perform, we find that the coalescence timescale for the MBH binary varies between 5 × 106 and 2.5 × 107 yr for typical ULIRGs. For MBHs that satisfy the observed "m-σc" relation, our simulations suggest that in a merger of galaxies that have at least 1% of their total mass in gas, the MBHs will coalesce soon after the galaxies merge.
NUMERICAL METHODS FOR STOCHASTIC DIFFERENTIAL EQUATIONS

Approximately a quarter century ago, very early in my career when I was publishing rather theoretical results about stochastic differential equations, I received a letter (this predates e-mail) from a fellow researcher who had seen my work and was asking if I had an algorithm suitable for implementing my ideas on a computing machine. Not only did I not have such an algorithm, the idea had not occurred to me. Looking around, I discovered that such algorithms did exist in the electrical engineering literature, but they were ad hoc, with little or no mathematical analysis accompanying them and they were, of course, restricted to classic Itô equations. Shortly after that came the pioneering paper of E. Pardoux and D. Talay [4], followed by the seminal paper of Talay and Tubaro [5], which I now see as the birth of a mathematical theory of stochastic numerical analysis.
Model predictive direct torque control of PMSM with optimized duty cycle

Model predictive direct torque control (MPTC) is the emerging control technique in the field of electric drives. Compared to conventional DTC it's very accurate in voltage vector selection as well yields lower torque ripples by using the system model. The concept of duty cycle is merged along with it to improve the efficiency. The null vector is employed along with the selected voltage vector. The duty cycle is determined based on various principles. This paper focuses on the torque ripple minimization by optimizing the duty cycle of the selected vector. Results are compared in both Simulink and hardware. The Simulink is carried out with MATLAB.