3225 Slices
  Title Author Publisher Format Buy Remix
Medium 9781601323576

SESSION E-Business, E-Commerce, Enterprise Information Systems and Related Management Issues

Hamid Arabnia, Azita Bahrami, George Jandieri, Fernando G. Tinetti CSREA Press PDF

Int'l Conf. e-Learning, e-Bus., EIS, and e-Gov. | EEE'16 |

SESSION

E-BUSINESS, E-COMMERCE, ENTERPRISE

INFORMATION SYSTEMS, AND RELATED

MANAGEMENT ISSUES

Chair(s)

TBA

ISBN: 1-60132-432-4, CSREA Press ©

77

78

Int'l Conf. e-Learning, e-Bus., EIS, and e-Gov. | EEE'16 |

ISBN: 1-60132-432-4, CSREA Press ©

Int'l Conf. e-Learning, e-Bus., EIS, and e-Gov. | EEE'16 |

79

Using BPMN-based Business Processes in Requirements

Engineering: the Case Study of Sustainable Design

F. Santana1*, D. Nagata2, M. Cursino2, C. Barberato3 and S. Leal2

1

Faculty of ESTeM, University of Canberra, ACT, Australia

2

CMCC, Federal University of ABC, São Paulo, Brazil

3

CECS, Australian National University, ACT, Australia

*

Corresponding Author: Fabiana.Santana@canberra.edu.au

Abstract - Global economic challenges force companies to constantly seek alternatives to become more efficient in order to grow, or even survive. Process improvement has the potential to transform a company and lead to innovation while information technology is an enabler of business change. Both must evolve together to maximize the outcomes. This paper introduces the case study of a business process to support the sustainable design (SD) of products and services. The purpose is to illustrate how processes can be used to support eliciting and managing system requirements for highly complex domains, where both processes and requirements are difficult to define. The process was designed in Business Process

See All Chapters
Medium 9781601322364

Allocation of NBTI Aging Sensors for Circuit Failure Prediction

Hamid R. Arabnia; Leonidas Deligiannidis; Ashu M. G. Solo; and Fernando G. Tinetti (Editors) Mercury Learning and Information PDF

Int'l Conf. Computer Design | CDES'13 |

3

Allocation of NBTI Aging Sensors for Circuit Failure Prediction

Samir Mahaboob Khan Kagadkar and Hussain Al-Asaad

Department of Electrical and Computer Engineering,

University of California, Davis

Abstract— Negative bias temperature instability (NBTI) is a critical device reliability concern in nanometer-scale

CMOS processes. We review the degradation effects of this phenomenon and present techniques to measure and combat NBTI aging. Such techniques involve the insertion of specialized aging sensors and their use in self-correcting dynamic reliability management systems. We propose a novel approach to optimize the allocation of such aging sensors to minimize overhead.

Keywords: Integrated Circuit (IC) reliability, Circuit failure prediction, Negative Bias Temperature Instability (NBTI)

1. Introduction

Engineers working on the design of modern integrated circuits (ICs) fabricated in nanometer-scale technologies are in the unenviable position of having to face a plethora of issues that were benign in the past. Mounting parametric variability, radiation-induced soft errors and time-dependent device degradation make transistors increasingly unreliable components. A generation of engineers is realizing that hardware failures from these unreliable components are a distinctly realistic possibility.

See All Chapters
Medium 9781601322586

Effective Flooding over Disaster Tolerant Ad Hoc Network based on exchange of Neighbor Information

Hamid R. Arabnia; Hiroshi Ishii; Minoru Ito; Hiroaki Nishikawa; Fernando G. Tinetti; George A. Gravvanis; George Jandieri; and Ashu M. G. Solo (Editors) Mercury Learning and Information PDF

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

587

Effective Flooding over Disaster Tolerant Ad Hoc

Network based on exchange of Neighbor Information

Naoya Imaizumi, , Keisuke Utsu, Hiroshi Sano, and Hiroshi Ishii

