Miracle-dz/UniFAR-FTUs huggingface dataset:
Modeling Emergency Messaging to Avoid Car Accidents using Ad hoc Networks

- In Vehicular Ad Hoc Network (VANET), the remote Collision Avoidance (CA) framework issues notice to drivers before they achieve a possibly perilous zone on the street. This paper proposes a systematic model for assessing the execution of crisis informing through remote CA frameworks. In the first place, we use the dichotomized progress demonstrate, the braking model to produce vehicular versatility follows for examination. Second, we infer the likelihood of a backside crash between two vehicles that go in the same course when a sudden occasion happens. Third, we evaluate the likelihood of vehicles neglecting to get the crisis message. The model demonstrates that the quantity of auto crashes every mischance is much higher when a remote CA framework is not utilized. We likewise think that it intriguing that the quantity of auto accidents is not straightforwardly relative to the vehicle thickness when the vehicular versatility follows take after the pace thickness relationship. By coordinating stream hypothesis into VANET examination, our model gives valuable experiences for future smart transportation.
Miscible rectilinear displacements with gravity override. Part 1. Homogeneous porous medium

Rectilinear homogeneous miscible displacements with gravity override are analysed by means of direct numerical simulations on the basis of the vorticity–streamfunction formulation of the governing equations. The vorticity-based point of view offers the advantage of clearly attributing the dominant flow characteristics to the effects of viscosity contrast, density difference, impermeable boundary conditions, or interactions among the above. Basic considerations regarding the vorticity field show that in an integral sense the coupling between viscosity and gravity vorticity is predominantly one way in nature, in that the gravity vorticity can amplify the viscous vorticity, but not vice versa. In particular, the vorticity point of view provides an explanation for the formation of the gravity tongue in terms of a focusing mechanism, which results from the combined action of the unfavourable viscosity gradient and the potential flow field generated by the interaction of the gravitational vorticity with the horizontal boundaries. This potential velocity field locally enhances the uniform global displacement velocity near the upper boundary, and thereby amplifies the viscous fingering instability along this section of the interface. In some parameter ranges, the gravity tongue exhibits interesting interactions with the viscous fingers next to it, such as pinching and partial merging. The influence of the Péclet number, the viscosity and density contrasts, and the aspect ratio on the dynamic evolution of the displacement is investigated quantitatively.
Computational analysis of the dynamic flow in single-reed woodwind instruments

The dynamics of the air flow within the mouthpiece of single-reed wind instruments makes an important contribution to the acoustic behavior of this type of system, particularly during transient regimes. In this work, a two-dimensional numerical model of the mouthpiece-reed system is used to evaluate the behavior of the flow within the mouthpiece at three different frequencies within the playing range of the clarinet. The relationship between volume flow and blowing pressure, as well as the behavior of the vena contracta during one duty cycle are compared with the available analytical models and with recent experimental observations.
A quality evaluation method of SAR image based on grayscale image and electromagnetic scattering characteristics

Aiming at the quality evaluation of synthetic aperture radar (SAR) image, a normalized evaluation index system combining the characteristics of grayscale image and electromagnetic scatter is established referencing analytic hierarchy process (AHP) at first. Then, the relationships between indexes and image quality are analyzed, as the distribution ranges and variation principles of indexes are determined by statistics. Eventually, the quality evaluation method is proposed, and some simulation results are presented. The method raised in this paper is simple, effective and robust, applied well to image quality assessment that has reference particularly.
Production of Dynamic Image Database from Web with High Precision in Less Time

The main objective of this work is to generate database automatically which consist of images of the particular class. Multimodal approach uses text, visual features to extract the perfect match images from the web. The web pages contains images are downloaded then further processing is performed on the collection, processing includes re-ranking based on text and visual features, removing noisy data (irrelevant images). The development is the combining the text and visual features to achieve the automatic ranking of the images. This work shows an approach to harvest a large number of images of a particular class automatically and to achieve this with high precision by providing training databases so that a new object model can be learned effortlessly. The existing system does not rely on high precision of top returned image. User is free to specify his query not limited to certain number of classes. Time required for gathering images from different sources is less.
Research on Downlink Multi-user Scheduling Algorithm of CoMP in LTE-A

CoMP is one of the key technologies in LTE-A to improve cell-edge user's spectral efficiency and throughput. Excellent scheduling algorithm can achieve larger gain. However,due to the restriction of base station antenna number and the precoding matrix used,only limited number of users can be scheduled at the same time,so the selection of scheduling criteria is very important. CoMP multi-user scheduling algorithms mainly evaluate the performance in throughput,fairness,and complexity,etc. The paper introduces the basic principles of CoMP and three classic scheduling algorithms,discusses in particular the basic ideas and important steps of several CoMP multi-user scheduling algorithms,and summarizes their advantages and disadvantages.
A Survey of Effects of Teacher feedback to English Autonomous Learning of College Students Under Network Environment

