Miracle-dz/UniFAR-FTUs huggingface dataset:
An analytical design of improved PID Neural Network controller for AQM

Internet congestion control system is complex, uncertainty and nonlinear. An Improved PID Neural Network (I-PID-NN) controller with changing integration rate and incomplete derivation in hidden layer is applied in active queue management (AQM). The adjustment of neural network parameters are implemented by using gradient algorithm as learning the rules, and the probability of packet loss can achieve adaptation. The performance of the I-PID-NN controller is verified by NS2 simulation results, which shows higher robustness and link utilization than PID-NN.
Employment of Reduced Precision Redundancy for Fault Tolerant FPGA Applications

This research explores the employment ofReduced Precision Redundancy (RPR) as a powersavingalternative to traditional Triple ModularRedundancy (TMR). This paper focuses on the detailsof RPR implementation and the effect of RPR faulttolerance on the performance of spacecraft systems.RPR-protected system performance is evaluated usinga signal-to-noise ratio analogy developed withMATLAB and Simulink computational tools. Thisresearch demonstrates that RPR is an effective faulttolerance approach for arithmetic operationsExperimental results show that the benefit of RPRincreases with the complexity of the operation to whichit is applied. System performance simulationsdemonstrate that RPR provides very good recoveryfrom errors caused by SEE in spacecraft systems.
A network assisted vehicle for ADAS and ITS testing

Rapid developments in technologies such as embedded devices, with increased processing capability, and sensor systems, with high accuracy and fast response, are enabling a wide range of new road traffic applications. These new systems and services promise significant improvements in areas such road safety, fuel economy and congestion management. In many cases the commercial deployment of these Advanced Driver Assistance Systems (ADAS), or Intelligent Transportation Systems (ITS), is no longer limited by just technical or economic constraints. There are ethical, legal or certification issues that need to be resolved for wide scale deployment. In this paper we present the Network Assisted Vehicle (NAV) concept. NAV is a prototype semi-autonomous vehicle with a modular design that can be adapted to support new ADAS and ITS test standards. Vehicle costs are minimized by making full use of existing OEM systems on the vehicle and the known conditions of a controlled test environment (innovITS ADVANCE City Circuit test facility).
Semantic Data Mining

Over the past few decades, data mining has emerged as a field of research critical to understanding and assimilating the large stores of data accumulated by corporations, government agencies, and laboratories. Early on, mining algorithms and techniques were limited to relational data sets coming directly from On-Line Transaction Processing (OLTP) systems, or from a consolidated enterprise data warehouse. However, recent work has begun to extend the limits of data mining strategies to include “semi-structured data such as HTML and XML texts, symbolic sequences, ordered trees and relations represented by advanced logics. ” (Washio and Motoda, 2003) The goal of any data mining endeavor is to detect and extract patterns in the data sets being examined. Semantic data mining is a novel approach that makes use of graph topology, one of the most fundamental and generic mathematical constructs, and semantic meaning, to scan semi-structured data for patterns. This technique has the potential to be especially powerful as graph data representation can capture so many types of semantic relationships. Current research efforts in this field are focused on utilizing graph-structured semantic information to derive complex and meaningful relationships in a wide variety of application areasnational security and web mining being foremost among these. In this article, we review significant segments of recent data mining research that feed into semantic data mining and describe some promising application areas. BACKGROUND
iELVis: An open source MATLAB toolbox for localizing and visualizing human intracranial electrode data

