• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.77-86
• /
• 2006

We consider the set of commuting pairs of matrices and their preservers over binary Boolean algebra, chain semiring and general Boolean algebra. We characterize those linear operators that preserve the set of commuting pairs of matrices over a general Boolean algebra and a chain semiring.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3942-3961
• /
• 2019

Recently, the models of deep super-resolution networks can successfully learn the non-linear mapping from the low-resolution inputs to high-resolution outputs. However, for large scaling factors, this approach has difficulties in learning the relation of low-resolution to high-resolution images, which lead to the poor restoration. In this paper, we propose Stage Generative Adversarial Networks (Stage-GAN) with semantic maps for image super-resolution (SR) in large scaling factors. We decompose the task of image super-resolution into a novel semantic map based reconstruction and refinement process. In the initial stage, the semantic maps based on the given low-resolution images can be generated by Stage-0 GAN. In the next stage, the generated semantic maps from Stage-0 and corresponding low-resolution images can be used to yield high-resolution images by Stage-1 GAN. In order to remove the reconstruction artifacts and blurs for high-resolution images, Stage-2 GAN based post-processing module is proposed in the last stage, which can reconstruct high-resolution images with photo-realistic details. Extensive experiments and comparisons with other SR methods demonstrate that our proposed method can restore photo-realistic images with visual improvements. For scale factor ${\times}8$, our method performs favorably against other methods in terms of gradients similarity.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.4 s.38
• /
• pp.37-44
• /
• 2006

To use surveying data obtained from different sensors and different techniques, it is a pre-requite step that register them in a common coordinate system. For this purpose, we developed methodologies to register airborne photos, ALS (Airborne Laser Scanning) data and digital maps. To achieve this, conjugate features from these data should be extracted in advance. In this study, linear features are chosen as conjugate features. Based on such a selection strategy, a simple and robust algorithm is proposed for extracting such features from ALS data. Then, to register them, observation equations are established from similarity measurements of the extracted features and the results was evaluated statistically. The results clearly demonstrate that the proposed algorithms are appropriate to register these data.

• Coupled systems mechanics
• /
• v.8 no.4
• /
• pp.351-375
• /
• 2019

The present work investigates the use of a rigid rocking block as a tool to reduce vibrations in a frame structure. The study is based on a simplified model composed by a 2-DOF linear system, meant to represent a general M-DOF frame structure, coupled with a rocking rigid block through a linear visco-elastic device, which connects only the lower part of the 2-DOF system. The possibility to restrain the block directly to the ground, by means of a second visco-elastic device, is investigated as well. The dynamic response of the model under an harmonic base excitation is then analysed in order to evaluate the effectiveness of the coupling in reducing the displacements and the drift of the 2-DOF system. The nonlinear equations of motion of the coupled assemblage 2-DOF-block are obtained by a Lagrangian approach and then numerically integrated considering some reference mechanical and geometrical quantities as variable parameters. It follows an extensive parametric analysis, whose results are summarized through behaviour maps, which portray the ratio between the maximum displacements and drifts of the system, with and without the coupling with the rigid block, for several combinations of system's parameters. When the ratio of the displacements is less than unity, the coupling is considered effective. Results show that the presence of the rocking rigid block improves the dynamics of the system in large ranges of the characterizing parameters.

• Bulletin of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.189-196
• /
• 1990

In this paper, we try to generalize ultraproducts in the category of locally convex spaces. To do so, we introduce D-ultracolimits. It is known [7] that the topology on a non-trivial ultraproduct in the category T $V^{ec}$ of topological vector spaces and continuous linear maps is trivial. To generalize the category Ba $n_{1}$ of Banach spaces and linear contractions, we introduce the category L $C_{1}$ of vector spaces endowed with families of semi-norms closed underfinite joints and linear contractions (see Definition 1.1) and its subcategory, L $C_{2}$ determined by Hausdorff objects of L $C_{1}$. It is shown that L $C_{1}$ contains the category LC of locally convex spaces and continuous linear maps as a coreflective subcategory and that L $C_{2}$ contains the category Nor $m_{1}$ of normed linear spaces and linear contractions as a coreflective subcategory. Thus L $C_{1}$ is a suitable category for the study of locally convex spaces. In L $C_{2}$, we introduce $l_{\infty}$(I. $E_{i}$ ) for a family ( $E_{i}$ )$_{i.mem.I}$ of objects in L $C_{2}$ and then for an ultrafilter u on I. we have a closed subspace $N_{u}$ . Using this, we construct ultraproducts in L $C_{2}$. Using the relationship between Nor $m_{1}$ and L $C_{2}$ and that between Nor $m_{1}$ and Ba $n_{1}$, we show thatour ultraproducts in Nor $m_{1}$ and Ba $n_{1}$ are exactly those in the literatures. For the terminology, we refer to [6] for the category theory and to [8] for ultraproducts in Ba $n_{1}$..

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2019-2022
• /
• 2002

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.

• Geomechanics and Engineering
• /
• v.13 no.3
• /
• pp.475-488
• /
• 2017

Geotechnical data contributes substantially to the cost of engineering projects due to increasing cost of site investigations. Existing information in the form of soil maps can save considerable time and expenses while deciding the scope and extent of site exploration for a proposed project site. This paper presents spatial interpolation of data obtained from soil investigation reports of different construction sites and development of soil maps for geotechnical characterization of Multan area using ArcGIS. The subsurface conditions of the study area have been examined in terms of soil type and standard penetration resistance. The Inverse Distance Weighting method in the Spatial Analyst extension of ArcMap10 has been employed to develop zonation maps at different depths of the study area. Each depth level has been interpolated as a surface to create zonation maps for soil type and standard penetration resistance. Correlations have been presented based on linear regression of standard penetration resistance values with depth for quick estimation of strength and stiffness of soil during preliminary planning and design stage of a proposed project in the study area. Such information helps engineers to use data derived from nearby sites or sites of similar subsoils subjected to similar geological process to build a preliminary ground model for a new site. Moreover, reliable information on geometry and engineering properties of underground layers would make projects safer and economical.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• The Pure and Applied Mathematics
• /
• v.30 no.2
• /
• pp.109-129
• /
• 2023

In this paper, we introduce a second order linear differential operator ^T□: C^∞ (M) → C^∞ (M) as a natural generalization of Cheng-Yau operator, [8], where T is a (1, 1)-tensor on Riemannian manifold (M, h), and then we show on compact Riemannian manifolds, divT = divT^t, and if divT = 0, and f be a smooth function on M, the condition ^T□ f = 0 implies that f is constant. Hereafter, we introduce T-energy functionals and by deriving variations of these functionals, we define T-harmonic maps between Riemannian manifolds, which is a generalization of L_k-harmonic maps introduced in [3]. Also we have studied fT-harmonic maps for conformal immersions and as application of it, we consider fL_k-harmonic hypersurfaces in space forms, and after that we classify complete fL₁-harmonic surfaces, some fL_k-harmonic isoparametric hypersurfaces, fL_k-harmonic weakly convex hypersurfaces, and we show that there exists no compact fL_k-harmonic hypersurface either in the Euclidean space or in the hyperbolic space or in the Euclidean hemisphere. As well, some properties and examples of these definitions are given.

• Journal of Integrative Natural Science
• /
• v.10 no.2
• /
• pp.115-118
• /
• 2017

We study a notion of $\mathcal{A}$-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We prove a sufficient condition for a linear map to satisfy the $\mathcal{A}$-frequent hypercyclicity in the strong operator topology.