Department of Communication and Network Engineering,

School of Information and Telecommunication Engineering, Tokai University, Minato, Tokyo, Japan

Abstract – Mobile Ad Hoc Networks (MANET) is a useful means instead of network infrastructure when disaster happens. In this situation, information distribution without addresses of nodes is able to be realized by the existing Simple

Flooding (SF). But SF causes redundant message transmission, performance degradation and waist of finite battery resources. Making network lifetime without external energy source as long as possible is one of the main goals in case of any disasters or emergency situations. We propose a new broadcasting method that allows reducing power consumption by decreasing a number of redundant rebroadcastings, "Effective Flooding based on Neighbor information Exchange-Revised (EFNEX-R)".

See All Chapters
Medium 9781601322401

Session - Learning Methods, E-Learning + Educational Tools, and Related Issues

Hamid R. Arabnia; Azita Bahrami; Fernando G. Tinetti; Leonidas Deligiannidis; George Jandieri; and Ashu M. G. Solo (Editors) Mercury Learning and Information PDF
Medium 9781601323163

Quantum-Intersection Equivalents of the Orthomodularity Law in Quantum Logic: Part 1

Hamid R. Arabnia, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, and Fernando G. Tinetti CSREA Press PDF

Int'l Conf. Foundations of Computer Science | FCS'14 |

53

Quantum-Intersection Equivalents of the

Orthomodularity Law in Quantum Logic: Part 1

Jack K. Horner

P. O. Box 266

Los Alamos, New Mexico 87544 USA

FCS 2014

Abstract

The optimization of quantum computing circuitry and compilers at some level must be expressed in terms of quantum-mechanical behaviors and operations. In much the same way that the structure of conventional propositional (Boolean) logic (BL) is the logic of the description of the behavior of classical physical systems and is isomorphic to a Boolean algebra (BA), so also the algebra, C(H), of closed linear subspaces of (equivalently, the system of linear operators on (observables in)) a Hilbert space is a logic of the descriptions of the behavior of quantum mechanical systems and is a model of an ortholattice (OL). An

OL can thus be thought of as a kind of “quantum logic” (QL). C(H) is also a model of an orthomodular lattice, which is an OL conjoined with the orthomodularity axiom (OMA). The rationalization of the OMA as a claim proper to physics has proven problematic, motivating the question of whether the OMA and its equivalents are required in an adequate characterization of QL. Here I provide an automated deduction of three quantum-intersection-based equivalents of the OMA. The proofs may be novel.

See All Chapters
Medium 9781601322548

A Scalable Indexing Method for Sift Features

Hamid R. Arabnia; Leonidas Deligiannidis; Joan Lu; Fernando G. Tinetti; Jane You; George Jandieri; Gerald Schaefer; Ashu M. G. Solo; and Vladimir Volkov (Editors) Mercury Learning and Information PDF

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

299

A SCALABLE INDEXING METHOD FOR SIFT FEATURES

Ƈ

1

Wei-Chih Hung, 1, Yi-Leh Wu, 1Tsung-Da Ho, 1Kuan-Yuo Lin, and 2Cheng-Yuan Tang

1

Department of Computer Science and Information Engineering

National Taiwan University of Science and Technology, Taipei, Taiwan

2

Department of Information Management, Huafan University, Taiwan

Ƈ

E-mail: ywu@csie.ntust.edu.tw

ABSTRACT

This paper presents a method for the image recognition in a large database. The local invariant features and two-tier hashing are used so that the time complexity of image matching is not affected by the size of the image database.

We propose a method to simplify the PCA-SIFT descriptor via binarization. The binarized PCA-SIFT keypoint descriptors still keep very high distinctiveness for the image matching process. Furthermore, the binarized PCA-SIFT keypoint descriptors can be indexed by two-tier hashing method very efficiently. Moreover, to reduce the time complexity of matching keypoint descriptors, minimal perfect hashing is applied to build a number of external hash tables. Through computation we can determine which external hash table is hit by the distinct keypoint descriptor without searching. The experiment result suggests that the proposed method can effectively keep the time complexity to O(1) irrespective to the number of images in the matching applications.

