• 제목/요약/키워드: value assignment

검색결과 160건 처리시간 0.024초

Computing and Reducing Transient Error Propagation in Registers

  • Yan, Jun;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • 제5권2호
    • /
    • pp.121-130
    • /
    • 2011
  • Recent research indicates that transient errors will increasingly become a critical concern in microprocessor design. As embedded processors are widely used in reliability-critical or noisy environments, it is necessary to develop cost-effective fault-tolerant techniques to protect processors against transient errors. The register file is one of the critical components that can significantly affect microprocessor system reliability, since registers are typically accessed very frequently, and transient errors in registers can be easily propagated to functional units or the memory system, leading to silent data error (SDC) or system crash. This paper focuses on investigating the impact of register file soft errors on system reliability and developing cost-effective techniques to improve the register file immunity to soft errors. This paper proposes the register vulnerability factor (RVF) concept to characterize the probability that register transient errors can escape the register file and thus potentially affect system reliability. We propose an approach to compute the RVF based on register access patterns. In this paper, we also propose two compiler-directed techniques and a hybrid approach to improve register file reliability cost-effectively by lowering the RVF value. Our experiments indicate that on average, RVF can be reduced to 9.1% and 9.5% by the hyperblock-based instruction re-scheduling and the reliability-oriented register assignment respectively, which can potentially lower the reliability cost significantly, without sacrificing the register value integrity.

A Critique of Designing Resource Adequacy Markets to Meet Loss of Load Probability Criterion

  • Yoon, Yong T.;Felder, Frank A.
    • KIEE International Transactions on Power Engineering
    • /
    • 제3A권1호
    • /
    • pp.35-41
    • /
    • 2003
  • To ensure resource adequacy in restructured electricity markets, policymakers have adopted installed capacity (ICAP) markets in some regions of the United States. These markets ensure that adequate generation exists to satisfy regional Loss of Load Probability(LOLP) criterion. Since the incentives created through ICAP mechanisms directly impact new generation and transmission investment decisions we examine one important factor that links ICAP markets with LOLP calculations;, determining the amount of ICAP credit assigned to particular generation units. First, we review and critique the literature on electric power systems' market failure resulting from demand exceeding supply. We then summarize the method of computing (the LOLP) as a means of assessing reliability and relate this method to ICAP markets. We find that only the expected value of available generation is used In current ICAP markets while ignoring the second and higher order moments, which tends to mis-state the ICAP value of a specific resource. We then consider a proposal whose purpose is to avoid this ICAP assignment issue by switching from ICAP obligations to options. We find that such a proposal may fail to not provide the benefits claimed and suffers from several practical difficulties. Finally, we conclude with some policy recommendations and areas for future research.

Constructivist interpretation on the modal logic (양상 논리에 대한 구성주의적 해석)

  • Eun, Eun-suk
    • Journal of Korean Philosophical Society
    • /
    • 제116권
    • /
    • pp.257-280
    • /
    • 2010
  • I try to formalize the system of modal logic and interpret it in view of constructivism through this study. As to the meaning of a sentence, as we saw, Frege endorsed extensions in view of the fact that they are enough to provide for a compositional account for truth, in particular that (1) the assignment of extensions to expressions is compositional ; (2) the assignment of extensions to sentences coincides with the assignment of truth values. But nobody would be willing to admit that a truth value is what a sentence means and that consequently all true sentences are synonymous. So, if what we are after is meaning in the intuitive sense, then extensions would not do. This consideration has later become the point of departure of modal and intensional semantics. So, it is clear that the language of modal logic do not allow for an extensional interpretation. ${\square}$ is syntactically on a par with ${\vdash}$, hence within the extensional framework it would have to denote a unary truth function. This means that if modal logic is to be interpreted, we need a semantics which is not extensional. The first attempt to build a feasible intensional semantics was presented by Saul Kripke. He came to the conclusion that we must let sentences denote not truth values, but rather subsets of a given set. He called elements of the underlying set possible world. Hence each sentence is taken to denote the set of those possible world in which it is true. This lets us explicate necessity as 'truth in every possible world' and possibility as 'truth in at least one possible world'. But it is clear that the system of modal logic is not only an enlargement of propositional logic, as long as the former contains the new symbols, but that it is of an other nature. In fact, the modal logic is intensional, in that the operators do not determine the functions of truth any more. But this new element is not given a priori, but a posteriori from construction by logicist.

Packet Scheduling Algorithm Considering Maximum Delay Tolerance for HSDPA System

  • Hur, Soojung;Jakhongil, Narzullaev;Park, Yong-Wan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • 제8권6호
    • /
    • pp.311-318
    • /
    • 2013
  • In this paper, we consider a new packet scheduling algorithm for real-time traffic in the HSDPA system that has been introduced for the WCDMA system, in order to provide high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider channel assignment based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission as priority order; then the ranked users are assigned certain number of channels based on the SIR value table. The simulation results show that the proposed algorithm can provide a lower packet drop rate, and satisfy real time quality of service (QoS) requirements.

