首页 > 最新文献

Adult Supervision Required最新文献

英文 中文
5. Psychology’s Child: Emotional Autonomy and the Privatization of the Self 5. 心理学的孩子:情感自主和自我的私有化
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-007
{"title":"5. Psychology’s Child: Emotional Autonomy and the Privatization of the Self","authors":"","doi":"10.36019/9780813552217-007","DOIUrl":"https://doi.org/10.36019/9780813552217-007","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128445478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Frontmatter
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-fm
{"title":"Frontmatter","authors":"","doi":"10.36019/9780813552217-fm","DOIUrl":"https://doi.org/10.36019/9780813552217-fm","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114473131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
4. Mixed Messages about Responsibility: Children’s Duties and the Work of Parenting 4. 关于责任的混杂信息:孩子的义务和父母的工作
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-006
Markella B. Rutherford
{"title":"4. Mixed Messages about Responsibility: Children’s Duties and the Work of Parenting","authors":"Markella B. Rutherford","doi":"10.36019/9780813552217-006","DOIUrl":"https://doi.org/10.36019/9780813552217-006","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121554067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Appendix A: Sampling and Coding Procedures for Magazine Texts 附录A:杂志文本的抽样和编码程序
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-009
Markella B. Rutherford
{"title":"Appendix A: Sampling and Coding Procedures for Magazine Texts","authors":"Markella B. Rutherford","doi":"10.36019/9780813552217-009","DOIUrl":"https://doi.org/10.36019/9780813552217-009","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Acknowledgments 致谢。
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-001
{"title":"Acknowledgments","authors":"","doi":"10.36019/9780813552217-001","DOIUrl":"https://doi.org/10.36019/9780813552217-001","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125483203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Index 指数
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-013
{"title":"Index","authors":"","doi":"10.36019/9780813552217-013","DOIUrl":"https://doi.org/10.36019/9780813552217-013","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115885443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
1. Take It with a Grain of Salt: How Parents Encounter Experts and Advice 1. 半信半疑:父母如何面对专家和建议
Pub Date : 2020-12-31 DOI: 10.36019/9780813552217-003
Markella B. Rutherford
{"title":"1. Take It with a Grain of Salt: How Parents Encounter Experts and Advice","authors":"Markella B. Rutherford","doi":"10.36019/9780813552217-003","DOIUrl":"https://doi.org/10.36019/9780813552217-003","url":null,"abstract":"","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126828125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
6. Conclusion 6. 结论
Pub Date : 1976-12-31 DOI: 10.9783/9780812203998-007
Reiter, M. Franklin, J. B. Lacy, R. Wright, R L Rivest, A. Shamir, L. A. Adleman, D. Atkins, M. Graff, A. Lenstra, P. C. Ley, D Bayer, S. Haber, W. Stornetta, Improv, M. Fischer, N. Lynch, M. Paterson, D. P. Mitchell, W. M. Schell, Cryp
method for obtaining digital signatures and public-key cryptosystems. then set sender = (j + 1) mod n. 3. When (i ? sender) mod n becomes less than S T , start the computation of p)B 2 for the set B 2 to be included in the next C-mcast, i.e., where B 2 includes the digests of all messages M 0 such that (i) there is no direct message M 00 such that D(M 00)!D(M 0), (ii) if D(M 0)! D(M 00), then M 00 is direct or delivered, and (iii) M 0 did not appear in B 2 in a previous execution of C-mcast. 4. When sender = i, dequeue the first message m in pending, and execute C-mcast(m; B 1 ; p)B 2), where p)B 2 is already prepared, and B 1 contains (unsigned) message digests of messages that currently satisfy requisites (i)–(iii) above. 5. If C-deliver(q; m) is executed, then execute R-deliver(q; m). Under normal (faultless) conditions, this reliable mul-ticast protocol can potentially achieve a delivery latency of T + S + d(2n + 1)=3e (U + T). This latency is derived as follows: The transmission of a message M takes T time. S is the time it takes for the process S T hops away from the sender to complete a signed acknowledgement for M, or equivalently for this process to become enabled to transmit. This is followed by d(2n + 1)=3e transmissions , each one being initiated as soon as the previous one is received and thus taking T time, and each one containing a signed acknowledgment for M (direct or indirect). Finally, the d(2n + 1)=3e signatures must be verified. This calculation assumes that each process is ready to transmit a message as soon as its turn arrives. In order for this to hold, it is assumed that n S T. Using the parameters above (with 300-bit RSA moduli and public exponents equal to 3), the delivery latency for 9 Sparc 20s is potentially between 30ms and 40ms. In this abstract we presented a high-throughput mul-ticast protocol that ensures that all members of the mul-ticast destination group receive the same multicast messages , despite the malicious collaboration of fewer than one-third of the group members. High throughput is achieved due to an acknowledgement chaining technique , whereby a single signature is used to indirectly acknowledge multiple messages. Our protocol also includes a flow control mechanism …
获取数字签名和公钥密码系统的方法。然后设置sender = (j + 1) mod n。什么时候?发送方)mod n小于S T,则开始计算p) b2,使集合b2包含在下一个c - cast中,即b2包含所有消息m0的摘要,使得(i)不存在直接消息m00,使得D(m00)!D(m0), (ii)如果D(m0)!D(m00),则m00是直接或交付的,并且(iii) m0在之前执行的C-mcast中没有出现在b2中。4. 当sender = i时,将等待中的第一条消息m从队列中取出,并执行C-mcast(m;B 1;p) b2),其中p) b2已经准备好,b1包含当前满足上述条件(i) - (iii)的消息的(无符号)消息摘要。5. 如果C-deliver (q;m)执行,则执行R-deliver(q;在正常(无故障)条件下,该可靠的组播协议可能实现T + S + d(2n + 1)=3e (U + T)的传输延迟,该延迟的推导如下:消息m的传输时间为T。S是进程S T离开发送方完成对M的签名确认所花费的时间,或者等同于该进程启用传输所需的时间。接下来是d(2n + 1)=3e个传输,每个传输在接收到前一个传输后立即启动,因此需要T时间,并且每个传输都包含对M(直接或间接)的签名确认。最后,必须验证d(2n + 1)=3e签名。此计算假设每个进程在轮到它时就准备好发送消息。为了保持这一点,假设n S t使用上面的参数(300位RSA模和公共指数等于3),9 Sparc 20s的传递延迟可能在30ms到40ms之间。在这个摘要中,我们提出了一个高吞吐量的多播协议,该协议确保多播目的组的所有成员接收到相同的多播消息,尽管只有不到三分之一的组成员恶意协作。通过确认链技术实现高吞吐量,即使用单个签名间接确认多个消息。我们的协议还包括一个流量控制机制…
{"title":"6. Conclusion","authors":"Reiter, M. Franklin, J. B. Lacy, R. Wright, R L Rivest, A. Shamir, L. A. Adleman, D. Atkins, M. Graff, A. Lenstra, P. C. Ley, D Bayer, S. Haber, W. Stornetta, Improv, M. Fischer, N. Lynch, M. Paterson, D. P. Mitchell, W. M. Schell, Cryp","doi":"10.9783/9780812203998-007","DOIUrl":"https://doi.org/10.9783/9780812203998-007","url":null,"abstract":"method for obtaining digital signatures and public-key cryptosystems. then set sender = (j + 1) mod n. 3. When (i ? sender) mod n becomes less than S T , start the computation of p)B 2 for the set B 2 to be included in the next C-mcast, i.e., where B 2 includes the digests of all messages M 0 such that (i) there is no direct message M 00 such that D(M 00)!D(M 0), (ii) if D(M 0)! D(M 00), then M 00 is direct or delivered, and (iii) M 0 did not appear in B 2 in a previous execution of C-mcast. 4. When sender = i, dequeue the first message m in pending, and execute C-mcast(m; B 1 ; p)B 2), where p)B 2 is already prepared, and B 1 contains (unsigned) message digests of messages that currently satisfy requisites (i)–(iii) above. 5. If C-deliver(q; m) is executed, then execute R-deliver(q; m). Under normal (faultless) conditions, this reliable mul-ticast protocol can potentially achieve a delivery latency of T + S + d(2n + 1)=3e (U + T). This latency is derived as follows: The transmission of a message M takes T time. S is the time it takes for the process S T hops away from the sender to complete a signed acknowledgement for M, or equivalently for this process to become enabled to transmit. This is followed by d(2n + 1)=3e transmissions , each one being initiated as soon as the previous one is received and thus taking T time, and each one containing a signed acknowledgment for M (direct or indirect). Finally, the d(2n + 1)=3e signatures must be verified. This calculation assumes that each process is ready to transmit a message as soon as its turn arrives. In order for this to hold, it is assumed that n S T. Using the parameters above (with 300-bit RSA moduli and public exponents equal to 3), the delivery latency for 9 Sparc 20s is potentially between 30ms and 40ms. In this abstract we presented a high-throughput mul-ticast protocol that ensures that all members of the mul-ticast destination group receive the same multicast messages , despite the malicious collaboration of fewer than one-third of the group members. High throughput is achieved due to an acknowledgement chaining technique , whereby a single signature is used to indirectly acknowledge multiple messages. Our protocol also includes a flow control mechanism …","PeriodicalId":251860,"journal":{"name":"Adult Supervision Required","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134526948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Adult Supervision Required
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1