• International Journal of Computer Science & Network Security
• /
• 제22권8호
• /
• pp.404-412
• /
• 2022

The development in the field of the internet of things (IoT) have improved the quality of the life and also strengthened different areas in the society. All cities across the world are seeking to become smarter. The creation of a smart parking system is the essential use case in smart cities. In recent couple of years, the number of vehicles has increased significantly. As a result, it is critical to make the use of technology that enables hassle-free parking in both public and private spaces. In conventional parking systems, drivers are not able to find free parking space. Conventional systems requires more human interference in a parking lots. To manage these circumstances there is an intense need of IoT enabled parking solution that includes the well defined architecture that will contain the following components such as smart sensors, communication agreement and software solution. For implementing such a smart parking system in this paper we proposed a design of smart parking system and also compare it with convetional system. The proposed design utilizes sensors based on IoT and Data Mining techniques to handle real time management of the parking system. IoT enabled smart parking solution minimizes the human interference and also saves energy, money and time.

• 정보교육학회논문지
• /
• 제11권1호
• /
• pp.29-38
• /
• 2007

최근 컴퓨터 교육에서 프로그래밍에 대한 관심이 높아지고 있다. 학습에서 논리력과 창의력의 요구가 늘어나고 있는 추세에 힘입어 컴퓨터 교육 분야에서도 프로그래밍 학습을 통한 논리력과 창의력을 함양하려는 다양한 시도가 이루어지고 있다. 프로그램은 알고리즘을 컴퓨터 언어로 구현한 것이므로 문제해결의 핵심은 논리적 해결 방법의 고안 즉, 알고리즘의 고안에 있다. 알고리즘의 중요성을 인식한다면 이제 알고리즘 교육에 대한 방향 정립을 위한 체계적 연구가 필요한 시점에 와 있다고 볼 수 있다. 지금까지 주로 정렬, 탐색과 같은 특정 문제를 중심으로 한 문제 종속적이고 개별적인 알고리즘 학습을 강조해 왔다. 본 논문에서는 문제 독립적, 집단적 성질을 고려하는 문제 해결의 개념적 유형이라는 관점에서 개념적 알고리즘(conceptual algorithm)을 정의한다. 개념적 알고리즘의 유형적 특성을 바탕으로 개별적, 문제 종속적인 기존의 알고리즘 교육과 구분되는 체계적, 문제 독립적, 알고리즘적인 문제 해결력을 지향하는 알고리즘 교육의 새로운 방향을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1481-1498
• /
• 2014

Automated activity monitoring has become important in many applications. In particular, automated monitoring is an important issue in large-scale management of group-housed livestock because it can save a significant part of farm workers' time or minimize the damage caused by livestock problems. In this paper, we propose an automated solution for measuring the daily-life activities of pigs by using video data in order to manage the group-housed pigs. Especially, we focus on the circadian rhythm of group-housed pigs under windowless and 24-hour light-on conditions. Also, we derive a cost-effective solution within the acceptable range of quality for the activity monitoring application. From the experimental results with the video monitoring data obtained from two pig farms, we believe our method based on circadian rhythm can be applied for detecting management problems of group-housed pigs in a cost-effective way.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5529-5552
• /
• 2016

Mobile cloud computing (MCC) has revolutionized the way in which the services can be obtained from the cloud service providers. Manifold increase in the number of mobile devices and subscribers in MCC has further enhanced the need of an efficient and robust authentication solution. Earlier, the subscribers could get cloud-computing services from the cloud service providers only after having consulted the trusted third party. Recently, Tsai and Lo has proposed a multi-server authenticated key agreement solution for MCC based on bilinear pairing, to eliminate the trusted third party for mutual authentication. The scheme has been novel as far as the minimization of trusted party involvement in authenticating the user and service provider, is concerned. However, the Tsai and Lo scheme has been found vulnerable to server spoofing attack (misrepresentation attack), de-synchronization attack and denial-of-service attack, which renders the scheme unsuitable for practical deployment in different wireless mobile access networks. Therefore, we have proposed an improved model based on bilinear pairing, countering the identified threats posed to Tsai and Lo scheme. Besides, the proposed work also demonstrates performance evaluation and formal security analysis.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.198-206
• /
• 2013

