SoroushVahidi/scidocs huggingface dataset:
WILDSENSING: Design and deployment of a sustainable sensor network for wildlife monitoring
(2012)

The increasing adoption of wireless sensor network technology in a variety of applications, from agricultural to volcanic monitoring, has demonstrated their ability to gather data with unprecedented sensing capabilities and deliver it to a remote user. However, a key issue remains how to maintain these sensor network deployments over increasingly prolonged deployments. In this article, we present the challenges that were faced in maintaining continual operation of an automated wildlife monitoring system over a one-year period. This system analyzed the social colocation patterns of European badgers (Meles meles) residing in a dense woodland environment using a hybrid RFID-WSN approach. We describe the stages of the evolutionary development, from implementation, deployment, and testing, to various iterations of software optimization, followed by hardware enhancements, which in turn triggered the need for further software optimization. We highlight the main lessons learned: the need to factor in the maintenance costs while designing the system; to consider carefully software and hardware interactions; the importance of rapid prototyping for initial deployment (this was key to our success); and the need for continuous interaction with domain scientists which allows for unexpected optimizations.
Merging thermal and visual images by a contrast pyramid
(2002)

J. M. Valeton I nstitute for Perception TNO Kampweg 5 3769 DE Soesterberg, The Netherlands Abstract. Integration of images from different sensing modalities can produce information that cannot be obtained by viewing the sensor outputs separately and consecutively. This paper introduces a hierarchical i mage merging scheme based on a multiresolution contrast decomposition (the ratio of a low-pass pyramid). The composite images produced by this scheme preserve those details from the input images that are most relevant to visual perception. The method is tested by merging parallel registered thermal and visual images. The results show that the fused images present a more detailed representation of the depicted scene. Detection, recognition, and search tasks may therefore benefit from this new image representation.
Fast Eigenspace Approximation using Random Signals
(2016)

We focus in this work on the estimation of the first k eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need k such signals to be able to exactly recover as many of the smallest eigenvectors, regardless of the number of nodes in the graph. In addition, we address key issues in implementing the theoretical concepts in practice using accurate approximated methods. We also propose fast algorithms both for eigenspace approximation and for the determination of the kth smallest eigenvalue λk. The latter proves to be extremely efficient under the assumption of locally uniform distribution of the eigenvalue over the spectrum. Finally, we present experiments which show the validity of our method in practice and compare it to state-of-the-art methods for clustering and visualization both on synthetic smallscale datasets and larger real-world problems of millions of nodes. We show that our method allows a better scaling with the number of nodes than all previous methods while achieving an almost perfect reconstruction of the eigenspace formed by the first k eigenvectors. Keywords—Graph signal processing, low-rank reconstruction, partitionning, spectral graph theory, spectrum analysis, subspace approximation, visualization
LPV subspace identification of the edgewise vibrational dynamics of a wind turbine rotor
(2011)

In this paper we apply a state-of-the-art algorithm for subspace identification of linear parameter-varying (LPV) systems to identify the coupled dynamics of the drive-train and the edgewise bending motion of the rotor blades of three-bladed wind turbines. These dynamics are varying with the rotor speed. The identification algorithm uses a factorization which makes it possible to form predictors based on past inputs, outputs, and the known rotor speed. The predictors contain the LPV equivalent of the Markov parameters. Using the predictors, ideas from Predictor Based Subspace IDentification (PBSID) were developed to estimate the state sequence from which the LPV system matrices can be constructed. The algorithm was applied not only to synthetic data generated by a computer simulation of a reference wind turbine, but also to data measured from the CART3 research wind turbine at the National Wind Technology Center of the National Renewable Energy Laboratory (NREL). This paper demonstrates that the linear time-varying behavior of the aeroelastic dynamics of the wind turbine rotor can be captured in an LPV model identified with measured input-output data.
Knowledge management technologies and applications - literature review from 1995 to 2002
(2003)

