• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2000

One of the main chalenges in personal communication services (PCS) is to locate many mobile terminals that may move frequently from place to place. Such a system operation is called location management. Many network signaling traffic, and database queries are required to achieve such a task. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current location on mobile terminals, and are vulnerable to failure of the location registers. In this paper, we propose a fault-tolerant pointer forwarding with distributed home location register (FT-RFDHLR) to tolerate the failure of location registers. The performance of the proposed method is evaluated by an analytical model, and is compared with thew pointer forwarding with the single home location register (PFSHLR), the pointer forwarding with distributed home location register (PFDHLR), Biaz's bypass forwarding strategy (BFS) and two-path forwarding strategy (TPFS).

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.938-941
• /
• 2010

Though a compiler checks memory errors, it is difficult for the compiler to detect function pointer errors in code level. Thus, in this paper, we propose a method for effectively detecting Invalid function pointer access errors, by analyzing assembly codes that are obtained by disassembling an executable file. To detect the errors, assembly codes in disassembled files are checked out based on the instruction transition diagrams which are constructed through analyzing normal usage patterns of function pointer access. When applying the proposed method to various programs having no compilation error, a total of about 500 potential errors including the ones of well-known open source programs such as Apache web server and PHP script interpreter are detected among 1 million lines of assembly codes corresponding to a total of about 10 thousand functions.

• Journal of Korean Medicine Rehabilitation
• /
• v.28 no.1
• /
• pp.85-96
• /
• 2018

Objectives This study was performed to compare the electrical methods of motor points mapping using surface EMG and electric probe (Pointer Excel II). Methods 32 healthy adults (male 16, female 16) were selected. and classified into two groups; surface EMG group, electric probe (Pointer Excel II) group. In surface EMG group, motor points were searched by recoding the compound muscle potentials. In electric probe (Pointer Excel II) group, motor points were searched by scanning the skin with Pointer Excel II at low level stimulation. The locations of the motor points were expressed as X and Y values in relation to the reference line. The horizontal reference line was set as elbow crease and the vertical reference line was set as the line connecting coracoid process to the center of the horizontal reference line. The data was analyzed by 'Independent T-test' and 'equivalence test'. Results 1. The motor points of short head and long head of biceps brachii muscle were located at about 2/3 length of the vertical reference line from coracoid process and about 1/5~1/4 length of the half of the horizontal reference line from the vertical reference line in both group. 2. The motor points of the short head were located more distally and close to the vertical reference line (p<0.001). 3. In surface EMG group, the motor points of the long head were located more laterally in the female than male. And the motor points of the long head were located more distally in the left side than right side (p<0.05). In electric probe (Pointer Excel II) group, similar tendency was observed but there was no statistically significant difference (p>0.05). 4. As a result of the equivalence test between surface EMG group and electric probe (Pointer Excel II) group, the confidence intervals of the difference were within the equivalence limit. Therefore, the locations of the motor points searched by two ways are equa l (p>0.05, equivalence interval=3%). Conclusions The results indicate that electric probe (Pointer Excel II) can be used to search the motor points instead of surface EMG. This might improve the clinical efficiency when using the motor points to treat muscle dysfunction.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.683-692
• /
• 2005

Java specification states that all accesses to an object must be checked at runtime if object refers to null. Since Java is an object-oriented language, object accesses are frequent enough to make null pointer checks affect the performance significantly. In order to reduce the performance degradation, there have been attempts to remove redundant null pointer checks. For example, in a Java environment where a just-in-time (JIT) compiler is used, the JIT compiler removes redundant null pointer check code via code analysis. This paper proposes a technique to remove additional null pointer check code that could not be removed by previous JIT compilation techniques, via early null pointer check using an architectural feature called predication. Generally, null point check code consists of two instructions: a compare and a branch. Our idea is moving the compare instruction that is usually located just before an use of an object, to the point right after the object is defined so that the total number of compare instructions is reduced. This results in reduction of dynamic and static compare instructions by 3.21$\%$ and 1.98$\%$. respectively, in SPECjvm98 bechmarks, compared to the code that has already been optimized by previous null pointer check elimination techniques. Its performance impact on an Itanium machine is an improvement of 0.32$\%$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.11
• /
• pp.1168-1172
• /
• 2011

