• Title/Summary/Keyword: Parallel Search

Search Result 317, Processing Time 0.026 seconds

Effective Graph-Based Heuristics for Contingent Planning (조건부 계획수립을 위한 효과적인 그래프 기반의 휴리스틱)

  • Kim, Hyun-Sik;Kim, In-Cheol;Park, Young-Tack
    • The KIPS Transactions:PartB
    • /
    • v.18B no.1
    • /
    • pp.29-38
    • /
    • 2011
  • In order to derive domain-independent heuristics from the specification of a planning problem, it is required to relax the given problem and then solve the relaxed one. In this paper, we present a new planning graph, Merged Planning Graph(MPG), and GD heuristics for solving contingent planning problems with both uncertainty about the initial state and non-deterministic action effects. The merged planning graph is an extended one to be applied to the contingent planning problems from the relaxed planning graph, which is a common means to get effective heuristics for solving the classical planning problems. In order to get heuristics for solving the contingent planning problems with sensing actions and non-deterministic actions, the new graph utilizes additionally the effect-merge relaxations of these actions as well as the traditional delete relaxations. Proceeding parallel to the forward expansion of the merged planning graph, the computation of GD heuristic excludes the unnecessary redundant cost from estimating the minimal reachability cost to achieve the overall set of goals by analyzing interdependencies among goals or subgoals. Therefore, GD heuristics have the advantage that they usually require less computation time than the overlap heuristics, but are more informative than the max and the additive heuristics. In this paper, we explain the experimental analysis to show the accuracy and the search efficiency of the GD heuristics.

An efficient acceleration algorithm of GPU ray tracing using CUDA (CUDA를 이용한 효과적인 GPU 광선추적 가속 알고리즘)

  • Ji, Joong-Hyun;Yun, Dong-Ho;Ko, Kwang-Hee
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.469-474
    • /
    • 2009
  • This paper proposes an real time ray tracing system using optimized kd-tree traversal environment and ray/triangle intersection algorithm. The previous kd-tree traversal algorithms search for the upper nodes in a bottom-up manner. In a such way we need to revisit the already visited parent node or use redundant memory after failing to find the intersected primitives in the leaf node. Thus ray tracing for relatively complex scenes become more difficult. The new algorithm contains stacks implemented on GPU's local memory on CUDA framework, thus elegantly eliminate the problems of previous algorithms. After traversing the node we perform the latest CPU-based ray/triangle intersection algorithm 'Plucker coordinate test', which is further accelerated in massively parallel thanks to CUDA. Plucker test can drastically reduce the computational costs since it does not use barycentric coordinates but only simple test using the relations between a ray and the triangle edges. The entire system is consist of a single ray kernel simply and implemented without introduction of complicated synchronization or ray packets. Consequently our experiment shows the new algorithm can is roughly twice as faster as the previous.

  • PDF

Molecular and biochemical characterization of a novel actin bundling protein in Acanthamoeba

  • Alafag Joanna It-itan;Moon Eun-Kyung;Hong Yeon-Chul;Chung Dong-Il;Kong Hyun-Hee
    • Parasites, Hosts and Diseases
    • /
    • v.44 no.4 s.140
    • /
    • pp.331-341
    • /
    • 2006
  • Actin binding proteins play key roles in cell structure and movement particularly as regulators of the assembly, stability and localization of actin filaments in the cytoplasm. In the present study, a cDNA clone encoding an actin bundling protein named as AhABP was isolated from Acanthamoeba healyi, a causative agent of granulomatous amebic encephalitis. This clone exhibited high similarity with genes of Physarum polycephalum and Dictyostelium discoideum, which encode actin bundling proteins. Domain search analysis revealed the presence of essential conserved regions, i.e., an active actin binding site and 2 putative calcium binding EF-hands. Transfected amoeba cells demonstrated that AhABP is primarily localized in phagocytic cups, peripheral edges, pseudopods, and in cortical cytoplasm where actins are most abundant. Moreover, AhABP after the deletion of essential regions formed ellipsoidal inclusions within transfected cells. High-speed co-sedimentation assays revealed that AhABP directly interacted with actin in the presence of up to $10{\mu}M$ of calcium. Under the electron microscope, thick parallel bundles were formed by full length AhABP, in contrast to the thin actin bundles formed by constructs with deletion sites. In the light of these results, we conclude that AhABP is a novel actin bundling protein that is importantly associated with actin filaments in the cytoplasm.

