代码空间


摘要(Abstract)

MQTT 的要求非常少，因为它专为资源有限的嵌入式设备设计。 除了占地空间少之外，MQTT 还可提供出色的通信高效性（即使通过低带宽网络进行通信）和非常少的开销（较之 HTTP 等协议）。 在 3G 网络中，MQTT 的吞吐量速度是使用 HTTP 的表述性状态转移 (REST) 的 93 倍。 Modbus 自 1979 年首次出现至今，Modbus 已经演变为一套全面的支持多种物理链接的协议集（如 RS-485）。 Modbus 的核心是一个串行通信协议，采用主从模式。 主机向从机发送请求，从机予以回复。


主题(Topic)
ace Mqtt MODBUS DDS 数据分发服务 报警通知服务
n-acetylcysteine agent 运营 Configuration FPGA PLC CPS 人机接口 调度引擎 Operation 信息物理系统 ASIC Scheduling engine 数控机床 Fog calculation 网格计算 媒体访问控制 SDN 雾计算 通讯技术 SCADA NFV pattern integration 现场可编程门阵列 OT HMI grid calculation vPLC BACnet 图模一体化 MAC Akraino TSN EAAS CT 5G 特定应用集成电路 组态 openedge CNC XOS communication technology EnOcean
data distribution service alarm notification service epl rtti dds-format ice idl python-stackless pragma directdraw datawriter jquery-sort qcc build.xml qnx qos synchronous nsis amqp tao opensplice msmq handle datareader armv8 interfacing collada data-collection publish-subscribe command-prompt ddsort opendds ibm-midrange data-distribution-service ace ant rti-dds

base-n connect-n curry-n jupyter-n n-able n-api n-auth n-back n-bit n-bitsignedarithmetic n-blocks n-blog n-closest n-dimensional n-dimensions n-gate n-hentai n-integration n-layer n-layers n-map n-mixture n-pay n-player n-puzzle n-queen n-queens n-rooks n-rule n-scale n-sentinel n-series n-step n-sudoku n-threads n-tree n-triples n-vector pop-n rank-n statistical-n tls-n best-of-n bits-n-bites chip-n-dale code-n-counter cross-n-cicle drag-n-drop drop-n-crop
项目(Project)
DanielBodnar/awesome-nac SvenWoltmann/o-notation-and-time-complexity rougier/nano-splash taboo09/NQueens Morwenn/vergesort kjahan/queens AndresHF/First-react-native-app nefenit/factorial TasfiqulGhani/NQueensProblem mimamulhassankhan/ema-jhon-server rougier/nano-modeline EDAII/Lista3_Gabriel_e_Zarbielli thanks4opensource/markoplexing rougier/nano-theme mohammadAsadolahi/solving-Nqueens-with-Genetic-algorithm-in-python markisus/sum-one-to-n ArthurRouquan/KargerSteinAlgorithm Snocember/hello-world jessesealand/oeis-A114216-derivatives zigui-ps/VoronoiDiagram omidekz/soduko-solver Avinandan-Kundu/R3-Task2-Part1-Avi alesguzik/ruby_is black-fractal/n-queens aalekhpatel07/n-n-k-game tbw1995/Sudoku-Solver-Constrained 0) { fflush (stdin); scanf ("%c", &tentativa[ajuda]); for(j = 0; j < COLUNA; j++) { if (tentativa[ajuda] == jogo[aux][j]) { vetor[j] = tentativa[ajuda]; vencer ++; } else if (jogo[aux][j] == '\0') { break; } else { cont ++; } } if (cont == strlen (jogo[aux])) { vida --; } for (i = 0; i < strlen (jogo[aux]); i++) { printf ("%c ", vetor[i]); } cont = 0; ajuda++; printf ("\t[%d] - CHANCES RESTANTES\n\n", vida); if (vencer == strlen (jogo[aux])) { printf ("\n\t********** VOCE ACERTOU!!! **********\n\n\n"); system ("pause"); break; } if (vida == 0) { printf ("\n\t********** GAME OVER **********\n\n\n"); system ("pause"); } }break; case 2: system ("cls"); printf("\n\n"); for (i = 0; i < LINHA; i++) { printf ("[%d] >>> %s\n", (i + 1), jogo[i]); } printf("\n\n"); system ("pause"); break; case 3: system ("cls"); printf("\n\n\n\t\t************** SOBRE **************\n\n\n"); printf("\t+-------------------------------------------------+\n"); printf("\t| UNIVERSIDADE ESTADUAL DE SANTA CRUZ - UESC |\n"); printf("\t| GRADUACAO: Ciencia da Computacao |\n"); printf("\t| PROGRAMADOR: Bruno dos Santos Padre |\n"); printf("\t| FINALIDADE: criterio de avaliacao |\n"); printf("\t| VERSAO: 1.0 |\n"); printf("\t+-------------------------------------------------+\n\n\n"); system ("pause"); break; case 4: system ("cls"); printf("\n\n\n\t\t***************** AJUDA *****************"); printf("\n\n\n\t+--------------------------------------------------------+\n"); printf ("\t| O objetivo deste game é descobrir uma palavra |\n"); printf ("\t| adivinhando as letras que ela possui. |\n"); printf ("\t| A cada rodada, o jogador ira escolher uma letra |\n"); printf ("\t| que possa fazer parte da palavra. |\n"); printf ("\t| Caso a palavra contenha esta letra, |\n"); printf ("\t| será mostrado em que posicao ela está. |\n"); printf ("\t| caso esta letra não exista na palavra, |\n"); printf ("\t| o jogador perdera uma chance. Se zerar as chances, |\n"); printf ("\t| o jogador estará fora da partida. |\n"); printf("\t+--------------------------------------------------------+\n"); system ("pause"); break; case 0: exit (0); break; default: printf ("\t******** ERRO. TENTE NOVAMENTE!!! ********\n"); } } while (menu_opcao != 5); return 0; }" class="topic-tag topic-tag-link"> Brunozik/JOGO-DA-FORCA-EM-C tassosblackg/N-Queens emasys/Hapi-js takeshi19/TrainHub 全部项目