Training Notes March 11 – 16

March 11, Thursday

Earlier this week, I got small injuries at either my anterior deltoid or biceps or pectoralis major. So I reduced the bench press volume from Sunday to Tuesday, zeroed bench press volume at Wednesday and here we goes the Thursday.

Bench press: 65 kg x 8 reps x 1 set. Still not a full recovery, but I managed to do one set. And to lower the tension from wherever the injury lies, I pulled my elbows closer to my torso, and got better muscle sense for the chest.

Romanian deadlift: 65 kg x 8 reps x 4 sets. The trajectory still needs refinement. The lower half range feels perfect, but the upper half range is a bit off and somehow the lower back is involved, which is not good.

Seated Cable Row: 35 kg x 15 reps x 2 sets, and 40 kg x 12 reps x 3 sets. I do get a bit sense that the muscles between scapulas are involved, however, lightly. I have to find out a better way to train the muscle groups at my back.

March 12, Friday

Late night working so I missed the training slot.

March 13, Saturday, Coach day.

Tried a few back training sets, single-side rope pulldown, basic dumbbell row, weighted pulldown machine. Did not find a perfect one. Single-side rope pulldown is a promising one, while pulling-down, bend over to the same side. Tried to position the hip a bit forward, but it is delicate. Too little, there is no sense on the back; too much, there is more involvement for the external oblique. Basic dumbbell row is good, but only when there is someone else assisting me to put the elbows close to my torso.

Did two sets of bench press for 60 kg x 8 reps. The coach thinks that my injury is around the  origin of clavicular head for pectoralis major. He give me some techniques to massage and relax the origin of clavicular head, and it helps. The strange things is that when pressing the first set, I feel sore and some pain inside my right shoulder, while I feel much better at the second set.

March 14, Sunday

Bench press: 65 kg x 8 reps x 4 sets

Romanian deadlift: 65 kg x 8 reps x 4 sets. I think this combination may be a bit excessive for my arm. The last two sets of deadlifts are like hell.

Front lat pulldown: 35 kg x 10 reps x 3 sets

Rear lat pulldown: 35 kg x 10 reps x 3 sets

March 15, Monday

Sandstorm today. Rest day.

March 16, Tuesday

Bench press: 65 kg x 8 reps x 4 sets, and 60 kg x 8 reps x 4 sets, and 60 kg static hold x 10 seconds.

Single-side rope pulldown: the most impressive training today. 15 kg x 10 reps x 2 sides x 3 sets, and 10 kg x 8 reps x 2 sides x 2 sets. I changed the movement a little bit today. First, I changed from straight-arm position to bend-arm position with elbows locked, and the tension on triceps are lower now. Second, I changed from bending the torso to rotating the torso while pulling down, and this is extremely good as I got really well muscle activation at almost every pull.

Seated cable row: 35 kg x 10 reps x 3 sets.

Target for Year 2021

Current Status (March 2021):

  • Body weight: 97 kg
  • Bench press: 65 kg x 8 reps x 4 sets
  • Romanian deadlift: 65 kg x 8 reps x 4 sets OR 60 kg x 10 reps x 4 sets
  • Front Squat: 10 kg x 8 reps x 4 sets

Target by the end of 2021:

  • Body weight: 95 kg
  • Bench press: 95 kg x 8 reps x 4 sets
  • Romanian deadlift: 95 kg x 8 reps x 4 sets
  • Front Squat: 60 kg x 8 reps x 4 sets

Current Training Drill:

  • Bench press
    • 20 kg warming up
    • 65 kg x 8 reps x 4 sets
    • 60 kg x 8 reps x 2 sets
    • 50 kg x 8 reps x 3~4 sets OR 50 kg static for 10~20 seconds
  • Romanian deadlift
    • 65 kg x 8 reps x 4 sets
  • Seated Cable Row
    • 35 kg x 15 reps x 3 sets
    • 40 kg x 12 reps x 3 sets

Word使用杂记 – 章节多级编号格式及其他

最近无奈开始使用Microsoft Word编辑文档,遇到诸多问题,也学到很多稀奇古怪的解决方法。


默认Arabic。假设我们需要章节格式是Roman,默认情况下多级标题就会变成I.1.1.1的格式。这时右击标题编号 – adjusting indents – more,选择子级heading,勾选右侧的legal format。这是首级标题和子级标题的格式就分开了。

