If I can't be yours

解读EVA与经典音乐
本文回顾了动画《新世纪福音战士》(EVA)的经典之处,特别是其音乐方面,包括多个版本的 Fly me to the moon 和 If I can't be yours 等曲目,探讨了这些音乐中融合的 Jazz 和 Classics 元素。
http://www.likenote.com/listener/article/796

[img]http://www.likenote.com/images/dj/2006/11/1163196867_11.jpg[/img]

永远的动画经典EVA,永远的令人费解。记得第一次看是在大一的时候,一如当时尚处青春末期的迷茫和躁动。有人说EVA介于模糊与暧昧之间,让看不懂的人不至于太难堪,也不会直白的让人马上忘记。

不管EVA的剧情和意义如何,它的音乐是非常经典的(以致于Fly me to the moon可以出n个版本还能继续卖orz),融合了大量Jazz和Classics元素。If I can't be yours这个如此伤感的假如,在Jazz的随意旋律之下却又有着某种解脱的勇敢。
from nltk.chat.util import Chat # 修改反射字典:使用标准英语替换网络用语 reflections = { "am": "are", # 原"r"改为"are" "was": "were", "i": "you", # 原"u"改为"you" "i'd": "you'd", "i've": "you've", "ive": "you've", "i'll": "you'll", "my": "your", # 原"ur"改为"your" "are": "am", "you're": "I'm", "you've": "I've", "you'll": "I'll", "your": "my", "yours": "mine", "you": "me", "me": "you", # 删除非标准缩写:ur, urs, u } # 重写对话模板:移除网络用语和夸张表达 pairs = ( ( r"I\'m (.*)", ( "You're %1? That's interesting. Tell me more.", # 移除"kekekeke"和表情 "You're %1? That sounds nice.", # 简化表达 ), ), ( r"(.*) don\'t you (.*)", ( "Why do you think I can't %2?", # 改为完整疑问句 "What makes you say I can't %2?", "I probably could if I wanted to, don't you think?" ), ), (r"ye[as] [iI] (.*)", ("You %1? How did that happen?", "Why did you %1?", "I %1 too.")), ( r"do (you|u) (.*)\??", ("Do I %2? Sometimes, depending on the situation.", "I'm not sure. Do you %2?"), ), ( r"(.*)\?", ( "I'm curious why you asked that.", # 移除负面词汇"boring" "That's an interesting question.", ), ), ( r"(cos|because) (.*)", ("I see, that makes sense.", "That's a good reason.", "I understand."), ), ( r"why can\'t [iI] (.*)", ( "I'm not sure why you can't %1.", "Have you tried different approaches?", "When I can't do something, I usually practice more." ), ), ( r"I can\'t (.*)", ( "Why do you think you can't %1?", "That's okay, we all have limitations.", "Maybe with practice you could do it." ), ), ( r"(.*) (like|love|watch) anime", ( "I enjoy anime too. Do you have a favorite series?", # 移除夸张表达 "Anime is an interesting art form.", "What do you like most about anime?" ), ), ( r"I (like|love|watch|play) (.*)", ("That's nice. %2 can be enjoyable.", "Do you have other interests too?"), ), ( r"anime sucks|(.*) (hate|detest) anime", ( "Everyone has different tastes in entertainment.", "What kind of shows do you prefer instead?", ), ), ( r"(are|r) (you|u) (.*)", ("Why do you ask if I'm %3?", "What makes you wonder about that?"), ), ( r"what (.*)", ("I'm not sure about that.", "Could you tell me more about your question?"), ), (r"how (.*)", ("I'd prefer to talk about something else.",)), (r"(hi|hello|hey) (.*)", ("Hello! How are you today?",)), ( r"quit", ( "Goodbye! It was nice talking with you.", # 移除戏剧化表达 "Take care. Hope we can chat again sometime.", ), ), ( r"(.*)", ( "Could you tell me more about that?", "What are your thoughts on this topic?", "Do you enjoy any particular hobbies?", "I'm interested in your perspective." ), ), ) iesha_chatbot = Chat(pairs, reflections) def iesha_chat(): print("Iesha the Normal Chatbot\n---------") # 修改标题 print("Talk to the program by typing in plain English.") print('Enter "quit" when done.') print("=" * 72) print("Hello! I'm Iesha. What's your name?") # 标准化问候语 iesha_chatbot.converse() # 其余代码保持不变... 把她的对话模板变得更复杂
09-28
# Natural Language Toolkit: Teen Chatbot # # Copyright (C) 2001-2024 NLTK Project # Author: Selina Dennis <sjmd@csse.unimelb.edu.au> # URL: <https://www.nltk.org/> # For license information, see LICENSE.TXT """ This chatbot is a tongue-in-cheek take on the average teen anime junky that frequents YahooMessenger or MSNM. All spelling mistakes and flawed grammar are intentional. """ from nltk.chat.util import Chat reflections = { "am": "r", "was": "were", "i": "u", "i'd": "u'd", "i've": "u'v", "ive": "u'v", "i'll": "u'll", "my": "ur", "are": "am", "you're": "im", "you've": "ive", "you'll": "i'll", "your": "my", "yours": "mine", "you": "me", "u": "me", "ur": "my", "urs": "mine", "me": "u", } # Note: %1/2/etc are used without spaces prior as the chat bot seems # to add a superfluous space when matching. pairs = ( ( r"I\'m (.*)", ( "ur%1?? that's so cool! kekekekeke ^_^ tell me more!", "ur%1? neat!! kekeke >_<", ), ), ( r"(.*) don\'t you (.*)", ( r"u think I can%2??! really?? kekeke \<_\<", "what do u mean%2??!", "i could if i wanted, don't you think!! kekeke", ), ), (r"ye[as] [iI] (.*)", ("u%1? cool!! how?", "how come u%1??", "u%1? so do i!!")), ( r"do (you|u) (.*)\??", ("do i%2? only on tuesdays! kekeke *_*", "i dunno! do u%2??"), ), ( r"(.*)\?", ( "man u ask lots of questions!", "booooring! how old r u??", "boooooring!! ur not very fun", ), ), ( r"(cos|because) (.*)", ("hee! i don't believe u! >_<", "nuh-uh! >_<", "ooooh i agree!"), ), ( r"why can\'t [iI] (.*)", ( "i dunno! y u askin me for!", "try harder, silly! hee! ^_^", "i dunno! but when i can't%1 i jump up and down!", ), ), ( r"I can\'t (.*)", ( "u can't what??! >_<", "that's ok! i can't%1 either! kekekekeke ^_^", "try harder, silly! hee! ^&^", ), ), ( r"(.*) (like|love|watch) anime", ( "omg i love anime!! do u like sailor moon??! ^&^", "anime yay! anime rocks sooooo much!", "oooh anime! i love anime more than anything!", "anime is the bestest evar! evangelion is the best!", "hee anime is the best! do you have ur fav??", ), ), ( r"I (like|love|watch|play) (.*)", ("yay! %2 rocks!", "yay! %2 is neat!", "cool! do u like other stuff?? ^_^"), ), ( r"anime sucks|(.*) (hate|detest) anime", ( "ur a liar! i'm not gonna talk to u nemore if u h8 anime *;*", "no way! anime is the best ever!", "nuh-uh, anime is the best!", ), ), ( r"(are|r) (you|u) (.*)", ("am i%1??! how come u ask that!", "maybe! y shud i tell u?? kekeke >_>"), ), ( r"what (.*)", ("hee u think im gonna tell u? .v.", "booooooooring! ask me somethin else!"), ), (r"how (.*)", ("not tellin!! kekekekekeke ^_^",)), (r"(hi|hello|hey) (.*)", ("hi!!! how r u!!",)), ( r"quit", ( "mom says i have to go eat dinner now :,( bye!!", "awww u have to go?? see u next time!!", "how to see u again soon! ^_^", ), ), ( r"(.*)", ( "ur funny! kekeke", "boooooring! talk about something else! tell me wat u like!", "do u like anime??", "do u watch anime? i like sailor moon! ^_^", "i wish i was a kitty!! kekekeke ^_^", ), ), ) iesha_chatbot = Chat(pairs, reflections) def iesha_chat(): print("Iesha the TeenBoT\n---------") print("Talk to the program by typing in plain English, using normal upper-") print('and lower-case letters and punctuation. Enter "quit" when done.') print("=" * 72) print("hi!! i'm iesha! who r u??!") iesha_chatbot.converse() def demo(): iesha_chat() if __name__ == "__main__": demo() 把她的说话风格变得和正常人一样
09-28
F. Ranking PredictionYou and your teammates have just finished an ICPC competition. Five hours of competition have drained your energy, and your teammate has eaten your lunch. Now you can only lean on the desk and look at the ranking board. The award ceremony has not yet taken place, so the ranking is still frozen, meaning that you know the submission times and whether your team passed during the entire competition, but for other teams, you know the time of each submission they made, and you know whether each submission was accepted before the ranking was frozen, but you do not know whether the submissions made after the ranking was frozen were accepted. When you check the ranking, you notice a team you are very concerned about. You know the time and status of each submission they made before the ranking was frozen, as well as the times of each submission made after the ranking was frozen. You want to know whether their team's ranking will be strictly higher than your team's. To determine the possibility of their ranking being strictly higher than yours, you also want to know the minimum number of problems they need to solve after the ranking is frozen. In ICPC competitions, the penalty time is calculated according to the following rules. Suppose a team solved m m problems, numbered from 1 1 to m m. For each solved problem i i, let the time of the first accepted submission be t i t i ​ , and the number of submissions before solving this problem be c i c i ​ . The penalty time p p is calculated as follows: p = ∑ i = 1 m t i + 20 ⋅ c i p= i=1 ∑ m ​ t i ​ +20⋅c i ​ In this problem, special factors such as compile errors that do not count towards penalty time are not considered. For two teams A A and B B, team A A is said to have a strictly higher ranking than team B B if and only if the number of problems solved by A A is greater than that solved by B B, or if the number of problems solved by A A and B B is equal, and the penalty time of A A is less than that of B B. Input The first line contains an integer T T ( 1 ≤ T ≤ 100 1≤T≤100), indicating the number of test cases. For each test case, the first line contains three integers n , a , b n,a,b ( 10 ≤ n ≤ 15 , 1 ≤ a ≤ n , 0 ≤ b ≤ 10 5 10≤n≤15,1≤a≤n,0≤b≤10 5 ), representing that there are n n problems in the competition, your team solved a a problems by the end of the competition, and the penalty time is b b. The second line contains an integer s s ( 0 ≤ s ≤ 10 3 0≤s≤10 3 ), indicating the number of submissions made by the team you are concerned about during the normal competition. The next s s lines each contain an integer followed by two strings t , p , v t,p,v ( 0 ≤ t < 300 0≤t<300). This indicates that at minute t t, a submission was made for problem p p, and the result was v v. It is guaranteed that submissions are given in chronological order (this means that when t t is the same, the submit order is the order given by the input), p p is one of the first n n uppercase letters, and v ∈ { ac , rj , pd } v∈{ac,rj,pd}. ac means this submission was accepted, rj means the submission was rejected, and pd means this submission is in a frozen ranking state, and it is unknown whether this submission was accepted. It is guaranteed that when t < 240 t<240, v v is not pd, and when t ≥ 240 t≥240, v v is guaranteed to be pd. Output For each test case, output a single integer on a new line. If it is impossible for the team you are concerned about to have a final ranking strictly higher than your team, output − 1 −1; otherwise, output the minimum number of problems they need to solve after the ranking is frozen for their final ranking to be strictly higher than yours. Examples Inputcopy Outputcopy 1 11 6 900 13 11 C ac 34 J ac 52 D rj 61 D ac 193 A rj 207 A rj 220 G ac 245 A pd 247 A pd 262 H pd 299 A pd 299 C pd 299 K pd
07-22
潮汐研究作为海洋科学的关键分支,融合了物理海洋学、地理信息系统及水利工程等多领域知识。TMD2.05.zip是一套基于MATLAB环境开发的潮汐专用分析工具集,为科研人员与工程实践者提供系统化的潮汐建模与计算支持。该工具箱通过模块化设计实现了两大核心功能: 在交互界面设计方面,工具箱构建了图形化操作环境,有效降低了非专业用户的操作门槛。通过预设参数输入模块(涵盖地理坐标、时间序列、测站数据等),用户可自主配置模型运行条件。界面集成数据加载、参数调整、可视化呈现及流程控制等标准化组件,将复杂的数值运算过程转化为可交互的操作流程。 在潮汐预测模块中,工具箱整合了谐波分解法与潮流要素解析法等数学模型。这些算法能够解构潮汐观测数据,识别关键影响要素(包括K1、O1、M2等核心分潮),并生成不同时间尺度的潮汐预报。基于这些模型,研究者可精准推算特定海域的潮位变化周期与振幅特征,为海洋工程建设、港湾规划设计及海洋生态研究提供定量依据。 该工具集在实践中的应用方向包括: - **潮汐动力解析**:通过多站点观测数据比对,揭示区域主导潮汐成分的时空分布规律 - **数值模型构建**:基于历史观测序列建立潮汐动力学模型,实现潮汐现象的数字化重构与预测 - **工程影响量化**:在海岸开发项目中评估人工构筑物对自然潮汐节律的扰动效应 - **极端事件模拟**:建立风暴潮与天文潮耦合模型,提升海洋灾害预警的时空精度 工具箱以"TMD"为主程序包,内含完整的函数库与示例脚本。用户部署后可通过MATLAB平台调用相关模块,参照技术文档完成全流程操作。这套工具集将专业计算能力与人性化操作界面有机结合,形成了从数据输入到成果输出的完整研究链条,显著提升了潮汐研究的工程适用性与科研效率。 资源来源于网络分享,仅用于学习交流使用,请勿用于商业,如有侵权请联系我删除!
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值