Local calibration of rigid pavement performance models using resampling methods

The performance prediction models in the Pavement-ME design software are nationally calibrated using in-service pavement material properties, pavement structure, climate and truck loadings, and performance data obtained from the Long-Term Pavement Performance programme. The nationally calibrated models may not perform well if the inputs and performance data used to calibrate those do not represent the local design and construction practices. Therefore, before implementing the new M-E design procedure, each state highway agency (SHA) should evaluate how well the nationally calibrated performance models predict the measured field performance. The local calibrations of the Pavement-ME performance models are recommended to improve the performance prediction capabilities to reflect the unique conditions and design practices. During the local calibration process, the traditional calibration techniques (split sampling) may not necessarily provide adequate results when limited number of pavement sections are available. Consequently, there is a need to employ statistical and resampling methodologies that are more efficient and robust for model calibrations given the data related challenges encountered by SHAs. The main objectives of the paper are to demonstrate the local calibration of rigid pavement performance models and compare the calibration results based on different resampling techniques. The bootstrap is a non-parametric and robust resampling technique for estimating standard errors and confidence intervals of a statistic. The main advantage of bootstrapping is that model parameters estimation is possible without making distribution assumptions. This paper presents the use of bootstrapping and jackknifing to locally calibrate the transverse cracking and IRI performance models for newly constructed and rehabilitated rigid pavements. The results of the calibration show that the standard error of estimate and bias are lower compared to the traditional sampling methods. In addition, the validation statistics are similar to that of the locally calibrated model, especially for the IRI model, which indicates robustness of the local model coefficients.     

Biosynthesis and characterisation of nano‐silica as potential system for carrying streptomycin at nano‐scale drug delivery

A growing trend within nanomedicine has been the fabrication of self‐delivering supramolecular nanomedicines containing a high and fixed drug content ensuring eco‐friendly conditions. This study reports on green synthesis of silica nanoparticles (Si‐NPs) using Azadirachta indica leaves extract as an effective chelating agent. X‐ray diffraction analysis and Fourier transform‐infra‐red spectroscopic examination were studied. Scanning electron microscopy analysis revealed that the average size of particles formed via plant extract as reducing agent without any surfactant is in the range of 100–170 nm while addition of cetyltrimethyl ammonium bromide were more uniform with 200 nm in size. Streptomycin as model drug was successfully loaded to green synthesised Si‐NPs, sustain release of the drug from this conjugate unit were examined. Prolong release pattern of the adsorbed drug ensure that Si‐NPs have great potential in nano‐drug delivery keeping the environment preferably biocompatible, future cytotoxic studies in this connection is helpful in achieving safe mode for nano‐drug delivery.Inspec keywords: silicon compounds, nanofabrication, nanomedicine, drug delivery systems, nanoparticles, X‐ray diffraction, Fourier transform infrared spectra, scanning electron microscopyOther keywords: nanosilica, streptomycin, nanoscale drug delivery, nanomedicine, silica nanoparticles, Azadirachta indica leaves extract, X‐ray diffraction analysis, Fourier transform‐infrared spectroscopy, scanning electron microscopy, cetyltrimethyl ammonium bromide, SiO₂      

Determining malicious executable distinguishing attributes and low-complexity detection

Detection of rapidly evolving malware requires classification techniques that can effectively and efficiently detect zero-day attacks. Such detection is based on a robust model of benign behavior and deviations from that model are used to detect malicious behavior. In this paper we propose a low-complexity host-based technique that uses deviations in static file attributes to detect malicious executables. We first develop simple statistical models of static file attributes derived from the empirical data of thousands of benign executables. Deviations among the attribute models of benign and malware executables are then quantified using information-theoretic (Kullback-Leibler-based) divergence measures. This quantification reveals distinguishing attributes that are considerably divergent between benign and malware executables and therefore can be used for detection. We use the benign models of divergent attributes in cross-correlation and log-likelihood frameworks to classify malicious executables. Our results, using over 4,000 malicious file samples, indicate that the proposed detector provides reasonably high detection accuracy, while having significantly lower complexity than existing detectors.     

Designing genetic regulatory networks using fuzzy Petri nets approach

