• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1276-1295
• /
• 2023

Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.

• Nuclear Engineering and Technology
• /
• 제55권5호
• /
• pp.1838-1854
• /
• 2023

This paper presents a hybrid algorithm to solve the multi-objective path planning (MOPP) problem for mobile robots in a static nuclear accident environment. The proposed algorithm mimics a real nuclear accident site by modeling the environment with a two-layer cost grid map based on geometric modeling and Monte Carlo calculations. The proposed algorithm consists of two steps. The first step optimizes a path by the hybridization of improved ant colony optimization algorithm-modified A^* (IACO-A^*) that minimizes path length, cumulative radiation dose and energy consumption. The second module is the high radiation dose rate avoidance strategy integrated with the IACO-A^* algorithm, which will work when the mobile robots sense the lethal radiation dose rate, avoiding radioactive sources with high dose levels. Simulations have been performed under environments of different complexity to evaluate the efficiency of the proposed algorithm, and the results show that IACO-A^* has better path quality than ACO and IACO. In addition, a study comparing the proposed IACO-A^* algorithm and recent path planning (PP) methods in three scenarios has been performed. The simulation results show that the proposed IACO-A^* IACO-A^* algorithm is obviously superior in terms of stability and minimization the total cost of MOPP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.903-921
• /
• 2024

Industry 5.0 puts forward higher requirements for smart cities, including low-carbon, sustainable, and people-oriented, which pose challenges to the design of smart cities. In response to the above challenges, this study introduces the cyber-physical-social system (CPSS) and parallel system theory into the design of smart cities, and constructs a smart city framework based on parallel system theory. On this basis, in order to enhance the security of smart cities, a sustainable patrol subsystem for smart cities has been established. The intelligent patrol system uses a drone platform, and the trajectory planning of the drone is a key problem that needs to be solved. Therefore, a mathematical model was established that considers various objectives, including minimizing carbon emissions, minimizing noise impact, and maximizing coverage area, while also taking into account the flight performance constraints of drones. In addition, an improved metaheuristic algorithm based on ant colony optimization (ACO) algorithm was designed for trajectory planning of patrol drones. Finally, a digital environmental map was established based on real urban scenes and simulation experiments were conducted. The results show that compared with the other three metaheuristic algorithms, the algorithm designed in this study has the best performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.

• 동의생리병리학회지
• /
• 제30권4호
• /
• pp.279-288
• /
• 2016

To observe the potential hepatoprotective effects of Gongjin-dan on the acute ethanol (EtOH)-induced liver damages in C57BL/6 mice with its possible action mechanisms. EtOH-mediated acute hepatic damages were induced by oral administration of EtOH total 3 doses. The changes on the body weight, liver weight, albumin, TG, AST, ALP, ALT, hepatic TG contents, hepatic antioxidant defense system, TNF-α, CYP 2E1 activity and mRNA expressions of hepatic lipogenic genes - SREBP-1c, SCD1, ACC1, FAS, PPARγ and DGAT2 or genes involved in fatty acid oxidation - PPARα, ACO and CPT1 were observed with final liver histopathological inspections after 15 days of continuous administration of silymarin 200 mg/kg, Gongjin-dan (GJD) 400, 200 and 100 mg/kg. The results were compared with silymarin 200 mg/kg treated mice. Marked decreases of body and liver weights, increases of serum AST, ALT, Albumin and TG levels, hepatic TG contents, TNF-α level, CYP 2E1 activity and mRNA expressions of hepatic lipogenic genes or decreases mRNA expressions of genes involved in fatty acid oxidation were observed with histopathological changes related hepatosteatosis increases of immunolabelled hepatocytes, as the results of a binge drinking of EtOH in the present study. Also destroys of hepatic antioxidant defense systems were demonstrated in EtOH control mice as compared with intact vehicle control mice, respectively. The results suggest that oral administration of 400, 200 and 100 mg/kg of GJD favorably protected the liver damages from acute mouse EtOH intoxications.

• 정보처리학회논문지B
• /
• 제11B권1호
• /
• pp.77-82
• /
• 2004

강화학습에서 temporal-credit 할당 문제 즉, 에이전트가 현재 상태에서 어떤 행동을 선택하여 상태전이를 하였을 때 에이전트가 선택한 행동에 대해 어떻게 보상(reward)할 것인가는 강화학습에서 중요한 과제라 할 수 있다. 본 논문에서는 조합최적화(hard combinational optimization) 문제를 해결하기 위한 새로운 메타 휴리스틱(meta heuristic) 방법으로, greedy search뿐만 아니라 긍정적 반응의 탐색을 사용한 모집단에 근거한 접근법으로 Traveling Salesman Problem(TSP)를 풀기 위해 제안된 Ant Colony System(ACS) Algorithms에 Q-학습을 적용한 기존의 Ant-Q 학습방범을 살펴보고 이 학습 기법에 다양화 전략을 통한 상태전이와 TD-오류를 적용한 학습방법인 Ant-TD 강화학습 방법을 제안한다. 제안한 강화학습은 기존의 ACS, Ant-Q학습보다 최적해에 더 빠르게 수렴할 수 있음을 실험을 통해 알 수 있었다.

