202 resultados para Maximum independent set
Resumo:
There are two independent molecules in the asymmetric unit of the title compound, C11H9Cl2N, both of which are essentially planar [maximum deviations of 0.072 (5) and 0.072 (7) angstrom]. In the crystal structure, weak pi-pi stacking interactions [centroid-centroid distances = 3.791 (3) angstrom and 3.855 (3) angstrom] link pairs of molecules.
Resumo:
The unsteady laminar free convection boundary layer flows around two-dimensional and axisymmetric bodies placed in an ambient fluid of infinite extent have been studied when the flow is driven by thermal buoyancy forces and buoyancy forces from species diffusion. The unsteadiness in the flow field is caused by both temperature and concentration at the wall which vary arbitrarily with time. The coupled nonlinear partial differential equations with three independent variables governing the flow have been solved numerically using an implicit finite-difference scheme in combination with the quasilinearization technique. Computations have been performed for a circular cylinder and a sphere. The skin friction, heat transfer and mass transfer are strongly dependent on the variation of the wall temperature and concentration with time. Also the skin friction and heat transfer increase or decrease as the buoyancy forces from species diffusion assist and oppose, respectively, the thermal buoyancy force, whereas the mass transfer rate is higher for small values of the ratio of the buoyancy parameters than for large values. The local heat and mass transfer rates are maximum at the stagnation point and they decrease progressively with increase of the angular position from the stagnation point.
Resumo:
The problem of determining whether a Tanner graph for a linear block code has a stopping set of a given size is shown to be NT-complete.
Resumo:
It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.
Resumo:
This correspondence describes a method for automated segmentation of speech. The method proposed in this paper uses a specially designed filter-bank called Bach filter-bank which makes use of 'music' related perception criteria. The speech signal is treated as continuously time varying signal as against a short time stationary model. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. The Bach filters are seen to marginally outperform the other filters.
Resumo:
We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.
Resumo:
The asymmetric stress strain behavior under tension/compression in an initial < 100 > B-2-NiAl nanowire is investigated considering two different surface configurations i.e., < 100 >/(0 1 0) (0 0 1) and < 100 >/(0 1 1) (0 - 1 1). This behavior is attributed to two different deformation mechanisms namely a slip dominated deformation under compression and a known twinning dominated deformation under tension. It is also shown that B2 -> BCT (body-centered-tetragonal) phase transformation under tensile loading is independent of the surface configurations for an initial < 100 > oriented NiAl nanowire. Under tensile loading, the nanowire undergoes a stress-induced martensiticphase transformation from an initial B2 phase to BCT phase via twinning along {110} plane with failure strain of similar to 0.30. On the other hand, a compressive loading causes failure of these nanowires via brittle fracture after compressive yielding, with a maximum failure strain of similar to-0.12. Such brittle fracture under compressive loading occurs via slip along {110} plane without any phase transformations. Softening/hardening behavior is also reported for the first time in these nanowires under tensile/compressive loadings, which cause asymmetry in their yield strength behavior in the stress strain space. Result shows that a sharp increase in energy with increasing strain under compressive loading causes hardening of the nanowire, and hence, gives improved yield strength as compared to tensile loading. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.
Resumo:
Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.
Resumo:
A Space-Time Block Code (STBC) in K-variables is said to be g-Group ML-Decodable (GMLD) if its Maximum-Likelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2(m) transmit antennas, m > 1, is presented. The rate of the STBC obtained for 2(m) transmit antennas is 2(m-2) + 1/2(m), complex symbols per channel use. The design method is illustrated for the case of 4 and 8 transmit antennas. The code obtained for 4 transmit antennas is equivalent to the rate-5/4 Quasi-Orthogonal design (QOD) proposed by Yuen, Guan and Tjung.
Resumo:
The combined effects of the permeability of the medium, magnetic field, buoyancy forces and dissipation on the unsteady mixed convection flow over a horizontal cylinder and a sphere embedded in a porous medium have been studied. The nonlinear coupled partial differential equations with three independent variables have been solved numerically using an implicit finite-difference scheme in combination with the quasilinearization technique. The skin friction, heat transfer and mass transfer increase with the permeability of the medium, magnetic field and buoyancy parameter. The heat and mass transfer continuously decrease with the stream-wise distance, whereas the skin friction increases from zero, attains a maximum and then decreases to zero. The skin friction, heat transfer and mass transfer are significantly affected by the free stream velocity distribution. The effect of dissipation parameter is found to be more pronounced on the heat transfer than on the skin friction and mass transfer
Resumo:
The mean-squared voltage fluctuation of a disordered conductor of lengthL smaller than the phase coherence lengthL ϕ, is independent of the distance between the probes. We obtain this result using the voltage additivity and the known results for the conductance fluctuation. Our results complement the recent theoretical and experimental findings.
Resumo:
Shell model calculation of defect energies in alkali halides have been carried out using the ion-dependent, crystal-independent potential parameters of Sangster and Atwood (1978). Results indicate that appreciable differences exist between barrier heights for migration of cations and anions. While barrier heights for cations are generally lower than for anions in alkali halides of NaCl structure, the opposite is true in alkali halides of CsCl structure.
Resumo:
We study the dynamical properties of the homogeneous shear flow of inelastic dumbbells in two dimensions as a first step towards examining the effect of shape on the properties of flowing granular materials. The dumbbells are modelled as smooth fused disks characterized by the ratio of the distance between centres (L) and the disk diameter (D), with an aspect ratio (L/D) varying between 0 and 1 in our simulations. Area fractions studied are in the range 0.1-0.7, while coefficients of normal restitution (e(n)) from 0.99 to 0.7 are considered. The simulations use a modified form of the event-driven methodology for circular disks. The average orientation is characterized by an order parameter S, which varies between 0 (for a perfectly disordered fluid) and 1 (for a fluid with the axes of all dumbbells in the same direction). We investigate power-law fits of S as a function of (L D) and (1 - e(n)(2)) There is a gradual increase in ordering as the area fraction is increased, as the aspect ratio is increased or as the coefficient of restitution is decreased. The order parameter has a maximum value of about 0.5 for the highest area fraction and lowest coefficient of restitution considered here. The mean energy of the velocity fluctuations in the flow direction is higher than that in the gradient direction and the rotational energy, though the difference decreases as the area fraction increases, due to the efficient collisional transfer of energy between the three directions. The distributions of the translational and rotational velocities are Gaussian to a very good approximation. The pressure is found to be remarkably independent of the coefficient of restitution. The pressure and dissipation rate show relatively little variation when scaled by the collision frequency for all the area fractions studied here, indicating that the collision frequency determines the momentum transport and energy dissipation, even at the lowest area fractions studied here. The mean angular velocity of the particles is equal to half the vorticity at low area fractions, but the magnitude systematically decreases to less than half the vorticity as the area fraction is increased, even though the stress tensor is symmetric.