• Title/Summary/Keyword: T-search

Search Result 946, Processing Time 0.031 seconds

Integration of T-Search and Dynamic-Window Concept for Accelerated Searching Speed in Delaunay Triangulation (Delaunay Triangulation의 폴리건 검색속도 개선을 위한 T-Search와 Dynamic-Window 개념의 결합)

  • Kang, Hyun-Joo;Yoon, Sug-Joon;Kong, Ji-Young;Kim, Kang-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.5
    • /
    • pp.681-687
    • /
    • 2003
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

The Effect of Career Search Programs on Career Search Efficacy, Career Search Behavior and Career Decision Making in Nursing Students (진로탐색 프로그램이 간호대학생의 진로탐색효능감과 진로탐색행동 및 진로결정수준에 미치는 효과)

  • Moon, Inn Oh;Kim, Hee Sun
    • The Journal of Korean Academic Society of Nursing Education
    • /
    • v.18 no.3
    • /
    • pp.393-402
    • /
    • 2012
  • Purpose: This study was conducted to test the effect of a Career Search Program on career search efficacy, career search behavior, and career decision making for nursing students. Methods: A non-equivalent pre-post test of a quasi-experimental design was used. Fifty first grade nursing students participated in the study with 22 in the experimental group and 28 in the control group. We used a Career Search Program which was held 6 times over 6 weeks, 90 minutes per session. Descriptive statistics, ${\chi}^2$-test, and independent t-test were used for statistical analysis with SPSS 19.0. Results: There were significant increases in career search efficacy (t=2.07, p=.044) and career search behavior(t=2.65, p=.011) in the experimental group compared to the control group. However, career decision making was not significantly changed (t=0.96, p=.342). Conclusion: These results suggest that a Career grade Search Program has an effect on increasing career search efficacy and career search behavior in first grade nursing students. In addition, more programs to impact career decision making should be developed for nursing college students.

A Study on the Security Threats of IoT Devices Exposed in Search Engine (검색엔진에 노출된 IoT 장치의 보안 위협에 대한 연구)

  • Han, Kyong-Ho;Lee, Seong-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.1
    • /
    • pp.128-134
    • /
    • 2016
  • IoT devices including smart devices are connected with internet, thus they have security threats everytime. Particularly, IoT devices are composed of low performance MCU and small-capacity memory because they are miniaturized, so they are likely to be exposed to various security threats like DoS attacks. In addition, in case of IoT devices installed for a remote place, it's not easy for users to control continuously them and to install immediately security patch for them. For most of IoT devices connected directly with internet under user's intention, devices exposed to outside by setting IoT gateway, and devices exposed to outside by the DMZ function or Port Forwarding function of router, specific protocol for IoT services was used and the devices show a response when services about related protocol are required from outside. From internet search engine for IoT devices, IP addresses are inspected on the basis of protocol mainly used for IoT devices and then IP addresses showing a response are maintained as database, so that users can utilize related information. Specially, IoT devices using HTTP and HTTPS protocol, which are used at usual web server, are easily searched at usual search engines like Google as well as search engine for the sole IoT devices. Ill-intentioned attackers get the IP addresses of vulnerable devices from search engine and try to attack the devices. The purpose of this study is to find the problems arisen when HTTP, HTTPS, CoAP, SOAP, and RestFUL protocols used for IoT devices are detected by search engine and are maintained as database, and to seek the solution for the problems. In particular, when the user ID and password of IoT devices set by manufacturing factory are still same or the already known vulnerabilities of IoT devices are not patched, the dangerousness of the IoT devices and its related solution were found in this study.

대학 졸업예정자들의 직업탐색활동의 변화와 개인적 특성의 영향에 관한 연구

  • An, Gwan-Yeong
    • 한국산학경영학회:학술대회논문집
    • /
    • 2005.11a
    • /
    • pp.1-9
    • /
    • 2005
  • Job search research has been criticized for failing to study the dynamics and change of the job search process. A lot of previous researches have used cross-sectional designs and treated job search as a static process. As a result, job search research has failed to examine how job seekers' behaviors change during the course of their search. This paper examined changes In job search behaviors(preparatory and active job search behavior, and job search intensity) and the effects of individual difference variables(self-esteem, self-efficacy, extroversion, agreeableness, conscientiousness, openness) on job search behaviors. Data were gathered from 404 university students who had not found employment at the time of beginning of second semester The results of t-test pairs indicated that job seeking students increased their preparatory job search behavior and active job search behavior, but didn't job search intensity. The results of multiple regression showed that self-efficacy had strong relationship with preparatory and active job search behavior, and job search intensity, but self-esteem had not any relationship with them. Among big-5 personality, extroversion had relationship with active job search behavior and job search intensity, and agreeableness only with job search intensity.

  • PDF