This paper surveys knowledge management (KM) development using a literature review and classification of articles from 1995 to 2002 with keyword index in order to explore how KM technologies and applications have developed in this period. Based on the scope of 234 articles of knowledge management applications, this paper surveys and classifies KM technologies using the seven categories as: KM framework, knowledge-based systems, data mining, information and communication technology, artificial intelligence/expert systems, database technology, and modeling, together with their applications for different research and problem domains. Some discussion is presented, indicating future development for knowledge management technologies and applications as the followings: (1) KM technologies tend to develop towards expert orientation, and KM applications development is a problem-oriented domain. (2) Different social studies methodologies, such as statistical method, are suggested to implement in KM as another kind of technology. (3) Integration of qualitative and quantitative methods, and integration of KM technologies studies may broaden our horizon on this subject. (4) The ability to continually change and obtain new understanding is the power of KM technologies and will be the application of future works. q 2003 Elsevier Science Ltd. All rights reserved.
Comparison of NRZ and RZ modulations in laser intersatellite communication systems
(2008)

Laser intersatellite communication (LIC) is a promising choice for intersatellite communication due to the high data rate that can be achieved with the advantages of light weight, smaller size and lower power consumption. In this paper, we compare the maximum transmission distance with non-return-to-zero (NRZ) and return-to-zero (RZ) modulations for two different LIC scenarios. Simulation results show that for the long-range LIC system with a saturated booster optical amplifier, the RZ modulation scheme can offer a longer transmission distance than the NRZ modulation scheme. For the short-range LIC system without an optical amplifier, the RZ modulation scheme performs almost the same as the NRZ modulation scheme.
Direct Multisearch for Multiobjective Optimization
(2011)

In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of black-box type, preventing the use of derivative-based techniques. We propose a novel multiobjective derivative-free methodology, calling it direct multisearch (DMS), which does not aggregate any of the objective functions. Our framework is inspired by the search/poll paradigm of direct-search methods of directional type and uses the concept of Pareto dominance to maintain a list of nondominated points (from which the new iterates or poll centers are chosen). The aim of our method is to generate as many points in the Pareto front as possible from the polling procedure itself, while keeping the whole framework general enough to accommodate other disseminating strategies, in particular when using the (here also) optional search step. DMS generalizes to multiobjective optimization (MOO) all direct-search methods of directional type. We prove under the common assumptions used in direct search for single optimization that at least one limit point of the sequence of iterates generated by DMS lies in (a stationary form of) the Pareto front. However, extensive computational experience has shown that our methodology has an impressive capability of generating the whole Pareto front, even without using a search step. Two by-products of this paper are (i) the development of a collection of test problems for MOO and (ii) the extension of performance and data profiles to MOO, allowing a comparison of several solvers on a large set of test problems, in terms of their efficiency and robustness to determine Pareto fronts.
PRET DRAM controller: Bank privatization for predictability and temporal isolation
(2011)

Hard real-time embedded systems employ high-capacity memories such as Dynamic RAMs (DRAMs) to cope with increasing data and code sizes of modern designs. However, memory controller design has so far largely focused on improving average-case performance. As a consequence, the latency of memory accesses is unpredictable, which complicates the worst-case execution time analysis necessary for hard real-time embedded systems.
 Our work introduces a novel DRAM controller design that is predictable and that significantly reduces worst-case access latencies. Instead of viewing the DRAM device as one resource that can only be shared as a whole, our approach views it as multiple resources that can be shared between one or more clients individually. We partition the physical address space following the internal structure of the DRAM device, i.e., its ranks and banks, and interleave ac- cesses to the blocks of this partition. This eliminates contention for shared resources within the device, making accesses temporally predictable and temporally isolated. This paper describes our DRAM controller design and its integration with a precision-timed (PRET) architecture called PTARM. We present analytical bounds on the latency and throughput of the proposed controller, and confirm these via simulation.
Meta-cognitive extreme learning machine for regression problems
(2016)

In this paper, we present an efficient fast learning algorithm for regression problems using meta-cognitive extreme learning machine(McELM). The proposed algorithm has two components, namely the cognitive component and meta-cognitive component. The cognitive component is an extreme learning machine (ELM) while the meta-cognitive component which controls the cognitive component employs a self-regulating learning mechanism to decide what to learn, when to learn and how to learn. The meta-cognitive component chooses suitable learning method based on the samples presented namely, delete sample, reserve sample and network update. The use of ELM improves the network speed and reduces computational cost. Unlike traditional ELM, the number of hidden layers is not fixed priori in McELM, instead, the network is built during the learning phase. This algorithm is evaluated on a set of benchmark regression and approximation problems and also on a real-world wind force and moment coefficient prediction problem. Performance results in this study highlight that McELM can achieve better results compared with conventional ELM, support vector regression (SVR).
ERP evidence for conceptual mappings and comparison processes during the comprehension of conventional and novel metaphors
(2013)

