FTRA

Home | Contact Us | Sitemap | FTRA Home

Content on this page requires a newer version of Adobe Flash Player.

Get Adobe Flash player

Articles 15
No.
Author
15 Vol.2, No.1, Jun. 30, 2011 Section A - 1
Administrator
16335  
Runtime verification aims to check whether an application executes its behaviour as specified. Thereby the active execution trace of an application is checked in terms of the actual execution context; diagnosis and, possibly, recovery actions are taken when the specification is violated. In today’s practices, software is increasingly distributed over multiple processes, potentially running at different locations. This is supported by middleware that, to some extent, allows implementing applications in a distribution-transparent way. To enable effective runtime verification in distributed software we focus in this paper on three requirements: (1) distribution-transparent specification of software behaviour, as software is also implemented in such a way, (2) end-to-end verification of behaviour, and (3) automatic generation of verification modules for arbitrary process and distribution structures. We present a novel runtime verification approach satisfying these requirements and present its implementation in the EventChaser system. Furthermore we present an approach that at least minimizes the distribution-awareness of specifications to an acceptable level for software not using supported middleware for inter-process communication. Download : http://www.ftrai.org/joc/vol2no1/A1_A102  
14 Vol.2, No.1, Jun. 30, 2011 Section A - 2
Administrator
12925  
In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although this could cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of a level-1 cache and a level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so as to manage both static and dynamic data in a space-efficient manner: static data indicate popular pages which are frequently requested by many users and dynamic data indicate pages which may not be popular but are repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces network traffic and exhibits a high hit rate even in small cache sizes. Download : http://www.ftrai.org/joc/vol2no1/A1_A103 XpressEngine  
13 Vol.2, No.1, Jun. 30, 2011 Section B - 1
Administrator
11959  
This paper presents a concurrent error detection (CED) technique for a bit-slice of a full-adder. The proposed method involves computing the sum and carry bits in two alternative ways so that transient faults will be detected by comparing the results (Sum and Carry out) obtained from the two computing paths. This technique attempts to reduce the amount of extra hardware and circuit cost. In order to avoid the problem of extra delay we will propagate the result when the first computation is finished so that dependent computation can commence execution as soon as possible. To prove the efficiency of the proposed method, the circuit is simulated in standard CMOS 32nm technology and some transient faults are voluntarily injected into the circuit layout. The proposed design provides a 12.12% saving in transistor count compared to a DMR (Dual Modular Redundancy) style design. Download : http://www.ftrai.org/joc/vol2no1/B1_B101  
12 Vol.2, No.1, Jun. 30, 2011 Section B - 2
Administrator
15930  
Highlighting that connectivity and communication are two separate concepts in a Wireless Sensor Network (WSN), we propose a novel model for connectivity of a WSN using first-order Reed Muller codes. For communication, we choose to work with a model that utilizes Partially Balanced Incomplete Block Designs (PBIBD). Two suitable cryptosystems can now be applied for the two different models. As a result, the resilience of the WSN is appreciably improved without affecting the connectivity and scalability of the original communication model. Secure key establishment has been achieved by converting identifiers (ids) of nodes from public to private or secret information. The node ids which are now known only to individual nodes can be used in pairs to generate new communication keys from the old ones by padding and then applying suitable ‘Hash Functions’. As a result the resilience is further improved. Download : http://www.ftrai.org/joc/vol2no1/B2_B105 XpressEngine  
11 Vol.2, No.1, Jun. 30, 2011 Section B - 3
Administrator
12484  
Compared with hardware-based methods, software-based methods which do not need additional hardware costs are regarded as efficient methods for tolerating soft errors. Software-based methods which are implemented by software protection imply performance sacrifice. This paper proposes a new configurable approach whose purpose is to balance system reliability and performance to tolerate soft errors via partial software protection. Those unprotected software regions which are motivated by soft error mask on the software level are related to statically dead codes, those codes whose probabilities of being executed are low and some partially dead codes. For those protected codes, we copy all data and operate every operation twice to ensure the data stored in the memory are correct. Additionally, we ensure every branch instruction can jump to the right address by checking the condition and destination address. Finally, our approach is implemented by modification of the compiler. System reliability and performance are evaluated with different configurations. Experimental results demonstrate our aim to balance system reliability and performance. Download : http://www.ftrai.org/joc/vol2no1/B3_B103 XpressEngine  
10 Vol.2, No.1, Jun. 30, 2011 Section B - 4
Administrator
11683  
At present, the “Smart Grid” has emerged as one of the best advanced energy supply chains. This paper looks into the security system of smart grid via the smart planet system. The scope focused on information security criteria that impact on consumer trust and satisfaction. The importance of information security criteria is perceived as the main aspect to impact on customer trust throughout the entire smart grid system. On one hand, this paper also focuses on the selection of the model for developing information security criteria on a smart grid. Download : http://www.ftrai.org/joc/vol2no1/B4_B108  
9 Vol.2, No.1, Jun. 30, 2011 Section B - 5
Administrator
11923  
We analyse Taiwan’s electricity environment and the Taiwanese AMI architecture, and then design a suitable protocol stack to be used in the AMI system for low voltage users. Based on this proposed protocol stack, we also propose a hierarchical two-layer security scheme to protect the metering data and usage information. Download : http://www.ftrai.org/joc/vol2no1/B5_B109 XpressEngine  
8 Vol.2, No.1, Jun. 30, 2011 Section B - 6
Administrator
16833  
Malware inside networks along with worms and viruses have become a critical concern. Even though several approaches have been proposed to eliminate this severe problem, the vulnerability of the software dissemination server’s platform is often underestimated. Trusted software dissemination based on trusted computing mutual remote attestation mechanisms is a new approach designed to overcome it. But the limited computational capabilities of the TPM device on the sever side is an obvious bottleneck to scalable performance. Without any changes being made to the traditional TPM, and simply by introducing a novel highly efficient remote attestation mechanism specifically tailored for the server platform, we greatly increase the scalability of the server platform. Experimental measurements shows that handling multiple, almost simultaneous, software download requests only increases the average response time by a constant increment, which shows great efficiency when compared to existing linear approaches. Shared key, dealt with by Bilinear-Pairing properties, is also included to protect the attestation session and disseminated software. Implementation details, security analysis and performance evaluation of our system architecture are presented to demonstrate that our approach is feasible for a practical and scalable trusted software dissemination system. Download : http://www.ftrai.org/joc/vol2no1/B6_B110 XpressEngine  
7 Vol.2, No.1, Jun. 30, 2011 Section B - 7
Administrator
13316  
Current technology in trusted computing cannot comply with the requirement of trusted behaviour. One method for trusted computing dynamic attestation is proposed in this paper. This method uses a behaviour model based on the static analysis of binary code. One same source code may have several different binary versions, therefore one method is proposed for building almost the same core function model for different binary versions. This research also overcame the difficulty where some dynamic behaviours could not be obtained by static analysis. The paper also provides solutions for dynamic attestation of some complex programs, such as recursion, library link and multi threads programs. Download : http://www.ftrai.org/joc/vol2no1/B7_B111 XpressEngine  
6 Vol.2, No.1, Jun. 30, 2011 Section C - 1
Administrator
14475  
This paper presents, in the form of a case study, the design, implementation and performance evaluation of Phoenix: a prototype of a fault-tolerant distributed storage web service based on URLs. Our system supports a set of redundancy strategies including simple file-replication, error-coding techniques and a hybrid adaptive technique. The web storage middleware (WSM), which is at the core of the prototype, reuses the URLs of the files to dynamically accommodate data and redundancy load. Experimental assessments show that distributing the users to several web servers compensates for the overhead produced both by generating and distributing data redundancy. We also found that during a non-critical number of web server failures, users do not perceive but a lengthening on the system response times. As expected, peak user requests and network congestion are the most important factors affecting the storage system’s performance. Download : http://www.ftrai.org/joc/vol2no1/C1_C113 XpressEngine  
5 Vol.2, No.1, Jun. 30, 2011 Foreword
Administrator
15333  
Journal of Convergence Editors-in-Chief James J. (Jong Hyuk) Park Seoul National University of Science and Technology, Korea Mohammad S. Obaidat Monmouth University, USA Bibliographic Information · ISSN: 2093-7741 (Print) / 2093-775X (Online) · Publisher: FTRAP (FTRA Publishing) Contact Information · FTRA Publishing · Main Office: 111-101, Daedong, Yudong, Eomsa, Geryong, Chungnam, 321-755 Korea · Editing Office: #806, Hyundai Topics Bldg., 44-3, Bang-Yi-dong, Song-Pa-gu, Seoul, 135-280 Korea · Tel: +82-2-415-1241 / Fax: +82-2-415-1242 / Email: ftra.pub@gmail.com Journal Aims and Scope The FTRA Journal of Convergence covers the breadth of research in convergence technology and its applications. Theoretical research contributions presenting new techniques, concepts, or analyses, reports on experiences and experiments of implementation and application of theories, and tutorials on new technologies and trends are all welcome. Papers should emphasize original results relating to the theory and/or applications from a variety of convergence technologies and must meet the "Author Guidelines" in the Journal of Convergence, and each paper must clearly describe how it applies to convergence technologies. The subjects covered by the journal include all topics related to a) Computing and Communications; b) Security and Trust; c) Web and Multimedia; d) IT Managements and Services; e) Consumer Electronics. See "Special Issues" found in any JoC issue for additional instructions. [Section A: Computing and Communications] Recently, advances in computing and communication technologies are creating exciting new paradigms and are emerging as disciplines to provide intelligent computing and communication services all the time, everywhere, such as ubiquitous/pervasive computing and communication, smart/Intelligent computing and communication, green computing and communication, and so on. This emergence is a natural outcome of research and technological advances in wireless networks, computer communication, mobile computing and distributed computing. And its explosive impact on our daily life can be compared to that of computer over the past century. So, we must realize computing and communications are an important base and trend for present and future information technologies. The primary goal of this section is to provide researchers and academic communities around the world with the highest quality articles while reporting the state-of-the-art research results and scientific findings. This section covers all aspects of computing and communications. Topics of interest include, but are not limited to: (but are not limited to): Topics Mobile computing and wireless communications Pervasive/ubiquitous computing Grid, cluster and cloud computing Biological/molecular computing Convergence computing Smart and intelligent computing Human computing Green networking Communication and information theory Communication software and services Mobile ad hoc, sensor and mesh Networks High-performance computing and simulation and modeling Emerging computing and communication technology and standards [Section B: Security and Trust] Security is an imperative factor of computer-based systems in industry, government and others, which can be achieved by trusted computing. The purpose of this track is to establish the state-of-the-art technology for future research in security and trust. Original contributions, not currently under review to another journal or conference, are solicited in relevant areas including, but not limited to, the following: Topics Cryptography and cryptanalysis Applied cryptography Internet and network security System and software security Cloud computing security Mobile and wireless communication security Smartphone security Security protocol IPTV security services Privacy-enhancing technology Cybercrime and computer forensics Information warfare DRM and copyright protection Watermaking and Steganography Side-channel attacks Security for open convergence system Security for M2M platform Security issues for broadband convergence network Security evaluation and management Security requirements engineering Trust models and trust management policies Trustworthy infrastructures and services Design and application of trusted computing [Section C: Web and Multimedia] With the popularity of multimedia data on the web, efficiently accessing and managing the explosively growing multimedia content from large-scale web archives and multimedia database has become essential. During the last decades, extensive research efforts have been dedicated to automatic multimedia analysis and processing, such as acquisition, generation, storage, and retrieval of large-scale multimedia information. However, despite these techniques already provide promising results, there are still several key difficulties such as semantic gap and user gap in multimedia analysis/processing and annotation/tagging, respectively. This section is calling for papers that investigate the emerging research challenges in the field of multimedia and web which could be helped by reducing the semantic and user gap between low-level content descriptions of multimedia and the semantics in high-level human interpretations of audiovisual media. Semantic web and multimedia community researchers are encouraged to submit their research papers which are related to the following topics (but are not limited to). Topics Artificial intelligence in multimedia Collective intelligence in multimedia HCI in multimedia Machine learning in multimedia Multimedia applications Multimedia content analysis Multimedia mining Multimedia networking Multimedia ontology Multimedia Processing Multimedia retrieval Multimedia security Pattern recognition in multimedia Semantic multimedia Semantic web Service-oriented computing Social networks Web services Advisory Board · Alan Chin-Chen Chang National Chung Cheng University, Taiwan · Albert Zomaya University of Sydney, Australia · Bharat K Bhargava Purdue University, USA · Han-Chieh Chao National Ilan University, Taiwan · Hsiao-Hwa Chen National Sun Yat-Sen University, Taiwan · Jianhua Ma Hosei University, Japan · Jiannong Cao Hong Kong Polytechnic University, Hong Kong · Laurence T. Yang St Francis Xavier University, Canada · Makoto Takizawa Seikei University, Japan · Philip S. Yu University of Illinois at Chicago, USA · Shi-Jinn Horng National Taiwan University of Science and Technology, Taiwan · Victor Leung University of British Columbia, Canada Section Editors Section A: Computing and Communications · Ching-Hsien Hsu Chung Hua University, Taiwan · Changhoon Lee Hanshin University, Korea Section B: Security and Trust · Damien Sauveron University of Limoges, France · Jongsung Kim Kyungnam University, Korea Section C: Web and Multimedia · Sethuraman Panchanathan Arizona State University, USA · Seungmin Rho Korea University, Korea Secretary · Taeshik Shon Ajou University, Korea · Yang Sun Lee Chosun University, Korea System & Web Management · Deok Gyu Lee ETRI, Korea · Kyusuk Han KAIST, Korea Download : http://www.ftrai.org/joc/vol2no1/2-1_Foreword_EB.pdf  
4 Vol.2, No.1, Jun. 30, 2011 Preface 5
Administrator
24363  
Preface Editor in Chief, Prof. James J.(Jong Hyuk)1 Park and Mohammad S. Obaidat2 1) Seoul National University of Science and Technology, 172 Gongreung 2-dong, Nowon-gu, Seoul, 139-742, Korea E-mail: jhpark1@snut.ac.kr 2) Monmouth University West Long Branch, NJ 07764, USA E-mail: obaidat@monmouth.edu The FTRA Journal of Convergence (JoC) covers the breadth of research in convergence technology and its applications. Theoretical research contributions presenting new techniques, concepts, or analyses, reports on experiences and experiments of implementation and application of theories, and tutorials on new technologies and trends are all welcome. Papers should emphasize original results relating to the theory and/or applications from a variety of convergence technologies. The subjects covered by the journal include all topics related to a) Computing and Communications; b) Security and Trust; c) Web and Multimedia; d) IT Managements and Services; e) Consumer Electronics. We are honored to feature fourteen articles from world scientists for this inaugural issue of JoC. The first issue of JoC Section A starts with an article by Somayeh Malakuti, Mehmet Aksit and Christoph Bockisch. The article entitled Runtime Verification in Distributed Computing, presents a novel runtime verification approach satisfying 1) distribution-transparent specification of software behavior, as software is also implemented in such a way, 2) end-to-end verification of behavior, and 3) automatic generation of verification modules for arbitrary process and distribution structures. Also, this article introduces its evaluation by implementing the approach in the EventChaser system. The second article entitled A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing Systems by Qiying WEI, Tingting QIN, and Satoshi FUJITA introduces a two-level caching architecture consisting of level-1 cache and level-2 cache to relax bottleneck problems in hierarchical P2Ps. According to the given simulation result of the proposed architecture, this approach can reduce the network traffic and exhibit a high hit rate even in small cache sizes. The article of Section B entitled Concurrent Error Detection Adder Based On Two Paths Output Computation by Amy Poh Ai Ling and Mukaidono Masao explains a concurrent error detection (CED) technique for a bit-slice of a full-adder, which computes the sum and carry bits in two alternative ways so that transient faults will be detected by comparing the results (Sum and Carry out) obtained from the two computing paths. The article entitled Security Enhanced Communication in Wireless Sensor Networks Using Reed-Muller Codes and Partially Balanced Incomplete Block Designs by Pinaki Sarkar and Amrita Saha improves the resiliency of the WSN without affecting the connectivity and scalability of the original communication model. The third article entitled A Configurable Approach to Tolerate Soft Errors via Partial Software Protection by Lei Xiong and Qingping Tan proposes a new configurable approach whose purpose is to balance system reliability and performance, to tolerate soft errors via partial software protection. To illustrate the novelty of the proposed approach in the view of system reliability and performance, this article evaluates the approach in different configurations. The article entitled Selection of model in developing Information Security criteria on Smart Grid Security System Paper by Amy Poh Ai Ling and Mukaidono Masao focuses on information security criteria that impacts consumer trust and satisfaction of security system of Smart Grid via Smart Planet system. The article entitled Two-Layer Security Scheme for AMI System by Ping-Hai Hsu, Wenshiang Tang, Chiakai Tsai, and Bo-Chao Cheng analyze the Taiwan’s electricity environment and the Taiwan’s AMI architecture. Then, the article introduces an available protocol stacks to in the AMI system for low voltage users and proposes a hierarchical two-layer security scheme to protect the metering data and the usage information. The article entitled Toward a Practical and Scalable Trusted Software Dissemination System by Deng Chuan, Yang Lin, Ma Linru, and Cao Yuan introduces a novel high efficient remote attestation mechanism tailored specially for server platform without any changes being made to traditional TPM, which greatly increases the scalability of server platform. Through the implementation details, security analysis and performance evaluation of the proposed system architecture, the article demonstrates that the approach is feasible for a practical and scalable trusted software dissemination system. The article entitled Trusted Computing Dynamic Attestation by Using Static Analysis based Behavior Model, proposed by Tong Li, Fajiang Yu, Yang Lin, Xueyuan Kong, and Yue Yu, explains a method of building almost the same core function model for different binary versions. As the proposed method uses the behavior model based on static analysis of binary code, the method can overcome the difficulty that some dynamic behaviors cannot be obtained by static analysis. The article entitled Parallel Point-multiplication based on the Extended Basic Operations on Conic Curves over Ring Zn by Yongnan Li, Limin Xiao, Siming Chen, Hongyun Tian, Li Ruan, and Binbin Yu proposes parallel extended operations of point-addition and point-double for cryptosystem on conic curves over ring Zn. The Chinese Remainder Theorem is employed to divide point-addition over ring Zn into two point-additions over finite field Fp and finite field Fq. Also, the temporary values of point-addition over two finite fields are merged to get the final result of extended point-addition over ring Zn. Through performance evaluation, the article demonstrates that the proposed techniques improve the efficiencies of two extended operations. The article of Section C entitled Phoenix: a Fault-tolerant Distributed Web Storage based on URLs by J. L. Gonzalez and Ricardo Marcelín-Jiménez presents, in the form of a case study based on URLs, the design, implementation and performance evaluation of Phoenix: a prototype of fault-tolerant distributed storage web service. The system supports a set of redundancy strategies including simple file-replication, error-coding techniques and a hybrid adaptive technique. Through experimental assessments, the article shows that distributing the users to several web servers compensates the overhead produced both by generating and distributing data redundancy. Also, the article points out that during a non-critical number of web server failures, users do not perceive but a lengthening on the system response times. The article entitled Explorative visualization and analysis of a social network for arts: the case of deviantART, which is proposed by Bart Buter, Nick Dijkshoorn, Davide Modolo, Quang Nguyen, Sander van Noort, Bart van de Poel, Albert Ali Salah, and Alkim Almila Akdag Salah. The article describes an open source toolkit that provides a humanities scholar with necessary computational tools to analyze and visualize deviantART and similar arts collections. The article of Section D entitled Hidden Markov Models for classifying protein secondary and tertiary structures by Georgina Mirceva, Miroslav Mirchev, and Danco Davcev discusses two HMMs (Hidden Markov Models) which provide faster classification of protein structures. The first method considers secondary structures, while the second method builds a profile of the tertiary structures of protein molecules. Based on the comparison of these two algorithms, a higher precision can be achieved by considering the information contained in the protein tertiary structure. The article entitled Cross Comparison on C Compilers Reliability Impact by Anil Kumar Karna and Hengming Zou discusses some guidance in compiler selection for users by performing a cross-comparison study on popular C compilers: GCC, Intel, Sun, PGI, LLVM, and Visual Studio. Through SPEC CPU2006 benchmark suite, the article shows that the GCC C compiler is the best for Linux environment, and PGI C compiler is superior to Intel on UNIX based OSs. However Intel shows better performance and VS shows a higher efficiency on Windows OS. The article of Section E entitled Prototyping and Code Synthesis of Hierarchically Scheduled Systems using TIMES by Mikael Åsberg, Thomas Nolte, and Paul Pettersson shows how a node in a hierarchical scheduling tree can be analysed by the Times tool by replacing all interference from nodes with a small set of higher priority tasks. After explaining an algorithm that can generate these tasks, including their parameters, the article presents two example systems for better illustration of the proposed solution. The article entitled Automatic Method For Efficient Hardware Implementation From RVC-CAL Dataflow: A LAR Coder baseline Case Study by Khaled Jerbi, Matthieu Wipliez, Mickaël Raulet, Marie Babel, Olivier Deforges, and Mohamed Abid presents a method to automatically generate an efficient functional hardware implementation of a LAR coder baseline from an RVC-CAL dataflow program. The article entitled An Energy Conservation DVFS Algorithm for the Android Operating System by Wen-Yew Liang, Po-Ting Lai, and Che Wun Chiou introduces an energy conservation DVFS algorithm to maximise energy saving for the device if performance is a less important issue. The algorithm relies on a prediction equation that is constructed based on the correlation between the critical speed and the memory access rate. Through implementation result in Android operating system, both the energy consumption and the performance can be improved than the situation of simply selecting the lowest frequency. The article entitled Performance Evaluation of the Convergence Ad Hoc Networks by Surasee Prahmkaew presents Policing Traffic Management (PTM) to improve the Quality of Service (QoS) over an Inter-Vehicular Communications System (IVCS). The proposed PTM is an extension of the Adaptive Rate Control algorithm (ARC) which mainly improves the QoS performance by adjusting transmission rates based upon traffic priority. (i.e., Voice will be set as highest, video as medium and data as the lowest priority.) The last article An Enhanced Technique for Vertical Handover of Multimedia Traffic between WLAN and EVDO proposes an efficient algorithm which maintains the real time connection as well as preventing the data loss during transition from WLAN to EVDO. We believe that these fifteen articles have the good quality and relevance that we expect for developing JoC. Finally, we would like to thank all authors, reviewers, and members of the editorial board of JoC. Download : http://www.ftrai.org/joc/vol2no1/2-1_Preface.pdf  
3 Vol.2, No.1, Jun. 30, 2011 Table of Contents 16
Administrator
20591  
p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 18.0px Helvetica} p.p2 {margin: 0.0px 0.0px 0.0px 0.0px; font: 10.0px Helvetica} p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 18.0px Helvetica} p.p2 {margin: 0.0px 0.0px 0.0px 0.0px; font: 10.0px Helvetica} Table of Contents [Section A: Computing and Communications] Runtime Verification in Distributed Computing······································································································ 1-10 Somayeh Malakuti, Mehmet Aksit and Christoph Bockisch A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing Systems ······················································ 11-16 Qiying WEI, Tingting QIN, Satoshi FUJITA [Section B: Security and Trust] Concurrent Error Detection Adder Based On Two Path Output Computation ····························································· 17-22 Chiraz Khedhiri, Mouna Karmani, Belgacem Hamdi, Ka Lok Man Security Enhanced Communication in Wireless Sensor Networks Using Reed-Muller Codes and Partially Balanced Incomplete Block Designs································································································································· 23-30 Pinaki Sarkar, Amrita Saha A Configurable Approach to Toleration of Soft Errors via Partial Software Protection ················································· 31-38 Lei Xiong, Qingping Tan Selection of Model in Developing Information Security Criteria for Smart Grid Security System ···································· 39-46 Amy Poh Ai Ling, Mukaidono Masao Two-Layer Security Scheme for AMI System······································································································· 47-52 Ping-Hai Hsu, Wenshiang Tang, Chiakai Tsai, Bo-Chao Cheng Towards a Practical and Scalable Trusted Software Dissemination System································································ 53-60 Deng Chuan, Yang Lin, Ma Linru, Cao Yuan Trusted Computing Dynamic Attestation Using a Static Analysis based Behavior Model ············································· 61-68 Tong Li,Fajiang Yu, Yang Lin, Xueyuan Kong, Yue Yu Parallel Point-multiplication based on the Extended Basic Operations on Conic Curves over Ring Zn ····························· 69-78 Yongnan Li, Limin Xiao, Siming Chen, Hongyun Tian, Li Ruan, and Binbin Yu [Section C: Web and Multimedia] Phoenix: a Fault-tolerant Distributed Web Storage based on URLs··········································································· 79-86 J. L. Gonzalez, Ricardo Marcelín-Jiménez Explorative Visualization and Analysis of a Social Network for Arts: The Case of deviantART ···································· 87-94 Bart Buter, Nick Dijkshoorn, Davide Modolo, Quang Nguyen, Sander van Noort, Bart van de Poel, Albert Ali Salah, Alkim Almila Akdag Salah Download : http://www.ftrai.org/joc/vol2no1/2-1_ToC.pdf  
2 Vol.2, No.1, Jun. 30, 2011 Section B - 8
Administrator
13390  
This paper presents the parallel extended point-addition and point-double on conic curves over ring Zn firstly. Then the parallel point-multiplication on conic curves over ring Zn is proposed based on the two extended basic operations. The data dependencies of extended point-addition and point-double are deduced by analyzing their definitions. Using the procedure of paralleling extended point-addition as an example, we employ the Chinese Remainder Theorem to divide point-addition over ring Zn into two point-additions over finite field Fp and finite field Fq. After that, the temporary values of point-addition over two finite fields are merged to get the final result of the extended point-addition over ring Zn. An algorithm in our previous work is used directly to parallel the point-multiplication on the basis of the extended point-addition and point-double. The performance evaluation demonstrates that our techniques achieve better efficiency for conic curves cryptosystem over ring Zn than the old parallel algorithms we proposed before. This paper presents the parallel extended point-addition and point-double on conic curves over ring Zn firstly. Then the parallel point-multiplication on conic curves over ring Zn is proposed based on the two extended basic operations. The data dependencies of extended point-addition and point-double are deduced by analyzing their definitions. Using the procedure of paralleling extended point-addition as an example, we employ the Chinese Remainder Theorem to divide point-addition over ring Zn into two point-additions over finite field Fp and finite field Fq. After that, the temporary values of point-addition over two finite fields are merged to get the final result of the extended point-addition over ring Zn. An algorithm in our previous work is used directly to parallel the point-multiplication on the basis of the extended point-addition and point-double. The performance evaluation demonstrates that our techniques achieve better efficiency for conic curves cryptosystem over ring Zn than the old parallel algorithms we proposed before. Download : http://www.ftrai.org/joc/vol2no1/B8_B112  
1 Vol.2, No.1, Jun. 30, 2011 Section C - 2
Administrator
20878  
deviantART is one of the leading social online network sites with a focus on user-generated artworks. The website has a rich data archive of around 150 million images uploaded by its 15 million members, making it the largest art platform today. This paper describes an open source toolkit that provides a humanities scholar with necessary computational tools to analyse and visualise deviantART and similar art collections. To this end, we combine tools from different research fields such as network analysis, computer vision, machine learning and data visualisation. The toolkit provides the functionality to extract data about members and their artworks directly from the deviantART website, using network analysis to select key members for further investigation. The chosen members’ images are automatically downloaded and annotated with different image features, along with which they can be visualised. The visualisation options offered in the implemented toolkit links images to their originals and can be used to explore and analyse the dataset in an interactive way. The toolkit also features an SVM-based classifier to automatically select features to discriminate artists, artworks and styles, which is hidden from the user behind a simple “suggest features” option. deviantART is one of the leading social online network sites with a focus on user-generated artworks. The website has a rich data archive of around 150 million images uploaded by its 15 million members, making it the largest art platform today. This paper describes an open source toolkit that provides a humanities scholar with necessary computational tools to analyse and visualise deviantART and similar art collections. To this end, we combine tools from different research fields such as network analysis, computer vision, machine learning and data visualisation. The toolkit provides the functionality to extract data about members and their artworks directly from the deviantART website, using network analysis to select key members for further investigation. The chosen members’ images are automatically downloaded and annotated with different image features, along with which they can be visualised. The visualisation options offered in the implemented toolkit links images to their originals and can be used to explore and analyse the dataset in an interactive way. The toolkit also features an SVM-based classifier to automatically select features to discriminate artists, artworks and styles, which is hidden from the user behind a simple “suggest features” option. Download : http://www.ftrai.org/joc/vol2no1/C2_C114  

FTRAP (FTRA Publishing) | Business Reg. No.: 308-07-42524 | Tel: +82-2-415-1241 | Email: ftra.pub@gmail.com
Main Office: 111-101, Daedong, Yudong, Eomsa, Geryong, Chungnam, 321-755 Korea
Editing Office: #806, Hyundai Topics Bldg., 44-3, Bang-Yi-dong, Song-Pa-gu, Seoul, 135-280 Korea
Copyright © 2010 FTRA Publishing. All rights reserved.

Published by