Background Intracranial electrical recordings (iEEG) and brain stimulation (iEBS) are invaluable human neuroscience methodologies. However, the value of such data is often unrealized as many laboratories lack tools for localizing electrodes relative to anatomy. To remedy this, we have developed a MATLAB toolbox for intracranial electrode localization and visualization, iELVis. New Method iELVis uses existing tools (BioImage Suite, FSL, and FreeSurfer) for preimplant magnetic resonance imaging (MRI) segmentation, neuroimaging coregistration, and manual identification of electrodes in postimplant neuroimaging. Subsequently, iELVis implements methods for correcting electrode locations for postimplant brain shift with millimeter-scale accuracy and provides interactive visualization on 3D surfaces or in 2D slices with optional functional neuroimaging overlays. iELVis also localizes electrodes relative to FreeSurfer-based atlases and can combine data across subjects via the FreeSurfer average brain. Results It takes 30-60 minutes of user time and 12-24 hours of computer time to localize and visualize electrodes from one brain. We demonstrate iELVis’s functionality by showing that three methods for mapping primary hand somatosensory cortex (iEEG, iEBS, and functional MRI) provide highly concordant results. Comparison with Existing Methods iELVis is the first public software for electrode localization that corrects for brain shift, maps electrodes to an average brain, and supports neuroimaging overlays. Moreover, its interactive visualizations are powerful and its tutorial material is extensive. Conclusions iELVis promises to speed the progress and enhance the robustness of intracranial electrode research. The software and extensive tutorial materials are freely available as part of the EpiSurg software project: https://github.com/episurg/episurg
Another Approach to Truthmaker Semantics Msc in Logic

This thesis concerns truthmaker semantics, introduced by Stephen Yablo in his book Aboutness and by Kit Fine in a series of papers. In large part, what I have accomplished here is filling in gaps. I not only fill in gaps between truthmaker semantics and related theories, I also fill in gaps within truthmaker semantics itself. The literature makes many assumptions but makes only a few explicit, leaving the reader to provide their own account of things like facts, of explanation and even, to some degree, of truthmaking itself. Aside from this, I attempt a contribution of my own. In particular, I present arguments for an account of truthmaker semantics on which truthmakers must be consistent in a precise sense.
Structural composition and decomposition of HRTFs

The analysis and modeling of the response of parts of the body provides valuable insight into many features of the head-related transfer function (HRTF). In spatial sound simulations, partial models, such as the spherical head model, can also generate simple and effective approximate localization cues. We consider the composition of an approximate HRTF from the responses of structural components by making use of detailed measurements of isolated pinnae and of a pinna-less head and torso. We determine that such a composition is sensitive to additional geometric parameters that can be obtained from anthropometry. We show that, with such parameters, simple composition rules can produce a good correspondence between measured and composite HRTFs.
HIERARCHICAL VEHICLE MODEL-BASED FAULT DIAGNOSIS USING PROPAGATION DIGRAPHS

Abstract Fault detection and isolation is becoming one of the most important aspects in vehicle control system design. In order to achieve this FDI schemes, particular vehicle subsystems integrated with a controller have been proposed. In this paper a suitable framework is presented that utilizes a hierarchical FDI scheme in association with a propagation digraph, representing the propagation aspects of faults, and allows to reduce the computational effort. An example of application to a brake-by-wire system is described.
It's the teacher, stupid! : om kursutvärderingar och kvalitet

Introduktion Kursutvärderingar är viktiga av flera skäl. Kursutvärderingar signalerar om studenterna är nöjda, vilket påverkar deras motivation och prestation och, i förlängningen, genomströmning och utbildningars attraktivitet. Utvärderingar ger lärare återkoppling för gjorda insatser. Kursutvärderingar ger underlag för utveckling och kvalitetsökningar (jmf. Astin, 1999, Elliott & Shin, 2002; Bolliger & Martindale, 2004, DeShields Jr et al., 2005, Douglas, McCelland & Davies, 2008, Elliott & Healy, 2001).
Influence of Boric Acid and Sucrose on the Germination and Growth of Areca Pollen

This study investigates the effect of boric acid and sucrose on the germination and growth of Areca catechu L (areca palm). Using areca pollen from Hainan, China, this study determines the influence of culture media with different concentrations of boric acid and sucrose on the germination and growth of areca pollen. Results show that the germination and growth of the pollen tube growth are highest under a boric acid concentration of 0.4 g/L to 0.6 g/L. The germination rate of areca pollen is highest in solid medium with a sucrose concentration of 40 g/L. The optimum culture medium for developing areca pollen comprises 5 g/L agar, 0.4 g/L to 0.6 g/L boric acid, 40 g/L sucrose, and water. Furthermore, areca pollen grows most rapidly approximately 1.5 h after in vitro cultivation at normal temperature, and growth stabilizes at approximately 3 h. The principle that governs the development of areca pollen is also discussed.
Relaxed avl trees, main-memory databases and concurrency