Follow上一个问题,我们会遇到新的小问题。插入图表、公式等的caption的时候,如果选择了携带章节名, 默认格式 依然会变成I-1。有两种解决方案:

  1. 使用SEQUENCE:
    • 在每章标题后Ctrl+F9插入Field,建立新的SEQUENCE :{SEQ Chap \h}
    • 在caption处使用如下Filed code:Figure {SEQ Chap \c}-{SEQ Figure \* Arabic \s 1}
    • \c switch 查找前序最近一个Sequence编号
    • \s 1 switch每过一个outline level 1的节即重编码
  2. 使用Document Property:
    • File – Info – Advanced Properties自定义Properties,设置比如name=II,value=2
    • 在caption处使用如下Filed code:Figure {DOCPROPERTIES {STYLEREF 1 \s}}-{SEQ Figure \* Arabic \s 1}

公式编号也类似。但是为了便于cross-reference,使用Ctrl+Alt+Enter在公式和caption之间插入一个style break/seperator。这样cross-reference的时候引用出来就是不带公式原文的标签和编号。

BTW,Office 365要迁移为Microsoft 365了,据说有个很好用的基于AI的Microsoft Editor可以给出编辑建议。心水ing。

Linux Kernel SKBuff

I found some brief explaination of sk_buff from here and here.

The socket buffer, or “SKB”, is the most fundamental data structure in the Linux networking code. Every packet sent or received is handled using this data structure.

The most fundamental parts of the SKB structure are as follows:

struct sk_buff {
	/* These two members must be first. */
	struct sk_buff		*next;
	struct sk_buff		*prev;

	struct sk_buff_head	*list;

The first two members implement list handling. Packets can exist on several kinds of lists and queues. For example, a TCP socket send queue. The third member says which list the packet is on. Learn more about SKB list handling here.

	struct sock		*sk;

This is where we record the socket assosciated with this SKB. When a packet is sent or received for a socket, the memory assosciated with the packet must be charged to the socket for proper memory accounting. Read more about socket packet buffer memory accounting here.

	struct timeval		stamp;

Here we record the timestamp for the packet, either when it arrived or when it was sent. Calculating this is somewhat expensive, so this value is only recorded if necessary. When something happens that requires that we start recording timestamps, net_enable_timestamp() is called. If that need goes away, net_disable_timestamp() is called.

Timestamps are mostly used to packet sniffers. But they are also used to implement certain socket options, and also some netfilter modules make use of this value as well.

	struct net_device	*dev;
	struct net_device	*input_dev;
	struct net_device	*real_dev;

These three members help keep track of the devices assosciated with a packet. The reason we have three different device pointers is that the main ‘skb->dev’ member can change as we encapsulate and decapsulate via a virtual device.

So if we are receiving a packet from a device which is part of a bonding device instance, initially ‘skb->dev’ will be set to point the real underlying bonding slave. When the packet enters the networking (via ‘netif_receive_skb()’) we save ‘skb->dev’ away in ‘skb->real_dev’ and update ‘skb->dev’ to point to the bonding device.

Likewise, the physical device receiving a packet always records itself in ‘skb->input_dev’. In this way, no matter how many layers of virtual devices end up being decapsulated, ‘skb->input_dev’ can always be used to find the top-level device that actually received this packet from the network.

	union {
		struct tcphdr	*th;
		struct udphdr	*uh;
		struct icmphdr	*icmph;
		struct igmphdr	*igmph;
		struct iphdr	*ipiph;
		struct ipv6hdr	*ipv6h;
		unsigned char	*raw;
	} h;

	union {
		struct iphdr	*iph;
		struct ipv6hdr	*ipv6h;
		struct arphdr	*arph;
		unsigned char	*raw;
	} nh;

	union {
		unsigned char	*raw;
	} mac;

Here we store the location of the various protocol layer headers as we build outgoing packets, and parse incoming ones. For example, ‘skb->mac.raw’ is set by ‘eth_type_trans()’, when an eternet packet is received. Later, we can use this to find the location of the MAC header.

These members are potentially redundant, and could be removed. Read a discussion about that here.

	struct  dst_entry	*dst;

This member is the generic route for the packet. It tells us how to get the packet to it’s destination. Note that routes are used for both input and output. DST entries are about as complex as SKBs are, and thus probably deserve their own tutorial.

	struct	sec_path	*sp;

Here we store the security path traversed by the packet, if any. For example, on input IPSEC records each transformation which has been applied to the packet by a decapsulator. The records are an array of ‘struct sec_decap_state’ which each record the security assosciation that matched and got applied. Later, when we are trying to validate the security policy against a packet, we make sure that the transformations applied match the ones allowed by the policy.

	char			cb[40];

This is the SKB control block. It is an opaque storage area usable by protocols, and even some drivers, to store private per-packet information. TCP uses this, for example, to store sequence numbers and retransmission state for the frame.

