By Topic

2015 International Conference on Computational Science and Computational Intelligence (CSCI)

7-9 Dec. 2015

Filter Results

Displaying Results 1 - 25 of 182
  • [Front cover]

    Publication Year: 2015, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (576 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2015, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2015, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2015, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2015, Page(s):v - xviii
    Request permission for commercial reuse | PDF file iconPDF (161 KB)
    Freely Available from IEEE
  • Message from General and Program Co-chairs

    Publication Year: 2015, Page(s):xix - xx
    Request permission for commercial reuse | PDF file iconPDF (221 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

    Publication Year: 2015, Page(s):xxi - xxii
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • International Program Committee

    Publication Year: 2015, Page(s):xxiii - xxvi
    Request permission for commercial reuse | PDF file iconPDF (163 KB)
    Freely Available from IEEE
  • An Automatic Solution Framework for Robust and Computationally Efficient Joint Estimation in Optical Motion Capture

    Publication Year: 2015, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    We propose an automatic and computationally efficient solution framework for addressing the joint estimation problem in marker-based optical motion capture. A fast joint estimator is presented which only requires an optimisation over 3 variables using marker-trajectory-bases (MTB). We also introduce the theory of solvability propagation to realise this automation. The framework acquires a 'hybrid'... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Arithmetic and Control Cells for a DNA Binary Processor

    Publication Year: 2015, Page(s):7 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB) | HTML iconHTML

    Recently a great deal of interest has been shown by researchers on developing a bio-molecule based computer. The basic building blocks of such a computer are arithmetic units and memory. These units can be designed using Boolean logic gates as in the case of electronic circuits. Instead of using silicon based technology, Boolean logic gates can be generated from biological systems. One such system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Code Generator in Automotive Field

    Publication Year: 2015, Page(s):13 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    Rapid development of new technology has resulted changes in IT world affecting the way we work. Software use has increased in different fields of technology. In automation field, for example, the usage of Electronics Control Unit (ECU) has increased resulting in a different size of software. Due to persistent role of software in technology, the software cost and quality has become an important fie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bloom Filter Tree for Fast Search in Tree-Structured Data

    Publication Year: 2015, Page(s):18 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    We consider the problem of searching for a data element in a tree-structured data set (e.g., XML). We propose a method which is more efficient than tree traversal and which still retains all the important metadata information that would be lost in the naive method of linear list search. We compute a bloom filter for each interior node of the tree, essentially building a bloom filter tree to enhanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity Search of Bounded TIDASETs within Large Time Interval Databases

    Publication Year: 2015, Page(s):24 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    Searching for similar entities within a database is a common and a daily, billions of times, performed task. Generally, similarities are calculated using common distance measures like Manhatten, Euclidian, Levenshtein, Mahalanobis or Dynamic Time Warping (DTW). In this paper, we present a similarity measure for time interval data, which allows searching for similar sets of time interval records bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Device Simulator Based on Finite Element Method

    Publication Year: 2015, Page(s):30 - 35
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2410 KB) | HTML iconHTML

    As semiconductor industry advances toward nano-scale technology, it comes across many issues (such as short channel, narrow width, hot-electron effects etc.), which need to be addressed in time to continue advancements with Moore's Law. Technology Computer Aided Design provides a huge scope to build an environment which can be used to design and develop future devices, and study their alterations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incident Response through Behavioral Science: An Industrial Approach

    Publication Year: 2015, Page(s):36 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB) | HTML iconHTML

    We can apply psychological methods and behavioral science to understand the practices, techniques, processes, and skillset cyber-criminals are using nowadays for cyberattacks. We can setup honeypots to observe the techniques and methods used for attacks through logs and security settings. However, setting up a honeypot is very expensive and time consuming. So we have to work with our running syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-Level Differential Power Analysis Attack on Implementations of Advanced Encryption Standard Software Running Inside a PIC18F2420 Microcontroller

    Publication Year: 2015, Page(s):42 - 46
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    Small embedded devices such as microcontrollers have been widely used for identification, authentication, securing and storing confidential information. In all these applications, the security and privacy of the microcontrollers are of crucial importance. To provide strong security to protect data, these devices depend on cryptographic algorithms to ensure confidentiality and integrity of data. Mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of Subtopics of the Thematic Document Collection Using the Context-Semantic Graph

    Publication Year: 2015, Page(s):47 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2497 KB) | HTML iconHTML

    An approach for visualization of nested topics within large collections of documents is proposed. The approach is based on set of parameters: information entropy, Kullback-Leibler divergence, Ginzburg algorithm, similarity the distributions of keywords and key phrases in the documents with Bernoulli's theoretical distributions. The results of comparisons of our approach with implementations based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expansion of Electrical Networks Considering Power Quality Aspects by Applying a Multi-objective Tabu Search Technique

    Publication Year: 2015, Page(s):53 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    This paper proposes an optimization algorithm to expand electrical networks based on the application of a multi-objective Tabu Search technique. The proposed methodology finds Pareto efficient solutions to the formulated problem by searching the topology that minimizes the voltage sag/year number in the electrical system and at the same time that minimizes real power losses. The algorithm performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Cost Reduction of Reversible Circuits Using New Toffoli Decomposition Techniques

    Publication Year: 2015, Page(s):59 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    Quantum cost is the most important criteria to evaluate reversible and quantum circuits. Also the fundamental building blocks of reversible and quantum circuits are Multiple-Control Toffoli (MCT) gates. The synthesis of MCT based reversible circuits are usually conducted into two steps. First, MCT circuits are decomposed into quantum circuits and then they are optimized using various techniques su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Efficient Service Composition in Multi-cloud Environment

    Publication Year: 2015, Page(s):65 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    In this paper, we propose a theoretical model for the service composition in MCE. A user sends service requests to the MCE. Each service request can be satisfied from multiple clouds (i.e., service composition). Given this model, we then design a multi-layer algorithm to minimize the service composition overhead. The overhead is measured through two fundamental metrics: (1) the average number of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AidData.org: A Donation Analysis

    Publication Year: 2015, Page(s):71 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB) | HTML iconHTML

    Every year, in order to improve the lives of people the government and people are spending a lot of money in developing countries. For better country future, the government can take better decisions if they have relevant and accessible data like citizens who are willing to donate and invest few dollars to increase the developments. Aiddata.org is a kind of website which provides data to visualize,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reachability Query Method Based on Labeling Index on Large-Scale Graphs

    Publication Year: 2015, Page(s):77 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    As a general data structure, graphs have been applied widely in many fields, for instance, geographical navigation, web semantic analysis, XML databases, etc. With the successful application of graphs in various fields, the rampant growth of graph data, and the structures of graph data becoming more complex, the analysis, storage and management for graph data are facing the unprecedented challenge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BL-LDA: Bringing Bigram to Supervised Topic Model

    Publication Year: 2015, Page(s):83 - 88
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB) | HTML iconHTML

    With the increasing amount of data being published on the Web, it is difficult to analyze their content within a short time. Topic modeling techniques can summarize textual data that contains several topics. Both the label (such as category or tag) and word co-occurrence play a significant role in understanding textual data. However, many conventional topic modeling techniques are limited to the b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Solution for the Generalized Median Problem

    Publication Year: 2015, Page(s):89 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB) | HTML iconHTML

    A generalized median finding problem is studied in this paper. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size T(log n). Our data structure is a practical linear space data structure that supports range selection queries in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation Aspects of the Matrix Inverse Computation and Inverse Computations Completness Method

    Publication Year: 2015, Page(s):95 - 101
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    It becomes interesting to analyze and apply the features of reconfigurable computations because the concept allows algorithm creation. An important algorithm that resulted from this concept is the known matrix inverse computation. This algorithm is becoming common for matrix based computations because it is free from singularities in comparison with other "Gauss" methods. However, this extreme eas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.