Nerwork neighbour

Dann 2000-03-19 04:08:00

Win9x下，怎样获得网上邻居中的各个计算机名？

...全文

250 10 打赏收藏转发到动态举报

写回复

用AI写文章

10 条回复

切换为时间正序

请发表友善的回复…

发表回复

Dann 2000-03-25

打赏
举报

谢谢两位!

Jackzhu 2000-03-21

打赏
举报

BOOL GetNetNeighbour(LPNETRESOURCE lpNetRC)
{
HANDLE hEnum = 0;

DWORD dwResult = WNetOpenEnum(RESOURCE_GLOBALNET, RESOURCETYPE_DISK, 0, lpNetRC, &hEnum);
if(dwResult != NO_ERROR)
return FALSE;

LPNETRESOURCE lpnrLocal = 0;
DWORD dwBuffer = 16384;
DWORD dwEntries = 0xFFFFFFFF;

lpnrLocal = (LPNETRESOURCE)GlobalAlloc(GPTR, dwBuffer);
dwResult = WNetEnumResource(hEnum, &dwEntries, lpnrLocal, &dwBuffer);

if(dwResult == NO_ERROR)
{
for(DWORD i = 0; i < dwEntries; i++)
{
// 得到邻居lpnrLocal[i];
}
}

if(lpnrLocal)
GlobalFree((HGLOBAL)lpnrLocal);
WNetCloseEnum(hEnum);

return TRUE;
}

Dann 2000-03-21

打赏
举报

mach:
我想参考一下你的源码，zhouyamin@private.21cn.com

mach 2000-03-20

打赏
举报

to Dann:
WNetXXX既可以在win nt下也可以在win 95/98下使用
我自己做过一个这样的控件(就是用WNetXXX,for win95/98/nt),你要的话我可以把源码发给你.

kxy 2000-03-20

打赏
举报

本站点的软件发布，winpopup加强版，Open Source , VC++
中有.http://www.midatech.com/csdn/softs/softview.asp?id=35

SoftDIY 2000-03-20

打赏
举报

www.codeguru.com有做好的EnumNetConnection类

Dann 2000-03-20

打赏
举报

I make a mistake.
WNetXXX only can be used in WinNT.

csdn2000 2000-03-20

打赏
举报

Dann 2000-03-19

打赏
举报

WNetXXX only can be used in Win9x.

xenogear 2000-03-19

打赏
举报

you can use WNetXXX API function for enumerate network resource, look msdn for more detailed information. regards.

The rules of the game ：Each individual occupies the vertex of a graph and derives a payoff, P, from interactions with adjacent individuals. A cooperator (blue) pays a cost, c, for each neighbour to receive a benefit, b. A defector (red) pays no cost and provides no benefit. The fitness of a player i

Data mining is the useful tool to discovering the knowledge from large data. Different methods & algorithms are available in data mining. Classification is most common method used for finding the mine rule from the large database. Decision tree method generally used for the Classification, because it is the simple hierarchical structure for the user understanding & decision making. Various data mining algorithms available for classification based on Artificial Neural Network, Nearest Neighbour Rule & Baysen classifiers but decision tree mining is simple one. ID3 and C4.5 algorithms have been introduced by J.R Quinlan which produce reasonable decision trees. The objective of this paper is to present these algorithms. At first we present the classical algorithm that is ID3, then highlights of this study we will discuss in more detail C4.5 this one is a natural extension of the ID3 algorithm. And we will make a comparison between these two algorithms and others algorithms such as C5.0 and CART.

