• Title/Summary/Keyword: Information processing

Search Result 42,396, Processing Time 0.065 seconds

A Process to Design and Implement Service-based Android Applications (서비스 기반 안드로이드 어플리케이션의 설계 및 구현 프로세스)

  • Lee, Ho-Joong;La, Hyun-Jung;Keum, Chang-Sup;Kim, Soo-Dong
    • The KIPS Transactions:PartD
    • /
    • v.18D no.4
    • /
    • pp.245-260
    • /
    • 2011
  • Mobile Devices, which are developed with the fast growing of the Internet, have flexible internet accessibility and can access the network anywere so that they can execute software applications. However, it is very challenging to deploy highly complex applications on mobile devices since they have limited resources. To overcome the limitation, researches on applying a concept of services to mobile applications have been proposed. Android is one of the popular mobile platforms and is designed to effectively execute mobile applications on the mobile devices having limited resources. Since service-based Android applications, which adopt a concept of services and Android platform, invoke remote services and are built with Android-specific components, they are much different from traditional software applications. Consequently, it is not straightforward to apply object-oriented (OO) analysis and design methods to developing service-based Android applications, although they have been frequently applied to developing traditional applications. In this paper, we present a process to develop service-based Android mobile applications, which extends a traditional OO development process. First, we raise design issues to be considered in developing service-based Android applications. Then, to solve the issues, we present detailed guidelines for essential phases of OO-based development process that are customized to service-based Android applications. Finally, to show applicability of the process, we perform a case study. The proposed design process is effectively utilized as a set of guidelines to develop service-based Android applications more systematically and effectively.

A Reduction Method of Over-Segmented Regions at Image Segmentation based on Homogeneity Threshold (동질성 문턱 값 기반 영상분할에서 과분할 영역 축소 방법)

  • Han, Gi-Tae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.1
    • /
    • pp.55-68
    • /
    • 2012
  • In this paper, we propose a novel method to solve the problem of excessive segmentation out of the method of segmenting regions from an image using Homogeneity Threshold($H_T$). The algorithm of the previous image segmentation based on $H_T$ was carried out region growth by using only the center pixel of selected window. Therefore it was caused resulting in excessive segmented regions. However, before carrying region growth, the proposed method first of all finds out whether the selected window is homogeneity or not. Subsequently, if the selected window is homogeneity it carries out region growth using the total pixels of selected window. But if the selected window is not homogeneity, it carries out region growth using only the center pixel of selected window. So, the method can reduce remarkably the number of excessive segmented regions of image segmentation based on $H_T$. In order to show the validity of the proposed method, we carried out multiple experiments to compare the proposed method with previous method in same environment and conditions. As the results, the proposed method can reduce the number of segmented regions above 40% and doesn't make any difference in the quality of visual image when we compare with previous method. Especially, when we compare the image united with regions of descending order by size of segmented regions in experimentation with the previous method, even though the united image has regions more than 1,000, we can't recognize what the image means. However, in the proposed method, even though image is united by segmented regions less than 10, we can recognize what the image is. For these reason, we expect that the proposed method will be utilized in various fields, such as the extraction of objects, the retrieval of informations from the image, research for anatomy, biology, image visualization, and animation and so on.

Revitalization Plan and Value of Social Network Service in the Business Organization (기업조직 내 소셜 미디어 서비스 활용의 가치 제고 및 활성화 방안)

  • Kim, Dong-Hyun;Seo, Hyun-Shik;Kim, Hyung-Joon;Lee, Bong-Gyou
    • The KIPS Transactions:PartD
    • /
    • v.18D no.4
    • /
    • pp.275-286
    • /
    • 2011
  • The purpose of this study is to find the beneficial plan for business success by the advantage of social media service in the business organization. There is few research for applying social media on a variety of fields in business organization although many companies are trying to find the way for its application. Hence, this study identifies the possibility for the utilization of social media services, and it also finds the plan for their effective application. The social relationship is created by increasing communications between users of social media service. The research model is established on the basis of the hypothesis that the social relationship affects knowledge share, pursuit of ego, social participation, amusement. To maximize the impact of results, the research was conducted on the basis of the target on two groups including the business men and non-business men who use social media services. As results of the research, the business men tend to appeal their impression based on sharing knowledge with anonymous people. Also, it is necessary to make a social participation to a management participation, and to utilize the social media in the organization by including amusement to its function. This research is expected to have significant implication to companies which wants to apply social media services in the future.

