• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.1-30
• /
• 2013

The capitalization of know-how, knowledge management, and the control of the constantly growing information mass has become the new strategic challenge for organizations that aim to capture the entire wealth of knowledge (tacit and explicit). Thus, knowledge mapping is a means of (cognitive) navigation to access the resources of the strategic heritage knowledge of an organization. In this paper, we present a new mapping approach based on the Boolean modeling of critical domain knowledge and on the use of different data sources via the data mining technique in order to improve the process of acquiring knowledge explicitly. To evaluate our approach, we have initiated a process of mapping that is guided by machine learning that is artificially operated in the following two stages: data mining and automatic mapping. Data mining is be initially run from an induction of Boolean case studies (explicit). The mapping rules are then used to automatically improve the Boolean model of the mapping of critical knowledge.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.105-112
• /
• 2016

In this paper, we propose a technique that can be mapped to the most appropriate type of health patterns, depending on the health status of health promotion measures to establish a body mass index (BMI). When used as a mapping scheme proposed in this paper it is possible to contribute to effective healthcare and health promotion. BMI is widely used as a simple way to assess obesity because body fat increases the status and relevance. Despite normal weight determined by this and because of the social atmosphere has increased prefer the skinny tend to try to excessive weight loss. Since health can affect the health maintenance and promotion of the rest of your life, depending on whether and how much weight perception and health can be considered as very important. Therefore, this paper identifies the differences in perception and in this respect for the body mass index (BMI). And physical, mental and map the appropriate type of pattern in the relationship between body mass index (BMI) in order to facilitate the social and health conditions. Proposal to give such a mapping technique provides the opportunity to increase the efficiency of health care and health promotion.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.785-827
• /
• 2023

In this paper, under some new appropriate conditions imposed on the parameter and mappings involved in the resolvent operator associated with a P-accretive mapping, its Lipschitz continuity is proved and an estimate of its Lipschitz constant is computed. This paper is also concerned with the construction of a new iterative algorithm using the resolvent operator technique and Nadler's technique for solving a new system of generalized multi-valued resolvent equations in a Banach space setting. The convergence analysis of the sequences generated by our proposed iterative algorithm under some appropriate conditions is studied. The final section deals with the investigation and analysis of the notion of H(·, ·)-co-accretive mapping which has been recently introduced and studied in the literature. We verify that under the conditions considered in the literature, every H(·, ·)-co-accretive mapping is actually P-accretive and is not a new one. In the meanwhile, some important comments on H(·, ·)-co-accretive mappings and the results related to them appeared in the literature are pointed out.

• Spatial Information Research
• /
• v.13 no.4 s.35
• /
• pp.373-380
• /
• 2005

Mobile Mapping Systems are effective systems to acquire the position and image data using vehicle equipped with the GPS (Global Positioning System), IMU (Inertial Measurement Unit), and CCD camera. They are used in various fields of road facility management, map update, and etc. In the general photogrammetry such as aerial photogrammetry, GCP (Ground Control Point)s are needed to compute the image exterior orientation elements (the position and attitude of camera). These points are measured by field survey at the time of data acquisition. But it costs much time and money. Moreover, it is not possible to make sufficient GCP as much as we want. However Mobile Mapping Systems are more efficient both in time and money because they can obtain the position and attitude of camera at the time of photographing. That is, Image Orientation Technique must use GCP to compute the image exterior orientation elements, but on the other hand Direct Georeferencing can directly compute the image exterior orientation elements by GPS/INS. In this paper, we analyze about the positional accuracy comparison of ground point using the Image Orientation Technique and Direct Georeferencing Technique.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.15-23
• /
• 1996

Bump mapping is an elegant rendering technique to simulate wrinkled surfaces such as bark, which enables to produce more realistic image than texture-mapped one. This paper presents a new algorithm for bump mapping along with a hardware architecture to run our algorithm in real-time. The proposed approach is more efficient than previous one, and in particular, our hardware architecture is simpler to implement.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.465-478
• /
• 2006