Contents Foreword 7 1 Scope 8 2 References 8 3 Abbreviations and Definitions 9 3.1 Abbreviations 9 3.2 Definitions 9 4 Overall Architecture and Functional Split 10 4.1 Overall Architecture 10 4.2 Functional Split 11 4.3 Network Interfaces 13 4.3.1 NG Interface 13 4.3.1.1 NG User Plane 13 4.3.1.2 NG Control Plane 13 4.3.2 Xn Interface 14 4.3.2.1 Xn User Plane 14 4.3.2.2 Xn Control Plane 14 4.4 Radio Protocol Architecture 15 4.4.1 User Plane 15 4.4.2 Control Plane 15 4.5 Multi-RAT Dual Connectivity 16 5 Physical Layer 16 5.1 Waveform, numerology and frame structure 16 5.2 Downlink 17 5.2.1 Downlink transmission scheme 17 5.2.2 Physical-layer processing for physical downlink shared channel 17 5.2.3 Physical downlink control channels 18 5.2.4 Synchronization signal and PBCH 18 5.2.5 Physical layer procedures 19 5.2.5.1 Link adaptation 19 5.2.5.2 Power Control 19 5.2.5.3 Cell search 19 5.2.5.4 HARQ 19 5.3 Uplink 19 5.3.1 Uplink transmission scheme 19 5.3.2 Physical-layer processing for physical uplink shared channel 19 5.3.3 Physical uplink control channel 20 5.3.4 Random access 21 5.3.5 Physical layer procedures 21 5.3.5.1 Link adaptation 21 5.3.5.2 Uplink Power control 21 5.3.5.3 Uplink timing control 21 5.3.5.4 HARQ 21 5.4 Carrier aggregation 21 5.4.1 Carrier aggregation 21 5.4.2 Supplemental Uplink 22 5.5 Transport Channels 22 6 Layer 2 23 6.1 Overview 23 6.2 MAC Sublayer 24 6.2.1 Services and Functions 24 6.2.2 Logical Channels 25 6.2.3 Mapping to Transport Channels 25 6.2.4 HARQ 25 6.3 RLC Sublayer 25 6.3.1 Transmission Modes 25 6.3.2 Services and Functions 26 6.3.3 ARQ 26 6.4 PDCP Sublayer 26 6.4.1 Services and Functions 26 6.5 SDAP Sublayer 27 6.6 L2 Data Flow 27 6.7 Carrier Aggregation 27 6.8 Dual Connectivity 29 6.9 Supplementary Uplink 29 6.10 Bandwidth Adaptation 29 7 RRC 30 7.1 Services and Functions 30 7.2 Protocol States 31 7.3 System Information Handling 31 7.4 Access Control 32 7.5 UE Capability Retrieval framework 32 7.6 Transport of NAS Messages 33 7.7 Carrier Aggregation 33 7.8 Bandwidth Adaptation 33 8 NG Identities 33 8.1 UE Identities 33 8.2 Network Identities 33 9 Mobility and State Transitions 34 9.1 Overview 34 9.2 Intra-NR 34 9.2.1 Mobility in RRC_IDLE 34 9.2.1.1 Cell Selection 34 9.2.1.2 Cell Reselection 35 9.2.2 Mobility in RRC_INACTIVE 35 9.2.2.1 Overview 35 9.2.2.2 Cell Reselection 36 9.2.2.3 RAN-Based Notification Area 36 9.2.2.4 State Transitions 37 9.2.2.4.1 UE triggered transition from RRC_INACTIVE to RRC_CONNECTED 37 9.2.2.4.2 Network triggered transition from RRC_INACTIVE to RRC_CONNECTED 37 9.2.2.5 RNA update 38 9.2.3 Mobility in RRC_CONNECTED 38 9.2.3.1 Overview 38 9.2.3.2 Handover 39 9.2.3.2.1 C-Plane Handling 39 9.2.3.2.2 U-Plane Handling 41 9.2.4 Measurements 41 9.2.5 Paging 43 9.2.6 Random Access Procedure 43 9.2.7 Radio Link Failure 44 9.3 Inter RAT 44 9.3.1 Intra 5GC 44 9.3.1.1 Cell Reselection 44 9.3.1.2 Handover 45 9.3.1.3 Measurements 45 9.3.2 From 5GC to EPC 45 9.3.2.1 Cell Reselection 45 9.3.2.2 Handover 45 9.3.2.3 Measurements 45 9.3.2.4 Data Forwarding 45 9.4 Roaming and Access Restrictions 46 10 Scheduling 46 10.1 Basic Scheduler Operation 46 10.2 Downlink Scheduling 46 10.3 Uplink Scheduling 47 10.4 Measurements to Support Scheduler Operation 47 10.5 Rate Control 47 10.5.1 Downlink 47 10.5.2 Uplink 48 10.6 Activation/Deactivation Mechanism 48 11 UE Power Saving 48 12 QoS 49 13 Security 50 13.1 Overview and Principles 50 13.2 Security Termination Points 51 13.3 State Transitions and Mobility 51 14 UE Capabilities 51 15 Self-Configuration and Self-Optimisation 51 15.1 Definitions 51 15.2 UE Support for self-configuration and self-optimisation 51 15.3 Self-configuration 52 15.3.1 Dynamic configuration of the NG-C interface 52 15.3.1.1 Prerequisites 52 15.3.1.2 SCTP initialization 52 15.3.1.3 Application layer initialization 52 15.3.2 Dynamic Configuration of the Xn interface 52 15.3.2.1 Prerequisites 52 15.3.2.2 SCTP initialization 52 15.3.2.3 Application layer initialization 52 15.3.3 Automatic Neighbour Cell Relation Function 52 15.3.3.1 General 52 15.3.3.2 Intra-system – intra NR Automatic Neighbour Cell Relation Function 52 15.3.3.3 Intra-system – intra E-UTRA Automatic Neighbour Cell Relation Function 53 15.3.3.4 Intra-system – inter RAT Automatic Neighbour Cell Relation Function 53 15.3.3.5 Inter-system Automatic Neighbour Cell Relation Function 53 15.3.4 Xn-C TNL address discovery 53 16 Verticals Support 53 16.1 URLLC 53 16.1.1 Overview 53 16.1.2 LCP Restrictions 53 16.1.3 Packet Duplication 53 16.2 IMS Voice 54 16.3 Network Slicing 54 16.3.1 General Principles and Requirements 54 16.3.2 CN Instance and NW Slice Selection 55 16.3.2.1 CN-RAN interaction and internal RAN aspects 55 16.3.2.2 Radio Interface Aspects 55 16.3.3 Resource Isolation and Management 55 16.3.4 Signalling Aspects 56 16.3.4.1 General 56 16.3.4.2 CN Instance and NW Slice Selection 56 16.3.4.3 UE Context Handling 56 16.3.4.4 PDU Session Handling 57 16.3.4.5 Mobility 58 16.4 Public Warning System 59 Annex A (informative): QoS Handling in RAN 60 A.1 PDU Session Establishment 60 A.2 New QoS Flow without Explicit Signalling 60 A.3 New QoS Flow with NAS Reflective QoS and Explicit RRC Signalling 61 A.4 New QoS Flow with Explicit Signalling 62 A.5 Release of QoS Flow with Explicit Signalling 63 A.6 UE Initiated UL QoS Flow 64 Annex B (informative): Deployment Scenarios 66 B.1 Supplementary Uplink 66 Annex C (informative): Change history 67