• Journal of Korean Neurosurgical Society
• /
• 제37권3호
• /
• pp.179-186
• /
• 2005

Objective: The purpose of this paper is to report our experiences in managing seventeen cases of residual intracranial aneurysms following surgical or endovascular treatment and discuss the incidence of residual aneurysms, the indications and technique of retreatment of residual aneurysms. Methods: During a period of 42 months, we treated 391 aneurysms in 339 patients with microsurgical clipping or GDC embolization as a primary treatment. In 39 of them, follow-up angiography revealed residual aneurysms and seventeen of whom were retreated. There were eleven cases in ACoA, three cases in distal ICA, one, in each of MCA, ACA and basilar artery. We reviewed retrospectively the clinical notes, operation records and cerebral angiograms of seventeen patients who had been treated for residual aneurysms. Results: Complementary treatment was performed in 8 cases by means of surgery and in 9 cases by means of GDC embolization. There were eleven females and six males with an age variation between 29 and 78 years. The mean duration of angiographic follow-up was 17.3 months. Of the seventeen cases that were treated for residual aneurysms, fourteen achieved complete occlusion. Of 17 retreated patients, fifteen patients had good recovery according to the Glasgow Outcome Scale. Conclusion: When occlusion after endovascular or surgical treatment is incomplete, a new multidisciplinary approach should be carried out. Given our experiences, we recommend coil embolization of the choice in cases that the residual aneurysmal neck had been narrowed by previous clipping. On the other hand, if the residual aneurysm has enough space to clip but not enough to coil, we recommend the microsurgical clipping.

• 정보처리학회논문지B
• /
• 제17B권5호
• /
• pp.389-398
• /
• 2010

차량 경로 스케줄링 문제(VRSPTW, the Vehicle Routing and Scheduling Problem with Time Window)는 여러 고객의 시간 제약과 요구량을 만족시키면서 최소 이동 비용을 가지는 경로를 구성하는 문제이다. 이 문제는 NP-Hard 문제이기 때문에 해를 산출하는데 시간이 오래 걸린다. 본 연구는 VRSPTW를 빠른 시간 내에 최근사해를 구하기 위한 멀티 비용 함수(Multi Cost Function)를 갖는 개미 군집 최적화(Ant Colony Optimization)을 이용한 휴리스틱을 제안하였다. 멀티 비용 함수는 각 개미가 다음 고객 노드로 이동하기 위해 비용을 평가할 때 거리, 요구량, 각도, 시간제약에 대해 서로 다른 가중치를 반영하여 우수한 초기 경로를 구할 수 있도록 한다. 본 연구의 실험결과에서 제안된 휴리스틱이 Solomon I1 휴리스틱과 기회시간이 반영된 하이브리드 휴리스틱보다 효율적으로 최근사 해를 얻을 수 있음을 보였다.

• Journal of Plant Biotechnology
• /
• 제7권2호
• /
• pp.87-95
• /
• 2005

The tomato ripening associated membrane protein (TRAMP) (Fray et al., 1994) is a member of the major intrinsic protein (MIP) family, defined as channels facilitating the passage of water and small solutes through membranes. During normal fruit ripening the TRAMP mRNA levels were increased whereas the expression levels of TRAMP in low ethylene ACO1-sense suppressed lines, Nr and rin fruits, were lower than at the breaker stage of wild type fruit. TRAMP mRNA is inhibited by $LaCl_3$, which is an inhibitor of $Ca^{2+}$-stimulated responses, treatment but drought condition did not affect TRAMP expression. The levels of TRAMP mRNA transcripts were substantially higher in the dark treated seedlings and fruits. These suggest that TRAMP function as a water channel may be doubted because of several reasons; no water content was changed during ripening in wild type, antisense and overexpression lines, TRAMP expression under light condition was lower than dark condition and TRAMP expression was not changed in drought condition. Co-suppression plant, 3588 was one of sense suppression lines, which contain CaMV 35S promoter and sense pNY507 cDNA, produced small antisense RNA, approximately 21-25 nucleotides in length, mediated post-transcriptional gene silencing. Therefore, TRAMP expression was inhibited by small antisense and multiple copies might induce gene silencing without any production of double strand RNA. Total seven selected volatile productions, isobutylthiazole, 6-methyl-5-hepten-2-one, hexanal, hexenal methylbutanal, hexenol, and methylbutanol, were highly reduced in sense line whereas total volatile production was increased in TRAMP antisense line. These results suggested TRAMP might change volatile related compounds.