Search results for: the five stages of cultivating the Yogacāra path

Authors: Kyungbong Kim

Abstract:

This study proposed to compare and analyse the five stages of cultivating the Yogâcāra path and the spiritual journey in the Ten Ox-Herding Pictures. To achieve this, the study investigated the core concepts and practice methods of the two approaches and analysed their relations from the literature reviewed. The results showed that the end goal of the two approaches is the same, the attainment of Buddhahood, with the two having common characteristics including the practice of being aware of the impermanent and non-self, and the fulfilling benefit of sentient beings. The results suggest that our Buddhist practice system needs to sincerely consider the realistic ways by which one can help people in agony in contemporary society, not by emphasizing on the enlightenment through a specific practice way for all people, but by tailored practice methods based on each one's faculties in understanding Buddhism.

Keywords: transformation of consciousness to wisdom, enlightenment, the five stages of cultivating the Yogacāra path, the Ten Ox-Herding Pictures, transformation of the basis

Procedia PDF Downloads 234

Authors: Sanjoy Barua Chowdhury

Abstract:

The aim of this paper is an attempt to analyze the concept of emptiness from the early Buddhist teachings to subsequent Buddhist developmental schools, namely, Madhyamaka and Yogācāra Schools, along with attempting to examine an insightful bridge between the Buddha’s major teaching on dependent origination and the notion of emptiness. The initial part of this qualitative research focuses on the etymological term of emptiness (śūnyatā) and the Buddha’s teaching of emptiness from the Early Buddhist standpoint. Next, this research will seek to explain the concept of emptiness in the Madhyamaka School and Yogācāra School. This study further demonstrates the eradication of suffering is meant of understanding the concept emptiness from an ultimate standpoint with special concerning to focus the connection to the Buddha’s central teaching Dependent Origination.

Keywords: emptiness, Madhyamaka, dependent origination, early Buddhism, Yogacara

Procedia PDF Downloads 152

Authors: Wing Cheuk Chan

Abstract:

It is well-known that Heidegger was highly critical of Sartre’s existential philosophy. In his famous “Letter on Humanism,” Heidegger not only draw a clear cutline between his thinking of Being and Sartre’s existentialism but also introduced a kind of anti-humanism. Such a hostile attitude towards Sartre’sExistentialism as Humanism seems to have created an unbridgeable gap between these them. Indeed, already in his Being and Nothingness, Sartre complained: Heidegger “has completely avoided any appeal to consciousness in his description of Dasein.”In reality, Sartre was mainly faithful to Husserlianphenomenology, in spite of his rejection of Husserl’s idealism. Thanks to the Japanese Buddhist scholar Yoshifumi Ueda’s work on the Old School of Yogācāra Buddhismas represented by Sthiramati and Paramārtha, we learn that in additional to thethesis of transforming vijñāna (knowing consciousness) into jñāna (wisdom), there is an idea of pṛṣṭa-labdha-jñāna (the subsequently acquired wisdom). According to Ueda, the latter is a “non-discriminative discrimination.” This gives rise to a possibility of synthesizing Heidegger’s thinking of Being and Sartre’s existential phenomenology. Structurally, this paper will firstshow that Heidegger focuses on the side of non-discrimination, whereas Sartre concentrates on the side of discrimination. It will then clarify in what sense thateach of them, in itself, remains incomplete. Finally, it will demonstratehow to synthesize them in term of the notion of “non-discriminative discrimination.”

Keywords: heidegger, sartre, phenomenology, yogācāra buddhism

Procedia PDF Downloads 73

Authors: Sukjai Charoensuk, Penphan Pitaksongkram, Michael Christopher

Abstract:

Preliminary evidences supported the effectiveness of mindfulness-based interventions in reducing symptoms associated with a variety of medical and psychological conditions. However, the measurements of mindfulness are questionable since they have not been developed based-on Buddhist experiences. The purpose of this qualitative study was to describe meaning and cultivating factors of mindfulness as experienced by Thai females who practice Dhamma. Participants were purposively selected to include 2 groups of Thai females who practice Dhamma. The first group consisted of 6 female Buddhist monks, and the second group consisted of 7 female who practice Dhamma without ordaining. Data were collected using in-depth interview. The instruments used were demographic data questionnaire and guideline for in-depth interview developed by researchers. Content analysis was employed to analyze the data. The results revealed that Thai women who practice Dhamma described their experience in 2 themes, which were meaning and cultivating factors of mindfulness. The meaning composed of 4 categories; 1) Being Present, 2) Self-awareness, 3) Contemplation, and 4) Neutral. The cultivating factors of mindfulness composed of 2 categories; In-personal factors and Ex-personal factors. The In-personal cultivating factors included 4 sub-categories; Faith and Love, the Five Precepts, Sound body, and Practice. The Ex-personal cultivating factors included 2 sub-categories; Serenity, and Learning. These findings increase understanding about meaning of mindfulness and its cultivating factors. These could be used as a guideline to promote mental health and develop nursing interventions using mindfulness based, as well as, develop the instrument for assessing mindfulness in Thai context.

