128 resultados para bounded gaps
Resumo:
There has been a lot of effort to make Silicon optically active. In this work we examine two methods of generating nanocrystals of Silicon from bulk fragments. This approach of ours allows us to play with the shape of the nanocrystals and therefore the degeneracy of the conduction band minimum. We go on to examine whether similar sized particles with different shapes have the same physical properties, and finally whether Silicon may be rendered optically active by this route. While we do find that similar sized particles with different shapes may have different band gaps, this route of modifying the degeneracy of the conduction band minimum makes nano Si slightly optically active.
Resumo:
We have used the density matrix renormalization group (DMRG) method to study the linear and nonlinear optical responses of first generation nitrogen based dendrimers with donor acceptor groups. We have employed Pariser–Parr–Pople Hamiltonian to model the interacting pi electrons in these systems. Within the DMRG method we have used an innovative scheme to target excited states with large transition dipole to the ground state. This method reproduces exact optical gaps and polarization in systems where exact diagonalization of the Hamiltonian is possible. We have used a correction vector method which tacitly takes into account the contribution of all excited states, to obtain the ground state polarizibility, first hyperpolarizibility, and two photon absorption cross sections. We find that the lowest optical excitations as well as the lowest excited triplet states are localized. It is interesting to note that the first hyperpolarizibility saturates more rapidly with system size compared to linear polarizibility unlike that of linear polyenes.
Resumo:
Let Wm,p denote the Sobolev space of functions on Image n whose distributional derivatives of order up to m lie in Lp(Image n) for 1 less-than-or-equals, slant p less-than-or-equals, slant ∞. When 1 < p < ∞, it is known that the multipliers on Wm,p are the same as those on Lp. This result is true for p = 1 only if n = 1. For, we prove that the integrable distributions of order less-than-or-equals, slant1 whose first order derivatives are also integrable of order less-than-or-equals, slant1, belong to the class of multipliers on Wm,1 and there are such distributions which are not bounded measures. These distributions are also multipliers on Lp, for 1 < p < ∞. Moreover, they form exactly the multiplier space of a certain Segal algebra. We have also proved that the multipliers on Wm,l are necessarily integrable distributions of order less-than-or-equals, slant1 or less-than-or-equals, slant2 accordingly as m is odd or even. We have obtained the multipliers from L1(Image n) into Wm,p, 1 less-than-or-equals, slant p less-than-or-equals, slant ∞, and the multiplier space of Wm,1 is realised as a dual space of certain continuous functions on Image n which vanish at infinity.
Resumo:
The electrical activation energy and optical band-gap of GeSe and GeSbSe thin films prepared by flash evaporation on to glass substrates have been determined. The conductivities of the films were found to be given by Image , the activation energy Ea being 0.53 eV and 0.40 eV for GeSe and GeSbSe respectively. The optical absorption constant α near the absorption edge could be described by Image from which the optical band-gaps E0 were found to be 1.01 eV for GeSe and 0.67 eV for GeSbSe at 300°K. At 110°K the corresponding values of E0 were 1.07 eV and 0.735 eV respectively. The significance of these values is discussed in relation to those of other amorphous semiconductors.
Resumo:
Using Hilbert theory and Mindlin's couple stress theory, the problem of two-dimensional circular inhomogeneity (when the inserted material is of different size than the size of the cavity and having different elastic constants) is studiedin this paper. Stress could be bounded at infinity. The formulation is valid also for regions other then the circular ones when the matrix is finite has also been tackled. Numerical results are in conformity with the fact that the effect of couple stresses is negligible when the ratio of the smallest dimension of the body to the cahracteristic length is large.
Resumo:
A systematic derivation of the approximate coupled amplitude equations governing the propagation of a quasi-monochromatic Rayleigh surface wave on an isotropic solid is presented, starting from the non-linear governing differential equations and the non-linear free-surface boundary conditions, using the method of mulitple scales. An explicit solution of these equations for a signalling problem is obtained in terms of hyperbolic functions. In the case of monochromatic excitation, it is shown that the second harmonic amplitude grows initially at the expense of the fundamental and that the amplitudes of the fundamental and second harmonic remain bounded for all time.
Resumo:
Firing delays of a simple triggered vacuum gap are reported in this paper. The effects of insulating materials in the auxiliary gap, auxiliary gap current, main gap current and electrode separation on the delay have been investigated. The presence of insulating material in the auxiliary gap having low auxiliary gap resistance appears to exhibit large delay. Delay decreases considerably with increase of current in the auxiliary and the main gaps, but it increases with increase of electrode separation. The scatter in the delay is less than 25 ps and 500 ps with supramica (Mycalex Corporation of America) and silicon carbide respectively at lower values of auxiliary gap current and it becomes negligible for supramica at auxiliary gap currents greater than 6A. This investigation appears to indicate that the simple device can be used as a fast switch.
Resumo:
This paper presents a Dubins model based strategy to determine the optimal path of a Miniature Air Vehicle (MAV), constrained by a bounded turning rate, that would enable it to fly along a given straight line, starting from an arbitrary initial position and orientation. The method is then extended to meet the same objective in the presence of wind which has a magnitude comparable to the speed of the MAV. We use a modification of the Dubins' path method to obtain the complete optimal solution to this problem in all its generality.
Resumo:
Magnetoplasmon-type surface polaritons are studied at the interfaces of sandwich structures in the configuration with a magnetic field oriented parallel to the interface but perpendicular to the direction of wave propagation. It is shown that the propagation window for the surface polaritons is shifted to higher frequencies in the presence of the magnetic field directed positively. On reversal of the magnetic field an additional low frequency propagation band appears. Irrespective of the direction and strength of the magnetic field there exists a certain frequency range in which interface polaritons cannot propagate. For sandwich structures for which the dielectric constant and the plasma frequency of one medium are simultaneously greater or less than those of the second medium gaps and multiple branches can appear in the propagation window either for n > 0 or n <; 0 waves. A graphical method for the estimation of critical ranges of B0 and dielectric constant ratios for different sandwich structures, within which gaps and multiple branches appear, is given
Resumo:
We study the properties of walls of marginal stability for BPS decays in a class of N = 2 theories. These theories arise in N = 2 string compactifications obtained as freely acting orbifolds of N = 4 theories, such theories include the STU model and the FHSV model. The cross sections of these walls for a generic decay in the axion-dilaton plane reduce to lines or circles. From the continuity properties of walls of marginal stability we show that central charges of BPS states do not vanish in the interior of the moduli space. Given a charge vector of a BPS state corresponding to a large black hole in these theories, we show that all walls of marginal stability intersect at the same point in the lower half of the axion-dilaton plane. We isolate a class of decays whose walls of marginal stability always lie in a region bounded by walls formed by decays to small black holes. This enables us to isolate a region in moduli space for which no decays occur within this class. We then study entropy enigma decays for such models and show that for generic values of the moduli, that is when moduli are of order one compared to the charges, entropy enigma decays do not occur in these models.
Resumo:
We have shown previously that the Ca2+-specific fluorescent dyes chlortetracycline (CTC) and indo-1/AM can be used to distinguish between prestalk and prespore cells in Dictyostelium discoideum at a very early stage. In the present study, pre- and post-aggregative amoebae of Dictyostelium discoideum were labelled with CTC or indo-1 and their fluorescence monitored after being drawn into a fine glass capillary. The cells rapidly form two zones of Ca2+-CTC or Ca2+-indo-1 fluorescence. Anterior (air side) cells display a high level of fluorescence; the level drops in the middle portion of the capillary and rises again to a lesser extent in the posteriormost cells (oil side). When bounded by air on both sides, the cells display high fluorescence at both ends. When oil is present at both ends of the capillary, there is little fluorescence except for small regions at the ends. These outcomes are evident within a couple of minutes of the start of the experiment and the fluorescence pattern intensifies over the course of time. By using the indicator neutral red, as well as with CTC and indo-1, we show that a band displaying strong fluorescence moves away from the anterior end before stabilizing at the anterior-posterior boundary. We discuss our findings in relation to the role of Ca2+ in cell-type differentiation in Dictyostelium discoideum.
Resumo:
Emerging embedded applications are based on evolving standards (e.g., MPEG2/4, H.264/265, IEEE802.11a/b/g/n). Since most of these applications run on handheld devices, there is an increasing need for a single chip solution that can dynamically interoperate between different standards and their derivatives. In order to achieve high resource utilization and low power dissipation, we propose REDEFINE, a polymorphic ASIC in which specialized hardware units are replaced with basic hardware units that can create the same functionality by runtime re-composition. It is a ``future-proof'' custom hardware solution for multiple applications and their derivatives in a domain. In this article, we describe a compiler framework and supporting hardware comprising compute, storage, and communication resources. Applications described in high-level language (e.g., C) are compiled into application substructures. For each application substructure, a set of compute elements on the hardware are interconnected during runtime to form a pattern that closely matches the communication pattern of that particular application. The advantage is that the bounded CEs are neither processor cores nor logic elements as in FPGAs. Hence, REDEFINE offers the power and performance advantage of an ASIC and the hardware reconfigurability and programmability of that of an FPGA/instruction set processor. In addition, the hardware supports custom instruction pipelining. Existing instruction-set extensible processors determine a sequence of instructions that repeatedly occur within the application to create custom instructions at design time to speed up the execution of this sequence. We extend this scheme further, where a kernel is compiled into custom instructions that bear strong producer-consumer relationship (and not limited to frequently occurring sequences of instructions). Custom instructions, realized as hardware compositions effected at runtime, allow several instances of the same to be active in parallel. A key distinguishing factor in majority of the emerging embedded applications is stream processing. To reduce the overheads of data transfer between custom instructions, direct communication paths are employed among custom instructions. In this article, we present the overview of the hardware-aware compiler framework, which determines the NoC-aware schedule of transports of the data exchanged between the custom instructions on the interconnect. The results for the FFT kernel indicate a 25% reduction in the number of loads/stores, and throughput improves by log(n) for n-point FFT when compared to sequential implementation. Overall, REDEFINE offers flexibility and a runtime reconfigurability at the expense of 1.16x in power and 8x in area when compared to an ASIC. REDEFINE implementation consumes 0.1x the power of an FPGA implementation. In addition, the configuration overhead of the FPGA implementation is 1,000x more than that of REDEFINE.
Resumo:
We present robust joint nonlinear transceiver designs for multiuser multiple-input multiple-output (MIMO) downlink in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas, and each user terminal is equipped with one or more receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for interuser interference precancellation at the transmitter. We consider robust transceiver designs that jointly optimize the transmit THP filters and receive filter for two models of CSIT errors. The first model is a stochastic error (SE) model, where the CSIT error is Gaussian-distributed. This model is applicable when the CSIT error is dominated by channel estimation error. In this case, the proposed robust transceiver design seeks to minimize a stochastic function of the sum mean square error (SMSE) under a constraint on the total BS transmit power. We propose an iterative algorithm to solve this problem. The other model we consider is a norm-bounded error (NBE) model, where the CSIT error can be specified by an uncertainty set. This model is applicable when the CSIT error is dominated by quantization errors. In this case, we consider a worst-case design. For this model, we consider robust (i) minimum SMSE, (ii) MSE-constrained, and (iii) MSE-balancing transceiver designs. We propose iterative algorithms to solve these problems, wherein each iteration involves a pair of semidefinite programs (SDPs). Further, we consider an extension of the proposed algorithm to the case with per-antenna power constraints. We evaluate the robustness of the proposed algorithms to imperfections in CSIT through simulation, and show that the proposed robust designs outperform nonrobust designs as well as robust linear transceiver designs reported in the recent literature.
Resumo:
In this article, we propose a denoising algorithm to denoise a time series y(i) = x(i) + e(i), where {x(i)} is a time series obtained from a time- T map of a uniformly hyperbolic or Anosov flow, and {e(i)} a uniformly bounded sequence of independent and identically distributed (i.i.d.) random variables. Making use of observations up to time n, we create an estimate of x(i) for i<n. We show under typical limiting behaviours of the orbit and the recurrence properties of x(i), the estimation error converges to zero as n tends to infinity with probability 1.
Resumo:
An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.