Search results for: split graphs
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 728

Search results for: split graphs

578 Identity of Cultural Food: A Case Study of Traditional Mon Cuisine in Bangkok, Thailand

Authors: Saruda Nitiworakarn

Abstract:

This research aims to identify traditional Mon cuisines as well as gather and classify traditional cuisines of Mon communities in Bangkok. The studying of this research is used by methodology of the quantitative research. Using the questionnaire as the method in collecting information from sampling totally amount of 450 persons analyzed via frequency, percentage and mean value. The results showed that a variety of traditional Mon cuisines of Bangkok could split into 6 categories of meat diet with 54 items and 6 categories of desserts with 19 items.

Keywords: cultural identity, traditional food, Mon cuisine, Thailand

Procedia PDF Downloads 286
577 Developing a Structured Example Space for Finding the Collision Points of Functions and Their Inverse

Authors: M. Saeed, A. Shahidzadeh

Abstract:

Interaction between teachers and learners requires applying a set of samples (examples) which helps to create coordination between the goals and methods. The main result and achievement and application of samples (examples) are that they can bring the teacher and learner to a shared understanding of the concept. mathematical concepts, and also one of the challenging issues in the discussion of the function is to find the collision points of functions of and, regarding that the example space of teachers is different in this issue, this paper aims to present an example space including several problems of the secondary school with the help of intuition and drawing various graphs of functions of and for more familiarity of teachers.

Keywords: inverse function, educational example, Mathematic example, example space

Procedia PDF Downloads 150
576 Existence and Construction of Maximal Rectangular Duals

Authors: Krishnendra Shekhawat

Abstract:

Given a graph G = (V, E), a rectangular dual of G represents the vertices of G by a set of interior-disjoint rectangles such that two rectangles touch if and only if there is an edge between the two corresponding vertices in G. Rectangular duals do not exist for every graph, so we can define maximal rectangular duals. A maximal rectangular dual is a rectangular dual of a graph G such that there exists no graph G ′ with a rectangular dual where G is a subgraph of G ′. In this paper, we enumerate all maximal rectangular duals (or, to be precise, the corresponding planar graphs) up to six nodes and presents a necessary condition for the existence of a rectangular dual. This work allegedly has applications in integrated circuit design and architectural floor plans.

Keywords: adjacency, degree sequence, dual graph, rectangular dual

Procedia PDF Downloads 232
575 Survey Paper on Graph Coloring Problem and Its Application

Authors: Prateek Chharia, Biswa Bhusan Ghosh

Abstract:

Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network.

Keywords: graph coloring, greedy coloring, heuristic search, edge table, sudoku as a graph coloring problem

Procedia PDF Downloads 510
574 Split Health System for Diabetes Care in Urban Area: Experience from an Action Research Project in an Urban Poor Neighborhood in Bengaluru

Authors: T. S. Beerenahally, S. Amruthavalli, C. M. Munegowda, Leelavathi, Nagarathna

Abstract:

Introduction: In majority of urban India, the health system is split between different authorities being responsible for the health care of urban population. We believe that, apart from poor awareness and financial barriers to care, there are other health system barriers which affect quality and access to care for people with diabetes. In this paper, we attempted to identify health system complexity that determines access to public health system for diabetes care in KG Halli, a poor urban neighborhood in Bengaluru. The KG Halli has been a locus of a health systems research from 2009 to 2015. Methodology: The source of data is from the observational field-notes written by research team as part of urban health action research project (UHARP). Field notes included data from the community and the public primary care center. The data was generated by the community health assistants and the other research team members during regular home visits and interaction with individuals who self-reported to be diabetic over four years as part of UHARP. Results: It emerged during data analysis that the patients were not keen on utilizing primary public health center for many reasons. Patient has felt that the service provided at the center was not integrated. There was lack of availability of medicines, with a regular stock out of medicines in a year and laboratory service for investigation was limited. Many of them said that the time given by the providers was not sufficient and there was also a feeling of providers not listening to them attentively. The power dynamics played a huge role in communication. Only the consultation was available for free of cost at the public primary care center. The patient had to spend for the investigations and the major portion for medicine. Conclusion: Diabetes is a chronic disease that poses an important emerging public health concern. Most of the financial burden is borne by the family as the public facilities have failed to provide free care in India. Our study indicated various factors including individual beliefs, stigma and financial constraints affecting compliance to diabetes care.

