• Title/Summary/Keyword: Self-Adaptive Systems

Search Result 177, Processing Time 0.036 seconds

Energy Efficient Cooperative Foraging Swarm Robots Using Adaptive Behavioral Model (역할 모델의 적응적 전환을 통한 협업 채집 무리 로봇의 에너지 효율 향상)

  • Lee, Jong-Hyun;An, Jin-Ung;Ahn, Chang-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.1
    • /
    • pp.21-27
    • /
    • 2012
  • We can efficiently collect crops or minerals by operating multi-robot foraging. As foraging spaces become wider, control algorithms demand scalability and reliability. Swarm robotics is a state-of-the-art algorithm on wide foraging spaces due to its advantages, such as self-organization, robustness, and flexibility. However, high initial and operating costs are main barriers in performing multi-robot foraging system. In this paper, we propose a novel method to improve the energy efficiency of the system to reduce operating costs. The idea is to employ a new behavior model regarding role division in concert with the search space division.

MEMBERSHIP FUNCTION TUNING OF FUZZY NEURAL NETWORKS BY IMMUNE ALGORITHM

  • Kim, Dong-Hwa
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.261-268
    • /
    • 2002
  • This paper represents that auto tunings of membership functions and weights in the fuzzy neural networks are effectively performed by immune algorithm. A number of hybrid methods in fuzzy-neural networks are considered in the context of tuning of learning method, a general view is provided that they are the special cases of either the membership functions or the gain modification in the neural networks by genetic algorithms. On the other hand, since the immune network system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (parallel distributed processing) network to complete patterns against the environmental situation. Also, it can provide optimal solution. Simulation results reveal that immune algorithms are effective approaches to search for optimal or near optimal fuzzy rules and weights.

Auto-Tuning of Reference Model Based PID Controller Using Immune Algorithm

  • Kim, Dong-Hwa;Park, Jin-Ill
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.246-254
    • /
    • 2002
  • In this paper auto-tuning scheme of PID controller based on the reference model has been studied for a Process control system by immune algorithm. Up to this time, many sophisticated tuning algorithms have been tried in order to improve the PID controller performance under such difficult conditions. Also, a number of approaches have been proposed to implement mixed control structures that combine a PID controller with fuzzy logic. However, in the actual plant, they are manually tuned through a trial and error procedure, and the derivative action is switched off. Therefore, it is difficult to tune. Since the immune system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (Parallel Distributed Processing) network to complete patterns against the environmental situation. Simulation results reveal that reference model basd tuning by immune network suggested in this paper is an effective approach to search for optimal or near optimal process control.

Flexible Service Composition Based on Bundle Communication in OSGi

  • Alcarria, Ramon;Robles, Tomas;Morales, Augusto;Gonzalez-Miranda, Sergio
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.116-130
    • /
    • 2012
  • Service provision and consumption platforms are more and more used to enable communication between sensors, actuators and intelligent devices, since they provide mechanisms that make possible the combination of components to create composed services. However, these kinds of platforms have limitations to adapt themselves to new and unknown devices. In this work we analyze the challenge of component or bundle communication by using the Open Services Gateway Initiative (OSGi) technology and we propose three mechanisms with the aim of contributing to flexible component communication: Common Service, Specific Service and WSIF Web Service Invocation. We provide these solutions with some architectural models and validate them through different example services. Finally we compare them regarding performance, flexibility and application complexity.

Adaptive Learning Path Recommendation based on Graph Theory and an Improved Immune Algorithm

  • BIAN, Cun-Ling;WANG, De-Liang;LIU, Shi-Yu;LU, Wei-Gang;DONG, Jun-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2277-2298
    • /
    • 2019
  • Adaptive learning in e-learning has garnered researchers' interest. In it, learning resources could be recommended automatically to achieve a personalized learning experience. There are various ways to realize it. One of the realistic ways is adaptive learning path recommendation, in which learning resources are provided according to learners' requirements. This paper summarizes existing works and proposes an innovative approach. Firstly, a learner-centred concept map is created using graph theory based on the features of the learners and concepts. Then, the approach generates a linear concept sequence from the concept map using the proposed traversal algorithm. Finally, Learning Objects (LOs), which are the smallest concrete units that make up a learning path, are organized based on the concept sequences. In order to realize this step, we model it as a multi-objective combinatorial optimization problem, and an improved immune algorithm (IIA) is proposed to solve it. In the experimental stage, a series of simulated experiments are conducted on nine datasets with different levels of complexity. The results show that the proposed algorithm increases the computational efficiency and effectiveness. Moreover, an empirical study is carried out to validate the proposed approach from a pedagogical view. Compared with a self-selection based approach and the other evolutionary algorithm based approaches, the proposed approach produces better outcomes in terms of learners' homework, final exam grades and satisfaction.

