2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)最新文献_第5页

The collaborative relevance in the distributed information retrieval 分布式信息检索中的协同关联

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945827

Adil Enaanai, Aziz Sdigui Doukkali, Ichrak Saif, Hicham Moutachaouik, M. Hain

{"title":"The collaborative relevance in the distributed information retrieval","authors":"Adil Enaanai, Aziz Sdigui Doukkali, Ichrak Saif, Hicham Moutachaouik, M. Hain","doi":"10.1109/AICCSA.2016.7945827","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945827","url":null,"abstract":"Relevance is one of the most interesting topics in the information retrieval domain. In this paper, we introduce another method of relevance calculation. We propose to use the implicit opinion of users to calculate relevance. The Implicit judgment of users is injected to the documents by calculating different kinds of weighting. These latter touch several criteria like as user's weight in the query's words, user's profile, user's interest, document's content and the document popularity. In this method, each user is an active element of the system, he searches documents and he makes treatments to provide relevant information to other users in the Network. This is similar as the peer-to-peer systems; unlike that, an element (user) have to manage automatically his data by creating a short view model of his most visited documents, and calculates his relative relevance about each one. The relative relevance is variable according each user, so the final relevance is calculated by the averaging of the elementary relevance of all users. Hence, the name of collaborative relevance.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115028580","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}

引用次数: 0

More secure Internet of Things using robust encryption algorithms against side channel attacks 更安全的物联网使用强大的加密算法对抗侧信道攻击

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945813

L. Tawalbeh, T. Al-Somani

{"title":"More secure Internet of Things using robust encryption algorithms against side channel attacks","authors":"L. Tawalbeh, T. Al-Somani","doi":"10.1109/AICCSA.2016.7945813","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945813","url":null,"abstract":"There are many recent revolutionary advances in information technology that include: wireless communication, the spread of mobile devices, and the Internet-of-Things (IoT). IoT will have an important role in connecting almost everything (mobile devices, cameras, home appliances, healthcare devices, military equipments, …, etc) to the Internet via different communication technologies such as Wi-Fi. This connection will have impact on many sectors of our life such as industry, economy, social life, and ICT sector. Moreover, there will be huge amounts of data (including financial and medical records for example) transmitted between those devices and the non-secure Internet. Some of these data might be very sensitive and their privacy and security must not be compromised. Here comes the need for Cryptographic systems to protect the vital data. There are many hardware and software implementations for the symmetric and asymmetric cryptographic algorithms such as AES, Elliptic Curve Cryptography, and RSA. And since we are talking about protecting physical devices connected to the Internet, we think that the hardware cryptosystems are more useful to be used in this case. In this paper, we introduce the IoT concept, applications, and challenges facing IoT. Then, we present the recent timing and fault Side Channel Attacks on cryptosystem implementations for the most secure encryption algorithms (AES, ECC, and RSA). Also, the countermeasures to protect these cryptosystems from such attacks are also presented.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114163999","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}

引用次数: 23

Moving object segmentation in video using spatiotemporal saliency and laplacian coordinates 基于时空显著性和拉普拉斯坐标的视频运动目标分割

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945726

Hiba Ramadan, H. Tairi

引用次数: 1

Auto-tuning TRSM with an asynchronous task assignment model on multicore, multi-GPU and coprocessor systems 基于多核、多gpu和协处理器系统的异步任务分配模型的自动调优TRSM

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945637

Clícia Pinto, Marcos E. Barreto, M. Boratto

引用次数: 0

Data placement strategy for massive data applications based on FCA approach 基于FCA方法的海量数据应用的数据放置策略

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945616

Zaki Brahmi, Sahar Mili, Rihab Derouiche

{"title":"Data placement strategy for massive data applications based on FCA approach","authors":"Zaki Brahmi, Sahar Mili, Rihab Derouiche","doi":"10.1109/AICCSA.2016.7945616","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945616","url":null,"abstract":"Massive data applications such as E-science applications are characterized by complex treatments on large amounts of data which need to be stored in distributed data centers. In fact, when one task needs several datasets from different data centers, moving these data may cost a lot of time and cause energy's high consumption. Moreover, when the number of the data centers involved in the execution of tasks is high, the total data movement and the execution time increase dramatically and become a bottleneck, since the data centers have a limited bandwidth. Thus, we need a good data placement strategy to minimise the data movement between data centers and reduce the energy consumed. Indeed, many researches are concerned with data placement strategy that distributes data in ways that are advantageous for application execution. In this paper, our data placement strategy aims at grouping the maximum of data and of tasks in a minimal number of data centers. It is based on the Formal Concept Analysis approach (FCA) because its notion of a concept respects our idea since it faithfully represents a group of tasks and data that are required for their execution. It is based on four steps: 1) Hierarchical organization of tasks using Formal Concepts Analysis approach, 2) Selection of candidate concepts, 3) Assigning data in the appropriate data centers and 4) Data replication. Simulations show that our strategy can effectively reduce the data movement and the average query spans compared to the genetic approach.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123221622","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}

引用次数: 8

Towards a dynamic and polarity-aware social user profile modeling 朝着动态和极性感知的社交用户档案建模

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945626

Abir Gorrab, Ferihane Kboubi, H. Ghézala, B. L. Grand

{"title":"Towards a dynamic and polarity-aware social user profile modeling","authors":"Abir Gorrab, Ferihane Kboubi, H. Ghézala, B. L. Grand","doi":"10.1109/AICCSA.2016.7945626","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945626","url":null,"abstract":"The emergence of social networks and the communication facilities they offer have generated an enormous informational mass. This social content is used in several research and industrial works and has had a great impact in different processes. In this paper, we present an overview of social information use in Information Retrieval (IR) and Recommendation systems. We first describe several user profile models using social information. A special attention is given to the following points: the analysis of the different user profiling models incorporating social content in Information Retrieval (IR) and in social recommendation methods. We distinguish between the models using social signals and relations, and the models using temporal information. We also present current and future challenges and research directions to enhance IR and recommendation process. We then describe our proposed model of social polarized and temporal user profile building and use in social recommendation context. Our proposal tries to address open challenges and establish a new model of user profile that fits information needs in recommender systems.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122030605","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}

引用次数: 4

Efficient image search system with multi-scale database using profile-based pre-selection and coarse matching 基于轮廓预选和粗匹配的多尺度数据库高效图像搜索系统

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945646

Kaoru Uchida

{"title":"Efficient image search system with multi-scale database using profile-based pre-selection and coarse matching","authors":"Kaoru Uchida","doi":"10.1109/AICCSA.2016.7945646","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945646","url":null,"abstract":"Artifact-metrics technology is gaining more research interests, along with the expansion of its applications. One of its challenges is an efficient image search, in which a match is to be identified in a large multi-scale image database with a given, possibly distorted, query image having unknown location, orientation, and scale. To approach this computational efficiency problem of image database search, we conducted a preliminary feasibility study focused specifically on aerial photo search problem. We propose a highly efficient image search system to find a match in the multi-layered database of images with multiple magnitudes. The system first pre-selects matching candidates based on comparison results of image profiles such as frequency spectra, so that the following matching stages focus on the appropriate scale layer to accelerate search. Then in the coarse matching stage, the down-sampled query image is compared with images in a lower-magnitude layer using a scale-invariant matcher based on local feature descriptors. This paper outlines our interim proposed approach and discusses its feasibility and performance based on the experimental results from our ongoing research work.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122521483","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}

引用次数: 1

Reconfigurable function blocks: Extension to the standard IEC 61499 可重构功能块:扩展到标准IEC 61499

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945784

S. Guellouz, Adel Benzina, M. Khalgui, Georg Frey

引用次数: 4

Universal metadata repository for document analysis and recognition 用于文档分析和识别的通用元数据存储库

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945622

Hassanin M. Al-Barhamtoshy, Maher Khemakhem, K. Jambi, F. Essa, A. Fattouh, A. Al-Ghamdi

{"title":"Universal metadata repository for document analysis and recognition","authors":"Hassanin M. Al-Barhamtoshy, Maher Khemakhem, K. Jambi, F. Essa, A. Fattouh, A. Al-Ghamdi","doi":"10.1109/AICCSA.2016.7945622","DOIUrl":"https://doi.org/10.1109/AICCSA.2016.7945622","url":null,"abstract":"Document Analysis and Recognition (DAR) has two main objectives, first the analysis of the physical structure of the input image of the document, which should lead to the correct identification of the corresponding different homogeneous components and their boundaries in terms of XY coordinates. Second, each of these homogeneous components should be recognized in such a way that, if it is a text image, consequently this image should be recognized and translated into an intelligible text. DAR remains one of the most challenging topics in pattern recognition. Indeed, despite the diversity of the proposed approaches, techniques and methods, results remain very weak and away from expectations especially for several categories of documents such as complex, low quality, handwritten and historical documents. The complex structure and/or morphology of such documents are behind the weakness of results of these proposed approaches, techniques and methods. One of the challenging problems related to this topic is the creation of standard datasets that can be used by all stakeholders of this topic such as system developers, expert evaluators, and users. In addition, another challenging problem is how one could take advantages of all existing datasets that unfortunately are dispersed around the world without knowing, most of the times, any information about their locations and the way to reach them. As an attempt to solve the two mentioned above problems, we propose in this paper a Universal Datasets Repository for Document Analysis and Recognition (UMDAR) that has, in fact, a twofold advantage. First, it can help dataset creators to standardize their datasets and making them accessible to the research community once published on the proposed repository. Second, it can be used as a central which bridges in a smart manner between datasets and all DAR stakeholders.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124147011","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}

引用次数: 1

An improved Arabic handwritten recognition system using embedded training based on HMMs 基于hmm的嵌入式训练改进的阿拉伯语手写识别系统

2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA) Pub Date : 2016-11-01 DOI: 10.1109/AICCSA.2016.7945773

M. AMROUCH, M. Rabi, D. Mammass

引用次数: 4