• Title/Summary/Keyword: Pointer

Search Result 307, Processing Time 0.021 seconds

Cycle Detection of Discrete Logarithm using an Array (배열을 이용한 이산대수의 사이클 검출)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.15-20
    • /
    • 2023
  • Until now, Pollard's Rho algorithm has been known as the most efficient way for discrete algebraic problems to decrypt symmetric keys. However, the algorithm is being studied on how to further reduce the complexity of O(${\sqrt{p}}$) performance, along with the disadvantage of having to store the giant stride m=⌈${\sqrt{p}}$⌉ data. This paper proposes an array method for cycle detection in discrete logarithms. The proposed method reduces the number of updates of stack memory by at least 73%. This is done by only updating the array when (xi<0.5xi-1)∩(xi<0.5(p-1)). The proposed array method undergoes the same number of modular calculation as stack method, but significantly reduces the number of updates and the execution time for array through the use of a binary search method.

A Study of the Accessibility Evaluation of the SI-Bass Guitar (플러그인 가상악기 SI-Bass Guitar의 접근성 평가 연구)

  • Yong-Hwan Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.495-500
    • /
    • 2024
  • The purpose of this study is to evaluate the accessibility of the SI-Bass Guitar for the visually impaired who uses the Sense Reader which is a screen reader software. An evaluation was performed for the Sense Reader users to do the [Virtual Instrument Editing] task on the NCS(National Competency Standards) using the SI-Bass Guitar. This study shows that the SI-Bass Guitar has no basic accessibility. But the visually impaired can do above task using the Sense Reader's Mouse Pointer and Position Memory Function. Several Propositions are suggested to develop a fully accessible SI-Bass Guitar for the screen users.

Design of Vision-based Interaction Tool for 3D Interaction in Desktop Environment (데스크탑 환경에서의 3차원 상호작용을 위한 비전기반 인터랙션 도구의 설계)

  • Choi, Yoo-Joo;Rhee, Seon-Min;You, Hyo-Sun;Roh, Young-Sub
    • The KIPS Transactions:PartB
    • /
    • v.15B no.5
    • /
    • pp.421-434
    • /
    • 2008
  • As computer graphics, virtual reality and augmented reality technologies have been developed, in many application areas based on those techniques, interaction for 3D space is required such as selection and manipulation of an 3D object. In this paper, we propose a framework for a vision-based 3D interaction which enables to simulate functions of an expensive 3D mouse for a desktop environment. The proposed framework includes a specially manufactured interaction device using three-color LEDs. By recognizing position and color of the LED from video sequences, various events of the mouse and 6 DOF interactions are supported. Since the proposed device is more intuitive and easier than an existing 3D mouse which is expensive and requires skilled manipulation, it can be used without additional learning or training. In this paper, we explain methods for making a pointing device using three-color LEDs which is one of the components of the proposed framework, calculating 3D position and orientation of the pointer and analyzing color of the LED from video sequences. We verify accuracy and usefulness of the proposed device by showing a measurement result of an error of the 3D position and orientation.

Microarchitectural Defense and Recovery Against Buffer Overflow Attacks (버퍼 오버플로우 공격에 대한 마이크로구조적 방어 및 복구 기법)

  • Choi, Lynn;Shin, Yong;Lee, Sang-Hoon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.3
    • /
    • pp.178-192
    • /
    • 2006
  • The buffer overflow attack is the single most dominant and lethal form of security exploits as evidenced by recent worm outbreaks such as Code Red and SQL Stammer. In this paper, we propose microarchitectural techniques that can detect and recover from such malicious code attacks. The idea is that the buffer overflow attacks usually exhibit abnormal behaviors in the system. This kind of unusual signs can be easily detected by checking the safety of memory references at runtime, avoiding the potential data or control corruptions made by such attacks. Both the hardware cost and the performance penalty of enforcing the safety guards are negligible. In addition, we propose a more aggressive technique called corruption recovery buffer (CRB), which can further increase the level of security. Combined with the safety guards, the CRB can be used to save suspicious writes made by an attack and can restore the original architecture state before the attack. By performing detailed execution-driven simulations on the programs selected from SPEC CPU2000 benchmark, we evaluate the effectiveness of the proposed microarchitectural techniques. Experimental data shows that enforcing a single safety guard can reduce the number of system failures substantially by protecting the stack against return address corruptions made by the attacks. Furthermore, a small 1KB CRB can nullify additional data corruptions made by stack smashing attacks with only less than 2% performance penalty.

Improving Performance of File-referring Octree Based on Point Reallocation of Point Cloud File (포인트 클라우드 파일의 측점 재배치를 통한 파일 참조 옥트리의 성능 향상)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.5
    • /
    • pp.437-442
    • /
    • 2015
  • Recently, the size of point cloud is increasing rapidly with the high advancement of 3D terrestrial laser scanners. The study aimed for improving a file-referring octree, introduced in the preceding study, which had been intended to generate an octree and to query points from a large point cloud, gathered by 3D terrestrial laser scanners. To the end, every leaf node of the octree was designed to store only one file-pointer of its first point. Also, the point cloud file was re-constructed to store points sequentially, which belongs to a same leaf node. An octree was generated from a point cloud, composed of about 300 million points, while time was measured during querying proximate points within a given distance with series of points. Consequently, the present method performed better than the preceding one from every aspect of generating, storing and restoring octree, so as querying points and memorizing usage. In fact, the query speed increased by 2 times, and the memory efficiency by 4 times. Therefore, this method has explicitly improved from the preceding one. It also can be concluded in that an octree can be generated, as points can be queried from a huge point cloud, of which larger than the main memory.

