• Title/Summary/Keyword: distributed applications

Search Result 1,258, Processing Time 0.028 seconds

ANALYSIS AND DESIGN OF MAT FOUNDATION FOR HIGH-RISE BUILDINGS (초고층 건물의 전면기초(MAT기초) 해석 및 설계)

  • Hong, Won-Gi;Hwang, Dae-Jin;Gwon, Jang-Hyeok
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1994.09a
    • /
    • pp.94-110
    • /
    • 1994
  • Types of foundation of high rise buildings are primarily determined by loads transmitted from super structure, soil bearing capacity and available construction technology. The usd of deep foundation cannot be justified due to the fact that rock of enough bearing capacity is not found down until 90 ~ 100m. When a concentration of high soil pressure must be distributed over the entire building area, when small soft soil areas must be bridged, and when compressible strata are located at a shallow depth, mat foundation may be useful in order to have settlement and differential settlement of variable soils be minimized. The concept of mat foundation will also demonstrate some difficulities of applications if the load bearing demand directly carried down to the load -bearing strata exceeds the load -bearing capacity. This paper introduces both the analysis and design of mat type foundation for high rise buildings as well as the methodology of modelling of the soil foundation, especially, engineered to redistribute the stress exceeding the soil bearing capadity. This process will result in the wid spread of stresses over the entire building foundation.

  • PDF

An Execution Control Algorithm for Mobile Flex Transactions in Mobile Heterogeneous Multidatabase Systems (이동 이질 멀티데이타베이스 시스텐을 위한 이동 유연 트랜잭션의 실행 제어 알고리즘)

  • Gu, Gyeong-Lee;Kim, Yu-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2845-2862
    • /
    • 1999
  • As the technical advances in portable computers and wireless communication technologies, mobile computing environment has been rapidly expanded. The mobile users on mobile host can access information via wireless communication from the distributed heterogeneous multidatabase system in which pre-existing independent local information systems are integrated into one logical system to support mobile applications. Hence, mobile transaction model should include not only the features for heterogeneous multidatabase systems but also the ones for mobile computing environment. In this paper, we proposed a mobile flex transaction model which extends the flexible transaction model that previously proposed for heterogeneous multidatabase systems is extended to support the requirements of mobile heterogeneous multidatabase systems. We also presented the execution control mechanism of the mobile flex transaction model. The proposed mobile flex transaction model allows the definition of location-dependent subtransactions, the effective support of hand-over, and the flexibility of transaction executions. Hence, the proposed mobile flex transaction model can be suit to mobile heterogeneous multidatabase systems that have low power capability, low bandwidth, and high communication failure possibility.

  • PDF

A Framework for Developing and Managing Distributed Applications by Service Customization (서비스 맞춤형 분산응용 개발 및 관리를 위한 프레임워크)

  • Shin Chang-Sun;Kang Min-Su;Seo Jong-Seong;Ahn Dong-In;Joo Su-Chong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.100-102
    • /
    • 2006
  • 본 논문에서는 분산응용 개발 및 관리에 대한 사용자의 요구사항을 만족시킬 수 있는 분산서비스 맞춤형 소프트웨어 아키텍쳐인 분산객체그룹 프레임워크를 제안한다. 분산객체그룹은 응용을 구성하는 분산객체들을 하나의 논리적인 그룹으로 관리하며, 분산객체그룹 프레임워크는 분산응용의 개발자 관점에서 응용의 범위를 효율적으로 정의할 수 있을 뿐 아니라, 프레임워크의 지원 분산서비스를 응용과 독립적으로 적용할 수 있다. 프레임워크의 컴포넌트로 그룹관리자와 보안모듈, 모바일프락시, 컨텍스트제공자 및 DPD-Tool을 포함하며, 실시간 서비스를 위한 실시간관리자, 스케쥴러를 갖는다. 본 프레임워크는 분산서비스 지원 컴포넌트들의 상호작용으로 적응성(adaptability), 확장성(scalability), 보안성(security), 이동성(mobility) 및 신뢰성(reliability)을 제공하며, 분산응용을 개발 시 필요한 분산서비스를 모듈 단위로 선택하여 실제 응용 수행 시 선택한 분산서비스를 통해 그 수행성이 보장되도록 한다.

  • PDF

