Miracle-dz/UniFAR-FTUs huggingface dataset:
Identification of linear dynamic systems using the artificial bee colony algorithm

This paper presents an investigation into the development of system identification using the artificial bee colony (ABC) algorithm. A system identification task can be formulated as an optimization problem where the objective is to obtain a model and a set of parameters that minimize the prediction error between the measured plant outputs and the model outputs. The most common existing system identification approaches, such as the recursive least squares method and autoregressive exogenous method, are substantially analytical and based on a mathematical derivation of the system's model. Evolutionary computation, which seems to be a very promising approach, is an alternative to these methods because a little knowledge about the problem is sufficient in this approach and it can be easily combined with many other techniques from artificial intelligence, control engineering, machine learning, and so on. In this paper, an evolutionary approach for system identification is considered and attempted to demonstrate how the ABC algorithm can be applied in system identification tasks. Mathematical models of dynamic systems are obtained using difference equations represented in discrete time and the ABC algorithm is used to estimate the unknown parameters of the systems. Simulation results demonstrate that the proposed linear system identification method has good identification performance. Moreover, this method is applied to the identification of a direct current motor in order to show the performance of the ABC algorithm. The obtained results show that the identified and actual plant outputs successfully match each other.
An Evaluation of Plasma Astronomy

Many recent creationists are attracted to plasma astronomy, the idea that electromagnetic effects rather than gravity are responsible for much of the structure of the universe. I examine the claims of at least one proponent of plasma astronomy, Donald E. Scott. Scott has written a book that discusses many aspects of plasma astronomy. This book appears to be the most concise treatment of plasma astronomy in print, so it ought to be a good source. However, his case is very weak, for he relies upon many misunderstandings of astronomy, and he presented much incorrect and misleading information. He also rejects general relativity, a well-­tested physics theory. I urge extreme caution of these ideas in the creation community, and I encourage fair consideration of the operational science aspects of astronomy.
Probabilistic Semantically Reliable Multicast (Extended Abstract)

