Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

Mobile service oriented architectures for NN-queries

The ever-increasing number of mobile device users has also raised the users’ expectation of mobile services accordingly. This phenomenon has given pressures to the mobile service providers to improve their services in order to stay competitive in the market. The service oriented approach is seen to be a promising scheme for mobile services. This paper presents mobile service oriented architectures for Nearest-Neighbor (NN) queries that are classified into five categories, namely (i) intermittent query mobile services, (ii) continuous query mobile services, (iii) context-aware mobile services, (iv) continuous moving object query mobile services, and (v) data broadcast mobile services. These services incorporate query, location and context-aware services, ontological context model, and broadcast. The proposed architectures are concerned with mobile services for clients on the move requesting services based on their current location, which is arguably the most important feature in a wireless environment. Furthermore, we also discuss the Quality-of-Service (QoS) requirement for mobile services in which request latency time is one of the most important parameters to consider. Some analytical models for query latency measurement are presented and the results are compared with the simulation experiments.     

Trusted consensus protocol for blockchain networks based on fuzzy inference system

The Journal of Supercomputing - Blockchain technology with its inherent security features revolutionizes the field of distributed networks and has become one of the significant areas of research....     

Antineoplastic and antioxidant potential of phycofabricated silver nanoparticles using microalgae Chlorella minutissima

This study for the first time reports on fresh water microalgae Chlorella minutissima aqueous extract (CmAe) which was utilized for the biogenic synthesis of silver nanoparticles and tested their antineoplastic potential against Liver Hepatocellular Carcinoma (HepG2) cell line. The characteristic colour change of the reaction mixture from greenish yellow to yellowish brown confirmed the synthesis of Chlorella minutissima silver nanoparticles (CmAgNPs). Microscopic analysis revealed CmAgNPs to be spherical‐shaped with particle size ranging from 10 to 30 nm. The carbohydrates and proteins distinctive peaks were observed in Fourier transform infrared spectroscopy (FTIR) spectra which suggested these biomolecules acted as reducing and capping agents. Further, the crystalline nature of CmAgNPs was confirmed by X‐ray diffraction (XRD) analysis. CmAgNPs showed maximum free radical scavenging proving it to be more potent antioxidant agent as compared to CmAe. The mortality rate of HepG2 cells treated with CmAgNPs was found to be 91.8 % at 120 μg/ml with IC₅₀ value 12.42 ± 1.096 μg/ml after 48 h whereas no effect was observed on normal Human Embryonic Kidney (HEK 293) cells. Fluorescent images of the treated HepG2 cells revealed the formation of apoptotic bodies, condensed nuclei and cell shrinkage indicating their effectiveness against the cancer cells.Inspec keywords: silver, nanoparticles, nanomedicine, microorganisms, cellular biophysics, nanofabrication, scanning electron microscopy, transmission electron microscopy, atomic force microscopy, proteins, Fourier transform infrared spectra, molecular biophysics, X‐ray chemical analysis, X‐ray diffraction, kidney, cancer, biomedical materialsOther keywords: antineoplastic potential, antioxidant potential, phycofabricated silver nanoparticle, Chlorella minutissima, freshwater microalgae, aqueous extract, liver hepatocellular carcinoma cell line, CmAgNP synthesis, field emission scanning electron microscopy, high‐resolution transmission electron microscopy, atomic force microscopy, dynamic light scattering, carbohydrate, protein, Fourier transform infrared spectroscopy, biomolecule, energy‐dispersive X‐ray spectroscopy, elemental silver signal, CmAgNP crystalline, X‐ray diffraction analysis, antioxidant agent, HepG2 cell mortality rate, human embryonic kidney, HEK 293 cell, fluorescent image, apoptotic body formation, condensed nuclei, cell shrinkage, cancer cell, antineoplastic agent, Ag     

A mathematical model for wave propagation in a composite solid matrix containing two immiscible fluids

Constitutive relations and field equations have been extended for a porous medium composed of two solids and containing two chemically non-reactive immiscible fluids. By generalizing the closure relation of porosity change and employing this into the mass balance equations, the stress–strain relations have been developed. The idea of generalized compressibility tests is invoked to find the value of dimensionless parameters appearing in the closure relation of porosity change. By generalizing momentum balance equations of Lo et al. (Water Resour Res 41:1–20, 2005), the propagation of dilatational and rotational waves is explored. It is found that four dilatational and two rotational waves exist in the porous medium. In contrast to Biot’s theory, the presence of the second fluid and second solid in the porous medium gives rise to additional P- and S-waves. Variation of phase speeds and corresponding attenuation coefficients of existing waves versus frequency, saturation of the fluid phases and solid fraction are computed numerically and depicted graphically.     

Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning

Robotic Path planning is one of the most studied problems in the field of robotics. The problem has been solved using numerous statistical, soft computing and other approaches. In this paper we solve the problem of robotic path planning using a combination of A* algorithm and Fuzzy Inference. The A* algorithm does the higher level planning by working on a lower detail map. The algorithm finds the shortest path at the same time generating the result in a finite time. The A* algorithm is used on a probability based map. The lower level planning is done by the Fuzzy Inference System (FIS). The FIS works on the detailed graph where the occurrence of obstacles is precisely known. The FIS generates smoother paths catering to the non-holonomic constraints. The results of A* algorithm serve as a guide for FIS planner. The FIS system was initially generated using heuristic rules. Once this model was ready, the fuzzy parameters were optimized using a Genetic Algorithm. Three sample problems were created and the quality of solutions generated by FIS was used as the fitness function of the GA. The GA tried to optimize the distance from the closest obstacle, total path length and the sharpest turn at any time in the journey of the robot. The resulting FIS was easily able to plan the path of the robot. We tested the algorithm on various complex and simple paths. All paths generated were optimal in terms of path length and smoothness. The robot was easily able to escape a variety of obstacles and reach the goal in an optimal manner.