See All Chapters
Medium 9781601323262

Parallel Processing of Irregular Workloads on the GPGPU: Adaptive Quadrature

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

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

423

Parallel Processing of Irregular Workloads on the GPGPU: Adaptive

Quadrature

Derek Kern and Gita Alaghband

Department of Computer Science and Engineering, University of Colorado Denver, Denver, CO, USA

{derek.kern, gita.alaghband}@ucdenver.edu

Abstract— This paper presents a parallel (GPGPU) approach for dealing with the turbid workload of adaptive quadrature, called ‘parallel block-cutting adaptive quadrature’ (PBCAQ). PBCAQ provides speedups as high as 211 times the performance of its sequential competitors. In addition, it has two intertwined and desirable properties: (1) its speedups increase as the size of the workloads being processed increase; and (2) it performs best over definite integrals requiring larger workloads. These two properties together make PBCAQ a valuable example of computing an inequitable, turbid workload on the GPGPU, devices that require workload simplicity.

Keywords: Parallel processing, GPU, CUDA, SIMT, adaptive quadrature, numerical integration

See All Chapters
Medium 9781601322456

A Genetic Algorithm for Multiprocessor Task Scheduling

Hamid R. Arabnia; Ray R. Hashemi; George Jandieri; Ashu M. G. Solo; and Fernando G. Tinetti (Editors) Mercury Learning and Information PDF

Int'l Conf. Genetic and Evolutionary Methods | GEM'13 |

105

A Genetic Algorithm for Multiprocessor Task

Scheduling

Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan

Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, Canada

Ken.Ferens@ad.umanitoba.ca

Abstract—The goal of task scheduling in a multiprocessor system is to schedule dependent tasks on processors such that the processing time is minimized. This ensures optimal usage of the processing systems. However this problem is

NP-hard in nature and heuristic based techniques are used to obtain a good schedule in polynomial time. Genetic

Algorithms (GA) have been proposed over other heuristics because it can use its genetic processes to find multiple solutions faster. The GA proposed is based on a non-preemptive precedence relation between tasks in the task graph.

Tasks assignment is prioritized based on the number of tasks dependencies (NTD) and the earliest start time (EST) of each task. For tasks with multiple possible earliest start times, the minimum earliest start time is chosen for such tasks. Java simulations compared the results obtained using the minimum EST and the maximum EST. Our simulation shows that the proposed algorithm with minimum EST achieves faster processing periods compared with the maximum EST.

See All Chapters
Medium 9781601323668

SESSION Modeling and Novel Applications

Hamid Arabnia, Leonidas Deligiannidis, Fernando G. Tinetti CSREA Press PDF

Int'l Conf. Modeling, Sim. and Vis. Methods | MSV'16 |

79

SESSION

MODELING AND NOVEL APPLICATIONS

Chair(s)

TBA

ISBN: 1-60132-443-X, CSREA Press ©

80

Int'l Conf. Modeling, Sim. and Vis. Methods | MSV'16 |

ISBN: 1-60132-443-X, CSREA Press ©

Int'l Conf. Modeling, Sim. and Vis. Methods | MSV'16 |

81

The Effect of Changing Search Patterns in an Agent-Based Model

D. Q. Quach*, D. P. Playne and C. J. Scogings

Institute of Natural and Mathematical Sciences, Massey University

Albany, North Shore 102-904, Auckland, New Zealand

Email: dara.quach@gmail.com, {d.p.playne, c.scogings} @massey.ac.nz

Tel: +64 9 414 0800 Fax: +64 9 441 8181

Regular Research Paper

ABSTRACT

Many agent-based models employ various mechanisms for agents to propagate. We explore different searching patterns influenced by distance and resource abundance. We

