著者
團 康晃
出版者
社会学研究会
雑誌
ソシオロジ (ISSN:05841380)
巻号頁・発行日
vol.58, no.2, pp.3-19,142, 2013-10-31 (Released:2015-05-13)
参考文献数
11

In the classroom, although students often laugh with friends, teachers cansometimes censure them for certain activities where laughter is unacceptablebehavior. This paper describes the structure of this type of hilarity, consideringinstances where teachers can disapprove, according to ethnomethodology andconversation analysis By analyzing two types of interaction, the author attempts to shed light onthe following main points. First, in terms of laughter produced during a groupinterview, two types of laughter exist. On the one hand, some jokes elicit laughterfrom every participant. On the other hand, some jokes are not funny for allparticipants. Some activities considered to be joking produce the latter kind oflaughter, and can be penalized by the teacher. This form of mockery differs incertain aspects from that examined in a preceding study by Drew. Second, ittends to be produced in a particular sequence organization. Three steps have beenobserved in such a sequence. First, a preceding actor acts in a certain manner so asto poke fun at a subsequent actor. Some actions tend to be utterances organized asfirst-pair part with some amusing components, or to be utterances with humorouscomponents dependent on a preceding utterance. Second, when the subsequentactor responds to the preceding action, the embedded comical component isimputed to him. Third, participants can laugh at the subsequent actor because ofthis imputation. In addition, if the subsequent actor does not respond to the preceding action,the preceding actor could repeat this action, that is, to tease, to laugh at him, or toimpose sanctions against the rejection of the preceding action. As a consequence of these structures, the subsequent actor is given a paradoxicalidentity different from those sharing co-membership.
著者
南部 義典
出版者
関西法政治研究会
雑誌
憲法論叢 (ISSN:1343635X)
巻号頁・発行日
no.20, pp.3-58, 2014-03-28

The law of the procedure of amendment to constitutional law of Japan (National Referendum Law) is enforced, but legally incomplete. Three legislative matters as to the additional rules of NRL have still been unsolved, so the referendum would not have been held under right operation. As this legal obstacle, for example, in case of the proposal for the amendment to the qualified voters by the National Diet, the minimum age of voting cannot be settled administratively at eighteen or twenty. And more, the range of regulation to referendum campaign by the public officials is legally unclear. At the 185th Diet, the reform proposals by Liberal Democratic Party and Japan Restoration Party to solve the legislative matters had been argued, but each proposal was not enacted. I expound about the contents of the reform proposals and the circumstances to be enacted in this article. For the more effective argument to amendment to constitutional law, the reform proposal of NRL shall be enacted as soon as possible, based on the wide consensus between the government parties and the opposition ones.
著者
有川 峯幸
出版者
一般社団法人 粉体粉末冶金協会
雑誌
粉体および粉末冶金 (ISSN:05328799)
巻号頁・発行日
vol.52, no.2, pp.109-114, 2005 (Released:2006-04-28)
参考文献数
10

Recently Nano-technology is one of the most popular topics, and Nano Carbon material is said to be the technology that is the nearest to the business. Both Fullerene that is the cage shape carbon molecular, and Carbon Nano Tube that is the tube shape of carbon structure, have already reached to the industrial stage. In this overview, the latest development and information about Fullerene production and application are explained.
著者
高橋 源一郎 関川 夏央
出版者
文藝春秋
雑誌
文學界 (ISSN:05251877)
巻号頁・発行日
vol.70, no.12, pp.184-196, 2016-12
著者
江口 圭一
出版者
岩波書店
雑誌
思想 (ISSN:03862755)
巻号頁・発行日
no.583, pp.98-113, 1973-01
著者
鈴木 努
出版者
日本社会学会
雑誌
社会学評論 (ISSN:00215414)
巻号頁・発行日
vol.57, no.3, pp.564-581, 2006-12-31
被引用文献数
1

山岸俊男は『信頼の構造』 (1998) において, 見知らぬ他者を信頼する人は単なる「お人好し」ではなく, 相手を信頼することで, 社会的不確実性と機会コストに対処しているのであるという信頼の解き放ち理論を展開した.その論証には主に実験心理学的方法が用いられたが, その後の社会調査による検証では必ずしも理論を支持する結果は得られていない.その原因として, 信頼の解き放ち理論は実験室状況を越えた実際の社会状況に適用するにはいまだ理論的整理が不十分であること, また実証研究において用いられたモデルが理論を適切に形式化しえていないことが考えられる.本稿では, 社会ネットワーク分析とカタストロフ理論を用いた数理モデルによって個人の社会環境とその個人が示す不特定の他者への一般的信頼の関係を形式化し, 信頼の解き放ち理論とそれに向けられた諸批判を総合した理論仮説を提示する.<BR>本稿のモデルは, 個人のエゴ・ネットワークとその属するホール・ネットワークの特性により個人の一般的信頼がどのように変化するかを示すカスプ・カタストロフ・モデルである.そこでは個人のもつ多層的なネットワーク領域を想定することで, 高い一般的信頼と緊密なコミットメント関係の両立が可能となっており, それにより実験的方法と社会調査から得られた対立的な知見を総合的に理論化する1つの枠組が提出される.
著者
松尾 眞砂子
出版者
社団法人日本家政学会
雑誌
日本家政学会誌 (ISSN:09135227)
巻号頁・発行日
vol.50, no.10, pp.1029-1034, 1999-10-15
参考文献数
20
被引用文献数
4

