ICSTE 2011 Proceedings of the 2011 3rd International Conference on Software Technology and Engineering 3rd Edition International Conference On Software Technology And Engineering 2024 Scribd Download

Download the full version of the ebook at
https://ebookultra.com
ICSTE 2011 Proceedings of the 2011 3rd

International Conference on Software
Technology and Engineering 3rd Edition
International Conference On Software
Technology And Engineering
https://ebookultra.com/download/icste-2011-
proceedings-of-the-2011-3rd-international-
conference-on-software-technology-and-
engineering-3rd-edition-international-conference-
on-software-technology-and-engineering/
Explore and download more ebook at https://ebookultra.com

Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.
Coastal engineering practice proceedings of the 2011

Conference on Coastal Engineering Practice August 21 24
2011 San Diego California Orville T. Magoon
https://ebookultra.com/download/coastal-engineering-practice-
proceedings-of-the-2011-conference-on-coastal-engineering-practice-
august-21-24-2011-san-diego-california-orville-t-magoon/
ebookultra.com
Proceedings of the 21st International Conference on

Industrial Engineering and Engineering Management 2014 1st
Edition Ershi Qi
https://ebookultra.com/download/proceedings-of-the-21st-international-
conference-on-industrial-engineering-and-engineering-
management-2014-1st-edition-ershi-qi/
ebookultra.com
Bioinformatics and Biomedical Engineering Proceedings of

the 9th International Conference on Bioinformatics and
Biomedical Engineering 1st Edition James Chou
https://ebookultra.com/download/bioinformatics-and-biomedical-
engineering-proceedings-of-the-9th-international-conference-on-
bioinformatics-and-biomedical-engineering-1st-edition-james-chou/
ebookultra.com
Information Technology in Geo Engineering Proceedings of

the 1st International Conference ICITG Shanghai 1st
Edition D. G. Toll
https://ebookultra.com/download/information-technology-in-geo-
engineering-proceedings-of-the-1st-international-conference-icitg-
shanghai-1st-edition-d-g-toll/
ebookultra.com
Progress in extrusion technology and simulation of light
metal alloys selected peer reviewed papers from the 2011
edition of the International Conference on Extrusion and
Benchmark ICEB 2011 October 3 5 2011 Bologna Italy Luca
https://ebookultra.com/download/progress-in-extrusion-technology-and-
Tomesani
simulation-of-light-metal-alloys-selected-peer-reviewed-papers-from-
the-2011-edition-of-the-international-conference-on-extrusion-and-
benchmark-iceb-2011-october-3/
ebookultra.com
Proceedings of the International Conference on Education

Reflection and Development 1st Edition Vasile Chis
https://ebookultra.com/download/proceedings-of-the-international-
conference-on-education-reflection-and-development-1st-edition-vasile-
chis/
ebookultra.com
Geological engineering proceedings of the 1st

International Conference ICGE 2007 American Society Of
Mechanical Engineers
https://ebookultra.com/download/geological-engineering-proceedings-of-
the-1st-international-conference-icge-2007-american-society-of-
mechanical-engineers/
ebookultra.com
Differential Geometry And Related Topics Proceedings of

the International Conference on Modern Mathematics and the
International Symposium on Differential Geometry Gu
Chaohao
https://ebookultra.com/download/differential-geometry-and-related-
topics-proceedings-of-the-international-conference-on-modern-
mathematics-and-the-international-symposium-on-differential-geometry-
gu-chaohao/
ebookultra.com
Essentials Of Software Engineering 3rd Edition Frank Tsui
https://ebookultra.com/download/essentials-of-software-
engineering-3rd-edition-frank-tsui/
ebookultra.com
ICSTE 2011 Proceedings of the 2011 3rd International
Conference on Software Technology and Engineering 3rd
Edition International Conference On Software
Technology And Engineering Digital Instant Download
Author(s): International Conference on Software Technology and Engineering
ISBN(s): 9780791859797, 0791859797
Edition: 3
File Details: PDF, 45.90 MB
Year: 2011
Language: english
Procceeding
gs of thhe 20111
3rd Internation
nal Connferencce on
Sofftware Technoology aand Enngineeriing
(ICST
TE 2011)
August 12
2 – 14, 22011
Ku
uala Lum
mpur, Maalaysia
Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

© 2011, ASME, 3 Park Avenue, New York, NY 10016, USA (www.asme.org)
All rights reserved. Printed in the United States of America. Except as permitted under the
United States Copyright Act of 1976, no part of this publication may be reproduced or
distributed in any form or by any means, or stored in a database or retrieval system,
without the prior written permission of the publisher.
INFORMATION CONTAINED IN THIS WORK HAS BEEN OBTAINED BY THE AMERICAN

SOCIETY OF MECHANICAL ENGINEERS FROM SOURCES BELIEVED TO BE RELIABLE.
HOWEVER, NEITHER ASME NOR ITS AUTHORS OR EDITORS GUARANTEE THE ACCURACY OR
COMPLETENESS OF ANY INFORMATION PUBLISHED IN THIS WORK. NEITHER ASME NOR ITS
AUTHORS AND EDITORS SHALL BE RESPONSIBLE FOR ANY ERRORS, OMISSIONS, OR
DAMAGES ARISING OUT OF THE USE OF THIS INFORMATION. THE WORK IS PUBLISHED
WITH THE UNDERSTANDING THAT ASME AND ITS AUTHORS AND EDITORS ARE SUPPLYING
INFORMATION BUT ARE NOT ATTEMPTING TO RENDER ENGINEERING OR OTHER
PROFESSIONAL SERVICES. IF SUCH ENGINEERING OR PROFESSIONAL SERVICES ARE
REQUIRED, THE ASSISTANCE OF AN APPROPRIATE PROFESSIONAL SHOULD BE SOUGHT.
ASME shall not be responsible for statements or opinions advanced in papers or . . .

printed in its publications (B7.1.3). Statement from the Bylaws.
For authorization to photocopy material for internal or personal use under those
circumstances not falling within the fair use provisions of the Copyright Act, contact the
Copyright Clearance Center (CCC), 222 Rosewood Drive, Danvers, MA 01923, tel: 978-
750-8400, www.copyright.com.
Requests for special permission or bulk reproduction should be addressed to the ASME Publishing
Department, or submitted online at:
http://www.asme.org/Publications/Books/Administration/Permissions.cfm
ASME Press books are available at special quantity discounts to use as premiums or for use in
corporate training programs. For more information, contact Special Sales at [email protected]
ISBN-13: 978-0-7918-5979-7
ASME Order No. 859797

PREFACE
Dear Distinguished Delegates and Guests,
The Organizing Committee warmly welcomes our distinguished

delegates and guests to the 2011 3rd International Conference on
Software Technology and Engineering (ICSTE 2011), and the
workshop—2011 International Conference on Computer Design and
Engineering (ICCDE 2011) and 2011 International Conference on
Energy and Electrical Systems (ICEES 2011) held during August 12-14,
2011, Kuala Lumpur, Malaysia.
ICSTE 2011 is co-sponsored by University Putra Malaysia, Polytechnic

University Puerto Rico, Chengdu Young Education & Consultancy, and
IACSIT. If you have attended a conference sponsored by IACSIT before,
you are aware that the conferences together report the results of
research efforts in a broad range of Computer Science and Information
Technology. These conferences are aimed at discussing with all of you
the wide range of problems encountered in present and future high
technologies. The ICSTE 2011 is organized to gather members of our
international community scientists so that researchers from around the
world can present their leading-edge work, expanding our
community’s knowledge and insight into the significant challenges
currently being addressed in that research. The conference Program
Committee is itself quite diverse and truly international, with
membership from the Americas, Europe, Asia, Africa and Oceania.
This proceeding records the fully refereed papers presented at the

conference. The main conference themes and tracks are Software
Technology and Engineering. The main goal of these events is to
provide international scientific forums for exchange of new ideas in a
number of fields that interact in-depth through discussions with their
peers from around the world. Both inward research; core areas of
Software Technology and Engineering and outward research;
multi-disciplinary, inter-disciplinary, and applications will be covered
during these events.
The conference has solicited and gathered technical research

submissions related to all aspects of major conference themes and
tracks. All the submitted papers in the proceeding have been peer

reviewed by the reviewers drawn from the scientific committee,
external reviewers and editorial board depending on the subject
matter of the paper. Reviewing and initial selection were undertaken
electronically. After the rigorous peer-review process, the submitted
papers were selected on the basis of originality, significance, and
clarity for the purpose of the conference. The selected papers and
additional late-breaking contributions to be presented as lectures will
make an exciting technical program. The conference program is
extremely rich, featuring high-impact presentations.
The high quality of the program – guaranteed by the presence of an

unparalleled number of internationally recognized top experts – can be
assessed when reading the contents of the program. The conference
will therefore be a unique event, where attendees will be able to
appreciate the latest results in their field of expertise, and to acquire
additional knowledge in other fields. The program has been structured
to favor interactions among attendees coming from many diverse
horizons, scientifically, geographically, from academia and from
industry. Included in this will to favor interactions are social events at
prestigious sites.
We would like to thank the program chairs, organization staff, and the
members of the program committees for their work. Thanks also go to
the editors for their wonderful editorial service to this proceeding.
We are grateful to all those who have contributed to the success of

ICSTE 2011. We hope that all participants and other interested readers
benefit scientifically from the proceedings and also find it stimulating
in the process. Finally, we would like to wish you success in your
technical presentations and social networking.
We hope you have a unique, rewarding and enjoyable week at ICSTE

2011 in Kuala Lumpur, Malaysia.
With our warmest regards,
The Organizing Committees

August 12-14, 2011
Kuala Lumpur, Malaysia

ORGANIZING COMMITTEES
Honorary Chair
Prof. Houssain Kettani, Polytechnic University Puerto Rico, USA
Prof. Gregory Newby, Univ of Alaska, USA
Debbie McCoy, Oak Ridge National Laboratory, USA
Conference General Chairs

Prof. Dr. Mohamed Othman, Universiti Putra Malaysia, Malaysia
Prof. Raja Suzana Raja Kasim, Universiti Teknologi MARA, Malaysia
Program Committee Chairs

Prof. Ahmad Fairuz Bin Omar, University Science Malaysia, Malaysia
Dr. Lili Nurliyana Abdullah, Universiti Putra Malaysia, Malaysia
Prof. Dr. Abdullah Md. Zin, Universiti Kebangsaan Malaysia, Malaysia
Prof. Christos Grecos, University of West of Scotland, UK
Prof. Amit Saxena, G G University, India
Adjunct Professor, Christopher Nwosisi, The College of Westchester, USA
Steering Committee Chairs

Prof. Sekhar Ranjan Bhadra Chaudhuri, Bengal Engineering & Science
University, India
Dr. Yucong Duan, University of Bourgogne, France
Ms. Zhou Jianhong, Sichuan University, China
Publicity Chairs
Prof. Srimathi.H, SRM University
Prof. Afaq Ahmad, Sultan Qaboos University, Oman
Ms. Liu Guiping, Chengdu Young Education & Consultancy Co., Ltd.,
China

Publication Chairs
Yi Xie, IACSIT, Singapore
Ms. Xu Chunxiao, Chengdu Young Education & Consultancy Co., Ltd.,
China
Organizing Committees
Mr. Wang Hao, Chengdu Young Education & Consultancy Co., Ltd., China
Ms. Zhang Ting, Chengdu Young Education & Consultancy Co., Ltd.,
China
Technical Committees
Prof.N.Jaisankar, School of Computing Sciences, VIT University, India
Razvan Raducanu, "Al. I. Cuza" University, Romania
Jivesh Govil, Cisco Systems Inc., CA USA
Prof. Raja Suzana Raja Kasim, Universiti Teknologi MARA, Malaysia
Dr. Mo adda, University of Portsmouth, UK
Dr Deepak Laxmi Narasimha, University of Malaya, Malaysia
Dr. Deng Liao, Concordia University, Canada
Prof. Peddoju Sateesh Kumar, Balaji Institute of Technology & Science,
India
Dr. Srinivasan Alavandar, Indian Institute of Technology, India
Dr. K.S. Cheung, University of Hong Kong, Hong Kong
Prof. Ashwani Kush, IIT kanpur and Kurukshetra University, India
Dr. Xiaoxiao Zhou, Nanyang Technological University, Singapore
Prof. Rajendra Prasad Mahapatra, SRM University, India
Prof. Shishir K.Shandilya, Rukmani Devi Institute of Science and
Technology, India
Dean, Prof. G.Selvakumar, School of Electrical Sciences, V.M.K.V.
Engineering College, India
Prof. Xuesong Zhang, Claremont Graduate University, USA
Prof. Sarat Kumar Patra, National Institute of Technology Rourkela,

India
HOD, Prof. Kung Chih-hsien, Chang-Jung Christian University, Taiwan
Prof. K.Chandra Sekaran, National Institute of Technology Karnataka,
India
HOD, Prof. V.Saravanan, Dept of Computer Applications, Karunya
University, India
Prof. Rafi-U-Zaman, Muffakham Jah College of Engineering and
Technology, India
Prof. Jinlong Wang, Qingdao Technological University, China
Prof. S J Wagh, Maharashtra Academy of Engineering, India
Dean, Prof. Taher Omran Ahmed Aljabal Algharby University, Libya
Prof. Qiang Li, Zhejiang University of Science and Technology, China
Dr. Bruce Moulton, University of Sydney Technology, Australia
Prof. Farhat Anwar, International Islamic University Malaysi, Malaysia
Prof. Shinde Subhash Keshavrao, Bharati Vidyapeeth College of
Engineering, India
HOD, Prof. Khaleel Ur Rahman Khan, Muffakham Jah College of
Engineering & Tech.., India
Prof. Haiyan Wu, Zhejiang Gongshang University, China
Prof. Seung-Soo Han, Myongji University, Korea
Prof. Adrian OLARU, University Polytechnic of Bucharest, Romania
Prof. Zheng Quan, University of Science and Technology of China, China
Prof. Nansheng Pang, North China Electric Power University, China
Prof. Hossein Hassanabadi, Azad University of Quchan, Iran
Prof. Neeraj Kumar Nehra, SMVD University, India
Dr. Qian Chen, Columbia University, USA
HOD, Prof. Bhavesh Patel, Shah & Anchor Kutchhi Polytechnic, India
Prof. Sang Ho Lee, Soongsil University, Korea
Prof. Guoai Xu, Beijing University of Posts and Telecommunications,
China
HOD, Prof. H.S.Mohana, Malnad College of Engineering, India
Prof. Ying Jin, Jilin University, China
HOD, Prof. H Naganna, S.J.B. Institute of Technology, India

