SoroushVahidi/scidocs huggingface dataset:
A Randomized Controlled Trial Comparing the Attention Training Technique and Mindful Self-Compassion for Students With Symptoms of Depression and Anxiety
(2018)

The Attention Training Technique (ATT) and Mindful Self-Compassion (MSC) are two promising psychological interventions. ATT is a 12-min auditory exercise designed to strengthen attentional control and promote external focus of attention, while MSC uses guided meditation and exercises designed to promote self-compassion. In this randomized controlled trial (RCT), a three-session intervention trial was conducted in which university students were randomly assigned to either an ATT-group (n = 40) or a MSC-group (n = 41). The students were not assessed with diagnostic interviews but had self-reported symptoms of depression, anxiety, or stress. Participants listened to audiotapes of ATT or MSC before discussing in groups how to apply these principles for their everyday struggles. Participants also listened to audiotapes of ATT and MSC as homework between sessions. Participants in both groups showed significant reductions in symptoms of anxiety and depression accompanied by significant increases in mindfulness, self-compassion, and attention flexibility post-intervention. These results were maintained at 6-month follow-up. Improvement in attention flexibility was the only significant unique predictor of treatment response. The study supports the use of both ATT and MSC for students with symptoms of depression and anxiety. Further, it suggests that symptom improvement is related to changes in attention flexibility across both theoretical frameworks. Future studies should focus on how to strengthen the ability for attention flexibility to optimize treatment for emotional disorder.
Optimization of hybrid PV/wind power system for remote telecom station
(2011)

The rapid depletion of fossil fuel resources and environmental concerns has given awareness on generation of renewable energy resources. Among the various renewable resources, hybrid solar and wind energy seems to be promising solutions to provide reliable power supply with improved system efficiency and reduced storage requirements for stand-alone applications. This paper presents a feasibility assessment and optimum size of photovoltaic (PV) array, wind turbine and battery bank for a standalone hybrid Solar/Wind Power system (HSWPS) at remote telecom station of Nepal at Latitude (27°23′50″) and Longitude (86°44′23″) consisting a telecommunication load of Very Small Aperture Terminal (VSAT), Repeater station and Code Division Multiple Access Base Transceiver Station (CDMA 2C10 BTS). In any RES based system, the feasibility assessment is considered as the first step analysis. In this work, feasibility analysis is carried through hybrid optimization model for electric renewables (HOMER) and mathematical models were implemented in the MATLAB environment to perform the optimal configuration for a given load and a desired loss of power supply probability (LPSP) from a set of systems components with the lowest value of cost function defined in terms of reliability and levelized unit electricity cost (LUCE). The simulation results for the existing and the proposed models are compared. The simulation results shows that existing architecture consisting of 6.12 kW KC85T photovoltaic modules, 1kW H3.1 wind turbine and 1600 Ah GFM-800 battery bank have a 36.6% of unmet load during a year. On the other hand, the proposed system includes 1kW ∗2 H3.1 Wind turbine, 8.05 kW TSM-175DA01 photovoltaic modules and 1125 Ah T-105 battery bank with system reliability of 99.99% with a significant cost reduction as well as reliable energy production.
Digital control of a half-bridge LLC resonant converter
(2012)

Recently, LLC resonant converters are gaining more and more interest in DC/DC conversion due to their high efficiency and power density. Usually, they are used in low power applications, i.e. in the range of few hundred Watt and with constant output load, however they are very appealing in high power and renewable energy applications as well as in many other applications affected by wide variations of the load and/or the source voltage. This paper presents and discusses a novel half bridge DC/DC resonant converter with digital control and fuzzy logic. The proposed system is compared with a more traditional PID controller. A variable frequency control algorithms are implemented using a low cost, high performance Texas Instrument TMS320F28069 DSP for the regulation of the output voltage. Simulation results using MATLAB are presented to evaluate the quality of the obtained result. A laboratory prototype has been realized and experimental results obtained using both PID and Fuzzy controllers are shown and discussed.
The place for ubiquitous computing in schools: lessons learned from a school-based intervention for youth physical activity
(2011)

With rising concerns about obesity and sedentary lifestyles in youth, there has been an increasing interest in understanding how pervasive and ubiquitous computing technologies can catalyze positive health behaviors in children and teens. School-based interventions seem like a natural choice, and ubiquitous computing technologies hold much promise for these interventions. Yet the literature contains little guidance for how to approach school-based ubicomp deployments. Grounded in our analysis of a large-scale US school-based intervention for promoting youth physical activity, we present an approach to the design and evaluation of school-based ubicomp that treats the school as a social institution. We show how the school regulates students' daily lives, drawing from work in the sociology of schools to create a framing for planning, executing and analyzing school-based ubicomp deployments. These insights will assist other researchers and designers engaging in deployments of ubiquitous computing systems in settings with established institutional structures.
Estimating Crowd Density in an RF-Based Dynamic Environment
(2013)

