188,180 research outputs found
ATTRITION OF SPHERICAL ELECTRODE CARBON PARTICLES DURING BATCH FLUIDIZED COMBUSTION.
No full textSpherical electrode carbon particles prepared from carbon rods of dry cell batteries have been used to study the attrition behaviour in a bubbling fluidized bed combustor. Experiments have been conducted in a 40 mm I. D. and 1 m high fluidized bed combustor operated at 1 m/s superficial velocity. The bed was operated with nitrogen and with two different oxygen concentrations at 850 degree C to study the effect of combustion on attrition of these particles. The experimental technique used allowed the time resolution of attrited fines generation, providing detailed curves of attrition rates as a function of time. Attrition rate constants have been evaluated. Results show an enhancement of attrition due to combustion even for spherical, homogeneous and smooth particles
JaSTA-3: Light scattering simulations for heterogeneous aggregate
No full textThis article announces the development of the third version of the Java Superposition T-matrix App (JaSTA-3), to study the light scattering properties of heterogeneous aggregate particles. It has been developed using Netbeans 7.1.2, which is a Java integrated development environment (IDE). The JaSTA uses double precision superposition codes for multi-sphere clusters in random orientation, developed by Mackowski and Mischenko (1996). The new version consists of three options as part of the input parameters: (i) single wavelength, (ii) multiple wavelengths and (iii) Heterogeneous geometry. The first and second options (which retain the applicability of older versions of JaSTA) calculate the light scattering properties of aggregates of spheres for single and multiple wavelengths for randomly oriented particles, whereas the third option can execute light scattering simulations for heterogeneous aggregates (polydisperse and inhomogeneous) for multiple number of wavelengths in a single run over both random orientation and fixed orientation. JaSTA-3 is a major update of the application that aims to provide light scattering feed for more complex aggregates that can be used in diverse fields like Astrophysics, Planetary Science, Atmospheric Science, Nanoscience, etc. This version of the software is developed for Linux platform only, and it can take advantage of all the cores of a processor using the multi-threading option
Extending abstract interpretation to new applicative scenarios
No full textThe aim of this thesis is to extend the Abstract Interpretation framework to the broader context of Information Systems. In particular, we address issues related to security properties. We formalize a complete denotational semantics, both at concrete and abstract level, of data-intensive applications embedding data manipulation language operations such as SELECT, UPDATE, INSERT and DELETE. This theoretical work serves as a formal foundation of several interesting practical applications, including persistent watermarking, fine grained access control, SQL injection prevention, and cooperative query answering. We also address the issue of program slicing refinement, leading to an abstract program slicing algorithm that covers SQL data manipulation languages as well. A prototype of a tool implementing our abstract program slicing is also presented
Copper(II) α-hydroxycarboxylate complexes of bis(2-pyridylcarbonyl)amine ligand: From mononuclear complex to one-dimensional coordination polymer
No full textSelf-assembly of silver(I) and bis-bidentate N,N-donor ligands: from a tetranuclear complex to coordination polymers
No full textDynamic Super Round Based Distributed Task Scheduling for UAV Networks
Get PDFNetworks of Unmanned Aerial Vehicles (UAVs) are emerging in many application domains, e.g., military surveillance. To perform collaborative tasks, the involved UAVs exchange several types of information, e.g., sensor data and commands. The major question here is how to schedule the tasks under dynamic traffic flows to provide network services. Existing solutions use the Round-Robin Strategy (RRS), where the tasks are scheduled statistically by dividing the time into fixed-length rounds. However, the RRS wastes significant network and device resources due to task scheduling in each round. This paper proposes DROVE – a novel clustering approach that allows the UAVs for dynamic task scheduling. However, determining the task scheduling is crucial, as it significantly affects several network parameters, e.g., throughput. Therefore, we devise the problem of distributed task scheduling under dynamic traffic flow scenarios to optimize the throughput. We propose a clustering task scheduling algorithm to serve dynamic traffic flows. Particularly, we integrate the dynamic traffic flows into the Lyapunov drift analysis framework, and determine the throughput optimality of our proposed scheduling algorithm. We perform extensive simulations to validate the effectiveness of DROVE. The results show that DROVE outperforms the state-of-the-art solutions in terms of energy consumption, clustering overhead, throughput, end-to-end delay, flow success rate and packet drop rate. </p
Supplemental material for LC-MS/MS determination of 4-hydroxynimesulide, an active metabolite of nimesulide and application to bioequivalence study in Indian subjects
No full textSupplemental Material for LC-MS/MS determination of 4-hydroxynimesulide, an active metabolite of nimesulide and application to bioequivalence study in Indian subjects by Dhiman Halder, Shubhasis Dan, Pradipta Sarkar, Dibya Das, Umesh Chandra Halder and Tapan Kumar Pal in European Journal of Mass Spectrometry</p
Effect of ligand spacer on metallosupramolecular architectures: from a dinuclear copper(II) double helicate to a tetranuclear copper(II) complex
No full textAlois Halder, Kunst und Kult. Zur Aesthetik und Philosophie der Kunst in der Wende vom 19. zum 20. Jahrhundert
No full textDecloux Simon. Alois Halder, Kunst und Kult. Zur Aesthetik und Philosophie der Kunst in der Wende vom 19. zum 20. Jahrhundert. In: Revue Philosophique de Louvain. Troisième série, tome 65, n°88, 1967. p. 584
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
- …
