• Title/Summary/Keyword: grid-search

Search Result 274, Processing Time 0.031 seconds

Using Potential Field for Modeling of the Work-environment and Task-sharing on the Multi-agent Cooperative Work

  • Makino, Tsutomu;Naruse, Keitarou;Yokoi, Hiroshi;Kakazu, Yikinori
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.37-44
    • /
    • 2001
  • This paper describes the modeling of work environment for the extraction of abstract operation rules for cooperative work with multiple agent. We propose the modeling method using a potential field. In the method, it is applied to a box pushing problem, which is to move a box from a start to a goal b multiple agent. The agents follow the potential value when they move and work in the work environment. The work environment is represented as the grid space. The potential field is generated by Genetic Algorithm(GA) for each agent. GA explores the positions of a potential peak value in the grid space, and then the potential value stretching in the grid space is spread by a potential diffusion function in each grid. However it is difficult to explore suitable setting using hand coding of the position of peak potential value. Thus, we use an evlolutionary computation way because it is possible to explore the large search space. So we make experiments the environment modeling using the proposed method and verify the performance of the exploration by GA. And we classify some types from acquired the environment model and extract the abstract operation rule, As results, we find out some types of the environment models and operation rules by the observation, and the performance of GA exploration is almost same as the hand coding set because these are nearly same performance on the evaluation of the consumption of agent's energy and the work step from point to the goal point.

  • PDF

An Unified Spatial Index and Visualization Method for the Trajectory and Grid Queries in Internet of Things

  • Han, Jinju;Na, Chul-Won;Lee, Dahee;Lee, Do-Hoon;On, Byung-Won;Lee, Ryong;Park, Min-Woo;Lee, Sang-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.9
    • /
    • pp.83-95
    • /
    • 2019
  • Recently, a variety of IoT data is collected by attaching geosensors to many vehicles that are on the road. IoT data basically has time and space information and is composed of various data such as temperature, humidity, fine dust, Co2, etc. Although a certain sensor data can be retrieved using time, latitude and longitude, which are keys to the IoT data, advanced search engines for IoT data to handle high-level user queries are still limited. There is also a problem with searching large amounts of IoT data without generating indexes, which wastes a great deal of time through sequential scans. In this paper, we propose a unified spatial index model that handles both grid and trajectory queries using a cell-based space-filling curve method. also it presents a visualization method that helps user grasp intuitively. The Trajectory query is to aggregate the traffic of the trajectory cells passed by taxi on the road searched by the user. The grid query is to find the cells on the road searched by the user and to aggregate the fine dust. Based on the generated spatial index, the user interface quickly summarizes the trajectory and grid queries for specific road and all roads, and proposes a Web-based prototype system that can be analyzed intuitively through road and heat map visualization.

Study on the Optimization of Pulse GTAW Process for Diaphragm with Thin Thickness (극박 다이아프램의 펄스 GTAW 공정 최적화에 관한 연구)

  • Park, Hyoung-Jin;Hwang, In-Sung;Kang, Mun-Jin;Rhee, Se-Hun
    • Journal of Welding and Joining
    • /
    • v.26 no.1
    • /
    • pp.63-68
    • /
    • 2008
  • This paper has aimed to prevent excessive heat input by controlling arc distribution and heat input capacity with pulse GTAW in order to improve weld quality in 0.08mm pressure gauge diaphragm and flange welding parts. A design of experiment was designed using Box-Behnken method to optimize a welding process. The pulse GTAW parameters such as pulse current, base current, pulse duty, frequency and welding speed were set to input variables while hydraulic pressure that represents welding characteristics in diaphragm and flange joint were set to output variables. Based on the test result, a second regression equation was obtained between input and output variables and turned out significant. Besides, an influence of parameters has been confirmed through response surface analysis using the second-order regression equation and optimum welding condition was obtained through a grid-search method. The optimum welding condition was set to pulse current 84.4(A), base current 29.6(A), pulse duty 58.8(%), frequency 10(%), and welding speed 596(mm/min). Then, decent bead shape was acquired with no excessive heat input under the $2.3kgf/cm^2$ of hydrostatic pressure.

A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks (무선 애드혹 네트워크를 위한 위치정보 기반 기울기 라우팅 알고리즘)

  • Bang, Min-Young;Lee, Bong-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.259-270
    • /
    • 2010
  • In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

Double-layered Peer-to-Peer Systems in MobileAd-hoc Networks (모바일애드혹 네트워크에서의 2계층 피어-투-피어 시스템)

  • Kim, Ji-Hoon;Yang, Sung-Bong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.61-68
    • /
    • 2010
  • As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

