• 제목/요약/키워드: BPP

검색결과 136건 처리시간 0.02초

자라 위장관 내분비세포에 관한 면역조직화학적 연구 (An immunohistochemical study on the gastro-entero-endocrine cells of the pond tortoise (Amyda sinensis))

  • 김종범;이재현;이형식;이남수
    • 대한수의학회지
    • /
    • 제30권4호
    • /
    • pp.383-394
    • /
    • 1990
  • The gastrointestinal endocrine cells of the Pond tortoise, Amyda sinensis were studied immunohistochemically, and somatostatin-, gastrin/cholecystokinin(GAS/CCK)-, glucagon-, 5-hydroxytryptamine(5-HT)-, insulin- and chromogranin-immunoreactive cells were revealed. The characteristic findings of the regional distribution and relative frequency of these immunoreative cells in the gastrointestinal tract of the Pond tortoise were as follows; A few somatostatin-immunoreactive cells were distributed from the segment I to the segment V. GAS/CCK-immunoreactive cells were found from the segment III to the segment VII. These cells were numerous in the segment III and a few in the other segments. A few glucagon-immunoreactive cells were found in the segment I and rare in the segment II. 5-HT-immunoreactive cells were found throughout the gastrointestinal tract. Numerous numbers of them were found in the segment I, while moderate or a few in the other segments. Insulin-immunoreactive cells were distributed from the segment II to the segment IX. Moderate numbers of them were found in the segment VIII and IX, while a few in the other segments. Chromogranin-immunoreactive cells were found from the segment III to the segment VI. Moderate numbers of these cells were found in the segment IV and V, while a few in the other segments. BPP-immunoreactive cells were not observed throughout the gastrointestinal tract of the Pond tortoise, Amyda sinensis.

  • PDF

Prediction-based Reversible Data Hiding Using Empirical Histograms in Images

  • Weng, Chi-Yao;Wang, Shiuh-Jeng;Liu, Jonathan;Goyal, Dushyant
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권4호
    • /
    • pp.1248-1266
    • /
    • 2012
  • This paper presents a multilevel reversible data hiding method based on histogram shifting which can recover the original image losslessly after the hidden data has been extracted from the stego-image. The method of prediction is adopted in our proposed scheme and prediction errors are produced to explore the similarity of neighboring pixels. In this article, we propose two different predictors to generate the prediction errors, where the prediction is carried out using the center prediction method and the JPEG-LS median edge predictor (MED) to exploit the correlation among the neighboring pixels. Instead of the original image, these prediction errors are used to hide the secret information. Moreover, we also present an improved method to search for peak and zero pairs and also talk about the analogy of the same to improve the histogram shifting method for huge embedding capacity and high peak signal-to-noise ratio (PSNR). In the one-level hiding, our method keeps image qualities larger than 53 dB and the ratio of embedding capacity has 0.43 bpp (bit per pixel). Besides, the concept with multiple layer embedding procedure is applied for obtaining high capacity, and the performance is demonstrated in the experimental results. From our experimental results and analytical reasoning, it shows that the proposed scheme has higher PSNR and high data embedding capacity than that of other reversible data hiding methods presented in the literature.

신발생산 자원관리 시스템의 표준 비즈니스 프로세스 (A Standard Business Process of Resource Planning Systems for Footwear Production)

  • 류영근;조남호
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2002년도 춘계학술대회 논문집
    • /
    • pp.56-56
    • /
    • 2002
  • ERP 시스템 내에는 각 업종별로 특성에 맞는 업무 프로세스가 구현되어 있어야 함은 필수 불가결한 요소이다. 그러나, 범용 ERP 시스템은 거의 대부된 OEM 생산방식에 의존하고 있는 국내 중소 신발업체의 생산관리 방식과는 맞지 않는 부분이 너무 많다. 그러므로 신발제조회사의 현황에 맞는 ERP 시스템의 개발이 절실하다. 이를 위해서 첫째, 시스템 개발을 위한 신발생산용 업무 프로세스가 표준화되어야 하고 둘째, 프로그램 작성을 위한 표준업무 프로세스에 기초한 통합시스템 프로세스의 모형이 설계되어야 한다. 본 논문에서는 국내 신발제조업체들의 생산관리방식에 적합하고 신발생산 전용의 자원관리 시스템의 개발과 도입을 위한 기초로서 BPR의 수행과 표준 업무 프로세스를 구축하는 방법을 제안하였다. 그리고 이에 따른 신발생산 자원관리 시스템의 프로세스 모형을 제시하였다. 이 연구는 ERP 시스템 중 생산 자원계획을 위한 통합 프로세스 모형의 구축에 초점이 맞추어져 있으며 통합 프로세스 모형은 13개 모듈로 구성되었다.

  • PDF

