{"title":"Efficiency of Hybrid Normalization of Microarray Gene Expression: A Simulation Study","authors":"M. Pirooznia, Youping Deng","doi":"10.1109/AINAW.2007.164","DOIUrl":"https://doi.org/10.1109/AINAW.2007.164","url":null,"abstract":"Microarray experiment's data contain errors, from various sources. The process of identifying and adjusting of systematic variation in intensities between samples on the same slide is known as normalization. We implemented a Java application with graphical user interface that allows easy evaluation of errors and the role of hybrid normalization methods to remove the systematic errors from the experiment's data. We calculated true hybridization intensity then applied different additive and multiplicative errors and computed the normalized intensity logged ratio using background subtraction, self-normalization method and dye-flip technique. Results show the efficiency of hybrid normalization method in order to remove error rates from the intensity values.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131218830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hardware-Software Cosynthesis of Multiprocessor Embedded Architectures","authors":"G. Khan, U. Ahmed","doi":"10.1109/AINAW.2007.196","DOIUrl":"https://doi.org/10.1109/AINAW.2007.196","url":null,"abstract":"Hardware software cosynthesis process tries to determine system architecture for an embedded application. In this paper, a new cosynthesis approach is presented, which targets distributed memory architectures for high performance embedded systems. The target embedded architecture consists of heterogeneous processing elements (PEs) with point- to-point communication structure. The main steps of the cosynthesis process include PE selection, pipelined task allocation and scheduling, and regular topology mapping. Initially, an irregular topology is generated and then mapped to regular topology architecture (e.g. mesh, hypercube and tree). The cosynthesis method is tested for the MPEG encoder application.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131144287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Preuveneers, Julien Pauty, D. Landuyt, Y. Berbers, W. Joosen
{"title":"Comparative Evaluation of Converged Service-Oriented Architectures","authors":"D. Preuveneers, Julien Pauty, D. Landuyt, Y. Berbers, W. Joosen","doi":"10.1109/AINAW.2007.122","DOIUrl":"https://doi.org/10.1109/AINAW.2007.122","url":null,"abstract":"In this paper we evaluate and compare five commercial off-the-shelf platforms for building converged service-oriented architectures in an ambient computing environment. To this end, we have identified several categories of requirements that support the always-connected digital lifestyle of the mobile user. Key requirements are providing convergence - joining the worlds of Web services and telecom services - and offering context awareness in order to tailor services better to the user's environment, preferences and needs. Our evaluation shows that currently none of the investigated architectures completely fulfills the two aforementioned requirements in order to deploy a variety of future converged mobile and context-aware services. However, the resulting comparison can be used as a practical guideline for decision-makers to select a platform to build a service-oriented architecture adjusted to the specific requirements within their application domain.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Authenticated Broadcast Encryption Scheme","authors":"C. H. Tan, J. Teo, Jens-Are Amundsen","doi":"10.1109/AINAW.2007.104","DOIUrl":"https://doi.org/10.1109/AINAW.2007.104","url":null,"abstract":"With the advancement of wireless networks and mobile access devices such as cell phones and PDAs, multimedia services could be offered through wireless broadcast networks to these mobile devices. Therefore, there is a need to securely deliver multimedia content/data to many users over an insecure channel. Broadcast encryption scheme could provide this solution. The first formal study of broadcast encryption scheme is by Fiat and Noar in 1993. Since then, many broadcast encryption schemes have been proposed to improve the efficiency which is measured by three parameters, that is, length of transmission messages, users' storage and computational overhead at a user device. Some broadcast encryption schemes require less users storage, but the length of transmission messages or computation overhead depends on the number of users. In this paper, we proposed an authenticated broadcast encryption scheme which has an additional property than current proposed broadcast encryption schemes, that is, all users can verify who the sender is. The proposed scheme is proved to be secure against chosen ciphertext attacks based on the decision l-bilinear Diffie-Hellman exponent assumption. Furthermore, the simulation results, transmission messages nearly independent of the number of users and reasonable user storage show that the proposed authenticated broadcast encryption scheme is efficient and suitable for mobile devices.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132626143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extracting Significant Phrases from Text","authors":"Y. Lui, R. Brent, Ani Calinescu","doi":"10.1109/AINAW.2007.180","DOIUrl":"https://doi.org/10.1109/AINAW.2007.180","url":null,"abstract":"Prospective readers can quickly determine whether a document is relevant to their information need if the significant phrases (or keyphrases) in this document are provided. Although keyphrases are useful, not many documents have keyphrases assigned to them, and manually assigning keyphrases to existing documents is costly. Therefore, there is a need for automatic keyphrase extraction. This paper introduces a new domain independent keyphrase extraction algorithm. The algorithm approaches the problem of keyphrase extraction as a classification task, and uses a combination of statistical and computational linguistics techniques, a new set of attributes, and a new learning method to distinguish keyphrases from non-keyphrases. The experiments indicate that this algorithm performs at least as well as other keyphrase extraction tools and that it significantly outperforms Microsoft Word 2000's AutoSummarize feature.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128827226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detecting Anomaly Node Behavior in Wireless Sensor Networks","authors":"Qinghua Wang, Tingting Zhang","doi":"10.1109/AINAW.2007.148","DOIUrl":"https://doi.org/10.1109/AINAW.2007.148","url":null,"abstract":"Wireless sensor networks are usually deployed in a way \"once deployed, never changed\". The actions of sensor nodes are either pre-scheduled inside chips or triggered to respond outside events in the predefined way. This relatively predictable working flow make it easy to build accurate node profiles and detect any violation of normal profiles. In this paper, traffic patterns observed are used to model node behavior in wireless sensor networks. Firstly, selected traffic related features are used to translate observed packets into different events. Following this, unique patterns based on the arriving order of different packet events are extracted to form the normal profile for each sensor node during the profile learning stage. Finally, real time anomaly detection can be achieved based on the profile matching.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131870739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards Answering How do I Questions Using Classification","authors":"Kelvin Wu, Lei Yu, M. Cutler","doi":"10.1109/AINAW.2007.356","DOIUrl":"https://doi.org/10.1109/AINAW.2007.356","url":null,"abstract":"Interest in developing open domain question answering systems that leverage the massive amount of knowledge available on the Web is on the rise. In this investigation, we address the problem of answering How do I questions. Our goal is to use the top results obtained from a search engine to extract and present correct answers. Identifying correct answers to such questions is a hard problem that seems to require deep natural language understanding. Fortunately, answers to How do I questions are often procedural, typically containing a successive sequence of actions. Learning to label text as procedural or non-procedural is an easier problem which we attempted to solve by extracting 12 informative features with which we trained classifiers. However, the corpus built from the top documents retrieved for a set of How do I- equivalent queries turned out to be highly imbalanced. To tackle this issue, sampling techniques were used for a variety of classification methods, yielding reasonable recall and precision for the minority class of procedural texts.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133718740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Low Cost Sessions-Based Misbehaviour Detection Protocol (SMDP) for MANET","authors":"T. Fahad, D. Djenouri, R. Askwith, M. Merabti","doi":"10.1109/AINAW.2007.34","DOIUrl":"https://doi.org/10.1109/AINAW.2007.34","url":null,"abstract":"There is a strong motivation for a node to deny packet forwarding to others and being selfish in MANET. Recently, some solutions have been proposed, but almost all of these solutions rely on the watchdog technique, which suffers from many drawbacks, particularly when using the power control technique. To overcome this problem with a moderate communication overhead, this paper introduces a new approach for detecting misbehaving nodes that drop data packets in MANET. It consists of two stages: (i) the monitoring stage in which each node monitors its direct neighbours with respect to forwarding data packets of a traffic session in the network, and (ii) the decision stage, in which direct neighbouring nodes decide whether the monitored node misbehaves or not. Our new approach is able to detect the misbehaviour in case of power control employment, with a low communication overhead compared to the existing approaches.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115234538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Toolkit for Virtual Large-Scale Storage in a Learning Environment","authors":"M. Uehara","doi":"10.1109/AINAW.2007.61","DOIUrl":"https://doi.org/10.1109/AINAW.2007.61","url":null,"abstract":"The cost of a conventional centralized file server is high; though such a system is suited for a learning environment such as in schools. However, our university has several hundreds PCs whose HDDs are not usually used. The total size of these unused capacities of the HDDs is nearly equal to the capacity of a file server. Thus, in this paper, we propose a Java-based toolkit to construct a virtual large-scale storage system. We call it VLSD (virtual large-scale disk). This toolkit is implemented by Java and consists of RAID (redundant arrays of inexpensive/independent disks) and NBD (network block device). Using VLSD, we show how to construct a large disk that consists of multiple idle spaces distributed in networks. VLSD supports typical RAID classes and other utility classes. These can be combined freely with each other.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115327415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Energy Efficient Query Processing in Wireless Sensor Network","authors":"Md. Ashiqur Rahman, S. Hussain","doi":"10.1109/AINAW.2007.170","DOIUrl":"https://doi.org/10.1109/AINAW.2007.170","url":null,"abstract":"This paper demonstrates an energy efficient query processing technique for wireless sensor networks which achieves energy efficiency through centralized caching and variable frequency sensing.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124497952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}