Adaptive Lock Escalation in Database Management Systems (데이타베이스 관리 시스템에서의 적응형 로크 상승)

  • Chang, Ji-Woong;Lee, Young-Koo;Whang, Kyu-Young;Yang, Jae-Heon
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.742-757
    • /
    • 2001
  • Since database management systems(DBMSS) have limited lock resources, transactions requesting locks beyond the limit mutt be aborted. In the worst carte, if such transactions are aborted repeatedly, the DBMS can become paralyzed, i.e., transaction execute but cannot commit. Lock escalation is considered a solution to this problem. However, existing lock escalation methods do not provide a complete solution. In this paper, we prognose a new lock escalation method, adaptive lock escalation, that selves most of the problems. First, we propose a general model for lock escalation and present the concept of the unescalatable look, which is the major cause making the transactions to abort. Second, we propose the notions of semi lock escalation, lock blocking, and selective relief as the mechanisms to control the number of unescalatable locks. We then propose the adaptive lock escalation method using these notions. Adaptive lock escalation reduces needless aborts and guarantees that the DBMS is not paralyzed under excessive lock requests. It also allows graceful degradation of performance under those circumstances. Third, through extensive simulation, we show that adaptive lock escalation outperforms existing lock escalation methods. The results show that, compared to the existing methods, adaptive lock escalation reduces the number of aborts and the average response time, and increases the throughput to a great extent. Especially, it is shown that the number of concurrent transactions can be increased more than 16 ~256 fold. The contribution of this paper is significant in that it has formally analysed the role of lock escalation in lock resource management and identified the detailed underlying mechanisms. Existing lock escalation methods rely on users or system administrator to handle the problems of excessive lock requests. In contrast, adaptive lock escalation releases the users of this responsibility by providing graceful degradation and preventing system paralysis through automatic control of unescalatable locks Thus adaptive lock escalation can contribute to developing self-tuning: DBMSS that draw a lot of attention these days.

  • PDF

Gateway Strategies for VoIP Traffic over Wireless Multihop Networks

  • Kim, Kyung-Tae;Niculescu, Dragos;Hong, Sang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.24-51
    • /
    • 2011
  • When supporting both voice and TCP in a wireless multihop network, there are two conflicting goals: to protect the VoIP traffic, and to completely utilize the remaining capacity for TCP. We investigate the interaction between these two popular categories of traffic and find that conventional solution approaches, such as enhanced TCP variants, priority queues, bandwidth limitation, and traffic shaping do not always achieve the goals. TCP and VoIP traffic do not easily coexist because of TCP aggressiveness and data burstiness, and the (self-) interference nature of multihop traffic. We found that enhanced TCP variants fail to coexist with VoIP in the wireless multihop scenarios. Surprisingly, even priority schemes, including those built into the MAC such as RTS/CTS or 802.11e generally cannot protect voice, as they do not account for the interference outside communication range. We present VAGP (Voice Adaptive Gateway Pacer) - an adaptive bandwidth control algorithm at the access gateway that dynamically paces wired-to-wireless TCP data flows based on VoIP traffic status. VAGP continuously monitors the quality of VoIP flows at the gateway and controls the bandwidth used by TCP flows before entering the wireless multihop. To also maintain utilization and TCP performance, VAGP employs TCP specific mechanisms that suppress certain retransmissions across the wireless multihop. Compared to previous proposals for improving TCP over wireless multihop, we show that VAGP retains the end-to-end semantics of TCP, does not require modifications of endpoints, and works in a variety of conditions: different TCP variants, multiple flows, and internet delays, different patterns of interference, different multihop topologies, and different traffic patterns.

