• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.387-396
• /
• 2003

In this paper, we present more efficient Protocol than that of Ford and Kaliski. We use RSA in the roaming protocol and it Plays decisive role to reduce the total time cost. We show that our protocol is safe from various attacks. We present the performance of our protocol and verify that This protocol needs fewer secure channel like SSL than other protocols.

• The tire
• /
• s.225
• /
• pp.21-22
• /
• 2005

지난 봄 주요 자동차 제조사인 Ford사와 Daimler Chrysler사가 '정상적으로 6년 사용된 타이어는 교체되어야 한다'는 권고사항을 운전자 메뉴얼 등에 삽입할 것이라고 발표한 이래, 타이어 노화와 수명관련 논란은 계속되고 있다.

• The tire
• /
• s.14
• /
• pp.4-17
• /
• 1968

본고는 1967년 5월 미국 Chicago시에서 열린 미국자동차기술협회(SAE)의 연례 회의에서 Ford자동차회사의 J.L. Martin씨가 발표한 연구논문을 역초한 것이다.

• Journal of the Korean Ceramic Society
• /
• v.19 no.2
• /
• pp.115-120
• /
• 1982

The main objective of this work was to study the efTect of pressed density of pellets prepared from an oxide powder on their fired density and to prove experimentally the parabolic relationship proposed by FORD. A-I6 and A-J7 alumina powders. which showed quite dlfrerent powder characteristics but were essentially very reactive powders, were employed, and a series of pelIets weIe pressed in a 1l.2mm diameter hardened steel die with a hydraulic press and a mechanically operated press in order to obtain a wide range of pressed demity. Density ranges from 35 to 65 % theoretical for A-16, and 46 to 66 % theoretical far A-17 were obtained and the highest pressed density achieved using lubricant was 67.8 % theoretical. CompactlOn mechanisms for A-16 and A-I 7 were deduced. Several plots of ($D_F$-$D_P$) against DpjDT showed reasonable parabola and temperature dependence and the maximum density increase occurred when the pressed density was approximately 50% theoretical. The parabolic relationship was confirmed by linear plot of ($D_F$-$D_P$) against (1-$\frac{D_P}{D_T})$).

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.1
• /
• pp.275-280
• /
• 2019

Roger Deakens is one of the best director of photography in the world. He has been worked with Joel Coen & Ethan Coen since (1991). He was nominated for Academy award 13 times. At last, he won the 2018 Academy Award for Best Pictures of the Year. This article aim to look at his style of photography, which he has consistently pursued, and how he controls and implements light. Focusing on The Assassination of Jess James by the coward Robert Ford>,, .

• Journal of Practical Agriculture & Fisheries Research
• /
• v.11 no.1
• /
• pp.173-179
• /
• 2009

Fruit quality is essential for increasing marketability and consumer acceptance. To suggest an easy method for measurement of squash fruit quality, 10 varieties/cultivars and 1 populations were used as experimental materials. The fruits were harvested in marketable maturity to investigate the relation between quality factors and sensory test. The total solids content is one of the most important factors associated with sensory taste in fruits. The major squash varieties/cultivars such as 'Puthobag', 'Seoulmadi', 'Aehobag 1', 'Aehobag 2', 'Ford Zucchini', and 'Zucchini' showed total solids content of 6.4, 7.5, 7.3, 5.8, 4.7, and 4.30%, respectively. The preference values for 'Puthobag', 'Seoulmadi', 'Aehobag 1', and 'Aehobag 2', which are generally preferable varieties/cultivars, were 4.6, 4.7, 4.8, and 4.3, respectively. On the other hand, the preference values for variety 'Ford Zucchini' and cultivar 'Zucchni', which are not generally preferable, were 1.6 and 1.4, respectively. There was no significant correlation between plant length and total solids content or starch content in the fruits thereby suggesting the possibility of breeding bush type squash cultivars with good taste. This easy method of weighing dry matters of squash fruits might be useful for marketable quality index.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Journal of the Korean Institute of Gas
• /
• v.25 no.1
• /
• pp.20-29
• /
• 2021

During multi-stage fracturing in a low permeable shale formation, stress interference occurs between the stages which is called the "stress shadow effect(SSE)". The effect may alter the fracture propagation direction and induce ununiform geometry. In this study, the stress shadow effect on the hydraulic fracture geometry and the well productivity were investigated by the commercial full-3D fracture model, GOHFER. In a homogeneous reservoir model, a multi-stage fracturing process was performed with or without the SSE. In addition, the fracturing was performed on two shale reservoirs with different geomechanical properties(Young's modulus and Poisson's ratio) to analyze the stress shadow effect. In the simulation results, the stress change caused by the fracture created in the previous stage switched the maximum/minimum horizontal stress and the lower productivity L-direction fracture was more dominating over the T-direction fracture. Since the Marcellus shale is more brittle than more dominating over the T-direction fracture. Since the Marcellus shale is more brittle than the relatively ductile Eagle Ford shale, the fracture width in the former was developed thicker, resulting in the larger fracture volume. And the Marcellus shale's Young's modulus is low, the stress effect is less significant than the Eagle Ford shale in the stage 2. The stress shadow effect strongly depends on not only the spacing between fractures but also the geomechanical properties. Therefore, the stress shadow effect needs to be taken into account for more accurate analysis of the fracture geometry and for more reliable prediction of the well productivity.