Stability enhancement of polypyrrole thin film ammonia sensor by camphor sulfonic acid dopant

Journal of Materials Science: Materials in Electronics - The main weakness of polymer gas sensors is its stability. Here, we report stability enhancement of a 100 nm polypyrrole (PPy) thin...     

Imaging of the optic disc and retinal nerve fiber layer: the effects of age, optic disc area, refractive error, and gender.

We cross-sectionally examined the relationship between age, optic disc area, refraction, and gender and optic disc topography and retinal nerve fiber layer (RNFL) measurements, using optical imaging techniques. One eye from each of 155 Caucasian subjects (age range 23.0-80.8 y) without ocular pathology was included. Measurements were obtained by using the Heidelberg Retina Tomography (HRT), the GDx Nerve Fiber Analyzer, and the Optical Coherence Tomograph (OCT). The effects of age were small (R2 < 17%) and were limited to specific HRT, GDx, and OCT parameters. Disc area was significantly associated with most HRT parameters and isolated GDx and OCT parameters. Refraction and gender were not significantly associated with any optic disc or RNFL parameters. Although effects of age on the optic disc and RNFL are small, they should be considered in monitoring ocular disease. Optic disc area should be considered when cross-sectionally evaluating disc topography and, to a lesser extent, RNFL thickness.     

Bayesian estimation based on vague lifetime data

In Classical Bayesian approach, estimation of lifetime data usually is dealing with precise information. However, in real world, some informations about an underlying system might be imprecise and represented in the form of vague quantities. In these situations, we need to generalize classical methods to vague environment for studying and analyzing the systems of interest. In this paper, we propose the Bayesian estimation of failure rate and mean time to failure based on vague set theory in the case of complete and censored data sets. To employ the Bayesian approach, model parameters are assumed to be vague random variables with vague prior distributions. This approach will be used to induce the vague Bayes estimate of failure rate and mean time to failure by introducing and applying a theorem called “Resolution Identity” for vague sets. In order to evaluate the membership degrees of vague Bayesian estimate for these quantities, a computational procedure is investigated. In the proposed method, the original problem is transformed into a nonlinear programming problem which is then divided into eight subproblems to simplifying computations.     

A four-bias three-layer graphene-based THz absorber

Wave absorbers are considered to be fundamental building blocks for the manipulation of light. Almost all optical systems exploit absorbers to realize some functions. A highly tunable wide-band THz absorber is presented herein. Utilizing a dual-bias scheme with a single graphene layer leads to greater freedom to control the absorption response, while a conventional periodic array of graphene ribbons and a layer of graphene sheet are also exploited. Also, a circuit model representation for all the constituent parts of the proposed absorber is developed with an evolved design methodology. According to the simulation results, wide-band absorption from 3.5 to 6 THz is achieved.

     

Energy and load balancing routing protocol for IoT

Due to the limitation of node energy resources, the management of energy consumption is one of the most important problems of the internet of things (IoT). Therefore, many studies have tried to optimize and manage energy consumption by focusing on different techniques. Although each of these studies has improved and optimized energy consumption, there are many important problems, including maintaining traffic balance and energy consumption of network nodes. Therefore, a new method is necessary to maintain the load and energy balancing of network nodes. Therefore, this paper introduces energy and load balancing routing protocol for IoT (ELBRP) based on the development of the RPL routing protocol and the efficiency of data distribution technique. The ELBRP performance has three steps. In the first step, along with the process of sending DODAG information object (DIO) messages, the status of network nodes is evaluated. In the second step, the DODAG communication graph is formed according to the ELBRP. In the third step, data transmission is done according to the distribution technique with the goal of balancing traffic and energy. The simulation results using cooja simulator showed the superiority of ELBRP in improving energy consumption and successful delivery ratio, reducing delay and increasing the network lifetime compared to the similar methods.     

A meshless method for solving 1D time-dependent heat source problem

A novel meshless numerical procedure based on the method of fundamental solutions (MFS) and the heat polynomials is proposed for recovering a time-dependent heat source and the boundary data simultaneously in an inverse heat conduction problem (IHCP). We will transform the problem into a homogeneous IHCP and initial value problems for the first-order ordinary differential equation. An improved method of MFS is used to solve the IHCP and a finite difference method is applied for solving the initial value problems. The advantage of applying the proposed meshless numerical scheme is producing the shape functions which provide the important delta function property to ensure that the essential conditions are fulfilled. Numerical experiments for some examples are provided to show the effectiveness of the proposed algorithm.     

A co-classification approach to learning from multilingual corpora

We address the problem of learning text categorization from a corpus of multilingual documents. We propose a multiview learning, co-regularization approach, in which we consider each language as a separate source, and minimize a joint loss that combines monolingual classification losses in each language while ensuring consistency of the categorization across languages. We derive training algorithms for logistic regression and boosting, and show that the resulting categorizers outperform models trained independently on each language, and even, most of the times, models trained on the joint bilingual data. Experiments are carried out on a multilingual extension of the RCV2 corpus, which is available for benchmarking.     

A modified particle swarm optimization for economic dispatch with non-smooth cost functions

This paper presents a new approach to economic dispatch (ED) problems with non-smooth cost functions using a particle swarm optimization (PSO) technique. The practical ED problems have non-smooth cost functions with equality and inequality constraints, which makes the problem of finding the global optimum difficult when using any mathematical approaches. Since, standard PSO may converge at the early stage, in this paper, a modified PSO (MPSO) mechanism is suggested to deal with the equality and inequality constraints in the ED problems. To validate the results obtained by MPSO, standard particle swarm optimization (PSO) and guaranteed convergence particle swarm optimization (GCPSO) are applied for comparison. Also, the results obtained by MPSO, PSO and GCPSO are compared with the previous approaches reported in the literature. The results show that the MPSO produces optimal or nearly optimal solutions for the study systems.     

An efficient classifier to diagnose of schizophrenia based on the EEG signals

In this paper, electroencephalogram (EEG) signals of 13 schizophrenic patients and 18 age-matched control participants are analyzed with the objective of classifying the two groups. For each case, multi-channels (22 electrodes) scalp EEG is recorded. Several features including autoregressive (AR) model parameters, band power and fractal dimension are extracted from the recorded signals. Leave-one (participant)-out cross validation is used to have an accurate estimation for the separability of the two groups. Boosted version of Direct Linear Discriminant Analysis (BDLDA) is selected as an efficient classifier which applied on the extracted features. To have comparison, classifiers such as standard LDA, Adaboost, support vector machine (SVM), and fuzzy SVM (FSVM) are applied on the features. Results show that the BDLDA is more discriminative than others such that their classification rates are reported 87.51%, 85.36% and 85.41% for the BDLDA, LDA, Adaboost, respectively. Results of SVM and FSVM classifiers were lower than 50% accuracy because they are more sensitive to outlier instances. In order to determine robustness of the suggested classifier, noises with different amplitudes are added to the test feature vectors and robustness of the BDLDA was higher than the other compared classifiers.     

Implicit branching and parameterized partial cover problems

Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well-known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems has been intensively studied in planar graphs and in graphs excluding a fixed graph H as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.