• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.sup1
• /
• pp.55-63
• /
• 2016

Smoking and harmful drinking dramatically increase health risks but little is known about their cooccurrence and factors that influence this co-habit, limiting development and implementation of appropriately targeted prevention interventions. This study was conducted among youth aged 10-24 years old in the Chi Linh Demographic - Epidemiological Surveillance System (CHILILAB DESS). The total numbers in the first, second and third rounds in 2006, 2009 and 2013 were 12,406, 10,211, and 7,654, respectively. A random-effects logit model controlling for both time-variant and time-invariant variables was applied to explore factors associated with current smoking, harmful drinking, and occurrence of smoking and harmful drinking together. We found dramatically increasing trends in current smoking, harmful drinking and co-occurrence among youth. Our results indicate similar health problems among youth in peri-urban areas in Vietnam. Demographic characteristics (older age, being male, being unmarried, and having informal work) appeared to be predictors for smoking and drinking behaviour. Besides, peer and family members had significant influence on smoking, whereas having a close-friend who was smoking was the most important variable. The results suggested that smoking and harmful drinking should not be solved with separate, stand-alone interventions but rather with integrated efforts.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.433-439
• /
• 2012

This article aims at developing Mind Healing Program for university students, whose anxiety and depression are getting serious. Reality therapy was experimented total 10 times(one time per week), which was the revision and supplement of Woo(1994)'s reality therapy program. It consists of introducing program and self, understanding 5 mind desires, identifying obstacles of conversation, learning efficient communication skills, controling irrational expectation of others, recognizing mind gap, problems of choice and responsibility, nurturing mind, etc. The effectiveness of this program was verified through a model whose research variants were participation motivation, participation satisfaction, and mental health. Direct effects of participation motivation, participation satisfaction, and mental health were less satisfactory than indirect effects of the time when program satisfaction is a variant. It is concluded that mental health of participants is getting better when more satisfactory program should be provided, rather than motivation of simple participation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.852-855
• /
• 2003

Gas-Assisted Injection Molding(GAIM) process, that can be used to provide a hollow shape in a molding, is a variant of the conventional injection molding process. GAIM has many advantages such as reduction of material, sink mark. warpage. and lower injection pressure. Thus, GAIM has been widely applied in the industry to make moldings with a hollow channel such as handles, TV frames and so on. On the other hand, GAIM has some disadvantages such as slow cooling time and flow marks. In the disadvantages, hot gas core causes slow cooling of a molding and the overflow. which is to prevent flow mark. is waste of materials. To solve these problems, we developed a new GAIM system that we called RGIM(Reverse Gas Injection Molding). The RGIM has two special units; one is the overflow buffer, which is used for reduction of a material, and the other tile air unit, which is used for faster cooling of a molding. We conducted an experiment and simulation to verify the efficiency of the RGIM system. Through experiments and simulation, we confirmed the effectively operating of the RGIM system and extracted the optimum process conditions.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.248-255
• /
• 2006

Among a variety of influencing components, time-variant seepage and long-term underground motion are important to understand the abnormal behavior of tunnels. Excessiveness of these two components could be the direct cause of severe damage on tunnels. however, it is not easy to quantify the effect of these on the behavior of tunnels. These parameters can be estimated by using inverse methods once the appropriate relationship between inputs and results are clarified. Various inverse methods or parameter estimation techniques such as artificial neural network and least square method can be used depending on the characteristics of given problems. Numerical analyses, experiments, or monitoring results are frequently used to prepare a set of inputs and results to establish the back analysis models. In this study, a back analysis method has been developed to estimate geotechnically hard-to-known parameters such as permeability of tunnel filter, underground water table, long-term rock mass load, size of damaged zone associated with seepage and long-term underground motion. The artificial neural network technique is adopted and the numerical models developed in the firstpart are used to prepare a set of data for learning process. Tunnel behavior especially the displacements of the lining has been exclusively investigated for the back analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.720-737
• /
• 2024

Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multi-party computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zero-knowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.468-483
• /
• 2001

In order to enhance the performance, cursor stability, which is a variant of isolation lvel 2 in relational DBMSs, has been widely used in place of isolation level 3, which uses strict two phase locking. However, cursor stability is much less usable in object-relational DBMSs (ORDBMSs) because navigational applications in ORDBMSs can suffer from critical inconsistency problems such as dangling pointers, lost updates, and reading inconsistent complex objects. In this paper, we propose a new isolation level, navigation stability, that prevents the inconsistency problems of cursor stability for navigational applications, while avoiding significant degradation of the concurrency of level 3. First, we analyze the inconsistency problems of cursor stability for navigational applications. Second, we define navigation stability as an extension of cursor stability and show that it solves those inconsistency problems of cursor stability in ORDBMSs. For workloads consisting of transactions of long duration, compared with level 3, the throughput of navigation stability is enhanced by up to 200%; the average response time reduced by as much as 55%; and the abort ratio reduced by as much as 77%. From these results, we conclude that navigation stability is a useful isolation level in ORDBMSs that can be used in place of isolation level 3 to improve the performance and concurrency without significantly sacrificing consistency.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.1-16
• /
• 2006

Recently, human based computing environment for supporting users to concentrate only user task without sensing other changes from users is being progressively researched and developed. But middleware deletes steream data processed for reducing process load of massive information from RFID sensor in this computing. So, this kind of middleware have problems when user demands probability or statistics needed for data warehousing or data mining and when user demands very important stream data repeatedly but already discarded in the middleware every former time. In this paper, we designs Sensor Middleware Architecture on Multi Level Spatial DBMS with Snapshot and manage repeatedly required stream datas to solve reusing problems of historical stream data in current middleware. This system uses disk databse that manages historical stream datas filtered in middleware for requiring services using historical stream information as data mining or data warehousing from user, and uses memory database that mamages highly reuseable data as a snapshot when stream data storaged in disk database has high reuse frequency from user. For the more, this system processes memory database management policy in a cycle to maintain high reusement and rapid service for users. Our paper system solves problems of repeated requirement of stream datas, or a policy decision service using historical stream data of current middleware. Also offers variant and rapid data services maintaining high data reusement of main memory snapshot datas.