nach oben

2013 | Buch

Kapitel lesen Erstes Kapitel lesen

Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing

herausgegeben von: Roger Lee

Verlag: Springer International Publishing

Buchreihe : Studies in Computational Intelligence

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten

Über dieses Buch

This edited book presents scientific results of the 14th ACIS/IEEE International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 2013), held in Honolulu, Hawaii, USA on July 1-3, 2013. The aim of this conference was to bring together scientists, engineers, computer users, and students to share their experiences and exchange new ideas, research results about all aspects (theory, applications and tools) of computer and information science, and to discuss the practical challenges encountered along the way and the solutions adopted to solve them. The conference organizers selected the 17 outstanding papers from those papers accepted for presentation at the conference.

Inhaltsverzeichnis

Frontmatter

Restroom Human Detection Using One-Dimensional Brightness Distribution Sensor

Abstract

As aging society problem goes serious; systems to confirm safety of elders in daily life are expected. In this paper, a sensor, which detects person localization without privacy offending, applying brightness distribution is realized. In the proposed design, the sensor is constructed with a line sensor and cylindrical lens to obtain one-dimensional brightness distribution. Comparing with conventional line sensors, CMOS area sensors are with low cost, and high sensitivity. Therefore, in the proposed sensor, the CMOS area sensor is applied as covered in certain areas physically, so that it behaves as a line sensor. The proposed sensor is able to obtain one-dimensional horizontal brightness distribution that is approximately equal to integration value of each vertical pixel line of two-dimensional image. By employing this method, the information of the target person’s position and movement status can be obtained without using two-dimensional detail texture image.

Shorta Nakashima, Shenglin Mu, Okabe Shintaro, Kanya Tanaka, Yuji Wakasa, Yuhki Kitazono, Seiichi Serikawa

An Approximate Reasoning Model for Medical Diagnosis

Abstract

Medical diagnosis is a classical example of approximate reasoning, and also one of the earliest applications of expert systems. The existing approaches to approximate reasoning in medical diagnosis are mainly based on Probability Theory and/or Multivalued Logic. Unfortunately, most of these approaches have not been able to model medical diagnostic reasoning sufficiently, or in a clinically intuitive way. The model described in this paper attempts to overcome the main limitations of the existing approaches.

Irosh Fernando, Frans Henskens, Martin Cohen

Study on Adiabatic Quantum Computation in Deutsch-Jozsa Problem

Abstract

Adiabatic quantum computation has been proposed as a quantum algorithm with adiabatic evolution to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Deutsch-Jozsa problem more efficiently by a method with higher observation probability.

Shigeru Nakayama, Peng Gang

A Computational Model of Imitation and Autonomous Behavior in Continuous Spaces

Abstract

Learning is essential for an autonomous agent to adapt to an environment. One method that can be used is learning through trial and error. However, it is impractical because of the long learning time required when the agent learns in a complex environment. Therefore, some guidelines are necessary to expedite the learning process in the environment. Imitation can be used by agents as a guideline for learning. Sakato, Ozeki and Oka (2012) proposed a computational model of imitation and autonomous behavior. In the model, an agent can reduce its learning time through imitation. In this paper, we extend the model to continuous spaces, and add a function for selecting a target action for imitation from observed actions to the model. By these extension and adaptation, the model comes to adapt to more complex environment. Even in continuous spaces, the experimental results indicate that the model can adapt to an environment faster than a baseline model that learns only through trial and error.

Tatsuya Sakato, Motoyuki Ozeki, Natsuki Oka

DiaCTC(N): An Improved Contention-Tolerant Crossbar Switch

Abstract

We recently proposed an innovative agile crossbar switch architecture called Contention-Tolerant Crossbar Switch, denoted as CTC(N), where N is the number of input/output ports. CTC(N) can tolerate output contentions instead of resolving them by complex hardware, which makes CTC(N) simpler and more scalable than conventional crossbar switches. In this paper, we analyze the main factors that influence the performance of CTC(N) and present an improved contention tolerant switch architecture - Diagonalized Contention-Tolerant Crossbar Switch, denoted as DiaCTC(N). DiaCTC(N) maintains all good features of CTC(N), including fully distributed cell scheduling and low complexity. Simulation results show that, without additional cost, the performance of DiaCTC(N) is significantly better than CTC(N).

Jianfei Zhang, Zhiyi Fang, Guannan Qu, Xiaohui Zhao, S. Q. Zheng

Exegetical Science for the Interpretation of the Bible: Algorithms and Software for Quantitative Analysis of Christian Documents

Abstract

Systematic thought (such as Christian theology) has primarily been investigated using literature-based approaches, with texts that are usually more abstract and subjective in nature than scientific papers. However, as systematic ideas and thought influence all areas of human activity and thinking, the application of scientific methodologies such as bibliometrics, natural language processing, and other information technologies may provide a more objective understanding of systematic thought. This paper introduces four methods of quantitative analysis for the interpretation of the Bible in a scientific manner. The methods are citation analysis for interpreters’ texts, vocabulary analysis for translations, variant text analysis for canonical texts, and an evaluation method for rhetorical structure. Furthermore, these algorithms are implemented for Java-based software.

