Search results for: unit disk graphs
974 Complexity Analysis of Some Known Graph Coloring Instances
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 1401973 Univalence of an Integral Operator Defined by Generalized Operators
Authors: Salma Faraj Ramadan, Maslina Darus
Abstract:
In this paper we define generalized differential operators from some well-known operators on the class A of analytic functions in the unit disk U = {z ∈ C : |z| < 1}. New classes containing these operators are investigated. Also univalence of integral operator is considered.
Keywords: Univalent functions, integral operators, differential operators.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1262972 CO-OFDM DSP Channel Estimation
Authors: Pranav Ravikumar, Arunabha Bera, Vijay K. Mehra, Anand Kumar
Abstract:
This paper solves the Non Linear Schrodinger Equation using the Split Step Fourier method for modeling an optical fiber. The model generates a complex wave of optical pulses and using the results obtained two graphs namely Loss versus Wavelength and Dispersion versus Wavelength are generated. Taking Chromatic Dispersion and Polarization Mode Dispersion losses into account, the graphs generated are compared with the graphs formulated by JDS Uniphase Corporation which uses standard values of dispersion for optical fibers. The graphs generated when compared with the JDS Uniphase Corporation plots were found to be more or less similar thus verifying that the model proposed is right. MATLAB software was used for doing the modeling.Keywords: Modulation, Non Linear Schrodinger Equation, Optical fiber, Split Step Fourier Method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2787971 Application of a Similarity Measure for Graphs to Web-based Document Structures
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 1892970 Simulation of the Airflow Characteristic inside a Hard Disk Drive by Applying a Computational Fluid Dynamics Software
Authors: Chanchal Saha, Huynh Trung Luong, M. H. Aziz, Tharinan Rattanalert
Abstract:
Now-a-days, numbers of simulation software are being used all over the world to solve Computational Fluid Dynamics (CFD) related problems. In this present study, a commercial CFD simulation software namely STAR-CCM+ is applied to analyze the airflow characteristics inside a 2.5" hard disk drive. Each step of the software is described adequately to obtain the output and the data are verified with the theories to justify the robustness of the simulation outcome. This study gives an insight about the accuracy level of the CFD simulation software to compute CFD related problems although it largely depends upon the computer speed. Also this study will open avenues for further research.Keywords: Computational fluid dynamics, Hard disk drive, Meshing, Recirculation filter, and Filter physics parameter.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2162969 Extremal Properties of Generalized Class of Close-to-convex Functions
Authors: Norlyda Mohamed, Daud Mohamad, Shaharuddin Cik Soh
Abstract:
Let Gα ,β (γ ,δ ) denote the class of function f (z), f (0) = f ′(0)−1= 0 which satisfied e δ {αf ′(z)+ βzf ′′(z)}> γ i Re in the open unit disk D = {z ∈ı : z < 1} for some α ∈ı (α ≠ 0) , β ∈ı and γ ∈ı (0 ≤γ <α ) where δ ≤ π and α cosδ −γ > 0 . In this paper, we determine some extremal properties including distortion theorem and argument of f ′( z ) .Keywords: Argument of f ′(z) , Carathéodory Function, Closeto- convex Function, Distortion Theorem, Extremal Properties
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1355968 Novel Design and Analysis of a Brake Rotor
Authors: Sharath Kumar T., S.Vinodh
Abstract:
Over the course of the past century, the global automotive industry-s stance towards safety has evolved from one of contempt to one nearing reverence. A suspension system that provides safe handling and cornering capabilities can, with the help of an efficient braking system, improve safety to a large extent. The aim of this research is to propose a new automotive brake rotor design and to compare it with automotive vented disk rotor. Static structural and transient thermal analysis have been carried out on the vented disk rotor and proposed rotor designs to evaluate and compare their performance. Finite element analysis was employed for both static structural and transient thermal analysis. Structural analysis was carried out to study the stress and deformation pattern of the rotors under extreme loads. Time varying temperature load was applied on the rotors and the temperature distribution was analysed considering cooling parameters (convection and radiation). This dissertation illustrates the use of Finite Element Methods to examine models, concluding with a comparative study of the proposed rotor design and the conventional vented disk rotor for structural stability and thermal efficiency.Keywords: Disk brakes, CAD model, rotor design, structural and thermal analysis
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3283967 Light Confinement in Low Index Nanometer Areas
Authors: N. Aravantinos-Zafiris, M. M. Sigalas
Abstract:
In this work we numerically examine structures which could confine light in nanometer areas. A system consisting of two silicon disks with in plane separation of a few tens of nanometers has been studied first. The normalized unitless effective mode volume, Veff, has been calculated for the two lowest whispering gallery mode resonances. The effective mode volume is reduced significantly as the gap between the disks decreases. In addition, the effect of the substrate is also studied. In that case, Veff of approximately the same value as the non-substrate case for a similar two disk system can be obtained by using disks almost twice as thick. We also numerically examine a structure consisting of a circular slot waveguide which is formed into a silicon disk resonator. We show that the proposed structure could have high Q resonances thus raising the belief that it is a very promising candidate for optical interconnects applications. The study includes several numerical calculations for all the geometric parameters of the structure. It also includes numerical simulations of the coupling between a waveguide and the proposed disk resonator leading to a very promising conclusion about its applicability.Keywords: Disk resonators, field enhancement, optical interconnect, slot waveguides.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1423966 Extending the Conceptual Neighborhood Graph of the Relations for the Semantic Adaptation of Multimedia Documents
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 1546965 Flow Analysis of Viscous Nanofluid Due to Rotating Rigid Disk with Navier’s Slip: A Numerical Study
Authors: Khalil Ur Rehman, M. Y. Malik, Usman Ali
Abstract:
In this paper, the problem proposed by Von Karman is treated in the attendance of additional flow field effects when the liquid is spaced above the rotating rigid disk. To be more specific, a purely viscous fluid flow yield by rotating rigid disk with Navier’s condition is considered in both magnetohydrodynamic and hydrodynamic frames. The rotating flow regime is manifested with heat source/sink and chemically reactive species. Moreover, the features of thermophoresis and Brownian motion are reported by considering nanofluid model. The flow field formulation is obtained mathematically in terms of high order differential equations. The reduced system of equations is solved numerically through self-coded computational algorithm. The pertinent outcomes are discussed systematically and provided through graphical and tabular practices. A simultaneous way of study makes this attempt attractive in this sense that the article contains dual framework and validation of results with existing work confirms the execution of self-coded algorithm for fluid flow regime over a rotating rigid disk.
Keywords: Nanoparticles, Newtonian fluid model, chemical reaction, heat source/sink.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 988964 Optimal Opportunistic Maintenance Policy for a Two-Unit System
Authors: Nooshin Salari, Viliam Makis, Jane Doe
Abstract:
This paper presents a maintenance policy for a system consisting of two units. Unit 1 is gradually deteriorating and is subject to soft failure. Unit 2 has a general lifetime distribution and is subject to hard failure. Condition of unit 1 of the system is monitored periodically and it is considered as failed when its deterioration level reaches or exceeds a critical level N. At the failure time of unit 2 system is considered as failed, and unit 2 will be correctively replaced by the next inspection epoch. Unit 1 or 2 are preventively replaced when deterioration level of unit 1 or age of unit 2 exceeds the related preventive maintenance (PM) levels. At the time of corrective or preventive replacement of unit 2, there is an opportunity to replace unit 1 if its deterioration level reaches the opportunistic maintenance (OM) level. If unit 2 fails in an inspection interval, system stops operating although unit 1 has not failed. A mathematical model is derived to find the preventive and opportunistic replacement levels for unit 1 and preventive replacement age for unit 2, that minimize the long run expected average cost per unit time. The problem is formulated and solved in the semi-Markov decision process (SMDP) framework. Numerical example is provided to illustrate the performance of the proposed model and the comparison of the proposed model with an optimal policy without opportunistic maintenance level for unit 1 is carried out.Keywords: Condition-based maintenance, opportunistic maintenance, preventive maintenance, two-unit system.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1017963 An Atomic-Domains-Based Approach for Attack Graph Generation
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 1655962 All-Pairs Shortest-Paths Problem for Unweighted Graphs in O(n2 log n) Time
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 3690961 Bio-Heat Transfer in Various Transcutaneous Stimulation Models
Authors: Trevor E. Davis, Isaac Cassar, Yi-Kai Lo, Wentai Liu
Abstract:
This study models the use of transcutaneous electrical nerve stimulation on skin with a disk electrode in order to simulate tissue damage. The current density distribution above a disk electrode is known to be a dynamic and non-uniform quantity that is intensified at the edges of the disk. The non-uniformity is subject to change through using various electrode geometries or stimulation methods. One of these methods known as edge-retarded stimulation has shown to reduce this edge enhancement. Though progress has been made in modeling the behavior of a disk electrode, little has been done to test the validity of these models in simulating the actual heat transfer from the electrode. This simulation uses finite element software to couple the injection of current from a disk electrode to heat transfer described by the Pennesbioheat transfer equation. An example application of this model is studying an experimental form of stimulation, known as edge-retarded stimulation. The edge-retarded stimulation method will reduce the current density at the edges of the electrode. It is hypothesized that reducing the current density edge enhancement effect will, in turn, reduce temperature change and tissue damage at the edges of these electrodes. This study tests this hypothesis as a demonstration of the capabilities of this model. The edge-retarded stimulation proved to be safer after this simulation. It is shown that temperature change and the fraction of tissue necrosis is much greater in the square wave stimulation. These results bring implications for changes of procedures in transcutaneous electrical nerve stimulation and transcutaneous spinal cord stimulation as well.
Keywords: Bioheat transfer, Electrode, Neuroprosthetics, TENS, Transcutaneous stimulation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2287960 Differential Sandwich Theorems with Generalised Derivative Operator
Authors: Maslina Darus, Khalifa Al-Shaqsi
Abstract:
In this paper, a generalized derivatives operator n λ,βf introduced by the authors will be discussed. Some subordination and superordination results involving this operator for certain normalized analytic functions in the open unit disk will be investigated. Our results extend corresponding previously known results.Keywords: Analytic functions, Univalent functions, Derivative operator, Differential subordination, Differential superordination.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1469959 Revolving Ferrofluid Flow in Porous Medium with Rotating Disk
Authors: Paras Ram, Vikas Kumar
Abstract:
An attempt has been made to study the effect of rotation on incompressible, electrically non-conducting ferrofluid in porous medium on Axi-symmetric steady flow over a rotating disk excluding thermal effects. Here, we solved the boundary layer equations with boundary conditions using Neuringer-Rosensweig model considering the z-axis as the axis of rotation. The non linear boundary layer equations involved in the problem are transformed to the non linear coupled ordinary differential equations by Karman's transformation and solved by power series approximations. Besides numerically calculating the velocity components and pressure for different values of porosity parameter with the variation of Karman's parameter we have also calculated the displacement thickness of boundary layer, the total volume flowing outward the z-axis and angle between wall and ferrofluid. The results for all above variables are obtained numerically and discussed graphically.
Keywords: Ferrofluid, magnetic field porous medium, rotating disk.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2135958 Weighted Composition Operators Acting between Kind of Weighted Bergman-Type Spaces and the Bers-Type Space
Authors: Amnah E. Shammahy
Abstract:
In this paper, we study the boundedness and compactness of the weighted composition operator Wu,φ, which is induced by an holomorphic function u and holomorphic self-map φ, acting between the NK-space and the Bers-type space H∞α on the unit disk.
Keywords: Weighted composition operators, NK-space, Bers-type space.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1632957 Experimental Study on Temperature Dependence of Absorption and Emission Properties of Yb:YAG Crystal as a Disk Laser Medium
Authors: M. Esmaeilzadeh, H. Roohbakhsh, A. Ghaedzadeh
Abstract:
In this paper, the absorption and fluorescence emission spectra of Yb:Y3Al5O12 (YAG)(25 at%) crystal as a disk laser medium are measured at high temperature (300-450K). The absorption and emission cross sections of Yb:YAG crystal are determined using Reciprocity method. Temperature dependence of 941nm absorption cross section and 1031nm emission cross section is extracted in the range of 300-450K. According to our experimental results, an exponential temperature dependence between 300K and 450K is acquired for the 1031nm peak emission cross section and also for 941nm peak absorption cross section of Yb:YAG crystal. These results could be used for simulation and design of high power highly doped Yb:YAG thin disk lasers.Keywords: Yb:YAG crystal, Emission cross section, Absorption coefficient, Temperature dependence, Reciprocity method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3200956 A Supervisory Scheme for Step-Wise Safe Switching Controllers
Authors: Fotis N. Koumboulis, Maria P. Tzamtzi
Abstract:
A supervisory scheme is proposed that implements Stepwise Safe Switching Logic. The functionality of the supervisory scheme is organized in the following eight functional units: Step- Wise Safe Switching unit, Common controllers design unit, Experimentation unit, Simulation unit, Identification unit, Trajectory cruise unit, Operating points unit and Expert system unit. The supervisory scheme orchestrates both the off-line preparative actions, as well as the on-line actions that implement the Stepwise Safe Switching Logic. The proposed scheme is a generic tool, that may be easily applied for a variety of industrial control processes and may be implemented as an automation software system, with the use of a high level programming environment, like Matlab.
Keywords: Supervisory systems, safe switching, nonlinear systems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1453955 Contact Temperature of Sliding Surfaces in AISI 316 Austenitic Stainless Steel during Pin on Disk Dry Wear Testing
Authors: Dler Abdullah Ahmed, Zozan Ahmed Mohammed
Abstract:
This study looked into contact surface temperature during a pin-on-disk test. Friction and wear between sliding surfaces raised the temperature differential between contact surface and ambient temperatures Tdiff. Tdiff was significantly influenced by wear test variables. Tdiff rose with the increase of sliding speed and applied load, while dropped with the increase in ambient temperature. The highest Tdiff was 289 °C during the tests at room temperature and 2.5 m/s sliding speed, while the minimum was only 24 °C during the tests at 400 °C and 0.5 m/s. However, the maximum contact temperature Tmax was found during tests conducted at high ambient temperatures. The Tmax was estimated based on the theoretical equation. The comparison of experimental and theoretical Tmax data was revealed good agreement.
Keywords: Pin-on-disk test, contact temperature, wear, sliding surface, friction, ambient temperature.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 67954 Certain Conditions for Strongly Starlike and Strongly Convex Functions
Authors: Sukhwinder Singh Billing, Sushma Gupta, Sukhjit Singh Dhaliwal
Abstract:
In the present paper, we investigate a differential subordination involving multiplier transformation related to a sector in the open unit disk E = {z : |z| < 1}. As special cases to our main result, certain sufficient conditions for strongly starlike and strongly convex functions are obtained.Keywords: Analytic function, Multiplier transformation, Strongly starlike function, Strongly convex function.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1177953 Cogeneration Unit for Small Stove
Authors: Michal Spilacek, Marian Brazdil, Otakar Stelcl, Jiri Pospisil
Abstract:
This paper shows an experimental testing of a small unit for combustion of solid fuels, such as charcoal and wood logs, that can provide electricity. One of the concepts is that the unit does not require qualified personnel for its operation. The unit itself is composed of two main parts. The design requires a heat producing stove and electricity producing thermoelectric generator. After the construction the unit was tested and the results show that the emission release is within the legislative requirements for emission production and environmental protection. That qualifies such unit for indoor application.
Keywords: Micro-cogeneration, thermoelectric generator, biomass combustion, wood stove.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2440952 Modeling and Analysis of a Cruise Control System
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 2362951 Fuzzy Adjacency Matrix in Graphs
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 2373950 Magnetoviscous Effects on Axi-Symmetric Ferrofluid Flow over a Porous Rotating Disk with Suction/Injection
Authors: Vikas Kumar
Abstract:
The present study is carried out to investigate the magneto-viscous effects on incompressible ferrofluid flow over a porous rotating disc with suction or injection on the surface of the disc subjected to a magnetic field. The flow under consideration is axi-symmetric steady ferrofluid flow of electrically non-conducting fluid. Karman’s transformation is used to convert the governing boundary layer equations involved in the problem to a system of non linear coupled differential equations. The solution of this system is obtained by using power series approximation. The flow characteristics i.e. radial, tangential, axial velocities and boundary layer displacement thickness are calculated for various values of MFD (magnetic field dependent) viscosity and for different values of suction injection parameter. Besides this, skin friction coefficients are also calculated on the surface of the disk. The results thus obtained are presented numerically and graphically in the paper.
Keywords: Axi-symmetric, ferrofluid, magnetic field, porous rotating disk.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2055949 An Improved Construction Method for MIHCs on Cycle Composition Networks
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 1389948 Syntactic Recognition of Distorted Patterns
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 1395947 Unit Root Tests Based On the Robust Estimator
Authors: Wararit Panichkitkosolkul
Abstract:
The unit root tests based on the robust estimator for the first-order autoregressive process are proposed and compared with the unit root tests based on the ordinary least squares (OLS) estimator. The percentiles of the null distributions of the unit root test are also reported. The empirical probabilities of Type I error and powers of the unit root tests are estimated via Monte Carlo simulation. Simulation results show that all unit root tests can control the probability of Type I error for all situations. The empirical power of the unit root tests based on the robust estimator are higher than the unit root tests based on the OLS estimator.
Keywords: Autoregressive, Ordinary least squares, Type I error, Power of the test, Monte Carlo simulation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1788946 Low Complexity Regular LDPC codes for Magnetic Storage Devices
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 2112945 Lower Bounds of Some Small Ramsey Numbers
Authors: Decha Samana, Vites Longani
Abstract:
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph. We construct the circulant graphs and use them to obtain lower bounds of some small Ramsey numbers.Keywords: Lower bound, Ramsey numbers, Graphs, Distance line.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1374