• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.946-955
• /
• 2004

It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.47-55
• /
• 2020

In this paper, we propose one stage multi-scale face detector based Fully Convolution Network using anchor free method. Recently almost all state-of-the-art face detectors which predict location of faces using anchor-based methods rely on pre-defined anchor boxes. However this face detectors need to hyper-parameters and additional computation in training. The key idea of the proposed method is to eliminate hyper-parameters and additional computation using anchor free method. To do this, we apply two ideas. First, by eliminating the pre-defined set of anchor boxes, we avoid the additional computation and hyper-parameters related to anchor boxes. Second, our detector predicts location of faces using multi-feature maps to reduce foreground/background imbalance issue. Through Quantitative evaluation, the performance of the proposed method is evaluated and analyzed. Experimental results on the FDDB dataset demonstrate the effective of our proposed method.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.52-61
• /
• 2013

In wireless sensor networks, the geographical positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. For this reason, studies on range-free positioning schemes have been actively progressing. The density probability scheme based on central limit theorem and normal distribution was proposed to improve the location accuracy in non-uniform sensor network environments. The density probability scheme measures the final positions of unknown nodes by estimating distance through the sensor node communication. However, it has a problem that all of the neighboring nodes have the same 1-hop distance. In this paper, we propose an efficient sensor positioning scheme that overcomes this problem. The proposed scheme performs the second positioning step through the sensing range control after estimating the 1-hop distance of each node in order to minimize the estimation error. Our experimental results show that our proposed scheme improves the accuracy of sensor positioning by about 9% over the density probability scheme and by about 48% over the DV-HOP scheme.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.261-267
• /
• 2016

In this paper, we studied the range-free localization algorithm between sensor nodes based on the Radical Line for sensor networks. Routing in wireless sensor networks should reduce the overall energy consumption of the sensor network, or induce equivalent energy consumption of all the sensor nodes. In particular, when the amount of data to send more data, the energy consumption becomes worse. New methods have been proposed to address this. So as to allow evenly control the overall energy consumption. For this, the paper covers designing a localization algorithm that can obtain the location information of the peripheral nodes with fewer operations. For the operation of the algorithm is applicable Radical Line. The experimental environment is windows 7, the Visual C ++ 2010, MSSQL 2008. The experimental results could be localized to perform an error rate of 0.1837.

• Structural Engineering and Mechanics
• /
• v.77 no.1
• /
• pp.47-56
• /
• 2021

This paper deals with damage detection using a Gapped Smoothing Method (GSM) combined with deep learning. Convolutional Neural Network (CNN) is a model of deep learning. CNN has an input layer, an output layer, and a number of hidden layers that consist of convolutional layers. The input layer is a tensor with shape (number of images) × (image width) × (image height) × (image depth). An activation function is applied each time to this tensor passing through a hidden layer and the last layer is the fully connected layer. After the fully connected layer, the output layer, which is the final layer, is predicted by CNN. In this paper, a complete machine learning system is introduced. The training data was taken from a Finite Element (FE) model. The input images are the contour plots of curvature gapped smooth damage index. A free-free beam is used as a case study. In the first step, the FE model of the beam was used to generate data. The collected data were then divided into two parts, i.e. 70% for training and 30% for validation. In the second step, the proposed CNN was trained using training data and then validated using available data. Furthermore, a vibration experiment on steel damaged beam in free-free support condition was carried out in the laboratory to test the method. A total number of 15 accelerometers were set up to measure the mode shapes and calculate the curvature gapped smooth of the damaged beam. Two scenarios were introduced with different severities of the damage. The results showed that the trained CNN was successful in detecting the location as well as the severity of the damage in the experimental damaged beam.

• The Journal of Industrial Distribution & Business
• /
• v.11 no.8
• /
• pp.21-29
• /
• 2020

Purpose: As one of the most developed cities in China, the application of e-commerce is more mature, especially the promotion of ecommerce to foreign trade. After the establishment of Shanghai Free Trade Zone (FTZ) in 2013, the government issued a series of policies to promote the application of e-commerce in Shanghai's foreign trade. This paper takes Shanghai FTZ as an example to study how to develop the application of e-commerce in other free trade zones and how to innovate the international trade mode. Research design, data and methodology: This paper selects the latest data from 2010 to 2019, uses econometric correlation analysis and regression analysis to study the impact of e-commerce on the foreign trade of Shanghai FTZ. Results: At last, the conclusion is drawn that the establishment of free trade zone provides many advantages for the development of e-commerce in Shanghai, and the growth of e-commerce in Shanghai FTZ promotes the development of foreign trade of Shanghai FTZ. Conclusions: So as to promote the development of e-commerce in Shanghai Free Trade Zone, some suggestions are put forward, such as increasing network supervision, establishing e-commerce talent training system, logistics management and information management systematization.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.990-995
• /
• 1990

A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• Journal of Microbiology and Biotechnology
• /
• v.33 no.12
• /
• pp.1671-1680
• /
• 2023

The gluten protein content in whole-wheat flour is low, which affects the elasticity and viscosity of the dough. Enzymatic modification of the protein may result in a network that mimics gluten, which plays an important role in the processing of whole-wheat foods. In this study, the effects of Halomonas alkaliantartica laccase (LacHa) on the quality parameters of whole-wheat bread were investigated. The optimum dosage of LacHa was 4 U/100 g of whole-wheat flour. At this dosage, whole-wheat bread exhibited the best specific volume and optimum texture parameters. Laccase also extended the storage duration of whole-wheat bread. We analyzed the micro-structure of the dough to determine its gluten-free protein extractable rate and free sulfhydryl group content, and verify that LacHa mediates cross-linking of gluten-free proteins. The results demonstrated that the cross-linking of gluten-free protein by LacHa improves the texture of whole-wheat bread. As a flour improver, LacHa has great developmental and application potential in baked-food production.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.775-785
• /
• 2013

Because of their exclusive features, millimeter wave directive mesh networks can be considered for small cell backhaul support in urban environments. For this purpose, a network of closely spaced stations has been considered with very directive line-of-sight links operating in the 60-GHz band. An attempt is made to evaluate channel response and interference behavior in such a network, taking into account the effect of building blockage. A simple grid of building blocks is considered as the propagation environment, and wave propagation is simulated using 2.5-dimensional (2.5D) ray tracing (2D with ground effect) to calculate the received signal at different nodes in the network. The results are compared with free space predictions and used to evaluate interference at all nodes in the channel and describe certain characteristics of links, such as the delay profile and the correlation length.