Hajime Murai

Semantic Annotation of Web Services: A Comparative Study

Abstract

A Web service is software that provides its functionality through the Web using a common set of technologies, including SOAP, WSDL and UDDI. This allows access to software components residing on different platforms and written in different programming languages. However, several spots, including the service discovery and composition, remain difficult to be automated. Thus, a new technology has emerged to help automate these tasks ; it is the Semantic Web Services (SWS). One solution to the engineering of SWS is the annotation. In this paper, an approach for annotating Web services is presented. The approach consists of two processes, namely the categorization and matching. Both processes use ontology matching techniques. In particular, the two processes use similarity measures between entities, strategies for computing similarities between sets and a threshold corresponding to the accuracy. Thus, an internal comparative study has been done to answer the questions: which strategy is appropriate to this approach? Which measure gives best results? And which threshold is optimum for the selected measure and strategy? An external comparative study is also useful to prove the efficacy of this approach compared to existing annotation approaches.

Djelloul Bouchiha, Mimoun Malki, Djihad Djaa, Abdullah Alghamdi, Khalid Alnafjan

VC-Bench: A Video Coding Benchmark Suite for Evaluation of Processor Capability

Abstract

Video coding standards such as H.264 are widely used since the flourish of digital compressed video ranging from low bit-rate Internet streaming applications to HDTV broadcast. As a result, more powerful processors are required to meet the growth in coding quality and velocity. Though many efforts have been made on associated items, it lacks one up-to-date benchmark suite for studying architectural properties of video coding applications. This paper introduces VC-Bench, a Video Coding Benchmark suite which is built up from a wide range of video coding applications. Firstly, typical codecs are selected (X264, XVID, VP8) according to the popularity, coding efficiency, compression quality, and source accessibility. Secondly, hotspots are extracted from coding process as kernels. VC-Bench mainly focuses on Transformation, Quantization and Loop filter. All of the extracted kernels are single-threaded version without any architecture-specific optimizations, such as SIMD. Besides, inputs in three different sizes are provided to control running time. Finally, to better understand intrinsic characteristics of video coding application, we analyze both computational and memory characteristics, and further provide insights into architectural design which can improve the performance of this kind of applications.

Xulong Tang, Hong An, Gongjin Sun, Dongrui Fan

Associative Models for Encrypting Monochromatic Images

Abstract

This work describes a novel method for encrypting monochromatic images using an associative approach. The image is divided in blocks which are used to build max and min Alpha-Beta associative memories. The key is private and it depends on the number of blocks. The main advantage of this method is that the encrypted image does not have the same size than the original image; therefore, since the beginning the adversary cannot know what the image means.

Elena Acevedo, Antonio Acevedo, Fabiola Martínez, Ángel Martínez

A Hypothetical Scenario-Based Analysis on Software Reliability Evaluation Approaches in the Web Environment

Abstract

With the spread of the Internet and the development of Web technology, web-based software such as web applications and web services has been in the spotlight and widely used. Accordingly, ensuring web-based software reliability is becoming important, and the efforts to develop highly reliable software in the web environment are required. Compared with traditional software, research on the reliability of web-based software is not enough, and the dynamic execution environment of the web makes the reliability evaluation of web-based software much more complicated. In this paper, we deal with reliability evaluation issues in the web environment and compare with each other in terms of failure data collection methods, reliability evaluation techniques, and validation schemes. We also evaluate them based on hypothetical execution scenarios, analyze the strengths or weaknesses of each technique, and identify the remaining open problems.

Jinhee Park, Hyeon-Jeong Kim, Jongmoon Baik

On Distributed Energy Routing Protocols in the Smart Grid

Abstract

The smart grid shall integrate the distributed energy resources and intelligently transmit energy to meet the requests from users. How to fully utilize the distributed energy resources and minimize the energy transmission overhead becomes critical in the smart grid. In this paper, we tend to address this issue and develop the distributed energy routing protocols for the smart grid. In particular, we first develop the Global Optimal Energy Routing Protocol (GOER), which efficiently distributes energy with minimum transmission overhead. Considering that the computation overhead of GOER limits its use in large-scale grids, we then develop the Local Optimal Energy Routing Protocol (LOER) for large-scale grids. The basic idea of LOER is to divide the grid into multiple regions and adopt a multiple layer optimal strategy to reduce the energy distribution overhead while preserving the low computation overhead. Through extensive theoretical analysis and simulation experiments, our data shows that our developed protocols can provide higher energy distribution efficiency in comparison with the other protocols.

Jie Lin, Wei Yu, David Griffith, Xinyu Yang, Guobin Xu, Chao Lu

Performance Improvements Using Application Hints on a Multicore Embedded System

Abstract