Min-Distance Hop Count based Multi-Hop Clustering In Non-uniform Wireless Sensor Networks

  • Kim, Eun-Ju;Kim, Dong-Joo;Park, Jun-Ho;Seong, Dong-Ook;Lee, Byung-Yup;Yoo, Jae-Soo
    • International Journal of Contents
    • /
    • v.8 no.2
    • /
    • pp.13-18
    • /
    • 2012
  • In wireless sensor networks, an energy efficient data gathering scheme is one of core technologies to process a query. The cluster-based data gathering methods minimize the energy consumption of sensor nodes by maximizing the efficiency of data aggregation. However, since the existing clustering methods consider only uniform network environments, they are not suitable for the real world applications that sensor nodes can be distributed unevenly. To solve such a problem, we propose a balanced multi-hop clustering scheme in non-uniform wireless sensor networks. The proposed scheme constructs a cluster based on the logical distance to the cluster head using a min-distance hop count. To show the superiority of our proposed scheme, we compare it with the existing clustering schemes in sensor networks. Our experimental results show that our proposed scheme prolongs about 48% lifetime over the existing methods on average.

GLR Charts for Simultaneously Monitoring a Sustained Shift and a Linear Drift in the Process Mean

  • Choi, Mi Lim;Lee, Jaeheon
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.1
    • /
    • pp.69-80
    • /
    • 2014
  • This paper considers the problem of monitoring the mean of a normally distributed process variable when the objective is to effectively detect both a sustained shift and a linear drift. The design and application of a generalized likelihood ratio (GLR) chart for simultaneously monitoring a sustained shift and a linear drift are evaluated. The GLR chart has the advantage that when we design this chart, we do not need to specify the size of the parameter change. The performance of the GLR chart is compared with that of other control charts, such as the standard cumulative sum (CUSUM) charts and the cumulative score (CUSCORE) charts. And we compare the proposed GLR chart with the GLR charts designed for monitoring only a sustained shift and for monitoring only a linear drift. Finally, we also compare the proposed GLR chart with the chart combinations. We show that the proposed GLR chart has better overall performance for a wide range of shift sizes and drift rates relative to other control charts, when a special cause produces a sustained shift and/or a linear drift in the process mean.

Performance Evaluation for Scheduling Policies on a Realtime Database (실시간 데이터베이스에 대한 스케쥴링 정책의 성능 평가)

  • Kim, Suhee;Han, Kwangrok;Kim, Hwankoo;Son, Sang-Hyuk
    • Convergence Security Journal
    • /
    • v.4 no.3
    • /
    • pp.57-82
    • /
    • 2004
  • The confluence of computers, communications, and databases is quickly creating a distributed database where many applications require real-time access to temporally consistent sensor data. We have developed an object-oriented real-time database system called BeeHive to provide a significant improvement in performance and functionality over conventional non-real-time database and object management systems. In this paper, the performance of two data-deadline cognizant scheduling policies EDDF and EDF-DC and the baseline EDF policy with/without admission control are evaluated through extensive experiments on BeeHive. The ranges where data-deadline cognizant scheduling policies are effective and where admission control plays a role are identified.

  • PDF

Concentric Circle-Based Image Signature for Near-Duplicate Detection in Large Databases

  • Cho, A-Young;Yang, Won-Keun;Oh, Weon-Geun;Jeong, Dong-Seok
    • ETRI Journal
    • /
    • v.32 no.6
    • /
    • pp.871-880
    • /
    • 2010
  • Many applications dealing with image management need a technique for removing duplicate images or for grouping related (near-duplicate) images in a database. This paper proposes a concentric circle-based image signature which makes it possible to detect near-duplicates rapidly and accurately. An image is partitioned by radius and angle levels from the center of the image. Feature values are calculated using the average or variation between the partitioned sub-regions. The feature values distributed in sequence are formed into an image signature by hash generation. The hashing facilitates storage space reduction and fast matching. The performance was evaluated through discriminability and robustness tests. Using these tests, the particularity among the different images and the invariability among the modified images are verified, respectively. In addition, we also measured the discriminability and robustness by the distribution analysis of the hashed bits. The proposed method is robust to various modifications, as shown by its average detection rate of 98.99%. The experimental results showed that the proposed method is suitable for near-duplicate detection in large databases.

