• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.831-843
• /
• 2010

Let $\cal{H}$ and $\cal{K}$ be Hilbert spaces and let T, $\tilde{T}$ = T + ${\delta}T$ be bounded operators from $\cal{H}$ into $\cal{K}$. In this article, two facts related to the perturbation bounds are studied. The first one is to find the upper bound of $\parallel\tilde{T}^+\;-\;T^+\parallel$ which extends the results obtained by the second author and enriches the perturbation theory for the Moore-Penrose inverse. The other one is to develop explicit representations of projectors $\parallel\tilde{T}\tilde{T}^+\;-\;TT^+\parallel$ and $\parallel\tilde{T}^+\tilde{T}\;-\;T^+T\parallel$. In addition, some spectral cases related to these results are analyzed.

• Language and Information
• /
• v.1
• /
• pp.137-179
• /
• 1997

This paper discusses several basic issues of the 'focus' phenomenon. One of them is the issue of the nature of focus, i.e., what constituent of the sentences gets focused. Another is the issue of to what aspect of meaning the focus contributes. The other is the issue of the functions of focus-sensitive operators. As for the first issue, it is observed that the basic function of focus is to mark all and only the new information of the sentence. But for the cases in which this principle is not observed, it is proposed that the focus in these cases in general plays a secondary function of triggering an additional emphatic scalar meaning. And yet, in these cases, the state of the matter is different between free focus and bound focus. It is also shown that contrary to the general belief that free focus contributes to the meaning semantically. Concerning focus-sensitive operators, we classify them into two groups, i.e., quantificational and scalar operators, and try to formalize their meaning in the framework of Pulman's(1997) 'higher order unification theory'.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.512-522
• /
• 2003

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Typically, the size of the chip required to implement the circuit depends on both the maximum number of the LUT blocks required to implement the function of each subcircuit and the maximum number of micro-registers to store results over context switches in the same time. Therefore, many partitioning or synthesis methods try to minimize these two factors. In this paper, we present a new estimation technique to find the lower bound on the number of micro-registers which can be obtained by any synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of the previous work and even the future work. If the estimated lower bound exactly matches the actual number in the actual design result, we can say that the result is guaranteed to be optimal. In contrast, if they do not match, the following two cases are expected: we might estimate a better (more exact) lower bound or we find a new synthesis result better than those of the previous work. Our experimental results show that there are some differences between the numbers of micro-registers and our estimated lower bounds. One reason for these differences seems that our estimation tries to estimate the result with the minimum micro-registers among all the possible candidates, regardless of usage of other resources such as LUTs, while the previous work takes into account both LUTs and micro-registers. In addition, it implies that our method may have some limitation on exact estimation due to the complexity of the problem itself in sense that it is much more complicated than LUT estimation and thus needs more improvement, and/or there may exist some other synthesis results better than those of the previous work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.286-292
• /
• 2006

Both composition and XOR are operations widely used to enhance security of cryptographic schemes. The more number of random permutations we compose (resp. XOR), the more secure random permutation (resp. random function) we get. Combining the two methods, we consider a generalized form of random function: $SUM^s - CMP^c = ({\pi}_{sc} ... {\pi}_{(s-1)c+1}){\oplus}...{\oplus}({\pi}_c...{\pi}_1)$ where ${\pi}_1...{\pi}_{sc}$ are random permutations. Given a fixed number of random permutations, there seems to be a trade-off between composition and XOR for security of $SUM^s - CMP^c$. We analyze this trade-off based on some upper bound of insecurity of $SUM^s - CMP^c$, and investigate what the optimal number of each operation is, in order to lower the upper bound.

• Geomechanics and Engineering
• /
• v.13 no.4
• /
• pp.653-669
• /
• 2017

By increase in the population and consequently constructions, new structures may be built in vicinity of the soil slopes. Such structures can be regarded as an extra surcharge on the slopes. The intensity and location of the surcharge affects the displacements of the slopes. Few researchers have studied the effect of surcharge on displacements of soil slopes. In this research, using limit analysis method and upper bound theory with non-associated flow rule, displacements of soil slopes in vicinity of a surcharge has been estimated. The authors have improved the technique previously proposed by them and a new formulation is suggested for calculating the permanent displacements of the soil slope in presence of a surcharge for two failure modes, rotational and transitional. A comparison has also been made between the two mentioned modes for various conditions of surcharge and slope. The conditions resulting in the rotational mode to be more critical than the transitional mode have been investigated. Also, the effects of surcharge's intensity, location of surcharge as well as the soil properties have been investigated.

• Structural Engineering and Mechanics
• /
• v.27 no.6
• /
• pp.741-771
• /
• 2007

