Molecular Momentum Transport at Fluid-Solid Interfaces in MEMS/NEMS: A Review

This review is focused on molecular momentum transport at fluid-solid interfaces mainly related to microfluidics and nanofluidics in micro-/nano-electro-mechanical systems (MEMS/NEMS). This broad subject covers molecular dynamics behaviors, boundary conditions, molecular momentum accommodations, theoretical and phenomenological models in terms of gas-solid and liquid-solid interfaces affected by various physical factors, such as fluid and solid species, surface roughness, surface patterns, wettability, temperature, pressure, fluid viscosity and polarity. This review offers an overview of the major achievements, including experiments, theories and molecular dynamics simulations, in the field with particular emphasis on the effects on microfluidics and nanofluidics in nanoscience and nanotechnology. In Section 1 we present a brief introduction on the backgrounds, history and concepts. Sections 2 and 3 are focused on molecular momentum transport at gas-solid and liquid-solid interfaces, respectively. Summary and conclusions are finally presented in Section 4

Factors to relieve the influence that a difference of the ideal self and the actual self gives to self-acceptance : From the perspective of meta level affirmation ofthe actual self and self-appraisal for the recognition of the difference

理想自己と現実自己の差異は適応の指標として扱われており,差が小さいほど適応的である。しかし,適応をよくするために差異の大きさを直接調整することは,現実的ではない。よって,差異が適応に及ぼす影響を緩和する要因に着目することが有効である。本研究では,適応の指標として自己受容を用い,理想自己と現実自己の差異が自己受容に及ぼす影響を緩和する変数について検討した。その結果,差異の認知の自己評価が,差異が自己受容に及ぼす影響を緩和することが示され,差異が大きいと感じても,それを受け容れることで,自己受容の低下を防ぐことができることが明らかになった。また,差異の大きさを受け容れるプロセスについて,半構造化面接を用いて検討した。その結果,他者からの受容や理想自己以外の価値観の発見によって,理想の重要性が低下し,差異の大きさを受け容れていくプロセスが明らかになった

Divisible Voting Scheme

Electronic voting is a prime application of cryptographic tools. Many researches are addressing election or confidence voting in this area. We address a new type of voting scheme "Divisible Voting Scheme," in which each voter has multiple ballots where the number of ballots can be different among the voters. This type of voting is popular, however there is no secure protocol which achieves this type of voting. We first define the divisible voting scheme and show naive protocols based on existing voting schemes. Then we propose two efficient divisible voting schemes. The first scheme uses multisets, the second scheme uses L-adic representation of number of ballots. The total cost for a voter is O(M²log(N)) in the first scheme and O(M log(N)) in the second scheme where M is the number of candidates to vote for and N is the number of ballots for a voter