Search results for: braided path
328 Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
Authors: Miloš Šeda
Abstract:
In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method.Keywords: Steiner tree, single shortest path problem, fuzzyranking, binary heap, priority queue.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1695327 Storytelling for Business Blogging: Position and Navigation
Authors: Han-yuh Liu, Chia-yen Wu
Abstract:
Truly successful bloggers, navigating the public to know them, often use their blogs as a way to better communicate with customers. Integrating with marketing tools, storytelling can be regarded as one of the most effective ways that businesses can follow to gain competitive edge. Even though the literature on marketing contains much discussion of traditional vehicles, the issue of business blogs applying storytelling has, as yet, received little attention. In the exploration stage, this paper identifies four storytelling disciplines and then presents a road map to business blogging. This paper also provides a two-path framework for blog storytelling and initiates an issue for further study.
Keywords: Storytelling, business blog, blog content, blog position, blog navigation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1989326 The Path to Web Intelligence Maturity
Authors: Zeljko Panian
Abstract:
Web intelligence, if made personal, can fuel the process of building communications around the interests and preferences of each individual customer or prospect, by providing specific behavioral insights about each individual. To become fully efficient, Web intelligence must reach a stage of a high-level maturity, passing throughout a process that involves five steps: (1) Web site analysis; (2) Web site and advertising optimization; (3) Segment targeting; (4) Interactive marketing (online only); and (5) Interactive marketing (online and offline). Discussing these steps in detail, the paper uncovers the real gold mine that is personal-level Web intelligence.
Keywords: Web intelligence, web analytics, informationtechnology (IT), interactive marketing.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1636325 Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)
Authors: Buthainah Fahran Al-Dulaimi, Hamza A. Ali
Abstract:
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.
Keywords: Genetic algorithms, traveling salesman problem solving, optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2559324 Routing Algorithm for a Clustered Network
Authors: Hemanth KumarA.R, Sudhakara G., Satyanarayana B.S.
Abstract:
The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E S — {s2}. In this paper, strictly non overlap¬ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSLmuAc(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc
Keywords: Metric dimension, Cluster dimension, Cluster.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1225323 The Neglected Elements of Implementing Strategic Succession Management in Public Organizations
Authors: François Chiocchio, Mahshid Gharibpour
Abstract:
Regardless of the extent to which succession management is implemented in the private sector, it is still overlooked in the public sector. Traditional succession management is evolving providing a better alignment between business strategies and HR strategies. Succession management brings sustainable effectiveness for succession programs through career path development, knowledge and skill transfer, job retention, as well as high-potential candidates’ empowerment for upcoming vacancies. By way of a systematic literature review, we bring into focus strategic succession management in public organizations and discuss best ways of implementation.
Keywords: Succession management, strategic succession management, public organization, succession management model.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1630322 Cross-Industry Innovations–Systematic Identification of Ideas for Radical Problem Solving
Authors: Niklas Echterhoff, Benjamin Amshoff, Jürgen Gausemeier
Abstract:
Creativity is often based on an unorthodox recombination of knowledge; in fact: 80% of all innovations use given knowledge and put it into a new combination. Cross-industry innovations follow this way of thinking and bring together problems and solution ideas from different industries. Therefore analogies and search strategies have to be developed. Taking this path, the questions where to search, what to search and how to search have to be answered. Afterwards, the gathered information can be used within a planned search process. Identified solution ideas have to be assessed and analyzed in detail for the success promising adaption planning.Keywords: analogy building, cross-industry innovations, knowledge transfer, solution adaption.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2059321 Strategic Regional Identity for Health and Wellness Lodging
Authors: Pongsiri K.
Abstract:
This research aimed to study the competency of health and wellness hotels and resorts in developing use the local natural resources and wisdom to conform to the national health and wellness tourism (HWT) strategy by comparing two independent samples, from Aumpur Muang, Ranong province and Aumpur Muang, Chiangmai province. And also study in the suggestive direct path to lead the organization to the sustainable successful. This research was conduct by using mix methodology; both quantitative and qualitative data were used. The data of competency of health and wellness hotels and resorts (HWHR) in developing use the local natural resources for HWT promoting were collected via 300 set of questionnaires, from 6 hotels and resorts in 2 areas, 3 places from Aumpur Muang, Ranong province and another 3 from Aumpur Muang, Chiangmai province. Thestudy of HWHR’s competency in developing use the local natural resources and wisdom to conform to the national HWT strategycan be divided into fourmain areas, food and beverages service, tourism activity, environmental service, and value adding. The total competency of the Chiangmai sample is importantly scoredp. value 0.01 higher than the Ranong one while the area of safety, Chiangmai’s competency is importantly scored 0.05 higher than the Ranong’scompetency. Others were rated not differently. Since Chiangmai perform better, then it can be a role model in developing HTHR or HWT destination. From the part of qualitative research, content analysis of business contents and its environments were analyzed. The four stages of strategic development and plans, from the smallest scale to the largest scale such a national base were discussed. The HWT: Evolution model and strategy for lodging Business were suggested. All those stages must work harmoniously together. The distinctive result illustrates the need of human resource development as the key point to create the identity of Thainess on Health and wellness service providing. This will add-on the value of services and differentiates ourselves from other competitors. The creative of Thailand’s health and wellness brand possibly increase loyalty customers which agreed to be a path of sustainable development.
Keywords: Health and Wellness Tourism (HWT), Strategic Analysis, Health and Wellness Hotels and Resorts (HWHR), Lodging Firms.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2773320 Globalization - Opportunity or Threat to the Rural Areas in Poland
Authors: Marian Woźniak, Alicja Sobkowiak
Abstract:
The world is entering a new path of development which is becoming the driving force of globalization. It is seen as an irreversible process of the present reality and has a significant impact on the transformation of economic, social and cultural rights. This also applies to changes in the rural environment which while emphasizing the global development should also maintain its identity and locality, and a rural community should do more to recognize the globalization of an opportunity than a threat to the Polish countryside. The paper discusses theoretical problems of rural development and the importance of diversification in rural areas and preserving the countryside life and there werepresente the opinions of residents of the Polish countryside on the impact of globalization on the development.
Keywords: globalization, rural areas
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1948319 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 APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2357318 The Evaluation of the Performance of Different Filtering Approaches in Tracking Problem and the Effect of Noise Variance
Authors: Mohammad Javad Mollakazemi, Farhad Asadi, Aref Ghafouri
Abstract:
Performance of different filtering approaches depends on modeling of dynamical system and algorithm structure. For modeling and smoothing the data the evaluation of posterior distribution in different filtering approach should be chosen carefully. In this paper different filtering approaches like filter KALMAN, EKF, UKF, EKS and smoother RTS is simulated in some trajectory tracking of path and accuracy and limitation of these approaches are explained. Then probability of model with different filters is compered and finally the effect of the noise variance to estimation is described with simulations results.
Keywords: Gaussian approximation, KALMAN smoother, Parameter estimation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1775317 A Mobile Agent-based Clustering Data Fusion Algorithm in WSN
Authors: Xiangbin Zhu, Wenjuan Zhang
Abstract:
In wireless sensor networks,the mobile agent technology is used in data fusion. According to the node residual energy and the results of partial integration,we design the node clustering algorithm. Optimization of mobile agent in the routing within the cluster strategy for wireless sensor networks to further reduce the amount of data transfer. Through the experiments, using mobile agents in the integration process within the cluster can be reduced the path loss in some extent.
Keywords: wireless sensor networks, data fusion, mobile agent
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1511316 On the Numerical Simulation of Flow Past an Oscillating Circular Cylinder in a Circular Path: Oscillation Amplitude Effect
Authors: Qasem M. Al-Mdallal
Abstract:
This paper presents results obtained from the numerical solution for the flow past an oscillating circular cylinder at Reynolds number of 200. The frequency of oscillation was fixed to the vortex shedding frequency from a fixed cylinder, f0, while the amplitudes of oscillations were varied from to 1.1a, where a represents the radius of the cylinder. The response of the flow through the fluid forces acting on the surface of the cylinder are investigated. The lock-on phenomenon is captured at low oscillation amplitudes.Keywords: Lock-on; streamwise oscillation; transverse oscillation; fluid forces, combined motion
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1693315 Modified Montgomery for RSA Cryptosystem
Authors: Rupali Verma, Maitreyee Dutta, Renu Vig
Abstract:
Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular Multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitioned over two iterations such that parallel computations are performed. This reduces the critical path delay of proposed Montgomery design. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs. The two factors partitioning and parallelism have improved the frequency and throughput of proposed design.
Keywords: RSA, Montgomery modular multiplication, 4:2 compressor, FPGA.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2609314 Open Problems on Zeros of Analytic Functions in Finite Quantum Systems
Authors: Muna Tabuni
Abstract:
The paper contains an investigation on basic problems about the zeros of analytic theta functions. A brief introduction to analytic representation of finite quantum systems is given. The zeros of this function and there evolution time are discussed. Two open problems are introduced. The first problem discusses the cases when the zeros follow the same path. As the basis change the quantum state |f transforms into different quantum state. The second problem is to define a map between two toruses where the domain and the range of this map are the analytic functions on toruses.
Keywords: open problems, constraint, change of basis.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1550313 Computational Simulation of Imploding Current Sheath Trajectory at the Radial Phase of Plasma Focus Performance
Authors: R. Amrollahi, M. Habibi
Abstract:
When the shock front (SF) hits the central electrode axis of plasma focus device, a reflected shock wave moves radially outwards. The current sheath (CS) results from ionization of filled gas between two electrodes continues to compress inwards until it hits the out-going reflected shock front. In this paper the Lagrangian equations are solved for a parabolic shock trajectory yielding a first and second approximation for the CS path. To determine the accuracy of the approximation, the same problem is solved for a straight shock.Keywords: Radial compression, Shock wave trajectory, Current sheath, Slog model.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1245312 Design of Novel SCR-based ESD Protection Device for I/O Clamp in BCD Process
Authors: Yong-Seo Koo, Jin-Woo Jung, Byung-Seok Lee, Dong-Su Kim, Yil-Suk Yang
Abstract:
In this paper, a novel LVTSCR-based device for electrostatic discharge (ESD) protection of integrated circuits (ICs) is designed, fabricated and characterized. The proposed device is similar to the conventional LVTSCR but it has an embedded PMOSFET in the anode n-well to enhance the turn on speed, the clamping capability and the robustness. This is possible because the embedded PMOSFET provides the sub-path of ESD discharge current. The TLP, HBM and MM testing are carried out to verify the ESD performance of the proposed devices, which are fabricated in 0.35um (Bipolar-CMOS-DMOS) BCDMOS process. The device has the robustness of 70mA/um that is higher about 60mA/um than the LVTSCR, approximately.Keywords: ESD Protection, grounded gate NMOS (GGNMOS), low trigger voltage SCR (LVTSCR)
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2948311 A Microwave Bandstop Filter Using Defected Microstrip Structure
Authors: H. Elftouh, N. T. Amar, M. Aghoutane, M. Boussouis
Abstract:
In this paper, two bandstop filters resonating at 5.25 GHz and 7.3 GHz using Defected Microstrip Structure (DMS) are discussed. These slots are incorporated in the feed lines of filters to perform a serious LC resonance property in certain frequency and suppress the spurious signals. Therefore, this method keeps the filter size unchanged and makes a resonance frequency that is due to the abrupt change of the current path of the filter. If the application requires elimination of this band of frequencies, additional filter elements are required, which can only be accomplished by adding this DMS element resonant at desired frequency band rejection. The filters are optimized and simulated with Computer Simulation Technology (CST) tool.
Keywords: Defected microstrip structure, microstrip filters, passive filter.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1373310 Multi-Agent Searching Adaptation Using Levy Flight and Inferential Reasoning
Authors: Sagir M. Yusuf, Chris Baber
Abstract:
In this paper, we describe how to achieve knowledge understanding and prediction (Situation Awareness (SA)) for multiple-agents conducting searching activity using Bayesian inferential reasoning and learning. Bayesian Belief Network was used to monitor agents' knowledge about their environment, and cases are recorded for the network training using expectation-maximisation or gradient descent algorithm. The well trained network will be used for decision making and environmental situation prediction. Forest fire searching by multiple UAVs was the use case. UAVs are tasked to explore a forest and find a fire for urgent actions by the fire wardens. The paper focused on two problems: (i) effective agents’ path planning strategy and (ii) knowledge understanding and prediction (SA). The path planning problem by inspiring animal mode of foraging using Lévy distribution augmented with Bayesian reasoning was fully described in this paper. Results proof that the Lévy flight strategy performs better than the previous fixed-pattern (e.g., parallel sweeps) approaches in terms of energy and time utilisation. We also introduced a waypoint assessment strategy called k-previous waypoints assessment. It improves the performance of the ordinary levy flight by saving agent’s resources and mission time through redundant search avoidance. The agents (UAVs) are to report their mission knowledge at the central server for interpretation and prediction purposes. Bayesian reasoning and learning were used for the SA and results proof effectiveness in different environments scenario in terms of prediction and effective knowledge representation. The prediction accuracy was measured using learning error rate, logarithm loss, and Brier score and the result proves that little agents mission that can be used for prediction within the same or different environment. Finally, we described a situation-based knowledge visualization and prediction technique for heterogeneous multi-UAV mission. While this paper proves linkage of Bayesian reasoning and learning with SA and effective searching strategy, future works is focusing on simplifying the architecture.
Keywords: Lèvy flight, situation awareness, multi-agent system, multi-robot coordination, autonomous system, swarm intelligence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 537309 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 3690308 Transferring Route Plan over Time
Authors: Barıs Kocer, Ahmet Arslan
Abstract:
Travelling salesman problem (TSP) is a combinational optimization problem and solution approaches have been applied many real world problems. Pure TSP assumes the cities to visit are fixed in time and thus solutions are created to find shortest path according to these point. But some of the points are canceled to visit in time. If the problem is not time crucial it is not important to determine new routing plan but if the points are changing rapidly and time is necessary do decide a new route plan a new approach should be applied in such cases. We developed a route plan transfer method based on transfer learning and we achieved high performance against determining a new model from scratch in every change.Keywords: genetic algorithms, transfer learning, travellingsalesman problem
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1271307 Introduction to Electron Spectroscopy for Surfaces Characterization
Authors: Abdelkader Benzian
Abstract:
Spectroscopy is the study of the spectrum produced by the radiation-matter interaction which requires the study of electromagnetic radiation (or electrons) emitted, absorbed, or scattered by matter. Thus, the spectral analysis is using spectrometers which enables us to obtain curves that express the distribution of the energy emitted (spectrum). Analysis of emission spectra can therefore constitute several methods depending on the range of radiation energy. The most common methods used are Auger electron spectroscopy (AES) and Electron Energy Losses Spectroscopy (EELS), which allow the determination of the atomic structure on the surface. This paper focalized essentially on the Electron Energy Loss Spectroscopy.
Keywords: Dielectric, plasmon, mean free path, spectroscopy of electron energy losses.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 771306 Study on Radio Link Availability in Millimeter Wave Range
Authors: Boncho G. Bonev, Kliment N. Angelov, Emil S. Altimirski
Abstract:
In this paper, the link quality in SHF and EHF ranges are studied. In order to achieve high data rate higher frequencies must be used – centimeter waves (SHF), millimeter waves (EHF) or optical range. However, there are significant problem when a radio link work in that diapason – rain attenuation and attenuation in earth-s atmosphere. Based on statistical rain rates data for Bulgaria, the link availability can be determined, depending on the working frequency, the path length and the Power Budget of the link. For the calculations of rain attenuation and atmosphere-s attenuation the ITU recommendations are used.Keywords: rain attenuation, atmospheric gaseous attenuation, link availability, link breaking probability
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2023305 Effects of Network Dynamics on Routing Efficiency in P2P Networks
Authors: Mojca Ciglaric, Andrej Krevl, Matjaž Pancur, Tone Vidmar
Abstract:
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on query routing efficiency. First we describe some background and an abstract system model. The chosen routing technique makes use of cached metadata from previous answer messages and also employs a mechanism for broken path detection and metadata maintenance. Several metrics are used to show that the protocol behaves quite well even with high rate of node departures, but above a certain threshold it literally breaks down and exhibits considerable efficiency degradation.Keywords: Network dynamics, overlay network, P2P system, routing efficiency.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1359304 Finding Equilibrium in Transport Networks by Simulation and Investigation of Behaviors
Authors: Gábor Szűcs, Gyula Sallai
Abstract:
The goal of this paper is to find Wardrop equilibrium in transport networks at case of uncertainty situations, where the uncertainty comes from lack of information. We use simulation tool to find the equilibrium, which gives only approximate solution, but this is sufficient for large networks as well. In order to take the uncertainty into account we have developed an interval-based procedure for finding the paths with minimal cost using the Dempster-Shafer theory. Furthermore we have investigated the users- behaviors using game theory approach, because their path choices influence the costs of the other users- paths.Keywords: Dempster-Shafer theory, S-O and U-Otransportation network, uncertainty of information, Wardropequilibrium.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1530303 The Different Ways to Describe Regular Languages by Using Finite Automata and the Changing Algorithm Implementation
Authors: Abdulmajid Mukhtar Afat
Abstract:
This paper aims at introducing finite automata theory, the different ways to describe regular languages and create a program to implement the subset construction algorithms to convert nondeterministic finite automata (NFA) to deterministic finite automata (DFA). This program is written in c++ programming language. The program reads FA 5tuples from text file and then classifies it into either DFA or NFA. For DFA, the program will read the string w and decide whether it is acceptable or not. If accepted, the program will save the tracking path and point it out. On the other hand, when the automation is NFA, the program will change the Automation to DFA so that it is easy to track and it can decide whether the w exists in the regular language or not.
Keywords: Finite Automata, subset construction DFA, NFA.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1986302 Some New Inequalities for Eigenvalues of the Hadamard Product and the Fan Product of Matrices
Authors: Jing Li, Guang Zhou
Abstract:
Let A and B be nonnegative matrices. A new upper bound on the spectral radius ρ(A◦B) is obtained. Meanwhile, a new lower bound on the smallest eigenvalue q(AB) for the Fan product, and a new lower bound on the minimum eigenvalue q(B ◦A−1) for the Hadamard product of B and A−1 of two nonsingular M-matrices A and B are given. Some results of comparison are also given in theory. To illustrate our results, numerical examples are considered.
Keywords: Hadamard product, Fan product; nonnegative matrix, M-matrix, Spectral radius, Minimum eigenvalue, 1-path cover.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1894301 Economic Analysis of Endogenous Growth Model with ICT Capital
Authors: Shoji Katagiri, Hugang Han
Abstract:
This paper clarifies the role of ICT capital in economic growth. Albeit ICT remarkably contributes to economic growth, there are few studies on ICT capital in ICT sector from theoretical point of view. In this paper, production function of ICT which is used as input of intermediate good in final good and ICT sectors is incorporated into our model. In this setting, we analyze the role of ICT on balance growth path and show the possibility of general equilibrium solutions for this model. Through the simulation of the equilibrium solutions, we find that when ICT impacts on economy and economic growth increases, it is necessary that increases of efficiency at ICT sector and of accumulation of non-ICT and ICT capitals occur simultaneously.
Keywords: Endogenous economic growth, ICT, intensity, capital accumulation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1675300 Model of Obstacle Avoidance on Hard Disk Drive Manufacturing with Distance Constraint
Authors: Rawinun Praserttaweelap, Somyot Kiatwanidvilai
Abstract:
Obstacle avoidance is the one key for the robot system in unknown environment. The robots should be able to know their position and safety region. This research starts on the path planning which are SLAM and AMCL in ROS system. In addition, the best parameters of the obstacle avoidance function are required. In situation on Hard Disk Drive Manufacturing, the distance between robots and obstacles are very serious due to the manufacturing constraint. The simulations are accomplished by the SLAM and AMCL with adaptive velocity and safety region calculation.Keywords: Obstacle avoidance, simultaneous localization and mapping, adaptive Monte Carlo localization, KLD sampling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 492299 Terminal Wiener Index for Graph Structures
Authors: J. Baskar Babujee, J. Senbagamalar,
Abstract:
The topological distance between a pair of vertices i and j, which is denoted by d(vi, vj), is the number of edges of the shortest path joining i and j. The Wiener index W(G) is the sum of distances between all pairs of vertices of a graph G. W(G) = i Keywords:
Graph,
Degree,
Distance,
Pendent vertex,
Wiener index,
Tree.