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-19
上传用户：从此走出阴霾
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-25
上传用户：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-16
上传用户：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-23
上传用户：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-05
上传用户：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
上传时间： 2013-12-31
上传用户：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-21
上传用户：ruixue198909