고삼투압이 재조합 Erythropoietin의 생산과 당쇄구조에 미치는 효과

  • Jeong, Yeon-Tae;Kim, Jeong-Hoe
    • 한국생물공학회:학술대회논문집
    • /
    • 한국생물공학회 2001년도 추계학술발표대회
    • /
    • pp.221-224
    • /
    • 2001
  • Effect of hyperosmotic pressure on growth of recombinant Chinese hamster 。 vary cells and Erythropoietin (EPO) production was investigated. Cells were cultivated in batch modes at various osmolalities. When the osmolality increased from 314 to 463mOsm/Kg, specific EPO productivity (qp) was increased up to 1.6-fold but cell growth was inhibited. EPO has a complex oligosaccharide structure that plays an important role in biological activity in vivo. To investigate the influence of hypoerosmotic pressure on the glycosylation, structural analysis of oligosaccharide was calTied out. Recombinant human EPO was produced by CHO cells grown under various osmotic pressure and purified from culture supernatants by heparin-sepharose affinity column and immunoaffinity column. N-linked oligosaccharides were released enzymatically and isolated by paper chromatography. The isolated oligosaccharides were labeled with fluorescent dye, 2-aminobenzamide and analyzed with MonoQ anion exchange chromatography and GlycosepN amide chromatography for the assignment of GU (glucose unit) value. Glycan analysis by HPLC showed that neutral (asialo) oligosaccharide was increased slightly with an increase in osmolality. In portion of sialylated glycan, total relative amount of mono- and di-sialyated glycan was increased but that of tri- and tetra-sialylated glycan decreased as osmolality was increased.

  • PDF

On The Chemical, Botanical, and Chemotaxonomical Evaluation of The Genus Citrus -Part I : Polymethoxyflavones of The Leaf of Citrus deliciosa Ten.-

  • El-Domiaty, Maher M.;Abdel-Aal, Mahmoud M.;El-Shafae, Azza M.
    • Natural Product Sciences
    • /
    • 제2권2호
    • /
    • pp.106-114
    • /
    • 1996
  • Four polymethoxyfavones were isolated from the leaves of Citrus deliciosa, three of which (nobiletin, 5-O-demethylnobiletin, and tangeritin) are bioactive. The fourth (7,4'-dihydroxy-5,6,8,3'-tetramethoxyflavone) is reported for the first time in the genus Citrus and is a potential chemotaxonomic marker. The structures of these flavones were confirmed by analysing their spectral data and comparison with similar compounds. The previously reported $^{13}C$ NMR assignment of 5-O-demethylnobiletin has been revised on the basis of 2D NMR experiments (HETCOR, COSY, and COLOC). The chemotaxonomic value of the present finding is verified.

  • PDF

Fuzzy ART Neural Network-based Approach to Recycling Cell Formation of Disposal Products (Fuzzy ART 신경망 기반 폐제품의 리싸이클링 셀 형성)

  • 서광규
    • Journal of the Korea Safety Management & Science
    • /
    • 제6권2호
    • /
    • pp.187-197
    • /
    • 2004
  • The recycling cell formation problem means that disposal products are classified into recycling product families using group technology in their end-of-life phase. Disposal products have the uncertainties of product condition usage influences. Recycling cells are formed considering design, process and usage attributes. In this paper, a new approach for the design of cellular recycling system is proposed, which deals with the recycling cell formation and assignment of identical products concurrently. Fuzzy ART neural networks are applied to describe the condition of disposal product with the membership functions and to make recycling cell formation. The approach leads to cluster materials, components, and subassemblies for reuse or recycling and can evaluate the value at each cell of disposal products. Disposal refrigerators are shown as an example.

Optimum Scheduling Algorithm for Job Sequence, Common Due Date Assignment and Makespan to Minimize Total Costs for Multijob in Multimachine Systems (다수(多数) 기계(機械)의 총비용(總費用)을 최소화(最小化)하는 최적작업순서, 공통납기일 및 작업완료일 결정을 위한 일정계획(日程計劃))

  • No, In-Gyu;Kim, Sang-Cheol
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제12권1호
    • /
    • pp.1-11
    • /
    • 1986
  • This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

  • PDF

DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE

  • ZHANG, XIAOLING
    • Korean Journal of Mathematics
    • /
    • 제23권4호
    • /
    • pp.607-618
    • /
    • 2015
  • An L(2; 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers such that ${\mid}f(u)-f(v){\mid}{\geq}2$ if d(u, v) = 1 and ${\mid}f(u)-f(v){\mid}{\geq}1$ if d(u, v) = 2. The ${\lambda}$-number of G, denoted ${\lambda}(G)$, is the smallest number k such that G admits an L(2, 1)-labeling with $k=\max\{f(u){\mid}u{\in}V(G)\}$. In this paper, we consider the square of a cycle and provide exact value for its ${\lambda}$-number. In addition, we also completely determine its edge span.

Combinatorial Optimization Model of Air Strike Packages based on Target Groups (표적군 기반 공격 편대군 조합 최적화 모형)

  • Cho, Sanghyeon;Lee, Moongul;Jang, Youngbai
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제42권6호
    • /
    • pp.386-394
    • /
    • 2016
  • In this research, in order to optimize the multi-objective function effectively, we suggested the optimization model to maximize the total destruction of ground targets and minimize the total damage of aircrafts and cost of air munitions by using goal programming. To satisfy the various variables and constraints of this mathematical model, the concept of air strike package is applied. As a consequence, effective attack can be possible by identifying the prior ground targets more quickly. This study can contribute to maximize the ROK air force's combat power and preservation of high value air asset in the war.