HOD, Prof. D.Balaji, R.V.S. College of Engineering and Technology, India
Prof. Chetto Maryline, University of Nantes, France
Prof. Aamir Saeed Malik, Yeungnam University, Korea
HOD, Prof. Yogendra Kumar Jain, Samrat Ashok Technological Institute,
India
Dr. Rubijesmin Abdul Latif, Monash University, Australia
Prof. Hui Peng, Beijing University of Posts and Telecommunications,
China
HOD, Prof. Manpreet Singh, Punjabi University, India
Prof. Sirirut Vanichayobon, Prince of Songkla University, Thailand
Prof. Hossein Nezakati Alizadeh, Islamic Azad University, Iran
HOD, Prof. D. Venkata Rao, Vignan’s Engineering College., India
Prof. Ismail Musirin, Universiti Teknologi MARA Malaysia, Malaysia
Prof. Chih-Kai Chang, National University of Tainan, Taiwan
HOD, Prof. T.C.Manjunath, New Horizon College of Engg.,, India
Prof. K.P.Sudheer, Indian Institute of Technology Madras, India
HOD, Prof. D.D.Chaudhary, Sinhgad Institute of Technology, India
Prof. J.Meenakumari Alliance Business School, India
Prof. VELAYUTHAM .P, Adhiparasakthi Engineering College, India

CONTENTS
Preface
Organizing Committee
Session 1 Software Technology and Engineering
T007 TTRUST IN A HYBRID RECOMMENDER SYSTEM . . . . . . . . . . . . . . 1

MORTEZA KARIMI and KHAIRIL IMRAN GHAUTH
T012 TO-BE-RECORDED ANALYSIS INSIDE DERIVATIVE CODE COM-
PILER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
MUHSIN SHODIQ, BORIS GENDLER and UWE NAUMANN
T013 ADOPTING DOMAIN KNOWLEDGE TO ENHANCE LEXICAL
CHAIN FOR UNSUPERVISED WORD SENSE
DISAMBIGUATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
WEI JAN LEE.and EDWIN MIT
T015 WORD AND SPEAKER RECOGNITION SYSTEM ON MATLAB . . . 19
TAN SHWU FEI and MOHAMMAD AWAN
T019 DHTCACHE: A NOVEL STRUCTURED P2P-BASED COOPERATIVE
WEB CACHING SYSTEM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
XIAO-JIN REN and JING-YANG YU
T024 INTEGRATED FEATURE EXTRACTION USING GABOR-FILTER
AND RECURSIVE SUPPORT VECTOR MACHINE FOR FINGER-
PRINT IDENTIFICATION AND VERIFICATION . . . . . . . . . . . . . . . . . 31
SANDEEP S. JORE and A. K. GULVE
T035 ENHANCED SECURITY OF WATERMARKING USING HASH FUNC-
TION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
SHWETA DHAWAN, SONAM RATHORE and JAISHRI CHOURASIA
T036 A NEW CONCEPT FOR AIRPORT SECURITY USING STATIC BODY
BIOMETRIC AND LEG ANGLE GAIT RECOGNITION
TECHNIQUE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
JAISHRI CHOURASIA, SONAM RATHORE and SHWETA DHAWAN
T037 SENSITIVE QUANTITATIVE PREDICTIONS OF MHC BINDING PEP-
TIDE FROM ENTAMOEBA HISTOLYTICA . . . . . . . . . . . . . . . . . . . . . 53
VS GOMASE, RA KAPOOR, SS LADAK and RAVIKIRAN KHARTODE
T038 STRATEGIC ACADEMIC MANGMENT SYSTEM . . . . . . . . . . . . . . . 59
SURESH KUMAR

T040 RECHAP PROTOTYPE: A TOOL FOR SIMPLIFYING REQUIREMENT

CHANGE PROPAGATION TO SOFTWARE DESIGN . . . . . . . . . . . . . 65
NORAINI IBRAHIM, WAN M.N. WAN KADIR, SHAHLIZA ABD.HALIM, SA-
FAAI DERIS and HIDAYAH ELIAS
T043 RISK BASED ANALYSIS FOR DETENTION POND OVERFLOW AT
WILAYAH PEMBANGUNAN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
ISKANDAR (NUSAJAYA), JOHOR SUPIAH SHAMSUDIN, AZMI AB RAH-
MAN, ZULIZIANA SUIF and HAZWANI NADIA HASSAN
T044 RISK BASED ANALYSIS FOR CONCRETE CHANNEL AND
GRASSED SWALE DESIGN AT LIMA KEDAI, JOHOR BAHRU . . . . 85
SUPIAH SHAMSUDIN, AZMI AB RAHMAN, MD AZIZI DAHLAN and MOHD
AZIZI ZAKARIA
T045 NEW IMPROVED RUNGE-KUTTA METHOD WITH REDUCING
NUMBER OF FUNCTION EVALUATIONS . . . . . . . . . . . . . . . . . . . . . 95
FARANAK RABIEI and FUDZIAH ISM AIL
T048 TOWARDS A COMPILER GENERATED ADJOINT MODEL OF
FVCOM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
NGUYEN THI HONG HA, JAN RIEHME, MICHEL SCHANEN and UWE
NAUMANN
T055 MULTI-CLUSTERING USERS IN TWITTER DATASET . . . . . . . . . 107
ARASH HEIDARIAN
T059 JAVA APPLICATION FAULT TOLERANCE TOWARDS UNSAFE NA-
TIVE CODE INVOCATION USING PROCESSBUILDER . . . . . . . . . 115
YEW KWANG HOOI and ALAN OXLEY
T062 AUTOMATIC HUMAN AGE ESTIMATION BASED ON NEURAL
NETWORKS AND THE MODIFIED FACE MODEL . . . . . . . . . . . . . 121
ALIREZA KESHAVARZ CHOOBEH and MOHAMMAD JAFAR POUR JALALI
T064 APPLICATION OF NATURAL NEIGHBOR INTERPOLATION IN
DATA PROCESSING OF MAGNETIC SURVEY . . . . . . . . . . . . . . . . . 127
YANG XUELI and DU RUIQING
T065 A COMPARATIVE EVALUATION OF STATE-OF-THE-ART AP-
PROACHES IN THE DESIGN OF AN ADAPTIVE SOFTWARE SYS-
TEM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
ABDELHAMID A. MANSOR and WAN M.N. WAN-KADIR
T066 MIPAF: A POLICY-BASED MIDDLEWARE FRAMEWORK TO CON-

TROL NEGATIVE EFFECTS OF SOFTWARE EVOLUTION . . . . . . 143
NOR HAZILAWATI AWANG and WAN MOHD NASIR WAN KADIR

T070 SIGNALING OVERHEAD IN TIME-INVARIANT OFDM SYSTEMS
WITH ADAPTIVE TECHNIQUES . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
ZHONGBAO JI
T084 COMPRESSION OF BURSTY SIGNALS USING TIME ENCODING
MODULATOR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
MOHAMMAD MEHDI KAFASHAN and SAJJADBEYGIHARCHEGANI
T088 USING CLUSTERING TECHNIQUES GOES WITH GENETIC ALGO-
RITHM TO IMPROVE SOFTWARE DEFECT PREDICTION . . . . . . 165
CHIA-HAO KUO, CHING-PAO CHANG, YU-SHIH LIN and CHIH-PING
CHU
T089 MAPPING ANNOTATED SOFTWARE ARCHITECTURE DESCRIP-
TIONS TO A PETRI NET NOTATIONS FOR RELIABILITY EVALUA-
TION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
SIMA EMADI
T090 SYSTEM REQUIREMENT ENGINEERING FOR STUDENT’S EMO-
TION BASED SYSTEM –FOCUSING ON TRACEABILITY TECH-
NIQUES TO SUPPORT VERIFICATION . . . . . . . . . . . . . . . . . . . . . . . 177
DESHINTA ARROVA DEWI, HAFIZAH NOR BINTI ABU HASAN, PO JIANG
LING and CHE FUZLINA BINTI HJ. MOHD FUAD
T091 A SIMPLE ALGORITHM TO FIND THE PROPER SPANNING TREE
IN METRO ETHERNET NETWORKS . . . . . . . . . . . . . . . . . . . . . . . . . 185
SAMIRA SAMADI, GHASEM MIRJALILY and S.M.T. ALMODARRESI
T093 ANT COLONY OPTIMIZATION: A SURVEY AND A SYSTEM MOD-
EL TO OPTIMIZE ORDERED THROUGHPUT . . . . . . . . . . . . . . . . . . 191
ANIRBAN SAMANTA
T095 X-CM: EXTENDING ENTITY-RELATIONSHIP CONCEPTUAL MOD-
ELING FOR XML DATABASES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
SWEE-MEI CHIN, SU-CHENG HAW and CHIEN-SING LEE
T098 VARIABLES AFFECTING THE USAGE OF E-PORTFOLIOS BY
PROJECT MANAGERS IN CONSTRUCTION INDUSTRY . . . . . . . . 203
GHASEM OMIDVAR, FARHANG JARYANI, SOMAYE FATTAHI ZAFARGHAN-
DI, SAMANEH SALEHI NASAB, SUHAIMI IBRAHIM and RUSNI DARUIS
T100 USER-CENTRIC PROCESS DESCRIPTIONS . . . . . . . . . . . . . . . . . . . 209
MICHAEL DEYNET
T101 MOBILEOBJECT: ADVANCED FEATURES . . . . . . . . . . . . . . . . . . . 215
T.S. LI
T102 MOBILEOBJECT: FUNDAMENTALS . . . . . . . . . . . . . . . . . . . . . . . . 221

S.M. WONG and T.S. LI

T103 A NOVEL WEAPON DETECTION FRAMEWORK IN HIGH-ENERGY
X-RAY DUAL-ENERGY IMAGES BASED ON SHAPE AND EDGE
FEATURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227
HOSSEIN POURGHASSEM
T105 DEBUGGING PROGRAMS WITH CONTRACT
INFORMATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
ANSUMAN BANERJEE and RAMANUJ BHATTACHARYYA
T112 MODELING AND VERIFYING WEB COMPOSITION USING
PI-CALCULUS SERVICES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
GOPAL SINGH KUSHWAH and DHARMENDRA K. YADAV
T10016 THE DESIGN OF VIDEO TEACHING SYSTEM . . . . . . . . . . . . . . . . 245
YIN LI and TAN HAI-JUN
T10017 A FACE TRACKING ALGORITHM COMBINED WITH FEATURE
POINTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251
LI LI-JUAN and YANG DE-SHUN
T10018 PRELIMINARY RESEARCH ON PORT ENTERPRISE HUMAN RE-
SOURCE SUPPLY CHAIN MODEL . . . . . . . . . . . . . . . . . . . . . . . . . . 257
Liu Xiaoqing and Xiao Hanbin
T10022 RESEARCH ON MOTION ESTIMATION FOR H .264 . . . . . . . . . . . . 261
MD. ANWARUL KAIUM PATWARY and MOHAMED OTHMAN
T10025 THE APPLICATION OF AUTHORWARE IN COURSEWARE
MAKING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
YAJUAN DONG and LINA SU
T10027 AN ALGORITHM FOR DETERMINING THE OPTIMAL WAITING
TIMES IN MACHINE SCHEDULING PROBLEM . . . . . . . . . . . . . . . 273
LU-WEN LIAO and YU-CHUNG TSAO
T10028 A METHOD BASED ON GENETIC ALGORITHM TO GENERATE
OPTIMAL TEST DATA FOR PROGRAM’S PATHS . . . . . . . . . . . . . . 279
SIROOS KESHAVARZ and REZA JAVIDAN
T20014 ABASIC FOR INTRUSION DETECTION SYSTEM . . . . . . . . . . . . . . 285

DR. LUMA S.HASAN
T20015 A REVIEW ON PREDICTION OVER PRESSURED ZONE IN HYDRO-
CARBON WELL USING SEISMIC TRAVEL TIME THROUGH ARTIFI-
CIAL INTELLIGENCE TECHNIQUE FOR PRE-DRILLING
PLANING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
HARAVINTHAN A., AYOB M.R., SALLEH S. and JAPPER-JAAFAR A.
T20022 PERFORMANCE ANALYSIS OF ANONYMOUS AD HOC NETWORK
WITH NON CO-OPERATIVE NODES . . . . . . . . . . . . . . . . . . . . . . . . 301
R.KALPANA and DR.N.RENGARAJAN

T30005 USABILITY EVALUATION OF MOBILE LEARNING TOOL (M-LT)
FOR STRUCTURED PROGRAMMING . . . . . . . . . . . . . . . . . . . . . . . . 307
SAHILU WENDESON, WAN FATIMAH WAN AHMAD and NAZLEENI SAMI-
HA HARON
T30007 INHIBITING PYROLYSIS PROCESS FOR FIBER-REINFORCED
COMPOSITES BY USING FLAME RETARDANTS
ADDITIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313
DR.ABBAS A. KARWI, ALI I .AL-MOSAWI and ZUHER H. ABDULLAH
T30008 IMPROVING SOFTWARE RELIABILITY BY APPLICATION OF
SOFTWARE ENGINEERING APPROACH . . . . . . . . . . . . . . . . . . . . . 321
DR. PANKAJ NAGAR and MS. BLESSY THANKACHAN
T30010 COGNITIVE SCIENCE AS NATURAL COMPUTATIONAL META-
PHOR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329
NAIMA SHAHBAZ KHAN and AHMED JAMIL
T30011 A SEMANTIC APPROACH TO ANSWER VIETNAMESE QUESTIONS
IN OPENCOURSEWARE RETRIEVAL SYSTEM . . . . . . . . . . . . . . . 337
DANG TUAN NGUYEN, AN HOAI VO and PHUC TRI NGUYEN
T30014 A NEW HEURISTIC APPROACH FOR TRAINING DATA REDUCTION
AND A GENETIC LEARNING METHOD FOR ACHEIVING COM-
PACT FUZZY RULE-BASED SYSTEMS . . . . . . . . . . . . . . . . . . . . . . 345
TRI MINH HUYNH
T30019 SOLUTIONS OF INTERVAL DIFFERENTIAL EQUATIONS UNDER
GENERALIZED HUKUHARA DIFFERENCE . . . . . . . . . . . . . . . . . . 357
ALI AHMADIAN, MOHAMMED BIN SULEIMAN, FUDZIAH BINT ISMAIL
and REZA AFSHARI
T30021 SECURITY FEATURES COMPARISON OF MASTER KEY AND IKM
CRYPTOGRAPHIC KEY MANAGEMENT FOR RESEARCHERS AND
DEVELOPERS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 365
SAEED YAZDANPANAH, SAMAN SHOJAE CHAEIKAR, MAZDAK ZAMANI
and REZA KOURDI
Session 6 Computer Design and Engineering
E004 AWARENESS FOR THE PROTECTION OF ENDANGERED SPECIES

