Search results for: neighborhood corona graph
699 Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues
Authors: Ayşe Dilek Maden
Abstract:
For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.Keywords: degree Kirchhoff index, normalized Laplacian eigenvalue, spanning tree, simple connected graph
Procedia PDF Downloads 361698 Towards Carbon-Free Communities: A Compilation of Urban Design Criteria for Sustainable Neighborhoods
Authors: Atefeh Kalantari
Abstract:
The increase in population and energy consumption has caused environmental crises such as the energy crisis, increased pollution, and climate change, all of which have resulted in a decline in the quality of life, especially in urban environments. Iran is one of the developing countries which faces several challenges concerning energy use and environmental sustainability such as air pollution, climate change, and energy security. On the other hand, due to its favorable geographic characteristics, Iran has diverse and accessible renewable sources, which provide appropriate substitutes to reduce dependence on fossil fuels. Sustainable development programs and post-carbon cities rely on implementing energy policies in different sectors of society, particularly, the built environment sector is one of the main ones responsible for energy consumption and carbon emissions for cities. Because of this, several advancements and programs are being implemented to promote energy efficiency for urban planning, and city experts, like others, are looking for solutions to deal with these problems. Among the solutions provided for this purpose, low-carbon design can be mentioned. Among the different scales, the neighborhood can be mentioned as a suitable scale for applying the principles and solutions of low-carbon urban design; Because the neighborhood as a "building unit of the city" includes elements and flows that all affect the number of CO2 emissions. The article aims to provide criteria for designing a low-carbon and carbon-free neighborhood through descriptive methods and secondary data analysis. The ultimate goal is to promote energy efficiency and create a more resilient and livable environment for local residents.Keywords: climate change, low-carbon urban design, carbon-free neighborhood, resilience
Procedia PDF Downloads 72697 India’s Demonetization and Its Impact on Modi’s “Neighborhood First” Policy
Authors: Umang Prajapati
Abstract:
Elected prime minister of India Narendra Modi has very largely focused on improving ties with the neighbors since day one of his regime. This was the most significant initiative to focus on major Asian powers also emphasizing on the two decades old look east policy. The “neighborhood first policy” as termed by the media has been a corner stone in improving ties with the immediate neighbors of the country through several bilateral talks with the nations individually. However, the announcement of demonetisation policy in India, ceasing the usage of 500 and 1000 rupee notes has rattled countries like Nepal, Bangladesh, Bhutan, Sri Lanka and Myanmar who encourage Indian currency parallel to theirs. According to the ministry of commerce and industry (MCI), India’s total trade with neighboring countries stood at US$21.6 in the fiscal year 2015-16, India has good surplus trade surplus with its neighbors and has a strong interest in ensuring smooth trade flows. India might have this benefit, but yet this policy can create issues between India and neighboring countries. The demonetisation policy might benefit in the long run, but in the short run, this might create border issues. While there would be more countries affected by this policy, this paper will emphasize on the problems faced by the countries and the impact of demonetisation on all other neighboring countries.Keywords: bilateral trades, demonetization, neighborhood policy, value of rupee
Procedia PDF Downloads 313696 First-Year Undergraduate Students' Dilemma with Kinematics Graphs
Authors: Itumeleng Phage
Abstract:
Students’ comprehension of graphs may be affected by the characteristics of the discipline in which the graph is used, the type of the task as well as the background of the students who are the readers or interpreters of the graph. This research study investigated these aspects of the graph comprehension of 152 first-year undergraduate physics students by comparing their responses to corresponding tasks in the mathematics and physics disciplines. The discipline characteristics were analysed for four task-related constructs namely coordinates, representations, area and slope. Students’ responses to corresponding visual decoding and judgement tasks set in mathematics and kinematics contexts were statistically compared. The effects of the participants’ gender, year of school completion and study course were determined as reader characteristics. The results of the empirical study indicated that participants generally transferred their mathematics knowledge on coordinates and representation of straight line graphs to the physics contexts, but not in the cases of parabolic and hyperbolic functions or area under graphs. Insufficient understanding of the slope concept contributed to weak performances on this construct in both mathematics and physics contexts. Discipline characteristics seem to play a vital role in students’ understanding, while reader characteristics had insignificant to medium effects on their responses.Keywords: kinematics graph, discipline characteristics, constructs, coordinates, representations, area and slope
Procedia PDF Downloads 253695 Coupling Large Language Models with Disaster Knowledge Graphs for Intelligent Construction
Authors: Zhengrong Wu, Haibo Yang
Abstract:
In the context of escalating global climate change and environmental degradation, the complexity and frequency of natural disasters are continually increasing. Confronted with an abundance of information regarding natural disasters, traditional knowledge graph construction methods, which heavily rely on grammatical rules and prior knowledge, demonstrate suboptimal performance in processing complex, multi-source disaster information. This study, drawing upon past natural disaster reports, disaster-related literature in both English and Chinese, and data from various disaster monitoring stations, constructs question-answer templates based on large language models. Utilizing the P-Tune method, the ChatGLM2-6B model is fine-tuned, leading to the development of a disaster knowledge graph based on large language models. This serves as a knowledge database support for disaster emergency response.Keywords: large language model, knowledge graph, disaster, deep learning
Procedia PDF Downloads 43694 An Integrated Visualization Tool for Heat Map and Gene Ontology Graph
Authors: Somyung Oh, Jeonghyeon Ha, Kyungwon Lee, Sejong Oh
Abstract:
Microarray is a general scheme to find differentially expressed genes for target concept. The output is expressed by heat map, and biologists analyze related terms of gene ontology to find some characteristics of differentially expressed genes. In this paper, we propose integrated visualization tool for heat map and gene ontology graph. Previous two methods are used by static manner and separated way. Proposed visualization tool integrates them and users can interactively manage it. Users may easily find and confirm related terms of gene ontology for given differentially expressed genes. Proposed tool also visualize connections between genes on heat map and gene ontology graph. We expect biologists to find new meaningful topics by proposed tool.Keywords: heat map, gene ontology, microarray, differentially expressed gene
Procedia PDF Downloads 310693 Cars in a Neighborhood: A Case of Sustainable Living in Sector 22 Chandigarh
Authors: Maninder Singh
Abstract:
The Chandigarh city is under the strain of exponential growth of car density across various neighborhood. The consumerist nature of society today is to be blamed for this menace because everyone wants to own and ride a car. Car manufacturers are busy selling two or more cars per household. The Regional Transport Offices are busy issuing as many licenses to new vehicles as they can in order to generate revenue in the form of Road Tax. The car traffic in the neighborhoods of Chandigarh has reached a tipping point. There needs to be a more empirical and sustainable model of cars per household, which should be based on specific parameters of livable neighborhoods. Sector 22 in Chandigarh is one of the first residential sectors to be established in the city. There is scope to think, reflect, and work out a method to know how many cars we need to sell our citizens before we lose the argument to traffic problems, parking problems, and road rage. This is where the true challenge of a planner or a designer of the city lies. Currently, in Chandigarh city, there are no clear visible answers to this problem. The way forward is to look at spatial mapping, planning, and design of car parking units to address the problem, rather than suggesting extreme measures of banning cars (short-term) or promoting plans for citywide transport (very long-term). This is a chance to resolve the problem with a pragmatic approach from a citizen’s perspective, instead of an orthodox development planner’s methodology. Since citizens are at the center of how the problem is to be addressed, acceptable solutions are more likely to emerge from the car and traffic problem as defined by the citizens. Thus, the idea and its implementation would be interesting in comparison to the known academic methodologies. The novel and innovative process would lead to a more acceptable and sustainable approach to the issue of number of car parks in the neighborhood of Chandigarh city.Keywords: cars, Chandigarh, neighborhood, sustainable living, walkability
Procedia PDF Downloads 145692 The SOCI Strategy as a Method to Meet the Innovation Challenges of COVID-19
Authors: Victoria Wolf, Renata Dobrucka, Robert Prezkop, Stephan Haubold
Abstract:
The COVID-19 causes a worldwide crisis and has an impact in every dimension of the economy. Organizations with the ability to adapt to new developments and which innovate solutions for the disrupted world during and after the Corona crises have the opportunity to not only survive the crisis but rather to use new trends to implement new business models and gain advantage. In this context, startups seem to have better opportunities to manage the Corona crisis through their innovation-based nature. The main result of this paper is the understanding that by applying a startup orientated innovation (SOCI) strategy, established companies can be motivated to meet the challenge of COVID-19 in a similar way like startups. This result can be achieved by describing the role of innovation and a SOCI strategy as helpful methods for organizations to meet the coming challenges during and after the COVID-19 epidemics. In addition to this, this paper presents a practical application of SOCI through the PANDA approach of the Fresenius University of Applied Sciences in Germany and discuss it in the context of COVID-19 as an exemplary successful real-world implementation of SOCI strategy.Keywords: Covid-19, innovation, open innovation, startup, soci framework
Procedia PDF Downloads 228691 Software Component Identification from Its Object-Oriented Code: Graph Metrics Based Approach
Authors: Manel Brichni, Abdelhak-Djamel Seriai
Abstract:
Systems are increasingly complex. To reduce their complexity, an abstract view of the system can simplify its development. To overcome this problem, we propose a method to decompose systems into subsystems while reducing their coupling. These subsystems represent components. Consisting of an existing object-oriented systems, the main idea of our approach is based on modelling as graphs all entities of an oriented object source code. Such modelling is easy to handle, so we can apply restructuring algorithms based on graph metrics. The particularity of our approach consists in integrating in addition to standard metrics, such as coupling and cohesion, some graph metrics giving more precision during the components identication. To treat this problem, we relied on the ROMANTIC approach that proposed a component-based software architecture recovery from an object oriented system.Keywords: software reengineering, software component and interfaces, metrics, graphs
Procedia PDF Downloads 497690 Pairwise Relative Primality of Integers and Independent Sets of Graphs
Authors: Jerry Hu
Abstract:
Let G = (V, E) with V = {1, 2, ..., k} be a graph, the k positive integers a₁, a₂, ..., ak are G-wise relatively prime if (aᵢ, aⱼ ) = 1 for {i, j} ∈ E. We use an inductive approach to give an asymptotic formula for the number of k-tuples of integers that are G-wise relatively prime. An exact formula is obtained for the probability that k positive integers are G-wise relatively prime. As a corollary, we also provide an exact formula for the probability that k positive integers have exactly r relatively prime pairs.Keywords: graph, independent set, G-wise relatively prime, probability
Procedia PDF Downloads 87689 Graph Neural Networks and Rotary Position Embedding for Voice Activity Detection
Authors: YingWei Tan, XueFeng Ding
Abstract:
Attention-based voice activity detection models have gained significant attention in recent years due to their fast training speed and ability to capture a wide contextual range. The inclusion of multi-head style and position embedding in the attention architecture are crucial. Having multiple attention heads allows for differential focus on different parts of the sequence, while position embedding provides guidance for modeling dependencies between elements at various positions in the input sequence. In this work, we propose an approach by considering each head as a node, enabling the application of graph neural networks (GNN) to identify correlations among the different nodes. In addition, we adopt an implementation named rotary position embedding (RoPE), which encodes absolute positional information into the input sequence by a rotation matrix, and naturally incorporates explicit relative position information into a self-attention module. We evaluate the effectiveness of our method on a synthetic dataset, and the results demonstrate its superiority over the baseline CRNN in scenarios with low signal-to-noise ratio and noise, while also exhibiting robustness across different noise types. In summary, our proposed framework effectively combines the strengths of CNN and RNN (LSTM), and further enhances detection performance through the integration of graph neural networks and rotary position embedding.Keywords: voice activity detection, CRNN, graph neural networks, rotary position embedding
Procedia PDF Downloads 58688 Community Resilience in Response to the Population Growth in Al-Thahabiah Neighborhood
Authors: Layla Mujahed
Abstract:
Amman, the capital of Jordan, is the main political, economic, social and cultural center of Jordan and beyond. The city faces multitude demographic challenges related to the unstable political situation in the surrounded countries. It has regional and local migrants who left their homes to find better life in the capital. This resulted with random and unequaled population distribution. Some districts have high population and pressure on the infrastructure and services more than other districts.Government works to resolve this challenge in compliance with 100 Cities Resilience Framework (CRF). Amman participated in this framework as a member in December 2014 to work in achieving the four goals: health and welfare, infrastructure and utilities, economy and education as well as administration and government. Previous research studies lack in studying Amman resilient work in neighborhood scale and the population growth as resilient challenge. For that, this study focuses on Al-Thahabiah neighborhood in Shafa Badran district in Amman. This paper studies the reasons and drivers behind this population growth during the selected period in this area then provide strategies to improve the resilient work in neighborhood scale. The methodology comprises of primary and secondary data. The primary data consist of interviews with chief officer in the executive part in Great Amman Municipality and resilient officer. The secondary data consist of papers, journals, newspaper, articles and book’s reading. The other part of data consists of maps and statistical data which describe the infrastructural and social situation in the neighborhood and district level during the studying period. Based upon those data, more detailed information will be found, e.g., the centralizing position of population and the provided infrastructure for them. This will help to provide these services and infrastructure to other neighborhoods and enhance population distribution. This study develops an analytical framework to assess urban demographical time series in accordance with the criteria of CRF to make accurate detailed projections on the requirements for the future development in the neighborhood scale and organize the human requirements for affordable quality housing, employment, transportation, health and education in this neighborhood to improve the social relations between its inhabitants and the community. This study highlights on the localization of resilient work in neighborhood scale and spread the resilient knowledge related to the shortage of its research in Jordan. Studying the resilient work from population growth challenge perspective helps improve the facilities provide to the inhabitants and improve their quality of life.Keywords: city resilience framework, demography, population growth, stakeholders, urban resilience
Procedia PDF Downloads 174687 Problem Solving in Chilean Higher Education: Figurations Prior in Interpretations of Cartesian Graphs
Authors: Verónica Díaz
Abstract:
A Cartesian graph, as a mathematical object, becomes a tool for configuration of change. Its best comprehension is done through everyday life problem-solving associated with its representation. Despite this, the current educational framework favors general graphs, without consideration of their argumentation. Students are required to find the mathematical function without associating it to the development of graphical language. This research describes the use made by students of configurations made prior to Cartesian graphs with regards to an everyday life problem related to a time and distance variation phenomenon. The theoretical framework describes the function conditions of study and their modeling. This is a qualitative, descriptive study involving six undergraduate case studies that were carried out during the first term in 2016 at University of Los Lagos. The research problem concerned the graphic modeling of a real person’s movement phenomenon, and two levels of analysis were identified. The first level aims to identify local and global graph interpretations; a second level describes the iconicity and referentiality degree of an image. According to the results, students were able to draw no figures before the Cartesian graph, highlighting the need for students to represent the context and the movement of which causes the phenomenon change. From this, they managed Cartesian graphs representing changes in position, therefore, achieved an overall view of the graph. However, the local view only indicates specific events in the problem situation, using graphic and verbal expressions to represent movement. This view does not enable us to identify what happens on the graph when the movement characteristics change based on possible paths in the person’s walking speed.Keywords: cartesian graphs, higher education, movement modeling, problem solving
Procedia PDF Downloads 215686 Sustainable Development: Evaluation of an Urban Neighborhood
Authors: Harith Mohammed Benbouali
Abstract:
The concept of sustainable development is becoming increasingly important in our society. The efforts of specialized agencies, cleverly portrayed in the media, allow a widespread environmental awareness. Far from the old environmental movement in the backward-looking nostalgia, the environment is combined with today's progress. Many areas now include these concerns in their efforts, this in order to try to reduce the negative impact of human activities on the environment. The quantitative dimension of development has given way to the quality aspect. However, this feature is not common, and the initial target was abandoned in favor of economic considerations. Specialists in the field of building and construction have constantly sought to further integrate the environmental dimension, creating a seal of high environmental quality buildings. The pursuit of well-being of neighborhood residents and the quality of buildings are also a hot topic in planning. Quality of life is considered so on, since financial concerns dominate to the detriment of the environment and the welfare of the occupants. This work concerns the development of an analytical method based on multiple indicators of objectives across the district. The quantification of indicators related to objectives allows the construction professional, the developer or the community, to quantify and compare different alternatives for development of a neighborhood. This quantification is based on the use of simulation tools and a multi-criteria aggregation.Keywords: sustainable development, environment, district, indicators, multi-criteria analysis, evaluation
Procedia PDF Downloads 307685 A Graph Theoretic Algorithm for Bandwidth Improvement in Computer Networks
Authors: Mehmet Karaata
Abstract:
Given two distinct vertices (nodes) source s and target t of a graph G = (V, E), the two node-disjoint paths problem is to identify two node-disjoint paths between s ∈ V and t ∈ V . Two paths are node-disjoint if they have no common intermediate vertices. In this paper, we present an algorithm with O(m)-time complexity for finding two node-disjoint paths between s and t in arbitrary graphs where m is the number of edges. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.Keywords: disjoint paths, distributed systems, fault-tolerance, network routing, security
Procedia PDF Downloads 433684 Investigating Elements of Identity of Traditional Neighborhoods in Isfahan and Using These Elements in the Design of Modern Neighborhoods
Authors: Saman Keshavarzi
Abstract:
The process of planning, designing and building neighborhoods is a complex and multidimensional part of urban planning. Understanding the elements that give a neighborhood a sense of identity can lead to successful city planning and result in a cohesive and functional community where people feel a sense of belonging. These factors are important in ensuring that the needs of the urban population are met to live in a safe, pleasant and healthy society. This research paper aims to identify the elements of the identity of traditional neighborhoods in Isfahan and analyzes ways of using these elements in the design of modern neighborhoods to increase social interaction between communities and cultural reunification of people. The neighborhood of Jolfa in Isfahan has a unique socio-cultural identity as it dates back to the Safavid Dynasty of the 16th century, and most of its inhabitants are Christian Armenians of a religious minority. The elements of the identity of Jolfa were analyzed through the following research methods: field observations, distribution of questionnaires and qualitative analysis. The basic methodology that was used to further understand the Jolfa neighborhood and deconstruct the identity image that residents associate with their respective neighborhoods was a qualitative research method. This was done through utilizing questionnaires that respondents had to fill out in response to a series of research questions. From collecting these qualitative data, the major finding was that traditional neighborhoods that have elements of identity embedded in them are seen to have closer-knit communities whose residents have strong societal ties. This area of study in urban planning is vital to ensuring that new neighborhoods are built with concepts of social cohesion, community and inclusion in mind as they are what lead to strong, connected, and prosperous societies.Keywords: development, housing, identity, neighborhood, policy, urbanization
Procedia PDF Downloads 169683 Implementation in Python of a Method to Transform One-Dimensional Signals in Graphs
Authors: Luis Andrey Fajardo Fajardo
Abstract:
We are immersed in complex systems. The human brain, the galaxies, the snowflakes are examples of complex systems. An area of interest in Complex systems is the chaos theory. This revolutionary field of science presents different ways of study than determinism and reductionism. Here is where in junction with the Nonlinear DSP, chaos theory offer valuable techniques that establish a link between time series and complex theory in terms of complex networks, so that, the study of signals can be explored from the graph theory. Recently, some people had purposed a method to transform time series in graphs, but no one had developed a suitable implementation in Python with signals extracted from Chaotic Systems or Complex systems. That’s why the implementation in Python of an existing method to transform one dimensional chaotic signals from time domain to graph domain and some measures that may reveal information not extracted in the time domain is proposed.Keywords: Python, complex systems, graph theory, dynamical systems
Procedia PDF Downloads 502682 Cross-Knowledge Graph Relation Completion for Non-Isomorphic Cross-Lingual Entity Alignment
Authors: Yuhong Zhang, Dan Lu, Chenyang Bu, Peipei Li, Kui Yu, Xindong Wu
Abstract:
The Cross-Lingual Entity Alignment (CLEA) task aims to find the aligned entities that refer to the same identity from two knowledge graphs (KGs) in different languages. It is an effective way to enhance the performance of data mining for KGs with scarce resources. In real-world applications, the neighborhood structures of the same entities in different KGs tend to be non-isomorphic, which makes the representation of entities contain diverse semantic information and then poses a great challenge for CLEA. In this paper, we try to address this challenge from two perspectives. On the one hand, the cross-KG relation completion rules are designed with the alignment constraint of entities and relations to improve the topology isomorphism of two KGs. On the other hand, a representation method combining isomorphic weights is designed to include more isomorphic semantics for counterpart entities, which will benefit the CLEA. Experiments show that our model can improve the isomorphism of two KGs and the alignment performance, especially for two non-isomorphic KGs.Keywords: knowledge graphs, cross-lingual entity alignment, non-isomorphic, relation completion
Procedia PDF Downloads 116681 Tool for Fast Detection of Java Code Snippets
Authors: Tomáš Bublík, Miroslav Virius
Abstract:
This paper presents general results on the Java source code snippet detection problem. We propose the tool which uses graph and sub graph isomorphism detection. A number of solutions for all of these tasks have been proposed in the literature. However, although that all these solutions are really fast, they compare just the constant static trees. Our solution offers to enter an input sample dynamically with the Scripthon language while preserving an acceptable speed. We used several optimizations to achieve very low number of comparisons during the matching algorithm.Keywords: AST, Java, tree matching, scripthon source code recognition
Procedia PDF Downloads 422680 Optimal Management of Internal Capital of Company
Authors: S. Sadallah
Abstract:
In this paper, dynamic programming is used to determine the optimal management of financial resources in company. Solution of the problem by consider into simpler substructures is constructed. The optimal management of internal capital of company are simulated. The tools applied in this development are based on graph theory. The software of given problems is built by using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment.Keywords: management, software, optimal, greedy algorithm, graph-diagram
Procedia PDF Downloads 278679 An Algorithm to Find Fractional Edge Domination Number and Upper Fractional Edge Domination Number of an Intuitionistic Fuzzy Graph
Authors: Karunambigai Mevani Govindasamy, Sathishkumar Ayyappan
Abstract:
In this paper, we formulate the algorithm to find out the dominating function parameters of Intuitionistic Fuzzy Graphs(IFG). The methodology we adopted here is converting any physical problem into an IFG, and that has been transformed into Intuitionistic Fuzzy Matrix. Using Linear Program Solver software (LiPS), we found the defined parameters for the given IFG. We obtained these parameters for a path and cycle IFG. This study can be extended to other varieties of IFG. In particular, we obtain the definition of edge dominating function, minimal edge dominating function, fractional edge domination number (γ_if^') and upper fractional edge domination number (Γ_if^') of an intuitionistic fuzzy graph. Also, we formulated an algorithm which is appropriate to work on LiPS to find fractional edge domination number and upper fractional edge domination number of an IFG.Keywords: fractional edge domination number, intuitionistic fuzzy cycle, intuitionistic fuzzy graph, intuitionistic fuzzy path
Procedia PDF Downloads 163678 Weighted-Distance Sliding Windows and Cooccurrence Graphs for Supporting Entity-Relationship Discovery in Unstructured Text
Authors: Paolo Fantozzi, Luigi Laura, Umberto Nanni
Abstract:
The problem of Entity relation discovery in structured data, a well covered topic in literature, consists in searching within unstructured sources (typically, text) in order to find connections among entities. These can be a whole dictionary, or a specific collection of named items. In many cases machine learning and/or text mining techniques are used for this goal. These approaches might be unfeasible in computationally challenging problems, such as processing massive data streams. A faster approach consists in collecting the cooccurrences of any two words (entities) in order to create a graph of relations - a cooccurrence graph. Indeed each cooccurrence highlights some grade of semantic correlation between the words because it is more common to have related words close each other than having them in the opposite sides of the text. Some authors have used sliding windows for such problem: they count all the occurrences within a sliding windows running over the whole text. In this paper we generalise such technique, coming up to a Weighted-Distance Sliding Window, where each occurrence of two named items within the window is accounted with a weight depending on the distance between items: a closer distance implies a stronger evidence of a relationship. We develop an experiment in order to support this intuition, by applying this technique to a data set consisting in the text of the Bible, split into verses.Keywords: cooccurrence graph, entity relation graph, unstructured text, weighted distance
Procedia PDF Downloads 142677 Conspiracy Theory in Discussions of the Coronavirus Pandemic in the Gulf Region
Authors: Rasha Salameh
Abstract:
In light of the tense relationship between Saudi Arabia and Iran, this research paper sheds some light on Al-Arabiya’s reporting of Coronavirus in the Gulf. Particularly because most of the cases, in the beginning, were coming from Iran, some programs of this Saudi channel embraced a conspiracy theory. Hate speech has been used in talking about the topic and discussing it. The results of these discussions will be detailed in this paper in percentages with regard to the research sample, which includes five programs on Al-Arabiya channel: ‘DNA’, ‘Marraya’ (Mirrors), ‘Panorama’, ‘Tafaolcom’ (Your Interaction) and the ‘Diplomatic Street’, in the period between January 19, that is, the date of the first case in Iran, and April 10, 2020. The research shows the use of a conspiracy theory in the programs, in addition to some professional violations. The surveyed sample also shows that the matter receded due to the Arab Gulf states' preoccupation with the successively increasing cases that have appeared there since the start of the pandemic. The results indicate that hate speech was present in the sample at a rate of 98.1% and that most of the programs that dealt with the Iranian issue under the Corona pandemic on Al Arabiya used the conspiracy theory at a rate of 75.5%.Keywords: Al-Arabiya, Iran, Corona, hate speech, conspiracy theory, politicization of the pandemic
Procedia PDF Downloads 128676 Sufficient Conditions for Exponential Stability of Stochastic Differential Equations with Non Trivial Solutions
Authors: Fakhreddin Abedi, Wah June Leong
Abstract:
Exponential stability of stochastic differential equations with non trivial solutions is provided in terms of Lyapunov functions. The main result of this paper establishes that, under certain hypotheses for the dynamics f(.) and g(.), practical exponential stability in probability at the small neighborhood of the origin is equivalent to the existence of an appropriate Lyapunov function. Indeed, we establish exponential stability of stochastic differential equation when almost all the state trajectories are bounded and approach a sufficiently small neighborhood of the origin. We derive sufficient conditions for exponential stability of stochastic differential equations. Finally, we give a numerical example illustrating our results.Keywords: exponential stability in probability, stochastic differential equations, Lyapunov technique, Ito's formula
Procedia PDF Downloads 45675 Intrusion Detection Based on Graph Oriented Big Data Analytics
Authors: Ahlem Abid, Farah Jemili
Abstract:
Intrusion detection has been the subject of numerous studies in industry and academia, but cyber security analysts always want greater precision and global threat analysis to secure their systems in cyberspace. To improve intrusion detection system, the visualisation of the security events in form of graphs and diagrams is important to improve the accuracy of alerts. In this paper, we propose an approach of an IDS based on cloud computing, big data technique and using a machine learning graph algorithm which can detect in real time different attacks as early as possible. We use the MAWILab intrusion detection dataset . We choose Microsoft Azure as a unified cloud environment to load our dataset on. We implement the k2 algorithm which is a graphical machine learning algorithm to classify attacks. Our system showed a good performance due to the graphical machine learning algorithm and spark structured streaming engine.Keywords: Apache Spark Streaming, Graph, Intrusion detection, k2 algorithm, Machine Learning, MAWILab, Microsoft Azure Cloud
Procedia PDF Downloads 140674 Extremal Laplacian Energy of Threshold Graphs
Authors: Seyed Ahmad Mojallal
Abstract:
Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies.Keywords: Laplacian eigenvalues, Laplacian energy, threshold graphs, extremal graphs
Procedia PDF Downloads 376673 Analyzing the Food as a Form of Creativity: The Case of the Bijlmermeer in Amsterdam-Zuidoost
Authors: Marc Polo, Núria Arbonés Arán
Abstract:
Amsterdam is considered one of the great European capitals, which concentrates the headquarters of various multinational companies and which, in addition, enjoys a huge tourist attraction. Its typical residential buildings next to the canals, the museums, or its striking "Red Light District" are a great focus of attraction. In 2019 almost 9 million tourists visited it, but few of them traveled to the farthest neighborhood in the city: Amsterdam-Zuidoost (Amsterdam-Southeast). This neighborhood is geographically separated from the urban core, which makes it an exclave of Amsterdam as it does not border any of the other boroughs. Bijlmermeer neighborhood is the largest of the Amsterdam-Zuidoost, and it was born in the 1960s with the expectations of becoming the city of the future. Its main architect, Siegfried Nassuth, was inspired by the Swiss Le Corbusier to design nearly 18,000 homes, most of which were in high-rise tower blocks and built together, forming a recognizable "honeycombed" pattern. For more than 40 years, a series of infrastructure and social vicissitudes have made the neighborhood outline quite different as it was expected to be. It helped also varied elements such as ethnicity, demolitions, or unoccupied apartments. The called “city of the future” became home to immigrants, drug addicts, and vandals, and the conflicts denigrated the Amsterdam-Zuidoost. This work analyzes the evolution of the Bijlmermeer from its origins and illustrates relevant international referents able to help the area. The purpose of the work is to show how different variations along the recent history didn't help enough, but how there are positive perspectives for the future taking advantage of the food as a creative issue. The research, based on academic literature, existing material in different stadiums, plus the analysis of the city imaginaries, will help to concrete relevant elements in terms of innovation, creativity, and disruption. Despite of radical renewal that is taking place, the research will demonstrate that there are still new opportunities for the old Bijlmermeer.Keywords: amsterdam, bijlmermeer, creativity, food
Procedia PDF Downloads 113672 Ipsilateral Weakness Caused by Ipsilateral Stroke: A Case Series
Authors: Naim Izet Kajtazi
Abstract:
Introduction: There are few reported cases of ipsilateral weakness following ischemic or hemorrhagic stroke. In these rare cases, ipsilateral weakness is typically the result of damage to uncrossed components of the corticospinal tract (CST), which were recruited in response to previous CST injury. Patients and Methods: We report a series of six cases of acute ipsilateral weakness or numbness following a hemorrhagic or ischemic stroke from three medical institutions in Saudi Arabia. Results: Three of these patients presented with right-sided weakness caused by an ipsilateral right hemispheric stroke, while two exhibited left-sided symptoms and one had only left-sided numbness. In all six cases, the ipsilateral corona radiata, internal capsule, basal ganglia, insula, and thalamus were involved. No concomitant opposite hemisphere or brainstem lesion in none of the patients was evident. Two patients had previous strokes affecting the brainstem and left corona radiata, respectively. A complete stroke workup to reveal the cause of the stroke was carried out, however, no functional MRI was performed. Conclusion: Ischemic or hemorrhagic stroke may indeed result in ipsilateral weakness or numbness, though in very rare cases. We assume that the most likely mechanism of their ipsilateral weakness subsequent to the ipsilateral stroke was a functional reorganization favoring CST pathways within the ipsilateral hemisphere.Keywords: stroke, weakness, MRI brain, stroke unit
Procedia PDF Downloads 82671 A Framework for Chinese Domain-Specific Distant Supervised Named Entity Recognition
Abstract:
The Knowledge Graphs have now become a new form of knowledge representation. However, there is no consensus in regard to a plausible and definition of entities and relationships in the domain-specific knowledge graph. Further, in conjunction with several limitations and deficiencies, various domain-specific entities and relationships recognition approaches are far from perfect. Specifically, named entity recognition in Chinese domain is a critical task for the natural language process applications. However, a bottleneck problem with Chinese named entity recognition in new domains is the lack of annotated data. To address this challenge, a domain distant supervised named entity recognition framework is proposed. The framework is divided into two stages: first, the distant supervised corpus is generated based on the entity linking model of graph attention neural network; secondly, the generated corpus is trained as the input of the distant supervised named entity recognition model to train to obtain named entities. The link model is verified in the ccks2019 entity link corpus, and the F1 value is 2% higher than that of the benchmark method. The re-pre-trained BERT language model is added to the benchmark method, and the results show that it is more suitable for distant supervised named entity recognition tasks. Finally, it is applied in the computer field, and the results show that this framework can obtain domain named entities.Keywords: distant named entity recognition, entity linking, knowledge graph, graph attention neural network
Procedia PDF Downloads 86670 Multiple Version of Roman Domination in Graphs
Authors: J. C. Valenzuela-Tripodoro, P. Álvarez-Ruíz, M. A. Mateos-Camacho, M. Cera
Abstract:
In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized.Keywords: multiple roman domination function, decision problem np-complete, bounds, exact values
Procedia PDF Downloads 102