2010 International Conference on Computational Science and Its Applications最新文献_第3页

A QoE-Based Measurement for DiffServ Multicasting Networks 基于qos的DiffServ组播网络测量

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.51

Wu-Hsiao Hsu, Sheng-Cheng Yeh, Yuh-Pyng Shieh, Cheng-Ying Yang

引用次数: 0

I/O-Efficient Rectangular Segment Search 高效率的I/ o矩形段搜索

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.35

G. Das, B. Nickerson

{"title":"I/O-Efficient Rectangular Segment Search","authors":"G. Das, B. Nickerson","doi":"10.1109/ICCSA.2010.35","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.35","url":null,"abstract":"We consider the I/O-efficient rectangular segment search problem in 2D. The problem involves storing a given set ${cal S}$ of $N$ line segments in a data structure such that an axis aligned rectangular range query ${cal R}$ can be performed efficiently; i.e., report all line segments in ${cal S}$ which intersect ${cal R}$. We give a data structure requiring space $O(N(N/B)^2)$ disk blocks that can answer a range query ${cal R}$ using $O(log_B N + K/B)$ I/Os, where $B$ is the number of line segments transferred in one I/O, and $K$ is the number of line segments intersecting ${cal R}$. Search complexity of $O(log_B (N/B) + K/B)$ I/Os can be achieved with reduced storage if the set ${cal S}$ contains only non-intersecting line segments, orif set ${cal S}$ contains only horizontal and vertical line segments. In the former case the space complexity is $O((N/B)^2)$ disk blocks and in the latter case the space complexity is $O(N frac{log N}{loglog_B N})$.We also consider the problem of finding all the line segments which are entirely within the rectangle ${cal R}$ if the set ${cal S}$ contains only vertical and horizontal line segments. For this problem, an optimal data structure is presented with size $O(N frac{log N}{loglog_B N})$ disk blocks that requires $O(log_B (N/B) + K/B)$ I/Os to answer the query.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822720","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

Handier Use of Scilab to Draw Fine LaTeX Figures: Usage of KETpic Version for Scilab 更方便地使用Scilab来绘制精细的乳胶图形:使用Scilab的KETpic版本

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.33

Hiroaki Koshikawa, Masataka Kaneko, Satoshi Yamashita, Kiyoshi Kitahara, Setsuo Takato

{"title":"Handier Use of Scilab to Draw Fine LaTeX Figures: Usage of KETpic Version for Scilab","authors":"Hiroaki Koshikawa, Masataka Kaneko, Satoshi Yamashita, Kiyoshi Kitahara, Setsuo Takato","doi":"10.1109/ICCSA.2010.33","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.33","url":null,"abstract":"In today's technological era, technologies for drawing fine figures have become necessary for effective communication in areas such as scientific research, industry, architecture, medical service, and education. In the areas of scientific research and education, computer algebra system (CAS) has become the preferred tool because of its superb drawing utilities and symbolic computation capabilities. However, embedding the graphics generated with CAS into preferred documents such as LaTeX is limited, cumbersome and inefficient. For instance, a large sized graphical file becomes an issue for fast web-tech based communication. To remedy this issue, we have developed a macro package of CAS, named KETpic, as a convenient tool for supplying high quality graphics (produced with the aid of CAS) embedded in high-quality scientific documents (edited by LaTeX). Although its versions for Mathematica and Maple have been fully developed, we recently migrated it to a popular shareware Scilab so that more people can use it. In a sense, the extent of the facilities which a CAS provides and the expense to purchase it present a \"tradeoff'\" relation. Consequently, some extra contrivance was necessary in the migration described above. This paper illustrates that the facilities of KETpic version for Scilab become almost equal to those of its Mathematica and Maple counterparts.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329518","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}

引用次数: 7

Numerical Solutions of the Nonlinear Schrödinger Equation with a Square Root Nonlinearity 具有平方根非线性的非线性Schrödinger方程的数值解

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.68

S. Phibanchon, M. A. Allen

引用次数: 2

On the Minimization of a Circular Function on the Isomorphic Shrunk Subset 关于同构收缩子集上圆函数的极小化

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.34

L. Domakhina

{"title":"On the Minimization of a Circular Function on the Isomorphic Shrunk Subset","authors":"L. Domakhina","doi":"10.1109/ICCSA.2010.34","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.34","url":null,"abstract":"In this paper a circular shape representation isused to define a circular set for a pair of fixed shapes. This paper is an extension of an approach to shape comparison based on skeleton isomorphism proposed in [5]. The main advantage over existing approaches is mathematically correctly defined shape metrics via Hausdorff distance with the concurrent use of topology features of a shape. The circular function is proposed on the defined circular set. It has two parametersas two given shapes and two variables as two circulars. Thecircular set could be reduced to a special shrunk isomorphicsubset. The minimization of a circular function problem on ashrunk subset for a pair of shapes is proposed. The existence and reachability of minimum on this shrunk subset is proved.Effective monotone subsets are constructed to reduce thesearching of an optimal problem’s solution. The latter reduces the number of all possible subgraphs where to search the best pair to logarithmic (by skeleton edges) computational complexity comparing to the exponential total number of possible subgraphs. All the results are mathematically correct and may be useful in shape comparison and shape analysis applications where pairs of shapes are considered.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351863","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

Greedy Forwarding with Virtual Destination Strategy for Geographic Routing in Wireless Sensor Networks 基于虚拟目的地策略的贪婪转发无线传感器网络地理路由

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.55

N. Nguyen, D. Nguyen, Marc-Aurelien Le Gall, N. Saxena, Hyunseung Choo

引用次数: 6

Localization for a Mobile Node Based on Chrip Spread Spectrum Ranging 基于chirp扩频测距的移动节点定位

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.54

Hyeonwoo Cho, Jewon Lee, Younghun Lee, Sang Woo Kim

{"title":"Localization for a Mobile Node Based on Chrip Spread Spectrum Ranging","authors":"Hyeonwoo Cho, Jewon Lee, Younghun Lee, Sang Woo Kim","doi":"10.1109/ICCSA.2010.54","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.54","url":null,"abstract":"In this paper, we propose a localization algorithm for a mobile node based on the IEEE 802.15.4a chirp spread spectrum (CSS). IEEE 802.15.4a is an alternative PHY for IEEE 802.15.4, which is used for wireless sensor networks, and it can be applied to ranging applications. Through CSS ranging, the coordinate of a CSS node can be calculated by using trilateration. This approach is usually used for mobile robot localization. In the case of mobile robot localization, the dynamics of a mobile robot can be modeled as a state-space equation because a robot is an artificial object manufactured by designers. Therefore, the coordinate of a mobile robot can be estimated by using the Kalman filter. However, in the case of localization of a mobile node whose movement cannot be predicted, the dynamics of the mobile node are difficult to model. Therefore, we propose a strategy that regards the un-modeled dynamics as the process noise of the state-space equation. Further, we propose a method for determining the statics of the process noise based on some reasonable assumptions. Through the localization experiment, we verify the proposed method and discuss the results.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617568","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

Energy Efficient Geographic Routing for Prolonging Network Lifetime in Wireless Sensor Networks 无线传感器网络中延长网络寿命的高能效地理路由

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.66

Eunil Park, D. Bae, Hyunseung Choo

引用次数: 10

Efficient Greedy Forwarding Scheme Using Back-Off Intervals in Wireless Sensor Networks 无线传感器网络中基于后退间隔的高效贪婪转发方案

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.56

D. Bae, Moonshik Choi, Sang-Hun Cho, Hyunseung Choo

引用次数: 0

Estimation and Rendering of Tactile Information Based on Photometric Images 基于光度图像的触觉信息估计与渲染

2010 International Conference on Computational Science and Its Applications Pub Date : 2010-03-23 DOI: 10.1109/ICCSA.2010.81

Kazuyoshi Nomura, X. Yin, Y. Sakaguchi, Hiromi T. Tanaka

引用次数: 4