	unsigned int		len,

The three length members are pretty straight-forward. The total number of bytes in the packet is ‘len’. SKBs are composed of a linear data buffer, and optionally a set of 1 or more page buffers. If there are page buffers, the total number of bytes in the page buffer area is ‘data_len’. Therefore the number of bytes in the linear buffer is ‘skb->len – skb->data_len’. There is a shorthand function for this in ‘skb_headlen()’.

static inline unsigned int skb_headlen(const struct sk_buff *skb)
	return skb->len - skb->data_len;

The ‘mac_len’ holds the length of the MAC header. Normally, this isn’t really necessary to maintain, except to implement IPSEC decapsulation of IP tunnels properly. This field is initialized once inside of ‘netif_receive_skb()’ to the formula ‘skb->nh.raw – skb->mac.raw’.

Since we only use this for one purpose, with some clever ideas we may be able to eliminate this member in the future. For example, perhaps we can store the value in the ‘struct sec_path’.

Finally, ‘csum’ holds the checksum of the packet. When building send packets, we copy the data in from userspace and calculate the 16-bit two’s complement sum in parallel for performance. This sum is accumulated in ‘skb->csum’. This helps us compute the final checksum stored in the protocol packet header checksum field. This field can end up being ignored if, for example, the device will checksum the packet for us.

On input, the ‘csum’ field can be used to store a checksum calculated by the device. If the device indicates ‘CHECKSUM_HW’ in the SKB ‘ip_summed’ field, this means that ‘csum’ is the two’s complement checksum of the entire packet data area starting at ‘skb->data’. This is generic enough such that both IPV4 and IPV6 checksum offloading can be supported.

	unsigned char		local_df,

The ‘local_df’ field is used by the IPV4 protocol, and when set allows us to locally fragment frames which have already been fragmented. This situation can arise, for example, with IPSEC.

In order to make quick references to SKB data, Linux has the concept of SKB clones. When a clone of an SKB is made, all of the ‘struct sk_buff’ structure members of the clone are private to the clone. The data, however, is shared between the primary SKB and it’s clone. When an SKB is cloned, the ‘cloned’ field will be set in both the primary and clone SKB. Otherwise is will be zero.

The ‘nohdr’ field is used in the support of TCP Segmentation Offload (‘TSO’ for short). Most devices supporting this feature need to make some minor modifications to the TCP and IP headers of an outgoing packet to get it in the right form for the hardware to process. We do not want these modifications to be seen by packet sniffers and the like. So we use this ‘nohdr’ field and a special bit in the data area reference count to keep track of whether the device needs to replace the data area before making the packet header modifications.

The type of the packet (basically, who is it for), is stored in the ‘pkt_type’ field. It takes on one of the ‘PACKET_*’ values defined in the ‘linux/if_packet.h’ header file. For example, when an incoming ethernet frame is to a destination MAC address matching the MAC address of the ethernet device it arrived on, this field will be set to ‘PACKET_HOST’. When a broadcast frame is received, it will be set to ‘PACKET_BROADCAST’. And likewise when a multicast packet is received it will be set to ‘PACKET_MULTICAST’.

The ‘ip_summed’ field describes what kind of checksumming assistence the card has provided for a receive packet. It takes on one of three values: ‘CHECKSUM_NONE’ if the card provided no checksum assistence, ‘CHECKSUM_HW’ if the two’s complement checksum over the entire packet has been provides in ‘skb->csum’, and ‘CHECKSUM_UNNECESSARY’ if it is not necessary to verify the checksum of this packet. The latter usually occurs when the packet is received over the loopback device. ‘CHECKSUM_UNNECESSARY’ can also be used when the device only provides a ‘checksum OK’ indication for receive packet checksum offload.

	__u32			priority;

The ‘priority’ field is used in the implement of QoS. The packet’s value of this field can be determined by, for example, the TOS field setting in the IPV4 header. Then, the packet scheduler and classifier layer can key off of this SKB priority value to schedule or classify the packet, as configured by the administrator.

	unsigned short		protocol,

The ‘protocol’ field is initialized by routines such as ‘eth_type_trans()’. It takes on one of the ‘ETH_P_*’ values defined in the ‘linux/if_ether.h’ header file. Even non-ethernet devices use these ethernet protocol type values to indicate what protocol should receive the packet. As long as we always have some ethernet protocol value for each and every protocol, this should not be a problem.

The ‘security’ field was meant to be used in the implementation of IP Security, but that never materialized. It can probably be safely removed. Since the next field is a pointer, and thus needs to be aligned properly, eliminating the ‘security’ field would unfortunately not buy us any space savings.

