標題: Titlebook: Computational Science and Its Applications - ICCSA 2007; International Confer Osvaldo Gervasi,Marina L. Gavrilova Conference proceedings 20 [打印本頁] 作者: Taft 時間: 2025-3-21 18:50
書目名稱Computational Science and Its Applications - ICCSA 2007影響因子(影響力)
書目名稱Computational Science and Its Applications - ICCSA 2007影響因子(影響力)學科排名
書目名稱Computational Science and Its Applications - ICCSA 2007網絡公開度
書目名稱Computational Science and Its Applications - ICCSA 2007網絡公開度學科排名
書目名稱Computational Science and Its Applications - ICCSA 2007被引頻次
書目名稱Computational Science and Its Applications - ICCSA 2007被引頻次學科排名
書目名稱Computational Science and Its Applications - ICCSA 2007年度引用
書目名稱Computational Science and Its Applications - ICCSA 2007年度引用學科排名
書目名稱Computational Science and Its Applications - ICCSA 2007讀者反饋
書目名稱Computational Science and Its Applications - ICCSA 2007讀者反饋學科排名
作者: GUILE 時間: 2025-3-21 23:42
Progress in Colloid and Polymer Sciencetructures of .(..) total size by which the queries can be answered in .(..) time. Our method is based on the extended visibility graph [1] and a range searching data structure presented by Chazelle . [2].作者: figment 時間: 2025-3-22 01:05
https://doi.org/10.1007/978-1-137-04142-5each of the .(..) queries to determine whether a potential edge of the path is collision-free. This improves the running time of the geometric algorithm presented by Bhattacharya and Gavrilova (2007) which already generates a high quality approximation of the optimal path.作者: forestry 時間: 2025-3-22 08:22 作者: MOCK 時間: 2025-3-22 09:43
https://doi.org/10.1007/978-94-009-1738-5L-CFLRU/E evicts the dirty page with the lowest block erase count within the window of the dirty page list. Experiments through simulation studies show that the proposed algorithms reduce the number of erase operations and improve the wear-leveling degree of flash memory compared to LRU and CFLRU.作者: Essential 時間: 2025-3-22 15:03 作者: Essential 時間: 2025-3-22 20:48
Moben Mirza MD,Joel F. Koenig MDrase operations as well as preventing serious degradation of buffer hit ratio. The trace-driven simulation results show that, among the existing buffer replacement algorithms including LRU, CF-LRU, ARC, and LIRS, our LIRS-WSR is best in almost cases for flash storage systems.作者: 空洞 時間: 2025-3-22 23:15 作者: 得體 時間: 2025-3-23 03:31 作者: 束縛 時間: 2025-3-23 06:34
A Geometric Approach to Clearance Based Path Optimizationeach of the .(..) queries to determine whether a potential edge of the path is collision-free. This improves the running time of the geometric algorithm presented by Bhattacharya and Gavrilova (2007) which already generates a high quality approximation of the optimal path.作者: 平息 時間: 2025-3-23 09:57
Supporting Extended UNIX Remove Semantics in the OASIS Cluster Filesystemche coherence. The suggested approach can support the remove UNIX semantics in the distributed environment and easily be adopted in the existing out-of-band cluster filesystems if using their locking mechanism.作者: Excitotoxin 時間: 2025-3-23 14:37 作者: Postmenopause 時間: 2025-3-23 20:33
An Efficient Garbage Collection Policy for Flash Memory Based Swap Systemsd wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the number of erase operation, the garbage collection time, total amount of energy consumption and the endurance of flash memory.作者: 無動于衷 時間: 2025-3-24 02:16
LIRS-WSR: Integration of LIRS and Writes Sequence Reordering for Flash Memoryrase operations as well as preventing serious degradation of buffer hit ratio. The trace-driven simulation results show that, among the existing buffer replacement algorithms including LRU, CF-LRU, ARC, and LIRS, our LIRS-WSR is best in almost cases for flash storage systems.作者: Musket 時間: 2025-3-24 02:23 作者: 蕨類 時間: 2025-3-24 10:36 作者: Vulnerary 時間: 2025-3-24 10:56
https://doi.org/10.1007/978-1-137-04142-5near axis .-equivalent to the medial axis can be computed from the latter in linear time for almost all general polygons. If the medial axis is not pre-computed, and the polygon contains holes, this implies .(.log.) total computation time for a linear axis.作者: Obverse 時間: 2025-3-24 16:34
A New Dynamic Programming Algorithm for Orthogonal Ruler Folding Problem in d-Dimensional Space and links have integer value lengths. We propose a dynamic programming approach to fold a given chain whose links have integer lengths in a minimum length in .(.) time and space. We show that by generalizing the algorithm it can be used in .-dimensional space for . such that it requires .(2...) time using .(2...) space.作者: 眨眼 時間: 2025-3-24 19:46 作者: 星球的光亮度 時間: 2025-3-25 03:02 作者: 集中營 時間: 2025-3-25 07:15
Pooya Khodaparast,Kristian Jessengram for this variant and an algorithm to compute it that runs in . time. For the second and given a fixed angle Θ?≤?., we present a linear time algorithm to minimize the lights’ illumination range to well Θ-illuminate a point.作者: 發(fā)微光 時間: 2025-3-25 09:11 作者: AVOW 時間: 2025-3-25 13:58 作者: 歡呼 時間: 2025-3-25 16:10 作者: MENT 時間: 2025-3-25 20:26 作者: 藥物 時間: 2025-3-26 00:49
https://doi.org/10.1057/9780230233591ingle core CPU machines. Nowadays even the desktop computers are equipped with multi-core CPU processors. In this paper, we present an experimental performance study to show how cache conscious trees perform on different types of CPU processors that are available in the market these days.作者: 不感興趣 時間: 2025-3-26 04:17 作者: notion 時間: 2025-3-26 11:50 作者: 颶風 時間: 2025-3-26 15:39 作者: 外形 時間: 2025-3-26 20:25 作者: Dendritic-Cells 時間: 2025-3-26 23:05
Efficient Colored Point Set Matching Under Noise . under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching algorithm. The first algorithm determines a number of .andidate zones whi作者: 背心 時間: 2025-3-27 04:42 作者: 易于交談 時間: 2025-3-27 09:19 作者: 殘酷的地方 時間: 2025-3-27 12:23 作者: GONG 時間: 2025-3-27 13:53 作者: 慎重 時間: 2025-3-27 17:58
Shortest Path Queries in a Simple Polygon for 3D Virtual Museum on the polygon’s VD, we first find the Voronoi skeleton path .(.,.) from point. to ., and then along which we compute the shortest path .(.,.) by visibility computing simultaneously. .(.,.) can be reported in time .(.). It can be used in our 3D virtual museum system, in which the polygon’s VD is us作者: prostate-gland 時間: 2025-3-28 00:35
Linear Axis for General Polygons: Properties and Computationich is controlled by means of parameter .>?0. A?significant advantage of a linear axis is that its edges are straight line segments. We generalize the notion of a linear axis and the algorithm for its efficient computation to the case of general polygons, which might contain holes. We show that a li作者: 語源學 時間: 2025-3-28 05:24
A Geometric Approach to Clearance Based Path Optimizationmap method, the cell decomposition method, and the potential field method generate low quality paths with redundant motions which are post-processed to generate high quality approximations of the optimal path. In this paper, we present a .(..(.?+?.)) algorithm to optimize a path between a source and作者: 踉蹌 時間: 2025-3-28 10:08
3D Spatial Operations in Geo DBMS Environment for 3D GISsuch software or system is the geometric modeling that works with 3D spatial operations. This paper presents a portion of problem that we currently attempt to solve, that is the 3D spatial operations for Geo DBMS. Some popular spatial operations in 3D GIS for example 3D XOR, 3D union, 3D intersectio作者: Assault 時間: 2025-3-28 11:05
A Page Padding Method for Fragmented Flash Storager may expect steady performance under disk fragmentation in flash storage. However, most commercial products do not satisfy this expectation. For example, a SDMMC card can be written in 18.7Mbytes/sec speed sequentially, but its write speed is slowed down to 3.2Mbytes/sec when it is seriously fragme作者: 貧困 時間: 2025-3-28 17:25
Supporting Extended UNIX Remove Semantics in the OASIS Cluster Filesystemstems using ODSs, the OASIS could not support the extended remove UNIX semantics to defer the remove of an inode until the uses of the inode in all client nodes are finished. This nonsupport generates the problems that it does not protect users to make use of the deleted inode and does share an inod作者: Adulate 時間: 2025-3-28 19:42 作者: 背帶 時間: 2025-3-29 01:14 作者: 招致 時間: 2025-3-29 05:16 作者: 俗艷 時間: 2025-3-29 09:43
LIRS-WSR: Integration of LIRS and Writes Sequence Reordering for Flash Memoryong read, write, and erase operations: a write/erase operation is much slower than a read operation in a flash memory. For the overall performance of a flash memory system, the buffer replacement policy should consider the above severely asymmetric I/O latencies. Existing buffer replacement algorith作者: 留戀 時間: 2025-3-29 11:34 作者: NEG 時間: 2025-3-29 16:00
Shortest Path Queries Between Geometric Objects on Surfacesoints, vertices, edges, segments, faces, chains, regions and sets of these. The surface . consists of . positively weighted triangular faces. The cost of a path on . is the weighted sum of Euclidean lengths of the sub-paths within each face of .. We present generic algorithms which provide approximate solutions.作者: Fibrin 時間: 2025-3-29 20:04 作者: Insatiable 時間: 2025-3-30 03:38
Recovery of Oil Using Surfactant-Based Foams as joints. “.”, which is NP-Complete is to find the minimum length of the folded chain in one dimensional space. The best result for ruler folding problem is reported by Hopcroft et al. in one dimensional space which requires .(..) time complexity, where . is length of the longest link in the chain作者: 形容詞 時間: 2025-3-30 07:21
https://doi.org/10.1007/BFb0114294 . under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching algorithm. The first algorithm determines a number of .andidate zones whi作者: 鞏固 時間: 2025-3-30 11:27
New lyotropic nematic liquid crystals,olecule. This paper presents an efficient, as efficient as the realtime, algorithm to triangulate the blending surfaces which is the most critical subset of a molecular surface. For the quick evaluation of points on the surface, the proposed algorithm uses masks which are similar in their concepts t作者: 口訣法 時間: 2025-3-30 13:56 作者: Pageant 時間: 2025-3-30 17:36 作者: Panacea 時間: 2025-3-30 21:46 作者: anthesis 時間: 2025-3-31 04:20
https://doi.org/10.1007/978-1-137-04142-5 on the polygon’s VD, we first find the Voronoi skeleton path .(.,.) from point. to ., and then along which we compute the shortest path .(.,.) by visibility computing simultaneously. .(.,.) can be reported in time .(.). It can be used in our 3D virtual museum system, in which the polygon’s VD is us作者: 儀式 時間: 2025-3-31 08:12 作者: AXIOM 時間: 2025-3-31 11:52
https://doi.org/10.1007/978-1-137-04142-5map method, the cell decomposition method, and the potential field method generate low quality paths with redundant motions which are post-processed to generate high quality approximations of the optimal path. In this paper, we present a .(..(.?+?.)) algorithm to optimize a path between a source and作者: antipsychotic 時間: 2025-3-31 13:50
https://doi.org/10.1007/978-1-137-04142-5such software or system is the geometric modeling that works with 3D spatial operations. This paper presents a portion of problem that we currently attempt to solve, that is the 3D spatial operations for Geo DBMS. Some popular spatial operations in 3D GIS for example 3D XOR, 3D union, 3D intersectio作者: 流浪 時間: 2025-3-31 18:10 作者: 極深 時間: 2025-4-1 01:37 作者: Aerophagia 時間: 2025-4-1 05:23
https://doi.org/10.1057/9780230233591ntly developed Cache Sensitive T-Tree are the most well-known cache conscious index structures. Their performance evaluations, however, were made in single core CPU machines. Nowadays even the desktop computers are equipped with multi-core CPU processors. In this paper, we present an experimental pe作者: Supplement 時間: 2025-4-1 07:59 作者: CRACK 時間: 2025-4-1 11:52
https://doi.org/10.1007/978-94-009-1738-5 resistance, and light weight. Mobile computing devices exploit a swap system to extend a limited main memory space and use flash memory as a swap system. Although flash memory has the attractive features, it should perform garbage collection, which includes erase operations. The erase operations ar作者: 尖牙 時間: 2025-4-1 16:22
Moben Mirza MD,Joel F. Koenig MDong read, write, and erase operations: a write/erase operation is much slower than a read operation in a flash memory. For the overall performance of a flash memory system, the buffer replacement policy should consider the above severely asymmetric I/O latencies. Existing buffer replacement algorith
