• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.32-41
• /
• 2006

In data-centric networks, various data items, such as temperature, humidity, etc. are sensed and stored in sensor nodes. As these attributes are mostly scalar values and inter-related, multi-dimensional range queries are useful. To process multi-dimensional range queries efficiently in data-centric storage, data addressing is essential. The Previous work focused on efficient query processing without considering overall network lifetime. To prolong network lifetime and support multi-dimensional range queries, we propose a dynamic data distribution method for multi-dimensional data, where data space is divided into equal-sized regions and linearized by using Hilbert space filling curve.

• Journal of Information Technology Applications and Management
• /
• v.17 no.3
• /
• pp.135-150
• /
• 2010

Interactivity has been referred to as an important element promoting students' active participation in virtual classes. Assuming that interactivity cannot be defined by a single dimension, this study proposes multi-dimensional interactivity. Multi-dimensional interactivity includes all types of interactivity in e-learning. This study explored multi-dimensional interactivity which affects learners' satisfaction with e-learning. Data were collected from 132 students who had attended e-learning courses and the relationship between multi-dimensional interactivity and learners' satisfaction levels were tested through regression analysis. The result of this study showed that mechanical, reactive, and creative interactivity were positively related to learners' satisfaction. However, social interactivity seemed not to be related to learners' satisfaction. This study provides new insights on interactivity and verifies the importance of the multi-dimensional interactivity. The result of this study is expected to provide practical implications for interactivity strategies in e-learning.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.121-127
• /
• 2017

Recently, it has been actively Semantic Web studies for 2-dimensional data of the spatial data. 2-dimensional Semantic Web, are fused existing Geospatial Web and the Semantic Web, and integrate with the efficient cooperation of the vast non-spatial information on a variety of geospatial information and general Web, it is possible to provide it is a Web services technology of intelligent geographic information. However, in the research for multi-dimensional data processing, and in those who are missing overall, relevant standards also not been enacted. Therefore, in this paper, by applying a variety of base of the theory and technology related to this to take place the Ontology processing technology, multi-dimensional data processing is possible ontology, question, and suggested the contents of the reasoning. Also, we tried to apply what you have proposed respectively to the multi-dimensional query virtual scenario necessary.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.9
• /
• pp.2717-2738
• /
• 2024

Cloud computing has extensively grown in recent years. A large amount of data is stored in cloud servers. To ensure confidentiality, these data is often encrypted and then stored in cloud servers. However, encryption makes range queries difficult to perform. To solve this issue, we present a scheme that facilitates fast range queries on encrypted multi-dimensional data in scenarios involving multiple users. In our scheme, we construct a tree index on encrypted multi-dimensional data, and each node is linked to a secure enhanced multi-dimensional range (MDR). To support efficient range query on the tree index, we adopt bloom filter technique. Additionally, users' privileges are designed in a one-way calculation manner to support that different users can only perform range queries within their own privileges. Finally, we conduct extensive experiments which show the efficiency of our scheme, and also conduct a thorough analysis of its security.

• Journal of Digital Convergence
• /
• v.15 no.10
• /
• pp.243-251
• /
• 2017

As external data have become important corporate information resources, there are growing needs to combine them with internal data. This paper proposes an ontology-based scheme to combine external data with multi-dimensional databases, which shall be called multi-dimensional event ontology. In the ontology, external data are represented as events. Event characteristics such as actors, places, times, targets are linked to dimensions of a multi-dimensional database. By mapping event characteristics to database dimensions, external event data are shared via multi-dimensional hierarchies. This paper proposes rules to synchronize information sharing in multi-dimensional event ontology such as upward event information sharing, downward event information sharing and complex event information sharing. These rules are implemented using Protege. This study has a value in suggesting Big Data information sharing processes using an event database framework.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.897-911
• /
• 2015

This study presents a novel approach based on advancements in Evolutionary Computation for data-driven modeling of complex multi-dimensional memory-dependent systems. The investigated example is a benchmark coupled three-dimensional system that incorporates 6 Bouc-Wen elements, and is subjected to external excitations at three points. The proposed technique of this research adapts Genetic Programming for discovering the optimum structure of the differential equation of an auxiliary variable associated with every specific degree-of-freedom of this system that integrates the imposed effect of vibrations at all other degrees-of-freedom. After the termination of the first phase of the optimization process, a system of differential equations is formed that represent the multi-dimensional hysteretic system. Then, the parameters of this system of differential equations are optimized in the second phase using Genetic Algorithms to yield accurate response estimates globally, because the separately obtained differential equations are coupled essentially, and their true performance can be assessed only when the entire system of coupled differential equations is solved. The resultant model after the second phase of optimization is a low-order low-complexity surrogate computational model that represents the investigated three-dimensional memory-dependent system. Hence, this research presents a promising data-driven modeling technique for obtaining optimized representative models for multi-dimensional hysteretic systems that yield reasonably accurate results, and can be generalized to many problems, in various fields, ranging from engineering to economics as well as biology.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.6-17
• /
• 2007

Emerging modem database applications require multi-dimensional index structures to provide high performance for data retrieval. In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient techniques that provide transactional access to data through this index structure are necessary. The techniques must support all degrees of isolation offered by the database system. Especially degree 3 isolation, called "no phantom read," protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses a multi-level grid technique. The proposed mechanism is independent of the type of the multi-dimensional index structure, i.e., it can be applied to all types of index structures such as tree-based, file-based, and hash-based index structures. In addition, it has a low development cost and achieves high concurrency with a low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.156-161
• /
• 2003

It is an interest problem to predict substance distributions in three-dimensional space. Recently, a research field as Geostatistics is advanced. It is a kind of inter- or extrapolation mathematically. Some useful means for the inter- and extrapolation are known, in which slide window method with neural networks is hopeful one. We propose multi-dimensional extrapolation using multi-layer neural networks and the slide-window method. The multi-dimensional extrapolation is not similar to one-dimension. It has plural algorithms. We researched line predictors and local-plain predictors I two-dimensional space. The both predictors are equivalent; however, in multi-dimensional extrapolation, it is very important to find the direction of predictions. Especially, since the slide window method requires information to predict the future in sampling data, if they are not ordered appropriately in the direction, the predictor cannot operate. We tested the extrapolation for typical two-dimensional functions, and found an excellent character of slide-window method based on local-plain. By using the method, we can extrapolate the function until twice-outer regions of the definitions.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.47 no.3
• /
• pp.222-233
• /
• 2011

This study is for the multi-dimensional analysis of diverse data sets for artificial reefs off the coast of Shimonoseki, Yamaguchi prefecture, Japan. Various data sets recorded in artificial reefs ground were integrated in new GIS software: to reveal the relationships between water temperature and fish schools; to visualize the quantitative connection between the reefs and the fish schools; and to compare the seabed types derived from two different data sources. The results obtained suggest that the application of GIS in analyzing multi-dimensional data is a better way to understand the characteristics of fish schools and environmental information around artificial reefs and particularly in the evaluation of the effectiveness of artificial reefs.