Cognitive linguists suggest that understanding metaphors requires activation of conceptual mappings between the involved concepts. We tested whether mappings are indeed in use during metaphor comprehension, and what mapping means as a cognitive process with Event-Related Potentials. Participants read literal, conventional metaphorical, novel metaphorical, and anomalous target sentences preceded by primes with related or unrelated mappings. Experiment 1 used sentence-primes to activate related mappings, and Experiment 2 used simile-primes to induce comparison thinking. In the unprimed conditions of both experiments, metaphors elicited N400s more negative than the literals. In Experiment 1, related sentence-primes reduced the metaphor-literal N400 difference in conventional, but not in novel metaphors. In Experiment 2, related simile-primes reduced the metaphor-literal N400 difference in novel, but not clearly in conventional metaphors. We suggest that mapping as a process occurs in metaphors, and the ways in which it can be facilitated by comparison differ between conventional and novel metaphors.
Design for auto-tuning PID controller based on genetic algorithms
(2009)

This paper presents a method of designing proportional-integral-derivative (PID) controller based on genetic algorithms (GA). Ziegler-Nichols tuning formula has been used for predicting the range of gain coefficients of GA-PID controller. The use of GA for optimizing the gain coefficients of PID controller has considerably improved the performance of PID controller. Simulation studies on a second-order and a third-order control system demonstrate that the proposed controller provides high performance of dynamic and static characteristics.
Suppression by Selecting Wavelets for Feature Compression in Distributed Speech Recognition
(2017)

Distributed speech recognition DSR splits the processing of data between a mobile device and a network server. In the front-end, features are extracted and compressed to transmit over a wireless channel to a back-end server, where the incoming stream is received and reconstructed for recognition tasks. In this paper, we propose a feature compression algorithm termed suppression by selecting wavelets SSW to achieve the two main goals of DSR: Minimizing memory and device requirements while also maintaining or even improving the recognition performance. The SSW approach first applies the discrete wavelet transform DWT to filter the incoming speech feature sequence into two temporal subsequences at the client terminal. Feature compression is achieved by keeping the low modulation frequency subsequence while discarding the high frequency counterpart. The low-frequency subsequence is then transmitted across the remote network for specific feature statistics normalization. Wavelets are favorable for resolving the temporal properties of the feature sequence, and the down-sampling process in DWT achieves data compression by reducing the amount of data at the terminal prior to transmission across the network. Once the compressed features have arrived at the server, the feature sequence can be enhanced by statistics normalization, reconstructed with inverse DWT, and compensated with a simple post filter to alleviate any over-smoothing effects from the compression stage. Results on a standard robustness task Aurora-4 and on a Mandarin Chinese news corpus showed SSW outperforms conventional noise-robustness techniques while also providing nearly a 50% compression rate during the transmission stage of DSR systems.
Additive Logistic Regression : a Statistical
(1998)

Boosting (Freund & Schapire 1996, Schapire & Singer 1998) is one of the most important recent developments in classiication methodology. The performance of many classiication algorithms can often be dramatically improved by sequentially applying them to reweighted versions of the input data, and taking a weighted majority vote of the sequence of classiiers thereby produced. We show that this seemingly mysterious phenomenon can be understood in terms of well known statistical principles, namely additive modeling and maximum likelihood. For the two-class problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multi-class generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multi-class generalizations of boosting in most situations, and far superior in some. We suggest a minor modiication to boosting that can reduce computation, often by factors of 10 to 50. Finally, we apply these insights to produce an alternative formulation of boosting decision trees. This approach, based on best-rst truncated tree induction , often leads to better performance, and can provide interpretable descriptions of the aggregate decision rule. It is also much faster com-putationally making it more suitable to large scale data mining applications .
CzEngVallex: a Bilingual Czech-English Valency Lexicon
(2016)