In this paper, we introduce a new class of completely generalized strongly nonlinear quasivariational inequalities and establish its equivalence with a class of fixed point problems by using the resolvent operator technique. Utilizing this equivalence, we develop a three-step iterative scheme with errors, obtain a few existence theorems of solutions for the completely generalized non-linear strongly quasivariational inequality involving relaxed monotone, relaxed Lipschitz, strongly monotone and generalized pseudocontractive mappings and prove some convergence and stability results of the sequence generated by the three-step iterative scheme with errors. Our results include several previously known results as special cases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.663-674
• /
• 2003

Bump mapping is a technique that represents the detailed parts of the object surface, such as a perturberance of the skin of a peanut, using the geometry mapping without complex modeling. However, the hardware implementation for bump mapping is considerable, because a large amount of per pixel computation, including the normal vector shading, is required. In this paper, we propose a new bump mapping algorithm using the polar coordinate system and its hardware architecture. Compared with other existing architectures, our approach performs bump mapping effectively by using a new vector rotation method for transformation into the reference space and minimizing illumination calculation. Consequently, our proposed architecture reduces a large amount of computation and hardware requirements.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.8
• /
• pp.84-91
• /
• 2002

In this paper, we proposed a CLB-based CPLD technology mapping algorithm for power minimization under time constraint in combinational circuit. The main idea of our algorithm is to exploit the "cut enumeration and feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. In our technology mapping algorithm conducted a low power by calculating TD and EP of each node and decomposing them on the circuit composed of DAG. It also takes the number of input, output, and OR-term into account on condition that mapping can be done up to the base of CLB, and so it generates the feasible clusters to meet the condition of time constraint. Of the feasible clusters, we should first be mapping the one that h3s the least output for technology mapping of power minimization and choose to map the other to meet the condition of time constraint afterwards. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the exiting algorithms. The experimental results show that our approach is shown a decrease of 46.79% compared with DDMAP and that of 24.38% for TEMPLA in the power consumption.

• Journal of Biomedical Engineering Research
• /
• v.17 no.4
• /
• pp.525-534
• /
• 1996

We have developed a fast steady state free precession interferometry (SSFPI) technique which is useful for the fMRl (functional Magnetic Resonance Imaging). As is known, SSFP sequence with a suitable adjustment of Vadient (readeut) allows us to measure precession angle 6 which in tw relates to the field inhomogeneity. Combining the two pulses (known as FID and Echo) in FADE (Fast Acquisition Double Echo) sequence, for example, one can obtain the interference term which is directly related to the precession angle It has been known that a fast high resolution magnetic field mapping is possible by use of the modified FADE sequence or SSFPI, and we have attempted to use the SSFPI technique for the susceptibility-induced fMRl. When the method is applied to the susceptibility effect based functional magnetic resonance imaging (fMRl), it was found that the direct susceptibility effect measurement was possible without perturbations such as the backgrounds and inflow effect. In this paper, simulation results and experimental results obtained with 2.0 Tesla MRI system are presented.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.592-607
• /
• 2006

This paper proposes a technique to select processors and hardware IPs and to map the tasks into the selected processing elements, aming to achieve high performance with minimal system cost when multitask applications with real-time constraints are run on a multicore SoC. Such technique is called to 'Hardware-Software Cosynthesis Technique'. A cosynthesis technique was already presented in our early work [1] where we divide the complex cosynthesis problem into three subproblems and conquer each subproblem separately: selection of appropriate processing components, mapping and scheduling of function blocks to the selected processing component, and schedulability analysis. Despite good features, our previous technique has a serious limitation that a task monopolizes the entire system resource to get the minimum schedule length. But in general we may obtain higher performance in multitask multicore system if independent multiple tasks are running concurrently on different processor cores. In this paper, we present two mapping techniques, task mapping avoidance technique(TMA) and task mapping pinning technique(TMP), which are applicable for general cases with diverse operating policies in a multicore environment. We could obtain significant performance improvement for a multimedia real-time application, multi-channel Digital Video Recorder system and for randomly generated multitask graphs obtained from the related works.