[Our Story] Part Part Three : 2001-11-10

2001年的一次宁波出差,让作者与一位女孩在名典咖啡相遇。通过一次晚餐和天一阁之旅,两人逐渐拉近了距离。这段经历充满了偶然与美好,成为了他们爱情故事的起点。

Part Three

2001-11-10

Ochre Pebble Posters

In life there are very rare chances that

you’ll meet the person you love and loves you in return.

So once you have it, don’t ever let go,

The chance might never come your way again.

生活中

遇到你爱的并且爱你的人并不容易.

因而,一旦遇到了,请一定要珍惜,

这样的机会不可能有第二次.

---Five Simple Rules


我喜欢听音乐,比如CountryJazz等,尤其喜欢Blues。所以我比较喜欢去coffee bar。因为在那里可以边听音乐,边看看书。在出差途中,我最爱的就是下午去coffee bar边喝咖啡边看书的那些时光,不管是到哪个地方出差,都会先打探到喝咖啡的地点,之后就会找机会去光顾了。其实我有四个爱好,旅游、读书、音乐、以及喝咖啡。而出差正好可以很好的把我的这几个爱好一一满足,所以,那个时候过的很是快乐,对出差似乎也是乐此不疲。有时候晚上加班完毕还去咖啡厅坐坐,喝杯咖啡再回宾馆。

记得有一次在电梯旁,我们俩共同等电梯,我刚好背了个双肩背包,竟然被她误会我还是个学生,呵呵。

在宁波出差的时间过的很快,到8号我就把项目该作的事都做完了,和L交接过后,我就通知客户准备回广州。

如果一切就这样发生的话,那么我们也许永远不会像现在这样在一起了,而那些日子应该就作为一个美好的回忆记在心里而已,因为我当时也不知道是否还会再来。

然而,或许上天愿意给我这个机会,那天刚好她过来L这边来找咖啡,而我刚好正在那里坐着,也在收拾东西,因此很自然的就聊了起来。

我想我当时还是抓住了这次机会,开口邀请她晚上一起去咖啡厅共进晚餐,其实我当时是完全不知道她是否会答应的,但是这次的尝试终于让我有机会和她一起单独相处了,不管接下来结局会如何,至少这会是一个很好的回忆片断。

让我暗自高兴的是,她竟然答应了。现在想来,她当时肯定是不好意思拒绝而已,既然以后再也不会见面,作为礼貌,似乎一起吃个饭也不算过分要求。

我到现在还记得我们第一次一起共进晚餐时坐的那个位置,中山路上名典咖啡里直接对着楼梯的那个摇椅,在楼梯转弯处,应该算是0.5楼吧,我正对门,她背对门。那个名典我之前已经去过好几回了,有时候是去喝咖啡,有时候是去吃晚餐,主要是喜欢那里的环境,比较幽静,不吵闹。有一回还是晚上加完班去的,感觉还是很棒的。

我们吃完晚饭之后出来,经过久久天桥的时候,竟然被一个卖花的小女孩盯上了,一直缠这我要买一支花送给她。不管我怎么解释说我们还不是情侣,那个小女孩似乎都不放弃,到最后干脆就直接抱着我的脚,不让走。其实以我的性格,给自己女朋友买玫瑰花是很应该的,问题就是我们还没进展到那么快,我还是不方便直接送花的。但是最终我还是买了一支玫瑰花送给她,她也只好接收。看来她似乎真的不善于拒绝别人,而我,正要感谢她的这个不善于的拒绝别人的弱点,呵呵。

第二天,我本打算回广州,然而临时觉得去游玩下宁波,请她做我的向导。之所以会这样一部分是由于我本喜欢旅游,另外就是以此为借口,可以和她相处时间多些。因为当时并不清楚以后会怎样,所以能做的就是和喜欢的人多呆一会罢了,也许以后就永远不会再来宁波呢,未来当时完全未知。而她也没拒绝当我的向导,一切都是源于她不善于拒绝别人,然而这却成就了我们的爱情,这个世界真是很奇妙。

