• Title/Summary/Keyword: jQuery

Search Result 69, Processing Time 0.031 seconds

A Study of User Interaction Using jQuery in Web Application (웹 응용에서 jQuery를 이용한 사용자 인터랙션 연구)

  • Lee, Seon-Ung;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.626-631
    • /
    • 2011
  • In this paper, the methods of designing and implementing user interaction using jQuery in Web Application are suggested. While computing ability of smart devices grows up, web application technology is generalized. So JavaScript is one of noticeable web application technologies, and jQuery is the most popular JavaScript framework. We described basic grammar, scalability and plug-ins of jQuery. We categorized user interactions and animations and described methods to implement it.

User Interface Effect Plugin using jQuery for Web Accessibility (웹 접근성을 고려한 jQuery 유저 인터페이스 효과 플러그인)

  • Lee, Seon-Ung;Moon, Il-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.866-868
    • /
    • 2011
  • In this paper, we propose an implementation of user interaction effect of web application using jQuery. jQuery is a very popular and extensible JavaScript library. It is strong in controlling DOM(Document Object Model), events and Ajax. But, it is poor at advanced effect of web user UI(User Interface). Implementing advanced effects need to extend jQuery or some skills. So, our proposal is a good way to implement UI effects.

  • PDF

The Design of the Selection and Alignment Queries Using Mobile Program (J2ME) for Database Query Optimization

  • Min, Cheon-Hong;Kumar, Prasanna
    • 한국경영정보학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.620-627
    • /
    • 2008
  • In this paper, recognizing the importance of the database query optimization design methods, we implemented mobile database with mobile program (J2ME) which is a useful database procedures. In doing so, we emphasize the logical query optimization which brings mobile database to performance improvement. The research implies that the suggested mobile program (J2ME) would contribute to the realization of the efficient mobile database as the related technology develops in the future.

  • PDF

The Design of the Selection and Alignment Queries Using Mobile Program (J2ME) for Database Query Optimization

  • Ko, Wan-Suk;Min, Cheon-Hong
    • 한국디지털정책학회:학술대회논문집
    • /
    • 2003.12a
    • /
    • pp.263-273
    • /
    • 2003
  • Recognizing the importance of the database query optimization design methods, we implemented mobile database with mobile program (J2ME) which is a useful database procedures. In doing so, we emphasize the logical query optimization which brings mobile database to performance improvement. The research implies that the suggested mobile program (J2ME) would contribute to the realization of the efficient mobile database as the related technology develops in the future.

  • PDF

Visual Query and Analysis Tool of the Moving Object Database System

  • Lee, J.H.;Lee, S.H.;Nam, K.W.;Park, J.H.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.455-457
    • /
    • 2003
  • Diverse researches are working moving objects. The most important activities in a moving object database system are query and analysis of spatio -temporal data providing decision-making and problem solving support. Traditional spatial database query language and tools are inappropriate of the real world entities. This paper presents a spatio-temporal query and analysis tool with visual environment. It provides effective, interactive and user-friendly as well as statistic analysis. The moving objects database system stores plentiful moving objects data and performs spatio-temporal and nonspatio-temporal queries.

  • PDF

Efficient Query Retrieval from Social Data in Neo4j using LIndex

  • Mathew, Anita Brigit
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2211-2232
    • /
    • 2018
  • The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

Implementation of medicinal plant information system using Ajax and jQuery (Ajax과 jQuery 기반 약용식물 정보시스템 구현)

  • Kim, Hae-Ran;Kang, So-Young;Ceong, Hee-Taek;Han, Soon-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.7
    • /
    • pp.1626-1633
    • /
    • 2010
  • In this paper, we implemented medicinal plant information system based on user requirement using Ajax technique which can retrieve data from the server asynchronously in the background without refresh webpage and jQuery which is a lightweight cross-browser javascript library. Also, we presented the source code handling the server response data used in the system and compared the features by the type of response data. This system shows the improvement of user interaction and response rates because of a simple response data from the server, client-side data processing and change of web page by manipulating the DOM tree and provides ease of use and convenient data access.

Design and Implementation of N-Screen Based Movie Reservation System in the jQuery Mobile Environment (제이쿼리 모바일 환경에서 N-스크린 기반의 영화 예매 시스템의 설계 및 구현)

  • Lee, Myeong-Ho
    • Journal of Digital Convergence
    • /
    • v.12 no.5
    • /
    • pp.255-261
    • /
    • 2014
  • This paper intends to suggest methods to design and implement a jQuery mobile based system in a future mobile webapp environment through a study on an N-Screen application in a mobile webapp. N-Screen is one of the representative services of cloud computing. It is promoted by the need of users to require universal functions for all devices. However, this situation is in conflict with the users' need to have the same experience and N-Screen cannot deal with these disparate services. Thus, this study intends to suggest a system analysis, structure of design, and a framework by implementing the N-Screen based movie reservation system in the jQuery mobile environment.

Design and Implementation of Hand Writing Signature System Using jQuery on Heterogeneous Browsers (jQuery를 이용한 이기종 브라우저 통합 자필 서명 시스템 설계 및 구현)

  • Lee, Ki-myoung;Park, Seok-Cheon;Kim, Yong-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.973-975
    • /
    • 2015
  • 최근 강화된 개인정보 보호법으로 인해 개인의 고객정보 이용 및 약관 동의서와 그에 따른 디지털 자필 서명을 필요로 하는 기업이 증가하고 있다. 그러나 고객에게 자필 서명을 받기 위한 플랫폼은 PC, 맥, 안드로이드, 아이폰 등 다양한 디바이스의 호환을 필요로 한다. 이에 본 논문에서는 이기종 호환 스크립트인 jQuery를 이용하여 HTML5 가 호환되지 않는 PC기반 IE6 이상의 브라우저부터 안드로이드, iOS 등 터치기반 스마트 디바이스의 최신 브라우저까지 모두 호환되는 자필 서명 시스템을 설계 및 구현한다.

Searching Algorithms for Protein Sequences and Weighted Strings (단백질 시퀀스와 가중치 스트링에 대한 탐색 알고리즘)

  • Kim, Sung-Kwon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.8
    • /
    • pp.456-462
    • /
    • 2002
  • We are developing searching algorithms for weighted strings such as protein sequences. Let${\sum}$ be an alphabet and for each $a{\in}{\sum}$ its weight ${\mu}(a)$ is given. Given a string $A=a_1a_2…a_n\; with each ai{\in}{\sum}$, a substring<$A(i.j)=a_ia_{i+1}…a_j$ has weight ${\in}(A(i.j))={\in}(a_i)+{\in}(a_i+1)+…+{\in}(a_j)$.The problem we are dealing with is to preprocess A to build a searching structure, and later, given a query weight M, the structure is used to answer the question of whether there is a substring A(i,j) such that$M={\in}(A(i,j))$.In this paper an algorithm that improves over the previous result will be presented. The previously best known algorithm answers a query in $0(\frac{nlog\;logn}{log\; n})$time using a searching structure that requires O(n) amount of memory. Our algorithm reduces the memory requirement to $0(\frac{n}{log\; n})$ while achieving the same query answer time.