• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.956-961
• /
• 2009

When construction engineers perform their work in the jobsite, they have to record as-built conditions in the project log (Data Collection). On the other hand, the engineers often have to refer to the construction documents when necessary at the job faces (Data Access). The practice of Data Collection and Data Access in the jobsite can be greatly enhanced by utilizing mobile computing with wireless communications. In this paper, two cases of mobile computing applications for construction field management are presented; Mobile Specifications System and Mobile Data Collection System. The demonstration of the process for developing two mobile applications is the primary purpose of the paper. The problems and issues involved with adopting mobile computing for construction field are also presented. The simple information framework for mobile computing has been also proposed as an outcome of the research. As for development tools, readily available relational database and wireless network have been used. The use of commercial mobile broadband was examined for data communication where local area network is not available.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• pp.115-118
• /
• 2002

This paper designs Accounting structure for local users to policy base in Grid environment that integrate distributed Supercomputing resources geographically. Policy base virtual user Accounting system controls unnecessary increase of discrete Computing each local Accounting information. Also, This paper described method to manage do resources of each local system to policy base and presented way to process expense cost when used resources.

• Structural Engineering and Mechanics
• /
• 제37권1호
• /
• pp.17-37
• /
• 2011

This paper presents a new Internet-based computational framework for the realistic simulation of multi-scale response of structural systems. Two levels of parallel processing are involved in this frame work: multiple local distributed computing environments connected by the Internet to form a cluster-to-cluster distributed computing environment. To utilize such a computing environment for a realistic simulation, the simulation task of a structural system has been separated into a simulation of a simplified global model in association with several detailed component models using various scales. These related multi-scale simulation tasks are distributed amongst clusters and connected to form a multi-level hierarchy. The Internet is used to coordinate geographically distributed simulation tasks. This paper also presents the development of a software framework that can support the multi-level hierarchical simulation approach, in a cluster-to-cluster distributed computing environment. The architectural design of the program also allows the integration of several multi-scale models to be clients and servers under a single platform. Such integration can combine geographically distributed computing resources to produce realistic simulations of structural systems.

• 한국컴퓨터정보학회논문지
• /
• 제27권11호
• /
• pp.99-106
• /
• 2022

본 논문은 클라우딩 컴퓨팅 환경에서 디지털 콘텐츠 관리 기술을 제안한다. 네트워크를 활용한 컴퓨팅 서비스는 4차 산업혁명 시대에 빠질 수 없는 기본 인프라 서비스이다. 스마트폰을 활용한 금융 서비스, 디지털 콘텐츠 서비스, 산업 및 홈 네트워크 서비스는 국부적인 영역의 서비스에서 전체 서비스가 가능한 클라우드 서비스 환경으로 변화하고 있다. 이에 본 연구에서는 클라우드 컴퓨팅 환경에 적합한 디지털 콘텐츠 서비스가 안전하게 지원되도록 시스템을 제안하였다. 제안 시스템은 사용자의 시스템 접근의 편의성과 안전성을 제공하고, 디지털 콘텐츠 저작자의 저작권을 보호하며, 안전한 디지털 콘텐츠 유통 및 관리 시스템을 제공한다. 본 연구의 목적은 클라우드 컴퓨팅 환경에 적합한 디지털 콘텐츠 유통구조를 제공하여 디지털 콘텐츠 시장을 안정화시키고 활성화하는데 있다.

• Smart Structures and Systems
• /
• 제3권4호
• /
• pp.455-474
• /
• 2007

A flexibility-based distributed computing strategy (DCS) for structural health monitoring (SHM) has recently been proposed which is suitable for implementation on a network of densely distributed smart sensors. This approach uses a hierarchical strategy in which adjacent smart sensors are grouped together to form sensor communities. A flexibility-based damage detection method is employed to evaluate the condition of the local elements within the communities by utilizing only locally measured information. The damage detection results in these communities are then communicated with the surrounding communities and sent back to a central station. Structural health monitoring can be done without relying on central data acquisition and processing. The main purpose of this paper is to experimentally verify this flexibility-based DCS approach using wired sensors; such verification is essential prior to implementation on a smart sensor platform. The damage locating vector method that forms foundation of the DCS approach is briefly reviewed, followed by an overview of the DCS approach. This flexibility-based approach is then experimentally verified employing a 5.6 m long three-dimensional truss structure. To simulate damage in the structure, the original truss members are replaced by ones with a reduced cross section. Both single and multiple damage scenarios are studied. Experimental results show that the DCS approach can successfully detect the damage at local elements using only locally measured information.