Tests were conducted on two partially pre-stressed concrete solid beams subjected to combined loading of bending, shear and torsion. The beams were designed using the Direct Design Method which is based on the Lower Bound Theorem of the Theory of Plasticity. Both beams were of $300{\times}300mm$ cross-section and 3.8 m length. The two main variables studied were the ratio of the maximum shear stress due to the twisting moment, to the shear stress arising from the shear force, which was varied between 0.69 and 3.04, and the ratio of the maximum twisting moment to the maximum bending moment which was varied between 0.26 and 1.19. The required reinforcement from the Direct Design Method was compared with requirements from the ACI and the BSI codes. It was found that, in the case of bending dominance, the required longitudinal reinforcements from all methods were close to each other while the BSI required much larger transverse reinforcement. In the case of torsion dominance, the BSI method required much larger longitudinal and transverse reinforcement than the both the ACI and the DDM methods. The difference in the transverse reinforcement is more pronounce. Experimental investigation showed good agreement between design and experimental failure loads of the beams designed using the Direct Design Method. Both beams failed within an acceptable range of the design loads and underwent ductile behaviour up to failure. The results indicate that the Direct Design Method can be successfully used to design partially prestressed concrete solid beams which cater for the combined effect of bending, shear and torsion loads.

• Journal of Information Science Theory and Practice
• /
• v.11 no.2
• /
• pp.22-36
• /
• 2023

This study assesses the growth and distribution of research journals indexed in Scopus from 2000 through 2019, using SCImago data for journal and country ranking. A total of 15,484 journals were indexed in Scopus up till 1999, and from 2000 to 2019, 11,037 journals were indexed in Scopus at an average of 581.85 journals per year at an average annual corresponding growth of 2.74%. Of the total journals indexed in Scopus, 41.61% were indexed during the last two decades. Europe is the leading continent publishing nearly 60% of the total world journals, while Africa publishes around 1% of journals, the lowest among all the continents. The United Kingdom, United States (US), China, Brazil, Australia, and Egypt are the leading countries publishing the maximum number of journals from their respective continents. Of the total journals indexed across the world, nearly one-fourth (6,425, 24.23%) are published in the US. Still more, of the 109 journal publishing countries across the world, nearly 90% of journals are published in twenty leading journal publishing countries. Among the 27 major Scopus recognized subject disciplines, the majority (1,606, 6.06%) of journals are published in the field of medicine. The growth of research journals and the growth of research results has moved at a uniform pace, and any asymmetry between the two is bound to result either in the introduction of predatory and dubious journals or in the production of sub-standard research results.

• Bulletin of the Korean Chemical Society
• /
• v.33 no.8
• /
• pp.2669-2674
• /
• 2012

Crown ether is one of well-known host molecules and able to selectively sequester metal cation. We employed M06-2X density functional theory with IEFPCM and SMD continuum solvation models to study selectivity of dibenzo-18-crown-6-ether (DB18C6) for alkaline earth dications, $Ba^{2+}$, $Sr^{2+}$, $Ca^{2+}$, and $Mg^{2+}$ in the gas phase and in aqueous solution. $Mg^{2+}$ showed predominantly strong binding affinity in the gas phase because of strong polarization of CO bonds by cation. In aqueous solution, binding free energy differences became smaller among these dications. However, $Mg^{2+}$ had the best binding, being incompatible with experimental observations in aqueous solution. The enthalpies of the dication exchange reaction between DB18C6 and water cluster molecules were computed as another estimation of selectivity in aqueous solution. These results also demonstrated that $Mg^{2+}$ bound to DB18C6 better than $Ba^{2+}$. We speculated that the species determining selectivity in water could be 2:1 complexes of two DB18C6s and one dication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3414-3434
• /
• 2016

Classical key generation is complicated to update and key distribution generally requires fixed infrastructures. In order to eliminate these restrictions researchers have focused much attention on physical-layer (PHY-layer) based key generation methods. In this paper, we present a PHY-layer fingerprints based fuzzy key generation scheme, which works to prevent primary user emulation (PUE) attacks and spectrum sensing data falsification (SSDF) attacks, with multi-node collaborative defense strategies. We also propose two algorithms, the EA algorithm and the TA algorithm, to defend against eavesdropping attacks and tampering attacks in mobile cognitive radio networks (CRNs). We give security analyses of these algorithms in both the spatial and temporal domains, and prove the upper bound of the entropy loss in theory. We present a simulation result based on a MIMO-OFDM communication system which shows that the channel response characteristics received by legitimates tend to be consistent and phase characteristics are much more robust for key generation in mobile CRNs. In addition, NIST statistical tests show that the generated key in our proposed approach is secure and reliable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2134-2153
• /
• 2013

A network-coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (Wireless Sensor Networks). We mainly focus on two problems: firstly, consideration is given to effective distributed storage technology; secondly, we address how to effectively repair the data in failed storage nodes. For the first problem, we propose a method to obtain a sparse generator matrix to construct network codes, and this sparse generator matrix is proven to be the sparsest. Benefiting from this matrix, the energy consumption required to implement distributed storage is reduced. For the second problem, we designed a network-coding-based iterative repair method, which adequately utilizes the idea of re-encoding at intermediate nodes from network coding theory. Benefiting from the re-encoding, the energy consumption required by data repair is significantly reduced. Moreover, we provide an explicit lower bound of field size required by this scheme, which implies that it can work over a small field and the required computation overhead is very low. The simulation result verifies that the proposed scheme not only reduces the total energy consumption required to implement distributed storage system in WSNs, but also balances energy consumption of the networks.