@conference {14951,
	title = {Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data},
	booktitle = {Scientific and Statistical Database Management, 2007. SSBDM {\textquoteright}07. 19th International Conference on},
	year = {2007},
	month = {2007/07//},
	pages = {8 - 8},
	abstract = {In this paper, we introduce a new efficient data layout scheme to efficiently handle out-of-core axis-aligned slicing queries of very large multidimensional volumetric data. Slicing is a very useful dimension reduction tool that removes or reduces occlusion problems in visualizing 3D/4D volumetric data sets and that enables fast visual exploration of such data sets. We show that the data layouts based on typical space-filling curves are not optimal for the out-of-core slicing queries and present a novel component-based data layout scheme for a specialized problem domain, in which it is only required to provide fast slicing at every k-th value, for any k gt; 1. Our component-based data layout scheme provides much faster processing time for any axis-aligned slicing direction at every k-th value, k gt; 1, requiring less cache memory size and without any replication of data. In addition, the data layout can be generalized to any high dimension.},
	keywords = {axis-aligned, cache, curves;very, data, data;data, databases;, handling;query, large, layout;data, memory, multidimensional, processing;very, queries;space-filling, size;component-based, slicing, slicing;out-of-core, volumetric},
	doi = {10.1109/SSDBM.2007.7},
	author = {Kim,Jusub and JaJa, Joseph F.}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@conference {14961,
	title = {Efficient techniques for range search queries on earth science data},
	booktitle = {Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on},
	year = {2002},
	month = {2002///},
	pages = {142 - 151},
	abstract = {We consider the problem of organizing large scale earth science raster data to efficiently handle queries for identifying regions whose parameters fall within certain range values specified by the queries. This problem seems to be critical to enabling basic data mining tasks such as determining associations between physical phenomena and spatial factors, detecting changes and trends, and content based retrieval. We assume that the input is too large to fit in internal memory and hence focus on data structures and algorithms that minimize the I/O bounds. A new data structure, called a tree-of-regions (ToR), is introduced and involves a combination of an R-tree and efficient representation of regions. It is shown that such a data structure enables the handling of range queries in an optimal I/O time, under certain reasonable assumptions. We also show that updates to the ToR can be handled efficiently. Experimental results for a variety of multi-valued earth science data illustrate the fast execution times of a wide range of queries, as predicted by our theoretical analysis.},
	keywords = {based, computing;, content, data, data;, databases;, Earth, factors;, large, mining, mining;, natural, processing;, queries;, query, range, raster, retrieval;, scale, Science, sciences, search, spatial, structures;, tasks;, temporal, tree, tree-of-regions;, visual},
	doi = {10.1109/SSDM.2002.1029714},
	author = {Shi,Qingmin and JaJa, Joseph F.}
}
@article {15399,
	title = {Perturbation technique for LLG dynamics in uniformly magnetized bodies subject to RF fields},
	journal = {Magnetics, IEEE Transactions on},
	volume = {38},
	year = {2002},
	month = {2002/09//},
	pages = {2403 - 2405},
	abstract = {The problem of magnetization dynamics of a uniformly magnetized uniaxial particle or film, under elliptically polarized applied field, is considered. In the special case of circularly polarized applied field and particles (films) with a symmetry axis, pure time-harmonic magnetization modes exist that can be computed analytically. Deviations from these highly symmetric conditions are treated as perturbation of the symmetric case. The perturbation technique leads to the exactly solvable system of linear differential equations for the perturbations which enables one to compute higher order magnetization harmonic. The analytical solutions are obtained and then compared with numerical results.},
	keywords = {analytical, anisotropy, anisotropy;, applied, bodies;, circularly, component;, constant-in-time, constant;, damping, demagnetisation;, demagnetizing, differential, dynamics;, effective, elliptically, equation;, equations;, exactly, factors;, field;, film;, films;, Frequency, gyromagnetic, harmonic;, higher, Landau-Lifshitz-Gilbert, large, linear, magnetic, magnetisation;, magnetization, magnetization;, magnetized, modes;, MOTION, order, partial, particle;, particles;, perturbation, polarized, radio, ratio;, RF, saturation, solution;, solvable, system;, technique;, techniques;, thin, time-harmonic, uniaxial, uniformly},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2002.803596},
	author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.}
}
@conference {16150,
	title = {SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {57 - 64},
	abstract = {We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.},
	keywords = {browser;, camera, data, design, diagrams;, dynamic, evolution;, experiment;, exploration;, filter, functions;, graphical, icons;, integrated, interfaces;, large, link, movement;, node, novel, optimized, rescaling;, search;, SpaceTree;, structures;, topology;, tree, user, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173148},
	author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.}
}