Keywords: diabetes care, disintegrated health system, quality of care, urban health

Procedia PDF Downloads 138
573 Issues in Travel Demand Forecasting

Authors: Huey-Kuo Chen

Abstract:

Travel demand forecasting including four travel choices, i.e., trip generation, trip distribution, modal split and traffic assignment constructs the core of transportation planning. In its current application, travel demand forecasting has associated with three important issues, i.e., interface inconsistencies among four travel choices, inefficiency of commonly used solution algorithms, and undesirable multiple path solutions. In this paper, each of the three issues is extensively elaborated. An ideal unified framework for the combined model consisting of the four travel choices and variable demand functions is also suggested. Then, a few remarks are provided in the end of the paper.

Keywords: travel choices, B algorithm, entropy maximization, dynamic traffic assignment

Procedia PDF Downloads 420
572 Adapting Depression and Anxiety Questionnaire for Children into Turkish: Reliability and Validity Studies

Authors: İsmail Seçer

Abstract:

Although depression and anxiety disorders are considered to be adult disorders, the evidence obtained from several studies conducted recently shows that the roots of depression and anxiety disorders go back to childhood years. Thus, it is thought that analyzing depressive symptoms and anxiety disorders observed in the childhood is an important necessity. In the direction of the problem status of the study, the purpose of this study is to adapt anxiety and depression questionnaire for children into Turkish culture and analyze the psychometric characteristics of it on clinical and nonclinical samples separately. The study is a descriptive survey research. The study was conducted on two different sample groups, clinical and nonclinical. The clinical sample is formed of 205 individuals and the nonclinical sample is formed of 630 individuals. Through the study, anxiety and depression questionnaire for children, anxiety sensitivity index and obsessive compulsive disorder questionnaire for children were used. Experts’ opinions were asked to provide language validity of the scale. Confirmatory factor analysis and criterion-related validity to analyze construct validity and internal consistency and split-half reliability analyses were done for reliability. In the direction of experts’ opinions, construct validity of the scale was analyzed with simple confirmatory factor analysis and it was determined that the model fit of the two-factor structure of the scale gives good fit on both the clinical and nonclinical samples after determining that the language validity of the scale is provided. In criterion-related validity, it was determined that there are positive and significant relations between anxiety and depression questionnaire for children and anxiety sensitivity and obsessive compulsive disorder. The results of internal consistency and half-split reliability analyses also show that the scale has adequate reliability value. It can be said that depression and anxiety questionnaire for children which was adapted to determine depressive symptoms and anxiety disorders observed in childhood has adequate reliability and validity values and it can be used in future studies. It can be recommended that the psychometric characteristics of the scale can be analyzed and reported on new samples in the future studies.

Keywords: scale adapting, construct validity, confirmatory factor analysis, childhood depression

Procedia PDF Downloads 307
571 Development of Numerical Method for Mass Transfer across the Moving Membrane with Selective Permeability: Approximation of the Membrane Shape by Level Set Method for Numerical Integral

Authors: Suguru Miyauchi, Toshiyuki Hayase

Abstract:

Biological membranes have selective permeability, and the capsules or cells enclosed by the membrane show the deformation by the osmotic flow. This mass transport phenomenon is observed everywhere in a living body. For the understanding of the mass transfer in a body, it is necessary to consider the mass transfer phenomenon across the membrane as well as the deformation of the membrane by a flow. To our knowledge, in the numerical analysis, the method for mass transfer across the moving membrane has not been established due to the difficulty of the treating of the mass flux permeating through the moving membrane with selective permeability. In the existing methods for the mass transfer across the membrane, the approximate delta function is used to communicate the quantities on the interface. The methods can reproduce the permeation of the solute, but cannot reproduce the non-permeation. Moreover, the computational accuracy decreases with decreasing of the permeable coefficient of the membrane. This study aims to develop the numerical method capable of treating three-dimensional problems of mass transfer across the moving flexible membrane. One of the authors developed the numerical method with high accuracy based on the finite element method. This method can capture the discontinuity on the membrane sharply due to the consideration of the jumps in concentration and concentration gradient in the finite element discretization. The formulation of the method takes into account the membrane movement, and both permeable and non-permeable membranes can be treated. However, searching the cross points of the membrane and fluid element boundaries and splitting the fluid element into sub-elements are needed for the numerical integral. Therefore, cumbersome operation is required for a three-dimensional problem. In this paper, we proposed an improved method to avoid the search and split operations, and confirmed its effectiveness. The membrane shape was treated implicitly by introducing the level set function. As the construction of the level set function, the membrane shape in one fluid element was expressed by the shape function of the finite element method. By the numerical experiment, it was found that the shape function with third order appropriately reproduces the membrane shapes. The same level of accuracy compared with the previous method using search and split operations was achieved by using a number of sampling points of the numerical integral. The effectiveness of the method was confirmed by solving several model problems.