Keywords: cultivating factor, meaning of mindfulness, practice Dhamma, Thai women

Procedia PDF Downloads 320

Authors: Titilayo Shodeinde, Bukola Dawodu

Abstract:

Aquaculture practice in Nigeria is an industry that includes fish development in a controlled situation. It has developed through various stages and stages with its latent capacity yet to be completely tapped. To avow this potential in adding to human advancement, nourishment security and improved way of life, the aquaculture business requires new approaches. Subsequently, this seminar paper reviews the impact of aquaculture on sustainable development in Nigeria. The examination received on subjective research strategy. The segments and the frameworks of business fish cultivating were completely talked about. Additionally, imperatives to business fish cultivating in the area were explained. The systems for advancing business aquaculture, for example, increment in consciousness of aquaculture items, financing of aquaculture data sources, preparing and labor improvement, government support, arrangement of fish ranchers agreeable social orders, access to advances and credit offices, advancement of research exercises, viable fisheries approaches, great institutional structure, and decreasing the degrees of defilement and instability in the district, were plainly brought up as a veritable devices, for changing the current situation with aquaculture in Niger Delta, through arranged, engaged and composed compelling administration procedures, by singular ranchers, government organizations and applicable foundations for economical advancement of the locale specifically and the nation by and large.

Keywords: aquaculture, sustainability, Nigeria, research

Procedia PDF Downloads 181

Authors: Bhaddiya Tanchangya

Abstract:

This article discusses the Four Noble Truths, the foundational teachings of Buddhism, and their significance to Buddhist philosophy. The Four Noble Truths are the Noble Truth of Suffering, the Noble Truth of the Cause of Suffering, the Noble Truth of the End of Suffering, and the Noble Truth of the Path Leading to the End of Suffering. The first truth, the Noble Truth of Suffering, explains that suffering or dukkha is an inherent part of existence, including emotional, physical, and existential forms of suffering, including the Five Aggregates, which refer to the five components that make up a sentient being's experience of existence, as they are all conditioned, interdependent, subject to the Three Characteristics of Existence: impermanence, unsatisfactoriness and emptiness. The second truth, the Noble Truth of the Cause of Suffering, states that craving or attachment to the sensory experiences of the Five Aggregates leads to suffering and identifies three types of craving: craving for sensual pleasures, craving for existence, and craving for non-existence. Through the doctrine of Dependent Origination (Paṭiccasamuppāda), the Buddha graphically shows how the entire process of suffering arises and ceases. The third truth, the Noble Truth of the End of Suffering, asserts that there is a way to end suffering and attain a state of liberation called Nibbāna that marks the end of the cycle of birth and death by removing that very craving towards the sensory experiences by cultivating the Noble Eightfold Path. The fourth truth, the Noble Truth of the Path Leading to the End of Suffering, describes the Noble Eightfold Path, a set of guidelines to develop insight and wisdom to overcome craving and attachment and attain liberation from suffering. The article emphasizes that the Four Noble Truths are universal, applicable to all people regardless of culture, background, or beliefs, and form the foundation of Buddhist philosophy and practice.

Keywords: four noble truths, impermanence, suffering, not-self-ness, interconnectedness, emptiness, morality, concentration, wisdom, nirvana, happiness

Procedia PDF Downloads 47

Authors: Andrey Lebedev, Ilya Dmitrenok, JooYoung Lee, Leonard Johard

Abstract:

Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm.

Keywords: graph matching, link prediction, shortest path, similarity

Procedia PDF Downloads 326

Authors: Divya Agarwal, Pushpendra S. Bharti

Abstract:

Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc.

Keywords: path planning, obstacle avoidance, autonomous mobile robots, algorithms

Procedia PDF Downloads 198

Authors: Lana Dalawr Jalal

Abstract:

This paper addresses the problem of offline path planning for Unmanned Aerial Vehicles (UAVs) in complex three-dimensional environment with obstacles, which is modelled by 3D Cartesian grid system. Path planning for UAVs require the computational intelligence methods to move aerial vehicles along the flight path effectively to target while avoiding obstacles. In this paper Modified Particle Swarm Optimization (MPSO) algorithm is applied to generate the optimal collision free 3D flight path for UAV. The simulations results clearly demonstrate effectiveness of the proposed algorithm in guiding UAV to the final destination by providing optimal feasible path quickly and effectively.

Keywords: obstacle avoidance, particle swarm optimization, three-dimensional path planning unmanned aerial vehicles

Procedia PDF Downloads 375

Authors: Victor Emeli, Akansel Cosgun

Abstract:

This paper explores the navigation among movable obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a rapidly-exploring random tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%).

Keywords: motion planning, path planning, push planning, robot navigation

Procedia PDF Downloads 138

Authors: S. Zamir

Abstract:

The modern era has brought with it significant organizational changes. These changes have not bypassed the academic world, and along with the old academic bonds that include a world of knowledge and ethics, academic faculty members are required more than ever not only to survive in the academic world, but also to thrive and flourish and position themselves as modern and opinionated academicians. Based upon the writings of organizational consultants, the article suggests a 10 X C model for cultivating an academic backbone, as well as emphasizing its input to the professional growth of university and college academics: Competence, Calculations of pain & gain, Character, Commitment, Communication, Curiosity, Coping, Courage, Collaboration and Celebration.

Keywords: academic career, academicians, higher education, the 10xC model

Procedia PDF Downloads 223

Authors: William Li

Abstract:

Lane-change path planning is a crucial and yet complex task in autonomous driving. The traditional path planning approach based on a system of carefully-crafted rules to cover various driving scenarios becomes unwieldy as more and more rules are added to deal with exceptions and corner cases. This paper proposes to divide the entire path planning to two stages. In the first stage the ego vehicle travels longitudinally in the source lane to reach a safe state. In the second stage the ego vehicle makes lateral lane-change maneuver to the target lane. The paper derives the safe state conditions based on lateral lane-change maneuver calculation to ensure collision free in the second stage. To determine the acceleration sequence that minimizes the time to reach a safe state in the first stage, the paper proposes three schemes, namely, kinetic model based optimization, deep reinforcement learning, and 5G vehicle-to-vehicle (V2V) communications. The paper investigates these schemes via simulation. The model-based optimization is sensitive to the model assumptions. The deep reinforcement learning is more flexible in handling scenarios beyond the model assumed by the optimization. The 5G V2V eliminates uncertainty in predicting future behaviors of surrounding vehicles by sharing driving intents and enabling cooperative driving.

Keywords: lane change, path planning, autonomous driving, deep reinforcement learning, 5G, V2V communications, connected vehicles

Procedia PDF Downloads 167

Authors: Satyam Raikwar, Thomas Herlitzius, Jens Fehrmann

Abstract:

In recent years, the autonomous navigation of orchard and field robots is an emerging technology of the mobile robotics in agriculture. One of the core aspects of autonomous navigation builds upon path planning, which is still a crucial issue. Generally, for simple representation, the path planning for a mobile robot is performed in a two-dimensional space, which creates a path between the start and goal point. This paper presents the automatic path planning approach for robots used in orchards and vineyards using occupancy grid maps with field consideration. The orchards and vineyards are usually structured environment and their topology is assumed to be constant over time; therefore, in this approach, an RGB image of a field is used as a working environment. These images undergone different image processing operations and then discretized into two-dimensional grid matrices. The individual grid or cell of these grid matrices represents the occupancy of the space, whether it is free or occupied. The grid matrix represents the robot workspace for motion and path planning. After the grid matrix is described, a probabilistic roadmap (PRM) path algorithm is used to create the obstacle-free path over these occupancy grids. The path created by this method was successfully verified in the test area. Furthermore, this approach is used in the navigation of the orchard robot.

Keywords: orchard robots, automatic path planning, occupancy grid, probabilistic roadmap

Procedia PDF Downloads 125

Authors: Nuttawoot Nupo, Sayan Panma

Abstract:

A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented.

Keywords: Cayley digraphs, independence number, left groups, path independence number, right groups

Procedia PDF Downloads 206

Authors: Qing Lyu, Hang Zhu

Abstract:

Various flows in the network require to go through different types of middlebox. The improper placement of network middlebox and path assignment for flows could greatly increase the network latency and also decrease the performance of network. Minimizing the total end to end latency of all the ows requires to assign path for the incoming flows. In this paper, the flow path assignment problem in regard to the placement of various kinds of middlebox is studied. The flow path assignment problem is formulated to a linear programming problem, which is very time consuming. On the other hand, a naive greedy algorithm is studied. Which is very fast but causes much more latency than the linear programming algorithm. At last, the paper presents a heuristic algorithm named FPA, which takes bottleneck link information and estimated bandwidth occupancy into consideration, and achieves near optimal latency in much less time. Evaluation results validate the effectiveness of the proposed algorithm.

Keywords: flow path, latency, middlebox, network

Procedia PDF Downloads 178

Authors: Wera Supa, Panita Wannapiroon

Abstract:

This paper is a report on the designing of the social collaborative learning model based on proactive involvement to Promote the global merit principle in cultivating youths’ morality. The research procedures into two phases, the first phase is to design the social collaborative learning model based on proactive involvement to promote the global merit principle in cultivating youths’ morality, and the second is to evaluate the social collaborative learning model based on proactive involvement. The sample group in this study consists of 15 experts who are dominant in proactive participation, moral merit principle and youths’ morality cultivation from executive level, lecturers and the professionals in information and communication technology expertise selected using the purposive sampling method. Data analyzed by arithmetic mean and standard deviation. This study has explored that there are four significant factors in promoting the hands-on collaboration of global merit scheme in order to implant virtues to adolescences which are: 1) information and communication Technology Usage; 2) proactive involvement; 3) morality cultivation policy, and 4) global merit principle. The experts agree that the social collaborative learning model based on proactive involvement is highly appropriate.

Keywords: social collaborative learning, proactive involvement, global merit principle, morality

Procedia PDF Downloads 356

Authors: Alan C. Lin, Tsong Der Lin

Abstract:

This study proposes a deviation control method to add interpolation points to numerical control (NC) codes of five-axis machining in order to achieve the required machining accuracy. Specific research issues include: (1) converting machining data between the CL (cutter location) domain and the NC domain, (2) calculating the deviation between the deviated path and the linear path, (3) finding interpolation points, and (4) determining tool orientations for the interpolation points. System implementation with practical examples will also be included to highlight the applicability of the proposed methodology.

Keywords: CAD/CAM, cutter path, five-axis machining, numerical control

Procedia PDF Downloads 394

Authors: Sherif M. Hafez, Remon F. Aziz, May S. A. Elalim

Abstract:

Project managers today rely on scheduling tools based on the Critical Path Method (CPM) to determine the overall project duration and the activities’ float times which lead to greater efficiency in planning and control of projects. CPM was useful for scheduling construction projects, but researchers had highlighted a number of serious drawbacks that limit its use as a decision support tool and lacks the ability to clearly record and represent detailed information. This paper discusses the drawbacks of CPM as a scheduling technique and presents a modified critical path method (CPM) model which is called critical path segments (CPS). The CPS scheduling mechanism addresses the problems of CPM in three ways: decomposing the activity duration of separated but connected time segments; all relationships among activities are converted into finish–to–start relationship; and analysis and calculations are made with forward path. Sample cases are included to illustrate the shortages in CPM, CPS full analysis and calculations are explained in details, and how schedules can be handled better with the CPS technique.

Keywords: construction management, scheduling, critical path method, critical path segments, forward pass, float, project control

Procedia PDF Downloads 328

Authors: E. Behmanesh, J. Pannek

Abstract:

Logistics network design is known as one of the strategic decision problems. As these kinds of problems belong to the category of NP-hard problems, traditional ways are failed to find an optimal solution in short time. In this study, we attempt to involve reverse flow through an integrated design of forward/reverse supply chain network that formulated into a mixed integer linear programming. This Integrated, multi-stages model is enriched by three different delivery path which makes the problem more complex. To tackle with such an NP-hard problem a revised random path direct encoding method based memetic algorithm is considered as the solution methodology. Each algorithm has some parameters that need to be investigate to reveal the best performance. In this regard, Taguchi method is adapted to identify the optimum operating condition of the proposed memetic algorithm to improve the results. In this study, four factors namely, population size, crossover rate, local search iteration and a number of iteration are considered. Analyzing the parameters and improvement in results are the outlook of this research.