Approach-avoidance, Stress Response, and Body Temperature of Dogs Following Removal of the Mamillary Bodies (유두체를 떼어버린 개의 접근-회피반응, 스트레스에 대한 반응 및 체온 변동)

  • Kim, Chul;Park, Rho-Soon
    • The Korean Journal of Physiology
    • /
    • v.2 no.1
    • /
    • pp.1-8
    • /
    • 1968
  • As a continuation of a series of work on the physiology of the mamillary bodies, 3 experiments were carried out using 8 pointer dogs subjected surgical removal of this hypothalamic structure by subtemporal approach. In the first experiment, animals were tested per- and postoperatively in approach-avoidance situation. Food served as incentive, electric shock to the tongue as punishment, and response latency of postpunishment trial as an index of fear. The second experiment dealt with per- and postoperative tests in stress situation. A high frequency sound (12,000 cycle, 100 db sound for 1 hour) was regarded as a stressor, and decrease in blood eosinophil cell count as an index of response th the stress. Pre- and postoperative measurement of rectal temperature was carried out in the third experiment, using a clinical thermometer with decimal centigrade scale. The results obtained were as follows: 1. Tests in approach-avoidance situation showed no indication of increased or decreased fear response following removal of the mamillary bodies. 2. Postoperative stress response was as marked as that of preoperative period, but the recovery from the stress was significantly retarded after surgery. 3. The body temperature dropped slightly, but significantly following damage to the mamillary bodies.

  • PDF

DGR-Tree : An Efficient Index Structure for POI Search in Ubiquitous Location Based Services (DGR-Tree : u-LBS에서 POI의 검색을 위한 효율적인 인덱스 구조)

  • Lee, Deuk-Woo;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.55-62
    • /
    • 2009
  • Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

  • PDF

Monitoring Feeding Adequacy in Dairy Cows Using Milk Urea and Milk Protein Contents under Farm Condition

  • Dhali, A.;Mehla, R.K.;Sirohi, S.K.;Mech, A.;Karunakaran, M.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.19 no.12
    • /
    • pp.1742-1748
    • /
    • 2006
  • The experiment was conducted on 264 crossbred Karan-Fries (Holstein Friesian${\times}$Tharparkar) cows, over one year to explore the possibility of using milk urea (MU) concentration and milk protein content to monitor feeding adequacy under farm condition and to investigate the effects of different animal factors and season on MU concentration. Individual noon (1200 to 1300 h) milk samples were collected once in every month and analysed for urea and protein contents. Representative feed samples were also collected on the same day of milk collection and were analysed for CP content. A significant positive association (p<0.01) between MU concentration and milk yield was observed. MU concentrations (mg/dl) were found to be significantly (p<0.01) higher and lower in first lactation (44.8${\pm}$0.7) and in early lactation stage (40.7${\pm}$0.5), respectively. Average MU values were found to be significantly (p<0.01) higher in winter (50.7${\pm}$0.3) and lower in summer (32.9${\pm}$0.6). During the investigation, of the total MU observations, 50.3% were within the range of 30 to 50 mg/dl, 21.4% were <30 mg/dl and only 7.5% were >60 mg/dl. MU concentration was found to be associated significantly (p<0.05) with CP content of forages rather than concentrate. A close positive association (p<0.01) between MU level and daily milk protein (DMP) yield was observed during the investigation. The regression equation, DMP yield (g) = -24.6+33.5 daily milk yield (kg) +0.9 MU (mg/dl) was developed to establish the reference level of DMP yield. The result indicates that the effect of parity and stage of lactation may be ignored while interpreting MU values. However, reference MU values may be standardised separately for high milk yielders as level of milk yield contributes significantly to the variation of MU. The study revealed that the MU values together with DMP yield and milk protein content could be used as a potential non-invasive pointer to monitor feeding adequacy in dairy cows under farm conditions.

RSP-DS: Real Time Sequential Patterns Analysis in Data Streams (RSP-DS: 데이터 스트림에서의 실시간 순차 패턴 분석)

  • Shin Jae-Jyn;Kim Ho-Seok;Kim Kyoung-Bae;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.9
    • /
    • pp.1118-1130
    • /
    • 2006
  • Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

  • PDF

Synergistic Effect of Oxygen Pressure and Sonophoresis for Skin Permeability (산소 압력과 초음파를 이용한 피부투과도 증대에 관한 연구)

  • 차민석;이철규;윤영로;이원수
    • Journal of Biomedical Engineering Research
    • /
    • v.23 no.3
    • /
    • pp.189-196
    • /
    • 2002
  • Transdermal drug delivery offers an alternative method to the conventional oral and injection delivery method. Its advantages include its ability to deliver drugs directly into systemic circulation. However, there have been restrictions in its application to deliver drugs because of the skin's barrier function. In this study, we try to combine a Sonophoresis and oxygen Pressure method in order to increase the Permeability of the skin. we used water as the compound and by utilizing the skin impedance method. we measured the hydration Permeability of skin Ultrasound was applied using a sonicator(Solcare-U1000. Solco, Korea) operating at a frequency of 1MHz. oxygen Pressure was applied using a compressor(Oxyjet-Pointer, Nora Bode. Germany) operating at a pressure of 2Bar/cm2. Experiment was performed in vivo for 42 People. We divided the subjects into four smaller groups. A different transdermal drug delivery method was applied for each group on the back of their hand. We measured the skin impedance variations on the hand. during a 20-minute time Period. The control group did not show any significant increase or variation of skin impedance to water. In comparison to the control group(Passive diffusion) the hydration Permeability of the ultrasound group and the oxygen Pressure group was approximately 25 and 30 times higher consecutively. Futhermore, the hydration permeability of the combination of ultrasound and oxygen Pressure group was about 70-fold higher in comparison to the control group(passive diffusion) . The results reveal that a combination of ultrasound and oxygen Pressure will significantly enhance transdermal water transport compared when only one of them is used.