Hierarchical Datacubes

Many approaches have been proposed to pre-compute data cubes in order to efficiently respond to OLAP queries in data warehouses. However, few have proposed solutions integrating all of the possible outcomes, and it is this idea that leads the integration of hierarchical dimensions into these responses. To meet this need, we propose, in this paper, a complete redefinition of the framework and the formal definition of traditional database analysis through the prism of hierarchical dimensions. After characterizing the hierarchical data cube lattice, we introduce the hierarchical data cube and its most concise reduced representation, the closed hierarchical data cube. It offers compact replication so as to optimize storage space by removing redundancies of strongly correlated data. Such data are typical of data warehouses, and in particular in video games, our field of study and experimentation, where hierarchical dimension attributes are widely represented.

Data inversion of multi-dimensional magnetic resonance in porous media

Since its inception in the 1970s,multi-dimensional magnetic resonance(MR)has emerged as a powerful tool for non-invasive investigations of structures and molecular interactions.MR spectroscopy beyond one dimension allows the study of the correlation,exchange processes,and separation of overlapping spectral information.The multi-dimensional concept has been re-implemented over the last two decades to explore molecular motion and spin dynamics in porous media.Apart from Fourier transform,methods have been developed for processing the multi-dimensional time-domain data,identifying the fluid components,and estimating pore surface permeability via joint relaxation and diffusion spectra.Through the resolution of spectroscopic signals with spatial encoding gradients,multi-dimensional MR imaging has been widely used to investigate the microscopic environment of living tissues and distinguish diseases.Signals in each voxel are usually expressed as multi-exponential decay,representing microstructures or environments along multiple pore scales.The separation of contributions from different environments is a common ill-posed problem,which can be resolved numerically.Moreover,the inversion methods and experimental parameters determine the resolution of multi-dimensional spectra.This paper reviews the algorithms that have been proposed to process multidimensional MR datasets in different scenarios.Detailed information at the microscopic level,such as tissue components,fluid types and food structures in multi-disciplinary sciences,could be revealed through multi-dimensional MR.

Towards Cache-Assisted Hierarchical Detection for Real-Time Health Data Monitoring in IoHT

Real-time health data monitoring is pivotal for bolstering road services’safety,intelligence,and efficiency within the Internet of Health Things(IoHT)framework.Yet,delays in data retrieval can markedly hinder the efficacy of big data awareness detection systems.We advocate for a collaborative caching approach involving edge devices and cloud networks to combat this.This strategy is devised to streamline the data retrieval path,subsequently diminishing network strain.Crafting an adept cache processing scheme poses its own set of challenges,especially given the transient nature of monitoring data and the imperative for swift data transmission,intertwined with resource allocation tactics.This paper unveils a novel mobile healthcare solution that harnesses the power of our collaborative caching approach,facilitating nuanced health monitoring via edge devices.The system capitalizes on cloud computing for intricate health data analytics,especially in pinpointing health anomalies.Given the dynamic locational shifts and possible connection disruptions,we have architected a hierarchical detection system,particularly during crises.This system caches data efficiently and incorporates a detection utility to assess data freshness and potential lag in response times.Furthermore,we introduce the Cache-Assisted Real-Time Detection(CARD)model,crafted to optimize utility.Addressing the inherent complexity of the NP-hard CARD model,we have championed a greedy algorithm as a solution.Simulations reveal that our collaborative caching technique markedly elevates the Cache Hit Ratio(CHR)and data freshness,outshining its contemporaneous benchmark algorithms.The empirical results underscore the strength and efficiency of our innovative IoHT-based health monitoring solution.To encapsulate,this paper tackles the nuances of real-time health data monitoring in the IoHT landscape,presenting a joint edge-cloud caching strategy paired with a hierarchical detection system.Our methodology yields enhanced cache efficiency and data freshness.The corroborative numerical data accentuates the feasibility and relevance of our model,casting a beacon for the future trajectory of real-time health data monitoring systems.

Structural Engineering of Hierarchical Aerogels Comprised of Multi-dimensional Gradient Carbon Nanoarchitectures for Highly Efficient Microwave Absorption

