A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing

In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with `estimated optimal solution' for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.

Paraxial-wave optics and relativistic front description .1. The scalar theory

With the extension of the work of the preceding paper, the relativistic front form for Maxwell's equations for electromagnetism is developed and shown to be particularly suited to the description of paraxial waves. The generators of the Poincaré group in a form applicable directly to the electric and magnetic field vectors are derived. It is shown that the effect of a thin lens on a paraxial electromagnetic wave is given by a six-dimensional transformation matrix, constructed out of certain special generators of the Poincaré group. The method of construction guarantees that the free propagation of such waves as well as their transmission through ideal optical systems can be described in terms of the metaplectic group, exactly as found for scalar waves by Bacry and Cadilhac. An alternative formulation in terms of a vector potential is also constructed. It is chosen in a gauge suggested by the front form and by the requirement that the lens transformation matrix act locally in space. Pencils of light with accompanying polarization are defined for statistical states in terms of the two-point correlation function of the vector potential. Their propagation and transmission through lenses are briefly considered in the paraxial limit. This paper extends Fourier optics and completes it by formulating it for the Maxwell field. We stress that the derivations depend explicitly on the "henochromatic" idealization as well as the identification of the ideal lens with a quadratic phase shift and are heuristic to this extent.

Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs

The minimum cost classifier when general cost functionsare associated with the tasks of feature measurement and classification is formulated as a decision graph which does not reject class labels at intermediate stages. Noting its complexities, a heuristic procedure to simplify this scheme to a binary decision tree is presented. The optimizationof the binary tree in this context is carried out using ynamicprogramming. This technique is applied to the voiced-unvoiced-silence classification in speech processing.

A Design for Testability of Undetectable Crosspoint Faults in Programmable Logic Arrays

In this paper, the validity of'single fault assumption in deriving diagnostic test sets is examined with respect to crosspoint faults in programmable logic arrays (PLA's). The control input procedure developed here can be used to convert PLA's having undetectable crosspoint faults to crosspoint-irredundant PLA's for testing purposes. All crosspoints will be testable in crosspoint-irredundant PLA's. The control inputs are used as extra variables during testing. They are maintained at logic I during normal operation. A useful heuristic for obtaining a near-minimal number of control inputs is suggested. Expressions for calculating bounds on the number of control inputs have also been obtained.

Do H-functions always increase during Violent Relaxation

Recent work on the violent relaxation of collisionless stellar systems has been based on the notion of a wide class of entropy functions. A theorem concerning entropy increase has been proved. We draw attention to some underlying assumptions that have been ignored in the applications of this theorem to stellar dynamical problems. Once these are taken into account, the use of this theorem is at best heuristic. We present a simple counter-example.

Styrene Oxidation to Benzaldehyde by Polymer Anchored Wilkinson Complex

Wilkinson complex, insolubilized by anchoring to polymeric Amberlite beads, had been used for the liquid-phase catalytic oxidation of styrene to benzaldehyde and formaldehyde in toluene medium. Styrene conversion was followed by measuring the oxygen volume in contact with the reaction mixture in a specially designed closed batch apparatus. Styrene conversion depended upon catalyst loading and distribution inside the porous beads, while temperature had little effect on it. The internal diffusional effects on the conversion process have been taken into consideration by a mathematical model which allowed calculation of effectiveness factors for various catalyst loadings and corresponding catalyst distributions. The influence of external diffusion was separately determined by plotting initial rate versus catalyst loading. The proposed method can be readily extended to immobilized enzymes in porous matrices.

Styrene Oxidation to Benzaldehyde by Polymer Anchored Wilkinson Complex

Wilkinson complex, insolubilized by anchoring to polymeric Amberlite beads, had been used for the liquid-phase catalytic oxidation of styrene to benzaldehyde and formaldehyde in toluene medium. Styrene conversion was followed by measuring the oxygen volume in contact with the reaction mixture in a specially designed closed batch apparatus. Styrene conversion depended upon catalyst loading and distribution inside the porous beads, while temperature had little effect on it. The internal diffusional effects on the conversion process have been taken into onsideration by a mathematical model which allowed calculation of effectiveness factors for various catalyst loadings and corresponding catalyst distributions. The influence of external diffusion was separately determined by plotting initial rate versus catalyst loading. The proposed method can be readily extended to immobilized enzymes in porous matrices.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Biochemical and structural characterization of residue 96 mutants of Plasmodium falciparum triosephosphate isomerase: active-site loop conformation, hydration and identification of a dimer-interface ligand-binding site

Plasmodium falciparum TIM (PfTIM) is unique in possessing a Phe residue at position 96 in place of the conserved Ser that is found in TIMs from the majority of other organisms. In order to probe the role of residue 96, three PfTIM mutants, F96S, F96H and F96W, have been biochemically and structurally characterized. The three mutants exhibited reduced catalytic efficiency and a decrease in substrate-binding affinity, with the most pronounced effects being observed for F96S and F96H. The k(cat) values and K-m values are (2.54 +/- 0.19) x 10(5) min(-1) and 0.39 +/- 0.049 mM, respectively, for the wild type; (3.72 +/- 0.28) x 10(3) min(-1) and 2.18 +/- 0.028 mM, respectively, for the F96S mutant;(1.11 +/- 0.03) x 10(4) min(-1) and 2.62 +/- 0.042 mM, respectively, for the F96H mutant; and (1.48 +/- 0.05) x 10(5) min(-1) and 1.20 +/- 0.056 mM, respectively, for the F96W mutant. Unliganded and 3-phosphoglycerate (3PG) complexed structures are reported for the wild-type enzyme and the mutants. The ligand binds to the active sites of the wild-type enzyme (wtPfTIM) and the F96W mutant, with a loop-open state in the former and both open and closed states in the latter. In contrast, no density for the ligand could be detected at the active sites of the F96S and F96H mutants under identical conditions. The decrease in ligand affinity could be a consequence of differences in the water network connecting residue 96 to Ser73 in the vicinity of the active site. Soaking of crystals of wtPfTIM and the F96S and F96H mutants resulted in the binding of 3PG at a dimer-interface site. In addition, loop closure at the liganded active site was observed for wtPfTIM. The dimer-interface site in PfTIM shows strong electrostatic anchoring of the phosphate group involving the Arg98 and Lys112 residues of PfTIM.

Anisochrony of O-methylene protons of ethyl ester functions and structural factors in the connected chiral entities

(i) Incistrans pairs of cyclic 1,3-dicarboxylic acid ethyl esters thecis-foms exhibit higher O-methylene proton (HA, HB) anisochrony than thetrans-forms; (ii) anisochrony, easily observed in certain decalin-10-carboxylic ethyl esters, ‘disappears’ on one of the rings attaining the possibility of transforming into a ‘twist’ form; (iii) in certain pairs of chiralsecethyl esters and theirtert-methylated analogues anisochrony is higher in the latter, contrary to expectation, while, in certain others, the reverse is observed. Attempted explanations are based on assessments whether H A and H B are or are not in highly different magnetic environments in confomers regarded as preferred. This subsumes the possibility thatXYZC-CO2H A H B Me chiral ethyl acetates differ fromXYZC-CH A H B Me ethanes because intervention by the carboxyl group insulates the prochiral centre and allows anisotropic effects to gain somewhat in importance among mechanisms that discriminate between H A and H B so long as rotamerpopulation inequalities persist. Background information on why rotamer-population inequalities will always persist and on a heuristic that attempts to generalize the effects ofXYZ inXYZC - CU AUB V is provided. Possible effects when connectivity exists between a pair amongX, Y, Z or when specific interactions occur betweenV andX, Y orZ are considered. An interpretation in terms of ‘increasing conformational mobility’ has been suggested for the observed increase in the rate of temperature-dependence of O-methylene anisochrony down a series of chiral ethyl esters.

A rational approach to the synthesis of one-dimensional acoustic filters

The velocity ratio algorithm developed from a heuristic study of transfer matrix multiplication has been employed to bring out the relative effects of the elements constituting a linear, one-dimensional acoustic filter, the overall dimensions of which are fixed, and synthesize a suitable straight-through configuration for a low-pass, wide-band, non-dissipative acoustic filter. The potential of the foregoing approach in applications to the rational design of practical acoustic filters such as automotive mufflers is indicated.