• Title/Summary/Keyword: Parallel Branching

Search Result 15, Processing Time 0.023 seconds

Influence of elastic T-stress on the growth direction of two parallel cracks

  • Li, X.F.;Tang, B.Q.;Peng, X.L.;Huang, Y.
    • Structural Engineering and Mechanics
    • /
    • v.34 no.3
    • /
    • pp.377-390
    • /
    • 2010
  • This paper studies fracture initiation direction of two parallel non-coplanar cracks of equal length. Using the dislocation pile-up modelling, singular integral equations for two parallel cracks subjected to mixed-mode loading are derived and the crack-tip field including singular and non-singular terms is obtained. The kinking angle is determined by using the maximum hoop stress criterion, or the ${\sigma}_{\theta}$-criterion. Results are presented for simple uniaxial tension and biaxial loading. The biaxiality ratio has a noticeable influence on crack growth direction. For the case of biaxial tension, when neglecting the T-stress the crack branching angle is overestimated for small crack inclination angles relative to the largest applied principal stress direction, and underestimated for large crack inclination angles.

A Parallel Algorithm for Finding Routes in Cities with Diagonal Streets

  • Hatem M. El-Boghdadi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.1
    • /
    • pp.45-51
    • /
    • 2024
  • The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

Dynamic Fracture Analysis with State-based Peridynamic Model: Crack Patterns on Stress Waves for Plane Stress Elastic Solid (상태 기반 페리다이나믹 모델에 의한 동적취성파괴 해석: 평면응력 탄성체의 응력 전파와 균열패턴 분석)

  • Ha, Youn Doh
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.28 no.3
    • /
    • pp.309-316
    • /
    • 2015
  • A state-based peridynamic model is able to describe a general constitutive model from the standard continuum theory. The response of a material at a point is dependent on the deformation of all bonds connected to the point within the nonlocal horizon region. Therefore, the state-based peridynamic model permits both the volume and shear changes of the material which is promising to reproduce the complicated dynamic brittle fracture phenomena, such as crack branching, secondary cracks, cascade cracks, crack coalescence, etc. In this paper, the two-dimensional state-based peridynamic model for a linear elastic plane stress solid is employed. The damage model incorporates the energy release rate and the peridynamic energy potential. For brittle glass materials, the impact of the crack-parallel compressive stress waves on the crack branching pattern is investigated. The peridynamic solution for this problem captures the main features, observed experimentally, of dynamic crack propagation and branching. Cascade cracks under strong tensile loading and secondary cracks are also well reproduced with the state-based peridynamic simulations.

A Parallel Approach to Navigation in Cities using Reconfigurable Mesh

  • El-Boghdadi, Hatem M.;Noor, Fazal
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.4
    • /
    • pp.1-8
    • /
    • 2021
  • The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

Design and Evaluation of Flexible Thread Partitioning System (융통성 있는 스레드 분할 시스템 설계와 평가)

  • Jo, Sun-Moon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.3
    • /
    • pp.75-83
    • /
    • 2007
  • Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

  • PDF

Performance Evaluation of QoS-based Web Services Selection Models (QoS 기반 웹 서비스 선택 모형의 성능 평가)

  • Seo, Sang-Koo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.43-52
    • /
    • 2007
  • As the number of public Web Services increases, there will be many services with the same functionality. These services. however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a best service while satisfying given QoS constraints. This paper brings parallel branching and response time constraint of business processes into focus and investigates several service selection plans based on multidimensional multiple choice Knapsack model. Specifically. proposed in the paper are a plan with response time constraints for each execution flow, a plan with a single constraint over the whole service types and a plan with a constraint on a particular execution path of a composite Web Services. Experiments are conducted to observe the performance of each plan with varying the number of services, the number of branches and the values of response time constraint. Experimental results show that reducing the number of candidate services using Pareto Dominance is very effective and the plan with a constraint over the whole service types is efficient in time and solution quality for small to medium size problems.

  • PDF

