@ rocrocket programming] $ sort-n-k 2-T: facebook.txtApple: 10: 2.5Orange: 20: 3.4Banana: 30: 5.5Pear: 90:2.3
We use the colon as the delimiter and sort the values in ascending order for the second column. The result is satisfactory.
7. Other common sort options
-F converts lowercase letters to uppercase letters for comparison, that is, the case is ignored.
-C checks whether the file is sorted out. If the file is in disordered order, information about the first unordered row is output, and 1 is
Linux Kernel upgrade-update NIC DriverThe current kernel (2.6.32-220. el6.x86 _ 64) upgrade to the target kernel (2.6.33-110. el6.x86 _ 64), but the compiled target kernel (2.6.33-110. the corresponding driver of el6.x86 _ 64) does not necessarily support the corresponding device of the current system. This article describes in detail how the target kernel driver cannot support the current Nic device.01. Co
This original article belongs to "Linux greenhouse" blog, the blog address is http://roclinux.cn. The author of the article is rocrocket.In order to prevent the vicious reproduction of some websites, special in each article before adding this information, but also hope that readers understand. ===[Start of body]Sometimes learning scripts, you will find the sort command followed by a bunch of similar-k1,2, or-k1.2-k3.4 things, some unthinkable. Today, we'll take care of it--k options!1 Preparing
:2.5orange:20:3.4banana:30:5.5pear:90:2.3We use the colon as the spacer, and we sort the numbers in ascending order for the second column, and the result is very satisfying.7 Other sort common options-F converts lowercase letters to uppercase for comparison, i.e. ignores case-C checks to see if the file is ordered, and if it is out of order, it outputs the information about the first scrambled row, and finally returns 1-C Checks if the file is ordered, if it is not output, returns only 1-M is so
the numbers in ascending order for the second column, and the result is very satisfying.7 Other sort common options-F converts lowercase letters to uppercase for comparison, i.e. ignores case-C checks to see if the file is ordered, and if it is out of order, it outputs the information about the first scrambled row, and finally returns 1-C Checks if the file is ordered, if it is not output, returns only 1-M is sorted by month, for example, Jan is less than Feb and so on-B ignores all the blank p
the numbers in ascending order for the second column, and the result is very satisfying.7 Other sort common options-F converts lowercase letters to uppercase for comparison, i.e. ignores case-C checks to see if the file is ordered, and if it is out of order, it outputs the information about the first scrambled row, and finally returns 1-C Checks if the file is ordered, if it is not output, returns only 1-M is sorted by month, for example, Jan is less than Feb and so on-B ignores all the blank p
-router) # area 2 virtual-link 3.3.3.3 -- virtual link (R2 → R3)R2-jin (config-router) # end
R2-jin # show ip route2.0.0.0/32 is subnetted, 1 subnetsC 2.2.2.2 is directly connected, Loopback0O route 0.0.0/8 [110/66] via 172.16.0.1, 00:00:10, FastEthernet0/0C 172.16.0.0/16 is directly connected, FastEthernet0/0O E2 10.0.0.0/8 [110/100] via 192.168.0.1, 00:00:10, FastEthernet1/0C 192.168.0.0/24 is directly co
. cookie); location. href = \" http://www.wooyun.org/\ "", "I'm a porn website ")
2. Code ExecutionMany people like to add a new Tab and click the address in the bookmarks.The new tab of aoyou is mx: // there is more to do under the domain.
There is an api maxthon. program. Program. launch in mx: // res/notification /.Executable commandYou can directly call iframe mx: // res/notification /.
var s=document.createElement("iframe");s.src="mx://res/notification/";s.onload=function(){s.contentWindow
One, topology map
Ii. purpose of the experiment
Observe the routing of stub areas and Nssa areas and how default routes are generated
Note: Do not start R1 and R2, start other routers
Third, the experimental steps
STUB:
1. Configure the AREA1 into stub areas, see Configuration of stub areas and generation of LSA and default routes
Configure RIP redistribution to OSPF110 on the R7
router OSPF 110
Redistribute RIP subnets
Looking at the rout
phase DFD (Data flow diagram):Various layers of operation more explanations can be referred to http://caffe.berkeleyvision.org/tutorial/layers.htmlFrom the process of calculating the data flow of the model, the model parameters are probably 5kw+.The contents of this block are also included in the output of the Caffe, as detailed below:[CPP]View Plaincopyprint?
I0721 10:38:15.326920 4692 net.cpp:125] Top shape:256 3 227 227 (39574272)
I0721 10:38:15.326971 4692 net.cpp:125] Top shape:
In the ospf protocol, each interface has a cost value calculated by default formula based on its rate. The ospf protocol uses the cost value to determine the optimal path to the destination, if multiple paths reach the destination, the path with the lowest cost value is preferred. The Cost value is the sum of the cost values of all the interfaces that forward data along the destination. The following is an experiment to verify it.
The topology is as follows:
The route table on RT11 is as follo
) # int s0/0R4 (config-if )#Ip ospf priority 0
// It is found that R1 has become a DR, and now it has learned all the routes.
R4 # sho ip route ospf1.0.0.0/32 is subnetted, 1 subnetsO 1.1.1.1 [110/65] via 192.168.1.1, 00:00:32, Serial0/02.0.0.0/32 is subnetted, 1 subnetsO 2.2.2.2 [110/65] via 192.168.1.2, 00:00:32, Serial0/03.0.0.0/32 is subnetted, 1 subnetsO 3.3.3.3 [1
, then K % 6 = 5
Since the remainder is not 0, K = 10 and K = 11 are not required
3. Continue searching for the third digit. There are four possibilities:
For k = 10, the next digit may be 0, that is, K * 10 + 0. k = 100, then K % 6 = 4
The next digit may be 1, that is, K * 10 + 1. k = 101, then K % 6 = 5
For k = 11, the next digit may be 0, that is, K * 10 + 0. k = 110, then K % 6 = 2
The next digit may be 1, that is, K * 10 + 1. k = 111, then K % 6
/lyy289065406/6647917Solving methods: Bfs+ and Comodule theoremFirst of all, simple, non-pruning search methods:I take n=6 as an example.First decimal number, first digit (highest bit) must not be 0, that is, the highest bit must be 1
Set 6 "10 binary" to K, then must have k%6 = 0Now we're going to use BFS to find K-values.1, first search the highest bit of K, the highest bit must be 1, then k=1, but 1%6 = 1! = 0So k=1 is not asking for the remainder of the storage 12, search the next one, the n
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.