Evaluation of a Self-Adaptive Voltage Control Scheme for Low-Power FPGAs

  • Ishihara, Shota;Xia, Zhengfan;Hariyama, Masanori;Kameyama, Michitaka
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.10 no.3
    • /
    • pp.165-175
    • /
    • 2010
  • This paper presents a fine-grain supply-voltage-control scheme for low-power FPGAs. The proposed supply-voltage-control scheme detects the critical path in real time with small overheads by exploiting features of asynchronous architectures. In an FPGA based on the proposed supply-voltage-control scheme, logic blocks on the sub-critical path are autonomously switched to a lower supply voltage to reduce the power consumption without system performance degradation. Moreover, in order to reduce the overheads of level shifters used at the power domain interface, a look-up-table without level shifters is employed. Because of the small overheads of the proposed supply-voltage-control scheme and the power domain interface, the granularity size of the power domain in the proposed FPGA is as fine as a single four-input logic block. The proposed FPGA is fabricated using the e-Shuttle 65 nm CMOS process. Correct operation of the proposed FPGA on the test chip is confirmed.

An Importance-Performance Analysis of Secondary Science Teachers' Adaptive Practice (중등 과학교사의 적응적 실행에 대한 중요도-실행도 분석)

  • Heekyong Kim
    • Journal of The Korean Association For Science Education
    • /
    • v.43 no.3
    • /
    • pp.295-306
    • /
    • 2023
  • In this study, we explored science teachers' perceptions of adaptive practice in terms of importance and practice. For this purpose, an adaptive practice questionnaire was developed targeting secondary science teachers, and the responses of 128 science teachers were analyzed. The results of this study were as follows: First, the science teachers responded that all 17 items regarding adaptive practice were important. In particular, items related to 'addition of examples', 'adjustment of the level/range of concepts', and 'encouragement of student participation' showed high importance and performance levels. Second, the results of the IPA concerning adaptive practice showed that the items needing intensive improvement due to high importance but low performance were 'encouraging students' self-directed learning' and 'monitoring and responding to individual differences'. The science teachers identified a lack of time and uniform curriculum as the reasons for the low level of practice despite the high importance of these items. Third, regarding the IPA of the adaptive practice items, the items located in the fourth area, an excessive area, concerned 'pace control', 'modifying activities', and 'metaphor use'. More specifically, considering that 'metaphor use' was the only item with a higher level of performance than importance, it is necessary to reconsider whether problems are caused by excessive use. Fourth, analyzing the responses regarding the reasons for the difference in importance and performance revealed that the factors related to teachers included teachers' lack of knowledge or ability, and the tendency to implement as planned. As for student factors, an excessive number of students, differences in the levels of students, and a tendency to prefer classes centered on entrance exams were identified. As environmental factors, a uniform curriculum, conditions for experiments, evaluation systems, and external demands were mentioned. Finally, the implications of the results of this study for science education were discussed.

Adaptive Control of Super Peer Ration using Particle Swarm Optimization in Self-Organizing Super Peer Ring Search Scheme (자기 조직적 우수 피어 링 검색기법에서 입자 군집 최적화(PSO)를 이용한 적응적 우수 피어 비율 조절 기법)

  • Jang, Hyung-Gun;Han, Sae-Young;Park, Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.501-510
    • /
    • 2006
  • The self-organizing super peer ring P2P search scheme improves search performance of the existing unstructured peer-to-peer systems, in which super peers with high capacity constitute a ring structure and all peer in the system utilize the ring for publishing or querying their keys. In this paper, we further improves the performance of the self-organizing ring by adaptively changing its super peer ratio according to the status of the entire system. By using PSO, the optimized super peer ratio can be maintained within the system. Through simulations, we show that our self-organizing super peer ring optimized by PSO outperforms not only the fixed super peer ring but also the self-organizing super ring with fixed ratio in the aspect of query success rate.