We consider the use of search trees to represent the dictionary aspects of a main-memory database in a concurrent environment. Efficiency considerations require that the trees be balanced and that operations on a search tree should not block too large a part of the tree for too long a time. These two requirements conflict, since rebalancing a tree after an update can, in a straightforward implementation, block too large a part of the tree. We would prefer that all search operations reserve only a small, fixed-size part of a tree at all times. We propose a new, elegant solution for this problem based on the notion of relaxed AVL trees and the decoupling of updates and rebalancing. The main advantage of our solution is that the implementation of the dicitionary operations in a concurrent environment is as simple as their implementation in a sequential environment, whereas previous concurrent solutions are more descriptively complex.
Optimizing Client-Server Performance When Mining Large Databases

This paper addresses the problem of building classiiers from large datasets stored in relational databases, in a client-server context. This situation is common in industry. We identify a large class of algorithms whose data access can be restricted to SQL queries of a particular form, which we call primitives. We propose to enhance the performance of these algorithms by optimizing at the primitive (query) level, show how this can be achieved, and describe a prototype that has been implemented at Essex. We present performance measurements for the prototype in conjunction with a version of the C4.5 decision tree algorithm. Results are given for two systems, one of them a parallel DBMS. We are particularly interested in the extent to which a system of this kind can exploit the parallelism of the server.
Female mating preferences for male morphological traits used in species and mate recognition in the Mexican sailfin mollies, Poecilia velifera and Poecilia petenensis

We tested whether sexually selected morphological traits in the sailfin mollies, Poecilia velifera and Poecilia petenensis, are also used in species recognition. Our first experiment, using live males as stimuli and providing females with olfactory as well as visual cues, found that females of both sailfin species preferred conspecific males to males of shortfin species. However, neither species preferred conspecific males when compared with heterospecific sailfin males, suggesting that premating reproductive isolation is not well developed between them. Our second experiment, providing females with only visual cues when distinguishing between live males, found that females of P. velifera preferred the larger of 2 stimulus males, regardless of whether the larger male was a conspecific or an heterospecific sailfin male. Such a preference for the larger sized male was not found in P. petenensis. To further investigate the role of the dorsal "sailfin" in species recognition, we used model males that varied only in the species identity of their dorsal fins. Females of both sailfin species preferred conspecific models with conspecific sailfins to those with dorsal fins of the shortfin species. In addition, females of P. velifera preferred the model with the largest sailfin, regardless of species identity. Similarly to the live male experiments, females of P. petenensis did not distinguish between conspecific and heterospecific sailfins. Overall, our study suggests that females of P. velifera have a generalized preference for larger males and that species-specific differences in sailfin shape do not lead to premating reproductive isolation between these 2 sailfin species. Copyright 2008, Oxford University Press.
Eulerian polynomials of spherical type

The Eulerian polynomial of a finite Coxeter system (W, S) of rank n records, for each k ∈ {1, . , n}, the number of elements w ∈ W with an ascent set {s ∈ S | l(ws) > l(w)} of size k, where l(w) denotes the length of w with respect to S. The classical Eulerian polynomial occurs when the Coxeter group has type An, so W is the symmetric group on n + 1 letters. Victor Reiner gave a formula for arbitrary Eulerian polynomials and showed how to compute them in the classical cases. In this note, we compute the Eulerian polynomial for any spherical type.
Protein Kinases , and Akt Signaling Modulation of Cell Cycle Regulators , Mitogen-Activated Silibinin Protects against Photocarcinogenesis via

