• Title/Summary/Keyword: Two stage approach

Search Result 554, Processing Time 0.025 seconds

Optimization of Coffee Extract Condition for the Manufacture of Instant Coffee by RSM (인스턴트커피 제조를 위한 커피추출조건 최적화)

  • Ko, Bong Soo;Lim, Sang Ho;Han, Sung Hee
    • The Korean Journal of Food And Nutrition
    • /
    • v.30 no.2
    • /
    • pp.319-325
    • /
    • 2017
  • In this study, we optimized the coffee extraction conditions for instant coffee production in two stage percolators, which is the most common coffee extractor for instant coffee production. A central composite design was used to build mathematical model equations for response surface methodology (RSM). In these equations, the yield and overall acceptability of the coffee extracts were expressed as second-order functions of three factors, the feed water temperature, draw-off factor (DOF), and extraction time (cycle time). Based on the result of RSM, the optimum conditions were obtained with the use of desirability function approach (DFA) which find the best compromise area among multiple options. The optimum extraction conditions to maximize the yield and overall acceptability over 40% of yield were found with $163^{\circ}C$ of feed water temperature, 4.3 of DOF and 27 minutes of extraction time (cycle time). These results provide a basic data for the coffee extraction conditions for the competitive instant coffee in the industry.

Segment-based Foreground Extraction Dedicated to 3D Reconstruction (3차원 복원을 위한 세그멘트 기반의 전경물체 추출)

  • Kim, Jeong-Hwan;Park, An-Jin;Jeong, Gi-Cheol
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.625-630
    • /
    • 2009
  • Researches of image-based 3D reconstruction have recently produced a number of good results, but they assumed that the accurate foreground to be reconstructed is already extracted from each input image. This paper proposes a novel approach to extract more accurate foregrounds by iteratively performing foreground extraction and 3D reconstruction in a manner similar to an EM algorithm on regions segmented in an initial stage, called segments. Here, the segments should preserve foreground boundaries to compensate for the boundary errors generated by visual hull, simple 3D reconstruction to minimize the computational time, and should also be composed of the small number of sets to minimize the user input. Therefore, we utilize image segmentation using the graph-cuts method, which minimizes energy function composed of data and smoothness terms, and the two methods are iteratively performed until the energy function is optimized. In the experiments, more accurate results of the foreground, especially in boundaries, were obtained, although the proposed method used a simple 3D reconstruction method.

  • PDF

Simulation on Optimum Repairing Number of Carbonated RC Structure Based on Probabilistic Approach (확률론을 고려한 탄산화된 RC 구조물의 최적 보수시기 해석)

  • Kwon, Seung-Jun
    • Journal of the Korean Recycled Construction Resources Institute
    • /
    • v.5 no.3
    • /
    • pp.230-238
    • /
    • 2017
  • Carbonation is a representative deterioration for underground structure, which causes additional repair for service life. This study proposes a simplified equation for optimum repair timing without complicated probability calculation, considering initial and repair conditions For the work, initial service life, extended service life through repair, and their COVs(Coefficient of Variation) are considered, and the periods which can reduce number of repair are evaluated. Assuming the two service lives to be independent, the repair timings are derived from 10 to 50 years based on the probabilistic method, and the regression analysis technique for optimum repairing timing is proposed. Decreasing COV has insignificant effect on reducing repairing number but shows a governing effect on changes in probability near the critical repairing stage. The extension of service life through repairing is evaluated to be a critical parameter for reducing repairing number. The proposed technique can be efficiently used for maintenance strategy with actual COV of initial and additional service life due to repairing.

A Balanced Approach to the Planning and Design of Urban Streets (보행자와 자동차를 동시에 고려한 도시 가로의 균형적 계획 및 설계에 관한 연구)

  • Kim, Yong-Seok;Choe, Jae-Seong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6 s.92
    • /
    • pp.55-64
    • /
    • 2006
  • Pedestrians and vehicle users ate competing for limited space in urban streets. Therefore, strategical planning and design should be considered to balance the needs placed on urban streets. The study suggested a way to put this concept in to practice by comparing level of service(LOS) of pedestrians and vehicles in the planning and design stage. Also. the study considered the priority among two users basing on the land use characteristics and the functional hierarchy of the streets. In order to overcome the lack or prediction or survey of pedestrian demands in design process, new pedestrian LOS applicable to sidewalk design was suggested based on the comfort linked with the physical limitation. The comparison of the suggested way and the existing way provided at the end of the paper.

