Proceedings of the 1st Symposium on Information and Communication Technology最新文献

Data mining and integration for environmental scenarios 环境场景的数据挖掘和集成

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852622

V. Tran, L. Hluchý, O. Habala

引用次数: 8

Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem 基于约束的局部搜索解决图上非简单路径问题:在网络覆盖问题路由中的应用

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852613

Pham Quang Dung, Phan-Thuan Do, Y. Deville, Hô Tuòng Vinh

{"title":"Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem","authors":"Pham Quang Dung, Phan-Thuan Do, Y. Deville, Hô Tuòng Vinh","doi":"10.1145/1852611.1852613","DOIUrl":"https://doi.org/10.1145/1852611.1852613","url":null,"abstract":"Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve constrained optimum paths problems on graphs by local search where paths are known to be elementary (i.e., edges, vertices cannot be repeated on paths). In many real-world situations, the paths to be determined are not known to be neither simple nor elementary. In this paper, we extend the LS(Graph) framework by designing and implementing abstractions that allow to model and solve constrained paths problem where edges, vertices can be repeated on paths (call non-simple paths). We also propose an instance of such problem class: the routing for network covering (RNC) problem which arises in the context of rescue after a natural disaster in which we have to route a fleet of identical vehicles with limited capacity on a transportation network in order to collect the informations of the disaster. Given an undirected weighted graph G = (V, E) representing a transportation network and a vertex v0 ∈ V representing the depot, the RNC problem consists of routing a fleet of unlimited number of identical vehicles with limited capacity that cannot perform a path of length > L such that each vehicle starts from and teminates at the depot and all the edges of a given set S (S ⊆ E) must be visited. The objective of the routing plan is to minimize the number of vehicles used. This paper discusses the challenge around this problem and applies the constructed framework to the resolution of this problem. The proposed model is generic; it allows to solve some variants of the problem where side constraints are required to be added.","PeriodicalId":388053,"journal":{"name":"Proceedings of the 1st Symposium on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209089","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

MemMON: run-time off-chip detection for memory access violation in embedded systems 嵌入式系统中内存访问违规的运行时芯片外检测

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852634

Nam Ho, Anh-Vu Dinh-Duc

引用次数: 2

Name entity recognition using inductive logic programming 名称实体识别使用归纳逻辑编程

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852626

H. T. Le, Thien Huu Nguyen

{"title":"Name entity recognition using inductive logic programming","authors":"H. T. Le, Thien Huu Nguyen","doi":"10.1145/1852611.1852626","DOIUrl":"https://doi.org/10.1145/1852611.1852626","url":null,"abstract":"Named entity recognition (NER) is the process of seeking to locate atomic elements in text into predefined categories such as the names of persons, organizations, locations, expressions of times, quantities, and percentages. It is useful in applying NER to other natural language tasks such as question-answering, text summarization, building semantic web, etc. This paper presents a system, called BKIE, that uses SRV -- an inductive logic program - to extract name entities in Vietnamese text. New predicates and features are added to SRV to deal with characteristics of Vietnamese language. Also, several strategies are proposed in this paper to improve the efficiency of the SRV algorithm. The data set using in experiments is 80 homepages of scientists in Vietnamese language that were tagged manually. The experiments give us the best F-score of 83% for extracting the \"name\" entity. It shows that SRV is an efficient NER algorithm given its advantages of generality and flexibility. In order to increase the system's performance, our future work includes (i) building a larger set of training data to improve system's performance; (ii) implementing BKIE using parallel programming to increase system efficiency; and (iii) testing BKIE with other application domains to get a more accurate evaluation of the system.","PeriodicalId":388053,"journal":{"name":"Proceedings of the 1st Symposium on Information and Communication Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042077","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

Generating qualified summarization answers using fuzzy concept hierarchies 使用模糊概念层次结构生成合格的摘要答案

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852620

Ngo Tuan Phong, N. Phuong, N. K. Anh

引用次数: 0

Particle-based simulation of blood flow and vessel wall interactions in virtual surgery 虚拟手术中基于粒子的血流和血管壁相互作用模拟

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852636

J. Qin, Wai-Man Pang, Binh P. Nguyen, Dong Ni, C. Chui

引用次数: 30

The LogP and MLogP models for parallel image processing with multi-core microprocessor 多核微处理器并行图像处理的LogP和MLogP模型

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852616

C. Chui

引用次数: 6

Comparative analysis of transliteration techniques based on statistical machine translation and joint-sequence model 基于统计机器翻译和联合序列模型的音译技术比较分析

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852624

Nam Cao, Nhut M. Pham, Q. Vu

引用次数: 12

Prediction-based directional search for fast block-matching motion estimation 基于预测的定向搜索快速块匹配运动估计

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852629

Binh P. Nguyen, T. Do, C. Chui, S. Ong

引用次数: 1

Password recovery for encrypted ZIP archives using GPUs 密码恢复加密ZIP档案使用gpu

Proceedings of the 1st Symposium on Information and Communication Technology Pub Date : 2010-08-27 DOI: 10.1145/1852611.1852617

P. Phong, Phan Duc Dung, Duong Nhat Tan, N. Duc, N. T. Thuy

{"title":"Password recovery for encrypted ZIP archives using GPUs","authors":"P. Phong, Phan Duc Dung, Duong Nhat Tan, N. Duc, N. T. Thuy","doi":"10.1145/1852611.1852617","DOIUrl":"https://doi.org/10.1145/1852611.1852617","url":null,"abstract":"Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of such documents mainly depends on two factors: the size of the password search space and the computing power of the underline system. In this paper, we present an approach using modern multi-core graphic processing units (GPUs) as computing devices for finding lost passwords of ZIP archives. The combination of GPU's extremely high computing power and the state-of-the-art password structure analysis methods would bring us a feasible solution for recovering ZIP file password. We first apply password generation rules[9] in generating a reasonable password space, and then use GPUs for exhaustively verifying every password in the space. The experimental results have shown that the password verification speed increases about from 48 to 170 times (depends on the number of GPUs) compared to sequential execution on the Intel Core 2 Quad Q8400 2.66 Ghz. These results have demonstrated the potential applicability of GPUs in this cryptanalysis field.","PeriodicalId":388053,"journal":{"name":"Proceedings of the 1st Symposium on Information and Communication Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123855839","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