Teachers feedback has a good guidance to English autonomous learning of college students under network environment.Investigations show that there are problems about the less time is spent,the uncertain aims and the low satisfactory rate during autonomous learning of college students;one-on-one online feedback forms like e-mail,chat Room,etc through the Internet should be very popular with the students;Feedback forms as suggestion,warning and support is liable to accept for the students.
A perceptual model of auditory deafferentation

Overexposure to intense sound produces temporary threshold shifts but permanent loss of afferent nerve terminals. Here, we present a vocoder designed to explore the perceptual consequences of this type of damage. The basic idea is that the spike train produced by an individual auditory afferent resembles a stochastically digitized binary version of the stimulus waveform and that the quality of the waveform representation in the whole nerve depends on the number of aggregated spike trains. Sounds were processed by filtering them into 10 adjacent frequency bands. For the signal in each band, multiple spike trains were then obtained in an attempt to mimic the different representations of that signal conveyed by different auditory afferents innervating a given cochlear region. The aggregated spike train was multiplied by the original signal to obtain an acoustic version of the simulated nerve waveform. Tone-in-noise and speech-in-noise perception tests were performed by young, normal-hearing listeners using different numbers of afferents per frequency band. Results support that deafferentation impairs perception in noise more than in quiet. The proposed vocoder may be extended to model other types of hearing damage and to guide the design of hearing aids and cochlear implants.
Complex-Valued Generalized Hebbian Algorithm and Its Applications to Sensor Array Signal Processing

Principal component extraction is an efficient statistical tool that is applied to feature extraction, data compression, and signal process­ ing. The Generalized Hebbian Algorithm (GHA) (Sanger 1992) can be used to iteratively extract principal eigenvectors in the real do­ main. In some scenarios such as sensor array signal processing, we encounter complex data. The Complex-valued Generalized Hebbian Algorithm (CGHA) (Zhang et al. 1997) is presented in this chapter. Convergence of CGHA is proved. Like GHA, CGHA can be im­ plemented by a single-layer linear neural network. An application of CGHA to sensor array signal processing is demonstrated through Direction of Arrival (DOA) estimation.
Viscoelastic creep behavior of filament-wound case materials

