发布求助
文献互助 智能选刊 最新文献

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010最新文献

筛选
英文 中文
Pre-learning from mobile professionals' Trajectory 预学习移动专业人士的发展轨迹
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587015
W. Oueslati, J. Akaichi
{"title":"Pre-learning from mobile professionals' Trajectory","authors":"W. Oueslati, J. Akaichi","doi":"10.1109/AICCSA.2010.5587015","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587015","url":null,"abstract":"With the advent of pervasive systems and positioning technologies, a huge trajectory data related to moving objects is generated but not efficiently exploited by decision makers. Trajectory data warehouse seems to be a right repository for this kind of data. The aim of this work is to design a Trajectory data warehouse to gather trajectory data collected partially by mobile professionals for analysis and decision purpose.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356654","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
Text thematic fragmentation and identification 文本主题碎片化和识别
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587007
Khaoula Mahmoudi, Sami Faïz
{"title":"Text thematic fragmentation and identification","authors":"Khaoula Mahmoudi, Sami Faïz","doi":"10.1109/AICCSA.2010.5587007","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587007","url":null,"abstract":"Given the exponential growth of online information, one of the primary difficulties facing users is the information overload. Huge amounts of these electronic information are mainly encapsulated in text documents. So, the researchers are striving to develop robust methods to provide users and managers with prominent solutions needed for text analysis. This allows maximizing profits by saving time and money devoted to manage the increasing amount of information. In this context and among others we find text segmentation and theme identification. In this paper and by resting on the existing well known approaches and advances in the text segmentation and theme identification fields, we propose new solutions to reach the objectives behind achieving these two techniques more accurately.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579889","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}
引用次数: 3
Scalable co-scheduling strategies in distributed computing 分布式计算中的可伸缩协同调度策略
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586981
V. Toporkov, D. Yemelyanov, A. Toporkova, A. Tselishchev
{"title":"Scalable co-scheduling strategies in distributed computing","authors":"V. Toporkov, D. Yemelyanov, A. Toporkova, A. Tselishchev","doi":"10.1109/AICCSA.2010.5586981","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586981","url":null,"abstract":"In this paper, we present an approach to scalable co-scheduling in distributed computing for complex sets of interrelated tasks (jobs). The scalability means that schedules are formed for job models with various levels of task granularity, data replication policies, and the processor resource and memory can be upgraded. The necessity of guaranteed job execution at the required quality of service causes taking into account the distributed environment dynamics, namely, changes in the number of jobs for servicing, volumes of computations, possible failures of processor nodes, etc. As a consequence, in the general case, a set of versions of scheduling, or a strategy, is required instead of a single version. We propose a scalable model of scheduling based on multicriteria strategies. The choice of the specific schedule depends on the load level of the resource dynamics and is formed as a resource query which is sent to a local batch-job management system.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124112496","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}
引用次数: 5
Asynchronous locally self adjusted routing protocol for mobile multi hop ad hoc networks 移动多跳自组织网络异步本地自调整路由协议
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586998
Mohamed Amine Abid, A. Belghith
{"title":"Asynchronous locally self adjusted routing protocol for mobile multi hop ad hoc networks","authors":"Mohamed Amine Abid, A. Belghith","doi":"10.1109/AICCSA.2010.5586998","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586998","url":null,"abstract":"In this paper, we propose a novel routing algorithm based on the network cartography which is collected using an asynchronous distributed cartography gathering algorithm. Each node senses its own dynamics and chooses locally an appropriate routing size. As such stationary nodes generate little signaling traffic, however fast moving nodes choose small routing periods to mitigate the effect of mobility. Moreover, every node integrates a self regulating process that dynamically regulates the already chosen routing period to track the timely evolution of the node dynamics. The performance of our proposed routing protocol are evaluated and compared to the known OLSR through extensive simulations. First, we show that the collected network cartography maintains over time a validity ratio above 97 percent even for high node speed. Second, while our proposed routing protocol provides around 97 percent routing validity, the OLSR can hardly deliver more than 60 percent. Third, the proposed protocol provides much more throughput than OLSR and much less end to end delay at moderate to high speeds and workloads.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115075359","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}
引用次数: 6
Design of a library of motion functions for a Humanoid robot for a football game 足球类人机器人运动函数库的设计
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586942
M. Al-Mouhamed, Ahmad Abu-Arafah
{"title":"Design of a library of motion functions for a Humanoid robot for a football game","authors":"M. Al-Mouhamed, Ahmad Abu-Arafah","doi":"10.1109/AICCSA.2010.5586942","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586942","url":null,"abstract":"Humanoid robots are enjoying increasing popularity as a research tool and education tool. The ultimate goal of the international RoboCup Initiative is to build a humanoid soccer team which beats a human World Cup Champion team in 2050. Despite impressive achievements of some teams, the overall performance of the soccer playing humanoids is still far from perfect. The robots sometimes show instability while walking, fail to kick the ball or defend against shots not taken. In this study we present a geometrical model for the walking legs of the Kondo KHR-1 humanoid robot. The model allows to establish the relationships between a set of function walking motion controls and that of the leg controlled angles. Furthermore, we use the German team SimRobot to program the soccer scene and for the analysis of Kondo walking motion. For this we developed a 3D model as part of the SimRobot controller. A set of synthesized walking motions were designed. The result is a library of motions which are: 1) Walking Forward 2) Walking Backwards 3) Step right/left 4) Turn right/left 5) Swat right/left 6) Kick right/left 7) Bow 8) Push-ups. The library is useful to facilitate soccer behavior programming for preparing the students to the RoboCup competition.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116518012","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
State of art and practice of COTS components search engines COTS组件搜索引擎的现状与实践
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587032
Nacim Yanes, Sihem Ben Sassi, H. Ghézala
{"title":"State of art and practice of COTS components search engines","authors":"Nacim Yanes, Sihem Ben Sassi, H. Ghézala","doi":"10.1109/AICCSA.2010.5587032","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587032","url":null,"abstract":"COTS-Based Software Development has emerged as an approach aiming to improve a number of drawbacks found in the software development industry. The main idea is the reuse of well-tested software products, known as Commercial-Off-The-Shelf (COTS) components, that will be assembled together in order to develop larger systems. The potential benefits of this approach are mainly its reduced costs and shorter development time, while ensuring the quality. One of the most critical activities in COTS-based development is the identification of the COTS candidates to be integrated into the system under development. Nowadays, the Web is the most used means to find COTS candidates. Thus, the use of search engines turns out to be crucial. This paper deals with existing search engines especially proposed to find COTS components satisfying some needs on the Web. It presents a state of the art and practice of search engines followed by a study assessing to which extent they are able to accomplish their objectives.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127616928","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}
引用次数: 2
Disassembly scheduling of complex products using parallel heuristic approaches 基于并行启发式方法的复杂产品拆解调度
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587023
B. Adenso-Díaz, S. G. Carbajal, S. Lozano
{"title":"Disassembly scheduling of complex products using parallel heuristic approaches","authors":"B. Adenso-Díaz, S. G. Carbajal, S. Lozano","doi":"10.1109/AICCSA.2010.5587023","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587023","url":null,"abstract":"A Greedy Randomized Adaptive Search Procedure (GRASP) algorithm for Disassembly Sequence Planning has recently been proposed. For this problem, feasibility-checking is rather time consuming due to the large number of constraints. The same happens to the local search used within GRASP to improve solutions. In this paper two parallel implementations of the algorithm are proposed for effectively solving larger problems. Both parallel algorithms use cooperative-search plus Path-Relinking and have been tested on a set of 48 benchmark problems. The results show that the parallel algorithms outperform the sequential GRASP algorithm and that migration-based cooperative search may be more effective in this problem than a shared global pool. Average efficiency is around 0.4.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"23 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132881201","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}
引用次数: 2
Web-based recruiting 网络招聘
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587018
Soumaya Amdouni, W. Karaa
{"title":"Web-based recruiting","authors":"Soumaya Amdouni, W. Karaa","doi":"10.1109/AICCSA.2010.5587018","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587018","url":null,"abstract":"Recently, Information and Communication Technologies have introduced new practices in human resource management functions such as e-recruitment. Job seekers submit their Curriculum Vitae (CV) via the Web, or send them directly to a company. The area of e-recruitment is facing a growing number of these documents which are in different formats, and contain a large amount of information. Then, it has become imperative to use automated techniques to identify, extract, and exploit information from CVs to find the most appropriate one for a given post. Our work focuses on CVs analysis. We present a system for analyzing and structuring CVs which are in French language. For his end, we made an extension of General Architecture of Text Engineering (GATE) by formulating necessary rules that generate new annotations. The goal is to normalize the CV content according to the structure adopted by Europass CV. This action is guided by the HR-XML standard. An empirical study is conducted to validate the proposed process and we show that there is an improvement in the extraction phase.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133331442","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}
引用次数: 20
OLAP umbrella: Visualization model for multidimensional databases OLAP保护伞:多维数据库的可视化模型
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586990
T. Bhowmik, A. Sarkar, N. Debnath
{"title":"OLAP umbrella: Visualization model for multidimensional databases","authors":"T. Bhowmik, A. Sarkar, N. Debnath","doi":"10.1109/AICCSA.2010.5586990","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586990","url":null,"abstract":"A good visualization model for Data Warehouse (DW) should be semantically enriched enough so that it can express analytical contents along with the multidimensional data model artifacts to the end-user and decision makers. In this paper the OLAP Umbrella visualization model has been proposed for the purpose. Besides preserving the classical multidimensional data model artifacts and OLAP specific contents, the model has visualization and navigational support for multiple measures associated with multiple facts. Also the proposed visualization model is flexible enough to map from any type of logical level DW schema like star, snowflake or constellation as well as different OLAP operations like Slice, Dice, Roll-up, Drill-Down and Drill-Across can be realized over it. Further, the model can transparently express multiple dimensions and their hierarchies associated with multidimensional database schema along with the related OLAP content in a single structure.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132130","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
Agents' Coordination in Ad-hoc Networks Ad-hoc网络中agent的协调
ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586953
Usama Mir, S. Aknine, L. Merghem, D. Gaïti
{"title":"Agents' Coordination in Ad-hoc Networks","authors":"Usama Mir, S. Aknine, L. Merghem, D. Gaïti","doi":"10.1109/AICCSA.2010.5586953","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586953","url":null,"abstract":"In this paper we are interested in solving the problems of continuity of service using a Multiagent System (MAS) deployed on Mobile Ad-Hoc Networks (MANETs). We investigate the aspects of mobility and the losses it costs in terms of continuity of service. The aim of this research is the development of agents' coordination protocols for these highly dynamic environments like MANETs. One of the difficulties in MANETs is the spontaneous mobility of nodes, especially when devices with limited resources are used. All the constraints of agents' development thus have to be re-examined in order to be adapted to these situations. In this paper, we propose two protocols Pessimistic Ad-hoc Coordination Protocol (PACP) and Optimistic Ad-hoc Coordination Protocol (OACP)) to provide coordination amongst the agents. In our considered ad-hoc scenario, the nodes represent the chargers and the wheelchairs upon which the intelligent agents are deployed. These protocols have been evaluated and tested using this scenario.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003925","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信