Keywords: finite element method, level set method, mass transfer, membrane permeability

Procedia PDF Downloads 224
570 Economic of Chickpea Cultivars as Influenced by Sowing Time and Seed Rate

Authors: Indu Bala Sethi, Meena Sewhag, Rakesh Kumar, Parveen Kumar

Abstract:

Field experiment was conducted at Pulse Research Area of CCS Haryana Agricultural University, Hisar during rabi 2012-13 to study the economics of chickpea cultivars as influenced by sowing time and seed rate on sandy loam soils under irrigated conditions. The factorial experiment consisting of 24 treatment combinations with two sowing time (1st fortnight of November and 1st fortnight of December.) and four cultivars (H09-23, H08-18, C-235 and HC-1) kept in main plots while three seed rates viz. 40 kg ha-1, 50 kg ha-1 and 60 kg ha-1 was laid out in split plot design with three replications. The crop was sown with common row spacing of 30 cm as per the dates of sowing. The fertilizer was applied in the form of di- ammonium phosphate. The soil of the experimental site was deep sandy loam having pH of 7.9, EC of 0.13 dS/m and low in organic carbon (0.34%), low in available N status (193.36 kg ha-1), medium in available P2O5 (32.18 kg ha-1) and high in available K2O (249.67 kg ha-1). The crop was irrigated as and when required so as to maintain adequate soil moisture in the root zone The crop was sprayed with monocrotophos (1.25 l/ha) at initiation of flowering and at pod filling stage to protect the crop from pod borer attack. The yield was measured at the time of harvest. The cost of field preparation, sowing of seeds, thinning, weeding, plant protection, harvesting and cleaning contributed to fixed cost. The experiment was laid out in a split plot design with two sowing time (1st fortnight of November and 1st fortnight of December.) and four cultivars (H09-23, H08-18, C-235 and HC-1) kept in main plots while three seed rates viz. 40 kg ha-1, 50 kg ha-1 and 60 kg ha-1 were kept in subplots and replicated thrice. Results revealed that 1st fortnight of November sowing recorded significantly higher gross (Rs.1, 01,254 ha-1), net returns (Rs. 68,504 ha-1) and BC (3.09) ratio as compared to delayed crop of chickpea. Highest gross (Rs.91826 ha-1), net returns (Rs. 59076ha-1) and BC ratio (2.81) was recorded with H08-18. Higher value of cost of cultivation of chickpea was observed in higher seed rate than the lower ones. However no significant variation in net and gross returns was observed due to seed rates. Highest BC (2.72) ratio was recorded with 50 kg ha-1 which differs significantly from 60 kg ha-1 but was at par with 40 kg ha-1. This is because of higher grain yield obtained with 50 kg ha-1 seed rate. Net profit for farmers growing chickpea with seed rate of 50 kg ha-1 was higher than the farmers growing chickpea with seed rate of 40 and 60 kg ha.

Keywords: chickpea, cultivars, seed rate, sowing time

Procedia PDF Downloads 417
569 A Study of Families of Bistar and Corona Product of Graph: Reverse Topological Indices

Authors: Gowtham Kalkere Jayanna, Mohamad Nazri Husin

Abstract:

Graph theory, chemistry, and technology are all combined in cheminformatics. The structure and physiochemical properties of organic substances are linked using some useful graph invariants and the corresponding molecular graph. In this paper, we study specific reverse topological indices such as the reverse sum-connectivity index, the reverse Zagreb index, the reverse arithmetic-geometric, and the geometric-arithmetic, the reverse Sombor, the reverse Nirmala indices for the bistar graphs B (n: m) and the corona product Kₘ∘Kₙ', where Kₙ' Represent the complement of a complete graph Kₙ.

Keywords: reverse topological indices, bistar graph, the corona product, graph

Procedia PDF Downloads 57
568 Methodology for the Analysis of Energy Efficiency in Pneumatics Systems

Authors: Mario Lupaca, Karol Munoz, Victor De Negri