WITH AUGMENTED REALITY . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371
BEHRANG PARHIZKAR, KOH BOON SAN and ARASH HABIBI LASHKARI
E012 WIRELESS UNDERGROUND SENSOR NETWORK: IMPROVING
EBMR PROTOCOL FOR THE PURPOSE OF ENERGY CONSERVA-
TION AND DATA TRANSMISSION RELIABILITY . . . . . . . . . . . . . 377
MORTEZA KARIMI and KHAIRIL IMRAN GHAUTH
E014 IMPLEMENTATION OF SELECTIVE ERROR PROTECTION ON
SPIHT COEFFICIENTS FOR WIRELESS VISUAL NETWORK . . . . 383
JIA JAN ONG L.-M. ANG, K. P. SENG AND ONG FONG TIEN

E015 AUDIO VISUAL-ORIENTED ENCRPYTION ALGORITHMS . . . . . 389
FONG TIEN ONG, KAH PHOOI SENG, LI-MINN ANG
E024 LOW ENERGY TRANSITION CURVE . . . . . . . . . . . . . . . . . . . . . . . . 395
CHIU LING CHAN and JAMALUDIN MD ALI
E026 A MATHEMATICAL MODEL AND HEURISTIC PROCEDURE FOR
CELLULAR LAYOUT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
SH. ARIAFAR, N. ISMAIL, S. H. TANG, M. K. A. M. ARIFFIN and Z. FIROOZI
E027 A PARALLEL TIME-DEPENDENT MULTIMODAL SHORTEST PATH
ALGORITHM BASED ON GEOGRAPHICAL PARTITIONING . . . . 411
H. AYED, Z. HABBAS and D. KHADRAOUI
E029 PERFORMANCE EVALUATION OF DIGITAL FILTERS FOR NOISE
CANCELLATION IN ELECTROCARDIOGRAM . . . . . . . . . . . . . . . 417
AUNG SOE KHAING and ZAW MIN NAING
E032 DENOISING-BASED CASCADED ALGORITHMS FOR SMOOTHING
OF DIFFERENT LEVEL ADDITIVE WHITE GAUSSIAN NOISECOR-
RUPTED SPECTRA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 425
YESSI JUSMAN and NOR ASHIDI MAT ISA
E033 INTRUSION DETECTION TECHNIQUES PERFORMANCE IN
CLOUD ENVIRONMENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
FARZAD SABAHI
E036 EQUIVALENT PRESSURE CENTER ANALYSIS ON CONFIGURA-

TION DESIGN OF SUPERCAVITATING VEHICLES . . . . . . . . . . . . 437
LIN MINGDONG, HU FAN, ZHANG WEIHUA, MA ZHENYU
E040 LOW NOISE AMPLIFIER AT 5 .8GHZ WITH CASCODE AND CAS-
CADED TECHNIQUES USINGT-MATCHING NETWORK FOR WIRE-
LESS APPLICATIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
IBRAHIM A.B, HUSSAIN M.N, OTHMAN A.R and JOHAL.M.S
E044 IMAGE NOISE REMOVAL APPROACHES: A REVIEW . . . . . . . . . . 451
LILI, N. A., FATIMAH. K and NORMASAINA M.B.
E045 Survey on methods for configuration of active networks . . . . . . . . . . . . 459
SOMAYYEH GHOLIZADEH and MAHMOUD MAHERI
E046 EXPERIMENTAL VERIFICATION OF DUAL-RANGE LINEAR CON-
TROLLER ON NONLINEAR UNSTABLE SYSTEM . . . . . . . . . . . . . 465
SEECHEW LI and AMIR NASSIRHARAND
E049 A SUPPLY CHAIN SIMULATION MODEL BASED ON SYSTEM DY-
NAMICS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471
JIANFENG LI, YANZHU TIAN and XIAOYU YANG

E050 SPECIFYING DISTRIBUTED SYSTEMS USING A DIAGRAMATIC
NOTATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 477
A. S. Bavan
E052 A STUDY OF THE INFLUENCE OF FACIAL LANDMARK MISLO-
CALIZATION ON AUTOMATIC AGE ESTIMATION SYSTEM . . . . 483
ALIREZA KESHAVARZ CHOOBEH and HAMID CHEGINI
E055 ALGORITHMIC STATE MACHINE AND DATA BASED MODELING
OF SUPERSCALAR PROCESSOR OF ORDER 2 . . . . . . . . . . . . . . . 489
Muhammad Bux Alvi and Khurram Hameed
E056 A CNT/METAL HYBRID ROUTING ARCHITECTURE TO IMPROVE
PERFORMANCE OF ULTRA-LARGE FPGAS . . . . . . . . . . . . . . . . . 495
Mozhgan Malekshahi Rad and Ali Jahanian
E059 TOWARDS AEROACOUSTIC CHARACTERIZATION OF THE SIBI-

LANT [S] PRODUCTION FROM A SIMPLIFIED PARAMETERIZED
GEOMETRIC MODEL OF THE ORAL CAVITY . . . . . . . . . . . . . . . . 503
JULIEN CISONNI, KAZUNORI NOZAKI, SHIGEO WADA and ANNEMIE VAN
HIRTUM
E063 FROM IDENTIFICATION TO BUDGET ALLOCATION: A NOVEL IT
RISK MANAGEMENT MODEL FOR ITERATIVE AGILE
PROJECTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509
AHDIEH KHATAVAKHOTAN, NAVID HASHEMITABA and SIEW HOCK OW
E064 OPTIMAL ROUTING IN COMMUNICATION NETWORKS USING
NOISY HOPFIELD NEURAL NETWORK . . . . . . . . . . . . . . . . . . . . . . 515
EHSAN HEMMATI, FARZAD ABDOUS and ARASH HEMMATI
E10001 OPTIMIZATION OF CONTACT SEARCH POLICY IN WIRELESS MO-
BILE AD HOC NETWORKS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
MOHSEN HEIDARI
E10009 DYNAMIC CAUSAL MODELING OF FMRI DATA . . . . . . . . . . . . . 527
PROF. NAGORI M.B., MISS GILL P.C. and DR. JOSHI M.S.
E10016 SEARCH METHODS IN PEER TO PEER (P2P) NETWORKS AND RE-
VIEWING THEIR BEST SOLUTIONS . . . . . . . . . . . . . . . . . . . . . . . . 537
KASRA SADRERAFI, AMIR MASOUD BIDGOLI and MOHAMMAD MAN-
SOUR RIAHI KASHANI
E20006 COMPUTATIONAL ALGORITHM TO ESTIMATE FINAL COSTS
BASED ON THE NUMBER OF USERS IN SPACE
STRUCTURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543
MARZIEH NOORANI, FOAD FAIZI and MOHAMMADJAVAD MAHDAVINE-
JAD

E20010 OPTIMIZED MODEL OF LUMBAR ARTIFICIAL DISC USING FINITE
ELEMENT METHOD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549
AZADEH GHOUCHANI and HAMIDREZA KATOUZIAN
E20016 WEBSITE OPTIMIZATION FOR MOBILE PHONE TO ACCESS MA-
LAYSIA’S MINISTRY WEBSITES: A STEP TOWARDS MGOVERN-
MENT READINESS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 555
WAN NOORAISHYA WAN AHMAD, AHMAD RIZAL AHMAD RODZUAN and
IDYAWATI HUSSEIN
E20017 AN EXPLORATORY STUDY: ANALYSING TYPES OF MOBILE AP-
PLICATIONS DOWNLOAD BY TERTIARY STUDENTS IN MALAY-
SIA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565
AHMAD RIZAL AHMAD RODZUAN, WAN NOORAISHYA WAN AHMAD and
ESMADI ABU SEMAN
E30000 BYTE PERMUTATIONS IN BLOCK CIPHER BASED ON IMMUNE
SYSTEMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 575
Suriyani Ariffin, Ramlan Mahmod, Azmi Jaafar and Muhammad Rezal Kamel
Ariffin
Session 9 Energy and Electrical Systems
S001 Fault Diagnosis of Power Transformers with Neural Network . . . . . . . 581

Wang Wu, ZHANG Yuan-min and WANG Hong ling
S011 Influence of Particle Size and Temperature on Gasification Performance in
Externally Heated Gasifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 587
Yu Feng and Bo Xiao
S014 EFFECTS OF BIOETHANOL–DIESEL FUEL BLENDS ON EMIS-
SIONS OF A DIESEL ENGINE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 593
Hasan Aydogan and MUSTAFA ACAROGLU
S015 DETERMINATION OF THE EFFECTS OF SAFFLOWER BIODIESEL
AND ITS BLENDS WITH DIESEL FUEL ON ENGINE PERFOR-
MANCE AND EMISSIONS IN A SINGLE CYLINDER DIESEL EN-
GINE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 599
A. Engin ӦZÇELİK and Hüseyin ӦGÜT
S016 Application of mesh adaptive direct search method to power system valve-
point economic load dispatch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 609
Razmara zakerifar, Soheil Sadat Hosseini, esmaeil naghibi and Ali Jafarnejad
S019 Analysis of Failure and Reliability for constant speed and constant pitch
Wind Turbine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617
T.Sunder Selwyn, Dr. R.Kesavan and Dr. C.ELANCHEZHIAN
S021 Design of energy efficient smart home appliance to run on low DC voltage
for reducing power consumption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 623
Yasir Arafat and Mohammad Amin

S023 Performance Evaluation of Wireless LAN for Control, Protection, and
Monitoring of a Microgrid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 631
T. S. Sidhu and P. Parikh
S025 A New Approach to RMS Measurement Using Current Conveyors . . . . 637
eBRAHIM fARSHIDI
S027 InterLine Power Flow Controller and Impact on ATC Improvement . . . 643
S.M.H. Hosseini, N.Talebi and A.Dehghanpour
S035 OPTIMAL GRID-CONNECTED ELECTRCITY PLANNING COMPRIS-
ING RENEWABLE ENERGY and CO2 Reduction . . . . . . . . . . . . . . . 653
Haslenda Hashim And Ho Wai Shin
S037 Improving dynamic performance of wind farms in a distribution system
using dstatcom . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659
Mostafa Abdollahi And Amin Khodabakhshian
Session 10 Energy and Electrical Systems
S042 Effect of segmented contacts on fuel cell performance using

3-d modelling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 665
S.S. DIMBLE, P. RAMESH, V. AGARWAL AND S. P. DUTTAGUPTA
S044 ENHANCEMENT OF VOLTAGE SECURITY WITHIN HIGH VOLT-
AGE TRANSMISSION SYSTEMS UTILIZING FACTS . . . . . . . . . . 671
R.M. Sharkawy and E.A. Mohamed
S050 Modified adaptive tabu search algorithms for static economic Load dis-
patch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
JUKKRIT KLUABWANG AND TATSANA THOMTHONG
S054 DESIGN OF A LOW COST ENERGY EFFICIENT WATER ELECTROL-
YSIS CELL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683
SK. Mazloomi and Nasri b. Sulaiman
S056 Parameter identification of frequency modulation sounds using modified
adaptive tabu search . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689
JUKKRIT KLUABWANG, APISAK KHANKAEWLA, PHAIROACH CHUN-
KAEW AND APHIRAK KHADWILARD
S064 Cubic Lattice Structured Multi agent based PSO approach for Optimal
Power Flows with Security Constraints . . . . . . . . . . . . . . . . . . . . . . . . . 693
K.Ravi Kumar, S.Anand and M.Sydulu
S20026 REVIEW ON VARIOUS METHODS IN HARMONIC STATE ESTIMA-
TION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 705
UGASCINY ARUMUGAM, NURSYARIZAL MOHD. NOR and MOHD FARIS
BIN ABDULLAH
S20033 Prospects and Potential in Optimize Utilization of Geothermal Energy in
Iran . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 713
Mehrdad Ahmadi Kamarposhti, Mehdi Babaei, Shahab Alinezhad and Moham-
mad Zaher GhorbanI

S30008 A NEW SWITCHING METHOD IN SPACE VECTOR MODULATION
OF CURRENT-SOURCE-INVERTER IN ORDER TO REDUCE LOAD
CURRENT THD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 719
MEHDI BABAEI and MEHRDAD AHMADI KAMARPOSHTI
S30011 OPTIMAL DESIGN OF A POWER ELECTRONIC SYSTEM FOR EF-
FICIENT AND RELIABLE POWER FLOW IN DISTRIBUTED wind
energy based POWER SYSTEMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727
Rourav Basak And Sayonsom Chanda
S30017 STUDY OF EFFECTIVENESS OF CIRCUIT LEVEL LEAKAGE POW-
ER OPTIMIZATION TECHNIQUES IN DSM CMOS CELLS . . . . . . 733
DR.VEENA S CHAKRAVARTHI, P PRABHAVATHI and RAMYA SUNDERRA-
JAN
S30018 LIVE LINE MAINTENANCE APPLICATION AT SOUTH BALI DIS-
TRIBUTION AREA TO INCREASE SYSTEM’S RELIABILITY . . . . 739
IAD. GIRIANTARI, NP.SATRIYA U., AI.WEKING and W.SUKERAYASA