A Study on Terrain Surface Modeling and Polygon-Searching Algorithms (지표면 모델링 및 폴리건 검색기법에 관한 연구)

  • 공지영;강현주;윤석준
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2002.11a
    • /
    • pp.163-170
    • /
    • 2002
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

  • PDF

Building and Analysis of Semantic Network on S&T Multilingual Terminology (과학기술 전문용어의 다국어 의미망 생성과 분석)

  • Jeong, Do-Heon;Choi, Hee-Yoon
    • Journal of Information Management
    • /
    • v.37 no.4
    • /
    • pp.25-47
    • /
    • 2006
  • A terminology system capable of providing interpretations and classification information on a multilingual science and technology(S&T) terminology is essential to establish an integrated search environment for multilingual S&T information systems. This paper aims to build a base system to manage an integrated information system for multilingual S&T terminology search. It introduces a method to build a search system for S&T terminologies internally linked through the multilingual semantic network and a search technique on the multiple linked nodes. In order to provide a foundation for further analysis researches, it also attempts to suggest a basic approach to interpret terminology clusters generated with those two search methods.

Full Predictive Motion Vector-Cross Diamond Search Algorithm(FPMV-CDS) (예측 움직임 벡터를 이용한 Cross-diamond 탐색 알고리즘)

  • Kwon, Jung-Eun;Choi, Lyn
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.153-157
    • /
    • 2006
  • 기존의 탐색 알고리즘은 탐색 창 내의 원점에서 탐색을 시작한다. 하지만 영상은 일정한 방향으로 규칙적으로 움직이는 것이 많기 때문에 Frame$_t$ 의 움직임 벡터(MV)가 Frame$_{t-1}$의 움직임 벡터와 같을 가능성이 크다. 이를 참고하여 본 논문에서는 시작점을 원점뿐만 아니라 Frame$_{t-1}$의 MV까지도 예측 시작점으로 선택하여 탐색의 시작점을 다양화 하였다. 실험 결과 탐색 시작점을 다양화 함으로써 full search를 제외한 diamond search, hexagonal search, 4 step search등 기존의 탐색 알고리즘보다 30$\sim$80% 더 작은 SAD값을 구할 수 있었다.

  • PDF

A New merging Algorithm for Constructing suffix Trees for Integer Alphabets (정수 문자집합상의 접미사트리 구축을 위한 새로운 합병 알고리즘)

  • Kim, Dong-Kyu;Sim, Jeong-Seop;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.87-93
    • /
    • 2002
  • A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

EEIRI: Efficient Encrypted Image Retrieval in IoT-Cloud

  • Abduljabbar, Zaid Ameen;Ibrahim, Ayad;Hussain, Mohammed Abdulridha;Hussien, Zaid Alaa;Al Sibahee, Mustafa A.;Lu, Songfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5692-5716
    • /
    • 2019
  • One of the best means to safeguard the confidentiality, security, and privacy of an image within the IoT-Cloud is through encryption. However, looking through encrypted data is a difficult process. Several techniques for searching encrypted data have been devised, but certain security solutions may not be used in IoT-Cloud because such solutions are not lightweight. We propose a lightweight scheme that can perform a content-based search of encrypted images, namely EEIRI. In this scheme, the images are represented using local features. We develop and validate a secure scheme for measuring the Euclidean distance between two descriptor sets. To improve the search efficiency, we employ the k-means clustering technique to construct a searchable tree-based index. Our index construction process ensures the privacy of the stored data and search requests. When compared with more familiar techniques of searching images over plaintexts, EEIRI is considered to be more efficient, demonstrating a higher search cost of 7% and a decrease in search accuracy of 1.7%. Numerous empirical investigations are carried out in relation to real image collections so as to evidence our work.

Construction of Differential Type Search Coil Magnetometer (차동형 탐지코일 마그네토미터 제작)

  • Kim, J.H.;Son, De-Rac
    • Journal of the Korean Magnetics Society
    • /
    • v.20 no.5
    • /
    • pp.178-181
    • /
    • 2010
  • Search coil magnetometer has been used for detection of ac magnetic field with high sensitivity. To reduce demagnetizing factor of core and increase S/N ratio of search coil magnetometer, the core was divided by two parts and coil was wound on each cores. Two coils were connected serially and put into amplifier as differential mode. Constructed 120 mm length search coil magnetometer shows linearity of 0.03%, sensitivity of 9.3 mV/nT, and resolution of 20 pT at 1 Hz.