A Stochastic Bilevel Scheduling Model for the Determination of the Load Shifting and Curtailment in Demand Response Programs

  • Rad, Ali Shayegan;Zangeneh, Ali
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권3호
    • /
    • pp.1069-1078
    • /
    • 2018
  • Demand response (DR) programs give opportunity to consumers to manage their electricity bills. Besides, distribution system operator (DSO) is interested in using DR programs to obtain technical and economic benefits for distribution network. Since small consumers have difficulties to individually take part in the electricity market, an entity named demand response provider (DRP) has been recently defined to aggregate the DR of small consumers. However, implementing DR programs face challenges to fairly allocate benefits and payments between DRP and DSO. This paper presents a procedure for modeling the interaction between DRP and DSO based on a bilevel programming model. Both DSO and DRP behave from their own viewpoint with different objective functions. On the one hand, DRP bids the potential of DR programs, which are load shifting and load curtailment, to maximize its expected profit and on the other hand, DSO purchases electric power from either the electricity market or DRP to supply its consumers by minimizing its overall cost. In the proposed bilevel programming approach, the upper level problem represents the DRP decisions, while the lower level problem represents the DSO behavior. The obtained bilevel programming problem (BPP) is converted into a single level optimizing problem using its Karush-Kuhn-Tucker (KKT) optimality conditions. Furthermore, point estimate method (PEM) is employed to model the uncertainties of the power demands and the electricity market prices. The efficiency of the presented model is verified through the case studies and analysis of the obtained results.

Reversible Data Hiding in Permutation-based Encrypted Images with Strong Privacy

  • Shiu, Chih-Wei;Chen, Yu-Chi;Hong, Wien
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.1020-1042
    • /
    • 2019
  • Reversible data hiding in encrypted images (RDHEI) provides some real-time cloud applications; i.e. the cloud, acting as a data-hider, automatically embeds timestamp in the encrypted image uploaded by a content owner. Many existing methods of RDHEI only satisfy user privacy in which the data-hider does not know the original image, but leaks owner privacy in which the receiver can obtains the original image by decryption and extraction. In the literature, the method of Zhang et al. is the one providing weak content-owner privacy in which the content-owner and data-hider have to share a data-hiding key. In this paper, we take care of the stronger notion, called strong content-owner privacy, and achieve it by presenting a new reversible data hiding in encrypted images. In the proposed method, image decryption and message extraction are separately controlled by different types of keys, and thus such functionalities are decoupled to solve the privacy problem. At the technique level, the original image is segmented along a Hilbert filling curve. To keep image privacy, segments are transformed into an encrypted image by using random permutation. The encrypted image does not reveal significant information about the original one. Data embedment can be realized by using pixel histogram-style hiding, since this property, can be preserved before or after encryption. The proposed method is a modular method to compile some specific reversible data hiding to those in encrypted image with content owner privacy. Finally, our experimental results show that the image quality is 50.85dB when the averaged payload is 0.12bpp.

적합성 함수를 이용한 2차원 저장소 적재 문제의 휴리스틱 알고리즘 (A Heuristic Algorithm for the Two-Dimensional Bin Packing Problem Using a Fitness Function)

  • 연용호;이선영;이종연
    • 정보처리학회논문지B
    • /
    • 제16B권5호
    • /
    • pp.403-410
    • /
    • 2009
  • 2차원 저장소 적재는 NP-hard 문제로서 그 문제의 정확한 해를 구하는 것이 어려운 것으로 알려져 있으며, 이의 더 좋은 해를 얻기 위해 유전자(genetic) 알고리즘, 시뮬레이티드 어닐링(simulated annealing), 타부서치(tabu search)등과 같은 근사적 접근법이 제안되어 왔다. 하지만 분지한계(branch-and-bound)나 타부서치 기법들을 이용한 기존의 대표적인 근사 알고리즘들은 휴리스틱 알고리즘의 해에 기반을 둠으로 효율성이 낮고 반복수행에 의한 계산시간이 길다. 따라서 본 논문에서는 이러한 근사 알고리즘의 복잡성을 간소화하고, 알고리즘의 효율성을 높이기 위해 적재가능성을 판단하는 적합성 함수(fitness function)를 정의하고 이를 이용하여 어떤 특정 개체의 적재영역을 판단하는데 영향을 주는 적재영역의 수를 계산한다. 또한, 이들을 이용한 새로운 휴리스틱 알고리즘을 제안하였다. 끝으로 기존의 휴리스틱 또는 메타휴리스틱 기법과의 비교실험을 통해 기존의 휴리스틱 알고리즘인 FFF와 FBS에 비해 97%의 결과가 같거나 우수하였으며, 타부서치 알고리즘에 비해 86%의 결과가 같거나 우수한 것으로 나타났다.