Shadow Removal based on Chromaticity and Brightness Distortion for Effective Moving Object Tracking (효과적인 이동물체 추적을 위한 색도와 밝기 왜곡 기반의 그림자 제거)

  • Kim, Yeon-Hee;Kim, Jae-Ho;Kim, Yoon-Ho
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.249-256
    • /
    • 2015
  • Shadow is a common physical phenomenon in natural images and may cause problems in computer vision tasks. Therefore, shadow removal is an essential preprocessing process for effective moving object tracking in video image. In this paper, we proposed the method of shadow removal algorithm using chromaticity, brightness distortion and direction of shadow candidate. The proposed method consists of two steps. First, removal process of primary shadow candidate region by using chromaticity, brightness and distortion. The second stage applies the final shadow candidate region to obtain a direction feature of shadow which is estimated by the thinning algorithm after calculating the lowest pixel position of the moving object. To verify the proposed approach, some experiments are conducted to draw a compare between conventional method and that of proposed. Experimental results showed that proposed methodology is simple, but robust and well adaptive to be need to remove a shadow removal operation.

STP Development for Rejuvenation of Declining Industrial City: Kitakyushu, Japan

  • Cha, Sang-Ryong;Miyakawa, Yasuo
    • World Technopolis Review
    • /
    • v.1 no.1
    • /
    • pp.56-64
    • /
    • 2012
  • This paper provides a case study to explore the Kitakyushu case as a good referential example on STP development for rejuvenation of declining industrial city. The major data for the case, basically, has been sourced from some materials published by the municipality of Kitakyushu City, the website of the Kitakyushu Science and Research Park (KSRP) etc. The City of Kitakyushu has promoted the KSRP development to overcome industrial decline and stimulate city renaissance as a new industrial city. The core of the development was to develop a high-level education and research environment by gathering several HEIs into one campus. Based on the environment, the Kitakyushu Foundation for the Advancement of Industry and Science and Technology (FAIS) played the critical role as a coupler to make various networks and boost industry-academiaadministration innovation. The KSRP, and then, has been designated as a project area of some cluster projects initiated by the central government. It means that local projects can be synchronized, synergized and synthesized with national projects in the KSRP. In addition, through a series of the environmental approach from the Kitakyushu Eco-town Project to the Low Carbon Society Project, the development of the KSRP is being extended into the region. In the Kitakyushu case, networking is the essence of the KSRP development from the planning stage. First of all, the plan put emphasis on networking of academia for the knowledge creation based on competitive collaboration that is expected as the mainspring of rejuvenating declining industrial area and making a new industrial city that the plan aimed. Then, the roles of two organizations are very important for networking, especially networking of networks: the Campus Management Committee as an interface and the FAIS as a coupler. STP development without some strategic considerations for networking as the way of interaction among its participants cannot be a tool to promote innovation and rejuvenate a declining industrial area. The Kitakyushu case mentioned above explains the matter clearly.

Animated Mesh Compression with Semi-regular Remeshing (준균일 메쉬 재구성를 이용한 메쉬 시퀀스 압축 기법)

  • Ahn, Min-Su
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.5
    • /
    • pp.76-83
    • /
    • 2009
  • This paper presents a compression method for animated meshes or mesh sequences which have a shared connectivity and geometry streams. Our approach is based on static semi-regular mesh compression algorithm introduced by Khodakovky et al. Our encoding algorithm consists of two stages. First, the proposed technique creates a semi-regular mesh sequence from an input irregular mesh sequence. For semi-regular remeshing of irregular mesh sequences, this paper adapts the MAPS algorithm. However, MAPS cannot directly be performed to the input irregular mesh sequence. Thus, the proposed remesh algorithm revises the MAPS remesher using the clustering information, which classify coherent parts during the animation. The second stage uses wavelet transformation and clustering information to compress geometries of mesh sequences efficiently. The proposed compression algorithm predicts the vertex trajectories using the clustering information and the cluster transformation during the animation and compress the difference other frames from the reference frame in order to reduce the range of 3D position values.

