• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• Journal of the Korean Vacuum Society
• /
• v.14 no.3
• /
• pp.115-118
• /
• 2005

Structure analysis of model polymeric micelles, both for non-asosciative and associative cases is done by small angle neutron scattering method. Aggregation number of the hydrophobic cores and the lyotropic ordering transitions of aqueous solutions of poly(ethylene glycol)(PEG) (6 K or 10 K g/mol) end-capped with perfluoroalkyl groups $(-(CH_2)_2C_OnF_{2n+1}$ (n =6,8, or 10) are characterized. Aggregation number is mainly determined by the hydrophobe end group only, and is insensitive to polymer concentration or temperature. Also, there is no difference between non-associative micelles and associative micelles in terms of aggregation number. The model systems order into a BCC structure with increasing concentration.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.391-399
• /
• 2008

RSS is the XML-based format for the syndication of web contents, and users aggregate RSS feeds with RSS feed aggregators. In order to effectively aggregate RSS feeds, an RSS aggregation policy is necessary. In this paper, we first propose an aggregation policy to minimize the number of postings being missed within an aggregation. Second, we analyze and compare our aggregation policy with existing aggregation policies. Our analysis reveals that our aggregation policy can reduce approximately 23% of the aggregation missing in comparison with the other aggregation policies while it increases only 6% of the aggregation delay.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.215-229
• /
• 2005

In this paper, constraint aggregation is combined with the adjoint and multiple shooting strategies for optimal control of differential algebraic equations (DAE) systems. The approach retains the inherent parallelism of the conventional multiple shooting method, while also being much more efficient for large scale problems. Constraint aggregation is employed to reduce the number of nonlinear continuity constraints in each multiple shooting interval, and its derivatives are computed by the adjoint DAE solver DASPKADJOINT together with ADIFOR and TAMC, the automatic differentiation software for forward and reverse mode, respectively. Numerical experiments demonstrate the effectiveness of the approach.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.703-709
• /
• 2017

Outsourcing databases is to offload storage and computationally intensive tasks to the third party server. Therefore, data owners can manage big data, and handle queries from clients, without building a costly infrastructure. However, because of the insecurity of network systems, the third-party server may be untrusted, thus the query results from the server may be tampered with. This problem has motivated significant research efforts on authenticating various queries such as range query, kNN query, function query, etc. Although aggregation queries play a key role in analyzing big data, authenticating aggregation queries has not been extensively studied, and the previous works are not efficient for data with high dimension or a large number of distinct values. In this paper, we propose the AMR-tree that is a data structure, applied to authenticate aggregation queries. We also propose an efficient proof construction method and a verification method with the AMR-tree. Furthermore, we validate the performance of the proposed algorithm by conducting various experiments through changing parameters such as the number of distinct values, the number of records, and the dimension of data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1175-1180
• /
• 2009

Frame Aggregation is a promissing technology for improving MAC throughput in IEEE 802.11n. In IEEE 802.11n, two frame aggregation schemes, Aggregate MSDU (A-MSDU) and Aggregation MPDU (A-MPDU), are defined. In this paper, we analyze the performance the two-level frame aggregation scheme where A-MSDU and A-MPDU are combined. We develop the analytical model for the two-level frame aggregation scheme and present numerical results on the effect of bit error rate, aggregation size, and the number of nodes.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.70-75
• /
• 2015

Fasciclin 1 (FAS1) is an extracellular protein whose aggregation in cornea leads to visual impairment. While a number of FAS1 mutants have been studied that exhibit enhanced/decreased aggregation propensity, no structural information has been provided so far that is associated with distinct aggregation potential. In this study, we have investigated the structural and thermodynamic characteristics of the wild-type FAS1 and its two mutants, R555Q and R555W, by using molecular dynamics simulations and three-dimensional reference interaction site model (3D-RISM) theory. We find that the hydrophobic solvent accessible surface area increases due to hydrophobic core repacking in the C-terminus caused by the mutation. We also find that the solvation free energy of the mutants increases due to the enhanced non-native H-bonding. These structural and thermodynamic changes upon mutation contribute to understand the aggregation of these mutants.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.669-674
• /
• 2001

In order to reflect the aggregation situation in the aggregation process, aggregation based on situation assessment (ASA) method was proposed in [1]. It consists of the situation assessment model (SAM) and the ASA algorithm. In the SAM, the value of parameter, p, is transformed into the nearest integer value [1]. The integer-typed output of SAM is used as input for an aggregation. The integer-typed output of SAM indicates the current degree of aggregation situation. The ASA algorithm produces at most finite several aggregation results between min and max. In the sequel, the ASA method can not properly handle the applications with the more sophisticated aggregation results between min and max. In order to solve this problem, we propose two improved ASA (I-ASA) methods. In these I-ASA methods, we allow the value of parameter of SAM to be a real number, and suggest two improved ASA algorithms to make continuous aggregation results between min and max. These I-ASA methods can handle both a precise aggregation and an approximate aggregation. Therefore, when compared to the ASA method [1], the proposed I-ASA methods have advantages in that they can handle the applications with the more sophisticated aggregation results and can be used in the more general applications for aggregations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.473-476
• /
• 2009

Frame Aggregation is a promissing technology for improving MAC throughput in IEEE 802.11n. In IEEE 802.11n, two frame aggregation schemes, Aggregate MSDU (A-MSDU) and Aggregate MPDU (A-MPDU), are defined. In this paper, we analyze the performance the two-level frame aggregation scheme where A-MSDU and A-MPDU are combined. We develop the analytical model for the two-level frame aggregation scheme and present numerical results on the effect of bit error rate, aggregation size, and the number of nodes.