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

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)最新文献

筛选
英文 中文
An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem 双机流水车间总延迟问题的混合元启发式、混合下界和禁忌搜索
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719893
Q. Ta, J. Billaut, J. Bouquard
{"title":"An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem","authors":"Q. Ta, J. Billaut, J. Bouquard","doi":"10.1109/RIVF.2013.6719893","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719893","url":null,"abstract":"The classical F2∥ΣTj problem is considered. A Tabu search and a matheuristic algorithm are proposed as upper bounds and a lower bound based on a partial relaxation of the MILP model is proposed. All these methods have been extensively tested on randomly generated instances. The results show the performances of the Tabu search algorithm. They also show the good performances of the matheuristic and of the lower bound, preferably for small instances (up to 100 jobs).","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128910225","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
Social networks analysis based on topic modeling 基于主题建模的社会网络分析
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719878
M-H. C. Nguyen, Thanh Ho, P. Do
{"title":"Social networks analysis based on topic modeling","authors":"M-H. C. Nguyen, Thanh Ho, P. Do","doi":"10.1109/RIVF.2013.6719878","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719878","url":null,"abstract":"Understanding the discussed content in social networks is an uneasy problem but brings a lot of advantages for different fields, such as marketing, education, social trends, security. To build up the system for supporting products marketing in social networks, we develop models of content-based social networks analysis in order to find out the discussed topics. The system consists of steps, such as extracting messages, discovering and automatically labeling the discussed topics, in which we pay attention to time factor. Experimented with the Enron corpus containing 11,945 e-mails discussed by 147 users and estimated 50 topics, the system has found out many useful topics and opened new research and application directions.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134474132","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}
引用次数: 12
Parallel phrase extraction from English-Vietnamese parallel corpora 从英越平行语料库中提取平行短语
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719889
Quang-Hung Le, Anh-Cuong Le, V. Huynh
{"title":"Parallel phrase extraction from English-Vietnamese parallel corpora","authors":"Quang-Hung Le, Anh-Cuong Le, V. Huynh","doi":"10.1109/RIVF.2013.6719889","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719889","url":null,"abstract":"Parallel phrases are important for some Natural Language Processing (NLP) tasks such as machine translation or cross language information retrieval. This paper proposes a novel method to extract parallel phrases from English-Vietnamese parallel corpora. In this method, we use predefined syntactic patterns and phrase translation probabilities for determining parallel phrases. The experiments are conducted on English-Vietnamese parallel corpora and have shown that our method increases 79:72% of Fscore for obtaining parallel phrases in comparison with a baseline.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129706981","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
Effects of migration of three competing species on their distributions in multizone environment 多区环境下三种竞争物种迁移对其分布的影响
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719898
T. H. Phan, Ngoc Doanh Nguyen, Kévin Perrot
{"title":"Effects of migration of three competing species on their distributions in multizone environment","authors":"T. H. Phan, Ngoc Doanh Nguyen, Kévin Perrot","doi":"10.1109/RIVF.2013.6719898","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719898","url":null,"abstract":"In this paper, we investigate the relationship between migration and species distribution in multizone environment. We present a discrete model for migration of three competing species over three zones. We prove that the migration tactics of species leads to the fact that the system exponentially converges to one of two typical configurations: the first one is a case where each zone contains only one species, the second one is a case where one species is of density 1 in one zone, another species stays and dominates in the two other zones, and the last species is evenly split into the 3 zones with a density one third in each. We also show a characterization of the initial conditions under which the system converges to one of the two configurations.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"508 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198719","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 assume-guarantee model checker for component-based systems 基于组件的系统的假设保证模型检查器
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719860
Duong Hoang-Minh, Trinh Le-Khanh, Pham Ngoc Hung
{"title":"An assume-guarantee model checker for component-based systems","authors":"Duong Hoang-Minh, Trinh Le-Khanh, Pham Ngoc Hung","doi":"10.1109/RIVF.2013.6719860","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719860","url":null,"abstract":"This paper introduces an assume-guarantee model checker, named AGMC, for verifying correctness of designs of component-based systems. Given UML 2.0 sequence diagrams that describe behaviors of the system components and a required property, AGMC generates accurate models of the components represented by labeled transition systems (LTSs) automatically. AGMC then model checks that whether the system satisfies the property by using the assume-guarantee verification method. AGMC has been implemented and tested by applying some typical component-based systems. The implemented AGMC is not only useful to verify component-based systems in practice but also has a potential to solve the state space explosion problem in model checking.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127139978","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
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs 梯形图最大匹配的O(n(log n)3)算法
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719886
N. Le, Phan-Thuan Do
{"title":"An O(n(log n)3) algorithm for maximum matching in trapezoid graphs","authors":"N. Le, Phan-Thuan Do","doi":"10.1109/RIVF.2013.6719886","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719886","url":null,"abstract":"Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many graph problems that are NP-hard in general case have polynomial time algorithms for trapezoid graphs. A matching in a graph is a set of pairwise non-adjacent edges, and a maximum matching is a matching whose cardinality is maximum. In this paper, we define a modified range tree data structure, called S-Range tree, which allows to report the maximum label of points in a rectangular region and update the label of a point efficiently. We use this data structure to construct an O(n(log n)3) algorithm for finding a maximum matching in trapezoid graphs based on their box representation. In addition, we generalize this algorithm for a larger graph class, k-trapezoid graph by using multidimensional range tree. To the best of our knowledge, this is the first efficient maximum matching algorithm for trapezoid graphs.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114644673","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
On the effect of the label bias problem in part-of-speech tagging 词性标注中标签偏差问题的影响
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719875
Hong Phuong Le, X. Phan, The-Trung Tran
{"title":"On the effect of the label bias problem in part-of-speech tagging","authors":"Hong Phuong Le, X. Phan, The-Trung Tran","doi":"10.1109/RIVF.2013.6719875","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719875","url":null,"abstract":"This paper investigates the effect of the label bias problem of maximum entropy Markov models for part-of-speech tagging, a typical sequence prediction task in natural language processing. This problem has been underexploited and underappreciated. The investigation reveals useful information about the entropy of local transition probability distributions of the tagging model which enables us to exploit and quantify the label bias effect of part-of-speech tagging. Experiments on a Vietnamese treebank and on a French treebank show a significant effect of the label bias problem in both of the languages.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114958275","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
Optimizing deep bottleneck feature extraction 优化深度瓶颈特征提取
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719885
Quoc Bao Nguyen, Jonas Gehring, Kevin Kilgour, A. Waibel
{"title":"Optimizing deep bottleneck feature extraction","authors":"Quoc Bao Nguyen, Jonas Gehring, Kevin Kilgour, A. Waibel","doi":"10.1109/RIVF.2013.6719885","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719885","url":null,"abstract":"We investigate several optimizations to a recently published architecture for extracting bottleneck features for large-vocabulary speech recognition with deep neural networks. We are able to improve recognition performance of first-pass systems from a 12% relative word error rate reduction reported previously to 21%, compared to MFCC baselines on a Tagalog conversational telephone speech corpus. This is achieved by using different input features, training the network to predict context-dependent targets, employing an efficient learning rate schedule and varying several architectural details. Evaluations on two larger German and French speech transcription tasks show that the optimizations proposed are universally applicable and yield comparable gains on other corpora (19.9% and 22.8%, respectively).","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128370824","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}
引用次数: 12
Access control cube model in the administrative system a single level 访问控制多维数据集模型在管理系统中属于单一级别
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719877
T. Minh
{"title":"Access control cube model in the administrative system a single level","authors":"T. Minh","doi":"10.1109/RIVF.2013.6719877","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719877","url":null,"abstract":"In the administrative system of the government, there are agents, which have some work and some roles. Every agent can also work in many parts. An agent role is assigned some operations to access database such as: View, Insert, Delete, Update and Publish data. An agent can work in many levels of the government. In this paper, the author designs a model in which an agent works in a single level which has 6 axes: Subjects, Operations, Parts, Objects, Roles and Times. But designing a hexagonal cube model is very complex and can cause a lot of confusion. Therefore, the separation of hexagonal cubes is the solution that the author have selected. In the separation, the objects depend on part group; the operations are attached to the role; the links of subject, part, role are called Agent Cubes; in special cases, there are some special agent cubes which are linked by set {subject, object, operation}; Each of this cube will be assigned the starting time to active cube and the ending time to deactivate cube. When each cube works in a level or a specific location, the data will be stored in database system.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124340249","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
Handling organization name unknown word in Chinese-Vietnamese machine translation 处理中越机器翻译中组织名称不明词
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719901
Phuoc Tran, Tan Le, Dinh Dien, Thao Nguyen
{"title":"Handling organization name unknown word in Chinese-Vietnamese machine translation","authors":"Phuoc Tran, Tan Le, Dinh Dien, Thao Nguyen","doi":"10.1109/RIVF.2013.6719901","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719901","url":null,"abstract":"Unknown word (UKW) is an obvious problem of machine translation and named entity (NE) is the most common UKW type. In this paper, we will present a new approach based on the meaning relationship in Chinese and Vietnamese to re-translate organization name UKW. This is the most complicated NE because it consists of other NEs and entities. Applying this approach to Chinese-Vietnamese statistical machine translation (SMT), experimental results show that our approach has significantly improved machine's performance.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121579232","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信