• Title/Summary/Keyword: two-dimensional search

Search Result 187, Processing Time 0.02 seconds

Contribution of Carbon Dot Nanoparticles in Electrocatalysis: Development in Energy Conversion Process

  • Jana, Jayasmita;Ngo, Yen-Linh Thi;Chung, Jin Suk;Hur, Seung Hyun
    • Journal of Electrochemical Science and Technology
    • /
    • v.11 no.3
    • /
    • pp.220-237
    • /
    • 2020
  • Modern electrochemical energy devices involve generation and reduction of fuel gases through electrochemical reactions of water splitting, alcohol oxidation, oxygen reduction, etc. Initially, these processes were executed in the presence of noble metal-based catalyst that showed low overpotential and high current density. However, its high cost, unavailability, corrosion and related toxicity limited its application. The search for alternative with high stability, durability, and efficiency led scientists towards carbon nanoparticles supported catalysts which has high surface area, good electrical conductivity, tunable morphology, low cost, ease of synthesis and stability. Carbon nanoparticles are classified into two groups based on morphology, one and zero dimensional particles. Carbon nanoparticles at zero dimension, denoted as carbon dots, are less used carbon support compared to other forms. However, recently carbon dots with improved electronic properties have become popular as catalyst as well as catalyst support. This review focused on the recent advances in electrocatalytic activities of carbon dots. The mechanisms of common electrocatalytic reactions and the role of the catalysts are also discussed. The review also proposed future developments and other research directions to overcome current limitations.

COMPUTATIONAL ASSESSEMENT OF OPTIMAL FLOW RATE FOR STABLE FLOW IN A VERTICAL ROTATING DISk CHEMICAL VAPOR DEPOSITION REACTOR (회전식 화학증착 장치 내부의 유동해석을 통한 최적 유량 평가)

  • Kwak, H.S.
    • Journal of computational fluids engineering
    • /
    • v.17 no.1
    • /
    • pp.86-93
    • /
    • 2012
  • A numerical investigation is conducted to search for the optimal flow rate for a rotating-disk chemical vapor decomposition reactor operating at a high temperature and a low pressure. The flow of a gas mixture supplied into the reactor is modeled by a laminar flow of an ideal gas obeying the kinetic theory. The axisymmetric two-dimensional flow in the reactor is simulated by employing a CFD package FLUENT. With operating pressure and temperature fixed, numerical computations are performed by varying rotation rate and flow rate. Examination of the structures of flow and thermal fields leads to a flow regime diagram illustrating that there are a stable plug-like flow regime and a few unfavorable flow regimes induced by mass unbalance or buoyancy. The criterion for sustaining a plug-like flow regime is discussed based on a theoretical scaling argument. Interpretation of the flow regime map suggests that a favorable flow is attainable with a minimum flow rate at the smallest rotation rate guaranteeing the dominance of rotation effects over buoyancy.

결함검출을 위한 실험적 연구

  • 목종수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1996.03a
    • /
    • pp.24-29
    • /
    • 1996
  • The seniconductor, which is precision product, requires many inspection processes. The surface conditions of the semiconductor chip effect on the functions of the semiconductors. The defects of the chip surface is crack or void. Because general inspection method requires many inspection processes, the inspection system which searches immediately and preciselythe defects of the semiconductor chip surface. We propose the inspection method by using the computer vision system. This study presents an image processing algorithm for inspecting the surface defects(crack, void)of the semiconductor test samples. The proposed image processing algorithm aims to reduce inspection time, and to analyze those experienced operator. This paper regards the chip surface as random texture, and deals with the image modeling of randon texture image for searching the surface defects. For texture modeling, we consider the relation of a pixel and neighborhood pixels as noncasul model and extract the statistical characteristics from the radom texture field by using the 2D AR model(Aut oregressive). This paper regards on image as the output of linear system, and considers the fidelity or intelligibility criteria for measuring the quality of an image or the performance of the processing techinque. This study utilizes the variance of prediction error which is computed by substituting the gary level of pixel of another texture field into the two dimensional AR(autoregressive model)model fitted to the texture field, estimate the parameter us-ing the PAA(parameter adaptation algorithm) and design the defect detection filter. Later, we next try to study the defect detection search algorithm.

  • PDF

