Dislocation characterization in crystals of potash alum grown by seeded solution growth under conditions of low supersaturation

An analysis has been carried out of the genesis and character of growth dislocations present in all growth sectors of single crystals of potash alum. The crystals, grown from seeded solutions by the temperature lowering method under conditions of low supersaturation, presented the well-developed forms: {111} dominant, {100} and {110}. Growth dislocations formed predominately during refacetting of the edges and corners of the seed, rounded during preparation and insertion into the supersaturated solution. From here they become refracted into the {111} sectors which proved to be the most defective. Smaller numbers of dislocations form at the {111}, {100} and {110} seed interfaces and propagate in these sectors. In crystals of inferior quality, a number of inclusions were found predominantly in the fast growing {100} sectors which become the source of additional dislocations. Dislocations present in the original seed did not propagate across the interface into the developing crystal. Dislocations of all characters were observed. The principal Burgers vectors were found to be left angle bracket100right-pointing angle bracket, left angle bracket110right-pointing angle bracket and left angle bracket111right-pointing angle bracket.

Genetic transformation of Brassica nigra by agrobacterium based vector and direct plasmid uptake

Genetic transformation systems have been established for Brassica nigra (cv. IC 257) by using an Agrobacterium binary vector as well as by direct DNA uptake of a plasmid vector. Both the type of vectors carried nptII gene and gus gene. For Agrobacterium mediated transformation, hypocotyl tissue explants were used, and up to 33% of the explants produced calli on selection medium. All of these expressed B-glucuronidase gene on histochemical staining. Protoplasts isolated from hypocotyl tissues of seedlings could be transformed with a plasmid vector by FEG mediated uptake of vector DNA. A number of fertile kanamycin resistant plants were obtained using both the methods, and their transformed nature was confirmed by Southern blot analysis and histochemical staining for GUS. Backcrossed and selfed progenies of these transformed plants showed the presence of npt and gus genes.

Some experiments on human memory and a new neural model

An associative memory with parallel architecture is presented. The neurons are modelled by perceptrons having only binary, rather than continuous valued input. To store m elements each having n features, m neurons each with n connections are needed. The n features are coded as an n-bit binary vector. The weights of the n connections that store the n features of an element has only two values -1 and 1 corresponding to the absence or presence of a feature. This makes the learning very simple and straightforward. For an input corrupted by binary noise, the associative memory indicates the element that is closest (in terms of Hamming distance) to the noisy input. In the case where the noisy input is equidistant from two or more stored vectors, the associative memory indicates two or more elements simultaneously. From some simple experiments performed on the human memory and also on the associative memory, it can be concluded that the associative memory presented in this paper is in some respect more akin to a human memory than a Hopfield model.

The decline of malaria in Finland – the impact of the vector and social variables

Background: Malaria was prevalent in Finland in the 18th century. It declined slowly without deliberate counter-measures and the last indigenous case was reported in 1954. In the present analysis of indigenous malaria in Finland, an effort was made to construct a data set on annual malaria cases of maximum temporal length to be able to evaluate the significance of different factors assumed to affect malaria trends. Methods: To analyse the long-term trend malaria statistics were collected from 1750–2008. During that time, malaria frequency decreased from about 20,000 – 50,000 per 1,000,000 people to less than 1 per 1,000,000 people. To assess the cause of the decline, a correlation analysis was performed between malaria frequency per million people and temperature data, animal husbandry, consolidation of land by redistribution and household size. Results: Anopheles messeae and Anopheles beklemishevi exist only as larvae in June and most of July. The females seek an overwintering place in August. Those that overwinter together with humans may act as vectors. They have to stay in their overwintering place from September to May because of the cold climate. The temperatures between June and July determine the number of malaria cases during the following transmission season. This did not, however, have an impact on the longterm trend of malaria. The change in animal husbandry and reclamation of wetlands may also be excluded as a possible cause for the decline of malaria. The long-term social changes, such as land consolidation and decreasing household size, showed a strong correlation with the decline of Plasmodium. Conclusion: The indigenous malaria in Finland faded out evenly in the whole country during 200 years with limited or no counter-measures or medication. It appears that malaria in Finland was basically a social disease and that malaria trends were strongly linked to changes in human behaviour. Decreasing household size caused fewer interactions between families and accordingly decreasing recolonization possibilities for Plasmodium. The permanent drop of the household size was the precondition for a permanent eradication of malaria.

Non-linearity in piezo-fiber reinforced composites: an asymptotic approach

An asymptotically correct analysis is developed for Macro Fiber Composite unit cell using Variational Asymptotic Method (VAM). VAM splits the 3D nonlinear problem into two parts: A 1D nonlinear problem along the length of the fiber and a linear 2D cross-sectional problem. Closed form solutions are obtained for the 2D problem which are in terms of 1D parameters.

Highly dispersed ultrafine Pt and PtRu nanoparticles on graphene: formation mechanism and electrocatalytic activity

We demonstrate a robust strategy for obtaining a high dispersion of ultrafine Pt and PtRu nanoparticles on graphene by exploiting the nucleation of a metal precursor phase on graphite oxide surfaces. Our method opens up new possibilities to engineer graphene-based hybrids for applications in multifunctional nanoscale devices.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Dendritic Poly(ether imine) Based Gene Delivery Vector

