Search results for: quantile dispersion graphs.

Authors: S. M. Abdur Razzak, M. A. Rashid, Y. Namihira, A. Sayeem

Abstract:

A simple microstructure optical fiber design based on an octagonal cladding structure is presented for simultaneously controlling dispersion and leakage properties. The finite difference method with anisotropic perfectly matched boundary layer is used to investigate the guiding properties. It is demonstrated that octagonal photonic crystal fibers with four rings can assume negative ultra-flattened dispersion of -19 + 0.23 ps/nm/km in the wavelength range of 1.275 μm to 1.68 μm, nearly zero ultra-flattened dispersion of 0 ± 0.40 ps/nm/km in a 1.38 to 1.64 μm, and low confinement losses less than 10-3 dB/km in the entire band of interest.

Keywords: Finite difference modeling, group velocity dispersion, optical fiber design, photonic crystal fiber.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1787

Authors: Habtu Alemayehu, G. Radhakrishnamacharya

Abstract:

An analytical solution for dispersion of a solute in the peristaltic motion of a couple stress fluid in the presence of magnetic field with both homogeneous and heterogeneous chemical reactions is presented. The average effective dispersion coefficient has been found using Taylor-s limiting condition and long wavelength approximation. The effects of various relevant parameters on the average effective coefficient of dispersion have been studied. The average effective dispersion coefficient tends to decrease with magnetic field parameter, homogeneous chemical reaction rate parameter and amplitude ratio but tends to increase with heterogeneous chemical reaction rate parameter.

Keywords: Dispersion, Peristalsis, Couple stress fluid, Chemicalreaction, Magnetic field.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1729

Authors: Moustafa Ahmed, Ahmed Bakry, Safwat W. Z. Mahmoud

Abstract:

We model and simulate the combined effect of fiber dispersion and frequency chirp of a directly modulated high-speed laser diode on the figures of merit of a non-amplified 40-Gbps optical fiber link. We consider both the return to zero (RZ) and non-return to zero (NRZ) patterns of the pseudorandom modulation bits. The performance of the fiber communication system is assessed by the fiber-length limitation due to the fiber dispersion. We study the influence of replacing standard single-mode fibers by non-zero dispersion-shifted fibers on the maximum fiber length and evaluate the associated power penalty. We introduce new dispersion tolerances for 1-dB power penalty of the RZ and NRZ 40-Gbps optical fiber links.

Keywords: Bit error rate, dispersion, frequency chirp, fiber communications, semiconductor laser.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3269

Authors: H. V. Chen

Abstract:

Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is a positive integer. In this paper, we discuss certain labelling of the m graphs called c-Erdösian for some positive integers c. We regard labellings of the vertices of the graphs by positive integers, which induce the edge labels for the paths as the sum of the two incident vertex labels. They have the property that each vertex label and edge label appears only once in the set of positive integers {c, . . . , c+6m- 1}. Here, we show how to construct certain c-Erdösian of m paths with 2 and 3 vertices by using Skolem sequences.

Keywords: c-Erdösian, Skolem sequences, magic labelling

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1124

Authors: R. Anitha, R. S. Lekshmi

Abstract:

Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H-decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete graph of order 2n, K2n can be decomposed into n-2 n-suns, a Hamilton cycle and a perfect matching, when n is even and for odd case, the decomposition is n-1 n-suns and a perfect matching. For an odd order complete graph K2n+1, delete the star subgraph K1, 2n and the resultant graph K2n is decomposed as in the case of even order. The method of building n-suns uses Walecki's construction for the Hamilton decomposition of complete graphs. A spanning tree decomposition of even order complete graphs is also discussed using the labeling scheme of n-sun decomposition. A complete bipartite graph Kn, n can be decomposed into n/2 n-suns when n/2 is even. When n/2 is odd, Kn, n can be decomposed into (n-2)/2 n-suns and a Hamilton cycle.

Keywords: Hamilton cycle, n-sun decomposition, perfectmatching, spanning tree.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2222

Authors: Jann-Eike Saathoff, Kirill Alexander Schmoor, Martin Achmus, Mauricio Terceros

Abstract:

By using partial factors of safety, uncertainties due to the inherent variability of the soil properties and loads are taken into account in the geotechnical design process. According to the reliability index concept in Eurocode-0 in conjunction with Eurocode-7 a minimum safety level of β = 3.8 for reliability class RC2 shall be established. The reliability of the system depends heavily on the choice of the prespecified safety factor and the choice of the characteristic soil properties. The safety factors stated in the standards are mainly based on experience. However, no general accepted method for the calculation of a characteristic value within the current design practice exists. In this study, a laterally loaded monopile is investigated and the influence of the chosen quantile values of the deterministic system, calculated with p-y springs, will be presented. Monopiles are the most common foundation concepts for offshore wind energy converters. Based on the calculations for non-cohesive soils, a recommendation for an appropriate quantile value for the necessary safety level according to the standards for a deterministic design is given.

Keywords: Asymptotic sampling, characteristic value, monopile foundation, probabilistic design, quantile values.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 614

Authors: Habtu Alemayehu, G. Radhakrishnamacharya

Abstract:

The paper presents an analytical solution for dispersion of a solute in the peristaltic motion of a couple stress fluid through a porous medium with slip condition in the presence of both homogeneous and heterogeneous chemical reactions. The average effective dispersion coefficient has been found using Taylor-s limiting condition and long wavelength approximation. The effects of various relevant parameters on the average coefficient of dispersion have been studied. The average effective dispersion coefficient tends to increase with permeability parameter but tends to decrease with homogeneous chemical reaction rate parameter, couple stress parameter, slip parameter and heterogeneous reaction rate parameter.

Keywords: Dispersion, Peristalsis, Couple stress fluid, Porousmedium, Chemical reaction, Slip condition.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1525

Authors: Rajeev Ranjan Sahay

Abstract:

Transient storage zones along the flow paths of rivers have great influence on the dispersion of pollutants that are either accidentally or otherwise led into them. The speed with which these pollution clouds get transported and dispersed downstream is, to a large extent, explained by the longitudinal dispersion coefficients in the free-flowing zones of rivers (Kf). In the present work, a new empirical expression for Kf has been derived employing genetic programming (GP) on published dispersion data. The proposed expression uses few hydraulic and geometric characteristics of a river that are readily available to field engineers. Based on various performance indices, the proposed expression is found superior to other existing expression for Kf.

Keywords: Dispersion, parameter estimation, rivers, transient pollutant.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1678

Authors: Walter Hussak, Heiko Schröder

Abstract:

Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.

Keywords: interconnection networks, paths and cycles, graphs andgroups.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1713

Authors: M. W. Lau, C. O. Ng

Abstract:

This is a study on numerical simulation of the convection-diffusion transport of a chemical species in steady flow through a small-diameter tube, which is lined with a very thin layer made up of retentive and absorptive materials. The species may be subject to a first-order kinetic reversible phase exchange with the wall material and irreversible absorption into the tube wall. Owing to the velocity shear across the tube section, the chemical species may spread out axially along the tube at a rate much larger than that given by the molecular diffusion; this process is known as dispersion. While the long-time dispersion behavior, well described by the Taylor model, has been extensively studied in the literature, the early development of the dispersion process is by contrast much less investigated. By early development, that means a span of time, after the release of the chemical into the flow, that is shorter than or comparable to the diffusion time scale across the tube section. To understand the early development of the dispersion, the governing equations along with the reactive boundary conditions are solved numerically using the Flux Corrected Transport Algorithm (FCTA). The computation has enabled us to investigate the combined effects on the early development of the dispersion coefficient due to the reversible and irreversible wall reactions. One of the results is shown that the dispersion coefficient may approach its steady-state limit in a short time under the following conditions: (i) a high value of Damkohler number (say Da ≥ 10); (ii) a small but non-zero value of absorption rate (say Γ* ≤ 0.5).

Keywords: Dispersion coefficient, early development of dispersion, FCTA, wall reactions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1309

Authors: Jeffrey L. Duffany

Abstract:

Graph coloring is an important problem in computer science and many algorithms are known for obtaining reasonably good solutions in polynomial time. One method of comparing different algorithms is to test them on a set of standard graphs where the optimal solution is already known. This investigation analyzes a set of 50 well known graph coloring instances according to a set of complexity measures. These instances come from a variety of sources some representing actual applications of graph coloring (register allocation) and others (mycieleski and leighton graphs) that are theoretically designed to be difficult to solve. The size of the graphs ranged from ranged from a low of 11 variables to a high of 864 variables. The method used to solve the coloring problem was the square of the adjacency (i.e., correlation) matrix. The results show that the most difficult graphs to solve were the leighton and the queen graphs. Complexity measures such as density, mobility, deviation from uniform color class size and number of block diagonal zeros are calculated for each graph. The results showed that the most difficult problems have low mobility (in the range of .2-.5) and relatively little deviation from uniform color class size.

Keywords: graph coloring, complexity, algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1369

Authors: S. Olyaee, M. Seifouri, A. Nikoosohbat, M. Shams Esfand Abadi

Abstract:

Photonic Crystal Fibers (PCFs) can be used in optical communications as transmission lines. For this reason, the PCFs with low confinement loss, low chromatic dispersion, and low nonlinear effects are highly suitable transmission media. In this paper, we introduce a new design of index-guiding nanostructured photonic crystal fiber (IG-NPCF) with ultra-low chromatic dispersion, low nonlinearity effects, and low confinement loss. Relatively low dispersion is achieved in the wavelength range of 1200 to 1600nm using the proposed design. According to the new structure of nanostructured PCF presented in this study, the chromatic dispersion slope is -30(ps/km.nm) and the confinement loss reaches below 10-7 dB/km. While in the wavelength range mentioned above at the same time an effective area of more than 50.2μm2 is obtained.

Keywords: Optical communication systems, nanostructured, index-guiding, dispersion, confinement loss, photonic crystal fiber.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2913

Authors: Matthias Dehmer, Frank Emmert Streib, Alexander Mehler, Jürgen Kilian, Max Mühlhauser

Abstract:

Due to the tremendous amount of information provided by the World Wide Web (WWW) developing methods for mining the structure of web-based documents is of considerable interest. In this paper we present a similarity measure for graphs representing web-based hypertext structures. Our similarity measure is mainly based on a novel representation of a graph as linear integer strings, whose components represent structural properties of the graph. The similarity of two graphs is then defined as the optimal alignment of the underlying property strings. In this paper we apply the well known technique of sequence alignments for solving a novel and challenging problem: Measuring the structural similarity of generalized trees. In other words: We first transform our graphs considered as high dimensional objects in linear structures. Then we derive similarity values from the alignments of the property strings in order to measure the structural similarity of generalized trees. Hence, we transform a graph similarity problem to a string similarity problem for developing a efficient graph similarity measure. We demonstrate that our similarity measure captures important structural information by applying it to two different test sets consisting of graphs representing web-based document structures.

Keywords: Graph similarity, hierarchical and directed graphs, hypertext, generalized trees, web structure mining.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1849

Authors: S. Alrekabi, A. Cundy, A. Lampropoulos, I. Savina

Abstract:

Due to their remarkable mechanical properties, multi-wall carbon nanotubes (MWCNTs) are considered by many researchers to be a highly promising filler and reinforcement agent for enhanced performance cementitious materials. Currently, however, achieving an effective dispersion of MWCNTs remains a major challenge in developing high performance nano-cementitious composites, since carbon nanotubes tend to form large agglomerates and bundles as a consequence of Van der Waals forces. In this study, effective dispersion of low concentrations of MWCNTs at 0.01%, 0.025%, and 0.05% by weight of cement in the composite was achieved by applying different sonication conditions in combination with the use of polycarboxylate ether as a surfactant. UV-Visible spectroscopy and Transmission electron microscopy (TEM) were used to assess the dispersion of MWCNTs in water, while the dispersion states of MWCNTs within the cement composites and their surface interactions were examined by scanning electron microscopy (SEM). A high sonication intensity applied over a short time period significantly enhanced the dispersion of MWCNTs at initial mixing stages, and 0.025% of MWCNTs wt. of cement, caused 86% and 27% improvement in tensile strength and compressive strength respectively, compared with a plain cement mortar.

Keywords: Dispersion, multiwall carbon nanotubes, mechanical performance, sonication conditions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1831

