The Bivariate Transmuted Family of Distributions: Theory and Applications

The bivariate distributions are useful in simultaneous modeling of two random variables. These distributions provide a way to model models. The bivariate families of distributions are not much widely explored and in this article a new family of bivariate distributions is proposed. The new family will extend the univariate transmuted family of distributions and will be helpful in modeling complex joint phenomenon. Statistical properties of the new family of distributions are explored which include marginal and conditional distributions, conditional moments, product and ratio moments, bivariate reliability and bivariate hazard rate functions. The maximum likelihood estimation (MLE) for parameters of the family is also carried out. The proposed bivariate family of distributions is studied for the Weibull baseline distributions giving rise to bivariate transmuted Weibull (BTW) distribution. The new bivariate transmuted Weibull distribution is explored in detail. Statistical properties of the new BTW distribution are studied which include the marginal and conditional distributions, product, ratio and conditional momenst. The hazard rate function of the BTW distribution is obtained. Parameter estimation of the BTW distribution is also done. Finally, real data application of the BTW distribution is given. It is observed that the proposed BTW distribution is a suitable fit for the data used.     

Lung nodules detection using semantic segmentation and classification with optimal features

Neural Computing and Applications - Lung cancer is a deadly disease if not diagnosed in its early stages. However, early detection of lung cancer is a challenging task due to the shape and size of...     

Mechanisms of Nausea and Vomiting: Current Knowledge and Recent Advances in Intracellular Emetic Signaling Systems

Nausea and vomiting are common gastrointestinal complaints that can be triggered by diverse emetic stimuli through central and/or peripheral nervous systems. Both nausea and vomiting are considered as defense mechanisms when threatening toxins/drugs/bacteria/viruses/fungi enter the body either via the enteral (e.g., the gastrointestinal tract) or parenteral routes, including the blood, skin, and respiratory systems. While vomiting is the act of forceful removal of gastrointestinal contents, nausea is believed to be a subjective sensation that is more difficult to study in nonhuman species. In this review, the authors discuss the anatomical structures, neurotransmitters/mediators, and corresponding receptors, as well as intracellular emetic signaling pathways involved in the processes of nausea and vomiting in diverse animal models as well as humans. While blockade of emetic receptors in the prevention of vomiting is fairly well understood, the potential of new classes of antiemetics altering postreceptor signal transduction mechanisms is currently evolving, which is also reviewed. Finally, future directions within the field will be discussed in terms of important questions that remain to be resolved and advances in technology that may help provide potential answers.     

Growth and formation mechanism of sea urchin-like ZnO nanostructures on Si

Sea urchin-like nanostructures of ZnO consisting of ZnO nanowires with blunt faceted ends were grown on Si (100) substrates by oxidation of metallic Zn at 600 °C. ZnO nanowires having a diameter of 30–60 nm and length of 2–4 Μm were in similar shape with uniform diameter along its entire length with well faceted blunt ends. X-ray diffraction and transmission electron microscope analysis showed that the as-grown nanostructures were highly crystalline with wurtzite hexagonal structure having lattice constants of a=b=3.25 å and c=5.21 å. Room temperature photoluminescence (PL) measurements showed a weak near band-edge emission at 380 nm, but a strong green emission at 500–530 nm. A model for vapor-solid (VS) growth mechanism of ZnO nanowires was presented, in which nucleation of ZnO is crucial for the growth of the nanostructures.     

Painting-91: a large scale database for computational painting categorization

Computer analysis of visual art, especially paintings, is an interesting cross-disciplinary research domain. Most of the research in the analysis of paintings involve medium to small range datasets with own specific settings. Interestingly, significant progress has been made in the field of object and scene recognition lately. A key factor in this success is the introduction and availability of benchmark datasets for evaluation. Surprisingly, such a benchmark setup is still missing in the area of computational painting categorization. In this work, we propose a novel large scale dataset of digital paintings. The dataset consists of paintings from 91 different painters. We further show three applications of our dataset namely: artist categorization, style classification and saliency detection. We investigate how local and global features popular in image classification perform for the tasks of artist and style categorization. For both categorization tasks, our experimental results suggest that combining multiple features significantly improves the final performance. We show that state-of-the-art computer vision methods can correctly classify 50 % of unseen paintings to its painter in a large dataset and correctly attribute its artistic style in over 60 % of the cases. Additionally, we explore the task of saliency detection on paintings and show experimental findings using state-of-the-art saliency estimation algorithms.     

Architectural Design,Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks

Wireless Personal Communications - Software-defined networking (SDN) is widely perceived to simplify network management and monitoring. The introduction of the SDN model into wireless sensor...     

The Double Edge Sword Based Distributed Executor Service