The nonviral vector based gene delivery approach is attractive due to advantages associated with molecular-level modifications suitable for optimization of vector properties. In a new class of nonviral gene delivery systems, we herein report the potential of poly(ether Mine) (PETIM) dendrimers to mediate an effective gene delivery function. PETIM dendrimer, constituted with tertiary amine branch points, n-propyl ether linkers and primary amines at their peripheries, exhibits significantly reduced toxicities, over a broad concentration range. The dendrimer complexes pDNA effectively, protects DNA from endosomal damages, and delivers to the cell nucleus. Gene transfection studies, utilizing a reporter plasmid pEGFP-C1 and upon complexation with dendrimer, showed a robust expression of the encoded protein. The study shows that PETIM dendrimers are hitherto unknown novel gene delivery vectors, combining features of poly(ethylene imine)-based polymers and dendrimers, yet are relatively nontoxic and structurally precise.

Parts based representation for pedestrian using NMF with robustness to partial occlusion

Computer Vision has seen a resurgence in the parts-based representation for objects over the past few years. The parts are usually annotated beforehand for training. We present an annotation free parts-based representation for the pedestrian using Non-Negative Matrix Factorization (NMF). We show that NMF is able to capture the wide range of pose and clothing of the pedestrians. We use a modified form of NMF i.e. NMF with sparsity constraints on the factored matrices. We also make use of Riemannian distance metric for similarity measurements in NMF space as the basis vectors generated by NMF aren't orthogonal. We show that for 1% drop in accuracy as compared to the Histogram of Oriented Gradients (HOG) representation we can achieve robustness to partial occlusion.

Test Application Time Minimization for RAS using Basis Optimization of Column Decoder

Random Access Scan, which addresses individual flip-flops in a design using a memory array like row and column decoder architecture, has recently attracted widespread attention, due to its potential for lower test application time, test data volume and test power dissipation when compared to traditional Serial Scan. This is because typically only a very limited number of random ``care'' bits in a test response need be modified to create the next test vector. Unlike traditional scan, most flip-flops need not be updated. Test application efficiency can be further improved by organizing the access by word instead of by bit. In this paper we present a new decoder structure that takes advantage of basis vectors and linear algebra to further significantly optimize test application in RAS by performing the write operations on multiple bits consecutively. Simulations performed on benchmark circuits show an average of 2-3 times speed up in test write time compared to conventional RAS.

Robust Semi-Blind Estimation for Beamforming Based MIMO Wireless Communication

In this paper, we present robust semi-blind (SB) algorithms for the estimation of beamforming vectors for multiple-input multiple-output wireless communication. The transmitted symbol block is assumed to comprise of a known sequence of training (pilot) symbols followed by information bearing blind (unknown) data symbols. Analytical expressions are derived for the robust SB estimators of the MIMO receive and transmit beamforming vectors. These robust SB estimators employ a preliminary estimate obtained from the pilot symbol sequence and leverage the second-order statistical information from the blind data symbols. We employ the theory of Lagrangian duality to derive the robust estimate of the receive beamforming vector by maximizing an inner product, while constraining the channel estimate to lie in a confidence sphere centered at the initial pilot estimate. Two different schemes are then proposed for computing the robust estimate of the MIMO transmit beamforming vector. Simulation results presented in the end illustrate the superior performance of the robust SB estimators.

An aqueous-solution based low-temperature pathway to synthesize giant dielectric CaCu3Ti4O12-Highly porous ceramic matrix and submicron sized powder

A simple, cost-effective and environment-friendly pathway for preparing highly porous matrix of giant dielectric material CaCu3Ti4O12 (CCTO) through combustion of a completely aqueous precursor solution is presented. The pathway yields phase-pure and impurity-less CCTO ceramic at an ultra-low temperature (700 degrees C) and is better than traditional solid-state reaction schemes which fail to produce pure phase at as high temperature as 1000 degrees C (Li, Schwartz, Phys. Rev. B 75, 012104). The porous ceramic matrix on grinding produced CCTO powder having particle size in submicron order with an average size 300 nm. On sintering at 1050 degrees C for 5 h the powder shows high dielectric constants (>10(4) at all frequencies from 100 Hz to 100 kHz) and low loss (with 0.05 as the lowest value) which is suitable for device applications. The reaction pathway is expected to be extended to prepare other multifunctional complex perovskite materials. (C) 2010 Elsevier B.V. All rights reserved.

Blind separation of multiple co-channel BPSK signals arriving at an antenna array

In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method

Indexing of decagonal quasicrystals .1. The T-8-phase

Indexing of a decagonal quasicrystal using the scheme utilizing five planar vectors and one perpendicular to them is examined in detail. A method for determining the indices of zone axes that a reciprocal vector would make in a decagonal phase of any periodicity has been proposed. By this method, the location of the zone axes made by any reciprocal vector can be predicted. The orthogonality condition has been simplified for the zone axes containing twofold vectors. The locations of zone axes have also been determined by an alternative method, utilizing spherical trigonometric calculations, which confirm the zone-axis locations given by the indices. The effect of one-dimensional periodicity on the indices and the accuracy of the zone-axis determination is discussed. Rules for the formation of zone axes between several reciprocal vectors and the prediction of all the reciprocal vectors in a zone are evolved.

On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.