• Title/Summary/Keyword: segments

Search Result 3,446, Processing Time 0.034 seconds

Effect of Polymerization Procedure on Thermal and Mechanical Properties of Polyether Based Thermoplastic Polyurethanes

  • Kim, Seong-Geun;Lee, Dai-Soo
    • Macromolecular Research
    • /
    • v.10 no.6
    • /
    • pp.365-368
    • /
    • 2002
  • Thermoplastic polyurethanes (TPUs) with different hard segment length has been prepared from a fixed molar ratio of poly(tetramethylene ether glycol), 4,4'-diphenylmethane diisocyanate, and 1,4-butanediol by different polymerization procedures. Results reveal that the on-set temperature of endotherms ( $T_{cc}$ ) due to the crystallization of hard segments by cooling the TPUs from melt and the peak temperature of endotherms due to the melting of hard segments ( $T_{mh}$ ) by heating the TPUs increased and levelled off with increasing the hard segment length of TPUs. It has also been observed that soft segment glass transition temperature ( $T_{gs}$ ) of TPU decreased slightly with increasing the hard segment length, which explains less mixing of soft segments and hard segments. In tensile measurement of TPUs, strain hardening is observed with increasing the hard segment length, which is attributed to the strain induced crystallization of soft segments.

Effects of IAA on the Elongation and Cell Wall Glycosidase Activities in Excised Rape (Brassica napus L. cv. Yongdang) Hypocotyl Segments (유채 하배축 분절의 신장과 세포벽 분해효소의 활성에 미치는 IAA의 효과)

  • Jun, Sung-Soo
    • Journal of Plant Biology
    • /
    • v.27 no.2
    • /
    • pp.43-50
    • /
    • 1984
  • Effects of IAA on the elongation and cell wall hlysocidase activities were investigated in excised rape (Brassica napus L. cv. Yongdang) hypocotyl segments. IAA promoted the elongation of rape hypocotyl segments. In rape hypocotyls, the first 10-mm segments from the hook exhibited maximal elongation and the capacity of elongation was gradually decreased with increasing distance of each 10-mm from the hook. A good correlation has been obtained between the magnitude of endogenous growth and the activities of $\alpha$, $\beta$-glucosidase and $\alpha$, $\beta$-galactosidase. However, exogenous application of IAA did not seem to enhance the tissue with IAA resulted in acidification of the incubation medium. From these data, we can conclude that IAA seems to enhance elongation of the tissue segments, at least in part, by releasing hydrogen ion into cell wall, some of which may participate in the cell wall extension process, but does not seem to trigger the activation of $\alpha$, $\beta$-glucosidase and $\alpha$, $\beta$-galactosidase.

  • PDF

Android Application for Connecting Cycling Routes on Strava Segments

  • Mulasastra, Intiraporn;Kao-ian, Wichpong
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.2
    • /
    • pp.142-148
    • /
    • 2019
  • Relatively few countries provide separate bicycle lanes for cyclists. Hence, tools for suggesting cycling routes are essential for a safe and pleasant cycling experience. This study aims to develop a mobile application to build cycling routes based on user preferences, specifically location, search radius, ride distance, and number of optimal routes. Our application calls the Strava API to retrieve Strava cycling segments crowdsourced from the cycling community. Then, it creates a graph consisting of the start and end points of these segments. Beginning from a user-specified location, the depth-first search algorithm (DFS) is applied to find routes that conform to the user's preferences. Next, a set of optimal routes is obtained by computing a trade-off ratio for every discovered route. This ratio is calculated from the lengths of all segments and the lengths of all connecting paths. The connected routes can be displayed on a map on an Android device or exported as a GPX file to a bike computer. Future work must be performed to improve the design of the user interface and user experience.

Simplified nonlinear simulation for composite segmental lining of rectangular shield tunnels

  • Zhao, Huiling;Liu, Xian;Yuan, Yong
    • Structural Engineering and Mechanics
    • /
    • v.81 no.4
    • /
    • pp.513-522
    • /
    • 2022
  • Steel-concrete composite segments replacing the conventional reinforced concrete segments can provide the rectangular shield tunnel superiorities on bearing capacity, ductility and economy. A simplified model with high-efficiency on computation is proposed for investigating the nonlinear response of the rectangular tunnel lining composed of composite segments. The simulation model is developed by an assembly of nonlinear fiber beam elements and spring elements to express the transfer mechanism of forces through components of composite segments, and radial joints. The simulation is conducted with the considerations of material nonlinearity and geometric nonlinearity associated with the whole loading process. The validity of the model is evaluated through comparison of the proposed nonlinear simulation with results obtained from the full-scale test of the segmental tunnel lining. Furthermore, a parameter study is conducted by means of the simplified model. The results show that the stiffness of the radial joint at haunch of the ling and the thickness of inner steel plate of segments have remarkable influence on the behaviour of the lining.

Single-View Reconstruction of a Manhattan World from Line Segments

  • Lee, Suwon;Seo, Yong-Ho
    • International journal of advanced smart convergence
    • /
    • v.11 no.1
    • /
    • pp.1-10
    • /
    • 2022
  • Single-view reconstruction (SVR) is a fundamental method in computer vision. Often used for reconstructing human-made environments, the Manhattan world assumption presumes that planes in the real world exist in mutually orthogonal directions. Accordingly, this paper addresses an automatic SVR algorithm for Manhattan worlds. A method for estimating the directions of planes using graph-cut optimization is proposed. After segmenting an image from extracted line segments, the data cost function and smoothness cost function for graph-cut optimization are defined by considering the directions of the line segments and neighborhood segments. Furthermore, segments with the same depths are grouped during a depth-estimation step using a minimum spanning tree algorithm with the proposed weights. Experimental results demonstrate that, unlike previous methods, the proposed method can identify complex Manhattan structures of indoor and outdoor scenes and provide the exact boundaries and intersections of planes.