Dynamic Load Balancing Scheme Based on Resource Reservation for Migration of Agents in Pure P2P Network Environments (순수 P2P 네트워크 환경에서 에이전트 이주를 위한 자원 예약 기반 동적 부하 균형 기법)

  • Kim, Kyung-In;Kim, Young-jin;Eom, Young-Ik
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.257-266
    • /
    • 2004
  • Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

Automatic Optimization Methods for Image Processing Programs Using OpenCL (OpenCL을 이용한 이미지 처리 프로그램의 자동 최적화 방법)

  • Shin, Jaeho;Jo, Gangwon;Lee, Ilkoo;Lee, Jaejin
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.3
    • /
    • pp.188-193
    • /
    • 2017
  • In this paper, we propose automatic OpenCL optimization techniques that offer the best performance for image processing programs on any hardware system. Developers should seek a proper way of parallelization and an appropriate work-group size for the architecture of target compute devices to achieve the best performance. However, testing potential devices to find them is both time-consuming and costly. Our techniques automatically set up hardware-optimized parallelization and find a suitable work-group size for the target device. Furthermore, using OpenCL does not always provide better performance in image processing. Hence, we also propose a way to automatically search for a threshold image size to allow image processing programs to decide whether or not to use OpenCL. Our findings demonstrate that out techniques improve the image processing performance significantly.

A Dynamic Inferential Framework for Learning Geometry Problem Solving (기하 문제 학습을 위한 동적 추론 체계)

  • Kook, Hyung-Joon
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.412-421
    • /
    • 2000
  • In spite that the main contents of mathematical and scientific learning are understanding principles and their applications, most of existing educational softwares are based on rote learning, thus resulting in limited educational effects. In the artificial intelligence research, some progress has been made in developing automatic tutors based on proving and simulation, by adapting the techniques of knowledge representation, search and inference to the design of tutors. However, these tutors still fall short of being practical and the turor, even a prototype model, for learning problem solving is yet to come out. The geometry problem-solving tutor proposed by this research involves dynamic inference performed in parallel with learning. As an ontology for composing the problem space within a real-time setting, we have employed the notions of propositions, hypotheses and operators. Then we investigated the mechanism of interactive learning of problem solving in which the main target of inference involves the generation and the test of these components. Major accomplishment from this research is a practical model of a problem tutor embedded with a series of inference techniques for algebraic manipulation, which is indispensable in geometry problem solving but overlooked by previous research. The proposed model is expected to be applicable to the design of problem tutors in other scientific areas such as physics and electric circuitry.

  • PDF

Dietary effect of red ginseng extracts mixed with torilis fructus and corni fructus on the epidermal levels of ceramides and ceramide related enzyme proteins in uv-induced hairless mice (자외선이 조사된 무모생쥐에서 홍삼, 사상자, 산수유 혼합 추출물 섭취가 표피 세라마이드 함량 및 관련 효소의 발현에 미치는 영향)

  • Lee, Yun-Ju;Oh, Inn-Gyung;Cho, Yun-Hi
    • Journal of Nutrition and Health
    • /
    • v.45 no.3
    • /
    • pp.211-217
    • /
    • 2012
  • UV-irradiation is a major factor of photo-aged skin, by which pigmentation, wrinkles and laxity are increased. In addition, the epidermal barrier is disrupted, ultimately causing dryness in photo-aged skin. As an effort to search dietary sources for improving the dryness of UV irradiated skin, the dietary effect of red ginseng based functional foods on the epidermal level of ceramides, a major lipid maintaining epidermal barrier, was determined in this study. Albino hairless mice were fed either a control diet [group UV (UV-irradiated control)] or diets with 0.5% (group M0.5) or 1% (group M1.0) of red ginseng extracts mixed with Torilis fructus and Corni fructus (66.7% red ginseng) in parallel with UV irradiation for 5 wks. A normal control group (group C) was fed a control diet without UV irradiation for 5 wks. The epidermal level of ceramides in group UV was significantly lower than that in group C, in which ceramidase, an enzyme involved in ceramide degradation, was highly expressed. In group M0.5, the epidermal level of ceramide was significantly increased to the level even higher than in group C. In addition, protein expression of serine palmitoyl transferase (SPT), a key enzyme involved in de novo ceramide synthesis, was increased in group M0.5. However the epidermal levels of ceramides as well as of ceramidase protein expression in group M1.0 did not differ from those in group UV. In conclusion, we demonstrate that dietary supplementation of red-ginseng extracts mixed with Torilis fructus and Corni fructus at a level of 0.5% level in diet increased the epidermal level of ceramides coupled with the elevated expression of SPT protein.