Here, we assessed the protective effect of silibinin on UVB-induced skin carcinogenesis in SKH-1 hairless mice. Topical application of silibinin before or immediately after UVB exposure or its dietary feeding resulted in a strong protection against photocarcinogenesis, in terms of tumor multiplicity (60–66%; P < 0.001), tumor volume per mouse (93–97%; P < 0.001) and tumor volume per tumor (80–91%; P < 0.001). Silibinin also moderately inhibited tumor incidence (5–15%; P < 0.01) and delayed tumor latency period (up to 4 weeks; P < 0.01–0.001). To investigate in vivo molecular mechanisms of silibinin efficacy, tumors and uninvolved skin from tumor-bearing mice were examined immunohistochemically for proliferation, p53, apoptosis, and activated caspase-3. Silibinin treatment showed a strong decrease (P < 0.001) in proliferating cell nuclear antigenpositive cells and an increase in p53-positive (P < 0.005–0.001), terminal deoxynucleotidyltransferase-mediated nick end labeling-positive (P < 0.005– 0.001), and cleaved caspase-3–positive cells (P < 0.001). Western blot analysis of normal skin and tumor lysates showed that silibinin decreases the levels of cyclin-dependent kinase 2 and cyclin-dependent kinase 4 and associated cyclins A, E, and D1, together with an up-regulation of Cip1/p21, Kip1/p27, and p53. Silibinin also showed a strong phosphorylation of extracellular signal-regulated protein kinase 1/2, stress-activated protein kinase/c-JUN NH2-terminal kinase 1/2, and p38 mitogen-activated protein kinases but inhibited Akt phosphorylation and decreased survivin levels with an increase in cleaved caspase-3. Together, these results show a strong preventive efficacy of silibinin against photocarcinogenesis, which involves the inhibition of DNA synthesis, cell proliferation, and cell cycle progression and an induction of apoptosis. Furthermore, these results also identify in vivo molecular mechanisms of silibinin efficacy against photocarcinogenesis.
A Discrete Wavelet Transform based analysis of sounds of some musical instruments

In this paper a technique based on Discrete Wavelet Transform has been applied to characterize the sounds produced by some traditional Indian musical instruments, viz. sarangi, harmonium and tumbi. It is observed that when the sound signal is decomposed for different levels and the energy in the wavelet coefficients is calculated for each level. The energy retained in wavelet coefficients varies with the type of wavelet and its decomposition level. The maximum level of decomposition for the three sound signals is different and the signals are also reconstructed with the wavelet coefficients only up to the maximum level of decomposition. The hearing perception of the reconstructed signals is in agreement with the theoretical models.
NGC 4244: A Low Mass Galaxy With a Falling Rotation Curve and a Flaring Gas Layer

I present sensitive high resolution HI VLA B+C+D array observations of the edge-on Scd galaxy NGC 4244. The gas layer of NGC 4244 is rather symmetric in all respects, i.e. the surface density distribution, flaring and warping, so that the rotation curve (RC) is determined accurately, despite the fact that i~90^o. The RC rises slowly in the inner 6 kpc, is ~ constant at 100 km/s out to 10kpc, and decreases in Keplerian fashion by 15% at the last measured point at 14 kpc. The RC constrains the stellar mass-to-light ratio to lie between 50 and 100% of the ``maximum-disk'' value. A new technique is presented to determine simultaneously the inclination and the thickness of the gas layer from HI observations which uses the apparent widths at many channels and works for i >= 60^o. The inclination of the un- warped disk is about 84.5 degrees: beyond D25/2 the inclination changes gra- dually till 82.5^o, while at large radii the disk seems to warp back to the plane defined by the inner disk. The gaseous velocity dispersion is roughly constant within the optical disk (8.5+/-1 km/s) and increases slightly beyond. The thickness of the gas layer increases gradually from 0.4 to 1.5 kpc. In an accompanying paper (AJ, Aug. 1996; astro-ph/9605111). I use the measurements presented in this paper to infer that the dark matter halo of NGC 4244 is highly flattened.
Energy consumption evaluations of cluster-based sensor nodes with IEEE 802.15.4 transceiver in flat Rayleigh fading channel