Abstract:

The present article presents a methodology for the improvement of the energy efficiency in pneumatic systems through the restoring of air. In this way, three techniques of expansion of a cylinder are identified: Expansion using the air of the compressor (conventional), restoring the air (efficient), and combining the air of the compressor and the restored air (hybrid). The methodology starts with the development of the GRAFCET of the system so that it can be decided whether to expand the cylinder in a conventional, efficient, or hybrid way. The methodology can be applied to any case. Finally, graphs of comparison between the three methods of expansion with certain cylinder strokes and workloads are presented, to facilitate the subsequent selection of one system or another.

Keywords: energetic, efficiency, GRAFCET, methodology, pneumatic

Procedia PDF Downloads 281
567 Talent-to-Vec: Using Network Graphs to Validate Models with Data Sparsity

Authors: Shaan Khosla, Jon Krohn

Abstract:

In a recruiting context, machine learning models are valuable for recommendations: to predict the best candidates for a vacancy, to match the best vacancies for a candidate, and compile a set of similar candidates for any given candidate. While useful to create these models, validating their accuracy in a recommendation context is difficult due to a sparsity of data. In this report, we use network graph data to generate useful representations for candidates and vacancies. We use candidates and vacancies as network nodes and designate a bi-directional link between them based on the candidate interviewing for the vacancy. After using node2vec, the embeddings are used to construct a validation dataset with a ranked order, which will help validate new recommender systems.

Keywords: AI, machine learning, NLP, recruiting

Procedia PDF Downloads 58
566 A Graph SEIR Cellular Automata Based Model to Study the Spreading of a Transmittable Disease

Authors: Natasha Sharma, Kulbhushan Agnihotri

Abstract:

Cellular Automata are discrete dynamical systems which are based on local character and spatial disparateness of the spreading process. These factors are generally neglected by traditional models based on differential equations for epidemic spread. The aim of this work is to introduce an SEIR model based on cellular automata on graphs to imitate epidemic spreading. Distinctively, it is an SEIR-type model where the population is divided into susceptible, exposed, infected and recovered individuals. The results obtained from simulations are in accordance with the spreading behavior of a real time epidemics.

Keywords: cellular automata, epidemic spread, graph, susceptible

Procedia PDF Downloads 435
565 Brinkman Flow Past an Impervious Spheroid under Stokesian Assumption

Authors: D. Satish Kumar, T. K. V. Iyengar

Abstract:

In this paper, we study the Brinkman flow, under Stokesian assumption, past an impervious prolate spheroid and obtain the expressions for the velocity and pressure fields in terms of Legendre functions, Associated Legendre functions, prolate radial and angular spheroidal wave functions. We further obtain an expression for the drag experienced by the spheroid and numerically study its variation with respect to the flow parameters and display the results through graphs.

Keywords: prolate spheoid, porous medium, stokesian assumption, brinkman model, velocity, pressure, drag

Procedia PDF Downloads 504
564 Synthesis and Characterization of Zeolite/Fe3O4 Nanocomposite Material and Investigation of Its Catalytic Reaction

Authors: Mojgan Zendehdel, Safura Molla Mohammad Zamani

Abstract:

In this paper, Fe3O4/NaY zeolite nanocomposite with different molar ratio were successfully synthesized and characterized using FT-IR, XRD, TGA, SEM and VSM techniques. The SEM graphs showed that much of Fe3O4 was successfully coated by the NaY zeolite layer. Also, the results show that the magnetism of the products is stable with added zeolite. The catalytic effect of nanocomposite investigated for esterification reaction under solvent-free conditions. Hence, the effect of the catalyst amount, reaction time, reaction temperature and reusability of catalyst were considered and nanocomposite that created from zeolite and 16.6 percent of Fe3O4 showed the highest yield. The catalyst can be easily separated from reaction with the magnet and it can also be used for several times.

Keywords: zeolite, magnetic, nanocompsite, esterification

Procedia PDF Downloads 429
563 Pay Per Click Attribution: Effects on Direct Search Traffic and Purchases

Authors: Toni Raurich-Marcet, Joan Llonch-Andreu

Abstract:

This research is focused on the relationship between Search Engine Marketing (SEM) and traditional advertising. The dominant assumption is that SEM does not help brand awareness and only does it in session as if it were the cost of manufacturing the product being sold. The study is methodologically developed using an experiment where the effects were determined to analyze the billboard effect. The research allowed the cross-linking of theoretical and empirical knowledge on digital marketing. This paper has validated this marketing generates retention as traditional advertising would by measuring brand awareness and its improvements. This changes the way performance and brand campaigns are split within marketing departments, effectively rebalancing budgets moving forward.

