Proceedings of the International Multiconference on Computer Science and Information Technology最新文献_第2页

Using Self Organizing Map to cluster Arabic crime documents 用自组织地图聚类阿拉伯犯罪文件

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679616

M. Alruily, A. Ayesh, Abdulsamad Al-Marghilani

引用次数: 24

LEXiTRON-Pro Editor: An integrated tool for developing Thai pronunciation dictionary LEXiTRON-Pro编辑器:一个开发泰语发音字典的综合工具

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679947

Supon Klaithin, P. Chootrakool, K. Kosawat

{"title":"LEXiTRON-Pro Editor: An integrated tool for developing Thai pronunciation dictionary","authors":"Supon Klaithin, P. Chootrakool, K. Kosawat","doi":"10.1109/IMCSIT.2010.5679947","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679947","url":null,"abstract":"Pronunciation dictionary is a crucial part for both Text-To-Speech and Automatic Speech Recognition systems. In this paper, we propose a tool to easily create and edit Thai pronunciation dictionary, called LEXiTRON-Pro Editor. This tool integrates Thai word segmentation, Thai Grapheme-to-Phoneme (G2P) conversion, and database system with statistics. It automatically proposes a word's pronunciation to users by 1 of the 3 options in the successive order: the pronunciation from LEXiTRON-Pro database, the pronunciation combined from syllables with highest probability, and the pronunciation from Thai G2P. However, users can switch to another option or even directly input their own pronunciation with an easy interface editor. Our LEXiTRON-Pro database contains initially 105,129 unique words and 24,736 unique syllables with pronunciations. Compared to the previous version, our new program can reduce the process of dictionary development from 5 to only 1 step and the number of tools used by linguists from 3 to only 1. Moreover, our experiment shows that the time consumption and the number of ungenerable words are significantly reduced while the pronunciation accuracy is considerably improved.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130807916","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

A security model for personal information security management based on partial approximative set theory 基于部分逼近集理论的个人信息安全管理安全模型

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679939

Z. Csajbók

{"title":"A security model for personal information security management based on partial approximative set theory","authors":"Z. Csajbók","doi":"10.1109/IMCSIT.2010.5679939","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679939","url":null,"abstract":"Nowadays, computer users especially run their applications in a complex open computing environment which permanently changes in the running time. To describe the behavior of such systems, we focus solely on externally observable execution traces generated by the observed computing system. In these extreme circumstances the pattern of sequences of primitive actions (execution traces) which is observed by an external observer cannot be designed and/or forecast in advance. We have also taken into account in our framework that security policies are partial-natured. To manage the outlined problem we need tools which are approximately able to discover secure or insecure patterns in execution traces based on presupposes of computer users. Rough set theory may be such a tool. According to it, the vagueness of a subset of a finite universe U is defined by the difference of its lower and upper approximations with respect to a partition of the universe U. Using partitions, however, is a very strict requirement. In this paper, our starting point will be an arbitrary family of subsets of U. Neither that this family of sets covers the universe nor that the universe is finite will be assumed. This new approach is called the partial approximative set theory. We will apply it to build up a new security model for distributed software systems solely focusing on their externally observable executions and to find out whether the observed system is secure or not.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133038841","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

Bidirectional voting and continuous voting concepts as possible use of Internet in democratic voting process 双向投票和连续投票的概念尽可能利用互联网在民主投票过程中

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5680038

Jacek Wachowicz

引用次数: 1

APyCA: Towards the automatic subtitling of television content in Spanish APyCA:西班牙语电视内容的自动字幕

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5680055

Aitor Álvarez, A. D. Pozo, Andoni Arruti

引用次数: 12

BeesyBees - efficient and reliable execution of service-based workflow applications for BeesyCluster using distributed agents BeesyBees -使用分布式代理为BeesyCluster高效可靠地执行基于服务的工作流应用程序

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679922

P. Czarnul, Mariusz R. Matuszek, Michal Wójcik, Karol Zalewski

{"title":"BeesyBees - efficient and reliable execution of service-based workflow applications for BeesyCluster using distributed agents","authors":"P. Czarnul, Mariusz R. Matuszek, Michal Wójcik, Karol Zalewski","doi":"10.1109/IMCSIT.2010.5679922","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679922","url":null,"abstract":"The paper presents an architecture and implementation that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middleware that allows users to access distributed resources as well as publish applications as services, define service costs, grant access to other users and consume services published by others. Workflows created in the BeesyCluster middleware are exported to BPEL and executed by agents in a distributed environment. As a proof of concept, we have implemented a real workflow for parallel processing of digital images and tested it in a real cluster-based environment. Firstly, we demonstrate that engaging several agents for distributed execution is more efficient than a centralized approach.We also show increasing negotiation time in case of too many agents. Secondly, we demonstrate that execution in the proposed environment is reliable even in case of failures. If a service fails, a task agent picks a new equivalent service at runtime. If one of task agents fails, another of remaining agents takes over its responsibilities. The communication between the middleware, agents and services is encrypted.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117062278","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

Automatic visual object formation using image fragment matching 使用图像片段匹配自动视觉对象形成

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679732

M. Paradowski, A. Sluzek

引用次数: 6

Application of optimal settings of the LMS adaptive filter for speech signal processing LMS自适应滤波器的最佳设置在语音信号处理中的应用

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679739

J. Vanus, V. Stýskala

引用次数: 20

Matura Evaluation experiment based on human evaluation of machine translation 基于人对机器翻译评价的成熟度评价实验

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679864

Aleksandra Wojak, F. Gralinski

引用次数: 4

SyMGiza++: A tool for parallel computation of symmetrized word alignment models symgiz++:一个用于并行计算对称字对齐模型的工具

Proceedings of the International Multiconference on Computer Science and Information Technology Pub Date : 2010-10-01 DOI: 10.1109/IMCSIT.2010.5679866

Marcin Junczys-Dowmunt, A. Szal

引用次数: 5