본문 바로가기
HOME> 저널/프로시딩 > 저널/프로시딩 검색상세

저널/프로시딩 상세정보

권호별목차 / 소장처보기

H : 소장처정보

T : 목차정보

Applied computing and informatics 14건

  1. [해외논문]   Inside Front Cover: Editorial Board  


    Applied computing and informatics v.14 no.2 ,pp. IFC - IFC , 2018 ,

    초록

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  2. [해외논문]   Inside Front Cover: Editorial Board  


    Applied computing and informatics v.14 no.2 ,pp. IFC , 2018 ,

    초록

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  3. [해외논문]   An adaptive Cuckoo search algorithm for optimisation  

    Mareli, M. (Department of Electrical and Electronics Engineering, University of Johannesburg, PO Box 542, Auckland Park 2006, South Africa ) , Twala, B. (Institute of Intelligent Systems, Department of Electrical and Electronics Engineering University of Johannesburg, PO Box 542, Auckland Park 2006, South Africa)
    Applied computing and informatics v.14 no.2 ,pp. 107 - 115 , 2018 ,

    초록

    Abstract Cuckoo search is one of many nature-inspired algorithms used extensively to solve optimisation problems in different fields of engineering. It is a very effective in solving global optimisation because it is able to maintain balance between local and global random walks using switching parameter. The switching parameter for the original Cuckoo search algorithm is fixed at 25% and not enough studies have been done to assess the impact of dynamic switching parameter on the performance of Cuckoo search algorithm. This paper’s contribution is the development of three new Cuckoo search algorithms based on dynamically increasing switching parameters. The three new Cuckoo search algorithms are validated on ten mathematical test functions and their results compared to those of Cuckoo search algorithms with constant and dynamically decreasing switching parameters respectively. Finally, the simulations in this study indicate that, the Cuckoo search algorithm with exponentially increasing switching parameter outperformed the other Cuckoo search algorithms.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  4. [해외논문]   The use of ontologies for effective knowledge modelling and information retrieval  

    Munir, Kamran (Department of Computer Science and Creative Technologies, University of the West of England, BS16 1QY Bristol, United Kingdom ) , Sheraz Anjum, M. (School of Electrical Engineering and Computer Science, National University of Sciences and Technology (NUST), H-12 Islamabad, Pakistan)
    Applied computing and informatics v.14 no.2 ,pp. 116 - 126 , 2018 ,

    초록

    Abstract The dramatic increase in the use of knowledge discovery applications requires end users to write complex database search requests to retrieve information. Such users are not only expected to grasp the structural complexity of complex databases but also the semantic relationships between data stored in databases. In order to overcome such difficulties, researchers have been focusing on knowledge representation and interactive query generation through ontologies, with particular emphasis on improving the interface between data and search requests in order to bring the result sets closer to users research requirements. This paper discusses ontology-based information retrieval approaches and techniques by taking into consideration the aspects of ontology modelling, processing and the translation of ontological knowledge into database search requests. It also extensively compares the existing ontology-to-database transformation and mapping approaches in terms of loss of data and semantics, structural mapping and domain knowledge applicability. The research outcomes, recommendations and future challenges presented in this paper can bridge the gap between ontology and relational models to generate precise search requests using ontologies. Moreover, the comparison presented between various ontology-based information retrieval, database-to-ontology transformations and ontology-to-database mappings approaches provides a reference for enhancing the searching capabilities of massively loaded information management systems.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  5. [해외논문]   Hierarchical simultaneous vertical fragmentation and allocation using modified Bond Energy Algorithm in distributed databases  

    Rahimi, Hossein (Corresponding author. Tel.: +98 2188713160.) , Parand, Fereshteh-Azadi , Riahi, Davoud
    Applied computing and informatics v.14 no.2 ,pp. 127 - 133 , 2018 ,

    초록

    Abstract Designing an efficient Distributed Database System (DDBS) is considered as one of the most challenging problems because of multiple interdependent factors which are affecting its performance. Allocation and fragmentation are two processes which their efficiency and correctness influence the performance of DDBS. Therefore, efficient data fragmentation and allocation of fragments across the network sites are considered as an important research area in distributed database design. This paper presents an approach which simultaneously fragments data vertically and allocates the fragments to appropriate sites across the network. Bond Energy Algorithm (BEA) is applied with a better affinity measure that improves the generated clusters of attributes. The algorithm simultaneously generates clusters of attributes, calculates the cost of allocating each cluster to each site and allocates each cluster to the most appropriate site. Results show more efficient clustering and allocation which gives better performance.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  6. [해외논문]   An evolutionary framework for multi document summarization using Cuckoo search approach: MDSCSA  

    Rautray, Rasmita (Department of Computer Science and Engineering, Siksha 'O' Anusandhan University, Bhubaneswar 751030, Odisha, India ) , Balabantaray, Rakesh Chandra (Department of Computer Science, IIIT, Bhubaneswar, Odisha, India)
    Applied computing and informatics v.14 no.2 ,pp. 134 - 144 , 2018 ,

    초록

    Abstract In today's scenario the rate of growth of information is expanding exponentially in the World Wide Web. As a result, extracting valid and useful information from a huge data has become a challenging issue. Recently text summarization is recognized as one of the solution to extract relevant information from large documents. Based on number of documents considered for summarization, the summarization task is categorized as single document or multi-document summarization. Rather than single document, multi-document summarization is more challenging for the researchers to find accurate summary from multiple documents. Hence in this study, a novel Cuckoo search based multi-document summarizer (MDSCSA) is proposed to address the problem of multi-document summarization. The proposed MDSCSA is also compared with two other nature inspired based summarization techniques such as Particle Swarm Optimization based summarization (PSOS) and Cat Swarm Optimization based summarization (CSOS). With respect to the benchmark dataset Document Understanding Conference (DUC) datasets, the performance of all algorithms are compared in terms of ROUGE score, inter sentence similarity and readability metric to validate non-redundancy, cohesiveness and readability of the summary respectively. The experimental analysis clearly reveals that the proposed approach outperforms the other summarizers included in this study.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  7. [해외논문]   A method for verifying integrity & authenticating digital media  

    Harran, Martin (Letterkenny Institute of Technology, Donegal, Ireland ) , Farrelly, William (Letterkenny Institute of Technology, Donegal, Ireland ) , Curran, Kevin (Ulster University, Derry, United Kingdom)
    Applied computing and informatics v.14 no.2 ,pp. 145 - 158 , 2018 ,

    초록

    Abstract Due to their massive popularity, image files, especially JPEG, offer high potential as carriers of other information. Much of the work to date on this has focused on stenographic ways of hiding information using least significant bit techniques but we believe that the findings in this project have exposed other ways of doing this. We demonstrate that a digital certificate relating to an image file can be inserted inside that image file along with accompanying metadata containing references to the issuing company. Notwithstanding variations between devices and across operating systems and applications, a JPEG file holds its structure very well. Where changes do take place, this is generally in the metadata area and does not affect the encoded image data which is the heart of the file and the part that needs to be verifiable. References to the issuing company can be inserted into the metadata for the file. There is an advantage of having the digital certificate as an integral part of the file to which it applies and consequently travelling with the file. We ultimately prove that the metadata within a file offers the potential to include data that can be used to prove integrity, authenticity and provenance of the digital content within the file.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  8. [해외논문]   2D ceramic grains images manipulations: A simple geometrical characterization and grain domain recreation algorithm  

    Braga, Filipe L.
    Applied computing and informatics v.14 no.2 ,pp. 159 - 165 , 2018 ,

    초록

    Abstract The precision and accuracy of certain simulations in nanoscience, fluid dynamics and biotechnology in the analyses of boundary conditions problems with real experimental results are in general related to the characteristics of numerical approach used and subsequently to the morphological structure of lattices used along these calculations. The more the lattice used approximates to the original boundary or initial condition problem more precise the simulation would be. This work shows a simple algorithm that can be used to build huge lattices containing the main geometrical structures statistically similar to experimental 2D image data of ceramic grains by using some freeware software.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  9. [해외논문]   Classification of fingerprint images with the aid of morphological operation and AGNN classifier  

    Borra, Subba Reddy (Department of Computer Science and Engineering, JNTUH, Hyderabad 500085, India ) , Jagadeeswar Reddy, G. (Narayana Engineering College, Nellore, AP 524004, India ) , Sreenivasa Reddy, E. (University College of Engineering, Acharya Nagarjuna University, AP 522508, India)
    Applied computing and informatics v.14 no.2 ,pp. 166 - 176 , 2018 ,

    초록

    Abstract The uniqueness, public recognition, firmness, and their least jeopardy of fingerprints made an extensively and proficiently utilized personal authentication metrics. Fingerprint technology is a biometric method that is used to recognize persons on the basis of their physical traits. These physical forms comprise of ridges and valleys prevailing on the surface of fingertips. Fingerprint images are direction-oriented pattern fashioned using ridges and valleys. The reputation of the fingerprint image regulates the durability of a fingerprint authentication scheme. For enhancing the restrictions of prevailing fingerprint image augmentation approaches we have proposed an effectual method to pact with various fingerprint images. The proposed methodology alienated into three modules. Primarily, the fingerprint image is endangered to denoising procedure where Wave atom transform is used. Once this procedure is accomplished the image augmentation is achieved for improving the classification rate. The morphological operation is used in our proposed technique in order to augment the image. The morphological operators such as dilation and area opening are used here for improvement. Finally the ordering of fingerprint image is done. Adaptive Genetic Neural Network (AGNN) is used for classification of images efficiently.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지
  10. [해외논문]   Novel two dimensional fractional-order discrete chaotic map and its application to image encryption  

    Liu, Zeyu (Corresponding author.) , Xia, Tiecheng
    Applied computing and informatics v.14 no.2 ,pp. 177 - 185 , 2018 ,

    초록

    Abstract A new fractional two dimensional triangle function combination discrete chaotic map (2D-TFCDM) is proposed by utilizing the discrete fractional calculus. Furthermore, the chaos behaviors are numerically discussed in the fractional-order difference. The bifurcation diagrams, the largest Lyapunov exponent plot and the phase portraits are shown, respectively. With the keys produced by elliptic curve in finite field, the discrete fractional map is converted into algorithm, and applied to color image encryption. The image encryption method is first proposed by us worldwide.

    원문보기

    원문보기
    무료다운로드 유료다운로드

    회원님의 원문열람 권한에 따라 열람이 불가능 할 수 있으며 권한이 없는 경우 해당 사이트의 정책에 따라 회원가입 및 유료구매가 필요할 수 있습니다.이동하는 사이트에서의 모든 정보이용은 NDSL과 무관합니다.

    NDSL에서는 해당 원문을 복사서비스하고 있습니다. 아래의 원문복사신청 또는 장바구니담기를 통하여 원문복사서비스 이용이 가능합니다.

    이미지

    Fig. 1 이미지

논문관련 이미지