Keywords: attribution, performance marketing, SEM, marketplaces

Procedia PDF Downloads 100
562 Quantifying Automation in the Architectural Design Process via a Framework Based on Task Breakdown Systems and Recursive Analysis: An Exploratory Study

Authors: D. M. Samartsev, A. G. Copping

Abstract:

As with all industries, architects are using increasing amounts of automation within practice, with approaches such as generative design and use of AI becoming more commonplace. However, the discourse on the rate at which the architectural design process is being automated is often personal and lacking in objective figures and measurements. This results in confusion between people and barriers to effective discourse on the subject, in turn limiting the ability of architects, policy makers, and members of the public in making informed decisions in the area of design automation. This paper proposes the use of a framework to quantify the progress of automation within the design process. The use of a reductionist analysis of the design process allows it to be quantified in a manner that enables direct comparison across different times, as well as locations and projects. The methodology is informed by the design of this framework – taking on the aspects of a systematic review but compressed in time to allow for an initial set of data to verify the validity of the framework. The use of such a framework of quantification enables various practical uses such as predicting the future of the architectural industry with regards to which tasks will be automated, as well as making more informed decisions on the subject of automation on multiple levels ranging from individual decisions to policy making from governing bodies such as the RIBA. This is achieved by analyzing the design process as a generic task that needs to be performed, then using principles of work breakdown systems to split the task of designing an entire building into smaller tasks, which can then be recursively split further as required. Each task is then assigned a series of milestones that allow for the objective analysis of its automation progress. By combining these two approaches it is possible to create a data structure that describes how much various parts of the architectural design process are automated. The data gathered in the paper serves the dual purposes of providing the framework with validation, as well as giving insights into the current situation of automation within the architectural design process. The framework can be interrogated in many ways and preliminary analysis shows that almost 40% of the architectural design process has been automated in some practical fashion at the time of writing, with the rate at which progress is made slowly increasing over the years, with the majority of tasks in the design process reaching a new milestone in automation in less than 6 years. Additionally, a further 15% of the design process is currently being automated in some way, with various products in development but not yet released to the industry. Lastly, various limitations of the framework are examined in this paper as well as further areas of study.

Keywords: analysis, architecture, automation, design process, technology

Procedia PDF Downloads 75
561 Construction of Graph Signal Modulations via Graph Fourier Transform and Its Applications

Authors: Xianwei Zheng, Yuan Yan Tang

Abstract:

Classical window Fourier transform has been widely used in signal processing, image processing, machine learning and pattern recognition. The related Gabor transform is powerful enough to capture the texture information of any given dataset. Recently, in the emerging field of graph signal processing, researchers devoting themselves to develop a graph signal processing theory to handle the so-called graph signals. Among the new developing theory, windowed graph Fourier transform has been constructed to establish a time-frequency analysis framework of graph signals. The windowed graph Fourier transform is defined by using the translation and modulation operators of graph signals, following the similar calculations in classical windowed Fourier transform. Specifically, the translation and modulation operators of graph signals are defined by using the Laplacian eigenvectors as follows. For a given graph signal, its translation is defined by a similar manner as its definition in classical signal processing. Specifically, the translation operator can be defined by using the Fourier atoms; the graph signal translation is defined similarly by using the Laplacian eigenvectors. The modulation of the graph can also be established by using the Laplacian eigenvectors. The windowed graph Fourier transform based on these two operators has been applied to obtain time-frequency representations of graph signals. Fundamentally, the modulation operator is defined similarly to the classical modulation by multiplying a graph signal with the entries in each Fourier atom. However, a single Laplacian eigenvector entry cannot play a similar role as the Fourier atom. This definition ignored the relationship between the translation and modulation operators. In this paper, a new definition of the modulation operator is proposed and thus another time-frequency framework for graph signal is constructed. Specifically, the relationship between the translation and modulation operations can be established by the Fourier transform. Specifically, for any signal, the Fourier transform of its translation is the modulation of its Fourier transform. Thus, the modulation of any signal can be defined as the inverse Fourier transform of the translation of its Fourier transform. Therefore, similarly, the graph modulation of any graph signal can be defined as the inverse graph Fourier transform of the translation of its graph Fourier. The novel definition of the graph modulation operator established a relationship of the translation and modulation operations. The new modulation operation and the original translation operation are applied to construct a new framework of graph signal time-frequency analysis. Furthermore, a windowed graph Fourier frame theory is developed. Necessary and sufficient conditions for constructing windowed graph Fourier frames, tight frames and dual frames are presented in this paper. The novel graph signal time-frequency analysis framework is applied to signals defined on well-known graphs, e.g. Minnesota road graph and random graphs. Experimental results show that the novel framework captures new features of graph signals.