Keywords: integrated logistics network, flexible path, memetic algorithm, Taguchi method

Procedia PDF Downloads 160

Authors: Cuiyang Feng, Xu Tang, Yi Jin

Abstract:

Coal is the most important primary energy source in China, which exerts a significant influence on the rapid economic growth. However, it makes the water resources to be a constraint on coal industry development, on account of the reverse geographical distribution between coal and water. To ease the pressure on water shortage, the ‘3 Red Lines’ water policies were announced by the Chinese government, and then ‘water for coal’ plan was added to that policies in 2013. This study utilized a structural path analysis (SPA) based on the multi-regional input-output table to quantify the virtual water flows caused by coal consumption in different stages. Results showed that the direct water input (the first stage) was the highest amount in all stages of coal consumption, accounting for approximately 30% of total virtual water content. Regional analysis demonstrated that virtual water trade alleviated the pressure on water use for coal consumption in water shortage areas, but the import of virtual water was not from the areas which are rich in water. Sectoral analysis indicated that the direct inputs from the sectors of ‘production and distribution of electric power and heat power’ and ‘Smelting and pressing of metals’ took up the major virtual water flows, while the sectors of ‘chemical industry’ and ‘manufacture of non-metallic mineral products’ importantly but indirectly consumed the water. With the population and economic growth in China, the water demand-and-supply gap in coal consumption would be more remarkable. In additional to water efficiency improvement measures, the central government should adjust the strategies of the virtual water trade to address local water scarcity issues. Water resource as the main constraints should be highly considered in coal policy to promote the sustainable development of the coal industry.

Keywords: coal consumption, multi-regional input-output model, structural path analysis, virtual water

Procedia PDF Downloads 277

Authors: Li-Zhi Liao

Abstract:

The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported.

Keywords: central path, convex programming, generalized central path, interior point method

Procedia PDF Downloads 282

Authors: Yeo Leng Leng

Abstract:

Blended learning, with its combination of online and face-to-face instruction, presents a unique set of challenges and opportunities in terms of cultivating student agency. While it offers flexibility and personalized learning pathways, it also demands a higher degree of self-regulation and motivation from students. This paper presents the design of blended learning in a Chinese lesson and discusses the framework involved. It also talks about the Edtech tools adopted to engage the students. Some of the students’ works will be showcased. A qualitative case study research method was employed in this paper to find out more about students’ learning experiences and to give them a voice. The purpose is to seek improvement in the blended learning design of the Chinese lessons and to encourage students’ self-directed learning.

Keywords: blended learning, student agency, ed-tech tools, self-directed learning

Procedia PDF Downloads 34

Authors: Omar M. Aldenali

Abstract:

Planning is one of the most important phases of the management science and network planning, which represents the project activities relationship. Critical path is one of the project management techniques used to plan and control the execution of a project activities. The objective of this paper is to implement a fuzzy logic approach to arrange network planning on construction projects. This method is used to finding out critical path in the fuzzy construction project network. The trapezoidal fuzzy numbers are used to represent the activity construction project times. A numerical example that represents a house construction project is introduced. The critical path method is implemented on the fuzzy construction network activities, and the results showed that this method significantly affects the completion time of the construction projects.

Keywords: construction project, critical path, fuzzy network project, planning

Procedia PDF Downloads 107

Authors: Min Wang, Sergey Utev

Abstract:

The lessons from the 2007-09 global financial crisis have driven scientific research, which considers the design of new methodologies and financial models in the global market. The quantum mechanics approach was introduced in the unpredictable stock market modeling. One famous quantum tool is Feynman path integral method, which was used to model insurance risk by Tamturk and Utev and adapted to formalize the path-dependent option pricing by Hao and Utev. The research is based on the path-dependent calculation method, which is motivated by the Feynman path integral method. The path calculation can be studied in two ways, one way is to label, and the other is computational. Labeling is a part of the representation of objects, and generating functions can provide many different ways of representing share price paths. In this paper, the recent works on graphical theoretical construction of individual share price path via matroid is presented. Firstly, a study is done on the knowledge of matroid, relationship between lattice path matroid and Tutte polynomials and ways to connect points in the lattice path matroid and Tutte polynomials is suggested. Secondly, It is found that a general binary tree can be validly constructed from a connected lattice path matroid rather than general lattice path matroid. Lastly, it is suggested that there is a way to represent share price paths via a general binary tree, and an algorithm is developed to construct share price paths from general binary trees. A relationship is also provided between lattice integer points and Tutte polynomials of a transversal matroid. Use this way of connection together with the algorithm, a share price path can be constructed from a given connected lattice path matroid.