Recently,multilevel structural carbon aerogels are deemed as attractive candidates for microwave absorbing materials.Nevertheless,excessive stack and agglomeration for low-dimension carbon nanomaterials inducing impedance mismatch are significant challenges.Herein,the delicate“3D helix-2D sheet-1D fiber-0D dot”hierarchical aerogels have been successfully synthesized,for the first time,by sequential processes of hydrothermal self-assembly and in-situ chemical vapor deposition method.Particularly,the graphene sheets are uniformly intercalated by 3D helical carbon nanocoils,which give a feasible solution to the mentioned problem and endows the as-obtained aerogel with abundant porous structures and better dielectric properties.Moreover,by adjusting the content of 0D core-shell structured particles and the parameters for growth of the 1D carbon nanofibers,tunable electromagnetic properties and excellent impedance matching are achieved,which plays a vital role in the microwave absorption performance.As expected,the optimized aerogels harvest excellent performance,including broad effective bandwidth and strong reflection loss at low filling ratio and thin thickness.This work gives valuable guidance and inspiration for the design of hierarchical materials comprised of dimensional gradient structures,which holds great application potential for electromagnetic wave attenuation.

Bayesian Estimation and Hierarchical Bayesian Estimation of Zero-failure Data

The zero_failure data research is a new field in the recent years, but it is required urgently in practical projects, so the work has more theory and practical values. In this paper, for zero_failure data (t i,n i) at moment t i , if the prior distribution of the failure probability p i=p{T【t i} is quasi_exponential distribution, the author gives the p i Bayesian estimation and hierarchical Bayesian estimation and the reliability under zero_failure date condition is also obtained.

Cost of Multicast Logical Key Tree Based on Hierarchical Data Processing

How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem： re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost.

Research on Protecting Information Security Based on the Method of Hierarchical Classification in the Era of Big Data

Big data is becoming increasingly important because of the enormous information generation and storage in recent years.It has become a challenge to the data mining technique and management.Based on the characteristics of geometric explosion of information in the era of big data,this paper studies the possible approaches to balance the maximum value and privacy of information,and disposes the Nine-Cells information matrix,hierarchical classification.Furthermore,the paper uses the rough sets theory to proceed from the two dimensions of value and privacy,establishes information classification method,puts forward the countermeasures for information security.Taking spam messages for example,the massive spam messages can be classified,and then targeted hierarchical management strategy was put forward.This paper proposes personal Information index system,Information management platform and possible solutions to protect information security and utilize information value in the age of big data.

Multi-dimensional database design and implementation of dam safety monitoring system

To improve the effectiveness of dam safety monitoring database systems, the development process of a multi-dimensional conceptual data model was analyzed and a logic design wasachieved in multi-dimensional database mode. The optimal data model was confirmed by identifying data objects, defining relations and reviewing entities. The conversion of relations among entities to external keys and entities and physical attributes to tables and fields was interpreted completely. On this basis, a multi-dimensional database that reflects the management and analysis of a dam safety monitoring system on monitoring data information has been established, for which factual tables and dimensional tables have been designed. Finally, based on service design and user interface design, the dam safety monitoring system has been developed with Delphi as the development tool. This development project shows that the multi-dimensional database can simplify the development process and minimize hidden dangers in the database structure design. It is superior to other dam safety monitoring system development models and can provide a new research direction for system developers.

Goodness-of-fit tests for multi-dimensional copulas:Expanding application to historical drought data

The question of how to choose a copula model that best fits a given dataset is a predominant limitation of the copula approach, and the present study aims to investigate the techniques of goodness-of-fit tests for multi-dimensional copulas. A goodness-of-fit test based on Rosenblatt＇s transformation was mathematically expanded from two dimensions to three dimensions and procedures of a bootstrap version of the test were provided. Through stochastic copula simulation, an empirical application of historical drought data at the Lintong Gauge Station shows that the goodness-of-fit tests perform well, revealing that both trivariate Gaussian and Student t copulas are acceptable for modeling the dependence structures of the observed drought duration, severity, and peak. The goodness-of-fit tests for multi-dimensional copulas can provide further support and help a lot in the potential applications of a wider range of copulas to describe the associations of correlated hydrological variables. However, for the application of copulas with the number of dimensions larger than three, more complicated computational efforts as well as exploration and parameterization of corresponding copulas are required.

A novel method for clustering cellular data to improve classification

