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

筛选
英文 中文
Mean-Variance Models for International Portfolio Selection with Uncertain Exchange Rates and Security Returns 汇率与证券收益不确定情况下国际投资组合选择的均值-方差模型
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480377
Xiaoxia Huang
{"title":"Mean-Variance Models for International Portfolio Selection with Uncertain Exchange Rates and Security Returns","authors":"Xiaoxia Huang","doi":"10.1109/ICISA.2010.5480377","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480377","url":null,"abstract":"With the liberalization in capital flows and the advances in telecommunication and computer technology, international portfolio selection has been becoming a hot topic for both practitioners and researchers. In traditional international portfolio selection, security selection used to be decided first without considering the fluctuation of foreign exchange rates. Then hedging strategies were made to eliminate the fluctuation of foreign exchange rates. In addition, the security returns and the foreign exchange rates were usually assumed to be random variables. However, in reality, it is usually difficult for many currencies except major currencies to find suitable instruments to make effective currency hedging though cross- hedging may be of some help. In addition, hedging strategy may not be a good choice because the foreign exchange rate fluctuation may also bring the high return to the investors. Furthermore, there are many researches showing that security returns may not be random sometimes. In this paper, we discuss international portfolio selection problem with both foreign exchange rates and security returns containing a new type of uncertainty which is neither random nor fuzzy. Based on the latest development on uncertainty theory, we develop new mean-variance models considering the uncertain foreign exchange rates and security returns simultaneously. To solve the new models in general cases, a hybrid intelligent algorithm is provided. As an illustration, an example is also presented.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129340802","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
Line-Based Recognition Using 3D Lines and Occlusion Query 基于三维线和遮挡查询的线识别
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480526
Jae-Kyu Lee, Seongjin Ahn, Jin-Wook Chung
{"title":"Line-Based Recognition Using 3D Lines and Occlusion Query","authors":"Jae-Kyu Lee, Seongjin Ahn, Jin-Wook Chung","doi":"10.1109/ICISA.2010.5480526","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480526","url":null,"abstract":"We present an algorithm to model 3D workspace and to understand test scene for navigation or human computer interaction in network-based mobile robot. This was done by line-based modelling and recognition algorithm. Line-based recognition using 3D lines has been tried by many researchers however its reliability still needs improvement due to ambiguity of 3D line feature information from original images. To improve the outcome, we approach firstly to find real planes using the given 3D lines and then to implement recognition process. The methods we use are principle component analysis (PCA), plane sweep, visibility test, and iterative closest point (ICP). During the implementation, we also use 3D map information for localization. We apply this algorithm to real test scene images and to find out our result can be useful to identify doors or walls in indoor environment with better efficiency.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060437","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
Tree Reconstruction and Bottom-Up Evaluation of Tree Pattern Queries 树模式查询的树重构和自底向上求值
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480393
Yangjun Chen, Yibin Chen
{"title":"Tree Reconstruction and Bottom-Up Evaluation of Tree Pattern Queries","authors":"Yangjun Chen, Yibin Chen","doi":"10.1109/ICISA.2010.5480393","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480393","url":null,"abstract":"An XML tree pattern query, represented as a labeled tree, is essentially a complex selection predicate on both structure and content of an XML. Tree pattern matching has been identified as a core operation in querying XML data. However, almost all the proposed algorithms only deal with unordered trees, by which the order of siblings is not considered. In this paper, we discuss a new algorithm for processing ordered tree pattern queries, for which not only the ancestor-descendant and parent-child relationships, but also the order of siblings are significant. The time complexity of the algorithm is bounded by O(|D||Q| + |T|leafQ) and its space overhead is by O(leafTleafQ), where T stands for a document tree, Q for a tree pattern query and D is a largest data stream associated with a query node q of Q, which contains the database nodes that match the node predicate at q. leafT (leafQ) represents the number of the leaf nodes of T (resp. Q). In addition, the algorithm can be adapted to an indexing environment with XB-trees being used. Experiments have been conducted, which shows that the new algorithm is promising.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307050","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
Grid Resource Discovery over Distributed Routers 分布式路由器上的网格资源发现
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480320
T. Koçak, D. Lacks
{"title":"Grid Resource Discovery over Distributed Routers","authors":"T. Koçak, D. Lacks","doi":"10.1109/ICISA.2010.5480320","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480320","url":null,"abstract":"Computational grids have emerged as a new paradigm for solving large complex problems over the recent years. The problem space and data set are divided into smaller pieces that are processed in parallel over the grid network and reassembled upon completion. Typically, resources are logged into a resource broker that is somewhat aware of all of the participants available on the grid. The resource broker scheme can be a bottleneck because of the amount of computational power and network bandwidth needed to maintain a fresh view of the grid. In this paper, we propose to place the load of managing the network resource discovery on to the network itself: inside of the routers. In the proposed protocol, the routers contain tables for resources similar to routing tables. These resource tables map IP addresses to the available computing resource values, which are provided through a scoring mechanism. Each resource provider is scored based on the attributes they provide such as the number of processors, processor frequency, amount of memory, hard drive space, and the network bandwidth. The resources are discovered on the grid by the protocol's discovery packets, which are encapsulated within the TCP/IP packets. The discovery packet visits the routers and look up in the resource tables until a satisfactory resource is found. The protocol is validated by simulations with five different deployment environments.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368272","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
Linguistic Aspects of Ubiquitous Computing: On "Ubiquitous" in Japanese and Korean Information Technology 泛在计算的语言方面:关于日语和韩语信息技术中的“泛在”
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480575
Håkan Soderstrom
{"title":"Linguistic Aspects of Ubiquitous Computing: On \"Ubiquitous\" in Japanese and Korean Information Technology","authors":"Håkan Soderstrom","doi":"10.1109/ICISA.2010.5480575","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480575","url":null,"abstract":"The term \"ubiquitous computing\" has been reshaped by a world-wide journey. It originated in the West, but began to subside from use. The u-word traveled East and was picked up by national information technology programs in Japan and Korea. These countries re-created the word \"ubiquitous\" as a loanword in Japanese and Korean, adding new energy. This paper tracks ubiquitous computing first from academia to Japanese and Korean government policy documents and then to the general public in these countries. When the loanwords are reflected back into English they are sometimes used in ways that baffle Westerners. The word \"computing\" has been dropped, but is understood in the remaining adjective \"ubiquitous\". Practical advice is offered for effective international communication about ubiquitous computing. The future of ubiquitous terminology is sketched. Opportunities for Korean-Japanese linguistic cooperation are suggested.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123372516","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
Graphic Visualization of the Co-Occurrence Analysis Network of Lung Cancer In-Patient Nursing Record 肺癌住院护理记录共现分析网络的图形可视化
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480413
M. Kushima, K. Araki, Muneou Suzuki, S. Araki, Terue Nikama
{"title":"Graphic Visualization of the Co-Occurrence Analysis Network of Lung Cancer In-Patient Nursing Record","authors":"M. Kushima, K. Araki, Muneou Suzuki, S. Araki, Terue Nikama","doi":"10.1109/ICISA.2010.5480413","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480413","url":null,"abstract":"Although the nursing record provides a complete account of a patient's information, it is not fully utilized. The relevant information including laboratory results, remarks made by doctors and nurses is not taken into consideration. Knowledge concerning the condition and treatment of patients has been determined in a twofold manner: a text mining technique has identified relations between feature vocabularies seen in past lung cancer in-patient records accumulated on University of Miyazaki Hospital electronic medical record, and an extraction has been attempted to solve the above-mentioned problem in the present study. The result was an analysis of a qualitative lung cancer in- patients' nursing record that used the text mining technique, and the initial goal was achieved: a visual record of this information. In addition, this enabled the discovery of vocabularies relating to the proper methods of treatment, resulting in a concise summary of the vocabularies extracted from the content of the lung cancer in-patients' nursing record. Important vocabularies characterizing each nursing record were also revealed.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115232772","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
The Improvement of SBC for a Multipoint Conference in a Ubiquitous Environment 泛在环境下多点会议的SBC改进
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480570
Eunsung Park, Dong-su Seong, Keon-bae Lee
{"title":"The Improvement of SBC for a Multipoint Conference in a Ubiquitous Environment","authors":"Eunsung Park, Dong-su Seong, Keon-bae Lee","doi":"10.1109/ICISA.2010.5480570","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480570","url":null,"abstract":"In a ubiquitous environment, a communication and computing service can be taken without the limitation of the time and space. A conference service is one among the techniques implemented basically and used widely for such environment. The multipoint conference in a ubiquitous environment would be operated mostly in the private network to give the effect of the firewall. In this paper, we introduce SBC method to solve the some problem of the multipoint conference operation in a firewall environment, propose an algorithm to improve the existing SBC method.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130723471","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 Design of Embedding Rewiring into Routing for FPGA Improvement 一种基于FPGA改进的嵌入布线设计
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480310
Y. Wong, Qiang Zhou, Jinian Bian
{"title":"A Design of Embedding Rewiring into Routing for FPGA Improvement","authors":"Y. Wong, Qiang Zhou, Jinian Bian","doi":"10.1109/ICISA.2010.5480310","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480310","url":null,"abstract":"Rewiring is a useful technique that perturbs the logic of Look-Up Tables (LUTs) without changing the functions of circuits. This internal logic perturbation can be used to trade for critical LUT-external logic/wire removals for EDA improvements. In this paper, we design a flow of embedding the rewiring engine into routing process for FPGA improvement. In our design, we change the priorities of target wires according to their net delays for the purpose of acquiring the best delay reduction. Then we use our evaluation function to expand the choices of alternative wires. We also design a method to choose the pins of Configurable Logic Blocks (CLBs) which have more than one unused pins. We use VPR as our place-and-route tool. Compared with the high quality results of VPR, our method can reduce the critical path delay up to 8.6%. These encouraging results suggest that the optimization domain of FPGA flow still has much room to explore and rewiring technique will be a simple and powerful choice.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126226466","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
Agent Attacks Using a TTL Transformation of Windows Registry 使用Windows注册表的TTL转换的代理攻击
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480287
W. Park, K. Park, Keon il Heo, K. Kook
{"title":"Agent Attacks Using a TTL Transformation of Windows Registry","authors":"W. Park, K. Park, Keon il Heo, K. Kook","doi":"10.1109/ICISA.2010.5480287","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480287","url":null,"abstract":"As we can see from the recent cyber terrors, the cyber terror is becoming more complicated, intelligent, and causing more damage. To react more effectively to the future cyber terrors, it will be necessary to anticipate new cyber terror techniques and devise the preventive measures for the possible vulnerabilities of the system before the hackers actually disable the system. This paper designs and implements new technique for the cyber terror. It transforms the TTL value of the window registry to a smaller value than needed. Then, the packets are discarded before they reach the destination and the connection to the destination host cannot be established.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125307864","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
Cryptanalysis of Four-Rounded DES Using Ant Colony Optimization 基于蚁群优化的四角DES密码分析
2010 International Conference on Information Science and Applications Pub Date : 2010-04-21 DOI: 10.1109/ICISA.2010.5480260
Salabat Khan, W. Shahzad, F. A. Khan
{"title":"Cryptanalysis of Four-Rounded DES Using Ant Colony Optimization","authors":"Salabat Khan, W. Shahzad, F. A. Khan","doi":"10.1109/ICISA.2010.5480260","DOIUrl":"https://doi.org/10.1109/ICISA.2010.5480260","url":null,"abstract":"It is hard for the cryptanalysts to apply traditional techniques and brute-force attacks against feistel ciphers due to their inherent structure based on high nonlinearity and low autocorrelation. In this paper, we propose a technique for the cryptanalysis of four-rounded Data Encryption Standard (DES) based on Binary Ant Colony Optimization (BACO). A known plaintext attack is used to recover the secret key of the DES cipher. The environment for the ants is a directed graph, which we call search space, is constructed for efficiently searching the secret key. We also develop a heuristic function which measures the quality of a constructed solution. Several optimum keys are computed over different runs on the basis of routes completed by the ants. These optimum keys are then used to find each individual bit of the 56 bit secret key used by DES. The results of our experiments show that ACO is an effective technique for the cryptanalysis of four-rounded DES. To the best of our knowledge, this is the first time that BACO has been used for this specific problem.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116900868","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}
引用次数: 17
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学术官方微信