Keywords: graph signals, windowed graph Fourier transform, windowed graph Fourier frames, vertex frequency analysis

Procedia PDF Downloads 311
560 A Sub-Scalar Approach to the MIPS Architecture

Authors: Kumar Sambhav Pandey, Anamika Singh

Abstract:

The continuous researches in the field of computer architecture basically aims at accelerating the computational speed and to gain enhanced performance. In this era, the superscalar, sub-scalar concept has not gained enough attention for improving the computation performance. In this paper, we have presented a sub-scalar approach to utilize the parallelism present with in the data while processing. The main idea is to split the data into individual smaller entities and these entities are processed with a defined known set of instructions. This sub-scalar approach to the MIPS architecture can bring out significant improvement in the computational speedup. MIPS-I is the basic design taken in consideration for the development of sub-scalar MIPS64 for increasing the instruction level parallelism (ILP) and resource utilization.

Keywords: dataword, MIPS, processor, sub-scalar

Procedia PDF Downloads 509
559 Thermal Radiation and Chemical Reaction Effects on MHD Casson Fluid Past a Permeable Stretching Sheet in a Porous Medium

Authors: Y. Sunita Rani, Y. Hari Krishna, M. V. Ramana Murthy, K. Sudhaker Reddy

Abstract:

This article studied effects of radiation and chemical reaction on MHD casson fluoid flow past a Permeable Stretching Sheet in a Porous Medium. Suitable transformations are considered to transform the governing partial differential equations as ordinary ones and then solved by the numerical procedures like Runge- Kutta – Fehlberg shooting technique method. The effects of various governing parameters, on the velocity, temperature and concentration are displayed through graphs and discussed numerically.

Keywords: MHD, Casson fluid, porous medium, permeable stretching sheet

Procedia PDF Downloads 94
558 Location Quotient Analysis: Case Study

Authors: Seyed Habib A. Rahmati, Mohamad Hasan Sadeghpour, Parsa Fallah Sheikhlari

Abstract:

Location quotient (LQ) is a comparison technique that represents emphasized economic structure of single zone versus the standard area to identify specialty for every zone. In another words, the exact calculation of this metric can show the main core competencies and critical capabilities of an area to the decision makers. This research focus on the exact calculation of the LQ for an Iranian Province called Qazvin and within a case study introduces LQ of the capable industries of Qazvin. Finally, through different graphs and tables, it creates an opportunity to compare the recognized capabilities.

Keywords: location quotient, case study, province analysis, core competency

Procedia PDF Downloads 618
557 Optimization of Black-Litterman Model for Portfolio Assets Allocation

Authors: A. Hidalgo, A. Desportes, E. Bonin, A. Kadaoui, T. Bouaricha

Abstract:

Present paper is concerned with portfolio management with Black-Litterman (B-L) model. Considered stocks are exclusively limited to large companies stocks on US market. Results obtained by application of the model are presented. From analysis of collected Dow Jones stock data, remarkable explicit analytical expression of optimal B-L parameter τ, which scales dispersion of normal distribution of assets mean return, is proposed in terms of standard deviation of covariance matrix. Implementation has been developed in Matlab environment to split optimization in Markovitz sense from specific elements related to B-L representation.

Keywords: Black-Litterman, Markowitz, market data, portfolio manager opinion

Procedia PDF Downloads 236
556 From Convexity in Graphs to Polynomial Rings

Authors: Ladznar S. Laja, Rosalio G. Artes, Jr.

Abstract:

This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established.

Keywords: convex subgraph, convex index, generating function, polynomial ring

Procedia PDF Downloads 184
555 A Reduced Distributed Sate Space for Modular Petri Nets

Authors: Sawsen Khlifa, Chiheb AMeur Abid, Belhassan Zouari

Abstract:

