一. 机器感知
- 图书
- 课程
- 论文
- 滤波算法
- 姿态解算,活动识别
- Body Track
- Inertial Navigation System
- Pedestrian Localisation for Indoor Environments, Oliver J. Woodman
- Pedestrian tracking with shoe-mounted inertial sensors, Eric Foxlin
- 定位算法与系统
- Infrastructure-free 定位
- Wifi Fingerprint 定位
- 可见光定位
- CSI 定位
- http://dhalperi.github.io/linux-80211n-csitool/#overview (802.11n CSI tool)
- Introduction to Music Algorithm
- 鲁棒定位算法
- 基于非监督学习Wifi定位
- No need to war drive (Mobisys12)
- LiFS, locating in fingerprint space (Mobicom 12)
- 语义定位
- Predict Location Semantics (Ubicomp16)
- 摄像头定位
- 软件和代码
- 滤波算法
- 姿态解算,惯性导航
- Openshoe: http://www.openshoe.org/
- WiFi Locating
- WIFI CSI Tool
- 802.11n CSI Tool, The CSI Tool is built on the Intel Wi-Fi Wireless Link 5300 802.11n MIMO radios, using a custom modified firmware and open source Linux wireless drivers. The page includes a list a papers on CSI based localization and applications.
- 数据集
- Human Activity Recognition Dataset
- UCI: Human Activity Recognition Using Smartphones Data Set
- UniMiB SHAR Dataset
- Human Activity/Context Recognition Datasets, a list of human activity recognition datasets
- Dataset for ADL Recognition with Wrist-worn Accelerometer: Recordings of 16 volunteers performing 14 Activities of Daily Living (ADL) while carrying a single wrist-worn tri-axial accelerometer.
- Activity Recognition from Single Chest-Mounted Accelerometer: The dataset collects data from a wearable accelerometer mounted on the chest. The dataset is intended for Activity Recognition research purposes.
- Wifi Indoor Locating Dataset
- KIOS WiFi RSS dataset
- Hybrid Indoor Positioning Dataset from WiFi RSSI, Bluetooth and magnetometer Data Set
- UJIIndoorLoc: The UJIIndoorLoc is a Multi-Building Multi-Floor indoor localization database to test Indoor Positioning System that rely on WLAN/WiFi fingerprint.
- Miskolc IIS Hybrid IPS: The dataset was created for the comparison and evaluation of hybrid indoor positioning methods. The dataset presented contains data from W-LAN and Bluetooth interfaces, and Magnetometer.
- BLE RSSI Dataset for Indoor localization and Navigation: This dataset contains RSSI readings gathered from an array of Bluetooth Low Energy (BLE) iBeacons in a real-world and operational indoor environment for localization and navigation purposes.
- Indoor User Movement Prediction from RSS data: This dataset contains temporal data from a Wireless Sensor Network deployed in real-world office environments. The task is intended as real-life benchmark in the area of Ambient Assisted Living.
- Human Activity Recognition Dataset
二. 复杂网络
- 数据集
- KONECT contains over a hundred network datasets of various types, including directed, undirected, bipartite, weighted, unweighted, signed and rating networks.
- NetWiki contains links to a large collection of network data
- Stanford Large Network Dataset Collection contains a collection of large networks mainly from social and web-based domains
- Mark Round's map of data formats and software tools
- easyN allows the creation of gene interaction networks (either physical or genetic) but also the creation of Petri net models. The tool also allow the users to save their networks online and, if they want, publish them.
- 网络分析软件工具
- igraph is a free software package for creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community structure search. It can be downloaded as a C library, an R package or a Python extension
- Brain Connectivity Toolbox contains a large selection of complex network measures in Matlab.
- MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.
- Stanford Network Analysis Platform (SNAP) is a general purpose, high performance system for analysis and manipulation of large networks. The core SNAP library is written in C++ and optimized for maximum performance and compact graph representation. It easily scales to massive networks with hundreds of millions of nodes, and billions of edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random graphs, and supports attributes on nodes and edges.
- Osaka University has released a method called PAFit to estimate the preferential attachment function of a growing complex network. Based on a rigorous statistical framework, PAFit can estimate the preferential attachment function non-parametrically. The related paper is at dx.doi.org/10.1371/journal.pone.0137796 . There is also an R package at cran.r-project.org/package=PAFit
- 网络可视化软件
- Gephi is an interactive visualization and exploration platform for all kinds of networks and complex systems, dynamic and hierarchical graphs. Runs on Windows, Linux and Mac OS X. Gephi is open-source and free.
- GUESS is an exploratory data analysis and visualization tool for graphs and networks. The system contains a domain-specific embedded language called Gython (an extension of Python, or more specifically Jython) which supports the operators and syntactic sugar necessary for working on graph structures in an intuitive manner. An interactive interpreter binds the text that you type in the interpreter to the objects being visualized for more useful integration. GUESS also offers a visualization front end that supports the export of static images and dynamic movies.
- PAJEK is a program for large network analysis.
- MapEquation (by Martin Rosvall and Daniel Edler) can be used to visualize and highlight important structures in large networks such as communities and how they evolve over time (alluvial diagrams) and more.
- Circos visualizes data in a pretty circular layout.
- SpaTo Visual Explorer can be used to reduce a network to the shortest-path tree of a selected root node, yielding a local but simpler view of the network that can be easily visualized. With the ability to quickly change the root node, the program allows us to explore the network from different perspectives.
- A VERY long list of network visualization softwares can also be found here - it was published in a review article by Cserely et al 2013 in Pharmacology and Therapeutics.
- 网络期刊和会议
- Network Science (Cambridge University Press)
- NetSci
- European Conference on Complex Systems (ECCS)
- CompleNet
- Network Frontier Workshop
- 网络科学讲座、博客
- Madan Babu (Systems Biology group, MRC Laboratory of Molecular Biology) - talk
- Ed Bullmore (Brain Mapping Unit, Department of Psychiatry) - talk
- Sanjeev Goyal (Faculty of Economics) - talk
- Cecilia Mascolo (Networks and Operating Systems Group, Computer Laboratory) - talk
- Franco M Neri (Epidemiology and Modelling Group, Department of Plant Sciences ) - talk
- Complexity and Social Networks Blog (David Lazer)
- Three-Toed Sloth (Shalizi Cosma)
- Visual Complexity (a unified resource space for anyone interested in the visualization of complex networks)
三. 图实现
- 图书
- Combinatorial Rigidity, 1993, This book includes an introduction to matroid theory and an extensive study of planar rigidity. The final chapter is devoted to higher-dimensional rigidity.
-
Handbook of Discrete and Computational Geometry, 3rd Edition, edited by Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth, CRC Press LLC, Boca Raton, FL, 2017.
- Handbook of Discrete and Computational Geometry, Second Edition,
- Handbook of discrete and computational geometry, First edition, Edited by Jacob E. Goodman, Jacob E. Goodman, 1998
- Foundations of 3D Computer Graphics, Steven J. Gortler, An introduction to the basic concepts of 3D computer graphics that offers a careful mathematical exposition within a modern computer graphics application programming interface.
- 课程
- Semidefinite Programming and Universal Rigidity, Standford, Yinyu Ye
- Notes on the Rigidity of Graphs, Bill Jackson
- Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks (Tibor Jordán)
- 论文
- Rigidity Theory
- Rigid and Global Rigid
- Characterizing Generic Global Rigidity, some slides , a talk on this topic. Steven J. Gortler
- The number of equivalent realisations of a rigid graph; B.Jackson and J.C.Owen
- A necessary condition for generic rigidity of bar-and-joint frameworks in d-space; B.Jackson
- Global Rigidity of Triangulations with Braces (Tibor Jordán, Shin-ichi Tanigawa)
- Universal Rigid
- Characterizing the Universal Rigidity of Generic Frameworks, some slides . Steven J. Gortler
- Generically globally rigid graphs have generic universally rigid frameworks. Steven J. Gortler
- Generic Global and Universal Rigidity, Steven J. Gortler
- Direction Length Graphs
- Global rigidity of 2-dimensional direction length frameworks, 2016, In this paper, we characterise global rigidity for generic direction-length frameworks whose associated rigidity matroid is connected, by showing that such frameworks are globally rigid if and only if every 2-separation of the underlying graph is direction-balanced.
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids, 2016, Katie Clinch
- Boundedness, rigidity and global rigidity of direction–length frameworks, 2011, Bill Jackson
- Necessary Conditions for the Global Rigidity of Direction–Length Frameworks, 2011, Bill Jackson, Peter Keevash
- Matrix Completion
- Combinatorial Conditions for the Unique Completability of Low Rank Matrices (Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa)
- Unique low rank completability of partially filled matrices (Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa)
- Realization by Path
- Determining Generic Point Configurations From Unlabeled Path or Loop Lengths, Steven J. Gortler
- Rigid and Global Rigid
- Network Localizability
- Uniquely localizable networks with few anchors (Zsolt Fekete, Tibor Jordán)
- Graph theoretical techniques in the analysis of uniquely localizable sensor networks, B.Jackson, T. Jord´an
- Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization, Zheng Yang, Yunhao Liu, et al.
- Understanding Node Localizability of Wireless Ad-hoc Networks, Zheng Yang, Yunhao Liu, et al.
- Beyond Trilateration: On the Localizability of Wireless Ad-hoc Networks, Zheng Yang, Yunhao Liu, et al.
- Localization in Wireless Sensor Networks Using Rigid Graphs: A Review, In this paper we will scrutinize the sound theoretical background which defines the need of rigid graph based localization and different localization techniques, with associated algorithms which uses the concepts of rigid graphs.
- SDP
- On Sensor Network Localization Using SDP Relaxation
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization, The sparse SDP relaxation applied to the QOP is much faster than the Biswas–Ye SDP relaxation, and the sparse variant of the Biswas–Ye SDP relaxation outperforms all other SDP relaxations in speed.
- Conditions for Correct Sensor Network Localization Using SDP Relaxation, by
- a graph decomposition procedure, which allows us to identify certain sparse generically universally rigid subgraphs of the input graph.
- SPASELOC: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization, SIAM Journal on Optimization, 2006, Michael Carter, Holly Jin, Michael Saunders, Yinyu Ye
- A notes of SDP based sensor network localization by convex optimization.
- Semidefinite programming approaches for sensor network localization with noisy distance measurements
- Semidefinite Programming Approach for the Quadratic Assignment Problem with a Sparse Graph, J. F. S. Bravo Ferreira, Y. Khoo, A. Singer
- Global registration of multiple point clouds using semidefinite programming
- SMACOF
- ARAP, Rigid component Synchronization
- An As-Rigid-As-Possible Approach to Sensor Network Localization, Lei Zhang et al.
- ASAP, Eigenvector Synchronization
- Sensor Perturbation
- Sensor Network Localization Using Sensor Perturbation, journal version here
- Rigidity Theory
- 软件代码
四. 运筹学
- 图书
- 《运筹学》第四版,胡运权,清华大学出版社
- 《凸优化》,王书宁,清华大学出版社
- 《Linear and Nonlinear Programming》,
- 课程
- 王永才《运筹学》, 2018年本科生课程课件
- 胡运权《运筹学》第四版图书,配套课件
- 论文
- Vehicle Routing Problems
- Pickup and Delivery Problems
- Column Generation Algorithms
- Wireless Charging Optimization Problems
- 软件代码
- 线性规划:
- 非线性规划:
- 混合整数线性规划:
- 最短路径算法
- Dijkstra
- Bellman-Ford-Moore (BMF) which supports negative edges
- Floyd Algorithm: many-to-many shortest path
- A tutorial of Floyd-Warshall Algorithm
- Floyd Shortest Path Routing, Matlab
- FLOYD: Shortest Distances Between Nodes in a Directed Graph, Matlab Library
- Vectorized Floyd-Warshall, Matlab
- 逐次逼近算法(Successive approximation)
- 最小费用最大流算法
- 动态规划
- Dynamic Programming Notes with Matlab Code
- CompEcon Toolbox for Matlab, CompEcon is a set of MATLAB functions for solving a variety of problems in economics and finance. It includes routines for solving discrete and continuous time dynamic programming problems.
- 0-1 Knapsack problem using Dynamic programming, a complete implementation of 0-1 knapsack problem using matlab.
- VRP问题
- OpenVRP: This framework allows for quick implementation of simple TSP/VRP problems to more complicated VRPTW, PDPTW, MDCPVRPPDTW problems.
- Markov Decision Problem (MDP)
- Markov Decision Processes (MDP) Toolbox, A series of Functions related to the resolution of discrete-time Markov Decision Processes.
- MDP Toolbox, The MDPtoolbox proposes functions related to the resolution of discrete-time Markov Decision Processes: backwards induction, value iteration, policy iteration, linear programming algorithms with some variants.