• 제목/요약/키워드: Mathematical Computing

검색결과 342건 처리시간 0.026초

EDISON Platform to Supporting Education and Integration Research in Computational Science (계산과학 시뮬레이션을 위한 웹 인터페이스 자동 생성 시스템 개발)

  • Jin, Du-Seok;Lee, Jong-Suk Ruth;Cho, Kum-Won;Jeong, Jae-You;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국해양정보통신학회 2011년도 추계학술대회
    • /
    • pp.799-801
    • /
    • 2011
  • Computational science is a field of study concerned with constructing mathematical models and quantitative analysis techniques and using large computing resources to solve the problems which are difficult to approach in a physical experimentally. Recently, a new web-based simulation environment for computational science is becoming more and more popular for supporting multi-user access without restriction of space or time, however, to develop web-based simulation applications, the researchers performed their works too much difficulty. In this paper, we present automated web interface generation tool that allows applied researchers to concentrate on advanced research in their scientific disciplines such as Chemistry, Physics, Structural Dynamics.

  • PDF

Throughput and Delay Analysis of a Reliable Cooperative MAC Protocol in Ad Hoc Networks

  • Jang, Jaeshin;Kim, Sang Wu;Wie, Sunghong
    • Journal of Communications and Networks
    • /
    • 제14권5호
    • /
    • pp.524-532
    • /
    • 2012
  • In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

Task Sequence Optimization for 6-DOF Manipulator in Press Forming Process (프레스 공정에서 6자유도 로봇의 작업 시퀀스 최적화)

  • Yoon, Hyun Joong;Chung, Seong Youb
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • 제18권2호
    • /
    • pp.704-710
    • /
    • 2017
  • Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).

A Stochastic Work-Handover Relationship Model in Workflow-supported Social Networks (워크플로우 기반 소셜 네트워크의 확률적 업무전달 관계 모델)

  • Ahn, Hyun;Kim, Kwanghoon
    • Journal of Internet Computing and Services
    • /
    • 제16권5호
    • /
    • pp.59-66
    • /
    • 2015
  • A stochastic modeling approach as a mathematical method for workflow intelligence is widely used for analyzing and simulating workflow models in the literature. In particular, as a resource-centric modeling approach, this paper proposes a stochastic model to represent work-handover relationships between performers in a workflow-supported social network. Calculating probabilities for the work-handover relationships are determined by two types of probabilities. One is the work-transition probability between activities, and the other is the task assignment probability between activities and performers. In this paper, we describe formal definitions of stochastic workflow models and stochastic work-handover relationship models, as well. Then, we propose an algorithm for extracting a stochastic work-handover relationship model from a stochastic workflow model. As a consequence, the proposed model ought to be useful in performing resource-centric workflow simulations and model-log comparison analyses.

Hazelcast Vs. Ignite: Opportunities for Java Programmers

  • Maxim, Bartkov;Tetiana, Katkova;S., Kruglyk Vladyslav;G., Murtaziev Ernest;V., Kotova Olha
    • International Journal of Computer Science & Network Security
    • /
    • 제22권2호
    • /
    • pp.406-412
    • /
    • 2022
  • Storing large amounts of data has always been a big problem from the beginning of computing history. Big Data has made huge advancements in improving business processes by finding the customers' needs using prediction models based on web and social media search. The main purpose of big data stream processing frameworks is to allow programmers to directly query the continuous stream without dealing with the lower-level mechanisms. In other words, programmers write the code to process streams using these runtime libraries (also called Stream Processing Engines). This is achieved by taking large volumes of data and analyzing them using Big Data frameworks. Streaming platforms are an emerging technology that deals with continuous streams of data. There are several streaming platforms of Big Data freely available on the Internet. However, selecting the most appropriate one is not easy for programmers. In this paper, we present a detailed description of two of the state-of-the-art and most popular streaming frameworks: Apache Ignite and Hazelcast. In addition, the performance of these frameworks is compared using selected attributes. Different types of databases are used in common to store the data. To process the data in real-time continuously, data streaming technologies are developed. With the development of today's large-scale distributed applications handling tons of data, these databases are not viable. Consequently, Big Data is introduced to store, process, and analyze data at a fast speed and also to deal with big users and data growth day by day.

A High Speed Optimized Implementation of Lightweight Cryptography TinyJAMBU on Internet of Things Processor 8-Bit AVR (사물 인터넷 프로세서 8-bit AVR 상에서의 경량암호 TinyJAMBU 고속 최적 구현)

  • Hyeok-Dong Kwon;Si-Woo Eum;Min-Joo Sim;Yu-Jin Yang;Hwa-Jeong Seo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제33권2호
    • /
    • pp.183-191
    • /
    • 2023
  • Cryptographic algorithms require extensive computational resources and rely on complex mathematical principles for security. However, IoT devices have limited resources, leading to insufficient computing power. As a result, lightweight cryptography has emerged, which uses fewer computational resources. NIST organized a competition to standardize lightweight cryptography and TinyJAMBU, one of the algorithms in the competition, is a permutation-based algorithm that repeats many permutation operations. In this paper, we implement TinyJAMBU on an 8-bit AVR processor with a proposedtechnique that includes a reverse shift method and precomputing some operations in a fixed key and nonce environment. Our techniques showed a maximum performance improvement of 7.03 times in permutation operations and 5.87 times in the TinyJAMBU algorithm, improving up to 9.19 times in a fixed key and nonce environment.

