System "somaj" for CITY Beius
上傳時間： 2014-09-08
上傳用戶：mhp0114
This is a program with my school PWSZ CITY, maybe it s not great but it execute sorting buubble
標簽： buubble execute program sorting
上傳時間： 2013-12-20
上傳用戶：從此走出陰霾
Smart CITY Networks: Through the Internet of Things is composed of research results, analyses, and ideas, which focus on a diversity of interconnected factors relating with urbanization, its “smartness,” and overarching “internet of things (IoT).” The latter refers to interconnected objects and devices – through compu- tational operations – which can receive signals and actuate systems.
標簽： Networks Internet Through Things Smart CITY
上傳時間： 2020-05-26
上傳用戶：shancjb
該氣體分析儀是我公司吸取國內外同類產品先進經驗，獨立開發完成的一種高科技產品，該產品采用了國外先進的氧傳感器及紅外二氧化碳傳感器，配合現代的電子測量技術，使產品在測量精度上提高了一個檔次，同時為了便于用戶使用，整合了濕度傳感器及溫度傳感器。 一、主要性能： 1、對氧氣、二氧化碳、濕度、溫度進行測量。 a、氧氣含量的測定。采用英國CITY公司先進的氧傳感器。 b、二氧化碳含量。采用芬蘭維薩拉公司紅外二氧化碳傳感器。 c、濕度測量。本機集成了兩路濕度測量功能，１路位于進氣孔始端，另一路手持（可選）。采用法國Humirel公司產品。 d、溫度測量。（可選）采用德國進口鉑電阻溫度傳感器，以探針方式封裝，用于測量果蔬內部溫度。 2、采用便攜式設計，集成了免維護電池及氣泵，便于現場工作。 3、采用6寸液晶屏顯示，顯示內容直觀，外觀大方。 4、配有微型打印機，可打印樣本數據。 5、能夠保存250個樣本數據。 6、可與電腦聯機，把數據上傳到電腦長期保存。 7、可對電池虧電，運行錯誤報警。 二、性能參數： １、測量參數： a、氧氣測量范圍：0～25％，分辨率0.1%，精度0.2% b、二氧化碳測量范圍：0～10%,分辨率0.1%,精度0.2% c、濕度測量范圍：0～100%,分辨率0.1%,精度2% d、溫度測量范圍：－10～120℃，分辨率0.1℃，精度0.1℃(-10℃～+50℃) ２、整機尺寸：400MM x 160MM x 330MM
上傳時間： 2013-11-23
上傳用戶：tecman
用貪心算法做的全國31個城市之間的旅行商問題源代碼，可執行程序都在附件壓縮包內。里面的data.txt CITY.txt分別為數據表和城市名，要和可執行程序放在同一個目錄內才可執行
上傳時間： 2015-05-15
上傳用戶：獨孤求源
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. CITY or ZIP code to longitude and latitude, longitude and latitude to nearest CITY, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
標簽： location location-allocation Continuous alternate
上傳時間： 2015-05-17
上傳用戶：kikye
good morning,my dear teachers,my dear professors.i am very glad to be here for your interview.my name is song yonghao,i am 22 years old .i come from luoyang,a very beautiful aicent CITY.my undergratuade period will be accomplished in changan university in july ,2004 and now,i am trying my best for o
標簽： dear professors interview my
上傳時間： 2015-05-24
上傳用戶：shus521
This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <CITY file> <config file> Author: Liu Yang
標簽： Algorithm Travlling the Salesman
上傳時間： 2013-12-06
上傳用戶：nanfeicui
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination CITY for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist CITY1 CITY2, which means there is a connection between CITY1 and CITY2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination CITY for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: CITY dist which means the straight-line distance from the CITY to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each CITY exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標簽： Traveling Salesman solution Problem
上傳時間： 2013-12-22
上傳用戶：ruixue198909