This paper studies the energy consumption of cluster-based wireless sensor networks (WSNs) which comprise sensor nodes carrying the transceivers on the basis of the Direct Spread Sequence Spectrum (DSSS) techniques as per the IEEE 802.15. 4 standard to transmit data over the AWGN channel with flat Rayleigh fading. To this end, clarifications are made on the bit error rate (BER) expressions for the considered transceivers in the presence of AWGN and the flat Rayleigh fading. Based on the presented BER expressions, the node energy consumption is evaluated in the cluster-based WSNs that are formed by running representative clustering algorithm via simulations. Parameters for the evaluations take values from the off-the-shelf transceivers in compliance with IEEE 802.15. 4. The numerical results manifest the large energy expenditures on compensating the Rayleigh fading to accomplish reliable data transmissions.
Research on Evaluation of Efficiency of Regional Scientific and Technological Output in China

Based on the statistics in 2005 from 31 major provinces or regions in China released by National Bureau of Statistics of China, this paper applies grey relational analysis to analyze the efficiency of regional scientific and technological output. Firstly, the research method based on grey relational analysis is given. Secondly, on the basis of the studies on the efficiency of technological innovation, the evaluation index system for the efficiency of regional scientific and technological output is provided. Finally, the research result from the case study on the efficiency of regional scientific and technological output in China is put forward. Research result shows that this research method could provide valuable information for governments in making appropriate scientific and technological policies.
The Nature of Individual Choices

In the theory of social choice the research is focused around the projection of individual preference orders to the social preference order. Also, the justification of the preference order formalism begins with the concept of utility i.e. an alternative is preferred to another one if the utility over the first is higher then the utility over the second. In this paper is proposed an ideal model of measuring utilities by considering individuals and alternatives no more as atomic concepts but as being composed by other entities. 1 Basic definitions Individuals, along their existence, tries to reach a series of objectives that, according to them, ensure a satisfiable individual welfare. When an individual judges over an alternative considers his own objectives and observes the possibility that this particular alternative will allow him to reach these objectives. Definition 1 Given a society V = {V1, V2, . , VN} and an environment A = {A1, A2, . , AM}, we define the universe of the objectives, the set: Γ = {γ1, γ2, . , γR} as the set of all the required objectives by the individuals in I and the objectives offered by the alternatives in A. For each alternative Am ∈ A we can put in evidence the set of the offered objectives, that for simplicity we will give it the same name as the alternative itself: Am = {α m 1 , α m 2 , . , α m H} where αmh ∈ Γ for all h = 1, . , H . Similarly, each individual Vn ∈ V is characterised by the set of the required objectives: Vn = {ν n 1 , ν n 2 , . , ν n K} where ν k ∈ Γ for all k = 1, . , K. Considering the universe Γ as a-priori entity, we can treat a given alternative or individual as an element of ℘(Γ) The set of all the alternatives 1 ℘(Γ) is the set of all subsets of Γ
Existence and construction of capacity-achieving network codes for distributed storage

In a distributed storage system based on erasure coding, when a storage node fails, repairing the erasure code incurs some network traffic. Previous work has characterized the fundamental tradeoff between storage efficiency and repair network bandwidth. This was done via a cut-based analysis on a graph that models the evolution of information flow in the storage system subject to arbitrary sequences of node failures/repairs. This paper presents techniques for constructing network codes that achieve the optimal tradeoff between storage efficiency and repair network bandwidth. The challenge here is that network coding is applied over an unbounded graph with an unbounded number of receivers. It is shown in this paper that optimal codes can be constructed over a finite field whose size depends only on the maximum number of nodes at any instant, but independent of how many failures/repairs can happen. Key to the code construction is a “path-weaving” procedure that leads to an inductive existence proof/code construction.
A unified approach for heterogeneity and node fault robustness in dynamic sensor networks

The paper deals with the area coverage problem for a network of mobile sensors. Continuous mobility is used for getting measures over the area of interest with a reduced number of sensors units that do not cover all the area at any time but, moving, assure the measure at any point within a prefixed time interval. In addition, the case of heterogeneous network is addressed, in the sense that each node can be equipped with a different set of sensors. A centralized formulation of the control problem for the motion of the agents is given. It is also shown that the same problem formulation can be used to address the problem of nodes faults robust coverage for over dimensioned networks. Constraints introduced by the actuator limits as, communication connection and collision avoidance are clearly considered. A global solution is proposed and some simulations are reported to show its effectiveness.