Crowd density estimating is a crucial service in many applications (e.g., smart guide, crowd control, etc.), which is often conducted using pattern recognition technologies based on video surveillance. However, these kinds of methods are high cost, and cannot work well in low-light environments. Radio frequency based technologies are adopted more and more in indoor application, since radio signal strength (RSS) can be easily obtained by various wireless devices without additional cost. In this paper, we introduce a low cost crowd density estimating method using wireless sensor networks. The proposed approach is a device-free crowd counting approach without objects carrying any assistive device. It is hard to count objects based on RSS measurement, since different number of mobile people at different positions often generates different RSS due to the multipath phenomenon. This paper utilizes the space-time relativity of crowd distribution to reduce the estimation errors. The proposed approach is an iterative process, which contains three phases: the training phase, the monitoring phase, and the calibrating phase. Our experiments are implemented based on TelosB sensor platform. We also do some large-scale simulations to verify the feasibility and the effectiveness of our crowd density estimating approach.
Selective Sampling with Redundant Views
(2000)

Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a novel approach to selective sampling which we call co-testing. Cotesting can be applied to problems with redundant views (i.e., problems with multiple disjoint sets of attributes that can be used for learning). We analyze the most general algorithm in the co-testing family, naive co-testing, which can be used with virtually any type of learner. Naive co-testing simply selects at random an example on which the existing views disagree. We applied our algorithm to a variety of domains, including three real-world problems: wrapper induction, Web page classi cation, and discourse trees parsing. The empirical results show that besides reducing the number of labeled examples, naive co-testing may also boost the classi cation accuracy.
A Methodology for Realizing High Efficiency Class-J in a Linear and Broadband PA
(2009)

The design and implementation of a class-J mode RF power amplifier is described. The experimental results indicate the class-J mode's potential in achieving high efficiency across extensive bandwidth, while maintaining predistortable levels of linearity. A commercially available 10 W GaN (gallium nitride) high electron mobility transistor device was used in this investigation, together with a combination of high power waveform measurements, active harmonic load-pull and theoretical analysis of the class-J mode. Targeting a working bandwidth of 1.5-2.5 GHz an initial power amplifier (PA) design was based on basic class-J theory and computer-aided design simulation. This realized a 50% bandwidth with measured drain efficiency of 60%-70%. A second PA design iteration has realized near-rated output power of 39 dBm and improved efficiency beyond the original 2.5 GHz target, hence extending efficient PA operation across a bandwidth of 1.4-2.6 GHz, centered at 2 GHz. This second iteration made extensive use of active harmonic load-pull and waveform measurements, and incorporated a novel design methodology for achieving predistortable linearity. The class-J amplifier has been found to be more realizable than conventional class-AB modes, with a better compromise between power and efficiency tradeoffs over a substantial RF bandwidth.
Hardware Accelerated Per-Pixel Displacement Mapping
(2004)

In this paper we present an algorithm capable of rendering a displacement mapped triangle mesh interactively on latest GPUs. The algorithm uses only pixel shaders and does not rely on adaptively adding geometry. All sampling of the displacement map takes place in the pixel shader and bior trilinear filtering can be applied to it, and at the same time as the calculations are done per pixel in the shader, the algorithm has automatic level of detail control. The triangles of the base mesh are extruded along the respective normal directions and then the resulting prisms are rendered by casting rays inside and intersecting them with the displaced surface. Two different implementations are discussed in detail.
Paraphrasing Out-of-Vocabulary Words with Word Embeddings and Semantic Lexicons for Low Resource Statistical Machine Translation
(2016)

Out-of-vocabulary (OOV) word is a crucial problem in statistical machine translation (SMT) with low resources. OOV paraphrasing that augments the translation model for the OOV words by using the translation knowledge of their paraphrases has been proposed to address the OOV problem. In this paper, we propose using word embeddings and semantic lexicons for OOV paraphrasing. Experiments conducted on a low resource setting of the OLYMPICS task of IWSLT 2012 verify the effectiveness of our proposed method.
A Character Model with Moral Emotions: Preliminary Evaluation
(2014)