find that when higher density of food sources is more influential than distance, the system moves towards higher sustainable population levels for both the predator and prey species. The resource influenced search patterns produce less defined defensive spiral patterned structures than distance driven searching.

See All Chapters
Medium 9781601322395

Mining for Hydrologic Features in LiDAR Data

Robert Stahlbock; Gary M. Weiss; Mahmoud Abou-Nasr; and Hamid R. Arabnia (Editors) Mercury Learning and Information PDF

Int'l Conf. Data Mining | DMIN'13 |

145

Mining for Hydrologic Features in LiDAR Data

Rebecca Reizner, Eric Shaffer, and Brianna Birman, University of Illinois at Urbana-Champaign

Abstract—Light Detection and Ranging (LiDAR) can generate 3D point data of terrains with high resolution and accuracy, enabling automated detection of important hydrologic features.

This paper describes a method for detecting sinkholes in LiDAR data. Current methods of sinkhole detection are lengthy and labor intensive, requiring hours or days of manual work. The method demonstrated in this study can locate sinkholes in the same LiDAR data within minutes with no need for human intervention.

I. I NTRODUCTION

Automated detection of hydrologic features has become increasingly important for geologists. The ability to acquire high-resolution LiDAR data for large swaths of land means that much more data is available for analysis. The increased detail of LiDAR data over USGS topographic maps potentially allow up to 30% more sinkholes to be identified[8].

See All Chapters
Medium 9781601323200

An Intelligent Lighting System using a Smartphone as an Illuminance Sensor

CSREA 2003 CSREA Press PDF

548

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

An Intelligent Lighting System using a Smartphone as an

Illuminance Sensor

Sho Kuwajima1 , Shohei Matsushita1 , Mitsunori Miki2 , Hisanori Ikegami1 , Yohei Azuma1 , and Hiroto Aida2

1 Graduate School of Science and Engineering, Doshisha University, Kyoto, Japan

2 Department of Science and Engineering, Doshisha University, Kyoto, Japan

Abstract— The authors have engaged in research and development of an Intelligent Lighting System which realize individual illuminance required by workers with minimum power consumption. As an Intelligent Lighting System use illuminance sensors for illuminance control, smartphones with a built-in illuminance sensor may be used for this purpose. This can reduce the initial cost for introducing an Intelligent Lighting System as well as realize easier maintenance. For that purpose, in this study, we examined the possibilities of an Intelligent Lighting System using built-in illuminance sensors in smartphones. Performance verification experiments concerning smartphone’s built-in illuminance sensors showed that their resolutions are so low that their measurements differ from the actual illuminance values. Based on this result, we propose methods to realize individual illuminance control using the smartphone as an illuminance sensor. A verification experiment to confirm the effectiveness of the system incorporating the proposed method demonstrated that it can realize the individual illuminance control.

See All Chapters
Medium 9781601323170

A Teaching Methodology with Frame Buffer and Monitor Design in the Study of Hardware Track in Computer Science

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

356

Int'l Conf. Frontiers in Education: CS and CE | FECS'14 |

A Teaching Methodology with Frame Buffer and Monitor

Design in the Study of Hardware Track in Computer

Science

Hassan Farhat

Computer Science

University of Nebraska at Omaha

Abstract- While the study of computer design is covered extensively in the hardware track of computer science, minimal actual design of the remaining units required in image display is covered. Designs of simple CPUs with needed memory can be accomplished towards the end of a first course in digital design. Alternatively it can be covered during the early part of a second course on digital and computer architecture. Due to time constraints, the study of video controllers and frame buffers needed in the interface to a monitor is normally covered in advanced classes in computer engineering and is often skipped in computer science. Instead, computer simulation of designs or use of seven-segment-displays is often used to verify computer design correctness.