Authors: Azze-Eddine Maredj, Nourredine Tonkin

Abstract:

The recent developments in computing and communication technology permit to users to access multimedia documents with variety of devices (PCs, PDAs, mobile phones...) having heterogeneous capabilities. This diversification of supports has trained the need to adapt multimedia documents according to their execution contexts. A semantic framework for multimedia document adaptation based on the conceptual neighborhood graphs was proposed. In this framework, adapting consists on finding another specification that satisfies the target constraints and which is as close as possible from the initial document. In this paper, we propose a new way of building the conceptual neighborhood graphs to best preserve the proximity between the adapted and the original documents and to deal with more elaborated relations models by integrating the relations relaxation graphs that permit to handle the delays and the distances defined within the relations.

Keywords: Conceptual Neighborhood Graph, Relaxation Graphs, Relations with Delays, Semantic Adaptation of Multimedia Documents.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1509

Authors: Oliver Mărunţălu, Gheorghe Lăzăroiu, Elena Elisabeta Manea, Dana Andreya Bondrea, Lăcrămioara Diana Robescu

Abstract:

This paper presents the results obtained by numerical simulation using the software ANSYS CFX-CFD for the air pollutants dispersion in the atmosphere coming from the evacuation of combustion gases resulting from the fuel combustion in an electric thermal power plant. The model uses the Navier-Stokes equation to simulate the dispersion of pollutants in the atmosphere. It is considered as important factors in elaboration of simulation the atmospheric conditions (pressure, temperature, wind speed, wind direction), the exhaust velocity of the combustion gases, chimney height and the obstacles (buildings). Using the air quality monitoring stations it is measured the concentrations of main pollutants (SO2, NOx and PM). The pollutants were monitored over a period of 3 months, after that the average concentration are calculated, which is used by the software. The concentrations are: 8.915 μg/m3 (NOx), 9.587 μg/m3 (SO2) and 42 μg/m3 (PM). A comparison of test data with simulation results demonstrated that CFX was able to describe the dispersion of the pollutant as well the concentration of this pollutants in the atmosphere.

Keywords: Air pollutants, computational fluid dynamics, dispersion, simulation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4413

Authors: Fangfang Chen, Chunlu Wang, Zhihong Tian, Shuyuan Jin, Tianle Zhang

Abstract:

Attack graph is an integral part of modeling the overview of network security. System administrators use attack graphs to determine how vulnerable their systems are and to determine what security measures to deploy to defend their systems. Previous methods on AGG(attack graphs generation) are aiming at the whole network, which makes the process of AGG complex and non-scalable. In this paper, we propose a new approach which is simple and scalable to AGG by decomposing the whole network into atomic domains. Each atomic domain represents a host with a specific privilege. Then the process for AGG is achieved by communications among all the atomic domains. Our approach simplifies the process of design for the whole network, and can gives the attack graphs including each attack path for each host, and when the network changes we just carry on the operations of corresponding atomic domains which makes the process of AGG scalable.

Keywords: atomic domain, vulnerability, attack graphs, generation, computer security

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1613

Authors: Udaya Kumar Reddy K. R, K. Viswanathan Iyer

Abstract:

Given a simple connected unweighted undirected graph G = (V (G), E(G)) with |V (G)| = n and |E(G)| = m, we present a new algorithm for the all-pairs shortest-path (APSP) problem. The running time of our algorithm is in O(n2 log n). This bound is an improvement over previous best known O(n2.376) time bound of Raimund Seidel (1995) for general graphs. The algorithm presented does not rely on fast matrix multiplication. Our algorithm with slight modifications, enables us to compute the APSP problem for unweighted directed graph in time O(n2 log n), improving a previous best known O(n2.575) time bound of Uri Zwick (2002).

Keywords: Distance in graphs, Dynamic programming, Graphalgorithms, Shortest paths.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3639

Authors: Mohamed A. Elsherif, A. Malekmohammadi

Abstract:

An exploration in the competency of the optical multilevel Mapping Multiplexing Technique (MMT) system in tolerating to the impact of nonlinearities as Self Phase Modulation (SPM) during the presence of dispersion compensation methods. The existence of high energy pulses stimulates deterioration in the chirp compression process attained by SPM which introduces an upper power boundary limit. An evaluation of the post and asymmetric prepost fiber compensation methods have been deployed on the MMT system compared with others of the same bit rate modulation formats. The MMT 40 Gb/s post compensation system has 1.4 dB enhancements to the 40 Gb/s 4-Arysystem and less than 3.9 dB penalty compared to the 40 Gb/s OOK-RZsystem. However, the optimized Pre-Post asymmetric compensation has an enhancement of 4.6 dB compared to the Post compensation MMT configuration for a 30% pre compensation dispersion.

Keywords: Dispersion compensation, mapping multiplexing technique, self-phase modulation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1879

Authors: Fujian Wang, Shubin Ruan, Meiwei Dai

Abstract:

Speed dispersion has tight relation to traffic safety. In this paper, several kinds of indicating parameters (the standard speed deviation, the coefficient of variation, the deviation of V85 and V15, the mean speed deviations, and the difference between adjacent car speeds) are applied to investigate the characteristics of speed dispersion, where V85 and V15 are 85th and 15th percentile speed, respectively. Their relationships are into full investigations and the results show that: there exists a positive relation (linear) between mean speed and the deviation of V85 and V15; while a negative relation (quadratic) between traffic flow and standard speed deviation. The mean speed deviation grows exponentially with mean speed while the absolute speed deviation between adjacent cars grows linearly with the headway. The results provide some basic information for traffic management.

Keywords: Headway, indicating parameters, speed dispersion, urban expressway.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1366

Authors: M. R. Salehi, S. Khosroabadi

Abstract:

In this paper, the optical generation of three bands of continuously tunable millimeter-wave signals using an optical phase modulator (OPM) and a polarization state rotation filter (PSRF) as an optical notch filter is analyzed. The effect of the chromatic dispersion on millimeter-wave signals is presented.

Keywords: Optical generation, millimeter-wave, optical notchfilter , chromatic dispersion.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1823

Authors: Bhupeshwaran Mani, S. Radha, A. Jawahar, A. Sivasubramanian

Abstract:

Here, we study the characteristic feature of conventional (ON-OFF keying) and soliton based transmission system. We consider 20Gbps transmission system implemented with Conventional Single Mode Fiber (C-SMF) to examine the role of Gaussian pulse which is the characteristic of conventional propagation and Hyperbolic-secant pulse which is the characteristic of soliton propagation in it. We note the influence of these pulses with respect to different dispersion lengths and soliton period in conventional and soliton system respectively and evaluate the system performance in terms of Quality factor. From the analysis, we could prove that the soliton pulse has the consistent performance even for long distance without dispersion compensation than the conventional system as it is robust to dispersion. For the length of transmission of 200Km, soliton system yielded Q of 33.958 while the conventional system totally exhausted with Q=0.

Keywords: Soliton, dispersion length, Soliton period, Return-tozero (RZ), Q-factor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1595

Authors: Kadam Bhambri, Neena Gupta

Abstract:

All optical wavelength conversion is essential in present day optical networks for transparent interoperability, contention resolution, and wavelength routing. The incorporation of all optical wavelength convertors leads to better utilization of the network resources and hence improves the efficiency of optical networks. Wavelength convertors that can work with Dispersion Managed (DM) solitons are attractive due to their superior transmission capabilities. In this paper, wavelength conversion for dispersion managed soliton signals was demonstrated at 100 Gbps through semiconductor optical amplifier and an optical filter. The wavelength conversion was achieved for a 1550 nm input signal to1555nm output signal. The output signal was measured in terms of BER, Q factor and system margin.    

Keywords: All optical wavelength conversion, dispersion managed solitons, semiconductor optical amplifier, cross gain modulation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1344

Authors: Anthony Spiteri Staines

Abstract:

This paper examines the modeling and analysis of a cruise control system using a Petri net based approach, task graphs, invariant analysis and behavioral properties. It shows how the structures used can be verified and optimized.

Keywords: Software Engineering, Real Time Analysis andDesign, Petri Nets, Task Graphs, Parallelism.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2322

Authors: Yu Zhao, Shinsuke Kato, Jianing Zhao