Terminal Nucleotide Sequences in the Double-stranded RNA Genome Segments of Infectious Pancreatic Necrosis Virus DRT Strain

  • Chung, Hye-Kyung;Park, Hong-Chul;Ichiro Uyeda;Masamichi Isogai;Lee, Hyung-Hoan
    • Journal of Microbiology and Biotechnology
    • /
    • v.6 no.5
    • /
    • pp.361-363
    • /
    • 1996
  • The terminal regions of the double-stranded RNA (dsRNA) genome segments of infectious pancreatic necrosis virus (IPNV) DRT strain were sequenced. The dsRNAs, which were $^{32}P$-labelled at their 3'-termini by incubation with [$^{32}P$]pCp and T4 RNA ligase, were separated by 5$%$ polyacrylamide gel electrophoresis, and the segments A and B of IPNV-DRT were sequenced by two-dimensional gel electrophoresis. The 5'-terminal sequences of the IPNV-DRT plus strand from two genome segments were found to have the same conserved nucleotide (5'-CGG(C/A)A-), but the 3'-terminal sequences -CCCCAGGCG-3' and -CGGACCCCG-3' were found in the plus strand from segments A and B, respectively. The inverted oligonucleotide sequences of 3'-terminal of between segments A and B were found and they differ from those of other IPNVs.

  • PDF

A Study on Primitive Segments Extraction from Printed Korean Characters by means of a Directional Projection (방향 투영에 의한 인쇄체 한글의 기본 선소 추출에 관한 연구)

  • Kim, Sang-Woon;Lee, Ryeong-Rae;Lee, Gyu-Won;Park, Kyu-Tae
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1100-1103
    • /
    • 1987
  • In this paper, we report a method for the primitive segments extraction from printed Korean characters without thinning as a preliminary stage to design an efficient recognition system. The primitive segments are defined by fundamental subpatterns which are vertical(I), right sloping(/), left. sloping(\). horizontal(-), and circular segment(o). The circular segment among the five kinds of segment is different from the others in geometrical properties. Therefore, at first, the circular segment is extracted by using the closed circle of the inner boundary and the geometrical characteristics of its outer. Next, linear segments are separated from the character pattern by means of a directional coding method. Finally, primitive segments are extracted from each set of linear segments by using a projection profile which involves the fact whether the segment has branches or not. The experimental results show that this method reduces computation time and storage space in comparision with the existing methods.

  • PDF

Arc/Line Segments-based SLAM by Updating Accumulated Sensor Data (누적 센서 데이터 갱신을 이용한 아크/라인 세그먼트 기반 SLAM)

  • Yan, Rui-Jun;Choi, Youn-sung;Wu, Jing;Han, Chang-soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.936-943
    • /
    • 2015
  • This paper presents arc/line segments-based Simultaneous Localization and Mapping (SLAM) by updating accumulated laser sensor data with a mobile robot moving in an unknown environment. For each scan, the sensor data in the set are stored by a small constant number of parameters that can recover the necessary information contained in the raw data of the group. The arc and line segments are then extracted according to different limit values, but based on the same parameters. If two segments, whether they are homogenous features or not, from two scans are matched successfully, the new segment is extracted from the union set with combined data information obtained by means of summing the equivalent parameters of these two sets, not combining the features directly. The covariance matrixes of the segments are also updated and calculated synchronously employing the same parameters. The experiment results obtained in an irregular indoor environment show the good performance of the proposed method.

An Analysis of the Hazardous Highway Segments Using Continuous Risk Profile Method (고속도로 사고잦은 지점 분석방법 연구)

  • Lee, Soo-Il;Yu, Jun-Seok
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.6
    • /
    • pp.180-185
    • /
    • 2010
  • We have to develop more correct and systematic way to choose Hazardous Highway Segments. In this research, we applied CRP(Continuous Risk Profile) technique which developed by UC Berkeley Traffic Safety Center in year of 2007, and can analyze yearly dangerous level tendency of continuity in the route of main road that is under California Department of Transportation(Caltrans). We changed standard of CRP to suit in Korean circumstance with consideration in radius of curve and traffic volume. For the verification by actual accident data, we embodiment the CRP by using the data from total of 587 case of accident in latest 10 years in Gyeong-Bu Highways, the amount of 56km. Finally, the effectiveness of technique in this research has been verified by obtained same result with current method for Hazardous Highway Segments. In addition, when calculating the Hazardous Highway Segments with technique that presented in this research we obtained following statements. First, identified dangerous level of continuity in the route by using CRP. Second, Accurate of Actual Hazardous Highway Segments selection has been developed by using last 10 year's data and profile making which provide simplicity analyze of Tendency. Third, after reforming the way of selection, effective range has been wider than former selection and it gives advantage for the policy side.

Vertex-based shape coding based on the inter-segment distance (블록간 상대거리에 의한 정점기반 모양정보 부호화 기법)

  • 이진학;정재원;문주희;김재균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7A
    • /
    • pp.1017-1027
    • /
    • 2000
  • In this paper, we propose a new coding method based on the distance between vertex segments for vertex positions in the vertex-based shape coding. The pixel lines are divided into the segments of a fixed length, and the segments that have vertex pixels are called vertex segments. We analyze the probability distribution of the relative distance between vertex segments and prove that it depends only on the ratio between the number of vertices and the number of segments. Considering the coding efficiency and implementation complexity, we choose a particular ratio to make a code table. For each input image, the segment size is chosen according tothe ratio, and the relative segment distances are entropy coded. It is shown that the proposed method is efficient for the images with many vertices.

  • PDF