In this paper we provide pedagogy for including frame buffer design topics in conjunction with CPU design. The proposed work integrated with previous work on computer design provides a practical sequence of topics to cover from design of a CPU to monitor display. To meet the time constraints imposed by the number of classes in hardware track, unlike discussion of design found using hardware descriptions languages, we provide a methodology of design at the schematic (gate) level. The proposed designs form a complete educational system of a computer with a frame buffer that can be covered in a two 3-credit hour course sequence.

See All Chapters
Medium 9789380856933

CH4-1

S. Anandamurugan Laxmi Publications PDF

114

C P ROGRAMS

WITH

SOLUTIONS

from the base address. So, indirecting it with * is same as s[i]. i[s] may be surprising. But in the case of C it is same as s[i].

3. main()

{ float me = 1.1; double you = 1.1; if(me==you) printf(“I love U”); else printf(“I hate U”);

}

Answer:

I hate U

Explanation:

For floating point numbers (float, double, long double) the values cannot be predicted exactly.

Depending on the number of bytes, the precession with of the value represented varies. Float takes

4 bytes and long double takes 10 bytes. So float stores 0.9 with less precision than long double.

Rule of Thumb:

Never compare or at-least be cautious when using floating point numbers with relational operators (== , >, <, <=, >=,!= ) .

4. main()

{ static int var = 5; printf(“%d ”,var--); if(var) main();

}

Answer:

54321

Explanation:

When static storage class is given, it is initialized once. The change in the value of a static variable is retained even between the function calls. Main is also treated like any other ordinary function, which can be called recursively.

See All Chapters
Medium 9781601324078

Knowlege Base Systems, Representation, Discovery + Information Engineering Methods and Related Issues

Editied By Hamid R. Arabnia, David de la Fuente, Roger Dziegiel, Elena B. Kozerenko, Peter M. LaMonica,Raymond A. Liuzzi, Jose A. Olivas, Todd Waskiewicz, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti (Editors) CSREA Press PDF

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

221

Using Multiple Methods to Infer Classification with An

Incrementally Expanding Knowledge Base.

K.H. Cheng

Computer Science Department, University of Houston, Houston, Texas, USA

Abstract – Many problems are solvable by several alternative methods. Each method is associated with some level of confidence, which depends on the kind of knowledge used. In this paper, we identify several methods to infer the classification of a target. We develop two algorithms, one used when the target is a category, while the other when the target is an object of a category. Our solution applies the methods in the order of non-increasing level of confidence, and for methods with the same level of confidence, the more versatile method is used first. Besides the answer, our solution also provides the certainty of the obtained answer.

In the presence of incomplete knowledge, three-valued logic is involved in the reasoning of the answer. Our solution is designed to use knowledge at ancestor categories. This reduces drastically the total amount of knowledge required to be learned, thus alleviating the burden of the teacher.

See All Chapters
Medium 9781601322388

Practical guidance on the application of R-K integration method in finite element analysis of creep damage problem

Hamid R. Arabnia; George A. Gravvanis; George Jandieri; Ashu M. G. Solo; and Fernando G. Tinetti (Editors) Mercury Learning and Information PDF

Int'l Conf. Scientific Computing | CSC'13 |

141

Practical guidance on the application of R-K integration method in finite element analysis of creep damage problem

F. Tan1, Q. Xu1, Z. Lu2, D. Xu1, and D. Liu1

School of Science and Engineering, Teesside University, Middlesbrough, TS1 3BA, UK

2

School of Computing and Engineering, University of Huddersfield, Huddersfield, HD1 3DA, UK

1

Abstract - A practical user guidance of Runge-Kutta (R-K) integration method with the context of non-linear time dependent finite element analysis (FEA) was proposed in this paper. Following the literature review of different integration method within the finite element analysis framework, detailed numerical experiments were conducted to find out the right balance between computing accuracy and efficiency. It contributes to knowledge to the numerical analysis software development in general and specific to computational creep damage mechanics.

Keywords: integration method, creep damage, finite element analysis

1

Introduction

See All Chapters

Load more