1 引言 5 1.1 编写目的 5 1.2 预期读者和阅读建议 5 1.3 参考资料 5 1.4 缩写术语 5 2 General Description of RLC/MAC 6 3 RLC/MAC structure 7 3.1 RLC/MAC BLOCK FOR DATA TRANSFER 7 3.1.1 Downlink RLC data block 7 3.1.1.1 Payload Type 7 3.1.1.2 RRBP(Relative Reserved Block Period) 8 3.1.1.3 USF (Uplink state flag) 8 3.1.1.4 PR (Power Reduction) 8 3.1.1.5 TFI (Temporary Flow Identity) 8 3.1.1.6 Final block indicator (FBI) 8 3.1.1.7 BSN(Block Sequence Number) 8 3.1.1.8 LI(Length Indicator) 8 3.1.2 Uplink RLC data block 9 3.1.2.1 CV(Countdown Value) 9 3.1.2.2 TI（TLLI Indicator） 9 3.1.2.3 R (Retry) 9 3.1.2.4 SI (Stall indicator) 9 3.1.2.5 PI(PFI Indicator) 9 3.2 RLC/MAC BLOCK FOR CONTROL MESSAGE TRANSFER 10 3.2.1 Downlink RLC/MAC control block 10 3.2.1.1 RBSN(Reduced Block Sequence Number) 10 3.2.1.2 RTI(Radio Transaction Identifier) 10 3.2.1.3 AC(Address Control) 10 3.2.1.4 FS (Final Segment) 10 3.2.2 Uplink RLC/MAC control block 10 4 General description of MAC 12 4.1 GENERAL PROCEDURES IN PACKET IDLE AND PACKET TRANSFER MODES 12 4.1.1 Cell reselection 12 4.1.1.1 CCN is not supported in old cell 12 4.1.1.2 CCN is supported in old cell 12 4.1.2 System Information 13 4.2 MEASUREMENT REPORTS 13 4.2.1 Network Control (NC) measurement reporting 13 4.2.2 Extended measurement (EM) reporting 15 4.2.3 3G Neighbour Cell list 15 4.2.4 GSM Neighbour Cell list 16 4.2.5 GPRS 3G Cell Reselection list 16 4.3 PAGING PROCEDURES 16 4.3.1 Physical Channel Structure in GPRS 16 4.3.2 DRX 17 4.3.3 Paging procedure for RR connection establishment 17 4.3.4 Paging procedure for downlink packet transfer 18 5 MAC Procedures on PCCCH 21 5.1 INITIATED BY THE MOBILE STATION ON PCCCH 21 5.1.1 Packet Access Procedure 21 5.1.2 One Phase Access and Two Phase Access 21 5.1.2.1 One phase access 22 5.1.2.1.1 Contention Resolution 22 5.1.2.1.2 PACKET CONTROL ACKNOWLEDGEMENT 22 5.1.2.2 Two phase access 23 5.1.2.2.1 Contention Resolution 23 5.2 INITIATED BY THE NETWORK ON PCCCH 24 5.2.1 Packet polling procedure 25 6 MAC Procedures in Packet Transfer mode 26 6.1 UPLINK RLC DATA BLOCK TRANSFER 26 6.1.1 Dynamic allocation 26 6.1.1.1 Resource Reallocation for Uplink 27 6.1.1.2 Establishment of Downlink TBF when Uplink TBF exists 27 6.1.2 Extended Dynamic Allocation 28 6.1.3 Fixed Allocation 28 6.1.3.1 close-ended TBF and open-ended TBF 28 6.1.3.2 Resource Reallocation for open-ended TBF 28 6.1.4 Exclusive allocation 29 6.2 DOWNLINK RLC DATA BLOCK TRANSFER 29 6.2.1 Establishment of uplink TBF when downlink TBF exists 30 6.3 PACKET TBF RELEASE 31 6.4 PACKET PDCH RELEASE 31 6.5 NETWORK CONTROLLED CELL RESELECTION PROCEDURE 32 6.6 NETWORK ASSISTED CELL CHANGE PROCEDURES 33 7 Radio Link Control (RLC) procedures 35 7.1 STATE VARIABLES IN TRANSMITTING SIDE 35 7.2 STATE VARIABLES IN RECEIVING SIDE 35 7.3 SEGMENTATION AND RE-ASSEMBLY 36 7.4 RELEASE OF UPLINK TBF IN ACKNOWLEDGED MODE OPERATION 36 7.5 RELEASE OF DOWNLINK TBF IN ACKNOWLEDGED MODE OPERATION 37 7.6 RELEASE OF UPLINK TBF IN UNACKNOWLEDGED MODE OPERATION 38 7.7 RELEASE OF DOWNLINK TBF IN UNACKNOWLEDGED MODE OPERATION 39

VC/MFC

16,471

社区成员

421,732

社区内容

发帖

与我相关

我的任务

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

VC/MFC社区版块或许是CSDN最“古老”的版块了，记忆之中，与CSDN的年龄几乎差不多。随着时间的推移，MFC技术渐渐的偏离了开发主流，若干年之后的今天，当我们面对着微软的这个经典之笔，内心充满着敬意，那些曾经的记忆，可以说代表着二十年前曾经的辉煌……
向经典致敬，或许是老一代程序员内心里面难以释怀的感受。互联网大行其道的今天，我们期待着MFC技术能够恢复其曾经的辉煌，或许这个期待会永远成为一种“梦想”，或许一切皆有可能……
我们希望这个版块可以很好的适配Web时代，期待更好的互联网技术能够使得MFC技术框架得以重现活力，……

试试用AI创作助手写篇文章吧

+ 用AI写文章