This paper introduces a new bilingual Czech-English verbal valency lexicon (called CzEngVallex) representing a relatively large empirical database. It includes 20,835 aligned valency frame pairs (i.e., verb senses which are translations of each other) and their aligned arguments. This new lexicon uses data from the Prague Czech-English Dependency Treebank and also takes advantage of the existing valency lexicons for both languages: the PDT-Vallex for Czech and the EngVallex for English. The CzEngVallex is available for browsing as well as for download in the LINDAT/CLARIN repository. The CzEngVallex is meant to be used not only by traditional linguists, lexicographers, translators but also by computational linguists both for the purposes of enriching theoretical linguistic accounts of verbal valency from a cross-linguistic perspective and for an innovative use in various NLP tasks.
Cartoon-recognition using video & audio descriptors
(2005)

We present a new approach for classifying mpeg-2 video sequences as `cartoon' or `non-cartoon' by analyzing specific video and audio features of consecutive frames in real-time. This is part of the well-known video-genre-classification problem, where popular TV-broadcast genres like cartoon, commercial, music, news and sports are studied. Such applications have also been discussed in the context of MPEG-7 [12]. In our method the extracted features from the visual descriptors are non-linearly combined using a multilayered perceptron and then considered together with the output of the audio-descriptor to produce a reliable recognition. The results demonstrate a high identification rate based on a large collection of 100 representative video sequences (20 cartoons and 4*20 non-cartoons) gathered from free digital TV-broadcasting.
Space and space-time modeling using process convolutions
(2007)

A continuous spatial model can be constructed by convolving a very simple, perhaps independent, process with a kernel or point spread function. This approach for constructing a spatial process offers a number of advantages over specification through a spatial covariogram. In particular, this process convolution specification leads to compuational simplifications and easily extends beyond simple stationary models. This paper uses process convolution models to build space and space-time models that are flexible and able to accomodate large amounts of data. Data from environmental monitoring is considered.
The age of gossip: spatial mean field regime
(2009)

Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasionally receive updated content from a base station, gossiping using opportunistic contacts allows for recent updates to be efficiently maintained, for a large number of nodes. In this case, however, gossiping depends on node mobility. For this reason, we introduce a new gossip model, with mobile nodes moving between different classes that can represent locations or states, which determine gossiping behavior of the nodes. Here we prove that, when the number of mobile nodes becomes large, the age of the latest updates received by mobile nodes approaches a deterministic mean-field regime. More precisely, we show that the occupancy measure of the process constructed, with the ages defined above, converges to a deterministic limit that can be entirely characterized by differential equations. This major simplification allows us to characterize how mobility, source inputs and gossiping influence the age distribution for low and high ages. It also leads to a scalable numerical evaluation of the performance of mobile update systems, which we validate (using a trace of 500 taxicabs) and use to propose infrastructure deployment.
An Ethernet-Based Fronthaul Implementation with MAC/PHY Split LTE Processing
(2017)

A testbed implementation for an Ethernet fronthaul transporting signals arising from a long-term evolution (LTE) functional subdivision ("split") at the media-access control (MAC)/physical layer (PHY) interface is presented. Based on open LTE base station software, the testbed demonstrates significant data rate reductions compared to current fronthaul implementations that rely on In- phase and Quadrature radio sample transportation and data rates that scale with cell load. All generated traffic flows are clearly distinguishable using appropriate packet headers. A selection of test cases and their corresponding results are presented to demonstrate the operation of the fronthaul and the performance of individual flows in terms of data rates and overheads.
Patient factors influencing dermal filler complications: prevention, assessment, and treatment
(2015)

While rare, complications do occur with the esthetic use of dermal fillers. Careful attention to patient factors and technique can do much to avoid these complications, and a well-informed practitioner can mitigate problems when they do occur. Since cosmetic surgery is usually an elective process, requested by the patient, clinical trials are complex to organize and run. For this reason, an international group of practicing physicians in the field of esthetics came together to share knowledge and to try and produce some informed guidance for their colleagues, considering the literature and also pooling their own extensive clinical experience. This manuscript aims to summarize the crucial aspects of patient selection, including absolute contraindications as well as situations that warrant caution, and also covers important considerations for the pre- and posttreatment periods as well as during the procedure itself. Guidance is given on both immediate and long-term management of adverse reactions. The majority of complications are related to accepting patients inappropriate for treatment or issues of sterility, placement, volume, and injection technique. It is clear that esthetic practitioners need an in-depth knowledge of all aspects of treatment with dermal fillers to achieve optimal outcomes for their patients.