Many fields,such as neuroscience,are experiencing the vast prolife ration of cellular data,underscoring the need fo r organizing and interpreting large datasets.A popular approach partitions data into manageable subsets via hierarchical clustering,but objective methods to determine the appropriate classification granularity are missing.We recently introduced a technique to systematically identify when to stop subdividing clusters based on the fundamental principle that cells must differ more between than within clusters.Here we present the corresponding protocol to classify cellular datasets by combining datadriven unsupervised hierarchical clustering with statistical testing.These general-purpose functions are applicable to any cellular dataset that can be organized as two-dimensional matrices of numerical values,including molecula r,physiological,and anatomical datasets.We demonstrate the protocol using cellular data from the Janelia MouseLight project to chara cterize morphological aspects of neurons.

A Multilevel Secure Relation-Hierarchical Data Model for a Secure DBMS

A multilevel secure relation hierarchical data model for multilevel secure database is extended from the relation hierarchical data model in single level environment in this paper. Based on the model, an upper lower layer relationalintegrity is presented after we analyze and eliminate the covert channels caused by the database integrity.Two SQL statements are extended to process polyinstantiation in the multilevel secure environment.The system based on the multilevel secure relation hierarchical data model is capable of integratively storing and manipulating complicated objects ( e.g. , multilevel spatial data) and conventional data ( e.g. , integer, real number and character string) in multilevel secure database.

Spatial Object Aggregation Based on Data Structure, Local Triangulation and Hierarchical Analyzing Method

This paper focuses on the methods and process of spatial aggregation based on semantic and geometric characteristics of spatial objects and relations among the objects with the help of spatial data structure (Formal Data Structure),the Local Constrained Delaunay Triangulations and semantic hierarchy.The adjacent relation among connected objects and unconnected objects has been studied through constrained triangle as elementary processing unit in aggregation operation.The hierarchical semantic analytical matrix is given for analyzing the similarity between objects types and between objects.Several different cases of aggregation have been presented in this paper.

Mining Hierarchical Decision Rules from Hybrid Data with Categorical and Continuous Valued Attributes

Decision rules mining is an important issue in machine learning and data mining.However,most proposed algorithms mine categorical data at single level,and these rules are not easily understandable and really useful for users.Thus,a new approach to hierarchical decision rules mining is provided in this paper,in which similarity direction measure is introduced to deal with hybrid data.This approach can mine hierarchical decision rules by adjusting similarity measure parameters and the level of concept hierarchy trees.

ADC-DL:Communication-Efficient Distributed Learning with Hierarchical Clustering and Adaptive Dataset Condensation

The rapid growth of modern mobile devices leads to a large number of distributed data,which is extremely valuable for learning models.Unfortunately,model training by collecting all these original data to a centralized cloud server is not applicable due to data privacy and communication costs concerns,hindering artificial intelligence from empowering mobile devices.Moreover,these data are not identically and independently distributed(Non-IID)caused by their different context,which will deteriorate the performance of the model.To address these issues,we propose a novel Distributed Learning algorithm based on hierarchical clustering and Adaptive Dataset Condensation,named ADC-DL,which learns a shared model by collecting the synthetic samples generated on each device.To tackle the heterogeneity of data distribution,we propose an entropy topsis comprehensive tiering model for hierarchical clustering,which distinguishes clients in terms of their data characteristics.Subsequently,synthetic dummy samples are generated based on the hierarchical structure utilizing adaptive dataset condensation.The procedure of dataset condensation can be adjusted adaptively according to the tier of the client.Extensive experiments demonstrate that the performance of our ADC-DL is more outstanding in prediction accuracy and communication costs compared with existing algorithms.

Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset

Data mining has been a popular research area for more than a decade. There are several problems associated with data mining. Among them clustering is one of the most interesting problems. However, this problem becomes more challenging when dataset is distributed between different parties and they do not want to share their data. So, in this paper we propose a privacy preserving two party hierarchical clustering algorithm vertically partitioned data set. Each site only learns the final cluster centers, but nothing about the individual’s data.

Novel Data Structure Modeling Model based on Hierarchical Data Analysis and Parsing