Maximizing Concurrency and Analyzable Timing Behavior in Component-Oriented Real-Time Distributed Computing Application Systems

  • Kim, Kwang-Hee Kane;Colmenares, Juan A.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.56-73
    • /
    • 2007
  • Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

Epigenetic Changes within the Promoter Regions of Antigen Processing Machinery Family Genes in Kazakh Primary Esophageal Squamous Cell Carcinoma

  • Sheyhidin, Ilyar;Hasim, Ayshamgul;Zheng, Feng;Ma, Hong
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.23
    • /
    • pp.10299-10306
    • /
    • 2015
  • The esophageal squamous cell carcinoma (ESCC) is thought to develop through a multi-stage process. Epigenetic gene silencing constitutes an alternative or complementary mechanism to mutational events in tumorigenesis. Posttranscriptional regulation of human leukocyte antigen class I (HLA-I) and antigen processing machinery (APM) proteins expression may be associated with novel epigenetic modifications in cancer development. In the present study, we determined the expression levels of HLA-I antigen and APM components by immunohistochemistry. Then by a bisulfite-sequencing PCR (BSP) approach, we identified target CpG islands methylated at the gene promoter region of APM family genes in a ESCC cell line (ECa109), and further quantitative analysis of CpG site specific methylation of these genes in cases of Kazakh primary ESCCs with corresponding non-cancerous esophageal tissues using the Sequenom MassARRAY platform. Here we showed that the development of ESCCs was accompanied by partial or total loss of protein expression of HLA-B, TAP2, LMP7, tapasin and ERp57. The results demonstrated that although no statistical significance was found of global target CpG fragment methylation level sof HLA-B, TAP2, tapasin and ERp57 genes between ESCC and corresponding non-cancerous esophageal tissues, there was significant differences in the methylation level of several single sites between the two groups. Of thesse only the global methylation level of LMP7 gene target fragments was statistically higher ($0.0517{\pm}0.0357$) in Kazakh esophageal cancer than in neighboring normal tissues ($0.0380{\pm}0.0214$, p<0.05). Our results suggest that multiple CpG sites, but not methylation of every site leads to down regulation or deletion of gene expression. Only some of them result in genetic transcription, and silencing of HLA-B, ERp57, and LMP7 expression through hypermethylation of the promoters or other mechanisms may contribute to mechanisms of tumor escape from immune surveillance in Kazakh esophageal carcinogenesis.

A Study on an Efficient Double-fleet Operation of the Korean High Speed Rail (한국 고속철도의 효율적 중련편성 운영방법에 대한 연구)

  • Oh, Seog-Moon;Sohn, Moo-Sung;Choi, In-Chan
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.6
    • /
    • pp.742-750
    • /
    • 2007
  • This paper presents a mathematical model for a double-fleet operation in Korean high speed rail (HSR). KORAIL has a plan to launch new HSR units in 2010, which are composed of 10 railcars. The double-fleet operation assigns a single-unit or two-unit fleet to a segment, accommodating demand fluctuation. The proposed model assumes stochastic demand and uses chance-constrained constraints to assure a preset service level. It can be used in the tactical planning stage of the rail management as it includes several real-world conditions, such as the capacities of the infra-structures and operational procedures. In the solution approach, the expected revenue in the objective function is linearized by using expected marginal revenue, and the chance-constrained constraints are linearized by assuming that demands are normally distributed. Subsequently, the model can be solved by a mixed-integer linear programming solver fur small size problems. The test results of the model applied to Friday morning train schedules for one month sample data from KTX operation in 2004 shows that the proposed model could be utilized to determine the effectiveness of double-fleet operation, which could significantly increase the expected profit and seat utilization rates when properly maneuvered.