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

2009 International Conference on Knowledge and Systems Engineering最新文献

筛选
英文 中文
Using Hyperlink Texts to Improve Quality of Identifying Document Topics Based on Wikipedia 利用超链接文本提高基于维基百科的文档主题识别质量
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.20
Dat T. Huynh, T. Cao, P. H. Pham, Toan N. Hoang
{"title":"Using Hyperlink Texts to Improve Quality of Identifying Document Topics Based on Wikipedia","authors":"Dat T. Huynh, T. Cao, P. H. Pham, Toan N. Hoang","doi":"10.1109/KSE.2009.20","DOIUrl":"https://doi.org/10.1109/KSE.2009.20","url":null,"abstract":"This paper presents a method to identify the topics of documents based on Wikipedia category network. It is to improve the method previously proposed by Schonhofen by taking into account the weights of words in hyperlink texts in Wikipedia articles. The experiments on Computing and Team Sport domains have been carried out and showed that our proposed method outperforms the Schonhofen’s one.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115138964","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}
引用次数: 10
Design of Virtual Abdominal Surgery System for the UK's Royal Bournemouth Hospital 英国皇家伯恩茅斯医院虚拟腹部手术系统的设计
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.8
Hui Liang, Minyong Shi
{"title":"Design of Virtual Abdominal Surgery System for the UK's Royal Bournemouth Hospital","authors":"Hui Liang, Minyong Shi","doi":"10.1109/KSE.2009.8","DOIUrl":"https://doi.org/10.1109/KSE.2009.8","url":null,"abstract":"The importance of Virtual Surgery Simulation is recognizing by medical society for its apparent benefits. The design of Virtual Abdominal Surgery System (VASS) for the UK’s Royal Bournemouth Hospital, which will be used in interactive surgical training and surgery planning, is provided in this paper. The architecture and main functions of VASS are discussed as well as some extension functions. An evaluation plan is suggested at the end of the paper.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354985","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
Novel Algorithms to Steganalysis of Uncompressed and Compressed Images 未压缩和压缩图像隐写分析的新算法
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.21
Ho Thi Huong Thom, Ho Van Canh, T. N. Tien
{"title":"Novel Algorithms to Steganalysis of Uncompressed and Compressed Images","authors":"Ho Thi Huong Thom, Ho Van Canh, T. N. Tien","doi":"10.1109/KSE.2009.21","DOIUrl":"https://doi.org/10.1109/KSE.2009.21","url":null,"abstract":"A large number of commercial steganographic programs use the Least Significant Bit (LSB) embedding as the method of choice for message hiding in 24-bit, 8-bit color images and grayscale images or non-zero DCT coefficients (compressed images-JPEG images) and DWT coefficients of high subbands (compressed images – JPEG2000 images). It is commonly believed that changes to the LSBs of colors (or DCT coefficients) cannot be detected due to noise that is always present in digital images. In this paper, we introduce two novel methods of steganalysis that can detect LSB embedding reliably in both spatial domain and frequency domain. Methods of statistical estimation and statistical hypothesis test are applied for our problem","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115660794","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 New CPT Extension Scheme for High Data Embedding Ratio in Binary Images 一种新的二值图像高数据嵌入率CPT扩展方案
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.29
P. Huy, Vu Phuong Bac, N. M. Thang, T. D. Manh, Vu Tien Duc, Nguyen Tuan Nam
{"title":"A New CPT Extension Scheme for High Data Embedding Ratio in Binary Images","authors":"P. Huy, Vu Phuong Bac, N. M. Thang, T. D. Manh, Vu Tien Duc, Nguyen Tuan Nam","doi":"10.1109/KSE.2009.29","DOIUrl":"https://doi.org/10.1109/KSE.2009.29","url":null,"abstract":"In this paper, an extension of CPT scheme (CPTE for short) is introduced. In watermarking area, this is a block-based approach. Given a binary image B, in each block F of a size m×n of B, by CPT scheme, ones can embed r = Round(log2(m.n+1)) bits by changing at most two entries of F. In our CPTE scheme, r = Round(log2(m.n)) + 1 bits can be embedded by changing at most two entries of F, too. That means, in most cases, the number of embedded bits given by our CPTE scheme is larger than that by CPT scheme one bit. As a consequence, we establish a new modified scheme-MCPTE based on CPTE scheme to control the quality for security of the embedded blocks, in the same way due to [Tseng-Pan, 2001]. Experimental results show that in general, MCPTE scheme gives more embedded bits than those by Tseng-Pan’ scheme, while the quality is the same.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129475685","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
Building a Low-latency, Proximity-aware DHT-Based P2P Network 构建低延迟、邻近感知的基于dht的P2P网络
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.49
Ngoc Ben Dang, S. Vu, H. Nguyen
{"title":"Building a Low-latency, Proximity-aware DHT-Based P2P Network","authors":"Ngoc Ben Dang, S. Vu, H. Nguyen","doi":"10.1109/KSE.2009.49","DOIUrl":"https://doi.org/10.1109/KSE.2009.49","url":null,"abstract":"DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for Chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a Chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two techniques: identifier selection in node joining phase and neighbor selection in network stabilization phase, both are performed based on physical network latency. We have evaluated our proposed solution by simulations. In a simulation network with 4096 nodes, the average latency of routing process in our method can reduces 30% comparing with the conventional Chord routing method.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131636936","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
Multi-class Minimax Probability Machine 多类极大极小概率机
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.46
Tat-Dat Dang, Ha-Nam Nguyen
{"title":"Multi-class Minimax Probability Machine","authors":"Tat-Dat Dang, Ha-Nam Nguyen","doi":"10.1109/KSE.2009.46","DOIUrl":"https://doi.org/10.1109/KSE.2009.46","url":null,"abstract":"This paper investigates the multi-class Minimax Probability Machine (MPM). MPM constructs a binary classifier that provides a worst-case bound on the probability of misclassification of future data points, based on reliable estimates of means and covariance matrices of the classes from the training data points. We propose a method to adapt MPM to multi-class datasets using the one-against-all strategy. And then we introduce an optimal kernel for MPM for each specific dataset found by Genetic Algorithms (GA) [1]. The proposed method was evaluated on stomach cancer data. The obtained results are better and more stable than for using a single kernel.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133517696","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
In?uenza-specific Amino Acid Substitution Model 在吗?流感特异性氨基酸取代模型
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.27
Dang Cao Cuong, Le Si Quang, L. Vinh
{"title":"In?uenza-specific Amino Acid Substitution Model","authors":"Dang Cao Cuong, Le Si Quang, L. Vinh","doi":"10.1109/KSE.2009.27","DOIUrl":"https://doi.org/10.1109/KSE.2009.27","url":null,"abstract":"Amino acid substitution model is a crucial component in protein sequence comparative systems such as protein sequence similarity searching, protein sequence alignment, and protein phylogenetic analysis. Although several general amino acid substitution models have been estimated from large protein databases, they might not be appropriate for analyzing specific species. In this paper, we apply the maximum likelihood approach to all influenza protein sequences to estimate an amino acid substitution model of so-called I09 for influenza viruses. Comparing I09 with fourteen other widely used models, we achieve remarkable results: (1) a likelihood improvement of phylogenetic trees based on I09 compared with other models. Precisely, I09 results in the best likelihood in 436 out of 489 cases tested; (2) tree topologies constructed with I09 and other models are frequently different indicating that the impact of I09 is not only on the likelihood improvement but also in tree topologies; (3) marked differences between I09 and other models revealing that existing models are not be able to capture the amino acid substitution process of influenza viruses.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114265230","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
An Aesthetic Solution for Photo Collection Page Layout 图片集页面布局的美学解决方案
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.34
Xinxiao Li, Yoshifumi Takayama, N. Shimizu, Toshiki Mori
{"title":"An Aesthetic Solution for Photo Collection Page Layout","authors":"Xinxiao Li, Yoshifumi Takayama, N. Shimizu, Toshiki Mori","doi":"10.1109/KSE.2009.34","DOIUrl":"https://doi.org/10.1109/KSE.2009.34","url":null,"abstract":"A \"slicing structure\" or a hierarchical partition of the display space is an efficient way to present photo collections. However, with different aspect ratios or areas of basic blocks, the prevalent framework creates a number of irregular dead spaces that remain unfilled. In this paper, an efficient solution to reduce or completely eliminate these dead spaces is developed by globally adjusting positions and sizes of basic blocks. The gutter thickness is also uniquely specified to augment the aesthetic appeal. We present a detailed description of the aesthetic solution with experiments to demonstrate its efficiency.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068296","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
Fast and Realistic 2D Facial Animation Based on Image Warping 基于图像扭曲的快速逼真的2D面部动画
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.48
Le Hung Bui, T. D. Bui
{"title":"Fast and Realistic 2D Facial Animation Based on Image Warping","authors":"Le Hung Bui, T. D. Bui","doi":"10.1109/KSE.2009.48","DOIUrl":"https://doi.org/10.1109/KSE.2009.48","url":null,"abstract":"Facial animation has contributed to many fields such as movies, computer games, education and e-commerce. Facial animation is obtained in two ways: pre-calculated animation and real-time animation. Pre-calculated animation often produces very realistic results with very powerful computer systems and is often used for animated movies. Real-time animation often produces lower quality results due to the real-time requirements and is often used for interactive applications. We propose in this paper a real-time animation method which operates on a 2D image of face. We simulate the effect of facial muscles with image warping techniques. Our method can produce realistic facial expressions and can be easily deployed on not very strong environments such as web pages, mobile phones and PDAs.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121394698","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
A Hybrid Approach to Vietnamese Word Segmentation Using Part of Speech Tags 一种基于词性标签的越南语分词混合方法
2009 International Conference on Knowledge and Systems Engineering Pub Date : 2009-10-13 DOI: 10.1109/KSE.2009.44
Dang Duc Pham, G. Tran, S. Pham
{"title":"A Hybrid Approach to Vietnamese Word Segmentation Using Part of Speech Tags","authors":"Dang Duc Pham, G. Tran, S. Pham","doi":"10.1109/KSE.2009.44","DOIUrl":"https://doi.org/10.1109/KSE.2009.44","url":null,"abstract":"Word segmentation is one of the most important tasks in NLP. This task, within Vietnamese language and its own features, faces some challenges, especially in words boundary determination. To tackle the task of Vietnamese word segmentation, in this paper, we propose the WS4VN system that uses a new approach based on Maximum matching algorithm combining with stochastic models using part-of-speech information. The approach can resolve word ambiguity and choose the best segmentation for each input sentence. Our system gives a promising result with an F-measure of 97%, higher than the results of existing publicly available Vietnamese word segmentation systems.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236950","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}
引用次数: 45
首页 上一页 下一页 尾页
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学术官方微信