• 한국컴퓨터정보학회논문지
• /
• 제15권2호
• /
• pp.1-8
• /
• 2010

본 논문에서는 그리드 환경을 구축할 때 자원 비용 면에서 효율적인 스케줄링 정책을 제안한다. 이 스케줄링 정책은 로컬 컴퓨팅 자원을 효율적으로 할당하기 위해 자원 비용과 작업 실패율을 고려한다. 이 스케줄링 정책의 특징은 원격 스케줄러와 로컬 스케줄러를 사용하여 2단계 스케줄링을 수행한다. 원격 스케줄러에서는 자원 데이터베이스에 저장된 네트워크와 로컬시스템의 정보를 사용하여 작업의 총실행시간이 최소인 로컬시스템을 선택하여 작업을 할당한다. 로컬 스케줄러에서는 할당된 작업의 대기시간과 처리시간을 재계산한 후, 작업을 데드라인 내에 처리할 수 있다면 로컬시스템에서 수행한다. 하지만 데드라인을 초과하면 다른 로컬시스템으로 이주시켜 처리함으로써 작업 실패율과 자원 비용을 최소화한다. 제안한 스케줄링 정책은 기존 Greedy 정책에 비해 작업 실패율은 높지만, 자원 비용을 줄이는 면에서 더 우수함을 보인다. 본 논문에서는 시뮬레이션을 통하여 제안한 스케줄링 정책이 기존 Greedy 스케줄링 정책에 비해 컴퓨팅 자원 비용을 줄이는 면에서 효과적임을 보인다.

• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.489-504
• /
• 2021

By distributing computing tasks among devices at the edge of networks, edge computing uses virtualization, distributed computing and parallel computing technologies to enable users dynamically obtain computing power, storage space and other services as needed. Applying edge computing architectures to Internet of Vehicles can effectively alleviate the contradiction among the large amount of computing, low delayed vehicle applications, and the limited and uneven resource distribution of vehicles. In this paper, a predictive offloading strategy based on the MEC load state is proposed, which not only considers reducing the delay of calculation results by the RSU multi-hop backhaul, but also reduces the queuing time of tasks at MEC servers. Firstly, the delay factor and the energy consumption factor are introduced according to the characteristics of tasks, and the cost of local execution and offloading to MEC servers for execution are defined. Then, from the perspective of vehicles, the delay preference factor and the energy consumption preference factor are introduced to define the cost of executing a computing task for another computing task. Furthermore, a mathematical optimization model for minimizing the power overhead is constructed with the constraints of time delay and power consumption. Additionally, the simulated annealing algorithm is utilized to solve the optimization model. The simulation results show that this strategy can effectively reduce the system power consumption by shortening the task execution delay. Finally, we can choose whether to offload computing tasks to MEC server for execution according to the size of two costs. This strategy not only meets the requirements of time delay and energy consumption, but also ensures the lowest cost.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권1호
• /
• pp.49-54
• /
• 2016

Regarding global and local factors of a set of features, a given single image or multiple images is a common approach in image processing. This paper introduces an application of an adaptive version of non-local filter whose original version searches non-local similarity for removing noise. Since most images involve texture partner in both foreground and background, extraction of signified regions with texture is a challenging task. Aiming to the detection of visual attention regions for images with texture, we present the contrast analysis of image patches located in a whole image but not nearby with assistance of the adaptive filter for estimation of non-local divergence. The method allows extraction of signified regions with texture of images of wild life. Experimental results for a benchmark demonstrate the ability of the proposed method to deal with the mentioned challenge.

• 인터넷정보학회논문지
• /
• 제21권2호
• /
• pp.57-64
• /
• 2020

The widespread use of smartphones with a variety of features has enabled mobile Internet-based services. One of these is online-to-offline (O2O) based services that connects online users with offline stores to add value. Applying this O2O strategy to local information retrieval induces online users to be linked to offline regions, thereby enabling the exchange of local-based information and helps create new value. This paper proposes and illustrates the implementation of O2O-based a local information providing service that utilizes photos of the local attraction. Also, we propose a fake-free ranking method to provide reliable local information to users and suggest its application of the service.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.