Global Routing for Three Dimensional Packaging
Global Routing for Three Dimensional Packaging
Jacob R. Minz and Sung Kyu Lim
School of Electrical and Computer Engineering
Georgia Institute of Technology, Atlanta, GA 30332-0250
{jrminz,limsk}@https://www.wendangku.net/doc/b1738595.html,
ABSTRACT
Three dimensional packaging is becoming a popular concept because of the numerous advantages it has to offer over the existing conventional technologies. System on Packages (SOP) is an example of three dimensional packaging. The contribution of this work is threefold: (i) formulation of the new 3-dimensional global routing problem, (ii) a new routing flow that considers the various design constraints unique to SOP , and (iii) a global router for the technology. Our related experimental results demonstrate the effectiveness of our algorithm .
1. INTRODUCTION
The true potential of SOP technology lies in its capability to integrate both active components such as digital IC, analog ICs, memory modules, MEMS, and opto-electronic modules, and passive components such as capacitors, resistors, and inductors all into a single high speed/density multi-layer packaging substrate. Since both the active and passive components are integrated into the multi-layer substrate, SOP offers a highly advanced three-dimensional mixed-signal system integration environment. Three-dimensional SOP packaging offers significant performance benefits over the traditional two-dimensional packaging such as PCB and MCM due to the electrical and mechanical properties arising from the new geometrical arrangement as illustrated in Figure 1. Thus, innovative ideas in the development of CAD tools for multi-layer SOP technology is crucial to fully exploit the potential of this new emerging technology.
The physical layout resource of SOP is multi-layer in nature—the top layer is mainly used to accommodate active components, the middle layers are mainly for passive components, and the I/O pins are located at the bottom of the SOP package. Routing layers are inserted in between these floorplan layers, and the floorplan layers can be used for local routing as well. Therefore, all layers are used for both floorplan and routing and pins are now located at all layers rather than the top-most layer only as in PCB or MCM. Therefore, the existing routing tools for PCB or MCM [4,5] can not be used directly for SOP routing.
In this paper, we propose a new interconnect-centric global routing paradigm that handles arbitrary routing topologies and produces good results. The contribution of this work is threefold: (i) modeling of the SOP routing resource, (ii) formulation of the new SOP global routing problem, and (iii) development of a fast and novel algorithm that considers the various design constraints unique to SOP. We review various approaches for the PCB, IC and MCM algorithms and investigate their applicability to the SOP model. Our related experimental results demonstrate the effectiveness of our approach.
2. SOP GLOBAL ROUTING PROBLEM
2.1 Routing Resource Model
The layer structure in SOP is different from PCB or MCM—it has multiple floorplan layers and routing layers. It has one I/O pin layer through which various components can be connected to the external pins. The floorplan layers
contain the blocks, Figure 1. Single active layer (PCB,MCM) vs multiple active
layer (SOP) packaging.
which from the point of view of physical design is just a geometrical object with pins. In some cases where these blocks are a collection of cells, the pins may not be assigned and pin assignment needs to be done to determine their exact location. The interval between two floorplan layers is called the routing interval . The routing interval contains a stack of signal routing layers sandwiched between pin distribution layers . These layers are actually X-Y routing layer pairs, so that the rectilinear partial net topologies may be assigned to it. We also allow routing to be done in the pin distribution layers.
We model the floorplan layer in the SOP as a floor connection graph [2]. The routing layer is modeled as a uniform grid graph. These two kinds of graphs are connected through via edges. The advantage of our graph-based routing resource model is that we can consider layer/pin assignment and global routing simultaneously. We model the blocks in the floorplan as Block Nodes (BN). The nets can cross over to the adjacent routing layers only through the regions in the channel. The channel itself is represented by Channel Nodes (CN). The actual blocks form blockages for the nets, which cannot be routed through them. The nets can switch from floorplan layer to the routing layer only through designated regions which are represented as Layer-switch Nodes (LN) in the resource graph. The LN in this case is simply four corners of the blocks. They denote regions rather than points through which nets will traverse to adjacent routing intervals. The routing layers are represented by a grid graph, each node specifying a region in the layer and edges representing the adjacency between regions. These nodes are called Routing Nodes (RN). The concepts are illustrated in Figure 2, which shows the various views and types of nodes used in SOP.
The edges between channel nodes and block nodes are called Pin Assignment Edges (PE). This makes it possible to perform pin assignment during global routing. The pin assignment capacity is the maximum number of pins which can be assigned towards a particular channel. The edges between layer switch node and routing node is defined as Via Edges (VE). The capacity of this edge is the maximum number of nets which can cross between two regions in the two layers. The via edges also exist between two adjacent routing layers (actually layer pairs). The edges between routing nodes are Routing Edges (RE). The routing edge capacity is the number of nets which can pass through the routing regions.
2.2 Global Routing Problem Formulation
We define the SOP global routing problem formally as follows: Given a set of floorplans F ={f 1,f 2,…,f k }, netlist N ={n 1,n 2,…,n n }, and the routing resource graph, generate the routing topology T (n ) for each net n , assign n to a set of routing layers and assign all pins of n to legal locations. All conflicting nets are assigned to different routing layers while satisfying various capacity constraints. The objective is to minimize the total number of routing layers used, wirelength, and crosstalk . In the SOP model the nets are classified into two categories. The nets which have all their terminals in the same floorplan are called i-nets, while the ones having terminal in different floorplans will be referred to as x-nets. The i-nets can be routed in the single routing interval or indeed within the floorplan layer itself. However, for high performance designs routing such nets in the routing interval immediately above or below the floorplan layer maybe desirable and even required. On the other hand, the x-nets may span more than one routing intervals. The only case where one routing interval may suffice is when the terminals of the net are located in either of the floorplans immediately above or below the routing interval. The span of a net
[l , h ] is determined by the lowest floorplan f l and the highest floorplan f h containing pins of the net. If l and h are equal for a particular net, the net is i-net else the net is x-net.
3. SOP GLOBAL ROUTING ALGORITHMS
3.1. Overview of the Algorithm
Our SOP router is multi-phased, where we divide the routing process into (1) coarse pin distribution, (2) net distribution, (3)
detailed pin distribution, (4) topology generation, (5) 2D layer assignment, (6) channel assignment, and (7) pin assignment
Figure 2. The floorplan and the layer view of the resource
graph with node and edge types. Double circle, square, black
dot, and white dot respectively denote the layer switch, block,
channel, and routing nodes .
step. An illustration is shown in Figure 3. By following these steps we seek to have enough and acceptably accurate information for each routing interval to carry out “local” global routing efficiently. We introduce the terms entry/exit pins to better explain our approach. Since the connections of some nets (x-nets) span multiple placement layers, we need to determine the location of entry to and exit from the routing interval. In the 2-D refinement of the problem we treat this location as pins. The routing of i-nets deserves special attention. In routing intervals, except the first and last ones, we have the choice of placing those i-nets in a routing interval either on top or bottom of the floorplan. The objective is to minimize crosstalk and congestion in the routing interval. This step is called net distribution .
The pin information of the nets is required for efficient net distribution, but net distribution decides the number of pins (and their locations) at each routing interval. We solve this by using the results of Coarse Pin Distribution for net distribution. Pins in all routing interval are projected to a single 2-D area and partitioning evenly distributes them over it. The pins in different routing intervals may not be evenly distributed locally. After net distribution we do Detailed Pin Distribution on each routing interval to minimize the estimated wirelength and legalize pin locations. After this step we have all the information needed for global routing in the routing interval. The topology of each net is generated during our Topology Generation , and 2-D Layer Assignment assigns different layer to conflicting nets. The Channel Assignment problem is to assign each pin in the pin distribution layers to a channel in the floorplan layers such that the routing layers and interconnect costs are minimized. The objective is to facilitate an efficient pin distribution on pin distribution layer with only minimal additional costs. The purpose of Pin Assignment is to assign a location to the pin on the block boundary on the floorplan layer while minimizing the connections between the pin and its “peer” on the channel, which was found out in the previous step. The peer is location in the floorplan which connects the net to rest of its interconnect in the routing layers. Figure 3 illustrates the main ideas of the algorithm.
3.2 SOP Global Routing Algorithm
The nets may be provided as connections between blocks in which case we may have to do pin assignment on the blocks. Pin distribution can be done irrespective of whether or not pins have been assigned on the block because all that is relevant to the problem at hand is the entry/exit points to the routing interval. This is done as soon as the pins are generated. For the purpose of the algorithm we define two types of nets, current and propagated nets. We visit the floorplans from the lowest to the highest level, in other words we consider the routing intervals sequentially from lowest to highest. The current nets are those which will be considered for layer assignment in the current routing interval. The current routing interval is the one Figure 3. Overview of the global routing process. 1=pin distribution, 2=net distribution, 3=topology
generation, 4=layer assignment, 5=channel assignment, 6=pin assignment.
currently processed by the algorithm. The propagated nets are nets “passed on” from this interval to be considered in the next routing interval. For example x-nets will be propagated from its lowest level to the highest and will also be the current net for all the routing intervals in between. This is because we consider only a part (segment) of the x-net for routing in a particular routing interval (x-nets span multiple routing intervals). In the case of i-nets, the net is either current or propagated. This is found out by net distribution. The propagated nets form a subset of the nets to be routed in the next routing interval to be processed, since some i-nets may be included in the next routing interval. 2-D global routing simultaneously with layer minimization is done for each routing intervals. Channel assignment connects pins from the routing interval to the placement layers on allowed spots. Pin assignment connects the blocks to the corresponding vias in the channel with minimum interconnection costs. The last two steps are done once for each placement layers.
3.3 Summary of Our Recent Work
We recently have implemented the Coarse Pin Distribution and 2-D Layer Assignment [6] and Net and Pin Distribution [7] for 3D packaging layout. For topology generation, we have used an existing RSA/G heuristic [3] to generate the net topologies at each routing interval, since it is fast and simple. The minimum arborescence is a good representative for the topology of a net in a high performance design.
Coarse Pin Distribution: In this step, we generate coarse locations for all pins of the nets in the routing interval. For the purpose of pin distribution we “flatten” the 3-D SOP structure to 2-D and superimpose a AxB grid on it, were A and B are determined by the size of the circuit. We use our partitioning algorithm [8] to evenly distribute pins to all the partitions formed by this grid while keeping the wirelength minimum. Evenly distributing the pins among all partitions ensures efficient use of the routing resource provided by the single layer. The “coarse” location is the centre of the partition. After the partitioning the pins may not be uniformly distributed in the local routing interval. This partitioning algorithm is smart enough not to move the pins far from their “initial” locations. The algorithm does iterative improvement until good results are obtained.
2-D Layer Assignment:We construct a Layer Constraint Graph (LCG) from the given global routing topology, where each node represents a net and two nodes in the LCG have an edge between them if corresponding net segments of same orientation (horizontal or vertical) share at least one tile in the routing grid. We use a fast node coloring heuristic algorithm to assign a color to the node such that no two nodes sharing an edge are assigned the same color. The algorithm is greedy in assigning colors but performs well and is fast. Close to lower bound results are achieved because the heuristic tries to ensure that nodes with different colors have in fact an edge between them. The complexity of the algorithm is O(n log n), where n is the number of nets in the routing interval. The complexity is independent of the size of the grid used to compute the tree topologies. The capacity of the tiles determines the number of layers used. We use a simple formula to calculate this number (number of colors/capacity).
Net Distribution: Net assignment for some nets is straight forward. When the floorplans are visited bottom to top, all nets having their pins in the lowest floorplan are assigned to the routing interval above it. The nets having pins the top-most floorplan are assigned the routing interval right below it. If the net is an x-net it is propagated through every layer until its topmost floorplan is reached. The net distribution of the i-nets is interesting. The objective of this step is to reduce crosstalk. We use the amount of overlap of bounding boxes of the nets as a measure of crosstalk. The net distribution problem is modeled as a graph with each i-net in the routing interval as node and the crosstalk interaction as edges. The weight of the edges denotes the amount of crosstalk between the nets. The crosstalk is calculated by the overlap of the bounding boxes of the net. The coarse pin distribution is used as the approximate location of the pins. It is assumed that nets in different interval are crosstalk shielded, which means no crosstalk exist between nets in different interval. The problem can then be seen as a restricted graph partitioning problem where some of the nodes can only go to one of two predetermined partitions. In order to achieve better results iterative technique in [8] are used. The complexity of the algorithm is O(V+E) where V is number of nodes and E is the number of edges in the graph model. The results obtained were compared with random net distribution and the case when no i-nets are propagated to other routing intervals.
Detailed Pin Distribution: The purpose of this step is to legalize the location of the pins while respecting the coarse pin assignment and optimizing wirelength. The results of the coarse pin assignment are used for force-directed placement of the pins in the pin distribution layers. Since we did not consider the layer in which the pin was located in the coarse pin redistribution, it may be possible that the pins exceed the capacity of the partitions local to the routing interval. However our algorithm handles this by moving the pins from such location to the closest available position. The pins are placed in locations near the centre of the net. The pins furthest from its center of the net in coarse assignment, gets placed in the best location (location nearest to the center) in the local partition. The algorithm uses the “approximate” position of the pins as
found by coarse pin distribution and the net distribution results to determine the initial location and routing interval of the pin. The position of the pins is stored as the grid location of the coarse pin distribution. The center of each net is calculated from this position of the pins. The displacement vector is calculated by taking the difference of the position of the center of net and the pin. A pair of numbers (a,b) such that 0 3.4. Contribution of this Paper In this section we explain in detail the algorithms used to handle channel assignment and pin assignment in the floorplan layer. The objectives we tried to minimize are the number of additional layers for pin redistribution during channel assignment and the total wirelength during pin assignment. 3.4.1 Channel Assignment The pins in the routing interval have to be connected to their corresponding blocks in the floorplan layer or if no such block exist, to its counterpart pin to the other routing intervals (for x-nets). The pins are connected to the floorplan layer using vias which can only be accommodated in the routing channels. The pins therefore have to be assigned a channel in the floorplan layer. The channel assignment of pins will affect the additional number of layers and total wirelength. Since one desirable objective is to reduce the number of bends (which would necessitate the use of secondary vias), we assume a straight or L-shaped routing of nets to their assigned channel. This reasonable assumption simplifies the evaluation of the wirelengths. We observed that congestion of pin connections and wire crossings on a particular channel would increase the layer count. Our cost model for the problem captures these issues and our algorithm minimizing the cost function, assigns every pin to a channel. For this problem we are given the location of the pins and the location, length, orientation (horizontal or vertical) and via capacities of the channel. We seek to minimize the additional number of layers and wirelength while assigning every pin to a channel. Algorithm: CHLDIST Input: pins, channels Output: channel assignment & number of layers Determine via capacities for each channel. For all pins Find a channel with minimum assignment cost and not violating the constraints. Calculate channel crossings. Update via and routing demands of all channels. Assign this channel to the pin. Calculate and report number of layers. Figure 4. SOP channel assignment algorithm We derive the number of layers as follows. We assume that the channels will only accommodate rectilinear routes perpendicular to their orientation. For example, only vertical routes can terminate at or cross horizontal channels. This is a reasonable assumption because routes can still go parallely over that channel; however they terminate at some other channels. We note that both terminating and crossing routes on the channel affects the routing demands on the channel. The routing demands were classified into left (top) or right (bottom) demands for vertical (horizontal) channels. Let the maximum of the two routing demands divided by the channel capacity be den. Then the number of layers for the channel assignment is given by the maximum density among all channels. The algorithm (Figure 4) for channel assignment assigns channels to the pins based on the costs of channel assignment. The cost is the sum of L-distance between pin and channel, the channel density and the bending penalty, multiplied by constants to reflect the relative importance. However, the constants are finalized by trying different values for a particular benchmark and finalizing it for all experiments. The L-distance and bending penalty between channel and pin is constant part of the cost while the channel density needed to be updated with an assignment. 3.4.2. Pin Assignment The final step in our proposed methodology connects the nets to its “original” terminals. The pin assignment is done entirely in the floorplan layer. Since the connections of the nets are specified by a set of blocks, the location of the terminals on the block boundary is to be determined. The routing channel is used to finish the last connections from the channel pins (determined during channel assignment) to the block. The channel pins are actually the entry/exit points to the routing interval. An interesting aspect of this problem is that complete connections of the blocks and channel pins of a net is not necessary since the channel pins of a net are connected in the routing interval. Hence it suffices if the block is connected to at least one channel pin. This observation reduces the problem to a 2-terminal net pin assignment. We model the floorplan with a Floorplan Connection Graph. The pin is now either a block node or channel node. We use modified Djikstra’s algorithm to find the most feasible coarse location for the terminals on the block boundary. The pseudocode is given in Figure 5. Algorithm: 2PINASSIGN Input: 2-D floorplan, netlist Output: routes and course pin assignment Generate FCG from the floorplan. Generate 2-pin subnets for all nets in this floorplan. Initialize the dynamic cost of the edges. For all 2-pin subnets Find shortest path between source & sink node. Update the cost of edges on the path. Rip-up and reroute when dealing with capacities. Figure 5. SOP pin assignment algorithm The key to efficiently do pin-assignment for 3-D packaging is to have a good 2-pin net generation. The pins which had been projected to routing intervals during pin generation for routing interval now needs to be connected to its originating blocks. However, the pins can also connect to blocks closer to them, which form the part of the same net, if the costs are improved. The edge weights of the FCG derived from the floorplan are initialized. In the proposed solution we try to minimize the demands on routing as well as the pin-assignment edges while determining the path between the source and destination nodes. We force selection of different routes by making the costs of the edges in the path high. This ensures fair usage of resources modeled by the edges. 4. EXPERIMENTAL RESULTS We implemented our algorithm GROUTE in C++/STL and ran experiments on a Dell Dimension 8800 Linux box. Our test cases are generated using our multi-layer SOP floorplanner on GSRC benchmark circuits [9]. The number of layer is fixed to four. Our layer usage results are based on the tile density w=10. The RSA/G-based global routing trees are generated based on 10×10 unless otherwise specified. We ran our algorithms for channel assignment and pin assignment on GSRC benchmarks and measured its solution quality as the values obtained for the various objectives. For our initial experiments, we have not taken the I/O layer into consideration. All the benchmarks completed in less than a few minutes. So we do not explicitly report the runtimes. 4.1. Channel Assignment Results We present the results of our Channel Assignment algorithm in Table 1. In order to compare the quality of the solutions achieved by our channel assignment algorithm, we computed the best possible wirelength for a channel assignment where via capacity violations were allowed. We tabulate the results of this scheme under the best wirelength. We compare the results of our algorithm with the best wirelength results for the number of layer pairs, wirelength, bends and number of pins violating channel via capacities. Our inferences based on the experimental results are: 1.In channel assignment, we are close to the number of layers predicted by the best case. The increase in layers is due to increased routing density on the channels. The ratios of actual wirelength with best wirelengths increase with the size of benchmarks. 2.The violations in the best case and the number of bends reported by our algorithm are very close, suggesting that violations were fixed by bending the interconnections. 4.2 Pin Distribution Results In Table 2 we report the wirelength achieved during pin assignment. The result of the channel assignment is used as input to the pin assignment. For generating the best wirelength, we used the corresponding best wirelength channel capacities violating channel assignment. For the best wirelength, we allowed pin assignment algorithm to select routes without considering the pin assignment and routing demands. Our algorithm tries to minimize wirelength while avoiding congestion of routing channels and pin assignment resources. The parameters of the algorithm decide the trade-off between wirelength, pin assignment demands and routing demands. From our experiments we observe the following: 1. In pin assignment, we are able to reduce pin assignment and routing demands drastically by increasing only 25% wirelength, from the best case. 2. The wirelength scales rapidly with benchmark sizes and the wirelength for pin assignment is huge compared to channel assignment due to limited routing resources in the floorplan layer . 5. CONCLUSIONS In this paper we discuss issues related to global routing for 3-D packaging. We discuss the methodology used in our global router for SOP. We have presented the results of channel and pin assignment which constitutes the final steps in our proposed routing flow for the SOP. To the best of our knowledge, ours is the first implemented global router for SOP addressing objectives such as crosstalk, wirelength, and total number of layers . 6. REFERENCES [1] Rao Tummala and Vijay Madisetti, “System on Chip or System on Package?”, IEEE Design & Test of Computers , pp 48-56, 1999. [2] J. Cong , “Pin assignment with global routing for general cell designs”, IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems , pp1401-1412, 1991 [3] J. Cong, A.B. Kahng, K Leung, “Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem with Applications to VLSI Physical Design”, IEEE Trans. on CAD , vol. 17, no.1, January 1998 Table 2. The pin assignment results. Wirelength(wl), pin assignment demands(pd) and routing demand(rd) are reported. Best Wirelength 2PINASSIGN Ckt wl pd rd wl pd rd n1010327 11 15 121739 11 n3042108 16 47 5473012 18 n5086052 31 70 12074315 59 n100155089 20 83 19472412 42 n200343883 23 139 ******** 76 n30056124427 162 69238311 79 Table 1. The result of multi-objective minimizing channel assignment. Number of layer pairs(ly), wirelength(wl), bends (bnd) and violations(vl) for the best and actual cases are reported. Best Wirelength CHASSIGN Ckt ly wl bnd vl ly wl bnd vl n10 5 69630 55 5 14174 34 0 n30 6 11288 0 144 6 24726 122 0 n50 6 14826 3 282 6 32059 189 0 n100 6 16430 3 413 7 36331 382 0 n200 6 24078 1 845 8 61485 917 0 n300 6 28469 3 10008 65189 1029 0 [4] K.-Y. Khoo and J. Cong, "A fast multilayer general area router for MCM designs," IEEE Trans. Circuits and Syst. II, Nov. 1992, vol.39, pp. 841-51 [5] K.-Y. Khoo and J. Cong, "An efficient multilayer MCM router based on four-via routing," IEEE Trans. Computer-Aided Design, Oct. 1995, vol.14, pp. 1277-90 [6] Omitted. [7] Omitted. [8] Omitted [9] https://www.wendangku.net/doc/b1738595.html,/research/surf/GSRC/ GSRCbench.html 浅谈幼儿绘本快乐阅读 丹阳市皇塘中心幼儿园 212327 尹芳 摘要:绘本是一种适合低幼儿阅读的图画书,以图画为主阅读为辅,甚至完全没有文字而全是图画的书籍。《快乐的蝴蝶》这本绘本阅读书,以快乐不需要理由为主要线索贯穿整个故事,让幼儿在快乐中阅读,体验阅读的快乐。 关键词:快乐阅读环境 语言是人们进行交流和沟通的工具,儿童时期是语言发展的最佳时期,也是最迅速的时期。因此,发展孩子口头语言是培养孩子接受一切教育的基础。笔者认为小班语言教学的主要任务,应该是抓好口头语言训练的最基础部分,即正确发音和短句的表达。新《纲要》中指出:“儿童的早期阅读能力培养已被纳入幼儿园语言教育的目标。”作为儿童早期阅读材料的新生力量——绘本,以其出色的创意、联想,幽默的表现手法和丰富的人文精神,深受到孩子的喜爱。“绘本”又称为“图画书”。是作绘本家、画家专为幼儿创作的图画书。儿童是富有幻想的,他们常常凭借着自己还不多的体验,进入到想像的世界中去。结合幼儿的年龄特点,我尝试从绘本阅读入手,让孩子快乐地阅读,从而培养和提高孩子的阅读能力。 一、创设良好的阅读环境,让孩子“想读”。 环境是绘本阅读的最好向导。因此,在日常生活中渗透阅读内容,为幼儿提供阅读机会和场所就显得十分重要。我们根据幼儿的年龄特点和认识水平,有的放矢地为幼儿提供大量的绘本,放在班级图书袋 中,让幼儿自由地选择阅读材料,自主地进行感知、体验、探索。例如:在每次阅读活动前,教师提供相应的新图书,并向幼儿介绍图书的名称和内容,以激发幼儿阅读的欲望和兴趣。教师除了有目的、有计划地为幼儿提供了内容丰富的幼儿绘本读物,还要并保证读物每月换一次、并逐步增加程度相同而内容不同的图书,保持幼 晋灵公不君（宣公二年） 原文： 晋灵公不君。厚敛以雕墙。从台上弹人，而观其辟丸也。宰夫胹熊蹯不熟，杀之，寘诸畚，使妇人载以过朝。赵盾、士季见其手，问其故而患之。将谏，士季曰：“谏而不入，则莫之继也。会请先，不入，则子继之。”三进及溜，而后视之，曰：“吾知所过矣，将改之。”稽首而对曰：“人谁无过？过而能改，善莫大焉。诗曰：‘靡不有初，鲜克有终。’夫如是，则能补过者鲜矣。君能有终，则社稷之固也，岂惟群臣赖之。又曰：‘衮职有阙，惟仲山甫补之。’能补过也。君能补过，衮不废矣。” 犹不改。宣子骤谏，公患之，使鉏麑贼之。晨往，寝门辟矣，盛服将朝。尚早，坐而假寐。麑退，叹而言曰：“不忘恭敬，民之主也。贼民之主，不忠；弃君之命，不信。有一于此，不如死也！”触槐而死。 秋九月，晋侯饮赵盾酒，伏甲将攻之。其右提弥明知之，趋登曰：“臣侍君宴，过三爵，非礼也。”遂扶以下。公嗾夫獒焉。明搏而杀之。盾曰：“弃人用犬，虽猛何为！”斗且出。提弥明死之。 初，宣子田于首山，舍于翳桑。见灵辄饿，问其病。曰：“不食三日矣！”食之，舍其半。问之，曰：“宦三年矣，未知母之存否。今近焉，请以遗之。”使尽之，而为之箪食与肉，寘诸橐以与之。既而与为公介，倒戟以御公徒，而免之。问何故，对曰：“翳桑之饿人也。”问其名居，不告而退。——遂自亡也。 乙丑，赵穿①攻灵公于桃园。宣子未出山而复。大史书曰：“赵盾弑其君。”以示于朝。宣子曰：“不然。”对曰：“子为正卿，亡不越竟，反不讨贼，非子而谁？”宣子曰：“呜呼!‘我之怀矣，自诒伊戚。’其我之谓矣。” 孔子曰：“董狐，古之良史也，书法不隐。赵宣子，古之良大夫也，为法受恶。惜也，越竞乃免。” 译文： 晋灵公不行君王之道。他向人民收取沉重的税赋以雕饰宫墙。他从高台上用弹弓弹人，然后观赏他们躲避弹丸的样子。他的厨子做熊掌，没有炖熟，晋灵公就把他杀了，把他的尸体装在草筐中，让宫女用车载着经过朝廷。赵盾和士季看到露出来的手臂，询问原由后感到很忧虑。他们准备向晋灵公进谏，士季说：“如果您去进谏而君王不听，那就没有人能够再接着进谏了。还请让我先来吧，不行的话，您再接着来。”士季往前走了三回，行了三回礼，一直到屋檐下，晋灵公才抬头看他。晋灵公说：“我知道我的过错了，我会改过的。”士季叩头回答道：“谁能没有过错呢？有过错而能改掉，这就是最大的善事了。《诗经》说：‘没有人向善没有一个开始的，但却很少有坚持到底的。’如果是这样，那么能弥补过失的人是很少的。您如能坚持向善，那么江山就稳固了，不只是大臣们有所依靠啊。 依稀记得在我两三岁的时候，我天天跟着妈妈到学校里玩耍，那时妈妈在学校里给幼儿班代课。课间一群比我大点的孩子们总是围着我说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给我手中或嘴里塞干粮的。他们一听到铃声嘴里“哦———”着飞也似的进了教室。于是我便一人悠闲自在地在校园里溜达：一步一步地踱到东边看看美丽的花儿;爬到西边的球台上翻着晒晒太阳;听到南边教室里悠扬的歌声，于是又跑到窗户下踮着脚使劲儿地仰起头向里看;仰倦了头嘴里嘟嘟地哼着，若无其事的来到北面那两块瓷砖镶嵌的大地图下，看着那些花花绿绿的条条块块，也不知道是些什么。 如今，我已是那时年龄的四倍了，仍在这熟悉温暖的校园里，那时一切不懂的，今天都明白了。那时的快乐依在，那时的天真依在。不过现在我所看到的、听到的、感悟的比那时多得多了。 清晨的校园，阳光钻透东边茂密的柳林，斑驳的光点印在绿绿的草坪上。无数只鸟儿横着或倒挂在柔柔的柳条上凑响清脆的晨曲。在通向教师办公大楼的水泥道上，陆陆续续晃过一群高大的身影———我们的老师，他们又上班去了。 当校园正中升起鲜艳的五星红旗时，悦耳的歌声和朗朗的读书声早已把校园装点得生机勃勃。我再不需要像过去那样踮脚仰头地去向往了。我尽心地在这宽敞明亮的教室里学习，聆听着老师的教诲，享受着群体的温暖与关爱。 课间，我们三三俩俩去拉着或牵着幼儿班的那些小娃娃，说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给他们手中或嘴里塞泡泡糖的。有一天，我把三四个小娃娃牵到北面那两块瓷砖镶嵌的大地图下，学着老师的样子摇头晃脑、指着地图比比划划地讲：“这是中国，这是长江、那是黄河……，我们的学校在这里，要记住，别忘记。看我的手好大，把一个省都罩住了。”小娃娃们叽叽喳喳地笑个不停，我也笑得前俯后仰。 上课铃响了，我们“哦———”着飞也似的进了教室。那天我们进了教室，唱完了一首长长的歌，没见老师来，于是我站起来对大家说：“大家先读读书吧，我去办公室看看”。话音刚落，只见李老师一瘸一拐地走进教室。同学们注视着他的脚。原来他脚上缠着一圈大大的药纱布。我们明白他的脚受伤了。他开始给我们讲课，和往常一样站着，不时还转去转来。一会儿，我从他变化了的语调中感到：他的脚疼痛难忍了。我忍不住环视一下四周，发现所有同学的眼里都水晶晶的，此刻我心头一热，眼泪夺眶而出。这天我在日记中写道：“在我们快乐的时候，我们的老师也许正痛苦着;在我们获取的时候，我们的老师正在奉献着;在我们成长的时候，我们的老师正在消亡着。” 太阳依旧从东边升起，灿烂的阳光总是洒满校园。当我的年龄到了是现在的若干倍的时候，我会依然记起今天的快乐与感触。 1、作者的感触是什么(4分) 答：。 2、在文中找出拟人的一句话写在下面。(1分) 答：。 3、用“～～～”标出文中照应的句子。(2分) 4、在文中找出三对反义词写在下面。(3分) 、、 5、“哦——”中的“———”号起作用。(2分) “一群高大的身影——我们的老师，”中的“——”号起作用。(2分) 6、把你对“陆陆续续晃过一群高大的身影”的理解写在下面。(4分) 答：。 7、第自然段是承上启下的文字。(1分) (3分) 13物电一班212宿舍英语短剧 演员：盛鹏扬，林仕杰，林雄斌，林衍平，洪艺伟，兴爷（家兴）编剧兼导演兼制作人兼出品人兼监制兼很多很多：伟大的兴爷 翻译：林仕杰 人物 旁白/低头族A/低头族B/医生哥哥/A家长/B家长 事件：两个低头族(A/B)在街上相撞，其中一个(A)的手机被摔坏，两人在大街上争吵起来，A打伤了B的眼睛。两人被带到了医院，但是仍然在争吵，医生过来询问两人的情况，了解到事件的起因经过，此时，双方家长都赶到了，医生教育了家长与孩子，孩子意识到了错误，家长也认识自己教育孩子的不足，最终向大家阐述了低头族的害处。并且表明自己不做低头族的决心。 场景1（街道） A：Bye bye, mom.（挥手） A家长：Bye bye, pay attention to safety on the road, don't play mobile phone! B：Bye bye, dad.（挥手） B家长：Well, pay attention to safety.。 旁白：（AB respectively with parents farewell after set out toward the school, A bow is playing with A popular summer cool running(天天酷跑) every day, at this time and he walks across the B bow is playing with A mobile phone, two people have not looked up and saw each other, so, two people together. A: oh! My local tyrants gold! B: oh! Is who ah! Walk without eyes? A: look at what you have done! You lost my mobile phone, it is I who give me birthday gift, this is a local tyrants gold! How do you compensate me!!! B：: it's none of my business, is that you yourself walk don't hit me A：I can't stand it! How can you be so unreasonable! You have to accompany my mobile phone. B：Don't tease? What were you thinking? It is not entirely my responsibility. A：It seems I have to give you some lessons（对着B挥拳相向） B：Ouch! My eyes! 场景2（医院） 旁白：B eyes after being injured, was rushed to hospital. B：You wounded me, you have to compensate me. A：What did you say? You should pay for my cell phone!（两人相互推搡） Balabalbal。。。 医生：Please keep quiet in the hospital, ok, tell me about why do you quarrel with me. 活动名称：心理健康教学活动：《快乐是什么》年龄段岁 执教人：潘燕君活动时间2010年11月4日 设计意图：纲要中指出，在一日生活中教师应保持幼儿积极愉快的情绪，快乐的情绪对幼儿身心发展起着至关重要的作用。那么在孩子们的心中快乐又是什么？他们能够感受到幼儿园这个大家庭中的快乐吗？能够体会到集体生活的快乐吗？当我看到孩子们面对掉落的纸屑宁愿绕道而过时，当我看到某些孩子面对散落的玩具熟视无睹时，我发现孩子们还没有真正体会到快乐的内涵。《快乐是什么》是一篇优美而富有哲理的儿童故事。随着故事情节的开展，我们看到不同的人对快乐有不同的理解，细细品味这个简单的故事，它表达了一个深刻的哲理：快乐是真诚的付出，快乐是人与人之间的相互关心，快乐是生活中的点点滴滴。 本次活动通过让孩子体验集体生活中的快乐，借助绘本《快乐是什么》，引导孩子发现集体生活中的快乐，帮助他们理解快乐的内涵，知道快乐无处不在，懂得在生活中只有真诚的付出才能收获快乐。 活动目标： 1.感受集体生活中的快乐。 2.初步理解快乐的内涵，会用完整的语句表达自己的快乐。 3.能够发现集体生活中的点滴快乐。 活动准备： 环境创设：各区域活动中的玩具凌乱走廊过道上有少数垃圾 物质准备：背景音乐一《追梦人》背景音乐二《喜洋洋》小椅子若干（与幼儿人数相等）一次性纸杯若干 教学活动过程设计 活动过程：隐性教育的预设 一、体验集体游戏的快乐。 游戏：坐上快乐的小椅子。 玩法：将小椅子摆成圆圈，椅子的个数和幼儿人数相同，《喜洋洋》的音乐响起，幼儿绕椅子用动作表现自己听到音乐后的感受，音乐停，幼儿找椅子坐下，如此椅子渐渐变少，快乐的感觉在慢慢增强，让孩子懂得共同分享椅子的快乐。 1．快乐与感触 依稀记得在我两三岁的时候，我天天跟着妈妈到学校里玩耍，那时妈妈在学校里给幼儿班代课。课间一群比我大点的孩子们总是围着我说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给我手中或嘴里塞干粮的。他们一听到铃声嘴里“ 哦———” 着飞也似的进了教室。于是我便一人悠闲自在地在校园里溜达：一步一步地踱到东边看看美丽的花儿；爬到西边的球台上翻着晒晒太阳；听到南边教室里悠扬的歌声，于是又跑到窗户下踮着脚使劲儿地仰起头向里看；仰倦了头嘴里嘟嘟地哼着，若无其事的来到北面那两块瓷砖镶嵌的大地图下，看着那些花花绿绿的条条块块，也不知道是些什么。 如今，我已是那时年龄的四倍了，仍在这熟悉温暖的校园里，那时一切不懂的，今天都明白了。那时的快乐依在，那时的天真依在。不过现在我所看到的、听到的、感悟的比那时多得多了。 清晨的校园，阳光钻透东边茂密的柳林，斑驳的光点印在绿绿的草坪上。无数只鸟儿横着或倒挂在柔柔的柳条上凑响清脆的晨曲。在通向教师办公大楼的水泥道上，陆陆续续晃过一群高大的身影———我们的老师，他们又上班去了。 当校园正中升起鲜艳的五星红旗时，悦耳的歌声和朗朗的读书声早已把校园装点得生机勃勃。我再不需要像过去那样踮脚仰头地去向往了。我尽心地在这宽敞明亮的教室里学习，聆听着老师的教诲，享受着群体的温暖与关爱。 课间，我们三三俩俩去拉着或牵着幼儿班的那些小娃娃，说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给他们手中或嘴里塞泡泡糖的。有一天，我把三四个小娃娃牵到北面那两块瓷砖镶嵌的大地图下，学着老师的样子摇头晃脑、指着地图比比划划地讲：“这是中国，这是长江、那是黄河……，我们的学校在这里，要记住，别忘记。看我的手好大，把一个省都罩住了。” 小娃娃们叽叽喳喳地笑个不停，我也笑得前俯后仰。 上课铃响了，我们“哦———”着飞也似的进了教室。那天我们进了教室，唱完了一首长长的歌，没见老师来，于是我站起来对大家说：“大家先读读书吧，我去办公室看看”。话音刚落，只见李老师一瘸一拐地走进教室。同学们注视着他的脚。原来他脚上缠着一圈大大的药纱布。我们明白他的脚受伤了。他开始给我们讲课，和往常一样站着，不时还转去转来。一会儿，我从他变化了的语调中感到：他的脚疼痛难忍了。我忍不住环视一下四周，发现所有同学的眼里都水晶晶的，此刻我心头一热，眼泪夺眶而出。这天我在日记中写道：“在我们快乐的时候，我们的老师也许正痛苦着；在我们获取的时候，我们的老师正在奉献着；在我们成长的时候，我们的老师正在消亡着。” 太阳依旧从东边升起，灿烂的阳光总是洒满校园。当我的年龄到了是现在的若干倍的时候，我会依然记起今天的快乐与感触。 1、作者的感触是什么？（4分） 答： 。 2、在文中找出拟人的一句话写在下面。（1分） 3、用“～～～”标出文中照应的句子。（2分） 4、在文中找出三对反义词写在下面。（3分） 、、 5、“ 哦——”中的“ ———”号起作用。（2分） “一群高大的身影———我们的老师，” 中的“ ———”号起作用。（2分）6、把你对“陆陆续续晃过一群高大的身影”的理解写在下面。（4分） 情景剧剧本：College Life 08会计1班第三小组全体成员 人物：Cast George Mancy Ken Tida Annie Character descriptions: (G)George －He majors in Environment Science. His roommates are Ken and Ti da. They have a bad relationship. He thinks happiness is more important. His gir lfriend is Mancy. (K)Ken －He fools around all the time. He doesn’t know what kind of life he wants. He hates studying and doesn’t like to be blamed. (T)Tida －He doesn’t want to spend time making friends with Ken and George. He likes to communicate with others by computer. Computer is his life. (M)Mancy－She is George’s girlfriend. She doesn’t have her own ideas. She wan ts to be with George all the time. Because of the reason, she ignores Annie’s fe elings. (A)Annie －She is Mancy’s good fr iend. She likes Mancy. She is very weird so she hates Mancy’s friends. She wishes Mancy and George to break up. But she doesn’t like her evil thinking. Plot: There are three roommates who have a bad relationship, but a motorcycle accide nt changes their l ives….. 如何翻译古文 学习古代汉语，需要经常把古文译成现代汉语。因为古文今译的过程是加深理解和全面运用古汉语知识解决实际问题的过程，也是综合考察古代汉语水平的过程。学习古代汉语，应该重视古文翻译的训练。 古文翻译的要求一般归纳为信、达、雅三项。“信”是指译文要准确地反映原作的含义，避免曲解原文内容。“达”是指译文应该通顺、晓畅，符合现代汉语语法规范。“信”和“达”是紧密相关的。脱离了“信”而求“达”，不能称为翻译；只求“信”而不顾“达”，也不是好的译文。因此“信”和“达”是文言文翻译的基本要求。“雅”是指译文不仅准确、通顺，而且生动、优美，能再现原作的风格神韵。这是很高的要求，在目前学习阶段，我们只要能做到“信”和“达”就可以了。 做好古文翻译，重要的问题是准确地理解古文，这是翻译的基础。但翻译方法也很重要。这里主要谈谈翻译方法方面的问题。 一、直译和意译 直译和意译是古文今译的两大类型，也是两种不同的今译方法。 1．关于直译。所谓直译，是指紧扣原文，按原文的字词和句子进行对等翻译的今译方法。它要求忠实于原文，一丝不苟，确切表达原意，保持原文的本来面貌。例如： 原文：樊迟请学稼，子曰：“吾不如老农。”请学为圃。子曰：“吾不如老圃。”（《论语?子路》） 译文：樊迟请求学种庄稼。孔子道：“我不如老农民。”又请求学种菜蔬。孔子道：“我不如老菜农。”（杨伯峻《论语译注》） 原文：齐宣王问曰：“汤放桀，武王伐纣，有诸？”（《孟子?梁惠王下》） 译文：齐宣王问道：“商汤流放夏桀，武王讨伐殷纣，真有这回事吗？（杨伯峻《孟子译注》） 上面两段译文紧扣原文，字词落实，句法结构基本上与原文对等，属于直译。 但对直译又不能作简单化理解。由于古今汉语在文字、词汇、语法等方面的差异，今译时对原文作一些适当的调整，是必要的，并不破坏直译。例如： 原文：逐之，三周华不注。（《齐晋鞌之战》） 译文：〔晋军〕追赶齐军，围着华不注山绕了三圈。 阅读中的感悟和乐趣 四平市第三中学七年五班梁家鸣 指导教师：孙倩每当恬淡的黄昏，或是静谧的夜晚，我会倚在床的一角，手捧一本书静静地阅读，默默地品味。打开一本书，我可以随意想象，想象自己是蓝天，一望无际；想象自己是月夜，寂静美丽；想象自己是海浪，澎湃不息…… 书籍是我们生活的导航，它教会我们去尊重他人，尊重自己，让贫乏和平庸远离我们。每当茶余饭后咀嚼着书籍中优美的文字，欣赏一个个动人的故事，都会让我人有所感悟。 阅读是一种陶冶，是一种享受。 有人说过，假如一次灾难把现在的城市乡村都毁灭了，那么，只要还留下一座图书馆，人类就不会灭亡，也不会倒退回茹毛饮血的时代。书，让我们畅游在知识的海洋，书，让我们在快乐中成长，书，让我们在阅读中懂得欣赏，书，更让我们在聚精会神的时候懂得感悟。打开一本好书，迎面扑鼻的是清香而深邃的气息，仿佛是那新翻耕的泥土散发出的馨香。读小说，我会随着主人公跌宕起伏的命运或喜或悲；读抒情的散文诗歌，我会在作者淡淡的忧郁中品味他们对生命、生活、自然的态度；翻阅轻松诙 谐的书，我可以尽情地放声大笑，把一切烦恼都抛到九霄云外……你可以和冰心一起享受诗歌的人情冷暖；你可以和司马迁一起谈古论今；你可以和安徒生一起读懂“美人鱼”的宽宏大量…… 阅读是一种学问，是心灵净化的快慰。 阅读，能改变我们生命的面貌，能驱除我们生命中的寂寞，能丰沛我们的精神财富，由此来解析生命存在的意义，感悟行走的岁月。徜徉在斑斓的文字世界里，心灵听风沐雨，春暖花开。就像梁实秋所说："一个人最好的修养，就是读书。"从龟甲到竹简，从丝帛到纸张，经典书籍的芬芳弥漫在历史的每一个角落，哪里有文明，哪里就有书卷。嗅着淡淡的墨香，感受着字里行间的郁郁葱葱，在不经意间，感悟到深含的情感，与作者进行着心灵的对话。 书是清凉的泉水，让人清凉解渴；书是甜美的果汁，让人滋心润肺；书是浓浓的绿茶，让人神清气爽。阅读就如同在快乐之海遨游。曾经在书中体会过“怦然心跳”；曾经在书中有一种“莫名感动”；曾经在书中进行自我审视，也曾经在书中看到人生百态……我只愿有书为伴，心情平和而宁静，灵魂纯洁而超然！ 阅读，轻盈了我的脚步，靓丽了我的身影，让我在文字的世界里纵横驰骋，在文字的田园里自由奔跑，在文字的海洋里无拘 Cast Anita :Never understand why students like to ship classes; Kevin:Treats “skipping classes ” as the principle of university life; Ken : Eager to skip classes but dares not to do it ; Jason:Always commits himself not to skip cases; Steven:Always gives himself a good excuse for skipping classes; Rita:A professional class skipper Scene I (Anita, Kevin, Ken, Jason, Steven, and Rita are all Tunghai University students. They are good friends. One day, Ken and Jason meet on the way to the classroom.) Ken: Why are you late? And, you just missed the last class. The teacher gave us the main topics for the mid-term examination. Jason: Oh, shoot! I just missed it. Would you lend me your notes so I can make a copy? Ken: Sure if you give me a good reason why you missed the class. You promised me that you would be in class on time today. Jason: Believe me, I would like to keep my word. The problem is that I have the “Business Management” test today and I was up studying for it till three o’clock this morning. Then I fell asleep and woke up at ten o’clock this morning. Ken: You studied until three o’clock this morning? Why? What did you do yesterday afternoon? I know you were free from four o’clock on yesterday. Jason: Well, I met one of my very old friends on line and we just talked too long…Ken: For God’s sake! Don’t you care about next week’s mid-term examination? -------------------------------------------------------------------------------- Scene II (Anita, Steven and Kevin are talking to one another in front of a classroom. And, Anita is trying to prevent Steven and Kevin from cutting the next class.) Anita: Hey, we’ll have the “Business Management” class in a few minutes.Where are you going? Don’t tell me that you are going to argue with Jason. Steven: I will do anything for my good friend. Of course I am going to argue with the guy who gave my good friend a hard time. Anita: You always like to get involved in someone else’s business. You’ll get yourself in trouble. Don’t you know it? ... Kevin: Anita, don’t be upset with him. He will not listen to you. Just leave him alone. By the way, I am still waiting for your decision. Are you coming with me to the concert tomorrow? Anita: Oh, I am sorry that I almost forgot it. What time tomorrow? Kevin: T wo o’clock. I cannot wait to see my adorable superstar – Jolin. Oh, how wonderful! Anita: wait a minute. We have Calculus class tomorrow afternoon. Are you out of your mind? 鞌之战选自《左传》又名《鞍之战》原文：楚癸酉，师陈于鞌(1)。邴夏御侯，逢丑父为右②。晋解张御克，郑丘缓为右(3)。侯日：“余姑翦灭此而朝食(4)”。不介马而驰之⑤。克伤于矢，流血及屦2 未尽∧6)，曰：“余病矣(7)！”张侯曰：“自始合(8)，而矢贯余手及肘(9)，余折以御，左轮朱殷(10)，岂敢言病吾子忍之！”缓曰：“自始合，苟有险，余必下推车，子岂＿识之(11)然子病矣！”张侯曰：“师之耳目，在吾旗鼓，进退从之。此车一人殿之(12)，可以集事(13)，若之何其以病败君之大事也擐甲执兵(14)，固即死也(15)；病未及死，吾子勉之(16)！”左并辔(17) ，右援拐鼓(18)。马逸不能止(19)，师从之，师败绩。逐之，三周华不注(20) 韩厥梦子舆谓己曰：“旦辟左右！”故中御而从齐侯。邴夏曰：“射其御者，君子也。”公曰：“谓之君子而射之，非礼也。”射其左，越于车下；射其右，毙于车中。綦毋张丧车，从韩厥，曰：“请寓乘。”从左右，皆肘之，使立于后。韩厥俛，定其右。逢丑父与公易位。将及华泉，骖絓于木而止。丑父寝于轏中，蛇出于其下，以肱击之，伤而匿之，故不能推车而及。韩厥执絷马前，再拜稽首，奉觞加璧以进，曰：“寡君使群臣为鲁、卫请，曰：‘无令舆师陷入君地。’下臣不幸，属当戎行，无所逃隐。且惧奔辟而忝两君，臣辱戎士，敢告不敏，摄官承乏。” 丑父使公下，如华泉取饮。郑周父御佐车，宛茷为右，载齐侯以免。韩厥献丑父，郤献子将戮之。呼曰：“自今无有代其君任患者，有一于此，将为戮乎”郤子曰：“人不难以死免其君，我戮之不祥。赦之，以劝事君者。”乃免之。译文1：在癸酉这天，双方的军队在鞌这个地方摆开了阵势。齐国一方是邴夏为齐侯赶车，逢丑父当车右。晋军一方是解张为主帅郤克赶车，郑丘缓当车右。齐侯说:“我姑且消灭了这些人再吃早饭。”不给马披甲就冲向了晋军。郤克被箭射伤，血流到了鞋上，但是仍不停止擂鼓继续指挥战斗。他说:“我受重伤了。”解张说:“从一开始接战，一只箭就射穿了我的手和肘，左边的车轮都被我的血染成了黑红色，我哪敢说受伤您忍着点吧！”郑丘缓说:“从一开始接战，如果遇到道路不平的地方，我必定（冒着生命危险）下去推车，您难道了解这些吗不过，您真是受重伤了。”daier 解张说:“军队的耳朵和眼睛，都集中在我们的战旗和鼓声，前进后退都要听从它。这辆车上还有一个人镇守住它，战事就可以成功。为什么为了伤痛而败坏国君的大事呢身披盔甲，手执武器，本来就是去走向死亡，伤痛还没到死的地步，您还是尽力而为吧。”一边说，一边用左手把右手的缰绳攥在一起，用空出的右手抓过郤克手中的鼓棰就擂起鼓来。（由于一手控马，）马飞快奔跑而不能停止，晋军队伍跟着指挥车冲上去，把齐军打得打败。晋军随即追赶齐军，三次围绕着华不注山奔跑。韩厥梦见他去世的父亲对他说:“明天早晨作战时要避开战车左边和右边的位置。”因此韩厥就站在中间担任赶车的来追赶齐侯的战车。邴夏说:“射那个赶车的，他是个君子。”齐侯说: “称他为君子却又去射他，这不合于礼。”daier 于是射车左，车左中箭掉下了车。又射右边的，车右也中箭倒在了车里。（晋军的）将军綦毋张损坏了自己的战车，跟在韩厥的车后说: “请允许我搭乗你的战车。”他上车后，无论是站在车的左边，还是站在车的右边，韩厥都用肘推他，让他站在自己身后——战车的中间。韩厥又低下头安定了一下受伤倒在车中的那位自己的车右。于是逢丑父和齐侯（乘韩厥低头之机）互相调换了位置。将要到达华泉时，齐侯战车的骖马被树木绊住而不能继续逃跑而停了下来。（头天晚上）逢丑父睡在栈车里，有一条蛇从他身子底下爬出来，他用小臂去打蛇，小臂受伤，但他（为了能当车右）隐瞒了这件事。由于这样，他不能用臂推车前进，因而被韩厥追上了。韩厥拿着拴马绳走到齐侯的马前，两次下拜并行稽首礼，捧着一杯酒并加上一块玉璧给齐侯送上去， 小学语文中高年级阅读理解附答案快乐与感触 依稀记得在我两三岁的时候，我天天跟着妈妈到学校里玩耍，那时妈妈在学校里给幼儿班代课。课间一群比我大点的孩子们总是围着我说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给我手中或嘴里塞干粮的。他们一听到铃声嘴里“哦———”着飞也似的进了教室。于是我便一人悠闲自在地在校园里溜达：一步一步地踱到东边看看美丽的花儿；爬到西边的球台上翻着晒晒太阳；听到南边教室里悠扬的歌声，于是又跑到窗户下踮着脚使劲儿地仰起头向里看；仰倦了头嘴里嘟嘟地哼着，若无其事的来到北面那两块瓷砖镶嵌的大地图下，看着那些花花绿绿的条条块块，也不知道是些什么。 如今，我已是那时年龄的四倍了，仍在这熟悉温暖的校园里，那时一切不懂的，今天都明白了。那时的快乐依在，那时的天真依在。不过现在我所看到的、听到的、感悟的比那时多得多了。 清晨的校园，阳光钻透东边茂密的柳林，斑驳的光点印在绿绿的草坪上。无数只鸟儿横着或倒挂在柔柔的柳条上凑响清脆的晨曲。在通向教师办公大楼的水泥道上，陆陆续续晃过一群高大的身影———我们的老师，他们又上班去了。 当校园正中升起鲜艳的五星红旗时，悦耳的歌声和朗朗的读书声早已把校园装点得生机勃勃。我再不需要像过去那样踮脚仰头地去向往了。我尽心地在这宽敞明亮的教室里学习，聆听着老师的教诲，享受着群体的温暖与关爱。 课间，我们三三俩俩去拉着或牵着幼儿班的那些小娃娃，说啊、笑啊、眯眯眼做做鬼脸什么的，也有不停地给他们手中或嘴里塞泡泡糖的。有一天，我把三四个小娃娃牵到北面那两块瓷砖镶嵌的大地图下，学着老师的样子摇头晃脑、指着地图比比划划地讲：“这是中国，这是长江、那是黄河……，我们的学校在这里，要记住，别忘记。看我的手好大，把一个省都罩住了。”小娃娃们叽叽喳喳地笑个不停，我也笑得前俯后仰。 上课铃响了，我们“哦———”着飞也似的进了教室。那天我们进了教室，唱完了一首长长的歌，没见老师来，于是我站起来对大家说：“大家先读读书吧，我去办公室看看”。话音刚落，只见李老师一瘸一拐地走进教室。同学们注视着他的脚。原来他脚上缠着一圈大大的药纱布。我们明白他的脚受伤了。他开始给我们讲课，和往常一样站着，不时还转去转来。一会儿，我从他变化了的语调中感到：他的脚疼痛难忍了。我忍不住环视一下四周，发现所有同学的眼里都水晶晶的，此刻我心头一热，眼泪夺眶而出。这天我在日记中写道：“在我们快乐的时候，我们的老师也许正痛苦着；在我们获取的时候，我们的老师正在奉献着；在我们成长的时候，我们的老师正在消亡着。” 太阳依旧从东边升起，灿烂的阳光总是洒满校园。当我的年龄到了是现在的若干倍的时候，我会依然记起今天的快乐与感触。 1、作者的感触是什么？（4分） 答：。 2、在文中找出拟人的一句话写在下面。（1分） 3、用“～～～”标出文中照应的句子。（2分） 4、在文中找出三对反义词写在下面。（3分） 、、 5、“哦——”中的“———”号起作用。（2分） 角色：四个大学生，名字分别是：A，B，C，D。 （旁白）我们一直在想，所谓的大学究竟应该是怎样，我们一直在迷茫，为什么自己已经回不到高中时期的状态，于是很多人迷失了自己觉得现在的大学配不上自己，于是很多人与曾经的梦想渐行渐远，于是很多人选择了这样的生活。。。。。。 （在四人间的寝室里，灯光昏暗，三台电脑全开，背景音乐是摇滚乐，十分吵杂，配合有不断地鼠标点击的声音，还有打游戏时的喊声。） C：唉，又死了。这垃圾键盘，该死鼠标！垃圾键盘，该死鼠标！ D：哈哈，小撸怡情，大撸伤身，樯橹灰飞烟灭。王跃同志是你不行吧，不要勉强。。。 C：什么竟敢怀疑我的能力，好歹我也是在咱们寝室积极推广LOL文化第一人好不好 B: 哎哎，你两别吵了，我在跟媳妇视屏呢，声音小点好不。 C：哦，原来呀，我说网速咋这么慢。（敲门声响起，寝室里停止讲话） B：（上前开门，诧异状）张松一天不见你了，干啥去了 A：（拿着书本，满脸疲倦，走进寝室）老样子，还是去自习。 D：（转过身来）我就一直不明白，这是大学了，还起早贪黑上什么自习呀。 C：其实吧，我也挺想改变一下自己。有时候我老想像他一样每天做一点事，真的不能这样浑浑噩噩了。现在这般的生活确实很惬意，只是完了之后老是有一种愧疚感。 B：你们这么一说，我更加觉得我们对不起自己了。跟你们说个事吧，其实我一直就有个梦想，只是到了大学渐渐地把它抛在了脑后 A：说说吧 C：嗯，以前我想当一个企业家，创造出属于自己的一个商业帝国，为了这个梦想我曾经付出了很多努力，可是，唉，但是看看现在，自己一直萎靡不振，大家应该也有梦想吧。 B：我进入大学的时候曾满怀壮志，想要学好我的专业知识，成为一流人才，为了自己能更好的活着而努力。 A：其实吧，我的梦想很简单，就是以后可以和一个自己爱并爱着自己的人过着简单的生活，但要做到这点不是很容易，所以我很珍惜所拥有的每一天。 D：我的梦想是做一位美食家，我想吃遍天下美食，然后把它们推向世界，中国美食有着中国上下五千年文化的积蕴，不应该泯灭在历史的长河中，可现在我离梦想越走越远。 A：古人曾说过少年智则国智，少年富则国富，少年强则国强，我们的梦，中国的梦，中国梦，从我们的梦开始；当我们的梦实现之时，中国母亲的梦也就会实现，这时，我们民族可以无晦涩地立在人类面前，我们的祖国母亲也会最美的装饰起来，与世界各位母亲平等的携手了! D：是啊，不仅如此，我们身上还有父母们梦想的影子，我们还有很多的责任。 （旁白）最终，我们明白了，不是现在的大学配不上你，而是现在浑浑噩噩的你配不上你曾经的梦想。其实我们的梦想从未离我们远去，只要让自己静下心来，让自己的梦想与祖国的梦想联系起来，我的梦，中国梦，我们已经在追梦的路 上了。 中班绘本教案《快乐是什么》 活动目标： 1．在阅读画面语言的基础上欣赏故事，感受故事表达的温情。 2．理解故事角色对快乐的认识，能寻找并发现自己生活中的快乐。 3．学习用“××的快乐是……”的句式完整地说出自己或他人的快乐。 活动准备： 1．将绘本《快乐是什么》制作成PPT (插入与画面相匹配的音乐数段)，微笑表情图，大字卡：“××的快乐就是……”、“快乐是什么?”。 2．事先向幼儿发放“快乐调查表”。 活动过程： 一、谈话导入 师：(出示快乐的表情)看，这是什么表情?人的心情怎样就会微笑? 师：当我们心情高兴、快乐时，就自然会在脸上流露出微笑。老师今天很开心，很快乐，因为我能和小朋友在一起。老师知道你们一定也有很多快乐的事情，你愿意大声说出来和大家一起分 享吗?谁来说说，你什么时候很快乐? 幼：我在做游戏的时候很快乐。 幼：画画时我很快乐。 师：小朋友都有自己的快乐，快乐真是一种美好的感觉。可是有一只小老鼠，(点击封面)它经常问妈妈：快乐是什么?(出示字卡)想知道鼠妈妈是怎么回答的吗?我们一起来看书吧。 二、阅读感知 1、师：(点击第一页)猜猜这是什么季节?你从哪里看出来的?(引导幼儿观察樱花盛开的景象。) 师：对，这是一个春天的早晨，小老鼠伸着懒腰走出家门，回过头问妈妈：快乐是什么?鼠妈妈回答：快乐就是在春天的早晨一打开门，头顶便哗啦啦落下来一阵樱花雨。 什么是樱花雨? 幼：樱花花瓣飘落下来，好像下雨一样。 师：说得真好，樱花是很美很美的一种花，樱花雨落在头上会有什么感觉? 幼：会很香，还很舒服。 (教师引导幼儿复述“鼠妈妈”的话并加上动作。) 2、师：(点击第二页)瞧，小老鼠在干什么? 师：小老鼠啊，把山坡当成了滑梯，他在滑滑梯呢!山坡上长满了蓝色的风铃草(点图)。长满了草的山坡，踩上去会有什么感觉? 幼：软软的。 师：对啊，如果不小心滑倒，也不会摔痛。所以小老鼠一不小心滑倒了，他还捧着肚子笑呢!这时，他问妈妈：“快乐是什么?”鼠妈妈说：“快乐就是在蓝色风铃草中滑下山坡，一次又一次。”(带幼儿一起学说鼠妈妈的回答。) 3、师：(点击第三页)哟，这老鼠母子俩什么事这么开心呀? 幼：他们在荡秋千。 师：小老鼠紧紧抱着鼠妈妈，无限开心地问：“快乐是什么?”鼠妈妈会怎么回答呢? 幼：她说快乐就是把秋千荡得高高的，和小鸟飞得一样高。师：你猜对了。鼠妈妈说：“快乐就是荡着秋千，像鸟一样飞进高高的云端。”你们荡过秋千吗?喜欢荡秋千吗?我们一起来体验一下这种感觉：紧紧抱着妈妈，荡起来(随音乐做荡秋千的动作)。快乐吗? 4、师：(点击第四页)画面上除了小老鼠，还有谁?他们在做什么? 幼：小老鼠骑着自行车，在追大母鸡。 《鞌之战》阅读答案（附翻译）原文及翻 译 鞌之战[1] 选自《左传成公二年（即公元前589年）》 【原文】 癸酉，师陈于鞌[2]。邴夏御齐侯[3]，逢丑父为右[4]。晋解张御郤克，郑丘缓为右[5]。齐侯曰：余姑翦灭此而朝食[6]。不介马而驰之[7]。郤克伤于矢，流血及屦，未绝鼓音[8]，曰：余病[9]矣！张侯[10]曰：自始合，而矢贯余手及肘[11]，余折以御，左轮朱殷[12]，岂敢言病。吾子[13]忍之！缓曰：自始合，苟有险[14]，余必下推车，子岂识之[15]？然子病矣！张侯曰：师之耳目，在吾旗鼓，进退从之[16]。此车一人殿之[17]，可以集事[18]，若之何其以病败君之大事也[19]？擐甲执兵，固即死也[20]。病未及死，吾子勉之[21]！左并辔[22]，右援枹而鼓[23]，马逸不能止[24]，师从之。齐师败绩[25]。逐之，三周华不注[26]。 【注释】 [1]鞌之战：春秋时期的著名战役之一。战争的实质是齐、晋争霸。由于齐侯骄傲轻敌，而晋军同仇敌忾、士气旺盛，战役以齐败晋胜而告终。鞌：通鞍，齐国地名，在今山东济南西北。 [2]癸酉：成公二年的六月十七日。师，指齐晋两国军队。陈， 列阵，摆开阵势。 [3]邴夏：齐国大夫。御，动词，驾车。御齐侯，给齐侯驾车。齐侯，齐国国君，指齐顷公。 [4]逢丑父：齐国大夫。右：车右。 [5]解张、郑丘缓：都是晋臣，郑丘是复姓。郤（x ）克，晋国大夫，是这次战争中晋军的主帅。又称郤献子、郤子等。 [6]姑：副词，姑且。翦灭：消灭，灭掉。朝食：早饭。这里是吃早饭的意思。这句话是成语灭此朝食的出处。 [7]不介马：不给马披甲。介：甲。这里用作动词，披甲。驰之：驱马追击敌人。之：代词，指晋军。 [8] 未绝鼓音：鼓声不断。古代车战，主帅居中，亲掌旗鼓，指挥军队。兵以鼓进，击鼓是进军的号令。 [9] 病：负伤。 [10]张侯，即解张。张是字，侯是名，人名、字连用，先字后名。 [11]合：交战。贯：穿。肘：胳膊。 [12]朱：大红色。殷：深红色、黑红色。 [13]吾子：您，尊敬。比说子更亲切。 [14]苟：连词，表示假设。险：险阻，指难走的路。 [15]识：知道。之，代词，代苟有险，余必下推车这件事，可不译。 [16]师之耳目：军队的耳、目（指注意力）。在吾旗鼓：在我们 “读读童谣和儿歌”教案设计 教学目标 1.鼓励学生阅读童谣和儿歌，在交流阅读感受的过程中体验阅读的乐趣。 2.创设浓厚的读书氛围，激发学生产生读童谣和儿歌的兴趣，学会与人分享阅读的乐趣，初步培养学生独立进行课外阅读童谣和儿歌的良好习惯。(重点) 3.在充分的阅读中，引导学生积累丰富的语言，培养语感，发展思维，提高语文素养。(难点) 课前准备 1.多媒体课件。(教师) 2.学生和家长一起读书，并准备一本童谣或儿歌的书带到学校。(学生) 教学过程 一、背诵童谣，激发情感 1.导入：同学们，你们喜欢听童谣或儿歌吗？把你喜欢的一首童谣或儿歌背给大家听听，好吗？ 2.导学：一首好的童谣就是一首美妙的诗，一首好的儿歌就是一幅美丽的画。从你们洋溢着快乐的小脸可以看出，儿歌和童谣真的给你们带来了许多快乐！让我们一起走进今天的《快乐读书吧》，分享童谣和儿歌带给我们的幸福和快乐！ 设计意图：学生对儿歌和童谣的学习不是零起点，新课伊始，通过互动交流，引导学生初步交流儿歌和童谣带来的乐趣，从而乐于阅读更多的童谣和儿歌。为学生营造出良好的读书氛围。 二、尝试提问，感受阅读 (一)学习童谣——《摇摇船》。 1.导入：同学们，童谣《摇摇船》会带给我们怎样的幸福呢？我们一起来学习童谣《摇摇船》。 2.导学：读读题目，你有什么问题要问吗？ 预设：谁在摇船？ 他要摇船去哪儿？ 他是怎么摇的呢？ ………… 读读童谣，看看能不能从童谣中找到答案。 4.出示学习要求： (1)借助拼音读准童谣。 (2)和同桌比比谁读得最正确。 (3)带着问题再读童谣，看谁解决的问题多。 (4)谁还能提出新的问题？ 5.学生按要求自学童谣。 6.汇报交流。 (1)指学生比赛读童谣。教师相机引导学生正音。 (2)学生尝试回答前面提出的问题，教师相机引导学生互相补充，鼓励学生说完整的话。 (3)你又产生了什么新的问题？ 预设一： 外婆为什么叫“我”好宝宝？ ①导学：你的外婆都什么时候叫你好宝宝呢？ ②学生尝试解答。 ③小结：对呀，你们的想法都对。这么懂事的宝宝外婆怎么能不喜欢呢？ 预设二： 摇船怎么会摇出那么多好吃的？ ①导学：对呀，明明是摇船，怎么还摇出好吃的了？和同桌说说你的想法。 ②学生尝试解答。 ③教师追问：如果是你摇船，摇到外婆家，看到这么多好吃的，你高兴吗？读出你此刻的心情。 ④指导学生有感情地朗读童谣。 7.指导学生比赛背诵童谣。 8.学生边背童谣边做动作。 (二)学习儿歌——《小刺猬理发》。 1.导入：同学们，你们见过小刺猬吗？ 2.导学：读读题目，你有什么问题要问吗？ 预设：小刺猬为什么要去理发？ 谁给小刺猬理的发？ 小刺猬理完发漂亮吗？ …………浅谈小班幼儿绘本快乐阅读
古代晋灵公不君、齐晋鞌之战原文及译文
小学语文阅读短文及答案
六人英语短剧(大学)
绘本教案快乐是什么
小学语文阅读训练100篇(附参考答案)
大学英语剧本(大学生活)
如何翻译古文
阅读中的感悟和乐趣
大学英语舞台剧剧本
齐晋鞌之战原文和译文
小学语文中高年级阅读理解附答案快乐与感触
大学英语四人情景短剧
中班绘本教案快乐是什么
《鞌之战》阅读答案(附翻译)原文及翻译
(教案1)快乐读书吧：读读童谣和儿歌(含反思)【最新人教版 部编语文一年级下册】