In literary and drama criticism, emotions, and moral emotions in particular, have been pointed out as one of characterizing features of stories. In this paper, we propose to model story characters as value-based emotional agents, who appraise their own and others’ actions based on their desires and values, and feel the appropriate moral emotions in response to narrative situations that challenge their goals and values. In order to validate the appropriateness of the agent model for narrative characters, we ran an experiment with human participants aimed at comparing their expectations about characters’ emotions with the predictions of the value-based model of emotional agent. The results of the experiment show that the participants’ expectations meet the predictions of the model. 1998 ACM Subject Classification I.2.11 Intelligent Agents, I.2.0 Cognitive Simulation
A Spatial Mapping Algorithm with Applications in Deep Learning-Based Structure Classification
(2018)

Convolutional Neural Network (CNN)-based machine learning systems have made breakthroughs in feature extraction and image recognition tasks in two dimensions (2D). Although there is significant ongoing work to apply CNN technology to domains involving complex 3D data, the success of such efforts has been constrained, in part, by limitations in data representation techniques. Most current approaches rely upon low-resolution 3D models, strategic limitation of scope in the 3D space, or the application of lossy projection techniques to allow for the use of 2D CNNs. To address this issue, we present a mapping algorithm that converts 3D structures to 2D and 1D data grids by mapping a traversal of a 3D space-filling curve to the traversal of corresponding 2D and 1D curves. We explore the performance of 2D and 1D CNNs trained on data encoded with our method versus comparable volumetric CNNs operating upon raw 3D data from a popular benchmarking dataset. Our experiments demonstrate that both 2D and 1D representations of 3D data generated via our method preserve a significant proportion of the 3D data’s features in forms learnable by CNNs. Furthermore, we demonstrate that our method of encoding 3D data into lower-dimensional representations allows for decreased CNN training time cost, increased original 3D model rendering resolutions, and supports increased numbers of data channels when compared to purely volumetric approaches. This demonstration is accomplished in the context of a structural biology classification task wherein we train 3D, 2D, and 1D CNNs on examples of two homologous branches within the Ras protein family. The essential contribution of this paper is the introduction of a dimensionality-reduction method that may ease the application of powerful deep learning tools to domains characterized by complex structural data.
Fast End-to-End Trainable Guided Filter
(2018)

Image processing and pixel-wise dense prediction have been advanced by harnessing the capabilities of deep learning. One central issue of deep learning is the limited capacity to handle joint upsampling. We present a deep learning building block for joint upsampling, namely guided filtering layer. This layer aims at efficiently generating the high-resolution output given the corresponding low-resolution one and a high-resolution guidance map. The proposed layer is composed of a guided filter, which is reformulated as a fully differentiable block. To this end, we show that a guided filter can be expressed as a group of spatial varying linear transformation matrices. This layer could be integrated with the convolutional neural networks (CNNs) and jointly optimized through end-to-end training. To further take advantage of end-to-end training, we plug in a trainable transformation function that generates task-specific guidance maps. By integrating the CNNs and the proposed layer, we form deep guided filtering networks. The proposed networks are evaluated on five advanced image processing tasks. Experiments on MIT-Adobe FiveK Dataset demonstrate that the proposed approach runs 10-100Ã— faster and achieves the state-of-the-art performance. We also show that the proposed guided filtering layer helps to improve the performance of multiple pixel-wise dense prediction tasks. The code is available at https://github.com/wuhuikai/DeepGuidedFilter.
Building Lexical Vector Representations from Concept Definitions
(2017)

The use of distributional language representations have opened new paths in solving a variety of NLP problems. However, alternative approaches can take advantage of information unavailable through pure statistical means. This paper presents a method for building vector representations from meaning unit blocks called concept definitions, which are obtained by extracting information from a curated linguistic resource (Wiktionary). The representations obtained in this way can be compared through conventional cosine similarity and are also interpretable by humans. Evaluation was conducted in semantic similarity and relatedness test sets, with results indicating a performance comparable to other methods based on single linguistic resource extraction. The results also indicate noticeable performance gains when combining distributional similarity scores with the ones obtained using this approach. Additionally, a discussion on the proposed method’s shortcomings is provided in the analysis of error cases.
Circuit Design of a High Speed and Low Power CMOS Continuous-time Current Comparator
(2001)

Current comparator is a fundamental component of current-mode analog integrated circuits. A novel high-performance continuous-time CMOS current comparator is proposed in this paper, which comprises one CMOS complementary amplifier, two resistive-load amplifiers and two CMOS inverters. A MOS resistor is used as the CMOS complementary amplifier’s negative feedback. Because the voltage swings of the CMOS complementary amplifier are reduced by low input and output resistances, the delay time of the current comparator is shortened. Its power consumption can be reduced rapidly with the increase of input current. Simulation results based on 1.2 μm CMOS process model show the speed of the novel current comparator is comparable with those of the existing fastest CMOS current comparators, and its power consumption is the lowest, so it has the smallest power-delay product. Furthermore, the new current comparator occupies small area and is process-robust, so it is very suitable to high-speed and low-power applications.
Automated Generation of Attack Trees
(2014)

