Towards a super-resolution based approach for improved face recognition in low resolution environment

Multimedia Tools and Applications - The video surveillance activity generates a vast amount of data, which can be processed to detect miscreants. The task of identifying and recognizing an object...     

QoS-Aware Optical Fog-Assisted Cyber-Physical System in the 5G Ready Heterogeneous Network

Wireless Personal Communications - In recent years, the emergence of Internet of things and cyber-physical system provide a proactive and efficacious solution to enable remote monitoring, machine...     

Spray dryer processed graphene oxide/reduced graphene oxide for high-performance supercapacitor

This study deals with the utility of mini spray dryer process to improve the dispersibility, of graphene oxide(GO) and its application for high-performance supercapacitor. Initially, the neutral solution of GO was obtained using the modified Hummer's method. After this, the prepared GO solution was processed by mini spray dryer to obtain a more purified, lighter, and dispersed form of GO which is named as spray dryer processed GO (SPGO). The SPGO thus obtained showed excellent dispersibility behavior with various solvents, which is not found in case of conventional oven drying. Furthermore, utility of SPGO and its reduced form (r-SPGO) for supercapacitor applications have been investigated. Results obtained from the cyclic voltammetry(CV) analysis, impedance, and charge-discharge behavior of supercapacitor fabricated using r-SPGO shows enhanced features. Therefore, the simple spray dried GO and its reduced form, that is, r-SPGO can be utilized as a potential candidate for the supercapacitor application. Herein, as synthesized SPGO exhibited the specific capacitance of 12.07 and 37.6 F/g with PVA-H₃PO₄ and 1 mol/L H₃PO₄, respectively, at a scan rate of 5 mV/s. On the other hand, reduced form of SPGO, that is, r-SPGO showed the specific capacitance of 27.16 and 230 F/g with PVA-H₃PO₄ and 1 mol/L H₃PO₄, respectively.     

Synthesis and characterization of poly(ethylene aspartate)-metal complexes

Poly(ethylene aspartate) [PEA] was synthesized by the melt condensation of D,L-aspartic acid and ethylene glycol. PEA containing pendent amino and carbonyl groups in its repeating chain was used as the polymeric ligand for complexation with transition metal ions, viz. Co(II), Ni(II), Cu(II), Mn(II), Zn(II), Cd(II), Ca(II), Mg(II), Pb(II) and Hg(II). Complexation was found to be most effective in DMSO. The resulting polyester-metal complexes were solid coloured materials which have been characterized by IR spectroscopy, elemental analysis and magnetic susceptibility measurements. The thermal stability of the polyester-metal complexes was investigated by thermogravimetric analysis (TGA). On the basis of the physico-chemical studies, an oxygen and nitrogen coordinated structure for the polyester-metal complexes is proposed.     

Test Generation for Crosstalk-Induced Faults: Framework and Computational Results

Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This paper addresses the problem of efficiently and accurately generating two-vector tests for crosstalk induced effects, such as pulses, signal speedup and slowdown, in digital combinational circuits. These noise effects can propagate through a circuit and create a logic error in a latch or at a primary output. We have developed a mixed-signal test generator, called XGEN, that incorporates classical static values as well as dynamic signals such as transitions and pulses, and timing information such as signal arrival times, rise/fall times, and gate delay. In this paper we first discuss the general framework of the test generation algorithm followed by computational results. Comparison of results with SPICE simulations confirms the accuracy of this approach.     

Glass fiber-reinforced epoxy composites

Glass fiber-reinforced epoxy composites were prepared from the matrix resins tetraglycidyl diaminodiphenylmethane

1 Systematic name: N,N,N′,N′-Tetrakis(2,3-epoxypropyl)-4,4′-diaminodiphenylmethane.

(TGDDM) and tetraglycidyl bis(o-toluidino)-methane

2 Systematic name: N,N,N′,N′-Tetrakis(2,3-epoxypropyl)-4,4′-bis(o-toluidino)methane.