Scalability is one of the most important quality attribute of software-intensive systems, because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload. In order to achieve scalability, thread pool system (TPS) (which is also known as executor service) has been used extensively as a middleware service in software-intensive systems. TPS optimization is a challenging problem that determines the optimal size of thread pool dynamically on runtime. In case of distributed-TPS (DTPS), another issue is the load balancing b/w available set of TPSs running at backend servers. Existing DTPSs are overloaded either due to an inappropriate TPS optimization strategy at backend servers or improper load balancing scheme that cannot quickly recover an overload. Consequently, the performance of software-intensive system is suffered. Thus, in this paper, we propose a new DTPS that follows the collaborative round robin load balancing that has the effect of a double-edge sword. On the one hand, it effectively performs the load balancing (in case of overload situation) among available TPSs by a fast overload recovery procedure that decelerates the load on the overloaded TPSs up to their capacities and shifts the remaining load towards other gracefully running TPSs. And on the other hand, its robust load deceleration technique which is applied to an overloaded TPS sets an appropriate upper bound of thread pool size, because the pool size in each TPS is kept equal to the request rate on it, hence dynamically optimizes TPS. We evaluated the results of the proposed system against state of the art DTPSs by a client-server based simulator and found that our system outperformed by sustaining smaller response times.     

Low-Dimensional Halide Perovskites and Their Advanced Optoelectronic Applications

Nano-Micro Letters - A NiFe2O4/expanded graphite (NiFe2O4/EG) nanocomposite was prepared via a simple and inexpensive synthesis method. Its lithium storage properties were studied with the goal of...     

Effectiveness of Deep Learning Models for Brain Tumor Classification and Segmentation

A brain tumor is a mass or growth of abnormal cells in the brain. In children and adults, brain tumor is considered one of the leading causes of death. There are several types of brain tumors, including benign (non-cancerous) and malignant (cancerous) tumors. Diagnosing brain tumors as early as possible is essential, as this can improve the chances of successful treatment and survival. Considering this problem, we bring forth a hybrid intelligent deep learning technique that uses several pre-trained models (Resnet50, Vgg16, Vgg19, U-Net) and their integration for computer-aided detection and localization systems in brain tumors. These pre-trained and integrated deep learning models have been used on the publicly available dataset from The Cancer Genome Atlas. The dataset consists of 120 patients. The pre-trained models have been used to classify tumor or no tumor images, while integrated models are applied to segment the tumor region correctly. We have evaluated their performance in terms of loss, accuracy, intersection over union, Jaccard distance, dice coefficient, and dice coefficient loss. From pre-trained models, the U-Net model achieves higher performance than other models by obtaining 95% accuracy. In contrast, U-Net with ResNet-50 outperforms all other models from integrated pre-trained models and correctly classified and segmented the tumor region.     

Learning from demonstration in robots: Experimental comparison of neural architectures

Robots have played an important role in the automation of computer aided manufacturing. The classical robot control implementation involves an expensive key step of model-based programming. An intuitive way to reduce this expensive exercise is to replace programming with machine learning of robot actions from demonstration where a (learner) robot learns an action by observing a demonstrator robot performing the same. To achieve this learning from demonstration (LFD) different machine learning techniques such as Artificial Neural Networks (ANN), Genetic Algorithms, Hidden Markov Models, Support Vector Machines, etc. can be used. This piece of work focuses exclusively on ANNs. Since ANNs have many standard architectural variations divided into two basic computational categories namely the recurrent networks and feed-forward networks, representative networks from each have been selected for study, i.e. Feed Forward Multilayer Perceptron (FF) network for feed-forward networks category and Elman (EL), and Nonlinear Autoregressive Exogenous Model (NARX) networks for the recurrent networks category. The main objective of this work is to identify the most suitable neural architecture for application of LFD in learning different robot actions. The sensor and actuator streams of demonstrated action are used as training data for ANN learning. Consequently, the learning capability is measured by comparing the error between demonstrator and corresponding learner streams. To achieve fairness in comparison three steps have been taken. First, Dynamic Time Warping is used to measure the error between demonstrator and learner streams, which gives resilience against translation in time. Second, comparison statistics are drawn between the best, instead of weight-equal, configurations of competing architectures so that learning capability of any architecture is not forced handicap. Third, each configuration's error is calculated as the average of ten trials of all possible learning sequences with random weight initialization so that the error value is independent of a particular sequence of learning or a particular set of initial weights. Six experiments are conducted to get a performance pattern of each architecture. In each experiment, a total of nine different robot actions were tested. Error statistics thus obtained have shown that NARX architecture is most suitable for this learning problem whereas Elman architecture has shown the worst suitability. Interestingly the computationally lesser MLP gives much lower and slightly higher error statistics compared to the computationally superior Elman and NARX neural architectures, respectively.