Description:
To ensure customer satisfaction and greater market acceptance, voice over Wi-Fi networks must ensure voice quality under various network parameters, configurations and traffic conditions, and other practical effects, e.g., channel noise, and capturing effects. An accurate voice capacity estimation model considering these factors can greatly assist network designers. In the current work, we propose an analytical model to estimate voice over Internet Protocol (VoIP) capacity over Wi-Fi networks addressing these issues. We employ widely used ITU-T E-model to assess voice quality and VoIP call capacity is presented in the form of an optimization problem with voice quality requirement as a constraint. In particular, we analyze delay and loss in channel access and queue, and their impacts on voice quality. The proposed capacity model is first developed for a single hop wireless local area network (WLAN) and then extended for multihop scenarios. To model real network scenario closely, we also consider channel noise and capture effect, and analyze the impacts of transmission range, interference range, and WLAN radius. In absence of any existing call capacity model that considers all the above factors concomitantly, our proposed model will be extremely useful to network designers and voice capacity planners.
Description:
WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
Description:
WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
Description:
Abstract: Desolvation property is used here to predict protein-protein binding sites exploiting the fact that lower-valued 'optimal docking area' ODA (Fernandez-Recio et al., 2005) points form cluster at the interface. The proposed method involves two steps; clustering the ODA points and representing ODA points by average ODA values. On 51 nonredundant proteins, results show the success rate improved considerably. Considering only significant ODA, the previous ODA method has obtained a success rate of 65% with overall success rate of 39%. The proposed method improved the overall success rate to 61%. Further, comparable results were found for X-ray and NMR structures.
Description:
This study proposes a modified artificial immune network algorithm for function optimization problems based on idiotypic immune network theory. A hyper-cubic mutation operator was introduced to reduce the heavy computational cost of the traditional opt-AINet algorithm. Moreover, the new symmetrical mutation can effectively improve local search. To maintain population diversity, we also devised an immune selection mechanism based on density and fitness. The global convergence of the algorithm was deduced through the method of pure probability and iterative formula. Simulation results of benchmark function optimization show that the modified algorithm converges more effectively than other immune network algorithms.
Description:
In recent years, progress has been made in the analysis of global convergence of clonal selection algorithms (CSA), but most analyses are based on the theory of Markov chain, which depend on the description of the transition matrix and eigenvalues. However, such analyses are very complicated, especially when the population size is large, and are presented for particular implementations of CSA. In this paper, instead of the traditional Markov chain theory, we introduce martingale theory to prove the convergence of a class of CSA, called elitist clonal selection algorithm (ECSA). Using the submartingale convergence theorem, the best individual affinity evolutionary sequence is described as a submartingale, and the almost everywhere convergence of ECSA is derived. Particularly, the algorithm is proved convergent with probability 1 in finite steps when the state space of population is finite. This new proof of global convergence analysis of ECSA is more simplified and effective, and not implementation specific.
Description:
In this paper, we propose a new type of adaptive fuzzy inference system with a view to achieve improved performance for forecasting nonlinear time series data by dynamically adapting the fuzzy rules with arrival of new data. The structure of the fuzzy model utilized in the proposed system is developed based on the log-likelihood value of each data vector generated by a trained Hidden Markov Model. As part of its adaptation process, our system checks and computes the parameter values and generates new fuzzy rules as required, in response to new observations for obtaining better performance. In addition, it can also identify the most appropriate fuzzy rule in the system that covers the new data; and thus requires to adapt the parameters of the corresponding rule only, while keeping the rest of the model unchanged. This intelligent adaptive behavior enables our adaptive fuzzy inference system (FIS) to outperform standard FISs. We evaluate the performance of the proposed approach for forecasting stock price indices. The experimental results demonstrate that our approach can predict a number of stock indices, e.g., Dow Jones Industrial (DJI) index, NASDAQ index, Standard and Poor500 (S&P500) index and few other indices from UK (FTSE100), Germany (DAX) , Australia (AORD) and Japan (NIKKEI) stock markets, accurately compared with other existing computational and statistical methods.
Description:
Predicting the secondary structure of proteins from a primary sequence alone has been variously approached from either a classification or a generative model perspective. The most prominent classification methods have used neural networks, which involves mappings from a local window of residues in the sequence to the structural state of the central residue in the window, thus capturing the local interactions effectively. However, they fail to capture distant interactions among residues. The generative models based on Bayesian segmentation capture sequence structure relationships using generalized hidden Markov models with explicit state duration. They capture non-local interactions through a joint sequence-structure probability distribution based on structural segments. In this paper, we investigate a combined architecture of Bayesian segmentation at the first stage and neural network at the second stage which captures both local and non-local correlation, to increase the single sequence prediction accuracy. The combined architecture is further enhanced by using neural network optimization and ensemble techniques.
Description:
In this paper, we introduce a new hybrid of Hidden Markov Model (HMM), Fuzzy Logic and multiobjective Evolutionary Algorithm (EA) for building a fuzzy model to predict non-linear time series data. In this hybrid approach, the HMM's log-likelihood score for each data pattern is used to rank the data and fuzzy rules are generated using the ranked data. We use multiobjective EA to find a range of trade-off solutions between the number of fuzzy rules and the prediction accuracy. The model is tested on a number of benchmark and more recent financial time series data. The experimental results clearly demonstrate that our model is able to generate a reduced number of fuzzy rules with similar (and in some cases better) performance compared with typical data driven fuzzy models reported in the literature.
Description:
Wireless sensor networks (WSNs) will be an integral part of the future Internet of Things (loT) environment and generate large volumes of data. However, these data would only be of benefit if useful knowledge can be mined from them. A data mining framework for WSNs includes data extraction, storage and mining techniques, and must be efficient and dependable. In this paper, we propose a new type of behavioral pattern mining technique from sensor data called regularly frequent sensor patterns (RFSPs). RFSPs can identify a set of temporally correlated sensors which can reveal significant knowledge from the monitored data. A distributed data extraction model to prepare the data required for mining RFSPs is proposed, as the distributed scheme ensures higher availability through greater redundancy. The tree structure for RFSP is compact requires less memory and can be constructed using only a single scan through the dataset, and the mining technique is efficient with low runtime. Current mining techniques in the literature on sensor data employ a single memory-based sequential approach and hence are not efficient. Moreover, usage of the. MapReduce model for the distributed solution has not been explored extensively. Since MapReduce is becoming the de facto model for computation on large data, we also propose a parallel implementation of the RFSP mining algorithm, called RFSP on Hadoop (RFSP-H), which uses a MapReduce-based framework to gain further efficiency. Experiments conducted to evaluate the compactness and performance of the data extraction model, RFSP-tree and RFSP-H mining show improved results. (C) 2016 Elsevier Inc. All rights reserved.