Interoperability between NoSQL and RDBMS via Auto-mapping Scheme in Distributed Parallel Processing Environment (분산병렬처리 환경에서 오토매핑 기법을 통한 NoSQL과 RDBMS와의 연동)

  • Kim, Hee Sung;Lee, Bong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.11
    • /
    • pp.2067-2075
    • /
    • 2017
  • Lately big data processing is considered as an emerging issue. As a huge amount of data is generated, data processing capability is getting important. In processing big data, both Hadoop distributed file system and unstructured date processing-based NoSQL data store are getting a lot of attention. However, there still exists problems and inconvenience to use NoSQL. In case of low volume data, MapReduce of NoSQL normally consumes unnecessary processing time and requires relatively much more data retrieval time than RDBMS. In order to address the NoSQL problem, in this paper, an interworking scheme between NoSQL and the conventional RDBMS is proposed. The developed auto-mapping scheme enables to choose an appropriate database (NoSQL or RDBMS) depending on the amount of data, which results in fast search time. The experimental results for a specific data set shows that the database interworking scheme reduces data searching time by 35% at the maximum.

Implementation of a G,723.1 Annex A Using a High Performance DSP (고성능 DSP를 이용한 G.723.1 Annex A 구현)

  • 최용수;강태익
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.7
    • /
    • pp.648-655
    • /
    • 2002
  • This paper describes implementation of a multi-channel G.723.1 Annex A (G.723.1A) focused on code optimization using a high performance general purpose Digital Signal Processor (DSP), To implement a multi-channel G.723.1A functional complexities of the ITU-T G.723.1A fixed-point C-code are measures an analyzed. Then we sort and optimize C functions in complexity order. In parallel with optimization, we verify the bit-exactness of the optimized code using the ITU-T test vectors. Using only internal memory, the optimized code can perform full-duplex 17 channel processing. In addition, we further increase the number of available channels per DSP into 22 using fast codebook search algorithms, referred to as bit -compatible optimization.

A Study on the Hierachical Coding of the Angiography by Using the Scalable Structure in the MPACS System (MPACS 시스템에서 Scalable 구조를 이용한 심장 조영상의 계층적 부호화에 관한 연구)

  • Han, Young-Oh;Jung, Jae-Woo;Ahn, Jin-Ho;Park, Jong-Kwan;Shin, Joon-In;Park, Sang-Hui
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1995 no.05
    • /
    • pp.235-238
    • /
    • 1995
  • In this paper, we propose an effective coding method of the angiography by using the scalable structure in the frequency domain for MPACS(Medical Picture Archiving and Communication System). We employed the subband decomposition method and MPEG-2 system which is the international standard coding method of the general moving picture. After the subband decomposition is applied to split an input image into 4 bands in the spatial frequency domain, the motion compensated DPCM coding method of MPEG-2 is carried out for each subband. As a result, an easily controllable coding Structure is accomplished by composing the compound hit stream for each subband group. Follows are the simulation results of the proposed sheme for the angiography. A scalable structure which can be easily controlled for a loss of transmission or the band limit can be accomplisbed in the MPEG-2 stucture by the subband decomposition minimizing the side information. And by reducing the search area of the motion vector between -4 and 3, the processing speed of a codec is enhanced by more than two times without a loss of the picture quality compare with the conventional DCT coefficients decompositon method. And the processing speed is considerably improved in the case of the parallel construction of each subband in the hardware.

  • PDF