. In this article, we describe the characteristics of large-scale modeling of the theme text of this site data and important progress in recent years. Topic modeling approach has attracted wide interest in the world, and promote a number of important data mining, development of computer vision and computational biology applications, including automatic text summaries, information retrieval, information recommendation, topic detection and tracking, natural scene understanding human action recognition and gene expression analysis. The main features of the model and the corresponding theme paper focuses on the text of this site data. Data with dynamic, high-end, multi-channel and distributed structure and the structure of the model is only part of the theme before modeling. The paper discussed in the framework of the unity of the three-dimensional Markov model of four structural features of the text of this site data modeling, and analysis of distributed computing and word combination of three-dimensional modeling topics Markov model and type fuzzy systems the possibility of applications. In addition to structural modeling for this site text data, also we discuss some of the three-dimensional Markov model energy minimization of machine learning algorithms.

Hierarchical Access Control Scheme of Private Data Based on Attribute Encryption

To solve the problems of data sharing in social network,such as management of private data is too loose,access permissions are not clear,mode of data sharing is too single and soon on,we design a hierarchical access control scheme of private data based on attribute encryption.First,we construct a new algorithm based on attribute encryption,which divides encryption into two phases,and we can design two types of attributes encryption strategy to make sure that different users could get their own decryption keys corresponding to their permissions.We encrypt the private data hierarchically with our algorithm to realize“precise”,“more accurate”,“fuzzy”and“private”four management modes,then users with higher permissions can access the private data inferior to their permissions.And we outsource some complex operations of decryption to DSP to ensure high efficiency on the premise of privacy protection.Finally,we analyze the efficiency and the security of our scheme.

Visual exploration of multi-dimensional data via rule-based sample embedding

We propose an approach to learning sample embedding for analyzing multi-dimensional datasets.The basic idea is to extract rules from the given dataset and learn the embedding for each sample based on the rules it satisfies.The approach can filter out pattern-irrelevant attributes,leading to significant visual structures of samples satisfying the same rules in the projection.In addition,analysts can understand a visual structure based on the rules that the involved samples satisfy,which improves the projection’s pattern interpretability.Our research involves two methods for achieving and applying the approach.First,we give a method to learn rule-based embedding for each sample.Second,we integrate the method into a system to achieve an analytical workflow.Cases on real-world dataset and quantitative experiment results show the usability and effectiveness of our approach.

MULTI-HIERARCHICAL STRUCTURE AND JUMP OF TEMPERATUREFOR THE GLOBE, CHINA AND YUNNAN OVER THE PAST 100 YEARS

An analysis has been conducted of the multi-hierarchical structure and jump of temperature variation for the globe, China and Yunnan Province over the past 100 years using an auto-adaptive, multi-resolution data filter set up in You, Lin and Deng (1997). The result is shown below in three aspects. (l1 The variation of global temperature in this period is marked by warming on a large scale and can be divided into three stages of being cold (prior to 1919), warm (between 1920 and 1978) and warmer (since 1 979). Well-defined jumps are with the variation in correspondence with the hierarchical evolution on such scale, occurring in 1920 and 1979 when there is the most substantial jump towards warming. For the evolution on smaller scales, however, the variation has shown more of alternations of cold and warm temperatures. The preceding hierarchical structure and warming jump are added with new ones. (2) The trend in which temperature varies is much the same for China and the Yunnan Province, but it is not consistent with that globally, the largest difference being that a weak period of cold temperature in 1955 - 1978 across the globe was suspended in 1979 when it jumped to a significant warming,while a period of very cold temperature in 1955 - 1986 in China and Yunnan was not followed by warming in similar extent until 1987. (3) Though there are consistent hierarchical structure and jumping features throughout the year in Yunnan, significant changes with season are also present and the most striking difference is that temperature tends to vary consistently with China in winter and spring but with the globe in summer and fall.

Finding Main Causes of Elevator Accidents via Multi-Dimensional Association Rule in Edge Computing Environment

In order to discover the main causes of elevator group accidents in edge computing environment, a multi-dimensional data model of elevator accident data is established by using data cube technology, proposing and implementing a method by combining classical Apriori algorithm with the model, digging out frequent items of elevator accident data to explore the main reasons for the occurrence of elevator accidents. In addition, a collaborative edge model of elevator accidents is set to achieve data sharing, making it possible to check the detail of each cause to confirm the causes of elevator accidents. Lastly the association rules are applied to find the law of elevator Accidents.