我很大程度上是个理想主义者,不是现实主义者,凡事总是喜欢加上个浪漫的理由,因此每当她问起我为什么我们会在一起,我为什么会这么远找到她的时候,我总是说我三岁半(因为我比她大三岁半)就知道你在这里,我们从那个时候就注定要在一起。这当然是无法当真的玩笑话,然而客观上来说,如果没有名典咖啡的那次晚餐和这次的天一阁之旅,我想我应该不会那么巧的认识到这个女孩就是我要找的人。

第二天我们去天一阁了,记得当时来宾馆的时候还不是她一个人,我当时可是有点晕,心里想的本来是想两个人单独一起去的,现在看来是要落空了,我总不能那么明目张胆的说只要她一个人陪我去吧,幸运的是她那些同事只是顺便过来,去天一阁仍然只有她一个人做我的向导。

我们从宾馆出发到天一阁去,到了月湖边的一个十字路口时碰上红灯,我们就站在那里等着,绿灯亮时,我就顺势牵着她的手一起过马路,似乎这样就可以保护她安全过马路的,然而过了马路之后我就没放手,呵呵,幸亏她不善于拒绝别人,我就一直这样牵着她的手游完天一阁,我想天一阁守门的人肯定以为我们是一对情侣了,或许是有点紧张,我们在天一阁参观时,我竟然还一头撞到玻璃上,所幸那个玻璃还是很牢固的,没有撞坏,我的额头倒是有点疼。

我还清晰的记得当时牵她手的感觉,忐忑并兴奋着,截然不同的两种感觉交织着,心里着实比较开心,但是脸上却不方便表现的过分明显,害怕一旦喜形于色,被发觉后她马上就把手抽出去了,那可是要遗憾了。

当晚我们约定好看电影,算是弥补昨晚未实现的愿望,所以她在吃完饭之后再出来(因为她爸妈要求她回家吃饭)。当日在影都放映的电影中,大片都已经看过了了,所以我们只好挑了一部青春爱情剧,其实对我来说,那个时候看什么电影似乎不重要,重要的是和她一起看电影,呵呵。看完电影之后,我们一路从电影院走到她家楼下,似乎时间很短,没走多久就到了。其实现在去看看那段距离,我们俩肯定是要坐公交车或打车了,然而当时却是不一样的感觉。

2001年我和同学去过一次南岳衡山,在从祝融峰返回山下的途中,我买了一个月亮石作为纪念,这是我一贯的风格,每次到一个地方,都喜欢买一些特别的东西作为留念。当时我把它系在我的旅行包上,上面还别了我到庐山和韶山的纪念章。

当晚我说好把这个月亮石送给它作为纪念,然而看完电影后我们竟然都忘了。岂知,“塞翁失马,焉知非福”,正是这个小小的疏忽,冥冥中竟让我们又多了一次见面的机会。