The viscoelastic creep behavior of an S-901 glass/epoxy composite used in a solid rocket motor case is examined for a variety of loading conditions. Samples were removed from the forward dome region of a filament-wound motor case at fiber angles of ± 20 and ± 70 deg. They were tested at several stress levels in tension and four-point beam bending to determine the creep response through several creep-recovery cycles. Constant displacement rate tests also were conducted using the four-point beam bending test to evaluate hysteresis at relatively low stress levels. The behavior was found to be similar in many ways to that previously found for autoclaved, flat-plate samples tested at equivalent conditions. The creep behavior was found to follow a power law in time, D = D0 + /)/*", where D is the creep compliance (psi ~*), D0 is the initial elastic compliance, and D2 and n define the viscoelastic response characteristics. In the linear viscoelastic range, n = 0.19 and is in good agreement with data derived from the epoxy resin itself. At higher stress levels, the value of n increases due to microcracking within the composite. The largest difference in the creep-recovery behavior is exhibited between the first and second loading cycles, with n decreasing slightly with subsequent loading.
High Level Event Detection based on Spatial Occupancy and Interpersonal Relationships

This paper describes a new approach for eventdetection in video sequences. A tracking algorithm for obliquecamera setups is initially used to extract trajectories in a trainingperiod, and a map of spatial occupancy of the scene is built. In thetest stage, Voronoi Diagrams are used to obtain some informationregarding interpersonal relationships, such as distances fromneighbors, formation and classification of groups. A variety ofcomplex events can be detected through a query formulated bythe user, that may combine concurrent or sequential occurrencesof simpler events based on either spatial occupancy or interpersonalrelationships (e.g. group formation in a region with smallspatial occupancy). These queries can be used to detect eventson-the-fly as the video is processed, or applied to stored videodatabases.
Statistical Methods in Bioinformatics: An Introduction

An Introduction to Probability Theory: One Random Variable * An Introduction to Probability Theory: Many Random Variables * Statistics: An Introduction to Statistical Inference * Stochastic Processes: An Introduction to Poisson Processes and Markov Chains * The Analysis of DNA Sequence Patterns: One sequence * The Analysis of DNA Sequences: Multiple sequences * Stochastic Processes: Random Walks * Statistics: Classical Estimation and Hypothesis Testing * BLAST * Stochastic Processes: Markov Chains * Hidden Markov Models * Computationally intensive methods * Evolutionary models * Phylogenetica tree estimation
Modeling Web Service Selection for Composition as a Distributed Constraint Optimization Problem (DCOP)

During development of a Service-oriented Application, some software pieces could be fulfilled by the connection to Web Services. A list of candidate Web Services could be obtained by making use of any service discovery registry, which are then selected and integrated into the application. However, when it comes to a distributed system, multiple functional and non-functional constraints arise from the interaction between several service requesters and providers, particularly when composing different services. To overcome with such constraints, in this work we propose to model service selection and composition scenarios as Distributed Constraints Optimization Problems (DCOP). We propose different modeling approaches and develop representative examples to be solved through different DCOP algorithms. Also, we analyze the impact of possible extensions to the model in the computability of the problem.
APP FOR EARLY DETECTION OF DYSLEXIA – IMPLEMENTATION AND ONGOING EVALUATION

Assessing dyslexia among children before they can read is difficult, thus we have looked into the possibility of creating a tablet-application to be used as a screening tool. The application is based upon theory in cognitive psychology related to how limitations in how visual information is transferred to the brain found among dyslectics. During development, iterations of the tests were evaluated by an expert for feedback on the proposed implementation. For evaluating the finished product, test scores from a group of 100 students with different range of issues of dyslexia is currently being, both using a standard test for dyslexia and our application. Early results indicate a significant co-variation of the results, those performing particularly poor on the standard test also seem to perform poor on the test administered by the app. The current application is quite rough, and in current work we are reimplementing the application with higher usability to support both testers (e.g. kindergarden personnel) and to be able to facilitate self-managed test.
Real-Time Scheduling for GPUs with Applications in Advanced Automotive Systems

Glenn A. Elliott: Real-Time Scheduling for GPUs with Applications in Advanced Automotive Systems (Under the direction of James H. Anderson) Self-driving cars, once constrained to closed test tracks, are beginning to drive alongside human drivers on public roads. Loss of life or property may result if the computing systems of automated vehicles fail to respond to events at the right moment. We call such systems that must satisfy precise timing constraints “real-time systems. ” Since the 1960s, researchers have developed algorithms and analytical techniques used in the development of real-time systems; however, this body of knowledge primarily applies to traditional CPU-based platforms. Unfortunately, traditional platforms cannot meet the computational requirements of self-driving cars without exceeding the power and cost constraints of commercially viable vehicles. We argue that modern graphics processing units, or GPUs, represent a feasible alternative, but new algorithms and analytical techniques must be developed in order to integrate these uniquely constrained processors into a real-time system. The goal of the research presented in this dissertation is to discover and remedy the issues that prevent the use of GPUs in real-time systems. To overcome these issues, we design and implement a real-time multi-GPU scheduler, called GPUSync. GPUSync tightly controls access to a GPU’s computational and DMA processors, enabling simultaneous use despite potential limitations in GPU hardware. GPUSync enables tasks to migrate among GPUs, allowing new classes of real-time multi-GPU computing platforms. GPUSync employs heuristics to guide scheduling decisions to improve system efficiency without risking violations in real-time constraints. GPUSync may be paired with a wide variety of common real-time CPU schedulers. GPUSync supports closed-source GPU runtimes and drivers without loss in functionality. We evaluate GPUSync with both analytical and runtime experiments. In our analytical experiments, we model and evaluate over fifty configurations of GPUSync. We determine which configurations support the greatest computational capacity while maintaining real-time constraints. In our runtime experiments, we
A Liouville-type theorem for Schr\"odinger operators

In this paper we prove a sufficient condition, in terms of the behavior of a ground state of a symmetric critical operator $P_1$, such that a nonzero subsolution of a symmetric nonnegative operator $P_0$ is a ground state. Particularly, if $P_j:=-\Delta+V_j$, for $j=0,1$, are two nonnegative Schr\"odinger operators defined on $\Omega\subseteq \mathbb{R}^d$ such that $P_1$ is critical in $\Omega$ with a ground state $\phi$, the function $\psi\nleq 0$ is a subsolution of the equation $P_0u=0$ in $\Omega$ and satisfies $|\psi|\leq C\phi$ in $\Omega$, then $P_0$ is critical in $\Omega$ and $\psi$ is its ground state. In particular, $\psi$ is (up to a multiplicative constant) the unique positive supersolution of the equation $P_0u=0$ in $\Omega$. Similar results hold for general symmetric operators, and also on Riemannian manifolds.
Scalable modulation technology and the tradeoff of reach, spectral efficiency, and complexity

Bandwidth and capacity demand in metro, regional, and long-haul networks is increasing at several tens of percent per year, driven by video streaming, cloud computing, social media and mobile applications. To sustain this traffic growth, an upgrade of the widely deployed 100-Gbit/s long-haul optical systems, based on polarization multiplexed quadrature phase-shift keying (PM-QPSK) modulation format associated with coherent detection and digital signal processing (DSP), is mandatory. In fact, optical transport techniques enabling a per-channel bit rate beyond 100 Gbit/s have recently been the object of intensive R and D activities, aimed at both improving the spectral efficiency and lowering the cost per bit in fiber transmission systems. In this invited contribution, we review the different available options to scale the per-channel bit-rate to 400 Gbit/s and beyond, i.e. symbol-rate increase, use of higher-order quadrature amplitude modulation (QAM) modulation formats and use of super-channels with DSP-enabled spectral shaping and advanced multiplexing technologies. In this analysis, trade-offs of system reach, spectral efficiency and transceiver complexity are addressed. Besides scalability, next generation optical networks will require a high degree of flexibility in the transponders, which should be able to dynamically adapt the transmission rate and bandwidth occupancy to the light path characteristics. In order to increase the flexibility of these transponders (often referred to as “flexponders"), several advanced modulation techniques have recently been proposed, among which sub-carrier multiplexing, hybrid formats (over time, frequency and polarization), and constellation shaping. We review these techniques, highlighting their limits and potential in terms of performance, complexity and flexibility.
Construction and Application of a New 2D Barcode Identification Tool

An algorithm of sampling grid above the 4th version and the RS error correcting of function information was improved,and the Chinese character code generation and identification tool was constructed to decrease the cost of barcode and increase the capacity of information based on the contrast of the Chinese-sensible code and the QrCode.The experimental results showed that the proposed algorithm is feasible and reliable,and the constructed tool can be implemented with high-speed and exactness.An example of the application plan of the new 2D barcode identification tool in agricultural product quality management system was introduced.
The 2011 International Planning Competition

After a 3 years gap, the 2011 edition of the IPC involved a total of 55 planners, some of them versions of the same planner, distributed among four tracks: the sequential satisficing track (27 planners submitted out of 38 registered), the sequential multicore track (8 planners submitted out of 12 registered), the sequential optimal track (12 planners submitted out of 24 registered) and the temporal satisficing track (8 planners submitted out of 14 registered). Three more tracks were open to participation: temporal optimal, preferences satisficing and preferences optimal. Unfortunately the number of submitted planners did not allow these tracks to be finally included in the competition. A total of 55 people were participating, grouped in 31 teams. Participants came from Australia, Canada, China, France, Germany, India, Israel, Italy, Spain, UK and USA. For the sequential tracks 14 domains, with 20 problems each, were selected, while the temporal one had 12 domains, also with 20 problems each. Both new and past domains were included. As in previous competitions, domains and problems were unknown for participants and all the experimentation was carried out by the organizers. To run the competition a cluster of eleven 64-bits computers (Intel XEON 2.93 Ghz Quad core processor) using Linux was set up. Up to 1800 seconds, 6 GB of RAM memory and 750 GB of hard disk were available for each planner to solve a problem. This resulted in 7540 computing hours (about 315 days), plus a high number of hours devoted to preliminary experimentation with new domains, reruns and bugs fixing. The detailed results of the competition, the software used for automating most tasks, the source code of all the participating planners and the description of domains and problems can be found at the competition’s web page: http://www.plg. inf.uc3m. es/ipc2011-deterministic
Volterra Multipliers II

If p is a real square matrix, a Volterra multiplier is a positive diagonal matrix a such that, in the sense of quadratic forms, $ap\leqq 0$. Ever since the pioneering work of Volterra over half a century ago, it has been known that these multipliers are a significant aid in the study of stability. However, the utility of the method is diminished by the difficulty of deciding whether the multiplier exists. Here we give a number of new criteria for existence, usually under the hypothesis that p is combinatorially symmetric; that is, $p_{ij} = 0$ implies $p_{ij} = 0$. This is much weaker than the condition “$p_{ij} p_{ji} < 0$ unless $p_{ij} = p_{ji} = 0$” which has been used by Volterra and others, and greatly increases the scope of the results. Although the primary emphasis is on sufficient conditions that are easy to use, we give necessary and sufficient conditions for several cases of practical interest.