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

2011 International Conference on Information Science and Applications最新文献

筛选
英文 中文
Formant Synthesis of Haegeum: A Sound Analysis/Synthesis System Using Cepstral Envelope 奚琴的形成峰合成:一个使用倒谱包络的声音分析/合成系统
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772408
Myeongsu Kang, Yeon-Woo Hong
{"title":"Formant Synthesis of Haegeum: A Sound Analysis/Synthesis System Using Cepstral Envelope","authors":"Myeongsu Kang, Yeon-Woo Hong","doi":"10.1109/ICISA.2011.5772408","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772408","url":null,"abstract":"This paper presents a formant synthesis method of haegeum using cepstral envelope for spectral modeling. Spectral modeling synthesis (SMS) is a technique that models time-varying spectra as a combination of sinusoids (the \"deterministic\" part), and a time-varying filtered noise component (the \"stochastic\" part). SMS is appropriate for synthesizing sounds of string and wind instruments whose harmonics are evenly distributed over whole frequency band. Formants (or acoustic resonances) are extracted from cepstral envelope and we use them for synthesizing sinusoids. A second-order digital resonator by the impulse-invariant transform (IIT) is applied to generate deterministic components and the results are band-pass filtered to adjust magnitude. The noise is calculated by first generating the sinusoids with formant synthesis, subtracting them from the original sound, and then removing some harmonics remained. A line-segment approximation is used to model noise components. The synthesized sounds are consequently by adding sinusoids, which are shown to be similar to the original haegeum sounds.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129869771","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
Culturally Influenced Risk Exposure: A New Approach to Tackle Risks in Offshore Outsourcing 文化影响下的风险暴露:应对离岸外包风险的新途径
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772319
Sakgasit Ramingwong, L. Ramingwong
{"title":"Culturally Influenced Risk Exposure: A New Approach to Tackle Risks in Offshore Outsourcing","authors":"Sakgasit Ramingwong, L. Ramingwong","doi":"10.1109/ICISA.2011.5772319","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772319","url":null,"abstract":"Culture is arguably perceived as the most influential risk factor in offshore outsourcing of software projects. Yet, due to its intangible characteristics, quantifying and systematizing this factor seems to be impracticable. This paper proposes a new approach to enhance risk assessment process by involving culture in the calculation. The results from this new approach suggest a better evaluation of risk which leads to more appropriate planning and mitigation.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179640","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
A Methodology for Accurate and Redundancy-Free Business Requirements Description Using Ontology 一种基于本体的准确无冗余业务需求描述方法
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772352
Hakyoul Choe, S. Moon
{"title":"A Methodology for Accurate and Redundancy-Free Business Requirements Description Using Ontology","authors":"Hakyoul Choe, S. Moon","doi":"10.1109/ICISA.2011.5772352","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772352","url":null,"abstract":"Data deluge and changing business environment are considered to be serious in that data in corporate information systems are too conveniently and frequently replicated for companies to make decisions properly. Inaccurate and redundant data would induce erroneous decision making which bases on error-infectious information systems. We report that most of inaccuracy and redundancy can be effectively removed from the very start of information system development using business description. Over the last few decades, a few efforts to make business descriptions correctly have been directed toward ontology for business requirements elicitation. However, due to excessive reliance on stale knowledge of past documents, most ontology based systems have failed to formulate appropriate business requirements for up-to-date business circumstances. We propose a new enhanced method which can formulate a flexible business description on the basis of local domain ontology as well as prior knowledge bases. In addition to utilizing ontology as business requirements description, our method focuses on accuracy and redundancy in business requirements description. To evaluate the methodology, we devised a new system of ontology integration for business requirements description.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120938199","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
How to Reduce Network Interrupt Latency for Real-Time Processing 如何减少实时处理的网络中断延迟
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772419
Daesung Lee, Kuinam J. Kim
{"title":"How to Reduce Network Interrupt Latency for Real-Time Processing","authors":"Daesung Lee, Kuinam J. Kim","doi":"10.1109/ICISA.2011.5772419","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772419","url":null,"abstract":"There are efforts to transform the Linux system to a real-time system as it becomes very popular and stable. Linux divides the interrupt service into two steps: Top Half and Bottom Half. When the interrupt occurs, Because of this Bottom Half which is not handled immediately, Linux is not a real-time system. Transforming Linux system into a real-time system, however, is a very difficult and time-consuming task because we have to modify the kernel in many places to ensure its correctness under repeated reentering events. We suggest limiting the effort to a certain specific interrupt, for example network interrupt, instead of trying to provide real-time handling for all interrupts. The scope is limited, and we can control the amount of shared data structures among the reentering kernel threads. We identify a special packet that requires real-time treatment and process it inside the Top Half without delaying. This thesis explains the algorithm and shows how it is implemented in Linux.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610592","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
Ontology Based Context Information Model for u-Healthcare Service 基于本体的u-医疗服务上下文信息模型
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772429
Joong-Kyung Ryu, Jong-Hun Kim, Kyung-Yong Chung, K. Rim, Jung-Hyun Lee
{"title":"Ontology Based Context Information Model for u-Healthcare Service","authors":"Joong-Kyung Ryu, Jong-Hun Kim, Kyung-Yong Chung, K. Rim, Jung-Hyun Lee","doi":"10.1109/ICISA.2011.5772429","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772429","url":null,"abstract":"One of the personalized service in the ubiquitous For establishing real u-health environments, it is necessary to receive the context information obtained from various platforms at proper time in portable devices, which are operated in both wire and wireless communication. And, a knowledge model that reflects the information and characteristics for such services while it is appropriate for medical references is required. This paper develops a healthcare context information model based on ontology in order to perform a ubiquitous environment. In addition, the context information will be extracted and classified for implementing the healthcare service used for the context information model. In the healthcare context information model, it can be established using ontology, and a common healthcare model will be developed by considering medical references and service environments. Application and healthcare service developers can use the sensing information in various environments by authoring device and space ontologies based on this common ontology.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738216","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
A Study on Malicious Codes Pattern Analysis Using Visualization 基于可视化的恶意代码模式分析研究
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772330
Donghwi Lee, In Soo Song, Kuinam J. Kim, Jun-hyeon Jeong
{"title":"A Study on Malicious Codes Pattern Analysis Using Visualization","authors":"Donghwi Lee, In Soo Song, Kuinam J. Kim, Jun-hyeon Jeong","doi":"10.1109/ICISA.2011.5772330","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772330","url":null,"abstract":"The expansion of internet technology has made convenience. On the one hand various malicious code is produced. The number of malicious codes occurrence has dramatically increasing, and new or variant malicious code circulation very serious, So it is time to require analysis about malicious code. The being so malicious code pattern extract for malicious code properties of anti-virus company. Visualization possible to make one image for thousands upon thousands of malicious code. and It is possible to extract unseen pattern. Therefore this paper of object is various malicious code analysis besides new or variant malicious code type or form deduction using visualization of strong. Thus this paper proposes unseen malicious code pattern extract.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127607046","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}
引用次数: 25
Prediction of Sunspot Series Using a Recurrent Neural Network 利用递归神经网络预测太阳黑子序列
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772339
Dong-Chul Park
{"title":"Prediction of Sunspot Series Using a Recurrent Neural Network","authors":"Dong-Chul Park","doi":"10.1109/ICISA.2011.5772339","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772339","url":null,"abstract":"A prediction scheme for sunspot series using a Recurrent Neural Network is proposed in this paper. The recurrent neural network adopted in this scheme is the Bilinear recurrent neural network (BRNN). Since the BRNN is based on the bilinear polynomial, BRNN has been successfully used in modeling highly nonlinear systems with time-series characteristics. Dynamic-BRNN (D-BRNN) further improves the convergence of BRNN and the D-BRNN can be a natural choice in predicting sunspot series. In order to evaluate the performance of the proposed D-BRNN-based predictor, experiments are conducted on the Wolf sunspot series number data and the resulting prediction accuracy is compared with those of conventional MultiLayer Perceptron Type Neural Network (MLPNN)-based and BRNN-based predictors. The results show that the proposed D-BRNN-based predictor outperforms the MLPNN-based and BRNN-based predictors in terms of the Normalized Mean Squared Error (NMSE).","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130519058","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
Considering Barrier Synchronization Overhead in Parallelizing Cryptographic Algorithms 并行加密算法中屏障同步开销的考虑
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772401
Sungju Lee, Eunji Lee, Yongwha Chung, Myungho Lee
{"title":"Considering Barrier Synchronization Overhead in Parallelizing Cryptographic Algorithms","authors":"Sungju Lee, Eunji Lee, Yongwha Chung, Myungho Lee","doi":"10.1109/ICISA.2011.5772401","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772401","url":null,"abstract":"As a multi-core processor has been announced recently, many multimedia applications are being parallelized in order to reduce the execution time. Although the size of multimedia data to be protected is huge, it is difficult to efficiently speed up some cryptography algorithms due to data dependence. In this paper, we propose a general approach which parallelizes cryptographic algorithms having data dependency in order to reduce the execution time for huge data. After analyzing the parallel overhead with AES as an example of cryptographic algorithms having data dependency, we found the barrier synchronization overhead caused by data dependency is the most important one with some multi-core processors. Then, we overlap computations in order to solve the limited parallelism inherent in AES. That is, we interpret the problem as an application-level pipeline and derive the optimum number of pipeline stages by considering the barrier synchronization overhead.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690487","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
Using Tag-Neighbors for Query Expansion in Medical Information Retrieval 在医学信息检索中使用标签邻域进行查询扩展
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772324
F. Durão, K. Bayyapu, Guandong Xu, Peter Dolog, Ricardo Lage
{"title":"Using Tag-Neighbors for Query Expansion in Medical Information Retrieval","authors":"F. Durão, K. Bayyapu, Guandong Xu, Peter Dolog, Ricardo Lage","doi":"10.1109/ICISA.2011.5772324","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772324","url":null,"abstract":"In the context of medical document retrieval, users often under-specified queries lead to undesired search results that suffer from not containing the information they seek, inadequate domain knowledge matches and unreliable sources. To overcome the limitations of under-specified queries, we utilize tags to enhance information retrieval capabilities by expanding users' original queries with context-relevant information. We compute a set of significant tag neighbor candidates based on the neighbor frequency and weight, and utilize the most frequent and weighted neighbors to expand an entry query that has terms matching tags. The proposed approach is evaluated using MedWorm medical article collection and standard evaluation methods from the text retrieval conference (TREC). We compared the baseline of 0.353 for Mean Average Precision (MAP), reaching a MAP 0.491 (+39%) with the query expansion. In-depth analysis shows how this strategy is beneficial when compared with different ranks of the retrieval results.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128001411","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
HMM Voice Recognition Algorithm Coding HMM语音识别算法编码
2011 International Conference on Information Science and Applications Pub Date : 2011-04-26 DOI: 10.1109/ICISA.2011.5772321
S. Jarng
{"title":"HMM Voice Recognition Algorithm Coding","authors":"S. Jarng","doi":"10.1109/ICISA.2011.5772321","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772321","url":null,"abstract":"In this paper, the voice recognition algorithm based on HMM (Hidden Markov Modeling) is analyzed in detail. The HMM voice recognition algorithm is explained and the importance of voice information DB is revealed for better improvement of voice recognition rate. The feature vector of each voice characteristic parameter is chosen by means of MFCC (Mel Frequency Cepstral Coefficients). The extracting algorithm of syllable parts from continuous voice signal is introduced. This paper shows the relationship between recognition rates and number of applying syllables and number of groups for applying syllables.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129402695","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
首页 上一页 下一页 尾页
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学术官方微信