• Korean Journal of Cognitive Science
• /
• v.27 no.3
• /
• pp.355-376
• /
• 2016

We used holes defined by color similarity (Experiment 1) and binocular disparity (Experiment 2) to study how the inner contour of an object (i.e., boundary of a hole in it) is encoded in visual working memory. Many studies in VWM have shown that an object's boundary properties can be integrated with its surface properties via their shared spatial location, yielding an object-based encoding benefit. However, encoding of the hole contours has rarely been tested. We presented objects (squares or circles) containing a bar under a change detection paradigm, and relevant features to be remembered were the color of objects and the orientation of bars (or holes). If the contour of a hole belongs to the surrounding object rather than to the hole itself, the object-based feature binding hypothesis predicts that the shape of it can be integrated with color of an outer object, via their shared spatial location. Thus, in the hole display, change detection performance was expected to better than in the conjunction display where orientation and color features to be remembered were assigned to different parts of a conjunction object, and comparable to that in a single bar display where both orientation and color were assigned into a single bar. However, the results revealed that performance in the hole display did not differ from that in the conjunction display. This suggests that the shape of holes is not automatically encoded together with the surface properties of the outer object via object-based feature binding, but encoded independently from the surrounding object.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.6
• /
• pp.1405-1412
• /
• 2015

In Korea, public infrastructure projects employ "long term continuation (LTC) contracts," which require budgets to be reevaluated and re-appropriated annually throughout the multi-year life of the project. However, such contracts also make it susceptible to frequently changing government policies, in which budgets required for existing projects are allocated to new projects and thus does not provide a consistent stream of capital to multi-year projects. Each year, the KEC needs to attain government funds for construction of its multiple highway construction sites. Because it is difficult to know the amount that may be actually appropriated to KEC in a given year, it is in turn difficult to anticipate and provide sufficient funds necessary for construction to run smoothly and continuously. The lack of a good logic for appropriation has resulted in projects having a skewed distribution of capital. To get better budget appropriations from the central government, the KEC first needs a systemized approach that rationalizes the annual construction capital optimally required for its individual sites. The goal of this research was to devise a way that allows the KEC to determine and calculate the optimal construction costs that would be required for its individual construction sites on an annual basis. Both the optimal progress rate and the essential work types were assessed through a workshop with 24 professionals (KEC employees and contractors) who had extensive experience in KEC projects and also were currently working in these projects.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.87-103
• /
• 2009

Grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because Grid middleware does not have common sharable information system. In order to use Grid computing environment efficiently which consists of various Grid middlewares, it is necessary to have application-independent information system which can share information description and services, and expand them easily. Thus, in this paper, we propose a semantic information system framework based on web services and ontology for Grid computing environment, called WebSIS. It makes application and middleware developer easy to build sharable and extensible information system which is easy to share information description and can provide ontology based platform-independent information services. We present efficient ontology based information system architecture through WebSIS. Discovering appropriate resource for task execution on Grid needs more high-level information processing because Grid computing environment is more complex than other traditional distributed computing environments and has various considerations which are needed for Grid task execution. Thus, we design and implement resource information system and services by using WebSIS which enables high-level information processing by ontology reasoning and semantic-matching, for automation of task execution on Grid.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.257-271
• /
• 2008

Wireless broadcast environments has character that a number of mobile client can receive data streaming from central server no matter how they are so many. Because it is asymmetric bandwidth in that uplink and downlink bandwidth are different. This advantage helps wireless broadcast environments is used in many applications. These applications work almost read operation and need control concurrency using transaction unit. Previous concurrency control scheme in single channel is not adapted in multi channel environments because consistency of data are broken when a mobile client tunes in a broadcast cycle in a channel and then move into another channel and listen to different broadcast cycle with already accessed broadcast cycle. In this paper, we propose concurrency control for read-only mobile transactions in multiple wireless broadcast channel. First of all, we adapt index and data dedicated channel and propose LBCPC(Longest Broadcast Cycle Per Channel) as new unit of consistency. In index dedicated channel, it is repeatedly broadcasted data in same BCPC(Broadcast Cycle Per Channel) until LBCPC. And mobile transaction executes validation using control information every LBCPC. As a result, consistency of data is kept and average response time is shorter than one in single channel because waiting time for restart reduces. And as control information is broadcasted more frequently than in single channel, it is guaranteed currency about data accessed by transaction. Finally, according to the simulation result, we verify performance of our scheme in multi channel as comparing average response time with single channel.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.372-385
• /
• 2002

In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.