Multicore processors are increasingly adopted to embedded systems like smartphones and tablets as user applications on such devices become more complex and require high performance. However, it is in doubt that the user applications for embedded systems with multi-processing capability exploit the power of the multicore CPU fully. Unlike servers or desktop PCs, power-performance balance is most important in embedded systems. Thus if an application is not carefully designed to efficiently use the multicore CPU, or the system is not aware of it, the use of multicore might result in unexpected failure, such as little performance improvement with high power consumption. In this paper, we present a framework for efficient use of multicore CPU in embedded systems. The proposed framework monitors the usage of the computing resources such as CPU cores, memory, network, and the number of threads. Then it manages the number of CPU cores to be assigned to the application using the resource usage hints. We have tested the framework using SunSpider benchmark with FireFox and Midori Web browsers on an embedded system with Exynos4412 quad-core. Experimental results show that by managing the core assignment and frequency scaling, we can improve the energy efficiency along with the performance.

Yoondeok Ju, Moonju Park

Seasonal Rainfall Prediction Using the Matrix Decomposition Method

Abstract

The matrix decomposition is one of the most powerful methods in recommendation systems. In the recommendation system, even if evaluation values in a matrix where users and items are corresponding to row and column are provided incompletely, we can predict the vacant elements of the matrix using the observed values. This method is applied to a variety of the fields, e.g., for movie recommendations, music recommendations, book recommendations, etc. In this paper, we apply the matrix decomposition method to predict the amount of seasonal rainfalls. Applying the method to the case of Indian rainfall data from 1871 to 2011, we have found that the early detection and prediction for the extreme-value of the monthly rainfall can be attained. Using the newly introduced accuracy evaluation criterion, risky, we can see that the matrix decomposition method using cylinder-type matrix provides the comparative accuracy to the artificial neural network result which has been conventionally used.

Hideo Hirose, Junaida Binti Sulaiman, Masakazu Tokunaga

Effectiveness of the Analysis Method for the Impression Evaluation Method Considering the Vagueness of Kansei

Abstract

In recent years, Kansei becomes important. However, the conventional methods are difficult to evaluate Kansei because Kansei is vague. An impression evaluation method considering the vagueness of Kansei has been proposed. This evaluation method makes a subject evaluate impression spatially. A method for analyzing the evaluation results has been proposed and the results of analysis have been shown. This analysis method shows average values and coefficients of variation of scores of the evaluation results spatially. However, only a few subjects joined the evaluation experiment. In this paper, an evaluation experiment is newly conducted, and more evaluation results are obtained. These results are analyzed, and characteristics of the impression of objects and the dispersion among subjects could easily be obtained. It is shown that this analysis method is useful for examining characteristics of impression of objects.

Shunsuke Akai, Teruhisa Hochin, Hiroki Nomiya

Representation, Analysis and Processing of Student Counseling Cases

Abstract

Student counseling becomes an important roles in University.Many colleges have been paying effort for the task. The field of student counseling has not introduced computational technique. The paper challenges a new approached to contribute the field by giving a representation of counseling records. By giving a representation effective analysis and processing of cases are possible. First, we give a formal representation of counseling cases based on our observation that persons and their network and changes of the network are important structure of cases. Second, we try to capture characteristics of cases by giving attributes and transitions of relations that compose networks. Third, a similarity measure is defined for cases based on the formal representation and attributes. These proposal are examined by counseling cases, which are prepared by rearranging real cases.

Naotaka Oda, Aya Nishimura, Takuya Seko, Atsuko Mutoh, Nobuhiro Inuzuka

Web Based UNL Graph Editor

Abstract

The Universal Networking Language (UNL) is an artificial language which enables computers to process knowledge and information across language barriers and cultural differences. Universal Words (UWs) constitute the vocabulary of UNL. However, from the UNL expression it is difficult for human to visualize the UNL graph to edit it interactively. To solve this problem, we have developed the web based UNL graph editor which visualizes UNL expression and the users can edit the graphs interactively.

Khan Md Anwarus Salam, Hiroshi Uchida, Setsuo Yamada, Nishio Tetsuro

Tracking Multiple Objects and Action Likelihoods

Abstract

In this paper we propose a method which can improve MRF-Particle filters used to solve the hijacking problem; independent particle filters for tracking each object can be kidnapped by a neighboring target which has higher likelihood than that of real target. In the method the motion model built by Markov random field (MRF) has been usefully applied for avoiding hijacking by lowering the weight of particles which are very close to any neighboring target. The MRF unary and pairwise potential functions of neighboring targets are defined as the penalty function to lower the particle’s weights. And potential function can be reused for defining action likelihood which can measure the motion of object group.

Chi-Min Oh, Chil-Woo Lee

Backmatter

Titel: Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
herausgegeben von: Roger Lee
Verlag: Springer International Publishing
Electronic ISBN: 978-3-319-00738-0
Print ISBN: 978-3-319-00737-3
DOI: https://doi.org/10.1007/978-3-319-00738-0