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.

     

On Density-Based Data Streams Clustering Algorithms: A Survey简

Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in data stream applications. Data streams are infinite and evolving over time, and we do not have any knowledge about the number of clusters. In a data stream environment due to various factors, some noise appears occasionally. Density-based method is a remarkable class in clustering data streams, which has the ability to discover arbitrary shape clusters and to detect noise. Furthermore, it does not need the nmnber of clusters in advance. Due to data stream characteristics, the traditional density-based clustering is not applicable. Recently, a lot of density-based clustering algorithms are extended for data streams. The main idea in these algorithms is using density- based methods in the clustering process and at the same time overcoming the constraints, which are put out by data streanFs nature. The purpose of this paper is to shed light on some algorithms in the literature on density-based clustering over data streams. We not only summarize the main density-based clustering algorithms on data streams, discuss their uniqueness and limitations, but also explain how they address the challenges in clustering data streams. Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms＇ performance. It is hoped that this survey will serve as a steppingstone for researchers studying data streams clustering, particularly density-based algorithms.     

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.     

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.     

A theory of mode of action of azolylalkylquinolines as DNA binding agents using automated flexible ligand docking

Azolylalkylquinolines (AAQs) are a family of quinolines with varying degrees of cytotoxic activity (comparable or moderately superior to adriamycin in some cases) developed in the past decade in our group where their exact mode of action is still unclear. In this study the most probable DNA binding mode of AAQs was investigated employing a novel flexible ligand docking approach by using AutoDock 3.0. Forty-nine AAQs with known experimental inhibitory activity were docked onto d(CGCAAATTTGCG)(2), d(CGATCG)(2) and d(CGCG)(2) oligonucleotides retrieved from the Protein Data Bank (PDB IDs: 102D, 1D12 and 1D32, respectively) as the representatives of the three plausible models of interactions between chemotherapeutic agents and DNA (groove binding, groove binding plus intercalation and bisintercalation, respectively). Good correlation (r(2)=0.64) between calculated binding energies and experimental inhibitory activities was obtained using groove binding plus intercalation model for phenyl-azolylalkylquinoline (PAAQ) series. Our findings show that the most probable mode of action of PAAQs as DNA binding agents is via intercalation of quinolinic moiety between CG base pairs with linker chain and azole moiety binding to the minor groove.     

Cluster Size Optimization in Sensor Networks with Decentralized Cluster-Based Protocols

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view.