Beam projector is popularly used for presentation. In order to pay attention to local area of the beam projector display, a laser pointer is used together with a pointing device(Mouse). Simple wireless presenter has limited functions of a pointing device such as "go to next slide" or "back to previous slide" in a specific application(Microsoft PowerPoint) through wireless channel; thus, there is inconvenience to do other tasks e.g., program execution, maximize/minimize window etc. provided by clicking mouse buttons. The main objective of this paper is to implement a multi-functional laser-pointer mouse that has the same functions of a computer mouse. In order to get position of laser spot in the projector display, an image processing to extract the laser spot in the camera image is required. In addition, we propose a transformation of the spot position into computer display coordinates to execute mouse functions on computer display.

• Journal of Sensor Science and Technology
• /
• v.27 no.4
• /
• pp.216-220
• /
• 2018

In this paper, we present visual sensing techniques that can be used to teach a robot using a laser pointer. The light spot of an off-the-shelf laser pointer is detected and its movement is tracked on consecutive images of a camera. The three-dimensional position of the spot is calculated using stereo cameras. The light spot on the image is detected based on its color, brightness, and shape. The detection results in a binary image, and morphological processing steps are performed on the image to refine the detection. The movement of the laser spot is measured using two methods. The first is a simple method of specifying the region of interest (ROI) centered at the current location of the light spot and finding the spot within the ROI on the next image. It is assumed that the movement of the spot is not large on two consecutive images. The second method is using a Kalman filter, which has been widely employed in trajectory estimation problems. In our simulation study of various cases, Kalman filtering shows better results mostly. However, there is a problem of fitting the system model of the filter to the pattern of the spot movement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1135-1140
• /
• 2011

This paper proposes a DTMB deinterleaver structure to reduce the SDRAM power consumption with buffer conversion and the single pointer-register structure. The DTMB deinterleaver with deep interleaving for higher performance consists of long delay buffers allocated on SDRAM. The conventional structure activates a new SDRAM row almost everytime when it reads and writes a datum. In the proposed structure, long buffers are transformed into several short buffers so that the number of row activations is reduced. The single pointer-register structure solves the problem of many pointer-registers. The experimental results show that the SDRAM power consumption can be reduced to around 37% with slight logic area reduction.

• Journal of KIISE:Software and Applications
• /
• v.35 no.10
• /
• pp.636-652
• /
• 2008

In this paper, we present a modular pointer analysis algorithm based on the update history. We use the term 'module' to mean a set of mutually recursive procedures and the term 'modular analysis' to mean a program analysis that does not need the source codes of the other modules to analyze a module. Since a modular pointer analysis does not utilize any information on the callers, it is difficult to design a precise analysis that does not lose the information related to the program flow or the calling context. In this paper, we propose a modular and flow- and context-sensitive pointer analysis algorithm based on the update history that can memory states of a procedure independently of the information on the calling context and keep the information on the order of side effects performed. Such a memory representation not only enables the analysis to be formalized as a modular analysis, but also helps the analysis to effectively identify killed side effects and relevant alias contexts.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.774-781
• /
• 2017

Mention detection systems use nouns or noun phrases as a head and construct a chunk of text that defines any meaning, including a modifier. The term "mention detection" relates to the extraction of mentions in a document. In the mentions, a coreference resolution pertains to finding out if various mentions have the same meaning to each other. A pointer network is a model based on a recurrent neural network (RNN) encoder-decoder, and outputs a list of elements that correspond to input sequence. In this paper, we propose the use of mention detection using pointer networks. Our proposed model can solve the problem of overlapped mention detection, an issue that could not be solved by sequence labeling when applying the pointer network to the mention detection. As a result of this experiment, performance of the proposed mention detection model showed an F1 of 80.07%, a 7.65%p higher than rule-based mention detection; a co-reference resolution performance using this mention detection model showed a CoNLL F1 of 52.67% (mention boundary), and a CoNLL F1 of 60.11% (head boundary) that is high, 7.68%p, or 1.5%p more than coreference resolution using rule-based mention detection.