The usage of okara koji (Koji), okara fermented by Aspergillus oryzae, as a new food stuff was tested by preparing cookies and cupcakes, and their texlural properties and palatability were studied. The capacity for water-holding and oil-absorption of Koji was respectively 5 times and 2 times higher than that of soft flour. Koji could be substituted for soft flour by up to 10% in cookies and 5% in cupcakes without any effect on their textural properties and palatability. Koji significantly suppressed the oxidation of lipids in cookies and the retrogradation of starch in cupcakes during storage. These results suggest that Koji could be a useful foodstuff, not only as a substitute for soft flour, but also as a freshness-retaining ingredient in high-fat baked products during storage.
出版者
日経BP社
雑誌
日経コミュニケ-ション (ISSN:09107215)
巻号頁・発行日
no.300, pp.72-77, 1999-08-16

「この半年で4倍に増加」—。米国インターネット接続事業者(プロバイダ)のバックボーン容量の増加率ではない。 これほどまでの急激な"成長"を遂げている実体は,意外にも身近にある。企業内を流れる電子メールのトラフィックである。
著者
山本 祐二
出版者
滋賀大学保健管理センター
雑誌
SHR mini
巻号頁・発行日
no.29, pp.[1]-[2], 2012-01
著者
Peng Liu Huayi Wang Fengmei Zhang Yingying Chen Debao Wang Yangang Wang
出版者
一般社団法人 日本内科学会
雑誌
Internal Medicine (ISSN:09182918)
巻号頁・発行日
vol.54, no.17, pp.2129-2137, 2015 (Released:2015-09-01)
参考文献数
33
被引用文献数
2 49

Objective The aim of this study was to investigate the long-term effective control of serum uric acid by allopurinol on the carotid intima-media thickness (IMT) in patients with type 2 diabetes (T2DM) and asymptomatic hyperuricemia (HUA). Methods This was a randomized open parallel-controlled study. In this study, 176 patients with T2DM and asymptomatic HUA were randomly allocated to the conventional or allopurinol treatment groups on the basis of a computer-generated random number table. Changes in the carotid IMT, biochemical indexes, high sensitive C-reactive protein (hs-CRP) and the incidence of hypertension in patients before and after three years of treatment were examined and compared between the groups. Results There were no statistically significant differences in the baseline characteristics of the study participants between the two treatment groups (p>0.05 for all). Nevertheless, the serum uric acid, triglyceride, and hs-CRP levels and the homeostasis assessment for insulin resistance (HOMA-IR), systolic blood pressure, diastolic blood pressure and the carotid IMT in the allopurinol group were significantly lower than those in the conventional group after three years of treatment (p<0.01 for all). The intention-to-treat analysis indicated that the incidence of new-onset hypertension in the allopurinol group showed a declining trend compared to that in the conventional treatment group (6.8% vs. 13.6%, p>0.05). Conclusion The long-term effective control of serum uric acid by allopurinol may improve insulin resistance, decrease the serum levels of hs-CRP, reduce the carotid IMT, and may delay the development of atherosclerosis in patients with T2DM and asymptomatic HUA.
著者
林 達也 中野 浩嗣 オラリウステファン
出版者
一般社団法人情報処理学会
雑誌
情報処理学会研究報告アルゴリズム(AL) (ISSN:09196072)
巻号頁・発行日
vol.1996, no.89, pp.23-30, 1996-09-13
参考文献数
19

要素数が合計がnのソートされたk個の列をマージして新しいソート列を求める問題をkマージ問題と呼ぶ。本論文では、単純で仕事・時間量が最適な3つのPRAM上のkマージ問題を解くアルゴリズムを示す。まず、EREW?PRAM上で、O(og )時間で仕事量がO( log )のkマージアルゴリズムと、CREW?PRAMとCRCW?PRAM上でO(oglog n+log )時間で仕事量がO( log )のkマージアルゴリズムを示す。また、これらのアルゴリズムが仕事量がO( log )である限り、高速化はできないことを示す。The k-merge problem, given a collection of k,(2〓k〓n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on three PRAM models. Our k-merge algorithms runs in O(log n) time and performs O(n log k) work on the EREW-PRAM. and in O(loglog n+log k) time and O(n log k) work both on the CREW-PRAM and on the CRCW-PRAM. We also prove that the computing time of these algorithms cannot be improved provided that the amount of work is bounded by O(n log k).