	void			(*destructor)(struct sk_buff *skb);
	unsigned int		truesize;

The SKB ‘destructor’ and ‘truesize’ fields are used for socket buffer accounting. See the SKB socket accounting page for details.

	atomic_t		users;

We reference count SKB objects using the ‘users’ field. Extra references can be obtained by invoking ‘skb_get()’. An implicit single reference is present in the SKB (that is, ‘users’ has a value of ‘1’) when it is first allocated. References are dropped by invoking ‘kfree_skb()’.

	unsigned char		*head,

These four pointers provide the core management of the linear packet data area of an SKB. SKB data area handling is involved enough to deserve it’s very own tutorial. Check it out here.


All network-related queues and buffers in the kernel use a common data structure, struct sk_buff. This is a large struct containing all the control information required for the packet (datagram, cell, whatever). The sk_buff elements are organized as a doubly linked list, in such a way that it is very efficient to move an sk_buff element from the beginning/end of a list to the beginning/end of another list. A queue is defined by struct sk_buff_head, which includes a head and a tail pointer to sk_buff elements.

All the queuing structures include an sk_buff_head representing the queue. For instance, struct sock includes a receive and send queue. Functions to manage the queues (skb_queue_head(), skb_queue_tail(), skb_dequeue(), skb_dequeue_tail()) operate on an sk_buff_head. In reality, however, the sk_buff_head is included in the doubly linked list of sk_buffs (so it actually forms a ring).

When a sk_buff is allocated, also its data space is allocated from kernel memory. sk_buff allocation is done with alloc_skb() or dev_alloc_skb(); drivers use dev_alloc_skb();. (free by kfree_skb() and dev_kfree_skb(). However, sk_buff provides an additional management layer. The data space is divided into a head area and a data area. This allows kernel functions to reserve space for the header, so that the data doesn’t need to be copied around. Typically, therefore, after allocating an sk_buff, header space is reserved using skb_reserve(). skb_pull(int len) – removes data from the start of a buffer (skipping over an existing header) by advancing data to data+len and by decreasing len.

struct sk_buff has fields to point to the specific network layer headers:

  • transport_header (previously called h) – for layer 4, the transport layer (can include tcp header or udp header or icmp header, and more)
  • network_header – (previously called nh) for layer 3, the network layer (can include ip header or ipv6 header or arp header).
  • mac_header – (previously called mac) for layer 2, the link layer.
  • skb_network_header(skb), skb_transport_header(skb) and skb_mac_header(skb) return pointer to the header.

The struct sk_buff objects themselves are private for every network layer. When a packet is passed from one layer to another, the struct sk_buff is cloned. However, the data itself is not copied in that case. Note that struct sk_buff is quite large, but most of its members are unused in most situations. The copy overhead when cloning is therefore limited.

  • Almost always sk_buff instances appear as “skb” in the kernel code.
  • struct dst_entry *dst – the route for this sk_buff; this route is determined by the routing subsystem.
    • It has 2 important function pointers:
      • int (*input)(struct sk_buff*);
      • int (*output)(struct sk_buff*);
    • input() can be assigned to one of the following : ip_local_deliver, ip_forward, ip_mr_input, ip_error or dst_discard_in.
    • output() can be assigned to one of the following :ip_output, ip_mc_output, ip_rt_bug, or dst_discard_out.
    • we will deal more with dst when talking about routing.
    • In the usual case, there is only one dst_entry for every skb.
    • When using IPsec, there is a linked list of dst_entries and only the last one is for routing; all other dst_entries are for IPSec transformers ; these other dst_entries have the DST_NOHASH flag set. These entries , which has this DST_NOHASH flag set are not kept in the routing cache, but are kept instead on the flow cache.
  • tstamp (of type ktime_t ) : time stamp of receiving the packet.
    • net_enable_timestamp() must be called in order to get values.





cat a.001.csv > all.csv
tail -n +2 a.002.csv >> all.csv


集成的小工具很好用呢 :)


The elements of statistical learning : data mining, inference, and prediction
ISBN 9780387848570
Authors Haste, Trevor
Publisher Springer
Copyright Date c2009
Price $89.95

Applied predictive modeling
ISBN 9781461468486
Authors Kuhn, Max
Publisher Springer
Copyright Date c2013
Price $89.95

Data Mining: Practical Machine Learning Tools and Techniques
ISBN 9780120884070
Authors Witten, I. H., Frank, E. and Hall, M. A.
Publisher Springer
Copyright Date 2011
Price $75.95