• Title/Summary/Keyword: information theory

Search Result 7,448, Processing Time 0.033 seconds

A Web-based Sensor Network Query and Data Management (웹 기반의 센서네트워크 질의 및 데이타 관리)

  • Hwang, Kwang-Il;Eom, Doo-Seop
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.11
    • /
    • pp.820-829
    • /
    • 2006
  • Wireless sensor networks consisting of hundreds to thousands of nodes are expected to be increasingly deployed in coming years, as they enable reliable monitoring and analysis of physical worlds. These networks have unique features that are very different from traditional networks, e.g., the numerous numbers of nodes, limitation in power, processing, and memory. Due to these unique features of wireless sensor networks, sensor data management including querying becomes a challenging problem. Furthermore, due to wide popularization of the Internet and its facility in use, it is generally accepted that an unattended network can be efficiently managed and monitored over the Internet. In particular, in order to more efficiently query and manage data in a sensor network. in this paper, the architecture of a sensor gateway including web-based query server is presented and its implementation detail is illustrated. The presented web-based gateway is largely divided into two important parts: Internet part and sensor network part. The sensor network part plays an important role of handling a variety of sensor networks, including flat or hierarchical network architecture, by using internally layered architecture for efficiently querying and managing data in a sensor network. In addition, the Internet part provides a modular gateway function for favorable exchange between the sensor network and Internet.

An Overrun Control Method and its Synthesis Method for Real-Time Systems with Probabilistic Timing Constraints (확률적인 시간 제약 조건을 갖는 실시간 시스템을 위한 과실행 제어 및 합성 기법)

  • Kim, Kang-Hee;Hwang, Ho-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.243-254
    • /
    • 2005
  • Soft real-time applications such as multimedia feature highly variable processor requirements and probabilistic guarantees on deadline misses, meaning that each task in the application meets its deadline with a given probability. Thus, for such soft real-time applications, a system designer may want to improve the system utilization by allocating to each task a processor time less than its worst-case requirement, as long as the imposed probabilistic timing constraint is met. In this case, however, we have to address how to schedule jobs of a task that require more than (or, overrun) the allocated processor time to the task. In this paper, to address the overrun problem, we propose an overrun control method, which probabilistically controls the execution of overrunning jobs. The proposed overrun control method probabilistically allows overrunning jobs to complete for better system utilization, and also probabilistically prevents the overrunning jobs from completing so that the required probabilistic timing constraint for each task can be met. In the paper, we show that the proposed method outperforms previous methods proposed in the literature in terms of the overall deadline miss ratio, and that it is possible to synthesize the scheduling parameters of our method so that all tasks can meet the given probabilistic timing constraints.

Synchronization of Network Interfaces in System Area Networks (시스템 에어리어 네트?에서의 동기화 기법)

  • Song, Hyo-Jung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.5
    • /
    • pp.219-231
    • /
    • 2005
  • Many applications in cluster computing require QoS (Quality of Service) services. Since performance predictability is essential to provide QoS service, underlying systems must provide predictable performance guarantees. One way to ensure such guarantees from network subsystems is to generate global schedules from applications'network requests and to execute the local portion of the schedules at each network interface. To ensure accurate execution of the schedules, it is essential that a global time base must be maintained by local clocks at each network interface. The task of providing a single time base is called a synchronization problem and this paper addresses the problem for system area networks. To solve the synchronization problem, FM-QoS (1) proposed a simple synchronization mechanism called FBS(Feedback-Based Synchronization) which uses built-in How control signals. This paper extends the basic notion of FM-QoS to a theoretical framework and generalizes it: 1) to identify a set of built-in network flow control signals for synchrony and to formalize it as a synchronizing schedule, and 2) to analyze the synchronization precision of FBS in terms of flow control parameters. Based on generalization, two application classes are studied for a single switch network and a multiple switch network. For each class, a synchroniring schedule is proposed and its bounded skew is analyzed. Unlike FM-QoS, the synchronizing schedule is proven to minimize the bounded skew value for a single switch network. To understand the analysis results in practical networks, skew values are obtained with flow control parameters of Myrinet-1280/SAN. We observed that the maximum bounded skew of FBS is 9.2 Usec or less over all our experiments. Based on this result, we came to a conclusion that FBS was a feasible synchronization mechanism in system area networks.