Efficient Processing using Static Validity Circle for Continuous Skyline Queries (연속적인 스카이라인 질의의 정적 유효 영역을 이용한 효율적인 처리)

  • Li, Zhong-He;Park, Young-Bae
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.631-643
    • /
    • 2006
  • Moving objects in a mobile environment to change their position based on the change of time require a query with their position as a basis. Efficient Regional Decision for Continuous Skyline Queries requires objectively pre-calculating the OSR(Optimal Skyline Region) regardless of the speed and direction of the moving objects. It proposes techniques to reduce the frequency of continuous queries by choosing a VCircle(Validity Circle) as safe location which has radius of the distance to the closest region with position on the moving object at center. But, a VCircle's area varies based on the Moving object's position from first marked time of continuous query. Therefore, the frequency of its continuous query is variable and also when the object moves inside of OSR, query can re-occur frequently In this paper, we suggest a technique of selecting an IVCircle(Interior Validity Circle) in a Skyline Region as the static Safe Region using the characteristics of the OSR. An Interior IVCircle can be calculated in advance when the OSR is decided. Our experiment shows that the frequency of using IVcircle as safe region reduced than that of using VCircle as safe region by 52.55%.

Hippocratic XML Databases: A Model and Access Control Mechanism (히포크라테스 XML 데이터베이스: 모델 및 액세스 통제 방법)

  • Lee Jae-Gil;Han Wook-Shin;Whang Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.684-698
    • /
    • 2004
  • The Hippocratic database model recently proposed by Agrawal et al. incorporates privacy protection capabilities into relational databases. Since the Hippocratic database is based on the relational database, it needs extensions to be adapted for XML databases. In this paper, we propose the Hippocratic XML database model, an extension of the Hippocratic database model for XML databases and present an efficient access control mechanism under this model. In contrast to relational data, XML data have tree-like hierarchies. Thus, in order to manage these hierarchies of XML data, we extend and formally define such concepts presented in the Hippocratic database model as privacy preferences, privacy policies, privacy authorizations, and usage purposes of data records. Next, we present a new mechanism, which we call the authorization index, that is used in the access control mechanism. This authorization index, which is Implemented using a multi-dimensional index, allows us to efficiently search authorizations implied by the authorization granted on the nearest ancestor using the nearest neighbor search technique. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 13.6 times over the top-down access control strategy and by up to 20.3 times over the bottom-up access control strategy The major contributions of our paper are 1) extending the Hippocratic database model into the Hippocratic XML database model and 2) proposing an efficient across control mechanism that uses the authorization index and nearest neighbor search technique under this model.

Desgin of a Spatial QueryExecutor using Tag Technique (태그 기법을 이용한 공간 질의 수행기의 설계)

  • Lee, Chan-Geun;Park, Ho-Hyeon;Lee, Yong-Ju;Jeong, Jin-Wan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.5
    • /
    • pp.543-552
    • /
    • 1999
  • The iterator technique which is used for implementing physical operators of the query executor is known for its efficiency and extensibility. The most widely used technique for processing an operator on spatial objects is to process by dividing it into the filter step and the refinement step. Recently, there was a research for an optimizer which can generate more efficient query execution plans than those of traditional methods by separating a spatial operator into filter and refinement steps in the level of the object algebra. But, traditional query executors were not designed considering such query execution plans. So they have no function of transmitting the result of the filter operation between operators. We propose two methods, the probe technique and the tag technique, which transmit the result of the filter operator when using the iterator in the query execution plan in which operators are separated by filter/refinement steps and other operators can be allowed between the steps. Whereas the probe technique extends the state record within an operator, the tag technique stores the result of a filter step in an intermediate result in the form of the tag. Based on the comparison of these methods, we design and implement a query executor using the tag technique that is superior in extensibility. The implemented query executor can execute operations defined in the Spatial Object Algebra(SOA) to process an extended OQL for spatial queries.