Traditional reliable broadcast protocols fail to scale to large settings [ 13, 11. This paper proposes a reliable multicast protocol that integraies two recent approaches to deal with the large-scale dimension in group communication protocols: gossip-based probabilistic broadcast [2] and semantic reliability [ 101. The aim of the resulting protocol is to improve the resiliency of the probabilistic protocol to network congestion by allocating scarce resources to semantically relevant messages. Although intuitively it seems that a straightforward combination of probabilistic and semantic reliable protocols is possible, we show that it offers disappointing results. Instead, we propose an architecture based on a specialized probabilistic semantically reliable layer and show that it produces the desired results. The combined primitive is thus scalable to large number 'of participants, highly resilient to network and process failures, and delivers a high quality data flow even when the load exceeds the available bandwidth. We present a summary of simulation results that compare different protocol configurations. The details of the simulation model are given in 1 he full version of the paper [ 121 which presents the evaluation of different implementation policies and the study of relevant system parameters in the performance of the protocol.
Proton beam therapy: clinical utility and current status in prostate cancer

Proton beam therapy has recently become available to a broader population base. There remains much controversy about its routine use in prostate cancer. We provide an analysis of the existing literature regarding efficacy and toxicity of the technique. Currently, the use of proton beam therapy for prostate cancer is largely dependent on continued reimbursement for the practice. While there are potential benefits supporting the use of protons in prostate cancer, the low risk of toxicity using existing techniques and the high cost of protons contribute to lower the value of the technique.
Limitless or pointless? An evaluation of augmented reality technology in the school and home

Augmented reality technology appears to offer great potential to engage learners and to enhance the process of knowledge construction. However, very little work has undergone formal evaluation, resulting in a lack of a deep and systematic understanding of how AR can enhance learning. We report an extensive evaluation of an AR application developed by the BBC for young learners. This evaluation involved over 300 participants in their homes and school classrooms. Our findings support the claim that AR has the potential to promote learning and to motivate children to engage with learning activities. There is evidence that specific skills can be improved, that learners were motivated and challenged through the interactive problem solving activities and that the technology offered many opportunities for collaboration. Developers will however need a rich skill set in order to create applications that offer the necessary learner control, challenging interactivity and experience coherence.
A Compactification of the Space of Holomorphic Maps from $\P^1$ into $\P^r$

Let $M_{d}(\P^r)$ be the space of $(r+1)$-tuples $(f_0,.,f_r)$ modulo homothety, where $f_0,. ,f_r$ are homogeneous polynomials of degree $d$ in two variables. Let $M_{d}^{\circ}(\P^r)$ be the open subset of $M_{d}(\P^r)$ such that $f_0,. ,f_r$ have no common zeros. Then $M_{d}^{\circ}(\P^r)$ parametrizes the space of holomorphic maps of degree $d$ from $\P^1$ into $\P^r$. In general the boundary divisor $M_{d}(\P^r) \setminus M_{d}^{\circ}(\P^r)$ is not normal crossing. In this paper we will give a natural stratification of this boundary and show that we can process an iterated blow-ups along these strata (or its proper transformations) to obtain a compactification of $M_{d}^{\circ}(\P^n)$ with normal crossing divisors.
Exploiting general coefficient representation for the optimal sharing of partial products in MCMs

We propose a new algorithm that maximizes he sharing of partial terms in Multiple Cons an Multiplication (MCM) operations under a general number representation for the coefficients. MCM operations are required by many algorithms in digital signal processing and have been the subject of extensive research. By making no assumptions as to the number representation, the algorithm described in his paper is able to perform a better search for the optimal sharing of partial terms than previous methods based on MSD or CSD representations. We have applied our algorithm for the hardware minimization of FIR filers.The results show that we can ob ain solutions that require between 20% to 50% less hardware when compared agains he solutions using he MSD representation.
Multihop Energy Enhancement Protocol

In WSN there is always a scope of improvement in efficient energy utilization, network lifetime. Efficient energy utilization always seems to be an important aspect in WSN's. Because of the fact that energy consumption directly effect the overall performance of WSN. Numbers of protocols are designed for enhancement of network lifetime and prevent the batteries from earlier drainage. Most of the protocols are designed to assuming that all the sensor nodes remain at the same place after deployment. Also the energy level of nodes is similar. In this paper we introduce multihop protocol having some moveable nodes on the boundaries of the whole network. These mobile nodes are rechargeable. The outcome of proposed scheme shows the better performance as compare to basic SEP.
LAF 1 ubiquitination by COP 1 controls photomorphogenesis and is stimulated by SPA 1

of 240 mV to þ40 mV (each step 10 mV for 100 ms) 17 were recorded with the patch-clamp amplifier. Data were filtered at 2 kHz and collected at 10 kHz. Ca 2þ channel activity was evaluated by measuring peak inward currents. Signal transduction underlying growth cone guidance by diffusible factors. A ligand-gated association between cytoplasmic domains of UNC5 and DCC family receptors converts netrin-induced growth cone attraction to repulsion. Cell 97, 927–941 (1999). 5. de la Torre, J. R. et al. Turning of retinal growth cones in a netrin-1 gradient mediated by the netrin receptor DCC. Theory for the development of neuron selectivity: orientation specificity and binocular interaction in visual cortex. Calcium stores regulate the polarity and input specificity of synaptic modification. Modulation of Ca 2þ channels by cyclic nucleotide cross activation of opposing protein kinases in rabbit portal vein. oxide inhibits neuroendocrine Cav1 L-channel gating via cGMP-dependent protein kinase in cell-attached patches of bovine chromaffin cells. 17. Lipsombe, D. et al. Spatial distribution of calcium channels and cytosolic calcium transients in growth cones and cell bodies of sympathetic neurons. 12-lipoxygenase is localized in neurons, glial cells and endothelial cells of the canine brain. Phosphorylation modulates the function of the calcium release channel of sarcoplasmic reticulum from cardiac muscle. A novel action of collapsing: collapsing-1 increases antero-and retrograde axoplasmic transport independently of growth cone collapse.
A presentation of regular languages in the assumption-commitment framework

A distributed presentation of a regular language L is a system of communicating automata accepting L, where the constraint on distribution is given in the form of a distributed alphabet. We study such presentations in the assumption-commitment framework, where each process makes assumptions about other processes in the system. Symmetrically, each process makes commitments which the other processes can rely on. In Proc. FST & TCS 17, LNCS 1346, pp. 153-68 (1997), we showed that the class of (Mazurkiewicz) regular trace languages can be presented in this framework. In this paper, we show that every regular language can be thus decomposed and present a version of Kleene's theorem using top-level parallelism.
LSM-Based Secure System Monitoring Using Kernel Protection Schemes

Monitoring a process and its file I/O behaviors is important for security inspection for a data center server against intrusions, malware infection and information leakage. In the case of the Linux kernel 2.6, a set of hook functions called the Linux Security Module (LSM) has been implemented in order to monitor and control the system calls. By using the LSM we can inspect the activity of unknown malicious processes. However, a sophisticated attacker could breach the kernel configurations using the rootkits. Furthermore since the monitoring results of the malicious process activity are stored as a file on Hard Disk Drive (HDD), it will be easily manipulated by the attacker. In this paper, we propose a secure monitoring scheme that addresses the attacks against the monitoring module and its result for security inspection of the data center server. The monitoring module is implemented as a LSM-based function and protected by the kernel protection technique. The integrity of the monitoring result is guaranteed by using a Mandatory Access Control (MAC) of the Linux kernel and a mechanism of the trusted process invocation. This mechanism can serve as an infrastrucuture of secure inspection platform for data center server because the integrity of the monitoring module and its result is guaranteed.
DESIGN OF POLYNOMIAL BASIS MULTIPLIERS OVER GF ( 2233 )

This article addresses an efficient hardware implementations for multiplication over finite field GF(2). Multiplication in GF(2) is very commonly used in cryptography and error correcting codes. An efficient hardware could reduce the cost and development for these applications. This work presents the hardware implementation of polynomial basis. In this case, the multipliers were designed using bit-serial multiplication , bit-parallel multiplication, PCA based serial multiplication and PCA parallel based multiplication algorithms, the synthesis and simulation were carried out using Quartus II v.5. 0 of Altera, and the designs were synthesized on the Stratix II EP2S60F1020C3. The simulation results show that the multipliers designed present a very good performance using small area.
Detection of Dynamic Structures of Speech Fundamental Frequency in Tonal Languages

An approach is proposed specially for capturing fine dynamic structures of speech fundamental frequency F0 that may vary in such a nonmonotonic way as those of the third tones in Chinese speech. It first estimates the rough trend of variation of a F0 contour by means of the cepstrum technique, and then, utilizes the trend as a reference to track the variation and calculates the detailed contour from a few of intrinsic mode functions that are decomposed by the ensemble empirical mode decomposition. Intensive evaluation and direct comparisons with existing methods are conducted with the standard Chinese Mandarin database, showing the effectiveness of the proposed method in acquiring accurate and reliable F0 contours from speech signals even heavily contaminated with noise.
Robust Voice Activity Detector by combining sequentially trained Deep Neural Networks

Deep Neural Network (DNN) has been hot topic in the field of information processing recently. As a vast field of information processing, speech processing has also been aided by Deep Neural Network. After Deep Neural Network is introduced to speech processing, its performance has outperformed its older methods. But still there is room for improvement and researchers are working on to find new ways to make the fullest use of DNN. In the same direction, we have been carrying out our research to find improved results. Our work is about combining two DNNs to perform voice activity detection where one DNN has the role of Denoising Autoencoder (DAE) and the second one acts as Voice Activity Detector (VAD) and to train them sequentially to develop a robust voice activity detection system for noisy and reverberant speech through distant microphone in the real environment scenario like meeting room or so.
Circular multiple change-points estimation applied to the GPS-L2C phase signal

For low power GNSS (Global Navigation Satellite System) signals, the most powerful processing approach is the long coherent integration of the signal. This approach supposes that the phase of the GNSS signal is accurately estimated. Unfortunately, the phase measurements may be very noisy and subject to cycle slips. The aim of this paper is to propose a new fusion estimate that can detect cycle slips in the signal and that takes the circular nature of the phase measurements into account. We propose to fuse the phase observations obtained on the two multiplexed channels of the GPS (Global Positioning System) L2C signal. We experimentally compare the accuracy obtained for the mono-channel GPS L1 signal and for the multi-channel GPS L2C signal.
Research on Data Cube technology of Dwarf based semantic OLAP

The computation of high-dimension Data Cube in data warehouse is of much importance. Dwarf is a highly compressed structure for computing and storing data cubes which can be materialized completely. During the constructing process, each closed node is stored in disk. While the computation of aggregation units needs to access the closed nodes in the disk frequently. For avoid accessing the unnecessary closed nodes in disk, in this paper, we propose an optimized algorithm named Q-Dwarf. The property of this algorithm guarantees that once the closed nodes are written to disk, they will not be read out again, and query algorithm and update algorithm are both based on files. Experimental results show that the performance of the new algorithm outperforms that of the Dwarf algorithm, and the query and update algorithms are efficient for data warehousing.
Environmental constraints on the functionality of inhibitory self-control: Sometimes you should eat the donut

Abstract Self-control involves the inhibition of behavior motivated by short-term reward. Self-control is generally considered to be critical to health and well-bring. However, from an evolutionary standpoint, inhibiting short-term reward may not always be functional. We suggest that the functionality of maintaining or ceasing inhibitory self-control is highly context-dependent. We have elsewhere proposed the dual component theory of inhibition regulation (DCTIR). The DCTIR proposes a functional processing mechanism that determines whether to continue or cease inhibitory self-control. According to the DCTIR, the functionality of continued application of inhibition is conditional on the availability of resources and stability of the environment. To test these predictions, we developed an online game called “Food Quest,” in which participants are asked to imagine that they are on a journey. They are faced with the decision of whether or not to engage in a behavior with a short-term reward but with a long-term cost. The game environment is manipulated by varying game lifespan as well as the distribution and prevalence of resources. Results were consistent with predictions from the DCTIR that self-control was more functional in environments characterized by longevity and plentiful resources, but not in more dangerous, highly variable environments. Implications and future directions are discussed.
Recursive Numerical Calculus of One-loop Tensor Integrals

A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of iteration only inverse square roots of Gram determinants appear. For the phase-space regions where Gram determinants are so small that numerical problems are expected, we give general prescriptions on how to construct reliable approximations to the exact result without performing Taylor expansions. Working in 4 + ǫ dimensions does not require an analytic separation of ultraviolet and infrared/collinear divergences, and, apart from trivial integrals that we compute explicitly, no additional ones besides the standard set of scalar oneloop integrals are needed.
Connectedness : Papers by and for Sarah VanWagenen UCLA Working Papers in Linguistics

At the heart of linguistic study is the question of how such a complex system can be learned by people so young and unformed that they cannot even survive on their own. In describing existent human languages we often hope that the phenomena we encounter will provide some insight into this puzzle: perhaps we have found a universal feature, meaning it could be somehow “built in”, sidestepping the necessity for children to learn it; or perhaps we have found a clearcut parameter on which human languages may differ, pointing out a specific fact that children might automatically watch for. Language acquisition studies children’s language learning directly, while formal language theory can be used to discover what sorts of grammars are required to describe human language. Learnability theory is the study of mathematical models of language acquisition. This paper will explore learning models applied to two specific phenomena: optionality and repetition. Adjuncts are by definition optional in that although a sentence will have a different meaning without the adjunct, it is still perfectly grammatical, and the meanings of the sentences differ systematically. For example, in (1) we see that the adjective red is optional, and (1-a) entails (1-b).
On the Role of Structural Holes in Requirements Identification

Requirements identification is a human-centric activity that involves interaction among multiple stakeholders. Traditional requirements engineering (RE) techniques addressing stakeholders’ social interaction are mainly part of a centralized process intertwined with a specific phase of software development. However, in open-source software (OSS) development, stakeholders’ social interactions are often decentralized, iterative, and dynamic. Little is known about new requirements identification in OSS and the stakeholders’ organizational arrangements supporting such an activity. In this article, we investigate the theory of structural hole from the context of contributing new requirements in OSS projects. Structural hole theory suggests that stakeholders positioned in the structural holes in their social network are able to produce new ideas. In this study, we find that structural hole positions emerge in stakeholders’ social network and these positions are positively related to contributing a higher number of new requirements. We find that along with structural hole positions, stakeholders’ role is also an important part in identifying new requirements. We further observe that structural hole positions evolve over time, thereby identifying requirements to realize enriched features. Our work advances the fundamental understanding of the RE process in a decentralized environment and opens avenues for improved techniques supporting this process.
Comparing usability and engagement between a serious game and a traditional online program

A frequent motivation behind the development of serious games is the notion that game play provides a greater level of motivation or engagement that encourages players to perform better or complete more difficult challenges. There are in truth many aspects to concepts such as engagement, immersion, flow or other terms used to motivate the use of games in place of more traditional didactic training approaches. In this paper we discuss some of the issues of usability and its relation to engagement. This discussion is framed in relation to a usability study of a serious game that is being developed to support psychological counseling of individuals with comorbidity of depression and alcohol use disorders. We compare issues of usability and engagement in the serious game called Shadow directly with a more traditional online intervention program called SHADE. The study uses previously established surveys, namely, the System Usability Scale, the Perceived Usefulness and Ease of Use, and a modified survey for measuring Engagement to compare the two approaches. Results from a pilot study with 10 participants frame a discussion of the role usability plays in designing for engagement in serious games such as Shadow.
Influence of Incubation Conditions on Biofilm Formation by Pseudomonas Fluorescens Isolated from Dairy Products and Dairy Manufacturing Plants

In this study, biofilm formation of 64 Pseudomonas fluorescens strains isolated from milk, dairy products and dairy plants was compared. The strains were grown on Tryptic Soy Broth supplemented with 0.2% of glucose, on polystyrene microplates at 10 and 30°C for 48 h. In general, 57/64 P. fluorescens strains formed biofilm, although with great variability at both tested temperatures. Moreover, our results evidenced that the biofilm-forming ability of the strains was temperature- and strain-dependent. Interestingly, the ability of several isolates to form biofilms was associated with the low temperature after 48 h. Our findings evidenced that temperature was more important than incubation time for biofilm formation. Considering the origin of the strains, it is relevant to underline the importance of performing accurate cleaning and disinfection procedures on food processing surfaces.