Regional Ecological Network Design for Wild Animals' Movement Using Landscape Permeability and Least-cost Path Methods in the Metropolitan Area of Korea (경관투과성 및 최소비용경로 분석을 통한 수도권 지역의 광역생태축 구축 연구)

  • Lee, Dong-Kun;Song, Won-Kyong;Jeon, Seong-Woo
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.11 no.3
    • /
    • pp.94-106
    • /
    • 2008
  • As populations inhabiting in natural ecosystem are fragmented by artificial barriers and habitats are destructed by development, extinction possibility of species is getting higher. It is necessary to design and to manage conservation areas and corridors considering animals' movement and migration for sustainable species diversity in present circumstances. 'Least-cost modeling' is one commonly employed approach in which dispersal costs are assigned to distinct habitat types and the last-costly dispersal paths among habitat patches are calculated using a geographical information system (GIS). This study aims to design ecological corridor using least-cost path method and to apply it to a regional ecological network considering movability of medium-large size mammals. This study was carried out over the metropolitan area, which has been deforested by rapid urbanization. Nevertheless there is connected with Gangwon province, Baekdudaegan mountain range and DMZ, considered where many forest species can migrate to this region. This study employs such an approach to develop least-cost path models for medium-large size mammals, have inhabited for this entire region. Considering those species, two forest areas as a source of species supply and forest areas more than 1,000ha are selected as focal forest areas. Movement and migration paths from species supply sources to focal forest areas are calculated by applying landscape permeability theory using land cover map, road density map and land slope map. Results showed least-cost paths from species supply sources to focal forest areas on two species. Wildcat and roe deer are different in some least-cost paths caused by their landscape permeability but paths show generally same specifics. The result of considering regional distribution of expected movement and migration paths to regional ecological network, low altitude mountains of western metropolitan area are evaluated important area for species connectivity. In national or regional levels ecological connectivity is essential to promote species diversity and to preserve integrated ecosystem. This study concludes that developing least-cost models from similar empirical data could significantly improve the utility of these tools.

Emergence of Social Networked Journalism Model: A Case Study of Social News Site, "wikitree" (소셜 네트워크 저널리즘 모델의 출현: 소셜 뉴스사이트, "위키트리" 사례연구)

  • Seol, Jinah
    • Journal of Internet Computing and Services
    • /
    • v.16 no.1
    • /
    • pp.83-90
    • /
    • 2015
  • This paper examines the rising value of social networked journalism and analyzes the case of a social news site based on the theory of networked journalism. Social networked journalism allows the public to be involved in every aspect of journalism production through crowd-sourcing and interactivity. The networking effect with the public is driving journalism to transform into a more open, more networked and more responsive venue. "wikitree" is a social networking news service on which anybody can write news and disseminate it via Facebook and Twitter. It is operated as an open sourced program which incorporates "Google Translate" to automatically convert all its content, enabling any global citizen with an Internet access to contribute news production and share either their own creative contents or generated contents from other sources. Since its inception, "wikitree global" site has been expanding its coverage rapidly with access points arising from 160 countries. Analyzing its international coverage by country and by news category as well as by the unique visit numbers via SNS, the results of the case study imply that networking with the global public can enhance news traffic to the social news site as well as to specific news items. The results also suggest that the utilization of Twitter and Facebook in social networked journalism can break the boundary between local and global public by extending news-gathering ability while growing audience's interest in the site, and engender a feasible business model for a local online journalism.

Development of Blended Learning Program for CPS (CPS를 위한 Blended Learning 프로그램 개발 - 고등학교 수학내용을 중심으로 -)

  • Kim Young-Mi;Kim Hyang-Sook;Im Sun-Woo
    • Communications of Mathematical Education
    • /
    • v.20 no.3 s.27
    • /
    • pp.407-423
    • /
    • 2006
  • The reason why creativity becomes the important subject in 21th century is that it does an important role which solves many problems surrounding our whole life in this internationalization, globalization, knowledge-information age. But scholars who formerly researched the creativity-field explain the necessity of creativity with the internal and fundamental reasons. That is, scholars say that creative activities produce originative products and originality itself. And it is the root of which will be able to discover meaning of life and it -creativity - is successive activities that is demanded when individual life want to obtain important value by expressing one's inner world to the outside using creative resource. Recently, with the trends of present age and the educational needs, research about creativity is actively carried out and it draws out the results that creativity can be developed and enhanced through education and training. So, now many researches have focused on how to develop the creativity. Investigating those researches, we found that the recent issues of researches on creativity were changing and now they focused on creative instruction methods and behavioral factors. Especially, they were selected as the subject related to the creative education - creative instructional method and program, atmosphere in classroom, and factors of teacher. It means that the past researches which were a little bit conceptive have been changing to material ones which will be able to enhance creativity and its effect. So, in this research, we have developed the program for CPS(Creativity Problem Solving) and verified its effect.

  • PDF