Implementation of a Photo-Input Game Interface Using Image Search (이미지 검색을 이용한 사진입력 게임 인터페이스 구현)

  • Lee, Taeho;Han, Jaesun;Park, Heemin
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.10
    • /
    • pp.658-669
    • /
    • 2015
  • The paradigm of game development changes with technological trends. If the system can analyze and determine undefined inputs, users' input choices are not restricted. Therefore, game scenarios can have multifarious flows depending upon the user's input data. In this paper, we propose a method of including an output plan in the game system that is based on the user's input but is not restricted to predefined choices. We have implemented an experimental game on the Android platform by combining network communication and APIs. The game interface works as follows: first, the user's input data is transmitted to the server using HTTP protocol; then, the server carries out an analysis on the input data; and finally, the server returns the decision result to the game device. The game can provide users a scenario that corresponds to the decision results. In this paper, we used an image file for the user's input data format. The server calculates similarities between the user's image file and reference images obtained from the Naver Image Search API and then returns determination results. We have confirmed the value of integrating the game development framework with other computing technologies demonstrating the potential of the proposed methods for application to various future game interfaces.

Trust Evaluation Scheme of Web Data Based on Provenance in Social Semantic Web Environments (소셜 시맨틱 웹 환경에서 프로버넌스 기반의 웹 데이터 신뢰도 평가 기법)

  • Yoon, Sangwon;Choi, Kitae;Park, Jaeyeol;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.106-118
    • /
    • 2016
  • Recently, as the generation and sharing of web data have increased, the importance of a social semantic web that combines the semantic web and the social web has also been increasing. In this paper, we propose a trust evaluation scheme based on provenance by extending the PROV model in the social semantic web environment. The proposed scheme manages the provenance of web data and adds the necessary elements for trust evaluation in the PROV model of W3C. The extended PROV model supports data management and provenance tracing. The proposed trust evaluation scheme considers various parameters such as user trust, original data trust, and user evaluation. The evaluated trust is managed as provenance. When processing a query, the proposed scheme generates a result by considering the trust. Therefore, the proposed scheme can manage the provenance of web data and compute data trust correctly by using such various parameters. The evaluated trust becomes a criterion to determine whether the query result can be trusted or not. In order to show the validity of the proposed scheme, we verify its performance using SPARQL queries.

A Performance Analysis of Large ABox Reasoning in OWL-DL Reasoners (다양한 OWL-DL 추론 엔진에서 대용량 ABox 추론에 대한 성능평가)

  • Seo, Eun-Seok;Park, Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.7
    • /
    • pp.655-666
    • /
    • 2007
  • Reasoners using typical Tableaux algorithm such as RacerPro, Pellet have a problem in Tableaux algorithm large ABox reasoning. Researches to solve these Problems are dealt with Instance Store of University of Manchester which uses Tableaux algorithm based reasoner and DBMS and KAON2 of University of Karlsruhe using Disjunctive Datalog approach. An evaluation experiment for present reasoners is the experiment of TBox reasoning in most of Tableaux algorithm based one. The most of benchmarking tests in reasoning systems haven't done with ABox reasoning based Tableaux Algorithm but done with TBox reasoning based Tableaux Algorithm. Especially, rarely reported benchmarking tests in reasoners have been issued nowadays. Therefore, this thesis evaluates systems with theory of each reasoners for large ABox reasoning that becomes issues recently with typical reasoners. The large AoBx reasoning engine will be analyzed using Instance Store and KAON2 of Manchester University for large ABox processing. At the analysing method, LUBM(Lehigh University BenchMark), benchmarking test method, and it's test system will be introduced. In conclusion, I recommend appropriate reasoner in various environment with experiment result and characteristic of algorithm used for each reasoner.

Development of Ubiquitous Sensor Network Intelligent Bridge System (유비쿼터스 센서 네트워크 기반 지능형 교량 시스템 개발)

  • Jo, Byung Wan;Park, Jung Hoon;Yoon, Kwang Won;Kim, Heoun
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.16 no.1
    • /
    • pp.120-130
    • /
    • 2012
  • As long span and complex bridges are constructed often recently, safety estimation became a big issue. Various types of measuring instruments are installed in case of long span bridge. New wireless technologies for long span bridges such as sending information through a gateway at the field or sending it through cables by signal processing the sensing data are applied these days. However, The case of occurred accidents related to bridge in the world have been reported that serious accidents occur due to lack of real-time proactive, intelligent action based on recognition accidents. To solve this problem in this study, the idea of "communication among things", which is the basic method of RFID/USN technology, is applied to the bridge monitoring system. A sensor node module for USN based intelligent bridge system in which sensor are utilized on the bridge and communicates interactively to prevent accidents when it captures the alert signals and urgent events, sends RF wireless signal to the nearest traffic signal to block the traffic and prevent massive accidents, is designed and tested by performing TinyOS based middleware design and sensor test free Space trans-receiving distance.