TRUST IN A HYBRID RECOMMENDER SYSTEM
MORTEZA KARIMI KHAIRIL IMRAN GHAUTH

Faculty of Information Technology Faculty of Information Technology
Multimedia University Multimedia University
[email protected] [email protected]
ABSTRACT
A huge number of information is available nowadays and it keeps increasing
every day. As such, the need for recommender system to recommend relevant
items or information is in high demand. Furthermore, recommender system is
expected to deliver relevant items from a trustable source. In this paper, we
proposed a new trust calculation that is incorporated into a hybrid recommender
system. Our new trust calculation is calculated based on user’s score in a
particular system, and its potential implementation is demonstrated through a
prototype design.
KEY WORDS
Recommender System, Hybrid Filtering, Trust
1. INTRODUCTION
A huge amount of information available either on the Internet or in
databases, has led to a difficulty for users to locate relevant items in a short
period of time [7]. As such, users have to spend time browsing and filtering the
information they need. One way to overcome this problem is by using
recommender system. Recommender system is a software that helps user to find
interesting items from a huge amount of items. Recommender system
recommends items based on item similarity or user similarity or the combination
of both [1]. Even though, recommender systems have been widely used to
recommend items, often the recommended items may not be recommended from
the trusted user. Trust in recommender system can be defined as a user’s
recommendation that can be relied on. As a result trust plays an important role to
filter out the reliable source of recommendation [2].
In this paper, we proposed a new calculation for trust that can be
incorporated into a hybrid recommender system. The proposed trust calculation
is based on averaging user’s score on a particular system domain. Our proposed
method ensures that the trust calculation is not solely based on user rating about
other users but taking into account the user’s performance such as the user
performance in quizzes or the user track record in buying and purchasing items.
The objective of this study is to propose a generalized calculation of trust for a
hybrid filtering recommender system that uses user’s score to calculate trust.
The rest of this paper is organized as follows. Chapter 2 explains the
filtering techniques used in recommender system as well the recent works in
trust recommender system. Chapter 3 elaborates on the proposed trust in hybrid
recommender system. These include the explanation on the proposed framework,
the calculation of hybrid filtering technique, and the trust calculation. The
sample prototype of the proposed trust in hybrid recommender system is shown
1
in Chapter 4. Finally, the last chapter provides the concluding remarks along
with suggestion for future work.
2. LITERATURE REVIEW
Nowadays information overload has becoming one of the biggest problems
in the computer world. One way to solve information overload problem is by
using recommender system. Recommender system filters and recommends
relevant items to users based on either user profile, item profile or the
combination of both. Recommender system is divided into three techniques that
are content-based filtering, collaborative filtering, and hybrid filtering [1].
Content-based filtering technique recommends items based on similar items
that user like in the past. Item similarity is calculated by analyzing item’s
content or keywords overlaps between two items. All the items are then ranked
according to the similarity value and the recommender system will select Top-N
similar items to be recommended to the user. Among the popular methods to
calculate the item similarity are vector space model (VSM) and k-nearest
neighbor (kNN).
Contrast to content-based filtering technique, collaborative filtering
technique recommends items based on recommendation by similar users. User
similarity is calculated by comparing user feedback such as ratings given to
items. Based on the user similarity value, the top-N similar users will
recommend the highly rated items to the user [3]. Among the popular method to
calculate user similarity is Pearson Correlation Coefficient.
Both content-based filtering and collaborative filtering techniques have their
own disadvantages. For example, content-based filtering technique only
recommends similar characteristics items, and thus other interesting items that
have dissimilar characteristics are not able to be recommended. On the other
hand, collaborative filtering technique is not able to produce recommendation
when user has not rated the items. Hybrid filtering technique can be used to
solve the problems associated with both content-based and collaborative filtering
techniques. Hybrid filtering technique combines both content-based filtering and
collaborative filtering techniques by combining the rating prediction, adding
characteristics of collaborative filtering technique into content-based filtering
technique, adding characteristics of content-based filtering technique into
collaborative filtering technique, and creating a single unifying model that
incorporates both techniques’ characteristics [1].
While recommender system has been widely used to recommend relevant
items, there are many issues discussed regarding the recommended items and the
“trusted” user who provide the recommendation [6]. The idea of using “trust” in
recommender systems come from the fact that people always habitually rely on
trustable opinion of other people. Trustable recommendation in recommender
systems is expected to meet user needs and increase quality of recommender
Systems [2]. Few researchers have proposed a method to calculate trust in
recommender system. [4] proposed a trust-awareness recommender system in
which the trust is calculated based on rating given by user about other user. For
example user B will be rated by user A base on usefulness of user B. In [4]
proposed method, a trust network is used to show a trust statement, and a trust
metric is used to propagate trust over the trust network. Similar like [4], the
proposed method used by [5] uses rating to calculate trust. [5] proposed
2
computing Profile Level Trust and Item Level Trust. In [5] proposed method,
Profile Level Trust is the percentage of correct recommendations that user has
contributed while Item Level Trust is a profile level trust that depends on a
specific item. Contrast to [4] and [5] methods, the method proposed by [2]
represents trust model by computing trust based on the combination of trust
level and reputation in which both of them can have a different weight. In [2]
model, trust level shows the level of trust base on user past experience. The trust
level is dynamic over the time and the trust level can be lower or higher
depending on user interaction. Reputation in [2] is determined by observing or
retrieving information about the user’s past behavior and evaluation by other
users at a given time.
3. TRUST IN A HYBRID RECOMMENDER SYSTEM

The proposed trust calculation is based on the fact that users will have more
trust on a reputable user suggestion [2]. For example, a good learners’ rating on
certain learning materials can have a positive impact on recommender system
accuracy and student performance as compared to ratings by other learners [7]
[8]. In [7] and [8], good learners are considered as a trusted user and their
recommendation is given high priority. In another example, an eBay seller with
a high rating from buyers will have more trust by existing and future buyers [9].
As such, our proposed trust calculation is based on user’s score that the user
obtained while using the online system. User’s score can be calculated from quiz
taken by the user, positive response from other user about the user, or any kind
of evaluation taken by or assessment about the user by other users.
The calculation of the proposed trust in hybrid recommender system is
given as follows
where, is the rating prediction of item i by user u, is the trust value

of user u, is the rating prediction of item i calculates using the content-
based filtering technique, and is the rating prediction of user u calculates
using the collaborative filtering technique. is calculated as follows
where is the user u score and is the maximum score. For

example, user A and user B obtained 9 and 4 respectively in a quiz that contains
15 questions. Thus the trust value for user A is 0.64 and user B is 0.26. Based on
the calculation, users with a high score will have more weight on the final rating
prediction as compared to user with low score. The proposed trust value is
ranging from 0 to 1 where value 0 indicates lowest trust while value 1 indicates
highest trust.
3
In our proposed method, we used Pearson Correlation Coefficient to
calculate the user similarity. The equation for user similarity is given as follow
where X and Y are the pair ratings given by user X and user Y.
For the calculation of item similarity, we used VSM to calculate the
similarity. VSM involves two phases of calculation, that are to calculate the term
weight (TFIDF) and cosine similarity. In TFIDF, all the terms are treated as
independent terms. The equation is defined as follows
f i, j ⎛D⎞
wi , j = * log⎜⎜ ⎟⎟
maxz f z , j ⎝ di ⎠
f max z f z , j
where i , j denotes the frequency of term i occurring in document j, is
the maximum frequency among all the z keywords that appear in document j, D
is the total number of documents that can be recommended to a learner, and d i is
the number of documents that contain term i.
The term weight obtained from TFIDF calculation is used to calculate the
similarity value between two documents. The relevancy rankings of the
documents are measured based on the deviation angles between two document
vectors that can be calculated using cosine similarity as follows
where represents a vector of item i and is treated as a vector of item j.

Both and are the magnitude of the vectors and .
4. PROTOTYPE
The prototype of the proposed recommender system is based on three-tier
architecture. Three-tier architecture is consisted of presentation, logic, and data
tier. The presentation tier is the top level of the architecture which presents
information to user such as mandatory learning materials and additional
(suggested) learning materials. On the other hand, logic tier makes a decision on
the learning materials that need to be recommended based on the viewed
learning material. Finally, data tier is used to store information such as user
ratings and item attributes. Fig 1 illustrates the prototype of an e-learning system
that used the proposed trust recommender system. All the mandatory learning
materials are shown in the top-left column while the viewed learning material is
shown in the top-right column. The average rating of the viewed item given by
other learners is shown in label A. Based on the viewed learning material, the
proposed recommender system generates a list of suggested learning materials
as shown in label C. The e-learning system provides link to quiz questions to
4
evaluate the learner’s knowledge as shown in label B. The quiz score is in turn
use by the proposed recommender system to calculate trust.
Fig. 1 A prototype of trust in an e-learning hybrid recommender system
5. CONCLUSION
In this paper, we have proposed a trust calculation that can be incorporated
in a hybrid filtering recommender system. Our proposed method utilizes the
existing system infrastructure used by the user either to sit for an evaluation or
received assessment by other users. The outcome of the evaluation or the
assessment by other users is then used to calculate the trust of a particular user.
The prototype of the trust in hybrid recommender system is currently being
tested with an e-learning system and the performance analysis as well as
benchmarking is scheduled for the future work.
REFERENCES
[1] Adomavicius, G., & Tuzhilin, A. (2005). Toward the Next Generation of Recommender Systems:
A Survey of the State-of-the-Art and Possible Extensions. IEEE Transactions on Knowledge
and Data Engineering, 17(6), 734-749.
[2] Azzedin, F., & Maheswaran, M. (2002). Towards Trust-Aware Resource Management in Grid
Computing Systems. 2nd IEEE/ACM International Symposium on Cluster Computing and the
Grid, Berlin, Germany, 452-457.
[3] Massa, P., & Avesani, P. (2004). Trust-Aware Collaborative Filtering for Recommender Systems.
On the Move to Meaningful Internet Systems 2004, LNCS 3290, Springer-Verlag, 492-508.
[4] Massa, P., & Bhattacharjee, B. (2004). Using Trust in Recommender Systems: An Experimental
Analysis. Trust Management, LNCS 2995, Springer-Verlag, 221-235.
[5] O'Donovan, J., & Smyth, B. (2005). Trust in Recommender Systems. Proceedings of the 10th
International Conference on Intelligent User Interfaces, San Diego, California, 167-174.
[6] Vozalis, E., & Margaritis, K. G. (2003). Analysis of Recommender Systems’ Algorithms.
Proceedings of the 6th Hellenic-European Conference on Computer Mathematics and its
Application, Athens, Greece.
[7] Ghauth, K. I., & Abdullah, N. A. (2010). Learning materials recommendation using good
learners’ ratings and content-based filtering. Educational Technology Research and
Development, 58(6), 711-727.
[8] Ghauth, K. I., & Abdullah, N. A. (2010). Measuring learner’s performance in e-learning
recommender systems. Australasian Journal of Educational Technology, 26(6), 764-774.
[9] Cabral, L., & Hortacsu, A. (2010). The Dynamic of Seller Reputation: Evidence from eBay. The
Journal of Industrial Economics, 58(1), 54-78.
5
TO-BE-RECORDED ANALYSIS
INSIDE DERIVATIVE CODE COMPILER
1ST MUHSIN SHODIQ 2ND BORIS GENDLER, 3RD UWE