In this paper, we have successfully presented a fuzzy Petri net (FPN) model to design the genetic regulatory network. Based on the FPN model, an efficient algorithm is proposed to automatically reason about imprecise and fuzzy information. By using the reasoning algorithm for the FPN, we present an alternative approach that is more promising than the fuzzy logic. The proposed FPN approach offers more flexible reasoning capability because it is able to obtain results with fuzzy intervals rather than point values. In this paper, a novel model with a new concept of hidden fuzzy transition (HFT) to design the genetic regulatory network is developed. We have built the FPN model and classified the input data in terms of time point and obtained the output data, so the system can be viewed as the two-input and one output system. This method eliminates possible false predictions from the classical fuzzy model thereby allowing a wider search space for inferring regulatory relationship. The experimental results show the proposed approach is feasible and acceptable to design the genetic regulatory network and investigate the dynamical behaviors of gene network.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Efficient single-pass frequent pattern mining using a prefix-tree

The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern mining because it can dramatically improve performance compared to the candidate generation-and-test paradigm of Apriori. However, it still requires two database scans, which are not consistent with efficient data stream processing. In this paper, we present a novel tree structure, called CP-tree (compact pattern tree), that captures database information with one scan (insertion phase) and provides the same mining performance as the FP-growth method (restructuring phase). The CP-tree introduces the concept of dynamic tree restructuring to produce a highly compact frequency-descending tree structure at runtime. An efficient tree restructuring method, called the branch sorting method, that restructures a prefix-tree branch-by-branch, is also proposed in this paper. Moreover, the CP-tree provides full functionality for interactive and incremental mining. Extensive experimental results show that the CP-tree is efficient for frequent pattern mining, interactive, and incremental mining with a single database scan.     

On partial-information optimal singular control problem for mean-field stochastic differential equations driven by Teugels martingales measures

This paper is concerned with partial-information mixed optimal stochastic continuous–singular control problem for mean-field stochastic differential equation driven by Teugels martingales and an independent Brownian motion, where the Teugels martingales are a family of pairwise strongly orthonormal martingales associated with Lévy processes. The control variable has two components; the first being absolutely continuous, and the second singular. Partial-information necessary and sufficient conditions of optimal continuous–singular control for these mean-field models are investigated. As an illustration, this paper studies a partial-information linear quadratic control problem of mean-field type involving continuous–singular control.     

H∞ state estimation of generalised neural networks with interval time-varying delays

This paper focuses on studying the H_∞ state estimation of generalised neural networks with interval time-varying delays. The integral terms in the time derivative of the Lyapunov–Krasovskii functional are handled by the Jensen’s inequality, reciprocally convex combination approach and a new Wirtinger-based double integral inequality. A delay-dependent criterion is derived under which the estimation error system is globally asymptotically stable with H_∞ performance. The proposed conditions are represented by linear matrix inequalities. Optimal H_∞ norm bounds are obtained easily by solving convex problems in terms of linear matrix inequalities. The advantage of employing the proposed inequalities is illustrated by numerical examples.     

Fuzzy based multi-criteria vertical handover decision modeling in heterogeneous wireless networks

Vertical handover gain significant importance due to the enhancements in mobility models by the Fourth Generation (4G) technologies. However, these enhancements are limited to specific scenarios and hence do not provide support for generic mobility. Similarly, various schemes are proposed based on these mobility models but most of them are suffered from the high packet loss, frequent handovers, too early and late handovers, inappropriate network selection, etc. To address these challenges, a generic vertical handover management scheme for heterogeneous wireless networks is proposed in this article. The proposed scheme works in three phases. In the first phase, a handover triggering approach is designed to identify the appropriate place for initiating handover based on the estimated coverage area of a WLAN access point or cellular base station. In the second phase, fuzzy rule based system is designed to eliminate the inappropriate networks before deciding an optimal network for handover. In the third phase, a network selection scheme is developed based on the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) decision mechanism. Various parameters such as delay, jitter, Bit Error Rate (BER), packet loss, communication cost, response time, and network load are considered for selecting an optimal network. The proposed scheme is tested in a mobility scenario with different speeds of a mobile node ranging from very low to very high. The simulation results are compared with the existing decision models used for network selection and handover triggering approaches. The proposed scheme outperforms these schemes in terms of energy consumption, handover delay and time, packet loss, good put, etc.