Enteric pythiosis in a Jindo dog (진도개의 장에서 발생한 pythium증의 증례보고)

  • Sohn, Yong-sung;Kim, Dae-yong;Kweon, Oh-kyeong;Seo, Il-bok
    • Korean Journal of Veterinary Research
    • /
    • v.36 no.2
    • /
    • pp.447-451
    • /
    • 1996
  • A case of enteric pythiosis in the jejunum is reported in a 28-month-old, male Jindo dog. Grossly, a 20cm segment of the cranial jejunal wall was markedly thickened to a thickness of 10cm and the lumen was narrowed. Histological examination of the jejunum reveals transmurally affected multifocal to coalescing granulomatous inflammation. The granulomatous foci were composed of a necrotic center with neutrophilic infiltration and occasionally non-parallel, branching, septate hyphae surrounded by numerous epithelioid macrophages, multinucleated giant cells, lymphocytes and fibrosis. Multinucleated giant cells occasionally contain fragment of hyphae. The diagnosis was based on light microscopical studies and positive PAS and immunostaining for Pythium insidiosum. This is believed to be the first reported case of canine enteric pythiosis in Korea.

  • PDF

Tracking a Selected Target among Multiple Moving Objects (다수의 물체가 이동하는 환경에서 선택된 물체의 추적기법)

  • 김준석;송필재;차형태;홍민철;한헌수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.363-363
    • /
    • 2000
  • The conventional algorithms which identify and follow a moving target using a camera located at a fixed position are not appropriate for applying to the cases o( using mobile robots, due to their long processing time. This paper proposes a new tracking algorithm based on the sensing system which uses a line light with a single camera. The algorithm categirizes the motion patterns of a pair of mobile objects into parallel, branching, and merging motion, to decide of which objects the trajectories should be calculated to follow the reference object. Kalman Filter is used to estimate the trajectories of selected objects. The proposed algorithm has shown in the experiments that the mobile robot does not miss the target in most cases.

  • PDF

Aspergillosis in breeding ducks

  • Mi Na Han;Mun Hui Chae;Seong Tae Han
    • Korean Journal of Veterinary Service
    • /
    • v.46 no.3
    • /
    • pp.203-210
    • /
    • 2023
  • Breeding ducks are susceptible to fungal infections due to being bred in confined spaces for long periods. The objective of this study was to show the real state of the clinical fungal contamination of 22 duck breeding farms in Chungcheongbuk-do, South Korea. Out of the 430 carcasses obtained from the 22 duck breeding farms, 80 were diagnosed with invasive pulmonary aspergillosis (IPA). Aspergillus spp. were detected as the causative agents, including 26 cases of A. fumigatus, 35 cases of A. flavus, and 19 cases of A. terreus. The clinical lesions in the breeding ducks had circumscribed cream-and-yellow-colored plaques and/or white-to-greenish mycelium. Septate hyphae with parallel walls and dichotomous branching were observed in the histopathological lesions. AGMAg ELISA was performed to determine the overall positive rate of Aspergillus spp. in duck breeding farms. These results showed a positive rate of 58.97% for Aspergillus spp. Additionally, the positive rate increased with the age of the host.

Shape Design Sensitivity Analysis of Dynamic Crack Propagation Problems using Peridynamics and Parallel Computation (페리다이나믹스 이론과 병렬연산을 이용한 균열진전 문제의 형상 설계민감도 해석)

  • Kim, Jae-Hyun;Cho, Seonho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.27 no.4
    • /
    • pp.297-303
    • /
    • 2014
  • Using the bond-based peridynamics and the parallel computation with binary decomposition, an adjoint shape design sensitivity analysis(DSA) method is developed for the dynamic crack propagation problems. The peridynamics includes the successive branching of cracks and employs the explicit scheme of time integration. The adjoint variable method is generally not suitable for path-dependent problems but employed since the path of response analysis is readily available. The accuracy of analytical design sensitivity is verified by comparing it with the finite difference one. The finite difference method is susceptible to the amount of design perturbations and could result in inaccurate design sensitivity for highly nonlinear peridynamics problems with respect to the design. It turns out that $C^1$-continuous volume fraction is necessary for the accurate evaluation of shape design sensitivity in peridynamic discretization.