(TGMBT) using various amines like 4,4′-diaminodiphenylmethane (DDM), 4,4′-diaminodiphenylsulfone (DDS) and diethylene triamine (DETA) as curing agents. The fabricated laminates were evaluated for their mechanical and dielectrical properties and chemical resistance. The composites prepared using an epoxy fortifier (20 phr) showed significant improvement in the mechanical properties.     

Structure–property relationships for sulfonated poly(butylene terephthalate)

Structure–property relationships have been developed for sulfonated poly(butylene terephthalate) copolymers. The compositional variables investigated were sulfonate content, molecular weight, and polymer endgroup composition, and the fundamental polymer properties evaluated were melt viscosity, crystallization kinetics, and impact strength. It was found that all compositional variables significantly affect all of the polymer properties of interest. The most interesting effect is the influence of polymer endgroup composition on polymer properties. The trends indicate that the carboxylic acid endgroups form intermolecular interactions with sodium sulfonate groups, resulting in a decrease in the strength of intermolecular ionic interactions between sodium sulfonate groups. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 100: 4662–4771, 2006     

A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems

Given a set of points \(P \subset\mathbb{R}^{d}\) , the k-means clustering problem is to find a set of k centers \(C = \{ c_{1},\ldots,c_{k}\}, c_{i} \in\mathbb{R}^{d}\) , such that the objective function ∑ _x∈P e(x,C)², where e(x,C) denotes the Euclidean distance between x and the closest center in C, is minimized. This is one of the most prominent objective functions that has been studied with respect to clustering. D ²-sampling (Arthur and Vassilvitskii, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) is a simple non-uniform sampling technique for choosing points from a set of points. It works as follows: given a set of points \(P \subset\mathbb{R}^{d}\) , the first point is chosen uniformly at random from P. Subsequently, a point from P is chosen as the next sample with probability proportional to the square of the distance of this point to the nearest previously sampled point. D ²-sampling has been shown to have nice properties with respect to the k-means clustering problem. Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) show that k points chosen as centers from P using D ²-sampling give an O(logk) approximation in expectation. Ailon et al. (NIPS, pp. 10–18, 2009) and Aggarwal et al. (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 15–28, Springer, Berlin, 2009) extended results of Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) to show that O(k) points chosen as centers using D ²-sampling give an O(1) approximation to the k-means objective function with high probability. In this paper, we further demonstrate the power of D ²-sampling by giving a simple randomized (1+?)-approximation algorithm that uses the D ²-sampling in its core.     

The continuity of underperforming ICT projects in the public sector

There is a growing body of research on the successes and failures of information and communications technology (ICT) projects in the public sector. However, this literature has rarely addressed the question of why some projects persist and continue despite functioning poorly in several areas. In this paper, we suggest that the notions of institutional logics and status differences provide useful insights into the structure and trajectory of this type of continuity. We build our arguments through an in-depth qualitative case study of a public information and communications technology (PICT) project in India. From our findings, we develop a process model of PICT project continuity. We explain how the employment of bureaucratic posturing – a manifestation of bureaucratic logic – as a tactic by high status groups could lead to poor performance on several fronts. The paper elaborates on two levels of continuity: policy-level continuity, which in our case was enabled by the logics of decentralization and technocracy, and operational-level continuity, which was achieved when groups with contrasting status-related motivations supported the project.     

A hybrid evolutionary approach to the registration area planning problem

The last two decades have witnessed a phenomenal growth in the number of cellular wireless network users which in turn stressed the need to utilize the limited network bandwidth in an efficient manner. The network bandwidth is consumed not only by user traffic, but also by control traffic needed for ensuring the mobility of users. As we don’t have any control over the volume of user traffic, all attempts to efficiently use bandwidth are based on frequency reuse and minimizing the control traffic. The registration area planning (RAP) problem seeks a partition of the cells of the network into contiguous areas called registration areas so that the bandwidth consumed by control signals is minimized. RAP problem in an \(\mathcal {NP}\) -Hard problem. In this paper, we present a steady-state grouping genetic algorithm with local search to solve this problem. We have compared our approach with the state-of-the-art approaches reported in the literature. Computational results show the effectiveness of our approach.