• Steel and Composite Structures
• /
• v.50 no.2
• /
• pp.149-158
• /
• 2024

Considering that different boundary conditions can have an important impact on structural vibration characteristics. In this paper, the nonlinear forced vibration behavior of functionally graded material (FGM) doubly curved shells with initial geometric imperfections under different boundary conditions is studied. Considering initial geometric imperfections and von Karman geometric nonlinearity, the nonlinear governing equations of FGM doubly curved shells are derived using Reissner's first order shear deformation (FOSD) theory. Three different boundary conditions of four edges simply supported (SSSS), four edges clamped (CCCC), clamped-clamped-simply-simply (CCSS) were studied, and a system of nonlinear ordinary differential equations was obtained with the help of Galerkin principle. The nonlinear forced vibration response of the FGM doubly curved shell is obtained by using the modified Lindstedt Poincare (MLP) method. The accuracy of this method was verified by comparing it with published literature. Finally, the effects of curvature ratio, power law index, void coefficient, prestress, and initial geometric imperfections on the resonance of FGM doubly curved shells under different boundary conditions are fully discussed. The relevant research results can provide certain guidance for the design and application of doubly curved shell.

• Journal of Applied and Pure Mathematics
• /
• v.6 no.1_2
• /
• pp.55-69
• /
• 2024

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} && p\;\text{is even} \\ {\frac{p-1}{2}} && p\;\text{is odd,}}$$ and M = {±1, ±2, … ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{s}}_{{\lambda}_1}-\bar{\mathbb{s}}_{{\lambda}^c_1}{\mid}\,{\leq}\,1$ where $\bar{\mathbb{s}}_{{\lambda}_1}$ and $\bar{\mathbb{s}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G with a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of some union of graphs.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.1-14
• /
• 2024

Let G = (V, E) be a (p, q) graph. Define $$\begin{cases}\frac{p}{2},\:if\:p\:is\:even\\\frac{p-1}{2},\:if\:p\:is\:odd\end{cases}$$ and L = {±1, ±2, ±3, ···, ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different elements of V when p is even and different labels in L to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that |Δ_f1 - Δ_f^c1| ≤ 1, where Δ_f1 and Δ_f^c1 respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of subdivision of some graphs.

• Nuclear Engineering and Technology
• /
• v.55 no.11
• /
• pp.4167-4172
• /
• 2023

Miniaturized tissue equivalent proportional counters (mini-TEPCs) are proper for radiation dosimetry in medical application because the small size of the dosimeter could prevent pile-up effect under the high intensity of therapeutic beam. However, traditional methods of calibrating mini-TEPCs using internal alpha sources are not feasible due to their small size. In this study, we investigated the use of electron and proton edges on Monte Carlo-generated lineal energy spectra as markers for calibrating a 0.9 mm diameter and length mini-TEPC. Three possible markers for each spectrum were calculated and compared using different simulation tools. Our simulations showed that the electron edge markers were more consistent across different simulation tools than the proton edge markers, which showed greater variation due to differences in the microdosimetric spectra. In most cases, the second marker, y_δδ, had the smallest uncertainty. Our findings suggest that the lineal energy spectra from mini-TEPCs can be calibrated using Monte Carlo simulations that closely resemble real-world detector and source geometries.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.84-95
• /
• 2011

In this paper, we present a deblocking algorithm that removes grid and staircase noises, which are called "blocking artifacts", occurred in the compressed satellite images. Particularly, the given satellite images are compressed with equal quantization coefficients in row according to region complexity, and more complicated regions are compressed more. However, this approach has a problem that relatively less complicated regions within the same row of complicated regions have blocking artifacts. Removing these artifacts with a general deblocking algorithm can blur complex and undesired regions as well. Additionally, the general filter lacks in preserving the curved edges. Therefore, the proposed algorithm presents an adaptive filtering scheme for removing blocking artifacts while preserving the image details including curved edges using the given quantization step size and content analysis. Particularly, WLFPCA (weighted lowpass filter using principle component analysis) is employed to reduce the artifacts around edges. Experimental results showed that the proposed method outperforms SA-DCT in terms of subjective image quality.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.243-248
• /
• 2011

In this paper, we propose a new method to extract palm lines and read it with simple techniques from one photo. We use morphological information and 8-directional contour tracking algorithm. From the digitalized image, we transform original RGB information to YCbCr color model which is less sensitive to the brightness information. The palm region is extracted by simple threshold as Y:65~255, Cb:25~255, Cr:130~255 of skin color. Noise removal process is then followed with morphological information of the palm such that the palm area has more than quarter of the pixels and the rate of width vs height is more than 2:1 and 8-directional contour tracking algorithm. Then, the stretching algorithm and Sobel mask are applied to extract edges. Another morphological information that the meaningful edges(palm lines) have between 10 and 20 pixels is used to exclude noise edges and boundary lines of the hand from block binarized image. Main palm lines are extracted then by labeling method. This algorithm is quite effective even reading the palm from a photographed by a mobile phone, which suggests that this method could be used in various applications.

• Journal of the Korean earth science society
• /
• v.22 no.6
• /
• pp.512-527
• /
• 2001

Separated flows passed complex geometries are modeled by discrete vortex techniques. The flows are assumed to be rotational and inviscid, and a new techlnique is described to determine the stream functions for linear shear profiles. The geometries considered are the snow cornice and the backward-facing step, whose edges allow for the separation of the flow and reattachment downstream of the recirculation regions. A point vortex has been added to the flows in order to constrain the separation points to be located at the edges, while the conformal mappings have been modified in order to smooth the sharp edges and to let the separation points free to oscillate around the points of maximum curvature. Unsteadiness is imposed to the flow by perturbing the vortex location, either by displacing the vortex from the equilibrium, or by imposing a random perturbation with zero mean to the vortex in equilibrium. The trajectories of passive scalars continuously released upwind of the separation point and trapped by the recirculating bubble are numerically integrated, and concentration time series are calculated at fixed locations downwind of the reattachment points. This model proves to be capable of reproducing the trapping and intermittent release of scalars, in agreement with the simulation of the flow passed a snow cornice performed by a discrete multi-vortex model, as well as with direct numerical simulations of the flow passed a backward-facing step. The results of simulation indicate that for flows undergoing separation and reattachment the unsteadiness of the recirculating bubble is the main mechanism responsible for the intense large-scale concentration fluctuations downstream.

• Journal of the Economic Geographical Society of Korea
• /
• v.15 no.3
• /
• pp.343-357
• /
• 2012

The Seoul metropolitan subway system can be represented by a graph which consists of nodes and edges. In this paper, we study classification of subway stations and trip behaviour of subway passengers through partitioning the graph of the subway system into roughly equal groups. A weight of each edge of the graph is set to the number of passengers who pass the edge, where the number of passengers is extracted from the transportation card transaction database. Since the graph partitioning problem is NP-complete, we propose a heuristic algorithm to partition the subway graph. The heuristic algorithm uses one of two alternative objective functions, one of which is to minimize the sum of weights of edges connecting nodes in different groups and the other is to maximize the ratio of passengers who get on the subway train at one subway station and get off at another subway station in the same group to the total subway passengers. In the experimental results, we illustrate the subway stations and edges in each group by color on a map and analyze the trip behaviour of subway passengers by the group origin-destination matrix.

• Journal of Broadcast Engineering
• /
• v.17 no.5
• /
• pp.742-755
• /
• 2012

In this paper, we propose a parallel deblocking algorithm to resolve workload imbalance when the deblocking filter of high efficiency video coding (HEVC) decoder is parallelized. In HEVC, the deblocking filter which is one of the in-loop filters conducts two-step filtering on vertical edges first and horizontal edges later. The deblocking filtering can be conducted with high-speed through data-level parallelism because there is no dependency between adjacent edges for deblocking filtering processes. However, workloads would be imbalanced among regions even though the same amount of data for each region is allocated, which causes performance loss of decoder parallelization. In this paper, we solve the problem for workload imbalance by predicting the complexity of deblocking filtering with coding unit (CU) depth information at a coding tree block (CTB) and by allocating the same amount of workload to each core. Experimental results show that the proposed method achieves average time saving (ATS) by 64.3%, compared to single core-based deblocking filtering and also achieves ATS by 6.7% on average and 13.5% on maximum, compared to the conventional uniform data-level parallelism.