Dielectric and thermal characteristics of gel grown single crystals of ytterbium tartrate trihydrate

Dielectric and thermal characteristics of gel grown single crystals of ytterbium tartrate trihydrate have been carried out. The dielectric constant has been measured as a function of frequency in the range 2 kHz–1 MHz and temperature range 30–300 °C. The dielectric constant increases with temperature, attains a peak near 215 °C, and then decreases as the temperature exceeds 215 °C. The dielectric anomaly at 215 °C is suggested to be due to phase transition brought about in the material. The dielectric behaviour of the material is correlated with the results on thermal analysis. Thermogravimetric and differential thermal analysis have been used to study the thermal characteristics of the material. The experimental results show that the material is thermally stable up to 200 °C. The decomposition process occurs in two stages until ytterbium oxide is formed at 700 °C. The non-isothermal kinetic parameters e.g., activation energy and the frequency factor have been evaluated for each stage of thermal decomposition by using the integral method, applying the Coats–Redfern approximation.     

Disinfection of wastewaters: high-energy electron vs gamma irradiation

A study was undertaken to examine the sensitivity of a wastewater population of coliphage, total coliforms and total flora present in raw sewage and secondary effluent after irradiating with similar doses delivered by a high-energy electron beam and y -radiation. The electron beam study was conducted on a large scale at the Virginia Key Wastewater Treatment Plant, Miami, Fla. The facility is equipped with a 1.5 MeV, 50 mA electron accelerator, with a wastewater flow rate of 8 ls⁻¹. Concurrent y-radiation studies were conducted at laboratory scale using a 5000 Ci, ⁶⁰Co y -source. Three logs reduction of all three test organisms were observed at an electron beam dose of 500 krads, while at least four logs reduction were observed at the same dose utilizing the y-source.     

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...     

Autonomous mapping of HL7 RIM and relational database schema

Healthcare systems need to share information within and across the boundaries in order to provide better care to the patients. For this purpose, they take advantage of the full potential of current state of the art in healthcare standards providing interoperable solutions. HL7 V3 specification is an international message exchange and interoperability standard. HL7 V3 messages exchanged between healthcare applications are ultimately recorded into local healthcare databases, mostly in relational databases. In order to bring these relational databases in compliance with HL7, mappings between HL7 RIM (Reference Information Model) and relational database schema are required. Currently, RIM and database mapping is largely performed manually, therefore it is tedious, time consuming, error prone and expensive process. It is a challenging task to determine all correspondences between RIM and schema automatically because of extreme heterogeneity issues in healthcare databases. To reduce the amount of manual efforts as much as possible, autonomous mapping approaches are required. This paper proposes a technique that addresses the aforementioned mapping issue and aligns healthcare databases to HL7 V3 RIM specifications. Furthermore, the proposed technique has been implemented as a working application and tested on real world healthcare systems. The application loads the target healthcare schema and then identifies the most appropriate match for tables and the associated fields in the schema by using domain knowledge and the matching rules defined in the Mapping Knowledge Repository. These rules are designed to handle the complexity of semantics found in healthcare databases. The GUI allows users to view and edit/re-map the correspondences. Once all the mappings are defined, the application generates Mapping Specification, which contains all the mapping information i.e. database tables and fields with associated RIM classes and attributes. In order to enable the transactions, the application is facilitated with the autonomous code generation from the Mapping Specification. The Code Generator component focuses primarily on generating custom classes and hibernate mapping files against the runtime system to retrieve and parse the data from the data source—thus allows bi-directional HL7 to database communication, with minimum programming required. Our experimental results show 35–65% accuracy on real laboratory systems, thus demonstrating the promise of the approach. The proposed scheme is an effective step in bringing the clinical databases in compliance with RIM, providing ease and flexibility.     

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.     

Wavelet based sub-band parameters for classification of unaspirated Hindi stop consonants in initial position of CV syllables

This paper proposes a new feature extraction technique using wavelet based sub-band parameters (WBSP) for classification of unaspirated Hindi stop consonants. The extracted acoustic parameters show marked deviation from the values reported for English and other languages, Hindi having distinguishing manner based features. Since acoustic parameters are difficult to be extracted automatically for speech recognition. Mel Frequency Cepstral Coefficient (MFCC) based features are usually used. MFCC are based on short time Fourier transform (STFT) which assumes the speech signal to be stationary over a short period. This assumption is specifically violated in case of stop consonants. In WBSP, from acoustic study, the features derived from CV syllables have different weighting factors with the middle segment having the maximum. The wavelet transform has been applied to splitting of signal into 8 sub-bands of different bandwidths and the variation of energy in different sub-bands is also taken into account. WBSP gives improved classification scores. The number of filters used (8) for feature extraction in WBSP is less compared to the number (24) used for MFCC. Its classification performance has been compared with four other techniques using linear classifier. Further, Principal components analysis (PCA) has also been applied to reduce dimensionality.     

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...     

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.