Abstract:

Particles exhausted from cars have adverse impacts on human health. The study developed a three-dimensional particle dispersion numerical model including particle coagulation to simulate the particle concentration distribution under idling conditions in a residential underground garage. The simulation results demonstrate that particle disperses much faster in the vertical direction than that in horizontal direction. The enhancement of particle dispersion in the vertical direction due to the increase of cars with engine running is much stronger than that in the car exhaust direction. Particle dispersion from each pair of adjacent cars has little influence on each other in the study. Average particle concentration after 120 seconds exhaust is 1.8-4.5 times higher than the initial total particles at ambient environment. Particle pollution in the residential underground garage is severe.

Keywords: Dispersion, Idling conditions, Particle concentration, Residential underground garage.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1943

Authors: Mahdi Taheri, Mehrana Niroumand

Abstract:

In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples . This form matrix has complete of information of a graph.

Keywords: Graph, adjacency matrix, fuzzy numbers

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2329

Authors: T. Banerjee, R. A. Christian

Abstract:

Three dimensional simulations are carried out to estimate the effect of wind direction, wind speed and geometry on the flow and dispersion of vehicular pollutant in a street canyon. The pollutant sources are motor vehicles passing between the two buildings. Suitable emission factors for petrol and diesel vehicles at varying vehicle speed are used for the estimation of the rate of emission from the streets. The dispersion of automobile pollutant released from the street is simulated by introducing vehicular emission source term as a fixed-flux boundary condition at the ground level over the road. The emission source term is suitably calculated by adopting emission factors from literature for varying conditions of street traffic. It is observed that increase in wind angle disturbs the symmetric pattern of pollution distribution along the street length. The concentration increases in the far end of the street as compared to the near end.

Keywords: Street canyon, pollution dispersion, vehicular emission, numerical simulation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1763

Authors: Hsun Su, Yuan-Kang Shih, Shin-Shin Kao

Abstract:

Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC-s, on interconnection networks are published. In this paper, using an improved construction method, we obtain MIHC-s on cycle composition networks with a much weaker condition than the known result. In fact, we established the existence of MIHC-s in the cycle composition networks and the result is optimal in the sense that the number of MIHC-s we constructed is maximal.

Keywords: Hamiltonian cycle, k-ary n-cube, cycle composition networks, mutually independent.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1349

Authors: Marek Skomorowski

Abstract:

In syntactic pattern recognition a pattern can be represented by a graph. Given an unknown pattern represented by a graph g, the problem of recognition is to determine if the graph g belongs to a language L(G) generated by a graph grammar G. The so-called IE graphs have been defined in [1] for a description of patterns. The IE graphs are generated by so-called ETPL(k) graph grammars defined in [1]. An efficient, parsing algorithm for ETPL(k) graph grammars for syntactic recognition of patterns represented by IE graphs has been presented in [1]. In practice, structural descriptions may contain pattern distortions, so that the assignment of a graph g, representing an unknown pattern, to a graph language L(G) generated by an ETPL(k) graph grammar G is rejected by the ETPL(k) type parsing. Therefore, there is a need for constructing effective parsing algorithms for recognition of distorted patterns. The purpose of this paper is to present a new approach to syntactic recognition of distorted patterns. To take into account all variations of a distorted pattern under study, a probabilistic description of the pattern is needed. A random IE graph approach is proposed here for such a description ([2]).

Keywords: Syntactic pattern recognition, Distorted patterns, Random graphs, Graph grammars.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1358

Authors: Gabofetswe Malema, Michael Liebelt

Abstract:

LDPC codes could be used in magnetic storage devices because of their better decoding performance compared to other error correction codes. However, their hardware implementation results in large and complex decoders. This one of the main obstacles the decoders to be incorporated in magnetic storage devices. We construct small high girth and rate 2 columnweight codes from cage graphs. Though these codes have low performance compared to higher column weight codes, they are easier to implement. The ease of implementation makes them more suitable for applications such as magnetic recording. Cages are the smallest known regular distance graphs, which give us the smallest known column-weight 2 codes given the size, girth and rate of the code.

Keywords: Structured LDPC codes, cage graphs.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2080