Breast cancer is one of the leading causes of increasing deaths in women worldwide. The complex nature (microcalcification and masses) of breast cancer cells makes it quite difficult for radiologists to diagnose it properly. Subsequently, various computer-aided diagnosis (CAD) systems have previously been developed and are being used to aid radiologists in the diagnosis of cancer cells. However, due to intrinsic risks associated with the delayed and/or incorrect diagnosis, it is indispensable to improve the developed diagnostic systems. In this regard, machine learning has recently been playing a potential role in the early and precise detection of breast cancer. This paper presents a new machine learning-based framework that utilizes the Random Forest, Gradient Boosting, Support Vector Machine, Artificial Neural Network, and Multilayer Perception approaches to efficiently predict breast cancer from the patient data. For this purpose, the Wisconsin Diagnostic Breast Cancer (WDBC) dataset has been utilized and classified using a hybrid Multilayer Perceptron Model (MLP) and 5-fold cross-validation framework as a working prototype. For the improved classification, a connection-based feature selection technique has been used that also eliminates the recursive features. The proposed framework has been validated on two separate datasets, i.e., the Wisconsin Prognostic dataset (WPBC) and Wisconsin Original Breast Cancer (WOBC) datasets. The results demonstrate improved accuracy of 99.12% due to efficient data preprocessing and feature selection applied to the input data.

In recent years, the development of smart transportation has accelerated research on semantic segmentation as it is one of the most important problems in this area. A large receptive field has always been the center of focus when designing convolutional neural networks for semantic segmentation. A majority of recent techniques have used maxpooling to increase the receptive field of a network at an expense of decreasing its spatial resolution. Although this idea has shown improved results in object detection applications, however, when it comes to semantic segmentation, a high spatial resolution also needs to be considered. To address this issue, a new deep learning model, the M-Net is proposed in this paper which satisfies both high spatial resolution and a large enough receptive field while keeping the size of the model to a minimum. The proposed network is based on an encoder-decoder architecture. The encoder uses atrous convolution to encode the features at full resolution, and instead of using heavy transposed convolution, the decoder consists of a multipath feature extraction module that can extract multiscale context information from the encoded features. The experimental results reported in the paper demonstrate the viability of the proposed scheme.

With the advancement of camera and wireless technologies, surveillance camera-based occupancy has received ample attention from the research community. However, camera-based occupancy monitoring and wireless channels, especially Wi-Fi hotspot, pose serious privacy concerns and cybersecurity threats. Eavesdroppers can easily access confidential multimedia information and the privacy of individuals can be compromised. As a solution, novel encryption techniques for the multimedia data concealing have been proposed by the cryptographers. Due to the bandwidth limitations and computational complexity, traditional encryption methods are not applicable to multimedia data. In traditional encryption methods such as Advanced Encryption Standard (AES) and Data Encryption Standard (DES), once multimedia data are compressed during encryption, correct decryption is a challenging task. In order to utilize the available bandwidth in an efficient way, a novel secure video occupancy monitoring method in conjunction with encryption-compression has been developed and reported in this paper. The interesting properties of Chebyshev map, intertwining map, logistic map, and orthogonal matrix are exploited during block permutation, substitution, and diffusion processes, respectively. Real-time simulation and performance results of the proposed system show that the proposed scheme is highly sensitive to the initial seed parameters. In comparison to other traditional schemes, the proposed encryption system is secure, efficient, and robust for data encryption. Security parameters such as correlation coefficient, entropy, contrast, energy, and higher key space prove the robustness and efficiency of the proposed solution.

This study develops and tests the hypothesis that the implied cost of equity declines as a firm passes through the growth, maturity, and stagnant stages of its life. We use the methodology of Anthony and Ramesh (1992) for identifying corporate life cycle stages. Three different models are used to calculate the implied cost of equity: the Easton (2004) model, the Gordon and Gordon (1997) model, and the Ohlson and Juettner-Nauroth (2005) model. For testing our hypothesis, we use data of all non-financial firms listed on the Pakistan Stock Exchange from 1996 to 2012. The results lend strong support to our hypothesis in both the univariate and multiple regression analyses. The results show robustness to using different models of implied cost of equity and controlling for well-known determinants of the cost of equity such as beta, idiosyncratic risk, market-to-book ratio, firm size, and leverage. Our findings imply that firm's age can serve as a useful indicator for shareholders and creditors in evaluating riskiness and information asymmetry of the firm.