Mutual Information-based Circular Template Matching for Image Registration (영상등록을 위한 Mutual Information 기반의 원형 템플릿 정합)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.5
    • /
    • pp.547-557
    • /
    • 2014
  • This paper presents a method for designing circular template used in similarity measurement for image registration. Circular template has translation and rotation invariant property, which results in correct matching of control points for image registration under the condition of translation and rotation between reference and sensed images. Circular template consisting of the pixels located on the multiple circumferences of the circles whose radii vary from zero to a certain distance, is converted to two-dimensional Discrete Polar Coordinate Matrix (DPCM), whose elements are the pixels of the circular template. For sensed image, the same type of circular template and DPCM are created by rotating the circular template repeatedly by a certain degree in the range between 0 and 360 degrees and then similarity is calculated using mutual information of the two DPCMs. The best match is determined when the mutual information for each rotation angle at each pixel in search area is maximum. The proposed algorithm was tested using KOMPSAT-2 images acquired at two different times and the results indicate high accurate matching performance under image rotation.

Real-Time Tracking of Moving Object by Adaptive Search in Spatial-temporal Spaces (시공간 적응탐색에 의한 실시간 이동물체 추적)

  • Kim, Gye-Young;Choi, Hyung-Ill
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.63-77
    • /
    • 1994
  • This paper describes the real-time system which, through analyzing a sequence of images, can extract motional information on a moving object and can contol servo equipment to always locate the moving object at the center of an image frame. An image is a vast amount of two-dimensional signal, so it takes a lot of time to analyze the whole quantity of a given image. Especially, the time needed to load pixels from a memory to processor increase exponentially as the size of an image increases. To solve such a problem and track a moving object in real-time, this paper addresses how to selectively search the spatial and time domain. Based on the selective search of spatial and time domain, this paper suggests various types of techniques which are essential in implementing a real-time tracking system. That is, this paper describes how to detect an entrance of a moving object in the field of view of a camera and the direction of the entrance, how to determine the time interval of adjacent images, how to determine nonstationary areas formed by a moving object and calculated velocity and position information of a moving object based on the determined areas, how to control servo equipment to locate the moving object at the center of an image frame, and how to properly adjust time interval(${\Delta}$t) to track an object taking variable speed.

  • PDF

A Physical-layer Security Scheme Based on Cross-layer Cooperation in Dense Heterogeneous Networks

  • Zhang, Bo;Huang, Kai-zhi;Chen, Ya-jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2595-2618
    • /
    • 2018
  • In this paper, we investigate secure communication with the presence of multiple eavesdroppers (Eves) in a two-tier downlink dense heterogeneous network, wherein there is a macrocell base station (MBS) and multiple femtocell base stations (FBSs). Each base station (BS) has multiple users. And Eves attempt to wiretap a macrocell user (MU). To keep Eves ignorant of the confidential message, we propose a physical-layer security scheme based on cross-layer cooperation to exploit interference in the considered network. Under the constraints on the quality of service (QoS) of other legitimate users and transmit power, the secrecy rate of system can be maximized through jointly optimizing the beamforming vectors of MBS and cooperative FBSs. We explore the problem of maximizing secrecy rate in both non-colluding and colluding Eves scenarios, respectively. Firstly, in non-colluding Eves scenario, we approximate the original non-convex problem into a few semi-definite programs (SDPs) by employing the semi-definite relaxation (SDR) technique and conservative convex approximation under perfect channel state information (CSI) case. Furthermore, we extend the frame to imperfect CSI case and use the Lagrangian dual theory to cope with uncertain constraints on CSI. Secondly, in colluding Eves scenario, we transform the original problem into a two-tier optimization problem equivalently. Among them, the outer layer problem is a single variable optimization problem and can be solved by one-dimensional linear search. While the inner-layer optimization problem is transformed into a convex SDP problem with SDR technique and Charnes-Cooper transformation. In the perfect CSI case of both non-colluding and colluding Eves scenarios, we prove that the relaxation of SDR is tight and analyze the complexity of proposed algorithms. Finally, simulation results validate the effectiveness and robustness of proposed scheme.