Knowledge Distributed Robot Control Framework

  • Chong, Nak-Young;Hongu, Hiroshi;Ohba, Kohtaro;Hirai, Shigeoki;Tanie, Kazuo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1071-1076
    • /
    • 2003
  • In this work, we propose a new framework of robot control for a variety of applications to our unstructured everyday environments. Programming robots can be a very time-consuming process and seems almost impossible for ordinary end users. To cope with this, this work is to provide a software framework for building robot application programs automatically, where we have robots learn how to accomplish a commanded task from the object. An integrated sensing and computing tag is embedded into every single object in the environment. In the robot controller, only the basic software libraries for low-level robot motion control are provided from the robot manufacturer. The main contributions of this work is to develop a server platform that we call Omniscient Server that generates the application programs and send them to the robot controller through the network. The object-related information from the object server merges into robot control software to generate a detailed application program based on the task commands from the human. We have built a test bed and demonstrated that a robot can perform a common household task within the proposed framework.

  • PDF

Multimedia Information and Authoring for Personalized Media Networks

  • Choi, Insook;Bargar, Robin
    • Journal of Multimedia Information System
    • /
    • v.4 no.3
    • /
    • pp.123-144
    • /
    • 2017
  • Personalized media includes user-targeted and user-generated content (UGC) exchanged through social media and interactive applications. The increased consumption of UGC presents challenges and opportunities to multimedia information systems. We work towards modeling a deep structure for content networks. To gain insights, a hybrid practice with Media Framework (MF) is presented for network creation of personalized media, which leverages the authoring methodology with user-generated semantics. The system's vertical integration allows users to audition their personalized media networks in the context of a global system network. A navigation scheme with dynamic GUI shifts the interaction paradigm for content query and sharing. MF adopts a multimodal architecture anticipating emerging use cases and genres. To model diversification of platforms, information processing is robust across multiple technology configurations. Physical and virtual networks are integrated with distributed services and transactions, IoT, and semantic networks representing media content. MF applies spatiotemporal and semantic signal processing to differentiate action responsiveness and information responsiveness. The extension of multimedia information processing into authoring enables generating interactive and impermanent media on computationally enabled devices. The outcome of this integrated approach with presented methodologies demonstrates a paradigmatic shift of the concept of UGC as personalized media network, which is dynamical and evolvable.

A Software Defined Networking Approach to Improve the Energy Efficiency of Mobile Wireless Sensor Networks

  • Aparicio, Joaquin;Echevarria, Juan Jose;Legarda, Jon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2848-2869
    • /
    • 2017
  • Mobile Wireless Sensor Networks (MWSN) are usually constrained in energy supply, which makes energy efficiency a key factor to extend the network lifetime. The management of the network topology has been widely used as a mechanism to enhance the lifetime of wireless sensor networks (WSN), and this work presents an alternative to this. Software Defined Networking (SDN) is a well-known technology in data center applications that separates the data and control planes during the network management. This paper proposes a solution based on SDN that optimizes the energy use in MWSN. The network intelligence is placed in a controller that can be accessed through different controller gateways within a MWSN. This network intelligence runs a Topology Control (TC) mechanism to build a backbone of coordinator nodes. Therefore, nodes only need to perform forwarding tasks, they reduce message retransmissions and CPU usage. This results in an improvement of the network lifetime. The performance of the proposed solution is evaluated and compared with a distributed approach using the OMNeT++ simulation framework. Results show that the network lifetime increases when 2 or more controller gateways are used.