Thai-German Graduate School of NAUMANN
Engineering1 and BINUS LuFG Informatik 12 : Software and
University2 Tools for Computational Engineering
1
Bangkok, Thailand RWTH Aachen
2
Jakarta, Indonesia Aachen, Germany
[email protected]
ABSTRACT
Algorithmic Differentiation (AD) is applied to numerical simulation programs in
order to produce code for the computation of various kinds of derivatives. A
data flow analysis called To-Be-Recorded (TBR) analysis aims to detect the set
of variables required in reverse section and values that can be lost because of the
overwriting in forward section for adjoint mode of AD. The implementation of
the TBR analysis uses a syntax-directed algorithm based on the following
attribute grammar. The expected result of TBR analysis is to get more efficient
generated code in terms of memory. We have implemented TBR analysis inside
our AD-tool called “Derivative Code Compiler (DCC)”. Depending on the
testing cases, the percentage of memory savings can be different. In the test case
illustrated in this paper, a memory saving of approximately 18% was achieved.
KEY WORDS
algorithmic differentiation, adjoint mode, to-be-recorded, derivative code
compiler
1 INTRODUCTION
AD is a family of methods for obtaining the derivatives of functions
computed by a program. There are two methods in AD, tangent linear mode and
adjoint mode. The tangent linear mode combines partial derivatives starting with
the input variables and propagating forward to the output variables. Moreover,
the adjoint mode combines partial derivatives starting with the output variables
and propagating backward to the input variables (see [2] for a detailed
discussion).
An implementation of algorithmic differentiation is the DCC, developed by
LuFG Informatik 12, Software and Tools for Computational Engineering
(STCE), RWTH Aachen.
The DCC allows the application of AD by code transformation. It
transforms the original code for y = F(x) into adjoint code (y, x(1), y(1)) = F(1)(x,
x(1),y(1)) for computing
y= F ( x)
x(1)+(∇ F (x ))(T ) . y (1)
y(1)=0
For given adjoints of a dependent and independent variables reverse mode
AD propagates adjoints backward through the Single Assignment Code (SAC). In
7
SAC, all left hand-side (LHS) variables are assigned only once and cannot appear
as LHS anywhere else in the code.
for j= n+ 1,. .., n+ p+ m
v j= x j (v i )i< j
for i< j and j= n+ p+ m ,... , n+ 1
∂x
v (1)i = v(1)i+ v (1) j⋅ j (v k )k < j
∂ vi
Equation (1)
The v(1)j are assumed to be initialized to y(1)j for j=n+p+1,...,n+p+m and to
zero for j=1,...,n+p. A forward evaluation of SAC is performed to compute all
intermediate variables whose values are required which values are required for
the adjoint propagation in reverse order. The elemental function in SAC are
processed in reverse order in the second part of Equation (1).
SAC’s are not built explicitly in practice. Approaches ensuring the
mathematical equivalence of the adjoint code to Equation (1) are taken instead.
The correctness of the arguments of all local partial derivatives in Equation (1)
is ensured by pushing original values of overwritten program variables (LHS of
assignments) onto a so called data flow reversal stack during an augmented
evaluation of the program (in the augmented forward section of the adjoint code
corresponding to the first loop in Equation (1) followed by restoring these values
prior to the evaluation of the corresponding adjoint assignments in the reverse
section of the adjoint code corresponding to the second loop in Equation (1).
The correctness of the adjoints in Equation (1) is ensured by setting the
adjoints of program variables on LHS of assignments to zero after the evaluation
of the corresponding assignments. Adjoint of local variables that are neither
inputs nor outputs of the given routine need to be initialized to zero.
To generate the derivative code, we extend all possible assignments with an
additional assignment, which calculates the derivative of the original allocation.
Every variable can be divided into active and passive. A variable is called active
if it depends on an independence variable and this variable affects a dependent
variable. Otherwise, it is called passive [2]. Therefore, we only need to extend
active variables to get a more efficient code generated and this division is done
by the activity analysis (see [6] for a detailed discussion). In addition, we also
need the stack to store the values which need to be saved prior to being
overwritten in adjoint mode. Again, this is not an efficient way (in terms of
memory) because we only need to store the value which is used in reverse
section. Therefore, TBR analysis [5] is needed to determine which variables
needed to stored in the stack.
Figure 2 shows a function with variables x as the independent variable and y
as the dependent variable. Without TBR analysis, it assumes all the assignments
to be active, meaning that all left-hand side program variables need to be
recorded. Figure 3 shows the code generation without TBR analysis for the
function f.c in adjoint mode.
8
1 double x, y, a, q;
2
3 q=a∗ a;
4 a=sin(x∗ y);
5 y=a ∗q;
Fig.1 Adjoint Model of y=F(x) Fig.2 simple function f.c

A variable q is detected as a passive variable. Therefore, the derivative of q
can be omitted. As depicted in Figure 3, only the value of variable y before
being overwritten in assignment at line 7 needs to be saved, because it is used in
reverse section in assignment at line 15. A variable a is also overwritten in
assignment at line 6. However, a is still passive in assignment at line 5 (it
becomes active after the second assignment). Therefore, the reverse section in
that assignment can be omitted. Without changing the expected result, 8
assignments can be saved if TBR analysis is applied as depicted in Figure 4.
1 double x, y, a, q;
2 double a1_x, a1_y, a1_a, a1_q;
3
4 //forward section 1 double x, y, a, q;
5 PUSH(q); q =a ∗ a; 2 double a1_x, a1_y, a1_a;
6 PUSH(a); a=sin(x∗ y); 3
7 PUSH(y); y=a∗ q; 4 //forward section
8 5 q=a∗ a;
9 //reverse section 6 a=sin(x∗ y);
10 POP(y); 7 PUSH(y); y=a ∗q;
11 a1_q=a∗ a1_y; 8
12 a1_a=q∗ a1_y;
9 //reverse section
13 POP(a);
10 POP(y);
14 a1_y= x∗cos(x ∗y)∗ a1_a; 11 a1_a=q ∗a1_y;
15 a1_x=y ∗cos(x∗ y)∗a1_a; 12 a1_x=y ∗cos(x ∗ y)∗ a1_a;
16 POP(q);
17 a1_a =a ∗ a1_q;
18 a1_a=a1_a a ∗ a1_q;
Fig.3 Code generation of function f.c Fig.4 Code generation of function f.c
without TBR analysis with TBR analysis
2. SYNTAX-DIRECTED TBR ANALYSIS
A. Data Flow Analysis

Data flow analysis extracts information about properties of run-time values.
Static program analysis have no knowledge of data or behavior of the program at
run time. Hence, most static analysis are undecidable, conservative over
9
approximations is the best approach for generating information to obtain safe
results.
Data flow analysis depends on the internal representation of programs, as
discussed in classical literature on compiler theory (see, in particular, [1]). Data
flow analysis attempts to obtain particular information at each point in a
procedure. In principles, each point has entry state (-) and exit state (+).
B. TBR Analysis
TBR analysis aims to detect the set of variables used in reverse section and
values that can be lost because of being overwritten in forward section.
Therefore, we can decide which values to be recorded in forward section.
AdjU(n) is the set of variables that used in the adjoint code or reverse
section associated with a non-terminal n, we can define as :
{
a :V =e AdjU (e)∖ { V } ,if active (e)
∅ ,if ¬active
for non-linear operation, we only consider multiplication as the one of that
operation. Division are decomposed according to :
a
= a . rec(b)
b
and where the unary function rec(b) is covered by production rule (P6).
AdjU analysis for Semantic Language (SL) programs can be implemented
as a syntax-directed algorithm based on the following attribute grammar [6]:
(P4) e l :e r1 L e r2 (P6 ) e l : F (e r) , (rec∈ F )
Var (e l )= Var(e r1)∪Var (er2 ) Var (e l )= Var (e r)
AdjU (e l )=AdjU (e r1)∪ AdjU(e r2 ) Var (e l )= Var (e r)
(P5) e l :e r1 N e r2 , (N =*) (P7 ) e :V

Var (e l )= Var(e r1)∪Var (er2 ) Var (e)=V
AdjU (e)=∅
{
Var (e rl )
if active (e r1 )∧active(e r2 ) (P8) e : C
r1 r2
AdjU (e l )= AdjU (e )∪ Var(e ) Var (e)=∅
if active (e )∧¬active (e r2 )
r1
AdjU (e)=∅
Var (e r1 )∪AdjU (e r2)
if ¬active(e r1 )∧active (e r2)
where
{
true ,
active (e)= if ∃v ∈Var(e): v∈Active(−a)
false ,
otherwise
and a denotes the assignment containing e as a sub-expression of its right-hand
side.
Next, we collect information about the set of variables that can be
overwritten (LHS variables) inside the given code fragment, define as Kill.
a: V = e Kill 
a:= V
10
Kill analysis for SL programs can be implemented as a syntax-directed
algorithm based on the following attribute grammar [6]:
(P1) s :(a∣b∣l) (P9) b : IF (r ){s}
Kill( s)=Kill (a∣b∣l) Kill(b)= Kill(s )
AdjU (s)=AdjU (a∣b∣l ) AdjU (b)=AdjU (s)
l r
(P2) s :(a∣b∣l ) s (P10) l :WHILE (r ){s}
l r
Kill( s )= Kill(a∣b∣l )∪AdjU (s ) Kill(l )= Kill(s )
l r r
AdjU (s )=AdjU (a∣b∣l) \ Kill(s )∪AdjU (s ) AdjU (l )=AdjU (s)
After the set of required variables used within the reverse section of the
ajdoint upstream code is propagated (AdjU) and the set of variables that can be
overwritten (Kill). Therefore, Req is needed to build the set of variables that can
be overwritten and also needed in reverse mode, where Req(-n)/Req(+n) denotes
the set of required variable right before/after the code fragment corresponding to
a non-terminal n.
Req analysis for SL programs can be implemented as a syntax-directed
algorithm based on the following attribute grammar [6]:
(P1) s :(a∣b∣l) (P3) a :V =e ;

Req(−a∣−b∣−l )=Req (−s) Req(+a)=(Req (−a)∖{V })∪ AdjU(a)
Req(+s )= Req(−a∣−b∣−l )
(P9) b : IF (r ){s}
l r Req(−s )= Req(−b)
(P2) s :(a∣b∣l) s
l
Req(+b)=Req (+s)∪Req (−b)
Req(−a∣−b∣−l )=Req (−s )
r
Req(−s )=Req (+a∣+b∣+l ) (P10) l :WHILE (r ){s}
Req(+sl )=Req (+sr ) Req(−s )= Req(−l)∪AdjU (s )
Req(+b)=Req (+s)∪Req (−b)
Finally, variables that need to be recorded before being overwritten, can be
decided as :
a :V =e ;
{
TBR V ,if V ∈ AdjU(e) ,or
V ∈Req(−a)
3. TESTING AND RESULT

The testing has been done on a PC with Intel Xeon X7350 2.93 GHz, 64GB
of RAM and reference’s code that is implemented for real life simulation in an
area of machine engineering as the original function (it has 8842 lines of code
and 6699 assignments). The first derivative code generation of adjoint mode
with and without TBR analysis from the reference code are used for the testing
purpose.
As depicted in Table 1, the generated code needs 6126 floating points on the
stack without TBR analysis. And if TBR analysis is enabled in DCC, it only
needs 5044 floating points on the stack. Hence, 1082 floating points can be
saved on the stack. We already know that the size of double in c/c++ is 8 bytes.
Therefore, in this case 8656 bytes of memory usage can be saved if TBR
analysis is enabled. On the other hand, with TBR analysis enabled, the DCC
requires extra time to analyze the information and additional memory to store
additional information for the analysis to get a more efficient generation of
derivative code. In this test case, DCC requires 8 minutes and 34 seconds longer.
11
The time is spent a lot in activity analysis, because we need a fixed-point
iteration for each loop node (see [6] for a detailed discussion) and as explained
previously, we need the activity information for each variable to carry out the
TBR analysis. Based on Table 1, the implementation of the TBR analysis only
needs 12 seconds of the total time.
Tab.1 comparison of memory usage, number of assignments and generating time
Generating
Counter Size of Number of
Analysis Time
of Stack Stack assignments
(DCC)
- 6126 49008 bytes 76887 5 seconds
8 minutes, 27
Activity 6126 49008 bytes 74325
seconds
8 minutes, 39
Activity + TBR 5044 40352 bytes 69937
seconds
REFERENCES
[1] A. Aho, M. Lam, R. Sethi, and J. Ulman. Compilers. Principles Techniques, and Tools (Second
Edition). Addison-Wesley, Reading, MA, 2007.
[2] C. H. Bischof, P. D.Hovland, and B. Norris. On the Implementation of Automatic Differentiation
Tools. ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program
Manipulation, 2002.
[3] A. Griewank and A. Walter. Evaluating Derivatives. Principles and Techniques of Algorithmic
Differentiation (Second Edition). SIAM, Philadelphia, 2008.
[4] A. Griewank and A. Walther. Implementation of Check Pointing for the Reverse or Adjoint
Mode of Computational Differentiation. Technical report, Institute of Scientific Computing,
Technical University Dresden, 2000.
[5] L. Hascӧet, U. Naumann, and V. Pascual. “To Be Recorded” Analysis in Reverse-Mode
Automatic Differentiation. Future Generation Computer Systems, 21:1401–1417, 2005.
[6] U. Naumann. Derivative Code Compilers. LuFG Informatik 12: Software and Tools for
Computational Engineering, Department of Computer Science -RWTH Aachen University D-
52056 Aachen, Germany.
[7] M. Fӧrster. Verification of Data Dependencies in Derivative Code. Master's thesis, Software &
Tools for Computational Engineering, RWTH Aachen, 2009.
12
ADOPTING DOMAIN KNOWLEDGE TO ENHANCE LEXICAL
CHAIN FOR UNSUPERVISED WORD SENSE DISAMBIGUATION
WEI JAN, LEE EDWIN MIT

Universiti Malaysia Sarawak, Universiti Malaysia Sarawak,
ABSTRACT
This paper represents an idea of integrating approaches for disambiguating the
word sense of a text. It combines two knowledge sources of Word Sense
Disambiguation (WSD) approaches so that a better approach to be introduced to
WSD research area. The Lexical Chain approach will be adopted together with
the Domain knowledge to define word meaning. In order to show the efficiency
of the adopting another approach, the Lexical Chain approach will be discussed
in details so that the weakness of this approach could be covered by adopting the
domain knowledge. The result proved that by adopting the domain knowledge
into Lexical Chain approach increased the performance.
KEY WORDS
Word Sense Disambiguation, Lexical Chain, Domain, Wordnet 2.0
1. INTRODUCTION
Lexical chain is a process of relating words semantically by creating chains
that represent different lexical cohesion through the text [11]. It will
automatically find relations between words through the semantic relationships
that defined in machine readable dictionaries.
Lexical chain was first introduced by Morris and Hirst [7] to identify the
structure of text using the relations between words. This approach chained the
related words in the text according to the categories, index entries and pointers
in Roget Thesaurus. Morris and Hirst argued that since lexical cohesion is a
result of a unit text that related about a topic, hence each word should contribute
a certain weight to each other. However, due to the lack of machine readable
dictionary, Morris and Hirst forced to generate the chain manually, by hand.
After the release of WordNet [3], a number of Word Sense Disambiguation
(WSD) researches [4, 5, 11] focusing on lexical chain were done over the years.
Hirst and St-Onge [5] first implemented the lexical approach using WordNet. In
this approach, there are three types of relation between words which are defined
as extra-strong (word and its repetition), strong (related by Wordnet semantic
relations) and medium-strong relations (the synset related to words is more than
one level in taxonomy). Different weights are assigned to the chain according to
the type of relation that related the words. However, this approach applied greed
disambiguation process where the sense of the words was defined at the moment
when it was inserted into the chain, which may lead to misinterpretations works.
Hence Barzilay and Elhadad [12] proposed a non-greedy lexical chain
approach which finds every possible relation that related between synsets of the
words. It employed the global strategy where only the highest scoring lexical
chains taken to define the senses of words. However, this approach does not
13
applied linear time concept which is then lead to exponential number of lexical
chain words [8].
Silber and McCoy [6], Galley and McKeown [11], and Chen et.al [8]
proposed a linear time lexical chain based on Barzilay and Elhadad works. Their
approaches can be decomposed into three steps, which is collecting the senses of
every candidate words, then finding relations between the candidate words
through the semantic relations that defined in WordNet, and lastly building a
lexical chain and select the highest scoring lexical chain to define the senses.
Chen et.al approach performed the best among the other two linear time
lexical chain mentioned before. This approach will be described in next section
as a work based on that approach is done here.
2. LEXICAL CHAIN APPROACH

Lexical chain is an approach which semantically relates the words
according to the information provided by the knowledge source adopted, which
is Wordnet 2.0 in this case. The general steps of getting a lexical chain can be
decomposed into two steps: collecting all information (synsets) of the candidate
words (noun) of the text, building the semantic graph by finding all possible
interpretations of the candidate words.
A relation between candidate words is established only when the candidate
words shared the same synset in any semantic relation1 that provided in Wordnet.
In Figure 1 shows an example of a text for the word committee, a semantic
relation established between committee and its context word subcommittee and
Figure 2 shows the semantic graphs of both words.
Daniel personally led the fight for the measure, which he had watered down
considerably since its rejection by two previous Legislatures, in a public hearing
before the House Committee on Revenue and Taxation. Under committee rules,
it went automatically to a subcommittee for one week.
Fig.1 Lexical Chain of the word committee (words in bold)
Fig.2 Semantic Graphs of committee and subcommittee
Once a relation established, a weight scheme will be assigned to the

semantic edge which connecting the candidate words. The weight scheme varies
according to few conditions such as the distance between the connected words
1
Semantic relationship such as synonym, hypernym, hyponym, holonymy, meronymy and etc
14
and the type of semantic relation established. In this approach, Chen et.al [8]
synset weighting idea, lexical stability was adopted. Lexical stability is a
measurement of weighting the synsets belong a word to define the reliability
word sense. The reliable of the word sense depends on the polysemy rate of the
word.
The lexical stability is calculated using Formula (1) [8] where i represents
the i-th word sense of word w and |w| represents the number of senses of the
word. Therefore, the higher number of senses of a word, the lexical stability of
the word sense getting lower. For every sense of the candidate word, the lexical
stability will be calculated.
1
1
1 log| |
The weight of each semantic edge that established was calculated by using
Formula (2). Given the i-th sense of the target word, wp, is related with j-th sense
of the neighbor word, wq, the semantic edge weight score, will be
calculated by multiplying their lexical stability with rk which denotes the weight
of the semantic relation which shown in Table 1[8]. The relation weight scheme
varies according to the type of the semantic relations and also the distance
between words. The further the distance between two words, the smaller weight
is assigning to the semantic edge and prevent the words link from too far away
in the text. Window size denotes the distance between words.
After computing all sense semantic edge scores, summing the semantic edge
weight scores with each sense of the every candidate word, the sense with the
highest sense score will be taken as the most likely sense in that particular text.
Tab.1 Semantic Relations Weight Scheme
Semantic Relation window size ≤ 20 20 < window size ≤ 40
synonym 1.5 1.0
hypernym 0.9 0.4
hyponym 1.2 0.5
holonymy & meronymy 0.9 0.4
other relations 0.7 0.2
2.1 Problems Encountered

However, there are few problems encountered by this lexical chain
approach. As mentioned earlier, every related synset that found related through
the semantic relations of Wordnet will be inserted into the lexical chain.
However, most of the times, the synsets are related to each other through an
abstract synset in Wordnet noun taxonomy which is shared by a lot of synsets.
As shown in Figure 1, committee does not only related to subcommittee, but
also legislatures and public. However if one searching through the Wordnet
noun taxonomy, the relation that established between these words was shared a
common synset which is almost at the top of their noun taxonomy hierarchy2.
2
The higher concept in hierarchy shared by words, the lower similarity found
15
In order to prevent the words related to each other with high level synset in
Wordnet noun taxonomy, researchers tended to restrict the level of sense
hierarchy for mapping. In fact, Chen et.al [8] proved that by limiting the sense
depth to one, it gave the best result of lexical approach. With smaller sense
depth, the relation that established between words are more reliable because the
distance between related words closer in the Wordnet noun taxonomy.
2.2 Adopting Domain Knowledge in Lexical Chain

In this approach, instead of only relying on the semantic relations that
provided by the Wordnet, the domain of each related synset plays as the decision
factor, to decide how likely the synsets are related to each other. Domain labels
are another way of finding the semantic relations among word senses [2]
because a domain may include the synsets which are in different syntactic
categories 3 , senses from different sub hierarchies, and reduces the level of
polysemy of a word. Table 2 shows some of the domains distributed across the
WordNet.
Tab.2 Some Domains Distribution in WordNet
Domain #Synset Domain #Synset Domain #Synset
Factotum 36820 Biology 21281 Earth 4637
Psychology 3405 Architecture 3394 Medicine 3271
Economy 3039 Alimentation 2998 Administration 2975
Chemistry 2472 Transport 2443 Art 2365
Even though the sense of level was restricted as one, lexical chain
approaches still facing a problem in defining the semantic likely between related
words. Hence domain knowledge is applied here as a decision point of the
semantic relation that established between words since domains show another
way of semantic relation between words.
In this approach, for every related synset, the domains of both synsets of the
target word and the related word will be retrieved and compared. If both words
are annotated as the same domain group, it denotes the semantic relation
between both words is giving a higher reliable than those words that shared
same synset but annotated as different domain group.
For instance, committee#1 was annotated as domain label
ADMINISTRATION and the domain label for subcommittee#1 also annotated as
domain label ADMINISTRATION, therefore this chain remains in the WSD
process. However, for legislature#1 and public#2 which were annotated as
POLITICS and FACTOTUM are discriminated from the chain.
Formula (3) is an extension version of semantic scheme weighting method
from Function (2) which involving domain score, , (which can
calculate by using Formula (4)) as decision point maker. Given D denotes the
domain label, Dom(s) denotes the domain set of the synset as one synset could
have been annotated more than just one domain label. Notice that if the related
words were annotated as domain label FACTOTUM by Wordnet domain, the
semantic edge weight will be assigned as zero and the relation is discriminated
3
Wordnet categorized the Noun, Verb, Adjective and Adverd into four different Syntactic
Categories. These categories do not interact to each other.
16
from the lexical chain. Domain label FACTOTUM is a general domain label for
the synsets which cannot be annotated to any other domain group in Wordnet.
Hence domain label FACTOTUM can be seen like a “placeholder” for all other
domain labels [1]. Therefore even the same synset shared, it does not prove the
reliability of the relation.
Finally, sense score will be calculated by using Formula (2) with the
semantic edge weight measured by Formula (3).
, ,
3
0,
1
, , 4
| |
3. EVALUATION RESULT
In this section, several experimenting results of the proposed approach will
be discussed. The testing is carried out by using the concordance corpus,
SemCor4 which is extracted from the Brown Corpus.
In order to perform a comparison between other lexical chain approaches,
Chen et.al approach was implemented. The reason of picking on Chen et.al is
because among all the proposed lexical chain approaches, Chen et.al method
produced the best result.
However unlike Chen et.al approach, the proposed approach is only mainly
focus on disambiguating noun only. In the task of disambiguating, the proposed
approach is discussed without domain, and with domains for disambiguates the
noun. Table 3 shows the results of each of the approaches.
As shown in Table 3, the accuracy of disambiguating increased when the
domain knowledge was adopted into the convention lexical chain approach.
Hence it proved by adopting domain as a decision factor relief the noise of the
reliable of the semantic between words and improves the approach.
During the experiment, if domain score was taken only as a contribution to
the semantic edge score and without discriminating the semantic relation, the
accuracy drops if compared to the proposed method, but still slightly better than
Chen et.al approach.
Tab.3 Semantic Relations Weight Scheme
Approach % Approach %
Chen et.al 67.5 Proposed Method with Domain 72.8
Proposed Method 69.2 Proposed Method with Domain (no discrimination5) 68.2
4
SemCor corpus is available on this website, http://www.cse.unt.edu/~rada/downloads.html.
SemCor is a composition of 352 documents, in which 186 documents are tagged with all the
information (noun, verb, adjective, and adverb), while 166 documents are only tagged for verb only.
5
This approach does not discriminate any member of the chain. The domain score only acts as a
supporting score to the chain.
17
4. CONCLUSION
In this paper, an enhanced version of unsupervised WSD approach was
proposed and the result of disambiguation process was increased significantly.
By simply adopting the domain knowledge of each synset that provided by
Wordnet into the lexical chain approach, the noise that interferences the
reliability of the semantic relation was much discriminated, and a better
performance of noun disambiguating process was introduced.
However, in this approach, the domain was taken without checking the
reliability of the domain to be assigned to the particular word. The reliability of
the domain depends on the text domain and the context words. In the future,
more reliable of domain score should be calculated instead of only taking
account the distance of words as proposed above.
REFERENCES
[1] A.Cliozzo, B.Magnini, and C.Strapparava, “Unsupervised domain relevance estimation for word
sense disambiguation”, SENSEVAL-2 Second International Workshop on Evaluating Word
Sense Disambiguation System. Toulose, France: in press, 2001.
[2] B.Magnini, C.Strapparava, G.Pezzulo, and A.Gliozzo, “Using Domain Information for Word
Sense Disambiguation,” In Proceeding of Senseval-2 Workshop, Association of Computational
Linguistics, pp. 111-115. Toulouse, France, 2002.
[3] C.Fellbaum, Wordnet: An Electronic Lexical Database, The MIT Press, 1998.
[4] F.Vasilescu, P.Langlais, G.Lapalme, “Evaluating Variants of the Lesk Approach for
Disambiguating Words,” In Proceeding of the Conference of Language Resource and
Evaluations (LREC 2004), 2004.
[5] G.Hirst, D.S.O. , “Lexical Chains as Representation of Context for the Detection and Correction
of Malapropisms,” In Christian Fellbeum,editor, Wordnet:An Electronic Lexical Database, pp
305-332. The MIT Press, 2004.
[6] H.G.Silber, K.F.McCoy, “Efficiently Computed Lexical Chains As an Intermediate
Representation for Automatic Text Summarization,” Association for Computational
Linguistics , pp. 487-496, 2002.
[7] J.Morris, G.Hirst, “Lexical Chains As Representation of Context for the Detection of the
Structure of Text,” Computational Linguistics , pp. 21-48, 1991.
[8] J.P.Chen, J.Liu, W.Yu, P.Wu, “Combining Lexical Stability and Improved Lexical Chain for
Unsupervised Word Sense Disambiguation,” Second International Symposium on Knowledge
Acquisition and Modeling, 2009.
[9] L.Bentivogli, P.Forner, B.Magini, E.Pianta, “Revisiting the Wordnet Domain Hierarchy:
Semantic, Coverage and Balancing,” COLING 2004 Workshop on "Multilingual Linguistic
Resources", 2004 .
[10] M.Brunzel, M.Spiliopoulou, “Domain Relevance on Term Weighting. Natural Language
Processing and Information Systems” , pp. 427-432, 2007.
[11] M.Galley, K.McKeown, “Improving Word Sense Disambiguation in Lexical Chain,” In
Proceeding of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003).
Acapulco, Mexico, 2003.
[12] R.Barzilay, M.Elhadad, “Using Lexical Chains for Text Summarization,” In Proceeding of the
ACL Workshop on Intelligent Scalable Text Summarization, 1997.
18
WORD AND SPEAKER RECOGNITION SYSTEM ON MATLAB
TAN SHWU FEI MOHAMMAD AWAN

Universiti Teknologi PETRONAS Universiti Teknologi PETRONAS
ABSTRACT
A system which combines user dependent Word Recognition and text dependent
speaker recognition is described. Word recognition is the process of converting
an audio signal, captured by a microphone, to a word. Voice Activity Detection
(VAD), Spectral Subtraction (SS), Mel-Frequency Cepstrum Coefficient
(MFCC), Vector Quantization (VQ), Dynamic Time Warping (DTW) and k-
Nearest Neighbour (k-NN) are methods used in word recognition part of the
project to implement using MATLAB software. For Speaker Recognition part,
Vector Quantization (VQ) is used. The recognition rate for word and speaker
recognition system that was successfully implemented is 87.04% for word
recognition while for speaker recognition is 64.81%.
KEY WORDS
Word Recognition, Speaker Recognition, Voice Activity Detection, Spectral
Subtraction, Mel-Frequency Cepstrum Coefficient, Dynamic Time Warping, k-
Nearest Neighbour, Vector Quantization
1. INTRODUCTION
By using speech to communicate in our daily life, it becomes very simple
until humans tend to forget how inconsistent a signal speech is. Word and
Speaker recognitions are becoming more and more important in allowing or
denying access to restrict data or facilities [1]. Word recognition system is a
system that recognizes a word. Speaker recognition system is a system that
recognizes who the speaker is. Word recognition means that the computer can
take dictation but do not understand what is being said. Speaker recognition is
related to Speech recognition [2]. Instead of determine what was said, it finds
out who said it.
2. BACKGROUND STUDY
There are five main components that are needed to be passed through to
recognize a word as shown in Figure 1. First, a reference speech patterns are
stored as speech template which is called database. At another side, a speaker
speaks to a microphone and linked with an analog-to-digital converter to
digitally encode the raw speech waveform. Then, the program performs
recognition to separate speech from non-speech after that speech improvement
by reducing noise and followed by feature extraction. Then, the preprocessed
signal is used for the recognition algorithm. Once the users’ speech sample is
preprocessed by MATLAB, the users’ speech is compared to the stored
reference patterns. Lastly, the best match is chosen from the pattern matching
algorithm which computes a measurement between the preprocessed signal of
the users’ speech and the entire stored database [2].
19
Figure 1. How the Word Being Recognized [2]
Every human has different voice vocal. Using this important property, we
are able to recognize a friend over a telephone. No matter how we mimic the
voice of someone, there are still some different in energy, pronunciation and etc.
Speaker recognition is the process of recognizing who is the speaker based on
the individual information included in speech waves.
Speaker Recognition can be grouped in two categories: Speaker
Identification and Speaker Verification. Speaker identification is a process of
finding the person’s identity by matching the speech pattern on a set of known
speaker’s voice in the database [3]. The system will choose the best matching
speaker. Speaker verification is a process of accept or reject the person’s voice
compare with the voice in the database. Speaker identification with text-
dependent is a method where the speakers are required to speak a specific word
while speaker identification with text-independent method speaker is not
required to speak a specific word.
Speaker identification text-dependent is described. Figure 2 shows the
basic structure of speaker identification. In speaker identification, M speaker
models are examined at the same time. The most likely one is chosen and the
decision will be one of the speaker’s ID in the database, or will be “none of the
above” if and only if the matching score is below some threshold.
Figure 2. Basic Structure of Speaker Identification
20
3. PROBLEM STATEMENT
There are a lot of existing word recognition or speaker recognition
standalone systems, however there are little research on combined word and
speaker recognition. With the word and speaker recognition system, security
feature using speaker recognition can be implemented on top of word
recognition-based applications.
4. OBJECTIVES & SCOPE OF STUDY

The main aim of this research is to produce an algorithm with particular
method to work on the word and speaker recognition system, by enhancing the
audio processing techniques. The objectives are, to understand the speaker
recognition and word recognition methods, to design and develop the speaker
recognition and word recognition algorithms on MATLAB, to further improve
the efficiency, robustness and reliability of the system.
5. METHODOLOGY
First of all, for the whole recognition system the first step is to record the
voices of the user for the systems. In this work, there are voices from 6 speakers,
four female and two male while the word tested are: “One”, “Two”, “Three”,
“Four”, “Five, “Six”, “Seven,”, “Eight” and “Nine”. This database is kept in a
folder name Train. This step is called enrolment phase. Enrolment phase is to get
the speaker models or voiceprints for speaker database. For almost all the
recognition systems, training is the first step. After a month or longer, the voices
of these speakers are recorded again and kept in a folder name Test. These sound
files were recorded to take into account the many changes that may occur in a
speaker’s voice, for example health, time and etc.
When the speaker speaks to the microphone, MATLAB reads the .wav
audio file using “wavread”. The program performs front-end processing, VAD
then MFCC to get the coefficient. The MFCC coefficients are then put into its
respective cell. The task is repeated for a number of times depending on the
number of audio file samples (number of speakers) for the particular word. The
cell is saved as .mat file for later processing. These are the processes of building
a database. In the recording steps for training database, a silent environment is
required to make sure the database produced with as minimal noise and
interferences as possible.
For this work, the system will first recognize the word and from the word
the speaker uttered, the system will look for the speaker. The audio
authentication process contains two processing stages: Front-end preprocessing
for feature extraction consists of Voice Activity Detection (VAD) to crop out the
voice part of the signal referring to the paper from L. R. Rabiner [4], Spectral
Subtraction (SS) to enhance the signal and reduce noise referring to the paper
from S. F. Boll [5], and Mel-Cepstrum Coefficient (MFCC) to get the
coefficients of the signals referring to the paper written by Md. Rashidul Hasan
[6]. Whereas the back-end processing consists of Dynamic Time Warping
(DTW) from P.Senin [7] and M.W. Kadous [8], k-Nearest Neighbour (k-NN), as
21
well as Vector Quantization (VQ) from M.N.Do [9] and Sookpotharom [10].
They are all used to obtain the end results of word and speaker recognition.
6. RESULT AND DISCUSSION

Word and speaker recognition are inherent of a database, which stores
information used to compare the test word and speaker against a set of trained
words and speakers’ voices. Ideally, storing as much database is advised because
it can give higher accuracy, but realistically this cannot be achieved. It would be
unfeasible and impractical to stores a number of feature vectors as it require a
very large memory. There are 6 people’s voices utter words: “One”, “Two”,
“Three”, “Four”, “Five”, “Six”, “Seven”, “Eight” and “Nine” which are 4 female
and 2 male.
DTW method was chosen among the other methods to perform the word
recognition needed. The number of nearest neighbours used is 6, which is most
suitable for the amount of database used. This value can be changed if a larger
set of database is used. The most probability appear among the 6 nearest
neighbours will be the result.
In this research, the back end processing used are DTW and VQ. For word
recognition, when the VQ alone is tested, the accuracy is 70.37% while DTW is
used alone the accuracy is 81.84%. When both DTW and VQ combined, the
value achieved is 87.04%. It showed that, there is improvement of accuracy
when both methods are combined. For speaker recognition, if DTW work alone,
the recognition rate is 38.89%. The accuracy using VQ method has the
recognition rate slightly higher than DTW method which is 42.59%.
Due to the system is combination of word and speaker recognition system,
the system is designed by running word recognition first as the recognition rate
is higher and followed by speaker recognition from the particular word database.
The accuracy for speaker recognition has improved to 64.81%.
Without the word recognition, the speaker recognition is carried out by
testing the input signal’s MFCC coefficient with the codebooks that contain all
the numbers (1-9 by all speakers) in the database. With the help of word
recognition which recognizes the word tested, the MFCC coefficient is now
compared with only the codebook with the number recognized by the word
recognition. (For example, if number 3 is recognized in the word recognition
process, the MFCC coefficient is now compared with only the number 3
codebook.)
Table 1: Recognition Rate
Recognition Rate
Word Recognition
VQ 70.37%
DTW 81.84%
VQ + DTW 87.04%
Speaker Recognition
VQ 42.59%
22
DTW 38.89%
Word & Speaker Recognition
Word Recognition (VQ + DTW) 87.04%
Speaker Recognition (VQ) 64.81% (Improved)
8. CONCLUSION & RECOMMENDATION

The methods used in word and speaker recognition system are being
explored. This research involves two main parts: Word recognition and Speaker
recognition. The main tool used in is work is MATLAB. Training and Testing
are the important stages to perform. With accurate training and testing stage the
result will be more accurate. When recording the database, the environment
must be silent enough to improve on the accuracy of the recognition rate.
In this work, many methods are used to implement the word recognition
namely VAD, SS, MFCC, DTW, VQ and KNN. MFCC is the most popular
method in pattern recognition and for speaker recognition, VQ is used.
The advantage of this work is focused on the additional security provided
by this Word and Speaker Recognition System. It can also be used by the disable
people. For example in the lift, they can utter the number of the level they would
like to reach instead of pressing the button of the lift which is hard to be reached
by them. This research can be used together with PIC microcontrollers or Digital
Signal Processing development kits then it can be used widely in the real world.
REFERENCES
[1] M. R.Schroeder, “ Computer Speech Technology”. Second Edition, Boston New York, 1999.PP
41-45.
[2] R. D. Peacocke, “An Introduction to Speech and Speaker Recognition”. IEEE Press, Bell
Northern Research, 1990. PP 26-33 .
[3] T.W Keong, “Speaker Recognition” [Online]. Available:
sst.unisim.edu.sg:8080/dspace/.../314/.../09_Thang%20Wee%20Keong.doc [Accessed: Sept. 13,
2010]
[4] L.R.Rabiner, “An Algorithm for Determining the Endpoints of Isolated Utterances”. The Bell
System Technical Journal, Ferbruary 1975.PP 297-315.
[5] S. F. Boll, “Suppression of Acoustic Noise in Speech Using Spectral Subtraction” in Proc. IEEE
Int. Conf. on Acoustics, speech, and signal processing, Apr. 1979, vol. 27. PP 113.
[6] Md. Rashidul Hasan, Mustafa Jamil, Md. Golam Rabbani, Md. Saifur Rahman. "Speaker
Identification using Mel Frequency cepstral coefficients". 3rd International Conference on
Electrical & Computer Engineering ICECE 2004, 28-30 December 2004, Dhaka, Bangladesh.
[7] P. Senin, “Dynamic Time Warping Algorithm Review”. Information and Computer Science
Department, University of Hawaii, USA, December 2008. PP 3-9
[8] M.W. Kadous, “Dynamic Time Warping”, [Online]. Available:
http://www.cse.unsw.edu.au/~waleed/phd/html/node38.html [Accessed: Oct,9 2010].
[9] M. N. Do, Digital Signal Processing Mini-Project: An Automatic Speaker Recognition System.
Available: http://lcavwww.epfl.ch/~minhdo/asr_project/ [Accessed: March, 23 2011]
[10] Sookpotharom, S. Manas "Codebook Design Algorithm for Classified Vector Quantization".
Bangkok University, Pathumtani, Thailand, 2000. PP 751-753.
23
DHTCACHE: A NOVEL STRUCTURED P2P-BASED
COOPERATIVE WEB CACHING SYSTEM
XIAO-JIN REN JING-YANG YU

Network Information Center College of Computer and
Henan University Information Engineering
Kaifeng, Henan, China Henan University
[email protected] Kaifeng, Henan, China
[email protected]
ABSTRACT
Current P2P Web cache is analyzed and a structured P2P-based cooperative web
caching system, namely DHTCache, is proposed. The underlying P2P routing
mechanism of DHTCache uses SA-Chord and the upper cache positioning
mechanism uses the URL-pathed index and lookup scheme. In this way, not
only performance problems caused by the heterogeneity among P2P nodes is
overcame, but also the characteristics of Web users to access is combined.
Simulations show that compared to the previous solutions, DHTCache can
achieve better lookup performance.
KEY WORDS
lookup, P2P, cache
1. INTRODUCTION
In recent years, Peer-to-Peer[1][2][3][4] technique is fast developed. P2P
technique has many merits in nature, for example, scalable, self-organizing, etc.
So, P2P client-end caching, have been proposed to utilize P2P technique to
improve client-end caching efficiency. These solutions can be categorized into
two types according to underlying P2P, unstructured P2P-based cooperative
caching system and structured P2P-based cooperative caching system. The
search performance of unstructured P2P system is better on the object of high
interest, degraded on the lower object, and some object in the system can even
not be found. These problems can be overcome by the structured P2P system.
But in the current structured P2P-based cooperative caching system, there is not
combination of the characteristics of Web users to access, and there are still
some problems, such as, a large overhead, low lookup performance, etc.
To solve the above problem, by analysis, the performance of P2P-based
cooperative caching system is directly determined by the underlying P2P routing
mechanism and the upper cache positioning mechanism. The organization form
of the underlying P2P system will directly affect the cache hit rate and response
delay. So, the SA-Chord[5], proposed in our previous work, is selected as the
underlying P2P routing mechanism of DHTCache. The nodes in SA-Chord can
dynamically adjust their routing table according to their resources status. So the
performance problem caused by the heterogeneity among P2P nodes is
overcome. In addition, to combine the characteristics of Web user to access, the
URL-pathed index and lookup scheme, proposed in PBCache[6] (a previous
work), is selected as the upper cache positioning mechanism. The performance
25
of system can be further enhanced by using the URL-pathed index and lookup
scheme.
In this paper, we design and implement a structured P2P-based cooperative
caching system, namely DHTCache. DHTCache has all the features of SA-
Chord[5] and PBCache[6], and has a better lookup performance. In section 2,
we introduce SA-Chord and PBCache. Section 3 we describe DHTCache.
Section 4 provides simulation results. Conclusions are given in section 5.
2. SA-CHORD AND PBCACHE

In SA-Chord, Each node can adjust the number of fingers in terms of
capacity itself dynamically. All routing nodes form a routing ring which is
responsible for routing all lookup requests. The average path length of SA-
Chord is ((2k-1)log2kR)/2k, where k is a system parameter and R is the number
of routing nodes.
Because the navigation path of web users carries valuable information about
user interests, In PBCache, an URL-pathed index and lookup scheme, is
designed. By using the URL-pathed index and lookup scheme, PBCache can
achieve better lookup performance and scalability.
3. SYSTEM DESCRIPTION
3.1 SYSTEM STRUCTURE

Fig.1 show the node structure of DHTCache. In DHTCache, Web browser
is the front-end user interface. Web browser can use the Microsoft Internet
Explorer or Firefox and other poplar browsers currently. Without any different
from other ordinary browsers, clients use the browser supported by DHTCache.
In DHTCache, the local Web cache is managed by a local agent. A node’s
cached content can be shared to other node by SA-Chord. By the underlying SA-
Chord platform URL Path Service provides the lookup query and the results of
SA-Chord query to the local agent. All routing information is provided by SA-
Chord. HTTP Service is used to share the local cached content. The URL-pathed
index and lookup scheme is provided by URL Path Service.
Fig.1 The node structure of DHTCache

Whenever the browser sends a URL query, the query will first be sent to the
local agent. Then the local agent will first check the local cache. If the object is
hit in the local cache, the object will be returned to the browser directly.
Otherwise, the local proxy forwards the query to the URL Path Service. URL
26
Path Service computes the URL of the query and sends it to SA-Chord. SA-
Chord will take over the query.
Once the object of the query is found, SA-Chord will return some
information of the Web object, such as location, etc, to the URL Path Service of
the node that sends the query. Then the information will be forwarded to the
Local Proxy. The Local Proxy sends directly the object information to the node
that can match the object information. Once the requested node receives such
object request, the requested node will query its local cache, and find out the
corresponding object. Then the requested node sends the object to the node that
request the object.
3.2 FUNCTION IMPLEMENT

DHTCache includes two main modules: SA-Chord module and cache
management module. The function of the cache management module includes
Local Proxy, URL Path Service and HTTP service. The main function of SA-
Chord module is to provide an efficient routing mechanism for upper layer
application. The work steps are as follow.
(1)After explorer of client sends a URL request, the request is sent to the
Local Proxy. The Local Proxy analyses the request. If the request is uncacheable,
the query is forwarded to source sever.
(2)The Local Proxy views the local cache whether the requested object is in
the local cache. If is in, the request is forwarded to (12).
(3)If there is not the requested object in the local cache, the request is
forwarded to the URL Path Service.
(4)The URL Path Service views the path home node table whether there is
similar to the requested URL path.
(5)If there is similar to the requested URL path in the path home table, the
request is forwarded directly to the relative path home node.
(6)If there is not, the URL Path Service sends the request to SA-Chord
module to lookup the Path1 home node of the URL.
(7)The relative path home node will be found out by SA-Chord.
(8)Path home node or home node checks its path home index and home
index. If the node is path home node and there is not the index of the requested
URL, SA-Chord will lookup next path home node or home node continually.
(9)The index of the requested URL, which is found out by path home node
or home node, is returned to the URL Path Service that sends the request.
(10)The returned information is sent to the Local Proxy.
(11)If the returned information is null, the Local Proxy will get the Web
object from source server. Otherwise, the Web object will be got from the
relative node according to the returned information. Then the copy of the Web
object will be cached in the local cache and the relative index will be published
to the relative path home node and home node.
(12)The Web object is sent to explorer of client.
4. SIMULATION RESULTS
We conduct trace-driven simulation experiments to evaluate the
performance of DHTCache. We use the real world web logs obtained from two
different proxy server of NLANR[7]. Tab.1 presents some trace characteristics.
27
Exploring the Variety of Random
Documents with Different Content
“Well, of all the crazy cunning!” The other girl simply gasped. “I
suppose there was some of the same concoction on the little bunch
of wild flowers that fell at your feet in the wood.... And I—I wouldn’t
believe you that anything happened—anything unusual that
morning! Sometimes—” Pemrose slowly shook her head
—“sometimes, Daddy says, I’m as wilful as an acid,” laughingly, “an
acid eating into salt—and it doesn’t do to be that way, eh?” The blue
eyes were mischievous, the lip corners penitent.
“But You! It was you who saved me. You won out against her—
with radio,” cried the victim of that unbalanced cunning. “It was you
—you who picked up my message—how I ever ticked it off, I don’t
know—remembered enough to tick it off! But you found out where I
was.” Una’s lip was trembling now—she dashed her hand across her
eyes, one bright drop, dislodged, fell upon the mountain grass. “It
was when Andrew saw your signal, your creamy sweater, waving
from the tree on Little Sister that he knew I was somewhere on that
mountain. Immediately he thought of that awful bank, that washout,
in the road—then he caught sight of us and climbed—oh! it was an
awful climb, too, right through the stream’s bed, for a short cut—was
just in time to head us off!”
“I know-ow.” Pemrose’s tone was very low. She caught an April
cowslip in the leather loop of her riding crop—there was silence for
five minutes. “But you—you yourself, were the real wonder,” she
said, then in the same low, thick voice. “Treff—Treff has never got
over talking of the way you came through—the clues you left behind
you—bits of your habit!”
“I carved them out with a knife I found—and she never saw me!”
Was it a new Una: the mischief, shrewdness—young strength—
leaking out of the eye-corners?
“And the bit—the little bit of your flower clock—oh-h! when I saw
that....” Pemrose’s hand pressed her lips.
“In case the rags might blow away that was! She—she was
watching me all the time; she’d have noticed if I tried to pin them
down—the flowers, she thought I was just playing with them!” More
mischief, more young strength, the lip corners curling up towards
the curly eyelashes—dark eyes twinkling.
“But how on earth did you find your feet, at all?” cried Pemrose
desperately. “It’s what I’ve always wanted to ask you. How did you
begin to come through—‘crash through’?”
“I think I found the Hidden Fire.” It was almost a whisper with
which Una bent to the Spring in the cowslip’s heart.
*** END OF THE PROJECT GUTENBERG EBOOK PEMROSE LORRY,
RADIO AMATEUR ***
Updated editions will replace the previous one—the old editions

will be renamed.
Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States
copyright in these works, so the Foundation (and you!) can copy
and distribute it in the United States without permission and
without paying copyright royalties. Special rules, set forth in the
General Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.
START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK
To protect the Project Gutenberg™ mission of promoting the

free distribution of electronic works, by using or distributing this
work (or any other work associated in any way with the phrase
“Project Gutenberg”), you agree to comply with all the terms of
the Full Project Gutenberg™ License available with this file or
online at www.gutenberg.org/license.
Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand,
agree to and accept all the terms of this license and intellectual
property (trademark/copyright) agreement. If you do not agree
to abide by all the terms of this agreement, you must cease
using and return or destroy all copies of Project Gutenberg™
electronic works in your possession. If you paid a fee for
obtaining a copy of or access to a Project Gutenberg™
electronic work and you do not agree to be bound by the terms
of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.
1.B. “Project Gutenberg” is a registered trademark. It may only

be used on or associated in any way with an electronic work by
people who agree to be bound by the terms of this agreement.
There are a few things that you can do with most Project
Gutenberg™ electronic works even without complying with the
full terms of this agreement. See paragraph 1.C below. There
are a lot of things you can do with Project Gutenberg™
electronic works if you follow the terms of this agreement and
help preserve free future access to Project Gutenberg™
electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright
law in the United States and you are located in the United
States, we do not claim a right to prevent you from copying,
distributing, performing, displaying or creating derivative works
based on the work as long as all references to Project
Gutenberg are removed. Of course, we hope that you will
support the Project Gutenberg™ mission of promoting free
access to electronic works by freely sharing Project Gutenberg™
works in compliance with the terms of this agreement for
keeping the Project Gutenberg™ name associated with the
work. You can easily comply with the terms of this agreement
by keeping this work in the same format with its attached full
Project Gutenberg™ License when you share it without charge
with others.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E. Unless you have removed all references to Project

Gutenberg:
1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project
Gutenberg™ work (any work on which the phrase “Project
Gutenberg” appears, or with which the phrase “Project
Gutenberg” is associated) is accessed, displayed, performed,
viewed, copied or distributed:
This eBook is for the use of anyone anywhere in the United

States and most other parts of the world at no cost and
with almost no restrictions whatsoever. You may copy it,
give it away or re-use it under the terms of the Project
Gutenberg License included with this eBook or online at
www.gutenberg.org. If you are not located in the United
States, you will have to check the laws of the country
where you are located before using this eBook.
1.E.2. If an individual Project Gutenberg™ electronic work is

derived from texts not protected by U.S. copyright law (does not
contain a notice indicating that it is posted with permission of
the copyright holder), the work can be copied and distributed to
anyone in the United States without paying any fees or charges.
If you are redistributing or providing access to a work with the
phrase “Project Gutenberg” associated with or appearing on the
work, you must comply either with the requirements of
paragraphs 1.E.1 through 1.E.7 or obtain permission for the use
of the work and the Project Gutenberg™ trademark as set forth
in paragraphs 1.E.8 or 1.E.9.
1.E.3. If an individual Project Gutenberg™ electronic work is

posted with the permission of the copyright holder, your use and
distribution must comply with both paragraphs 1.E.1 through
1.E.7 and any additional terms imposed by the copyright holder.
Additional terms will be linked to the Project Gutenberg™
License for all works posted with the permission of the copyright
holder found at the beginning of this work.
1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files
containing a part of this work or any other work associated with
Project Gutenberg™.
1.E.5. Do not copy, display, perform, distribute or redistribute

this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.
1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:
• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt
that s/he does not agree to the terms of the full Project
Gutenberg™ License. You must require such a user to return or
destroy all copies of the works possessed in a physical medium
and discontinue all use of and all access to other copies of
Project Gutenberg™ works.
• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.E.9. If you wish to charge a fee or distribute a Project

Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.
1.F.
1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite these
efforts, Project Gutenberg™ electronic works, and the medium
on which they may be stored, may contain “Defects,” such as,
but not limited to, incomplete, inaccurate or corrupt data,
transcription errors, a copyright or other intellectual property
infringement, a defective or damaged disk or other medium, a
computer virus, or computer codes that damage or cannot be
read by your equipment.
1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in
paragraph 1.F.3, the Project Gutenberg Literary Archive
Foundation, the owner of the Project Gutenberg™ trademark,
and any other party distributing a Project Gutenberg™ electronic
work under this agreement, disclaim all liability to you for
damages, costs and expenses, including legal fees. YOU AGREE
THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE, STRICT
LIABILITY, BREACH OF WARRANTY OR BREACH OF CONTRACT
EXCEPT THOSE PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE
THAT THE FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.
1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of
receiving it, you can receive a refund of the money (if any) you
paid for it by sending a written explanation to the person you
received the work from. If you received the work on a physical
medium, you must return the medium with your written
explanation. The person or entity that provided you with the
defective work may elect to provide a replacement copy in lieu
of a refund. If you received the work electronically, the person
or entity providing it to you may choose to give you a second
opportunity to receive the work electronically in lieu of a refund.
If the second copy is also defective, you may demand a refund
in writing without further opportunities to fix the problem.
1.F.4. Except for the limited right of replacement or refund set

forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’,
WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.
1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of
damages. If any disclaimer or limitation set forth in this
agreement violates the law of the state applicable to this
agreement, the agreement shall be interpreted to make the
maximum disclaimer or limitation permitted by the applicable
state law. The invalidity or unenforceability of any provision of
this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the

Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and
distribution of Project Gutenberg™ electronic works, harmless
from all liability, costs and expenses, including legal fees, that
arise directly or indirectly from any of the following which you
do or cause to occur: (a) distribution of this or any Project
Gutenberg™ work, (b) alteration, modification, or additions or
deletions to any Project Gutenberg™ work, and (c) any Defect
you cause.
Section 2. Information about the Mission

of Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new
computers. It exists because of the efforts of hundreds of
volunteers and donations from people in all walks of life.
Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project
Gutenberg™’s goals and ensuring that the Project Gutenberg™
collection will remain freely available for generations to come. In
2001, the Project Gutenberg Literary Archive Foundation was
created to provide a secure and permanent future for Project
Gutenberg™ and future generations. To learn more about the
Project Gutenberg Literary Archive Foundation and how your
efforts and donations can help, see Sections 3 and 4 and the
Foundation information page at www.gutenberg.org.
Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-
profit 501(c)(3) educational corporation organized under the
laws of the state of Mississippi and granted tax exempt status
by the Internal Revenue Service. The Foundation’s EIN or
federal tax identification number is 64-6221541. Contributions
to the Project Gutenberg Literary Archive Foundation are tax
deductible to the full extent permitted by U.S. federal laws and
your state’s laws.
The Foundation’s business office is located at 809 North 1500

West, Salt Lake City, UT 84116, (801) 596-1887. Email contact
links and up to date contact information can be found at the
Foundation’s website and official page at
www.gutenberg.org/contact
Section 4. Information about Donations to
the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission
of increasing the number of public domain and licensed works
that can be freely distributed in machine-readable form
accessible by the widest array of equipment including outdated
equipment. Many small donations ($1 to $5,000) are particularly
important to maintaining tax exempt status with the IRS.
The Foundation is committed to complying with the laws

regulating charities and charitable donations in all 50 states of
the United States. Compliance requirements are not uniform
and it takes a considerable effort, much paperwork and many
fees to meet and keep up with these requirements. We do not
solicit donations in locations where we have not received written
confirmation of compliance. To SEND DONATIONS or determine
the status of compliance for any particular state visit
www.gutenberg.org/donate.
While we cannot and do not solicit contributions from states

where we have not met the solicitation requirements, we know
of no prohibition against accepting unsolicited donations from
donors in such states who approach us with offers to donate.
International donations are gratefully accepted, but we cannot

make any statements concerning tax treatment of donations
received from outside the United States. U.S. laws alone swamp
our small staff.
Please check the Project Gutenberg web pages for current

donation methods and addresses. Donations are accepted in a
number of other ways including checks, online payments and
credit card donations. To donate, please visit:
www.gutenberg.org/donate.
Section 5. General Information About

Project Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could
be freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose
network of volunteer support.
Project Gutenberg™ eBooks are often created from several

printed editions, all of which are confirmed as not protected by
copyright in the U.S. unless a copyright notice is included. Thus,
we do not necessarily keep eBooks in compliance with any
particular paper edition.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.
This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg
Literary Archive Foundation, how to help produce our new
eBooks, and how to subscribe to our email newsletter to hear
about new eBooks.

ICSTE 2011 Proceedings of the 2011 3rd International Conference on Software Technology and Engineering 3rd Edition International Conference On Software Technology And Engineering 2024 Scribd Download

Uploaded by

Copyright:

Available Formats

ICSTE 2011 Proceedings of the 2011 3rd International Conference on Software Technology and Engineering 3rd Edition International Conference On Software Technology And Engineering 2024 Scribd Download

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ICSTE 2011 Proceedings of the 2011 3rd International Conference on Software Technology and Engineering 3rd Edition International Conference On Software Technology And Engineering 2024 Scribd Download

Uploaded by

Copyright:

Available Formats

Download the full version of the ebook at

ICSTE 2011 Proceedings of the 2011 3rd

Explore and download more ebook at https://ebookultra.com

Coastal engineering practice proceedings of the 2011

Proceedings of the 21st International Conference on

Bioinformatics and Biomedical Engineering Proceedings of

Information Technology in Geo Engineering Proceedings of

Proceedings of the International Conference on Education

Geological engineering proceedings of the 1st

Differential Geometry And Related Topics Proceedings of

Essentials Of Software Engineering 3rd Edition Frank Tsui

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

INFORMATION CONTAINED IN THIS WORK HAS BEEN OBTAINED BY THE AMERICAN

ASME shall not be responsible for statements or opinions advanced in papers or . . .

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Dear Distinguished Delegates and Guests,

The Organizing Committee warmly welcomes our distinguished

ICSTE 2011 is co-sponsored by University Putra Malaysia, Polytechnic

This proceeding records the fully refereed papers presented at the

The conference has solicited and gathered technical research

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

The high quality of the program – guaranteed by the presence of an

We are grateful to all those who have contributed to the success of

We hope you have a unique, rewarding and enjoyable week at ICSTE

With our warmest regards,

The Organizing Committees

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Conference General Chairs

Program Committee Chairs

Steering Committee Chairs

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 1 Software Technology and Engineering

T007 TTRUST IN A HYBRID RECOMMENDER SYSTEM . . . . . . . . . . . . . . 1

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

T040 RECHAP PROTOTYPE: A TOOL FOR SIMPLIFYING REQUIREMENT

Session 3 Software Technology and Engineering

T066 MIPAF: A POLICY-BASED MIDDLEWARE FRAMEWORK TO CON-

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 4 Software Technology and Engineering

T102 MOBILEOBJECT: FUNDAMENTALS . . . . . . . . . . . . . . . . . . . . . . . . 221

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 5 Software Technology and Engineering

T20014 ABASIC FOR INTRUSION DETECTION SYSTEM . . . . . . . . . . . . . . 285

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 6 Computer Design and Engineering

E004 AWARENESS FOR THE PROTECTION OF ENDANGERED SPECIES

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 7 Computer Design and Engineering

E036 EQUIVALENT PRESSURE CENTER ANALYSIS ON CONFIGURA-

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 8 Computer Design and Engineering

E059 TOWARDS AEROACOUSTIC CHARACTERIZATION OF THE SIBI-

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 9 Energy and Electrical Systems

S001 Fault Diagnosis of Power Transformers with Neural Network . . . . . . . 581

Downloaded From: http://ebooks.asmedigitalcollection.asme.org/ on 01/06/2016 Terms of Use: http://www.asme.org/about-a

Session 10 Energy and Electrical Systems