Modular verification approaches have been widely attempted to cope with the well known state explosion problem. This paper deals with the modular verification of modular Petri nets. We propose a reduced version for the modular state space of a given modular Petri net. The new structure allows the creation of smaller modular graphs. Each one draws the behavior of the corresponding module and outlines some global information. Hence, this version helps to overcome the explosion problem and to use less memory space. In this condensed structure, the verification of some generic properties concerning one module is limited to the exploration of its associated graph.

Keywords: distributed systems, modular verification, petri nets, state space explosition

Procedia PDF Downloads 84
554 The Influence of Music Education and the Order of Sounds on the Grouping of Sounds into Sequences of Six Tones

Authors: Adam Rosiński

Abstract:

This paper discusses an experiment conducted with two groups of participants, composed of musicians and non-musicians, in order to investigate the impact of the speed of a sound sequence and the order of sounds on the grouping of sounds into sequences of six tones. Significant differences were observed between musicians and non-musicians with respect to the threshold sequence speed at which the sequence was split into two streams. The differences in the results for the two groups suggest that the musical education of the participating listeners may be a vital factor. The criterion of musical education should be taken into account during experiments so that the results obtained are reliable, uniform, and free from interpretive errors.

Keywords: auditory scene analysis, education, hearing, psychoacoustics

Procedia PDF Downloads 65
553 The Effects of SMS on the Formal Writings of the Students: A Comparative Study among the Students of Different Departments of IUB

Authors: Sumaira Saleem

Abstract:

This study reveals that the use of SMS effect the formal writing of the students. SMS is in vogue sine the last decade but its detrimental effects are effecting not only to the set norms but also deviant forms of expressions have come into the community to which all are not acquainted and it creates a hurdle in effective communication. It also determines the reasons behind the usage of SMS practices in the formal writings like in assignments and examinations. For this study a questionnaire was designed for faculty and students the data was collected from The Islamia University Bahawalpur and the formal work of the students was also collected to check the manifestation of SMS practices in writings. Data was analysed on excel sheet and the tables and graphs are used to explain the ratios and percentages of SMS usage. The results show that the usage of SMS has very strong effect upon the students writing.

Keywords: technology, writing, effects, SMS

Procedia PDF Downloads 352
552 ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins in Protein Interaction Networks

Authors: Jamaludin Sallim, Rozlina Mohamed, Roslina Abdul Hamid

Abstract:

In this paper, we proposed an Ant Colony Optimization (ACO) algorithm together with Traveling Salesman Problem (TSP) approach to investigate the clustering problem in Protein Interaction Networks (PIN). We named this combination as ACOPIN. The purpose of this work is two-fold. First, to test the efficacy of ACO in clustering PIN and second, to propose the simple generalization of the ACO algorithm that might allow its application in clustering proteins in PIN. We split this paper to three main sections. First, we describe the PIN and clustering proteins in PIN. Second, we discuss the steps involved in each phase of ACO algorithm. Finally, we present some results of the investigation with the clustering patterns.

Keywords: ant colony optimization algorithm, searching algorithm, protein functional module, protein interaction network

Procedia PDF Downloads 570
551 Robust Electrical Segmentation for Zone Coherency Delimitation Base on Multiplex Graph Community Detection

Authors: Noureddine Henka, Sami Tazi, Mohamad Assaad

Abstract:

The electrical grid is a highly intricate system designed to transfer electricity from production areas to consumption areas. The Transmission System Operator (TSO) is responsible for ensuring the efficient distribution of electricity and maintaining the grid's safety and quality. However, due to the increasing integration of intermittent renewable energy sources, there is a growing level of uncertainty, which requires a faster responsive approach. A potential solution involves the use of electrical segmentation, which involves creating coherence zones where electrical disturbances mainly remain within the zone. Indeed, by means of coherent electrical zones, it becomes possible to focus solely on the sub-zone, reducing the range of possibilities and aiding in managing uncertainty. It allows faster execution of operational processes and easier learning for supervised machine learning algorithms. Electrical segmentation can be applied to various applications, such as electrical control, minimizing electrical loss, and ensuring voltage stability. Since the electrical grid can be modeled as a graph, where the vertices represent electrical buses and the edges represent electrical lines, identifying coherent electrical zones can be seen as a clustering task on graphs, generally called community detection. Nevertheless, a critical criterion for the zones is their ability to remain resilient to the electrical evolution of the grid over time. This evolution is due to the constant changes in electricity generation and consumption, which are reflected in graph structure variations as well as line flow changes. One approach to creating a resilient segmentation is to design robust zones under various circumstances. This issue can be represented through a multiplex graph, where each layer represents a specific situation that may arise on the grid. Consequently, resilient segmentation can be achieved by conducting community detection on this multiplex graph. The multiplex graph is composed of multiple graphs, and all the layers share the same set of vertices. Our proposal involves a model that utilizes a unified representation to compute a flattening of all layers. This unified situation can be penalized to obtain (K) connected components representing the robust electrical segmentation clusters. We compare our robust segmentation to the segmentation based on a single reference situation. The robust segmentation proves its relevance by producing clusters with high intra-electrical perturbation and low variance of electrical perturbation. We saw through the experiences when robust electrical segmentation has a benefit and in which context.