Vulnerability Assessment for Fine Particulate Matter (PM2.5) in the Schools of the Seoul Metropolitan Area, Korea: Part II - Vulnerability Assessment for PM2.5 in the Schools (인공지능을 이용한 수도권 학교 미세먼지 취약성 평가: Part II - 학교 미세먼지 범주화)

  • Son, Sanghun;Kim, Jinsoo
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.6_2
    • /
    • pp.1891-1900
    • /
    • 2021
  • Fine particulate matter (FPM; diameter ≤ 2.5 ㎛) is frequently found in metropolitan areas due to activities associated with rapid urbanization and population growth. Many adolescents spend a substantial amount of time at school where, for various reasons, FPM generated outdoors may flow into indoor areas. The aims of this study were to estimate FPM concentrations and categorize types of FPM in schools. Meteorological and chemical variables as well as satellite-based aerosol optical depth were analyzed as input data in a random forest model, which applied 10-fold cross validation and a grid-search method, to estimate school FPM concentrations, with four statistical indicators used to evaluate accuracy. Loose and strict standards were established to categorize types of FPM in schools. Under the former classification scheme, FPM in most schools was classified as type 2 or 3, whereas under strict standards, school FPM was mostly classified as type 3 or 4.

An Ensemble Approach to Detect Fake News Spreaders on Twitter

  • Sarwar, Muhammad Nabeel;UlAmin, Riaz;Jabeen, Sidra
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.5
    • /
    • pp.294-302
    • /
    • 2022
  • Detection of fake news is a complex and a challenging task. Generation of fake news is very hard to stop, only steps to control its circulation may help in minimizing its impacts. Humans tend to believe in misleading false information. Researcher started with social media sites to categorize in terms of real or fake news. False information misleads any individual or an organization that may cause of big failure and any financial loss. Automatic system for detection of false information circulating on social media is an emerging area of research. It is gaining attention of both industry and academia since US presidential elections 2016. Fake news has negative and severe effects on individuals and organizations elongating its hostile effects on the society. Prediction of fake news in timely manner is important. This research focuses on detection of fake news spreaders. In this context, overall, 6 models are developed during this research, trained and tested with dataset of PAN 2020. Four approaches N-gram based; user statistics-based models are trained with different values of hyper parameters. Extensive grid search with cross validation is applied in each machine learning model. In N-gram based models, out of numerous machine learning models this research focused on better results yielding algorithms, assessed by deep reading of state-of-the-art related work in the field. For better accuracy, author aimed at developing models using Random Forest, Logistic Regression, SVM, and XGBoost. All four machine learning algorithms were trained with cross validated grid search hyper parameters. Advantages of this research over previous work is user statistics-based model and then ensemble learning model. Which were designed in a way to help classifying Twitter users as fake news spreader or not with highest reliability. User statistical model used 17 features, on the basis of which it categorized a Twitter user as malicious. New dataset based on predictions of machine learning models was constructed. And then Three techniques of simple mean, logistic regression and random forest in combination with ensemble model is applied. Logistic regression combined in ensemble model gave best training and testing results, achieving an accuracy of 72%.

Development of sound location visualization intelligent control system for using PM hearing impaired users (청각 장애인 PM 이용자를 위한 소리 위치 시각화 지능형 제어 시스템 개발)

  • Yong-Hyeon Jo;Jin Young Choi
    • Convergence Security Journal
    • /
    • v.22 no.2
    • /
    • pp.105-114
    • /
    • 2022
  • This paper is presents an intelligent control system that visualizes the direction of arrival for hearing impaired using personal mobility, and aims to recognize and prevent dangerous situations caused by sound such as alarm sounds and crack sounds on roads. The position estimation method of sound source uses a machine learning classification model characterized by generalized correlated phase transformation based on time difference of arrival. In the experimental environment reproducing the road situations, four classification models learned after extracting learning data according to wind speeds 0km/h, 5.8km/h, 14.2km/h, and 26.4km/h were compared with grid search cross validation, and the Muti-Layer Perceptron(MLP) model with the best performance was applied as the optimal algorithm. When wind occurred, the proposed algorithm showed an average performance improvement of 7.6-11.5% compared to the previous studies.

An Optimal Path Search Method based on Traffic Information for Telematics Terminals (텔레매틱스 단말기를 위한 교통 정보를 활용한 최적 경로 탐색 기법)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2221-2229
    • /
    • 2006
  • Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.