Duration of a lightning flash

The mean duration of a lightning flash is observed to exhibit systematic variation with the growth and decay of the activity of a thundercloud and reaches a minimum value when the radio noise level and rate of flashing are at their maximum values.

Major Events and the European Code of Police Ethics

Examines the symbolic significance of major events and their security provision in the historical and contemporary context of the European Code of Police Ethics. Stresses the potential of major events to set new practical policing and security standards of technology and in doing so necessitiate the maintenance of professional ethical standards for policing in Europe.

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

Ideal Structure of the Silver Code

The Silver code has captured a lot of attention in the recent past,because of its nice structure and fast decodability. In their recent paper, Hollanti et al. show that the Silver code forms a subset of the natural order of a particular cyclic division algebra (CDA). In this paper, the algebraic structure of this subset is characterized. It is shown that the Silver code is not an ideal in the natural order but a right ideal generated by two elements in a particular order of this CDA. The exact minimum determinant of the normalized Silver code is computed using the ideal structure of the code. The construction of Silver code is then extended to CDAs over other number fields.

Dynamics of charge transfer in the excited amine complexes of the fullerenes C60 and C70.: A picosecond laser flash photolysis study

In benzene solution, C60 and C70 interact weakly in the ground state with amines having favourable oxidation potentials. Picosecond time-resolved absorption measurements show that on photoexcilation, the weak complexes undergo charge separation to produce ion pairs which in turn undergo fast geminate recombination either to produce the triplet state of the fullerenes or give back the ground slate of the complex, depending on the oxidation potential of the amine. Free-ion yield is generally negligible.

Synthesis of A1PO4, LaPO4 and KTiOPO4 by flash combustion

Fine particle AlPO4, LaPO4 and KTiOPO4 have been prepared by the flash combustion of aqueous solutions containing metal nitrate, ammonium hydrogen phosphate, ammonium nitrate or ammonium perchlorate and carbohydrazide or tetraformal trisazine. When rapidly heated at 400 °C, the solution containing the redox mixtures ignites to undergo self-propagating, gas-producing, exothermic reactions. Formation of crystalline phosphates was confirmed by powder X-ray diffraction patterns and IR spectra. The metal phosphates formed are fine and have 20�78 m2 g?1 surface area.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

Thermal degradation products of poly(styrenesulfides) investigated by direct pyrolysis�mass spectrometry and flash pyrolysis�gas chromatography/mass spectrometry

The thermal degradation products of two sulfur polymers, poly(styrenedisulfide) (PSD) and poly(styrenetetrasulfide) (PST), were investigated in parallel by direct pyrolysis-mass spectrometry (DPMS) and by flash pyrolysis-GC/MS (Py-GC/MS). The time-scale of the two pyrolysis techniques is quite different, and therefore they were able to detect significantly different products in the pyrolysis of PSD and PST because of the thermal lability of sulfur-containing compounds. However, the results obtained are not contradictory, and satisfactory mechanisms for the thermal degradation of PSD and PST have been derived from the overall evidence available. Pyrolysis compounds containing sulfur, styrene, and a number of cyclic styrene sulfides and diphenyldithianes have been observed by DPMS. However, in flash pyrolysis-GC/MS, styrene, sulfur, only one cyclic styrene sulfide, and two isomers of diphenylthiophene have been detected. These thiophene derivatives were indeed absent among the compounds obtained by DPMS because they were the terminal (most thermally stable) species arising from further decomposition of the cyclic styrene sulfides formed in the primary thermal degradation processes of PSD and PST.

Code design casing deterministic annealing

We address the problem of designing codes for specific applications using deterministic annealing. Designing a block code over any finite dimensional space may be thought of as forming the corresponding number of clusters over the particular dimensional space. We have shown that the total distortion incurred in encoding a training set is related to the probability of correct reception over a symmetric channel. While conventional deterministic annealing make use of the Euclidean squared error distance measure, we have developed an algorithm that can be used for clustering with Hamming distance as the distance measure, which is required in the error correcting, scenario.

Code Generation Paradigms On Optical Orthogonal And Other Codes In a Fiber Optic CDMA Lan

Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Thermal degradation processes in polysulfide copolymers investigated by direct pyrolysis mass spectrometry and flash pyrolysis-gas chromatography/mass spectrometry

This is the first report on the analysis of random block polysulfide copolymers containing different amounts of repeating units in the copolymer backbone, which has been studied by direct pyrolysis mass spectrometry (DPMS) and by pyrolysis-gas chromatography/mass spectrometry (Py-GC/MS). The homopolymers such as poly(ethylene sulfide) (PES), poly(styrene sulfide) (PSS), and two random copolymers, viz., poly(ethylene sulfide(x)-co-styrene sulfide(y)) [copolymer I (x = y = 0.5) and copolymer II (x = 0.74, y = 0.26)] were investigated by both DPMS and Py-GC/MS (except copolymer II) techniques. In the case of copolymer I, the thermal degradation products of SE1, SE2, S-2, and S2E (S = styrene sulfide, E = ethylene sulfide) were detected in DPMS, whereas the formation of SE1 and SE2 were observed by Py-GC/MS technique. However, for copolymer II, SE3 was also found along with SE1, SE2, S-2, and S2E in DPMS. The formation of additional product (SE3) observed in copolymer II could be due to an increase in the block length formed during copolymerization. Further, a comparative study on thermal degradation of PES, poly(ethylene disulfide) (PEDS), and poly(ethylene tetrasulfide) (PETS) were investigated by Py-GC/MS. The pyrolysis products detected by both DPMS and Py-GC/MS indicates that the thermal decomposition of these polymers yield cyclic sulfides through an intramolecular exchange or by backbiting processes. The linear products with thiol and vinyl groups were also observed by Py-GC/MS along with the cyclic products via carbon hydrogen transfer reaction.