• Architectural research
• /
• v.9 no.1
• /
• pp.31-37
• /
• 2007

This study presents the so-called Modified Allowable Stress Design (MASD) method for structural designs. The objective of this study is to qualitatively estimate uncertainties of tensile steel member's cross-sectional structural designs and find the optimal resulting design which can resist all uncertainty cases. The design parameters are assumed to be interval associated with lower and upper bounds and consequently interval methods are implemented to non-stochastically produce design results including the structural uncertainties. By seeking optimal uncertainty combinations among interval parameters, engineers can qualitatively describe uncertain design solutions which were not considered in conventional structural designs. Under the assumption that structures have basically uncertainties like displacement responses, the safety range of resulting designs is represented by lower and upper bounds depending on given tolerance error and structural parameters. As a numerical example uncertain cross-sectional areas of members that can resist applied loads are investigated and it demonstrates that the present design method is superior to conventional allowable stress designs (ASD) with respect to a reliably structural safety as well as an economical material.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.21-26
• /
• 2015

The general wiretap channel with noiseless feedback is first investigated by Ahlswede and Cai, where lower and upper bounds on the secrecy capacity are provided in their work. The upper bound is met with equality only in some special cases. In this paper, we study a special case of the general wiretap channel with noiseless feedback (called non-degraded wiretap channel with noiseless feedback). Inner and outer bounds on the capacity-equivocation region of this special model are provided. The outer bound is achievable if the main channel is more capable than the wiretap channel. The inner bound is constructed especially for the case that the wiretap channel is more capable than the main channel. The results of this paper are further explained via binary and Gaussian examples. Compared with the capacity results for the non-degraded wiretap channel, we find that the security is enhanced by using the noiseless feedback.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.37-44
• /
• 2020

The fifth generation (5G) mobile communication has been commercialized and the 5G applications, such as the artificial intelligence (AI) and the internet of things (IoT), are deployed all over the world. The 5G new radio (NR) wireless networks are characterized by 100 times more traffic, 1000 times higher system capacity, and 1 ms latency. One of the promising 5G technologies is non-orthogonal multiple access (NOMA). In order for the NOMA performance to be improved, sometimes the additive signal-dependent Gaussian noise (ASDGN) channel model is required. However, the channel capacity calculation of such channels is so difficult, that only lower and upper bounds on the capacity of ASDGN channels have been presented. Such difficulties are due to the specific constraints on the dependency. Herein, we provide the capacity of ASDGN channels, by removing the constraints except the dependency. Then we obtain the ASDGN channel capacity, not lower and upper bounds, so that the clear impact of ASDGN can be clarified, compared to additive white Gaussian noise (AWGN). It is shown that the ASDGN channel capacity is greater than the AWGN channel capacity, for the high signal-to-noise ratio (SNR). We also apply the analytical results to the NOMA scheme to verify the superiority of ASDGN channels.

• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.365-377
• /
• 2015

For a (molecular) graph, the first and second Zagreb indices (M₁ and M₂) are two well-known topological indices, first introduced in 1972 by Gutman and Trinajstić. The first Zagreb index M₁ is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M₂ is equal to the sum of the products of the degrees of pairs of adjacent vertices. Let $K_{n_1,n_2}^{P}$ with n₁ $\leq$ n₂, n₁ + n₂ = n and p < n₁ be the set of bipartite graphs obtained by deleting p edges from complete bipartite graph K_n1,n2. In this paper, we determine sharp upper and lower bounds on Zagreb indices of graphs from $K_{n_1,n_2}^{P}$ and characterize the corresponding extremal graphs at which the upper and lower bounds on Zagreb indices are attained. As a corollary, we determine the extremal graph from $K_{n_1,n_2}^{P}$ with respect to Zagreb coindices. Moreover a problem has been proposed on the first and second Zagreb indices.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.711-717
• /
• 2007

Location information will become increasingly important for future Pervasive Computing applications. Location tracking system of a moving device can be classified into two types of architectures: an active mobile architecture and a passive mobile architecture. In the former, a mobile device actively transmits signals for estimating distances to listeners. In the latter, a mobile device listens signals from beacons passively. Although the passive architecture such as Cricket location system is inexpensive, easy to set up, and safe, it is less precise than the active one. In this paper, we present a passive location system using Cricket Mote sensors which use RF and ultrasonic signals to estimate distances. In order to improve accuracy of the passive system, the transmission speed of ultrasound was compensated according to air temperature at the moment. Upper and lower bounds of a distance estimation were set up through measuring minimum and maximum distances that ultrasonic signal can reach to. Distance estimations beyond the upper and the lower bounds were filtered off as errors in our scheme. With collecting distance estimation data at various locations and comparing each distance estimation with real distance respectively, we proposed an equation to compensate the deviation at each point. Equations for proposed algorithm were derived to calculate relative coordinates of a moving device. At indoor and outdoor tests, average location error and average location tracking period were 3.5 cm and 0.5 second, respectively, which outperformed Cricket location system of MIT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.958-964
• /
• 2007

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.162-172
• /
• 1999

For VBR video traffic, Motion-Picture Experts Group(MPEG) coding algorithm was adopted as the standard coding algorithm by International Telecommunication Union(ITU). In this paper, we propose a traffic model of an MPEG coded video traffic in frame level and cell level, and develop an approximate model for evaluating performance of a ATM multiplexer with homogeneous MPEG video sources by considering burst-level variation of aggregated traffics. For homogeneous MPEG video traffics which are frame-synchronized, the performance of the ATM multiplexer is influenced by source correlation at the multiplexing time. When sources are highly correlated, we decompose the aggregated cell streams by the frame-type and model multiplexing process during a frame time as n*D/D/1/K queueing model and suggest an approximate method for obtaining CLP of the ATM multiplexer. In the case that sources are highly correlated, the solution has the meaning of the upper bounds of performance of the ATM multiplexer. For the verification of our model, we compare the solution of our model with simulation resets. As the number of sources increases. The CLP obtained from our model approaches to simulation results, and gives upper bounds of simulation results.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.3
• /
• pp.371-378
• /
• 2016

The most important things in real-time systems are that a system guarantees to meet its deadline and to operate in its predictable range. When we design a real-time system, we need to verify whether the system can meet its deadline through schedulability analysis. There are several kinds of schedulability analysis technique for fixed priority scheduling systems. But as we all know, we can't perform schedulability analysis in design time because we can't estimate upper bounds on execution time of each task. So we used a similar real-time system to estimate upper bounds on execution time for our system, and then we performed schedulability analysis and verified that our system designed can meet its deadline.