Keywords: community detection, electrical segmentation, multiplex graph, power grid

Procedia PDF Downloads 45
550 The Determinants of Corporate Social Responsibility Disclosure Extent and Quality: The Case of Jordan

Authors: Hani Alkayed, Belal Omar, Eileen Roddy

Abstract:

This study focuses on investigating the determinants of Corporate Social Responsibility Disclosure (CSRD) extent and quality in Jordan. The study examines factors that influence CSR disclosure extent and quality, such as corporate characteristics (size, gearing, firm’s age, and industry type), corporate governance (board size, number of meetings, non-executive directors, female directors in the board, family directors in the board, foreign members, audit committee, type of external auditors, and CEO duality) and ownership structure (government ownership, institutional ownership, and ownership concentration). Legitimacy theory is utilised as the main theory for our theoretical framework. A quantitative approach is adopted for this research and content analysis technique is used to gather CSR disclosure extent and quality from the annual reports. The sample is withdrawn from the annual reports of 118 Jordanian companies over the period of 2010-2015. A CSRD index is constructed, and includes the disclosures of the following categories; environmental, human resources, product and consumers, and community involvement. A 7 point-scale measurement was developed to examine the quality of disclosure, were 0= No Disclosures, 1= General disclosures, (Non-monetary), 2= General disclosures, (Non-monetary) with pictures, charts, and graphs 3= Descriptive/ qualitative disclosures, specific details (Non-monetary), 4= Descriptive/ qualitative disclosures, specific details with pictures, charts, and graphs, 5= Numeric disclosures, full descriptions with supporting numbers, 6= Numeric disclosures, full descriptions with supporting numbers, pictures, and Charts. This study fills the gap in the literature regarding CSRD in Jordan, and the fact that all the previous studies have ignored a clear categorisation as a measurement of quality. The result shows that the extent of CSRD is higher than the quality in Jordan. Regarding the determinants of CSR disclosures, the followings were found to have a significant relationship with both extent and quality of CSRD except non-executives, were the significant relationship was found just with the extent of CSRD: board size, non-executive directors, firm’s age, foreign members on the board, number of boards meetings, the presence of audit committees, big 4, government ownership, firm’s size, industry type.

Keywords: content analysis, corporate governance, corporate social responsibility disclosure, Jordan, quality of disclosure

Procedia PDF Downloads 194
549 Generator Subgraphs of the Wheel

Authors: Neil M. Mame

Abstract:

We consider only finite graphs without loops nor multiple edges. Let G be a graph with E(G) = {e1, e2, …., em}. The edge space of G, denoted by ε(G), is a vector space over the field Z2. The elements of ε(G) are all the subsets of E(G). Vector addition is defined as X+Y = X Δ Y, the symmetric difference of sets X and Y, for X, Y ∈ ε(G). Scalar multiplication is defined as 1.X =X and 0.X = Ø for X ∈ ε(G). The set S ⊆ ε(G) is called a generating set if every element ε(G) is a linear combination of the elements of S. For a non-empty set X ∈ ε(G), the smallest subgraph with edge set X is called edge-induced subgraph of G, denoted by G[X]. The set EH(G) = { A ∈ ε(G) : G[A] ≅ H } denotes the uniform set of H with respect to G and εH(G) denotes the subspace of ε(G) generated by EH(G). If εH(G) is generating set, then we call H a generator subgraph of G. This paper gives the characterization for the generator subgraphs of the wheel that contain cycles and gives the necessary conditions for the acyclic generator subgraphs of the wheel.

Keywords: edge space, edge-induced subgraph, generator subgraph, wheel

Procedia PDF Downloads 433