3144 Slices
  Title Author Publisher Format Buy Remix
Medium 9781601322494

Research on Cloud Service Community Constructing Approach for Personalized Tourism Service

Hamid R. Arabnia, Victor A. Clincy, Leonidas Deligiannidis, Ashu M. G. Solo, and Fernando G. Tinetti CSREA Press PDF

236

Int'l Conf. Internet Computing and Big Data | ICOMP'13 |

,&203��326,7,21�3$3(5�

Research on Cloud Service Community

Constructing Approach for Personalized

Tourism Service

Abstract—The current tourism service is transferring from the passive mode to active one. More and more people expect to schedule the tourism plan by themselves according to the personalized requirements. This paper proposes a service organization approach of cloud community based on destination.

The approach firstly classifies the tourism web services by destination and type etc. and clusters them by service function.

Then by the aid of user preference model all the required services are gotten and clustered to be service pools with the same function. And the dynamic binding is also accomplished through service pool. To satisfy the requirement of service composition, the paper designs an individual service selecting algorithm based on the community. The experiments demonstrate that the approach of cloud service community can greatly improve service discovery efficiency and precision. And with the completion of the user preference library, the precision of service recommending also has a great improvement.

See All Chapters
Medium 9781601324085

Poster Papers

Kevin Daimi, Hamid R. Arabnia, George Markowsky, Ashu M. G. Solo (Editors) CSREA Press PDF

Int'l Conf. Security and Management | SAM'15 |

343

A Synthetic Provable Security Evaluation of Cryptographic

Application with Entropy Sources

Nayoung Kim, Ju-Sung Kang∗ , and Yongjin Yeom

Dept. of Math. / Financial Information Security, Kookmin University, Seoul, Korea

∗ Corresponding author

Abstract— On the conventional provable security models it is usually assumed that the secret keys are randomly chosen from the uniformly distributed key space. However in practice we can only use real distributions of key space that are far from uniform. There are several theoretical security bounds to cryptographic applications under the ideal setting in which it is assumed that the key space is uniformly distributed. In this work we examine some provable security bounds for several combined system of a cryptographic application and an entropy source used as the key space under the real setting.

Keywords: Provable security, Cryptographic application, Entropy source.

1. Introduction

The security of all cryptographic applications is based on the confidentiality of secret keys. In order to analyze the security of cryptographic applications such as message authentication codes (MACs) or authenticated encryptions

See All Chapters
Medium 9781601322548

Spatially Important Point Identification: A New Technique for Detail-Preserving Reduced-Complexity Representation of 3D Point Clouds

Hamid R. Arabnia, Leonidas Deligiannidis, Joan Lu, Fernando G. Tinetti, Jane You, George Jandieri, Gerald Schaefer, Ashu M. G. Solo, Vladimir Volkov CSREA Press PDF

Int'l Conf. IP, Comp. Vision, and Pattern Recognition | IPCV'13 |

Spatially Important Point Identification: A New

Technique for Detail-Preserving Reduced-Complexity

Representation of 3D Point Clouds

Rohit Sant1, Ninad Kulkarni1, Kratarth Goel2, Salil Kapur2 and Ainesh Bakshi3

1

Department of EEE&I, BITS-Pilani K.K. Birla Goa Campus, Goa, India

2

Department of CS/IS, BITS-Pilani K.K. Birla Goa Campus, Goa, India

3

Department of Chemical Engineering, BITS-Pilani K.K. Birla Goa Campus, Goa, India

Abstract - This paper describes a technique for reducing the inherent complexity of range data without discarding any essential information. Our technique implements this by searching for ‘important’ points in the range data and discarding intervening points, all of which may be regenerated to a good approximation by linear interpolation. The implementation uses a metric based on the 3D geometry of the scene to assign to each point an ‘importance’ value. We define

Spatially Important Points, which are got by comparing this importance value with a customizable template and with importance values of its neighbours. The algorithm has been tested on various datasets and has been found to give, on an average, a 78% reduction in complexity while retaining almost all points of significance, as shown by reconstructing the dataset. Results have been tabulated at the end of the paper.

See All Chapters
Medium 9781601322470

Social Network Analysis – Network and Link Detection in Overwhelming and Noisy Data Streams

Hamid R. Arabnia, David de la Fuente Elena B. Kozerenko, Peter M. LaMonica Raymond A. Liuzzi, Todd Waskiewicz, George Jandieri, Ashu M. G. Solo, Ivan Nunes da Silva, Fernando G. Tinetti, and Fadi Thabtah CSREA Press PDF

758

Int'l Conf. Artificial Intelligence | ICAI'13 |

Social Network Analysis – Network and Link Detection in

Overwhelming and Noisy Data Streams

Craig Anken, Pete LaMonica

Air Force Research Laboratory/RIEB

{Craig.Anken, Peter.LaMonica}@rl.af.mil

James Schneider, Tod Hagan, Lee Krause, Bruce McQueary

1Securboration,

Inc., 1050 W. NASA Blvd, Melbourne, FL 32901

{jschneider,thagan,lkrause,bmcqueary}@securboration.com

Abstract – The explosion of social media and availability of open source data has created an unprecedented opportunity to expose hidden intelligence. In this work we explore the use of a pipeline of novel algorithms executing within a parallel computing framework to improve SNA performance as compared to baseline approaches.

These initial findings show improvements in link detection speed and accuracy (F-measure) on community datasets with ground truth information.

Keywords: Social Network Analysis, Machine

Learning, Non-obvious Link Extraction, Parallel

Machine Learning Frameworks, Noise Reduction and Removal of Irrelevant Intelligence

See All Chapters
Medium 9781601323224

Applying TCP Profiling to Detect Wireless Rogue Access Point

Hamid R. Arabnia, Leonidas Deligiannidis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

88

Int'l Conf. Wireless Networks | ICWN'14 |

Applying TCP Profiling to Detect Wireless Rogue Access Point

James Yu

College of Computing and Digital Media, DePaul University

Chicago, Illinois USA 60604

Abstract - There are many studies addressing the risk and vulnerability of 802.11-based Wireless LAN (WLAN).

However, Rogue Access Points (AP) attacks, although well known and widely studied, do not have a costeffective solution yet. This paper presents our studies of three attacking scenarios, and several common industry approaches trying to address this problem. Our analysis shows the weaknesses of RF-based solutions, and we propose to use Round Trip Time (RTT) and jitter to profile TCP traffic. Because of different profiling between wired and wireless traffic, we could use this difference to identify wireless traffic on wired network, from which we could detect rogue AP attacks. Our proposed solution is validated on a network simulation environment (ns2).

Key-Words —Wireless LAN, Rogue AP, Jitter, Delay,

See All Chapters
Medium 9781601323613

SESSION Cluster and Distributed Computing + Supercomputing

Hamid Arabnia, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

Int'l Conf. Grid, Cloud, & Cluster Computing | GCC'16 |

33

SESSION

CLUSTER AND DISTRIBUTED COMPUTING +

SUPERCOMPUTING

Chair(s)

TBA

ISBN: 1-60132-436-7, CSREA Press ©

34

Int'l Conf. Grid, Cloud, & Cluster Computing | GCC'16 |

ISBN: 1-60132-436-7, CSREA Press ©

Int'l Conf. Grid, Cloud, & Cluster Computing | GCC'16 |

35

Distributed� Collaborative� Caching�

Wardwell, Steven

Contact Author

Department of Computer Science,

Rochester Institute of Technology,

70-3005 102 Lomb Memorial Drive,

Rochester New York, 14623 United States sjw1579@rit.edu

Bischof, Hans-Peter

Department of Computer Science,

Center for Computational Relativity and Gravitation,

Rochester Institute of Technology,

Rochester New York, 14623 United States hpb@cs.rit.edu

Abstract— In this paper we explore distributed collaborative caching. Caching in distributive networks can improve data access performance and reduce dense communication between the client and the server. Collaborative caching can improve caching by allowing clients to share and organize

See All Chapters
Medium 9781601322586

Open Source Cloud Computing: Characteristics and an Overview

Hamid R. Arabnia, Hiroshi Ishii, Minoru Ito, Hiroaki Nishikawa, Fernando G. Tinetti, George A. Gravvanis, George Jandieri, and Ashu M. G. Solo CSREA Press PDF

Int'l Conf. Par. and Dist. Proc. Tech. and Appl. | PDPTA'13 |

243

Open Source Cloud Computing: Characteristics and an Overview

Naylor G. Bachiega1, Henrique P. Martins1, Roberta Spolon1, Marcos A. Cavenaghi1, Renata S.

Lobato2, Aleardo Manacero2

1

Computer Science Dept., Paulista State University – UNESP, Bauru, Brazil

2

Computer Science and Statistics Dept., Paulista State University – UNESP, São José do Rio Preto,

Brazil

Abstract - In an attempt to reduce costs by taking advantage of efficient computing resources, new developed technologies and architectures are gaining wide acceptance in the market. One of such technologies is cloud computing, which uses existing technologies, such as virtualization, trying to solve problems like energy consumption and space allocation in data centers or large companies. This paper presents a study on cloud computing, describing their main characteristics, models of deployment, services, and architectures, including an analysis over its benefits, risks and challenges. It also presents a study over some open-source cloud managers, presenting its advantages and drawbacks. All of this is presented aiming to provide a clear guide for those that are evaluating the possible adoption of cloud technology for their IT problems.

See All Chapters
Medium 9781601323248

Archiving and visualization of the patient’s anatomical model using B-spline curve and surface representation

Hamid R. Arabnia, Leonidas Deligiannidis Joan Lu, Fernando G. Tinetti, Jane You, George Jandieri, Gerald Schaefer, and Ashu M.G. Solo CSREA Press PDF

500

Int'l Conf. IP, Comp. Vision, and Pattern Recognition | IPCV'14 |

Archiving and visualization of the patient’s anatomical model using

B-spline curve and surface representation

A. Dominik Spinczyk

Faculty of Biomedical Engineering, Silesian University of Technology, Zabrze, Silesia, Poland

Abstract— From the patient’s perspective a minimally invasive surgery decreases trauma, the associated pain, and greatly reduces the post-operative recovery time, trauma and faster return to life. It has some disadvantages, like limited field of view and occluded anatomy, which could be overcome by registration of the preoperative patient’s anatomical model to the patient’s position in the operating room. The aim is archiving and presenting the patient’s anatomical model in a manner which is easy to modification and integration into surgical workflow finally causes simplification in perception of operating field. B-spline curve and surface representation for anatomical models were selected.

For creating the model from segmentation results, the global surface interpolation algorithm is applied. Scene graph oriented solution was proposed for 3D image data and anatomical model presentation. The whole scene graph is divided into independent branches, which accelerates rendering and simplifies data loading and building the scene graph process.

See All Chapters
Medium 9781601323101

Session - Late Breaking Papers and Position Papers: Big Data Analytics and Related Issues

Hamid R. Arabnia, Mary Q. Yang, George Jandieri, James J. (Jong Hyuk) Park, Ashu M. G. Solo, and Fernando G. Tinetti CSREA Press PDF
Medium 9781601324108

Signal Processing, Imaging Science, and Data Quality Enhancement + Health Information Systems

Hamid R. Arabnia, Quoc-Nam Tran, Mary Q. Yang, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti (Editors) CSREA Press PDF

Int'l Conf. Bioinformatics and Computational Biology | BIOCOMP'15 |

The Stacked Frame Display for Optimizing the

Display and Interpretation of Analog Data

Robert A. Warner, M.D.

Tigard Research Institute

Tigard, OR USA

1. Abstract

This paper describes the stacked frame display

(SFD), a method for improving the accuracy and speed of interpreting analog data. The SFD involves the replacement of sequentially recorded traditional analog waveforms with narrow single lines. The amplitude and duration information that had been shown in the traditional analog waveforms is provided in the SFD by encoding this information using colors or the brightness of pixels in the linear display of the data. The method was tested by comparing its ability to interpret ambulatory electrocardiographic

(ECG) data to that of traditional methods of interpreting such data. Compared to the traditional method of interpreting ambulatory ECG data, The SFD resulted in more accurate and efficient interpretations of these data. The SFD improves the accuracy and efficiency of interpreting sequentially recorded analog data.

See All Chapters
Medium 9781601323248

Gesture Recognition in Cooking Video Based on Image Features and Motion Features using Bayesian Network Classifier

Hamid R. Arabnia, Leonidas Deligiannidis Joan Lu, Fernando G. Tinetti, Jane You, George Jandieri, Gerald Schaefer, and Ashu M.G. Solo CSREA Press PDF

282

Int'l Conf. IP, Comp. Vision, and Pattern Recognition | IPCV'14 |

Gesture recognition in cooking video based on image features and motion features using

Bayesian Network classifier

Nguyen Tuan Hung1, Nguyen Thanh Binh2, Pham The Bao1, and Jin Young Kim3

Faculty of Mathematics and Computer Science, University of Science, Ho Chi Minh City, Viet Nam

2

Faculty of Management Information System, College of Finance and Customs, Ho Chi Minh City, Viet Nam

3

Chonnam National University, Gwangju, Korea

1

Abstract - This paper proposes a method combining image features and motion features for gesture recognition in cooking video. By using image features including global and local features of RGB images and then representing those using bag of features, motions in video are represented. We also use relative positions between objects after they are detected in this frame. Motions are also represented through motion features calculated from frame sequences using dense trajectories. After all, we combine both image features and motion features to describe cooking gestures. We use Bayesian

See All Chapters
Medium 9781601323200

Topic-Model based Query Intent Prediction for Search by Multiple Examples

CSREA 2003 CSREA Press PDF

Int'l Conf. Artificial Intelligence | ICAI'14 |

365

Topic-Model based Query Intent Prediction for

Search by Multiple Examples

Mingzhu Zhu, Chao Xu, and Yi-Fang Brook Wu

Department of Information Systems, New Jersey Institute of Technology, Newark, New Jersey, USA

Abstract – It is often difficult for users to express their information needs as keywords. Search-By-MultipleExamples (SBME) is a new search paradigm that provides an easier way for users to express their information needs as multiple relevant examples (called query examples) rather than as a simple string of keywords. One key issue of SBME is to identify user’s true information needs from the query examples, which may contain multiple topics. However, none of the previous studies on SBME considers the issue of topic diversity of the query examples. In this research, we explore the solutions to the topic diversity issue in SBME through adopting topic modeling techniques to predict the likelihood that the query examples belonging to a topic. The learned topic distributions from the query examples are used to build query vectors for document ranking. Using Mean Average

See All Chapters
Medium 9781601323248

Digital Image Processing in Surface Engineering Quality Control

Hamid R. Arabnia, Leonidas Deligiannidis Joan Lu, Fernando G. Tinetti, Jane You, George Jandieri, Gerald Schaefer, and Ashu M.G. Solo CSREA Press PDF

454

Int'l Conf. IP, Comp. Vision, and Pattern Recognition | IPCV'14 |

Digital Image Processing in Surface Engineering

Quality Control

E. Sheybani, S. Garcia, G. Javidi

Virginia State University, Petersburg, VA 23834

Abstract - Ability to measure the surface quality in realtime has many applications in manufacturing automation and product optimization, especially in processes in which the surface qualities such as roughness, grain size, thickness of coding, impurities size and distribution, hardness, and other mechanical properties are of importance. Surface analysis in manufacturing environments requires specialized filtering techniques. Due to the immense effect of rough environment and corruptive parameters, it is often impossible to evaluate the quality of a surface that has undergone various grades of processing. This research aims at providing image processing tools for comparison and assessment of a surface processed under different grades of a manufacturing process all the way up to optimal processing. The algorithm used is capable of performing this comparison analytically and quantitatively at a low computational cost (real-time) and high efficiency. The parameters used for comparison are the degree of blurriness and the amount of various types of noise associated with the surface image. Based on a heuristic analysis of these parameters the algorithm assesses the surface image and quantifies the quality of the image by characterizing important aspects of human visual quality.

See All Chapters
Medium 9789383828364

Chapter 1-1

Yogyata Jain Laxmi Publications PDF

1

Real Time Systems

1.1 INTRODUCTION

Real time systems respond to the input immediately. They follow timing constraints. They have to give their outputs in time. Producing the output, after precise time degrade system performance, leads to catastrophic failure and sometimes output is useless for both systems and users. They have to the response in the order of milliseconds or in a microsecond. Deadlines are necessary and must be fulfilled for the proper functioning (output) of the system. A failing system is not able to achieve its tasks with definite deadlines. Deadlines of all the tasks must meet, regardless of system load. Example is a printer, phone and fax machines, driving a vehicle such as cars and others. Non real time system does not follow these conditions; they do not have any timing constraints.

Characteristics of Real Time System:

There are certain features of real time system as shown in Fig. 1.1:

1. Real time systems respond to the input immediately.

2. They follow timing constraints.

See All Chapters
Medium 9781601322340

Constructing a Cloud-based ADHD Screening System: a Perspective of Norm Development

Hamid R. Arabnia and Quoc-Nam Tran CSREA Press PDF

Int'l Conf. Bioinformatics and Computational Biology | BIOCOMP'13 |

Constructing a Cloud-based ADHD Screening System: a Perspective of Norm Development

Kuo-Chung Chu*, Lun-Ping Hung, and Chien-Fu Tseng

Department of Information Management

National Taipei University of Nursing and Health Sciences

*e-mail: kcchu@ntunhs.edu.tw

Abstract - Attention deficit hyperactivity disorder (ADHD) is a popular child psychiatry disorder; the main symptoms are inattention, unable to suppress their impulsive behavior and restlessness of the situation. Previous studies had revealed that the prevalence of ADHD in school-age is about 5-12%. Without early diagnosis and treatment, it may cause cognitive dysfunction, low academic achievement, frustration, loss of self-esteem and self-confidence, sleep disorder, deviant behavior, and so on. Theoretically, screening criteria should be different because of world areas vary. However, in Taiwan, the existing screening systems are imported and referred to

European and American norm. As the reference to nonAsian norm, screening results are not fully consistent with the situation in Taiwan. Therefore, this paper proposes a cloud-based ADHD screening system, which not only can screen ADHD symptoms, but also builds a domestic

See All Chapters

Load more