Recent advances in forward error correction (FEC) coding techniques were focused on addressing the challenges of multicast and broadcast delivery. However, FEC approaches can also be used for unicast content delivery in order to solve transmission control protocol issues found in wireless networks. In this paper, we exploit the error resilient properties of Raptor codes by proposing Raptor-based content delivery protocol (RCDP) - a novel solution for reliable and bidirectional unicast communication in lossy links that can improve content delivery in situations where the wireless network is the bottleneck. RCDP has been designed, validated, optimized, and its performance has been analyzed in terms of throughput and resource efficiency. Experimental results show that RCDP is a highly efficient solution for environments characterized by high delays and packet losses making it very suitable for intelligent transport system oriented applications since it achieves significant performance improvements when compared to traditional transport layer protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.80-96
• /
• 2022

Nowadays, artificial intelligence promotes the rapid development of skin cancer detection technology, and the federated skin cancer detection model (FSDM) and dual generative adversarial network model (DGANM) solves the fragmentation and privacy of data to a certain extent. To overcome the problem that the many-objective evolutionary algorithm (MaOEA) cannot guarantee the convergence and diversity of the population when solving the above models, a many-objective evolutionary algorithm based on integrated strategy (MaOEA-IS) is proposed. First, the idea of federated learning is introduced into population mutation, the new parents are generated through sub-populations employs different mating selection operators. Then, the distance between each solution to the ideal point (SID) and the Achievement Scalarizing Function (ASF) value of each solution are considered comprehensively for environment selection, meanwhile, the elimination mechanism is used to carry out the select offspring operation. Eventually, the FSDM and DGANM are solved through MaOEA-IS. The experimental results show that the MaOEA-IS has better convergence and diversity, and it has superior performance in solving the FSDM and DGANM. The proposed MaOEA-IS provides more reasonable solutions scheme for many scholars of skin cancer detection and promotes the progress of intelligent medicine.

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2007년도 동계학술발표대회 논문집
• /
• pp.534-539
• /
• 2007

The objectives of the present work is to investigate the influence of the solution cooled absorber(SCA), refrigerant drain heat exchanger(RSX), exhaust gas/solution heat exchanger(ESX) and high efficiency solution heat exchanger on COP for a double-effect series-flow absorption chiller. A simulation program has been prepared for the cycle analysis of absorption chillers. As a result, Solution heat exchangers(LSX, HSX) are a most effective element for the COP than the others. In spite of the poor contribution to COP, SCA make a rule to reduce the crystallization phenomena of LiBr solution at solution heat exchanger. And the optimum solution split ratio are varied with the relative size of RSX and LSX.

• Journal of Computing Science and Engineering
• /
• 제6권2호
• /
• pp.89-104
• /
• 2012

In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

• International Journal of Control, Automation, and Systems
• /
• 제1권3호
• /
• pp.358-367
• /
• 2003

We consider discrete-time factorial Markov Decision Processes (MDPs) in multiple decision-makers environment for infinite horizon average reward criterion with a general joint reward structure but a factorial joint state transition structure. We introduce the "localization" concept that a global MDP is localized for each agent such that each agent needs to consider a local MDP defined only with its own state and action spaces. Based on that, we present a gradient-ascent like iterative distributed algorithm that converges to a local optimal solution of the global MDP. The solution is an autonomous joint policy in that each agent's decision is based on only its local state.cal state.

• Journal of information and communication convergence engineering
• /
• 제10권1호
• /
• pp.66-70
• /
• 2012

Conformal mapping has been a familiar tool of science and engineering for generations. Determination of a conformal map from the unit disk onto the Jordan region is reduced to solving the Theodorsen equation, which is an integral equation for boundary correspondence functions. There are many methods for solving the Theodorsen equation. It is the goal of numerical conformal mapping to find methods that are at once fast, accurate, and reliable. In this paper, we analyze Niethammer’s solution based on successive over-relaxation (SOR) iteration and Wegmann’s solution based on Newton iteration, and compare them to determine which one is more effective. Through several numerical experiments with these two methods, we can see that Niethammer’s method is more effective than Wegmann’s when the degree of the problem is low and Wegmann’s method is more effective than Niethammer’s when the degree of the problem is high.