Attack trees are widely used to represent threat scenarios in a succinct and intuitive manner, suitable for conveying security information to non-experts. The manual construction of such objects relies on the creativity and experience of specialists, and therefore it is error-prone and impracticable for large systems. Nonetheless, the automated generation of attack trees has only been explored in connection to computer networks and levering rich models, whose analysis typically leads to an exponential blow-up of the state space. We propose a static analysis approach where attack trees are automatically inferred from a process algebraic specification in a syntax-directed fashion, encompassing a great many application domains and avoiding incurring systematically an exponential explosion. Moreover, we show how the standard propositional denotation of an attack tree can be used to phrase interesting quantitative problems, that can be solved through an encoding into Satisfiability Modulo Theories. The flexibility and effectiveness of the approach is demonstrated on the study of a national-scale authentication system, whose attack tree is computed thanks to a Java implementation of the framework.
A low cost implementation of MQTT using ESP8266
(2016)

Technology is great growling engine of the change and Internet of Things (IoT) is the backbone of such revolutionary engines. Basically, in the real world the things having sensor capability, sufficient power supply and connectivity to internet makes field like Internet of Things (IoT) possible. For such rapid growing technology, it is the necessity to have very light, inexpensive and minimum bandwidth protocol like Message Queuing Telemetry Transport (MQTT) Protocol. Because of such non-established protocol it is easy for the clients to publish or/and subscribe the desire topic through the host acting as server of the network also known to be the broker. In this paper, it is shown that communication between the low power ESP8266 WiFi as client with the clients on smartphones and laptop using an MQTT protocol becomes easier and more reliable. The WiFi enabled ESP8266 board interfaces with DHT11 sensor and LDR sensor to monitor the ambient condition and according to the light intensity level the brightness level of 8∗8 Neopixel matrix is controlled. The adafruit.io is the MQTT server i.e, broker which also provides the facility of monitoring system through the dashboard. The clients on smartphone and laptop subscribes to the topics of temperature, humidity and light intensity level gets the respective update. The main objective of the paper is to implement the idea for the smart home appliance, street light system for the smart cities, fire alert systems, whether monitoring system and so.
Machine Learning Techniques in Spam Filtering
(2004)

The article gives an overview of some of the most popular machine learning methods (Bayesian classification, k-NN, ANNs, SVMs) and of their applicability to the problem of spam-filtering. Brief descriptions of the algorithms are presented, which are meant to be understandable by a reader not familiar with them before. A most trivial sample implementation of the named techniques was made by the author, and the comparison of their performance on the PU1 spam corpus is presented. Finally, some ideas are given of how to construct a practically useful spam filter using the discussed techniques. The article is related to the author’s first attempt of applying the machine-learning techniques in practice, and may therefore be of interest primarily to those getting aquainted with machine-learning.
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
(2006)

We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While nearest neighbor classifiers are natural in this setting, they suffer from the problem of high variance (in bias-variance decomposition) in the case of limited sampling. Alternatively, one could use support vector machines but they involve time-consuming optimization and computation of pairwise distances. We propose a hybrid of these two methods which deals naturally with the multiclass setting, has reasonable computational complexity both in training and at run time, and yields excellent results in practice. The basic idea is to find close neighbors to a query sample and train a local support vector machine that preserves the distance function on the collection of neighbors. Our method can be applied to large, multiclass data sets for which it outperforms nearest neighbor and support vector machines, and remains efficient when the problem becomes intractable for support vector machines. A wide variety of distance functions can be used and our experiments show state-of-the-art performance on a number of benchmark data sets for shape and texture classification (MNIST, USPS, CUReT) and object recognition (Caltech- 101). On Caltech-101 we achieved a correct classification rate of 59.05%(±0.56%) at 15 training images per class, and 66.23%(±0.48%) at 30 training images.
Support vector machines for spam categorization
(1999)

We study the use of support vector machines (SVM's) in classifying e-mail as spam or nonspam by comparing it to three other classification algorithms: Ripper, Rocchio, and boosting decision trees. These four algorithms were tested on two different data sets: one data set where the number of features were constrained to the 1000 best features and another data set where the dimensionality was over 7000. SVM's performed best when using binary features. For both data sets, boosting trees and SVM's had acceptable test performance in terms of accuracy and speed. However, SVM's had significantly less training time.
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
(2000)

Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that will change your life to life better. It is the thing that will give you many things around the world and this universe, in the real world and here after. As what will be given by this an introduction to support vector machines and other kernel based learning methods, how can you bargain with the thing that has many benefits for you?