原创 PAT甲級1030

1030 Travel Plan (30 分) A traveler's map gives the distances between cities along the highways, together with the cost

原创 PAT甲級1090

1090 Highest Price in Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(經銷商), and supplie

原创 PAT甲級1072

1072 Gas Station (30 分) A gas station has to be built at such a location that the minimum distance between the station

原创 PAT甲級1004

1004 Counting Leaves (30 分) A family hierarchy is usually presented by a pedigree tree. Your job is to count those fami

原创 PAT甲級1079

1079 Total Sales of Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(經銷商), and suppliers

原创 PAT甲級1098

1098 Insertion or Heap Sort (25 分) According to Wikipedia: Insertion sort iterates, consuming one input element each re

原创 PAT甲級1064

1064 Complete Binary Search Tree (30 分) A Binary Search Tree (BST) is recursively defined as a binary tree which has th

原创 使用多任務級聯卷積網絡進行人臉檢測和對齊(MTCNN翻譯)

使用多任務級聯卷積網絡進行人臉檢測和對齊 摘要 在無約束的環境下,由於各種各樣的姿勢、光線強度以及面部遮擋等原因,人臉檢測和對齊是一個巨大的挑戰。最近的研究表明,深度學習的方法在這兩個任務上的表現令人印象深刻。在本文中,我們提出了一個深入

原创 TensorFlow+FaceNet+GPU訓練模型(超詳細過程)(四、模型訓練)

在所有的數據都處理完了之後,接下來就可以進行模型的訓練了。 在Github上FaceNet項目的介紹中有softmax和論文中提到的三元損失訓練triplet兩種方式,這邊簡單的介紹下softmax的訓練方法。 FaceNet已經將所有的

原创 PAT甲級1046

1046 Shortest Distance (20 分) The task is really simple: given N exits on a highway which forms a simple cycle, you are

原创 PAT甲級1034

1034 Head of a Gang (30 分) One way that the police finds the head of a gang is to check people's phone calls. If there

原创 PAT甲級1053

1053 Path of Equal Weight (30 分) Given a non-empty tree with root R, and with weight W​i​​ assigned to each tree node T

原创 PAT甲級1105

1105 Spiral Matrix (25 分) This time your job is to fill a sequence of N positive integers into a spiral matrix in non-i

原创 PAT甲級1106

1106 Lowest Price in Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(經銷商), and supplier

原创 PAT甲級1066

1066 Root of AVL Tree (25 分) An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two