A Process Tailoring Method Based on Artificial Neural Network (인공신경망 기반의 소프트웨어 개발 프로세스 테일러링 기법)

  • Park, Soo-Jin;Na, Ho-Young;Park, Soo-Yong
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.2
    • /
    • pp.201-219
    • /
    • 2006
  • The key to developing software with the lowest cost and highest quality is to implement or fit the software development process into a given environment. Generally, applying commercial or standard software development processes on a specific project can cause too much overhead if there is no effort to customize the given generic processes. Even though the customizing activities are done before starting the project, these activities are thoroughly dependent on the process engineers who have abundant experience and knowledge with tailoring processes. Owing to this dependence on human knowledge, it has been very difficult to explain the rationale for the results of process tailoring and it takes a long time to get the customized process that is applicable. Hence, we suggest a process tailoring method which adopts the artificial neural network based teaming theory to reduce the time consumed by process tailoring. Furthermore, we suggest the feedback loop mechanism to get higher accuracy in the neural network designed for the process tailoring. It can be done by reusing the process tailoring data results and determining its appropriateness level as sample data to the neural network. We proved the effectiveness of our process tailoring method through case studies using real historical data, which yielded abundant process tailoring results as sample data.

XSNP: An Extended SaC Network Protocol for High Performance SoC Bus Architecture (XSNP: 고성능 SoC 버스를 위한 확장된 SoC 네트워크 프로토콜)

  • Lee Chan-Ho;Lee Sang-Hun;Kim Eung-Sup;Lee Hyuk-Jae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.554-561
    • /
    • 2006
  • In recent years, as SoC design research is actively conducted, a large number of IPs are included in a system. Various bus protocols and bus architectures are designed to increase IP reusability. Among them, the AMBA AHB became a de facto standard although it is somewhat inadequate for a large scale SoC. We proposed SNP and SNA, high performance on-chip-bus protocol and architecture, respectively, to solve the problem of the conventional shared buses. However, it seems to be imperative that the new on-chip-bus system support AMBA-compatible IPs for a while since there are a lot of IPs with AMBA interface. In this paper, we propose an extended SNP specification and a corresponding SNA component to support ABMA-compatible IPs used in SNA - based system. We extend the phase of the SNP by 1 bit to add new 8 phases to support communication based on AMBA protocol without penalty of elongated cycle latency. The ARB-to -XSNP converter translates the protocol between AHB and SNP to attach AMBA -compatible IPs to SNA based system. We show that AMBA IPs can communicate through SNP without any degradation of performance using the extended SNP and AHB - to- XSNP converter.

Empirical Modeling for Cache Miss Rates in Multiprocessors (다중 프로세서에서의 캐시접근 실패율을 위한 경험적 모델링)

  • Lee, Kang-Woo;Yang, Gi-Joo;Park, Choon-Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.15-34
    • /
    • 2006
  • This paper introduces an empirical modeling technique. This technique uses a set of sample results which are collected from a few small scale simulations. Empirical models are developed by applying a couple of statistical estimation techniques to these samples. We built two types of models for cache miss rates in Symmetric Multiprocessor systems. One is for the changes of input data set size while the specification of target system is fixed. The other is for the changes of the number of processors in target system while the input data set size is fixed. To develop accurate models, we built individual model for every kind of cache misses for each shared data structure in a program. The final model is then obtained by integrating them. Besides, combined use of Least Mean Squares and Robust Estimations enhances the quality of models by minimizing the distortion due to outliers. Empirical modeling technique produces extremely accurate models without analysis on sample data. In addition, since only snail scale simulations are necessary, once a set of samples can be collected, empirical method can be adopted in any research areas. In 17 cases among 24 trials, empirical models present extremely low prediction errors below $1\%$. In the remaining cases, the accuracy is excellent, as well. The models sustain high quality even when the behavioral characteristics of programs are irregular and the number of samples are barely enough.

Adaptive Strip Compression for Panorama Video Streaming (파노라마 동영상 스트리밍을 위한 적응적 스트립 압축 기법)

  • Kim Bo Youn;Jang Kyung Ho;Koo Sang Ok;Jung Soon Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.137-146
    • /
    • 2006
  • Traditional live video streaming systems support the limited field of view (FOV) of image to the remote users. A server system based on the pan/tilt camera provides a user with wide view by changing the view direction of the camera mechanically. But, when many clients try to access to the server, this system can not offer their own view to every user simultaneously, and moreover it has the delay by camera motion. In order to offer wide views to several users, we propose new streaming system using the panorama image that has wide view. Our system is a kind of implementation of software pan/tilt camera. The server acquires panorama video and sends a part of the video to clients. Then, each client can control their own view. We need the effective way to reduce the average transmission data size and server burden to the compression because generally the full size of panorama video is too big to be served by the real-time streaming. To solve this problem, we propose an strip-based video compression and adaptive transmission of the compressed multiple strip videos. Experimental results show that our system can be adapted quickly to the change of view and the number of clients. Furthermore, proposed method effectively reduce the transmission data.