第二天正是2001年11月10日,我们约定在宾馆里见面,我把月亮石送给她,她也送了一张她的照片给我,这张照片后来被一直放在我的钱包里,历时四年,直到后来她拍了另外一张照片,我才把她换了下来。不过据后来所知,当她把送照片给我的事和她的同事讲的时候,同事们一致认为她似乎做的不够谨慎,第一见面怎么能轻易送照片呢,很容易给人误会的,:-(

后来我们一起乘出租车去宁波栎社机场,我们一起慢慢聊天,直到我应该换登机牌进候机厅了,我才把她又送到出租车候车处,临分手时,我们紧紧拥抱了,然后我就看着那辆出租车载着她渐渐远去。

那个时候我用的是移动的号码,她用的是联通的号码,所以在看不见她之后,我却也没办法发短信给她,因为那个时候移动和联通还是不能互通的。

当飞机载着我缓缓降落在广州白云机场的时候,我的心仍然还在宁波,我知道,从那个时候开始,我就注定要从此和这里关联起来,因为,就是在这里,有一个我喜欢的女孩。

而将这一切变成现实的,正是我一直在寻找的缘分。

-- to be continued

[@more@]

来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/8454401/viewspace-890743/,如需转载,请注明出处,否则将追究法律责任。

转载于:http://blog.itpub.net/8454401/viewspace-890743/

独立储能的现货电能量与调频辅助服务市场出清协调机制(Matlab代码实现)内容概要:本文围绕“独立储能的现货电能量与调频辅助服务市场出清协调机制”展开,提出了一种基于Matlab代码实现的优化模型,旨在协调独立储能系统在电力现货市场与调频辅助服务市场中的联合出清问题。文中结合鲁棒优化、大M法和C&CG算法处理不确定性因素,构建了多市场耦合的双层或两阶段优化框架,实现了储能资源在能量市场和辅助服务市场间的最优分配。研究涵盖了市场出清机制设计、储能运行策略建模、不确定性建模及求解算法实现,并通过Matlab仿真验证了所提方法的有效性和经济性。; 适合人群:具备一定电力系统基础知识和Matlab编程能力的研究生、科研人员及从事电力市场、储能调度相关工作的工程技术人员。; 使用场景及目标:①用于研究独立储能在多电力市场环境下的协同优化运行机制;②支撑电力市场机制设计、储能参与市场的竞价策略分析及政策仿真;③为学术论文复现、课题研究和技术开发提供可运行的代码参考。; 阅读建议:建议读者结合文档中提供的Matlab代码与算法原理同步学习,重点关注模型构建逻辑、不确定性处理方式及C&CG算法的具体实现步骤,宜在掌握基础优化理论的前提下进行深入研读与仿真调试。
Chapter 4: Processor Architecture. This chapter covers basic combinational and sequential logic elements, and then shows how these elements can be combined in a datapath that executes a simplified subset of the x86-64 instruction set called “Y86-64.” We begin with the design of a single-cycle datapath. This design is conceptually very simple, but it would not be very fast. We then introduce pipelining, where the different steps required to process an instruction are implemented as separate stages. At any given time, each stage can work on a different instruction. Our five-stage processor pipeline is much more realistic. The control logic for the processor designs is described using a simple hardware description language called HCL. Hardware designs written in HCL can be compiled and linked into simulators provided with the textbook, and they can be used to generate Verilog descriptions suitable for synthesis into working hardware. Chapter 5: Optimizing Program Performance. This chapter introduces a number of techniques for improving code performance, with the idea being that programmers learn to write their C code in such a way that a compiler can then generate efficient machine code. We start with transformations that reduce the work to be done by a program and hence should be standard practice when writing any program for any machine. We then progress to transformations that enhance the degree of instruction-level parallelism in the generated machine code, thereby improving their performance on modern “superscalar” processors. To motivate these transformations, we introduce a simple operational model of how modern out-of-order processors work, and show how to measure the potential performance of a program in terms of the critical paths through a graphical representation of a program. You will be surprised how much you can speed up a program by simple transformations of the C code. Bryant & O’Hallaron fourth pages 2015/1/28 12:22 p. xxiii (front) Windfall Software, PCA ZzTEX 16.2 xxiv Preface Chapter 6: The Memory Hierarchy. The memory system is one of the most visible parts of a computer system to application programmers. To this point, you have relied on a conceptual model of the memory system as a linear array with uniform access times. In practice, a memory system is a hierarchy of storage devices with different capacities, costs, and access times. We cover the different types of RAM and ROM memories and the geometry and organization of magnetic-disk and solid state drives. We describe how these storage devices are arranged in a hierarchy. We show how this hierarchy is made possible by locality of reference. We make these ideas concrete by introducing a unique view of a memory system as a “memory mountain” with ridges of temporal locality and slopes of spatial locality. Finally, we show you how to improve the performance of application programs by improving their temporal and spatial locality. Chapter 7: Linking. This chapter covers both static and dynamic linking, including the ideas of relocatable and executable object files, symbol resolution, relocation, static libraries, shared object libraries, position-independent code, and library interpositioning. Linking is not covered in most systems texts, but we cover it for two reasons. First, some of the most confusing errors that programmers can encounter are related to glitches during linking, especially for large software packages. Second, the object files produced by linkers are tied to concepts such as loading, virtual memory, and memory mapping. Chapter 8: Exceptional Control Flow. In this part of the presentation, we step beyond the single-program model by introducing the general concept of exceptional control flow (i.e., changes in control flow that are outside the normal branches and procedure calls). We cover examples of exceptional control flow that exist at all levels of the system, from low-level hardware exceptions and interrupts, to context switches between concurrent processes, to abrupt changes in control flow caused by the receipt of Linux signals, to the nonlocal jumps in C that break the stack discipline. This is the part of the book where we introduce the fundamental idea of a process, an abstraction of an executing program. You will learn how processes work and how they can be created and manipulated from application programs. We show how application programmers can make use of multiple processes via Linux system calls. When you finish this chapter, you will be able to write a simple Linux shell with job control. It is also your first introduction to the nondeterministic behavior that arises with concurrent program execution. Chapter 9: Virtual Memory. Our presentation of the virtual memory system seeks to give some understanding of how it works and its characteristics. We want you to know how it is that the different simultaneous processes can each use an identical range of addresses, sharing some pages but having individual copies of others. We also cover issues involved in managing and manipulating virtual memory. In particular, we cover the operation of storage allocators such as the standard-library malloc and free operations. CovBryant & O’Hallaron fourth pages 2015/1/28 12:22 p. xxiv (front) Windfall Software, PCA ZzTEX 16.2 Preface xxv ering this material serves several purposes. It reinforces the concept that the virtual memory space is just an array of bytes that the program can subdivide into different storage units. It helps you understand the effects of programs containing memory referencing errors such as storage leaks and invalid pointer references. Finally, many application programmers write their own storage allocators optimized toward the needs and characteristics of the application. This chapter, more than any other, demonstrates the benefit of covering both the hardware and the software aspects of computer systems in a unified way. Traditional computer architecture and operating systems texts present only part of the virtual memory story. Chapter 10: System-Level I/O. We cover the basic concepts of Unix I/O such as files and descriptors. We describe how files are shared, how I/O redirection works, and how to access file metadata. We also develop a robust buffered I/O package that deals correctly with a curious behavior known as short counts, where the library function reads only part of the input data. We cover the C standard I/O library and its relationship to Linux I/O, focusing on limitations of standard I/O that make it unsuitable for network programming. In general, the topics covered in this chapter are building blocks for the next two chapters on network and concurrent programming. Chapter 11: Network Programming. Networks are interesting I/O devices to program, tying together many of the ideas that we study earlier in the text, such as processes, signals, byte ordering, memory mapping, and dynamic storage allocation. Network programs also provide a compelling context for concurrency, which is the topic of the next chapter. This chapter is a thin slice through network programming that gets you to the point where you can write a simple Web server. We cover the client-server model that underlies all network applications. We present a programmer’s view of the Internet and show how to write Internet clients and servers using the sockets interface. Finally, we introduce HTTP and develop a simple iterative Web server. Chapter 12: Concurrent Programming. This chapter introduces concurrent programming using Internet server design as the running motivational example. We compare and contrast the three basic mechanisms for writing concurrent programs—processes, I/O multiplexing, and threads—and show how to use them to build concurrent Internet servers. We cover basic principles of synchronization using P and V semaphore operations, thread safety and reentrancy, race conditions, and deadlocks. Writing concurrent code is essential for most server applications. We also describe the use of thread-level programming to express parallelism in an application program, enabling faster execution on multi-core processors. Getting all of the cores working on a single computational problem requires a careful coordination of the concurrent threads, both for correctness and to achieve high performance翻译以上英文为中文
08-05
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符  | 博主筛选后可见
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值