Differential Protein Expression in EC304 Gastric Cancer Cells Induced by Alphastatin

  • Wang, Xin-Xin;Sun, Rong-Ju;Wu, Meng;Li, Tao;Zhang, Yong;Chen, Lin
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.4
    • /
    • pp.1667-1674
    • /
    • 2012
  • Objective: To explore the differential protein expression profile in EC304 gastric cancer cells induced by alphastatin. Methods: Cultured EC304 cells in the exponential phase of growth were randomly divided into alphastatin and control groups. Total proteins were extracted and the two dimensional electrophoresis (2-DE) technique was applied to analyze differences in expression with ImageMaster 2D Platinum 5.0 software. Proteins were identified using the MASCOT database and selected differently expressed proteins were characterised by western blotting and immunofluorescence. Results: $1350{\pm}90$ protein spots were detected by the ImageMaster software in the 2-DE gel images from the control and alphastatin groups. The match rate was about 72-80% for the spectrum profiles, with 29 significantly different protein spots being identified, 10 upregulated, 16 downregulated, two new and one lost. The MASCOT search scores were 64-666 and the peptide matching numbers were 3-27 with sequence coverage of 8-62%. Twenty-three proteins were checked by mass spectrometry, including decrease in Nm23 and profilin-2 isoform b associated with the regulation of actin multimerisation induced by extracellular signals. Conclusion: The proteome in EC304 cells is dramatically altered by alphastatin, which appears to play an important role in modulating cellular activity and anti-angiogenesis by regulating protein expression and signal transduction pathways through Nm23 and profilin-2 isoform b, providing new research directions for anti-angiogenic therapy of gastric cancer.

Determining the number of Clusters in On-Line Document Clustering Algorithm (온라인 문서 군집화에서 군집 수 결정 방법)

  • Jee, Tae-Chang;Lee, Hyun-Jin;Lee, Yill-Byung
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.513-522
    • /
    • 2007
  • Clustering is to divide given data and automatically find out the hidden meanings in the data. It analyzes data, which are difficult for people to check in detail, and then, makes several clusters consisting of data with similar characteristics. On-Line Document Clustering System, which makes a group of similar documents by use of results of the search engine, is aimed to increase the convenience of information retrieval area. Document clustering is automatically done without human interference, and the number of clusters, which affect the result of clustering, should be decided automatically too. Also, the one of the characteristics of an on-line system is guarantying fast response time. This paper proposed a method of determining the number of clusters automatically by geometrical information. The proposed method composed of two stages. In the first stage, centers of clusters are projected on the low-dimensional plane, and in the second stage, clusters are combined by use of distance of centers of clusters in the low-dimensional plane. As a result of experimenting this method with real data, it was found that clustering performance became better and the response time is suitable to on-line circumstance.

SOM-Based $R^{*}-Tree$ for Similarity Retrieval (자기 조직화 맵 기반 유사 검색 시스템)

  • O, Chang-Yun;Im, Dong-Ju;O, Gun-Seok;Bae, Sang-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.507-512
    • /
    • 2001
  • Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

  • PDF

A Study on the Visual Representation of TREC Text Documents in the Construction of Digital Library (디지털도서관 구축과정에서 TREC 텍스트 문서의 시각적 표현에 관한 연구)

  • Jeong, Ki-Tai;Park, Il-Jong
    • Journal of the Korean Society for information Management
    • /
    • v.21 no.3
    • /
    • pp.1-14
    • /
    • 2004
  • Visualization of documents will help users when they do search similar documents. and all research in information retrieval addresses itself to the problem of a user with an information need facing a data source containing an acceptable solution to that need. In various contexts. adequate solutions to this problem have included alphabetized cubbyholes housing papyrus rolls. microfilm registers. card catalogs and inverted files coded onto discs. Many information retrieval systems rely on the use of a document surrogate. Though they might be surprise to discover it. nearly every information seeker uses an array of document surrogates. Summaries. tables of contents. abstracts. reviews, and MARC recordsthese are all document surrogates. That is, they stand infor a document allowing a user to make some decision regarding it. whether to retrieve a book from the stacks, whether to read an entire article, etc. In this paper another type of document surrogate is investigated using a grouping method of term list. lising Multidimensional Scaling Method (MDS) those surrogates are visualized on two-dimensional graph. The distances between dots on the two-dimensional graph can be represented as the similarity of the documents. More close the distance. more similar the documents.