다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

National Institute of Standards and Technology における超伝導研究及び生活

In his Preface the author' says that he started out to review all the more important theories upon the topics ordinarily discussed under human motivation but soon found himself more and more limited to the presentation of his own point of view. This very well characterizes the book. It is a very personal product. It is an outline with some defense of the author's own thinking about instincts and appetites and sentiments and how they function in human behavior. And as the author draws so heavily upon James and McDougall, especially the latter, the book may well be looked upon as a sort of sequel to their efforts. There is a thought-provoking distinction presented between instinct and appetite. An instinct is said to be aroused always by something in the external situation; and, correspondingly, an appetite is said to be aroused by sensations from within the body itself. This places, of course, a heavy emphasis upon the cognitive factor in all instinctive behaviors; and the author prefers to use the cognitive factor, especially the knowledge of that end-experience which will satisfy, as a means of differentiating one instinct from another. In this there is a recognized difference from McDougall who placed more emphasis for differentiation upon the emotional accompaniment. The list of instincts arrived at by this procedure is much like that of McDougall, although the author is forced by his criteria to present the possibility of food-seeking and sex and sleep operating both in the manner of an appetite and also as an instinct. The Shand-McDougall concept of sentiment is taken over and used in the explanation of moral motivation. There is the development within each personality of a sentiment for some moral principle. But this sentiment is not a very powerful motivating factor. It is reinforced by social pressures and by religion, which is treated as an effort of finite man to live in harmony with the infinite reality. Those whose psychological thinking is largely in terms of McDougall will doubtless find this volume a very satisfying expansion; but those who are at all inclined to support their psychological thinking by reference to experimental studies will not be so well pleased. The James-Lange theory, for example, is discussed without mention of the many experimental studies which it has provoked. Theoretical sources appear in general to be preferred to experimental investigations.

Human MotivationThe Mind in Action: A Study of Motives and Values. A. Campbell Garnett

On the truck dispatching problem

Book review: Applied cryptography: Protocols, algorithms, and source code in C

Elliptic curve point multiplication is considered to be the most significant operation in all elliptic curve cryptography systems, as it forms the basis of the elliptic curve discrete logarithm problem. Designs for elliptic curve cryptography point multiplication are area demanding and time consuming. Thus, the efficient realization of point multiplication is of fundamental importance for the performance of an elliptic curve system. In this paper, a hardware architecture of an elliptic curve point multiplier is proposed that exploits the intrinsic parallelism of the residue number system (RNS), in order to speed up the elliptic curve point calculations and minimize the area complexity of the elliptic curve point multiplier. The architecture proves to be the fastest among all known design approaches, while complexity is less than half of that of previous efforts. This architecture also supports the required input (binary-to-RNS) and output (RNS-to-binary) conversions. Through a graph-oriented approach, the area of the elliptic curve point multiplier is minimized, by optimizing the point addition and doubling algorithms. Also, through this approach, the number of execution steps for point addition is matched to the number of execution steps for point doubling. Additionally, the impact of various RNS bases, in terms of number of moduli and their bit lengths, on the area and speed of the proposed implementation is analyzed, in an effort to define the potential for using RNS in elliptic curve cryptography.

An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier

This paper introduces an innovative design which implements a high-performance JPEG-LS encoder. The encoding process follows the principles of the JPEG-LS lossless mode. The proposed implementation consists of an efficient pipelined JPEG-LS encoder, which operates at a significantly higher encoding rate than any other JPEG-LS hardware or software implementation while keeping area small.

/pdf/efficient-high-performance-asic-implementation-of-jpeg-ls-26n82ryvar.pdf

Efficient high-performance ASIC implementation of JPEG-LS encoder

An elliptic curve point multiplier (ECPM) is the main part of all elliptic curve cryptography (ECC) systems and its performance is decisive for the performance of the overall cryptosystem. A VLSI residue number system (RNS) architecture of an ECPM is presented in this paper. In the proposed approach, the necessary mathematical conditions that need to be satisfied, in order to replace typical finite field circuits with RNS ones, are investigated. It is shown that such an application is feasible and that it leads to a significant improvement in the execution time of a scalar point multiplication.

A new approach to elliptic curve cryptography: an RNS architecture

In this paper, an efficient implementation, in terms of performance, of the keyed-hash message authentication code (HMAC) using the SHA-1 hash function is presented This mechanism is used for message authentication in combination with a shared secret key The proposed hardware implementation can be synthesized easily for a variety of FPGA and ASIC technologies Simulation results, using commercial tools, verified the efficiency of the HMAC implementation in terms of performance and throughput Special care has been taken so that the proposed implementation does not introduce extra design complexity; while in-parallel functionality was kept to the required levels

Efficient implementation of the keyed-hash message authentication code (HMAC) using the SHA-1 hash function

Many cryptographic primitives that are used in cryptographic schemes and security protocols such as SET, PKI, IPSec, and VPNs utilize hash functions, which form a special family of cryptographic algorithms. Applications that use these security schemes are becoming very popular as time goes by and this means that some of these applications call for higher throughput either due to their rapid acceptance by the market or due to their nature. In this work, a new methodology is presented for achieving high operating frequency and throughput for the implementations of all widely used-and those expected to be used in the near future-hash functions such as MD-5, SHA-1, RIPEMD (all versions), SHA-256, SHA-384, SHA-512, and so forth. In the proposed methodology, five different techniques have been developed and combined with the finest way so as to achieve the maximum performance. Compared to conventional pipelined implementations of hash functions (in FPGAs), the proposed methodology can lead even to a 160 percent throughput increase.

Athanasios Kakarountas

Papers

An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier

Efficient high-performance ASIC implementation of JPEG-LS encoder

A new approach to elliptic curve cryptography: an RNS architecture

Efficient implementation of the keyed-hash message authentication code (HMAC) using the SHA-1 hash function

A Top-Down Design Methodology for Ultrahigh-Performance Hashing Cores