New Tool to Simulate Microbial Contamination of on-Farm Produce: Agent-Based Modeling and Simulation (재배단계 농산물의 안전성 모의실험을 위한 개체기반 프로그램 개발)

  • Han, Sanghyun;Lee, Ki-Hoon;Yang, Seong-Gyu;Kim, Hwang-Yong;Kim, Hyun-Ju;Ryu, Jae-Gee
    • Journal of Food Hygiene and Safety
    • /
    • 제32권1호
    • /
    • pp.8-13
    • /
    • 2017
  • This study was conducted to develop an agent-based computing platform enabling simulation of on-farm produce contamination by enteric foodborne pathogens, which is herein called PPMCS (Preharvest Produce Microbial Contamination Simulator). Also, fecal contamination of preharvest produce was simulated using PPMCS. Although Agent-based Modeling and Simulation, the tool applied in this study, is rather popular in where socio-economical human behaviors or ecological fate of animals in their niche are to be predicted, the incidence of on-farm produce contamination which are thought to be sporadic has never been simulated using this tool. The agents in PPMCS including crop, animal as a source of fecal contamination, and fly as a vector spreading the fecal contamination are given their intrinsic behaviors that are set to be executed at certain probability. Once all these agents are on-set following the intrinsic behavioral rules, consequences as the sum of all the behaviors in the system can be monitored real-time. When fecal contamination of preharvest produce was simulated in PPMCS as numbers of animals, flies, and initially contaminated plants change, the number of animals intruding cropping area affected most on the number of contaminated plants at harvest. For further application, the behaviors and variables of the agents are adjustable depending on user's own scenario of interest. This feature allows PPMCS to be utilized in where different simulating conditions are tested.

Some Mental Activity Which Can be Discriminated Only on Non-linear Analysis of EEG Measure (비선형 분석을 이용한 정신활동 상태에 따른 EEG의 변화에 관한 연구)

  • Lee, J.M.;Park, C.J.;Lee, Y.R.;Shin, I.S.;Park, K.S.
    • Journal of Biomedical Engineering Research
    • /
    • 제22권5호
    • /
    • pp.425-430
    • /
    • 2001
  • The Purpose of this study was to find the way of discriminating EEG for some mental activity. which are not characterized within linear spectral analysis but with non-linear analysis . We lave investigated the way of characterizing EEG changes during emotional and cognitive states in healthy volunteered subjects who responded to three designed status. in which the subjects were relaxing with ease and eyes closed. listening to music and computing a simple subtraction with eyes closed. Especially, we estimated EEG dimensional complexity by Skinner s Point-wise correlation dimension(PD2) method for each mental states. As a result it has been found that the subjects, who responded that the\ulcorner had concentrated well during the arithmetic task. show higher PD2 in their non-linear EEG measures. in comparison with the subjects who responded that they had not concentrated during the task This highness of PD2 is also significant in statistical analysis. A subject who had the highest score in evaluating the intensity of induced emotion during emotional task shows significantly lower PD2 in statistical analysis than other subjects who had lower scores. Linear spectral analysis was also performed on these data. However, they did not show and significant difference. Only non-linear dynamical analysis shows the significant different result on these mental status.

  • PDF

A Hybrid Mapping Technique for Logical Volume Manager in SAN Environments (SAN 논리볼륨 관리자를 위한 혼합 매핑 기법)

  • 남상수;피준일;송석일;유재수;최영희;이병엽
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제10권1호
    • /
    • pp.99-113
    • /
    • 2004
  • A new architecture called SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most of SAN operating softwares support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually h logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. A logical volume manager also supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add/remove storage devices to/from SAN even while the system is running. To support the snapshot and the on-line reorganization, most logical volume managers have used table based mapping methods. However, it is very difficult to manage mapping table because the mapping table is large in proportion to a storage capacity. In this paper, we design and implement an efficient and flexible hybrid mapping method based on mathematical equations. The mapping method in this paper supports a snapshot and on-line reorganization. The proposed snapshot and on-line reorganization are performed on the reserved area which is separated from data area of a volume. Due to this strategy normal I/O operations are not affected by snapshot and reorganization. Finally, we show the superiority of our proposed mapping method through various experiments.

A Mobile P2P Message Platform Enabling the Energy-Efficient Handover between Heterogeneous Networks (이종 네트워크 간 에너지 효율적인 핸드오버를 지원하는 모바일 P2P 메시지 플랫폼)

  • Kim, Tae-Yong;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제15권10호
    • /
    • pp.724-739
    • /
    • 2009
  • This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.