Keywords: combinatorial construction, graphical representation, matroid, path calculation, share price, Tutte polynomial

Procedia PDF Downloads 105

Authors: M. Nemer, E. I. Konukseven

Abstract:

In this paper, a motion generation algorithm for a six Degrees of Freedom (DoF) robotic hand in a static environment is presented. The purpose of developing this method is to be used in the path generation of the end-effector for edge finishing and inspection processes by utilizing the CAD model of the considered workpiece. Nonetheless, the proposed algorithm may be extended to be applicable for other similar manufacturing processes. A software package programmed in the application programming interface (API) of SolidWorks generates tool path data for the robot. The proposed method significantly simplifies the given problem, resulting in a reduction in the CPU time needed to generate the path, and offers an efficient overall solution. The ABB IRB2000 robot is chosen for executing the generated tool path.

Keywords: CAD-based tools, edge deburring, edge scanning, offline programming, path generation

Procedia PDF Downloads 258

Authors: Indranil Bayal, Pradipta Panchadhyayee

Abstract:

Path-spin hybrid entanglement generated and confined in a single spin-1/2 particle is converted to spin-spin hybrid interparticle entanglement, which finds its important applications in quantum information processing. This protocol uses beam splitter, spin flipper, spin measurement, classical channel, unitary transformations, etc., and requires no collective operation on the pair of particles whose spin variables share complete entanglement after the accomplishment of the protocol. The specialty of the protocol lies in the fact that the path-spin entanglement is transferred between spin degrees of freedom of two separate particles initially possessed by a single party.

Keywords: entanglement, path-spin entanglement, spin-spin entanglement, CNOT operation

Procedia PDF Downloads 162

Authors: J. Nisar, S. Halim

Abstract:

The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activity in Precedence Diagram Method (PDM) provides a more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in the PDM network will have an anomalous effect on the critical path and the project completion date. In this study, we classified the critical activities in two groups i.e., 1. activity on single critical path and 2. activity on multi-critical paths, and six classes i.e., normal, reverse, neutral, perverse, decrease-reverse and increase-normal, based on their effects on project duration in PDM. Furthermore, we determined the maximum float of time by which the duration each type of critical activities can be changed without effecting the project duration. This study would help the project manager to clearly understand the behavior of each critical activity on critical path, and he/she would be able to change the project duration by shortening or lengthening activities based on project budget and project deadline.

Keywords: construction management, critical path method, project scheduling network, precedence diagram method

Procedia PDF Downloads 179

Authors: Taehan Lee

Abstract:

We consider a network design problem which has shortest routing restriction based on the values determined by the installed facilities on each arc. In conventional multicommodity network design problem, a commodity can be routed through any possible path when the capacity is available. But, we consider a problem in which the commodity between two nodes must be routed on a path which has shortest metric value and the link metric value is determined by the installed facilities on the link. By this routing restriction, the problem has a distinct characteristic. We present an integer programming formulation containing the primal-dual optimality conditions to the shortest path routing. We give some computational results for the model.

Keywords: integer programming, multicommodity network design, routing, shortest path

Procedia PDF Downloads 390

Authors: Mohamed Bendahmane, Brahim Elfalaki, Mohammed Benattou

Abstract:

One of the major sources of learners' professional difficulties is their heterogeneity. Whether on cognitive, social, cultural or emotional level, learners being part of the same group have many differences. These differences do not allow to apply the same learning process at all learners. Thus, an optimal learning path for one, is not necessarily the same for the other. We present in this paper a model-oriented service to offer to each learner a personalized learning path to acquire the targeted skills.

Keywords: learning path, web service, trace analysis, personalization

Procedia PDF Downloads 325

Authors: Ahmet Kaya

Abstract:

Quantum mechanism is one of the most important approaches to calculating non-ruin probability. We apply standard Dirac notation to model given Hamiltonians. By using the traditional method and eigenvector basis, non-ruin probability is found for several examples. Also, non-ruin probability is calculated for two different Hamiltonian by using the tensor product. Finally, the path integral method is applied to the examples and comparison is made for stochastic simulations and path integral calculation.

Keywords: quantum physics, Hamiltonian system, path integral, tensor product, ruin probability

Procedia PDF Downloads 294