• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.425-425
• /
• 2006

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1007-1025
• /
• 2019

In the present work, the complete convergence and complete moment convergence properties for arrays of rowwise extended negatively dependent (END) random variables are investigated. Some sharp theorems on these strong convergence for weighted sums of END cases are established. These main results not only generalize the known corresponding ones of Cai [2], Wang et al. [17] and Shen [14], but also improve them, respectively.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.277-294
• /
• 2021

In this paper, we introduce the notions of Wijsman regularly invariant convergence types, Wijsman regularly (${\mathcal{I}}_{\sigma}$, ${\mathcal{I}}^{\sigma}_2$)-convergence, Wijsman regularly (${\mathcal{I}}^*_{\sigma}$, ${\mathcal{I}}^{{\sigma}*}_2$)-convergence, Wijsman regularly (${\mathcal{I}}_{\sigma}$, ${\mathcal{I}}^{\sigma}_2$) -Cauchy double sequence and Wijsman regularly (${\mathcal{I}}^*_{\sigma}$, ${\mathcal{I}}^{{\sigma}*}_2$)-Cauchy double sequence of sets. Also, we investigate the relationships among this new notions.

• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.349-361
• /
• 2023

In this article, we construct lacunary ∆^m-statistical convergence for triple sequences within the context of intuitionistic fuzzy n-normed spaces (IFnNS). For lacunary ∆^m-statistical convergence of triple sequence in IFnNS, we demonstrate numerous results. For this innovative notion of convergence, we further built lacunary ∆^m-statistical Cauchy sequences and offered the Cauchy convergence criterion.

• Korean Journal of Mathematics
• /
• v.32 no.1
• /
• pp.121-135
• /
• 2024

In this paper, we have presented rough ideal statistical convergence of sequence on neutrosophic normed spaces as a significant convergence criterion. As neutrosophication can handle partially dependent components, partially independent components and even independent components involved in real-world problems. By examining some properties related to rough ideal convergence in these spaces we have established some equivalent conditions on the set of ideal statistical limit points for rough ideal statistically convergent sequences.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.205-215
• /
• 2008

Many control schemes have been proposed for flow-level traffic control. However, flow-level traffic control is implemented only in limited areas such as traffic monitoring and traffic control at edge nodes. No clear solution for end-to-end architecture has been proposed. Scalability and the lack of a business model are major problems for deploying end-to-end flow-level control architecture. This paper introduces an end-to-end transport architecture and a scalable control mechanism to support the various flow-level QoS requests from applications.

• Management Science and Financial Engineering
• /
• v.16 no.2
• /
• pp.1-15
• /
• 2010

Digital convergence which means the convergence of industry areas related to digital technologies is an important phenomenon in business, which will decide the fates of firms in the near future. The only firms which can create synergy effects from digital convergence are expected to be the winners in the fierce competition of digital convergence era. In our analysis, we examine the strategy of an integrated firm which has businesses in two different industry areas which are related to each other. By using a game theoretical model, we show how the integrated firm can win over two single separated firms which have business in only one industry area each by leveraging the two businesses the integrated firm has. In our welfare analysis, we also show that this convergence may be even beneficial to consumers, which seems counter-intuitive to social concerns about anti-competitive behaviors by integrated firms. Additionally, we study comparison between industry convergence and product convergence.

• The Journal of Information Systems
• /
• v.13 no.1
• /
• pp.59-75
• /
• 2004

Fixed-mobile convergence services can be defined as the combination of previously separate fixed and mobile services, and networks and commercial practices. Examples of fixed-mobile convergence services include single voice-mail box, single number and unified messaging across fixed and mobile networks. Recently as more voice is transferred to mobile networks, convergence services between fixed and mobile become more important. In Korea convergence services are only starting to become established, and are likely to become an important part of any operator's offering. In this paper, we search the different levels of fixed-mobile convergence services and the trends and regulations for fixed-mobile convergence services in major countries. And at the same time, we also suggest the corresponding Marketing strategies by operators related to fixed-mobile convergence services.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.62-64
• /
• 2009

We report on the bias stability characteristics of transparent ZnO thin film transistors (TFTs) under visible light illumination. The transfer curve shows virtually no change under positive gate bias stress with light illumination, while it shows dramatic negative shifts under negative gate bias stress. The major mechanism of the bias stability under visible illumination of our ZnO TFTs is thought to be the charge trapping of photo-generated holes at the gate insulator and/or insulator/channel interface.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.12
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.