CS434/534 Reading List

最新推荐文章于 2024-08-31 23:13:29 发布
最新推荐文章于 2024-08-31 23:13:29 发布
阅读量877 收藏
点赞数
文章标签： 人工智能 java 网络
原文链接：http://www.cnblogs.com/Aioria0622/archive/2007/11/26/972362.html
版权
Vision and driving applications

Abstract: Ubiquitous computing is the method of enhancing computer use by making many computers available throughout the physical environment, but making them effectively invisible to the user. Since we started this work at Xerox PARC in 1988, a number of researchers around the world have begun to work in the ubiquitous computing framework. This paper explains what is new and different about the computer science in ubiquitous computing. It starts with a brief overview of ubiquitous computing, and then elaborates through a series of examples drawn from various subdisciplines of computer science: hardware components (e.g. chips), network protocols, interaction substrates (e.g. software for screens and pens), applications, privacy, and computational methods. Ubiquitous computing offers a framework for new and exciting research across the spectrum of computer science.

Three issues: wireless networking, mobility, and portability.

Abstract: A confusing array of new wireless 搖ntethered?communications services, for voice and data, in real-time or delayed, interactive or one-way, in-building or out-of-doors, are rapidly becoming available. In this paper, we argue that despite the widely varying issues of engineering that span the creation of these diverse wireless services, the unique underlying aspect is that they must be able to adapt to a constantly changing environment brought on by mobility. Mobile systems must be able to detect their transmission environment and exploit knowledge about its current situation, so-called 搒ituation awareness,?to improve the quality of communications. Handoff in cellular phone systems is one example of detection and reaction to the environment.

Mobility requires adaptability. By this we mean that systems must be location and situation-aware, and must take advantage of this information to dynamically configure themselves in a distributed fashion.

Abstract: This paper is an answer to the question: "What is unique and conceptually different about mobile computing?" The paper begins by describing a set of constraints intrinsic to mobile computing, and examining the impact of these constraints on the design of distributed systems. Next, it summarizes the key results of the Coda and Odyssey systems. Finally, it describes the research opportunities in five important topics relevant to mobile computing: caching metrics, semantic callbacks and validators, resource revocation, analysis of adaptation, and global estimation from local observations.

Abstract: Nomadic computing and communications is upon us. We are all nomads, but we lack the systems support to assist us in our various forms of mobility. In this paper, we discuss the vision of nomadicity, its technical challenges, and approaches to the resolution of these challenges. One of the key characteristics of this paradigm shift in the way we deal with the information is that we face dramatic and sudden changes in connectivity and latency. Our systems must be ``nomadically-enabled'' in that mechanisms must be developed that deal with such changes in a natural and transparent fashion. Currently, this is not the case in that our systems typically treat such changes as exceptions or failures; this is unacceptable. Moreover, the industry is producing ``piece parts'' that are populating our desktops, briefcases and belt-hooks, but that do not interoperate with each other, in general. We require innovative and system wide solutions to overcome these problems. Such are the issues we address in this paper.

Abstract: This paper summarizes the results of the BARWAN project, which focused on enabling truly useful mobile networking across an extremely wide variety of real-world networks and mobile devices. We present the overall architecture, summarize key results, and discuss four broad lessons learned along the way. The architecture enables seamless roaming in a single logical overlay network composed of many heterogeneous (mostly wireless) physical networks, and provides significantly better TCP performance for these networks. It also provides complex scalable and highly available services to enable powerful capabilities across a very wide range of mobile devices, and mechanisms for automated discovery and configuration of localized services. Four broad themes arose from the project: 1) the power of dynamic adaptation as a generic solution to heterogeneity, 2) the importance of cross-layer information, such as the exploitation of TCP semantics in the link layer, 3) the use of agents in the infrastructure to enable new abilities and to hide new problems from legacy servers and protocol stacks, and 4) the importance of soft state for such agents for simplicity, ease of fault recovery, and scalability.

  • [IEEE00] "IEEE Personal Communications: Smart Spaces and Environments," (Special Issue) 2000.
     
  • [Sat01] "Pervasive Computing: Vision and Challenges," M. Satyanarayanan, IEEE Personal Communications, Vol. 8, No. 4, (Aug. 2001), pp. 10-17.

    Abstract: This article discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use of smart spaces, invisibility, localized scalability, and masking uneven conditioning. Next, it sketches a couple of hypothetical pervasive computing scenarios, and uses them to identify key capabilities missing from today抯 systems. The article closes with a discussion of the research necessary to develop these capabilities.

Abstract: Networked sensors-those that coordinate amongst themselves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently from traditional network applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple communication model for describing localized algorithms.

  • [Abe00] H. Abelson, et. al., Amorphous computing , Communications of the ACM, 43(5), pp. 74?2, May 2000.

Abstract: As new fabrication and integration technologies reduce the cost and size of micro-sensors and wireless interfaces, it becomes feasible to deploy densely distributed wireless networks of sensors and actuators. These systems promise to revolutionize biological, earth, and environmental monitoring applications, providing data at granularities unrealizable by other means. In addition to the challenges of miniaturization, new system architectures and new network algorithms must be developed to transform the vast quantity of raw sensor data into a manageable stream of high-level data. To address this, we propose a tiered system architecture in which data collected at numerous, inexpensive sensor nodes is altered by local processing on its way through to larger, more capable and more expensive nodes. We briefly describe Habitat monitoring as our motivating application and introduce initial system building blocks designed to support this application. The remainder of the paper presents details of our

Experimental platform.

Abstract: This article addresses the challenges and opportunities of instrumenting the physical world with pervasive networks of sensor-rich, embedded computation. The authors present a taxonomy of emerging systems and outline the enabling technological developments.

Comment: related with Weiss's vision.

Abstract: In future smart environments, wireless sensor networks will play a key role in sensing, collecting, and disseminating information about environmental phenomena. Sensing applications represent a new paradigm for network operation, one that has different goals from more traditional wireless networks. This paper examines this emerging field to classify wireless micro-sensor networks according to different communication functions, data delivery models, and network dynamics. This taxonomy will aid in defining appropriate communication infrastructures for different sensor network application sub-spaces, allowing network designers to choose the protocol architecture that best matches the goals of their application. In addition, this taxonomy will enable new sensor network models to be defined for use in further research in this area.

Radio Propagations and Signal Modulation

Abstract: The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table with constant space regardless of cell density. We study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques. We focus on a many-to-one, periodic data collection workload. We narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments. The most effective solution uses a simple time averaged EWMA estimator, frequency based table management, and cost-based routing.

Media Access Control

Abstract: In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digit al assistants. Providing adequate network connectivity for these devices will require a new generation of wireless LAN technology. In this paper we study media access protocols for a single channel wireless LAN being developed at Xerox Corporation抯 Palo Alto Research Center. We start with the MACA media access protocol first proposed by Karn [9] and later refined by Biba [3] which uses an RTSCTS- DATA packet exchange and binary exponential backoff. Using packet-level simulations, we examine various performance and design issues in such protocols, Our analysis leads to a new protocol, MACAW, which uses an RTS-CTSDS- DATA-ACK message exchange and includes a significantly different backoff algorithm.

Comments: used in 802.11. extend MACA.

  • [SK97] ?a href="http://citeseer.nj.nec.com/stemm97measuring.html">Measuring and Reducing Energy Consumption of Network Interfaces in Hand-Held Devices,? Mark Stemm and Randy H Katz,  IEICE Transactions on Communications, vol. E80-B, no. 8, pp. 1125?131, Aug. 1997.

    Abstract: Next generation hand-held devices must provide seamless connectivity while obeying stringent power and size constrains. In this paper we examine this issue from the point of view of the Network Interface (NI). We measure the power usage of two PDAs, the Apple Newton Messagepad and Sony Magic Link, and four NIs, the Metricom Ricochet Wireless Modem, the AT&T Wavelan operating at 915 MHz and 2.4 GHz, and the IBM Infrared Wireless LAN Adapter. These measurements clearly indicate that the power drained by the network interface constitutes a large fraction of the total power used by the PDA. We then examine two classes of optimizations that can be used to reduce network interface energy consumption on these devices: transport-level strategies and application-level strategies. Simulation experiments of transport level strategies show that the dominant cost comes not from the number of packets sent or received by a particular transport protocol but the amount of time that the NI is in an active but idle state. Simulation experiments of application-level strategies that significant energy.

    Comment: reduce idle time is crucial.
     
  • [GK00] "The capacity of wireless networks,'' P. Gupta and P. R. Kumar, IEEE Transactions on Information Theory , vol. IT-46, no. 2, pp. 388-404, March 2000.
     
  • [WC01] "A Transmission Control Scheme for Media Access in Sensor Networks", Alec Woo and David Culler, Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, Mobicom 2001, Rome, Italy.

Abstract: We study the problem of media access control in the novel regime of sensor networks, where unique application behavior and tight constraints in computation power, storage, energy resources, and radio technology have shaped this design space to be very different from that found in traditional mobile computing regime. Media access control in sensor networks must not only be energy efficient but should also allow fair bandwidth allocation to the infrastructure for all nodes in a multihop network. We propose an adaptive rate control mechanism aiming to support these two goals and find that such a scheme is most effective in achieving our fairness goal while being energy efficient for both low and high duty cycle of network tracking.

COMMENT: 1) The network tends to operate as a collective structure, rather than supporting many independent point-to-point flows. Traffic tends to be variable and highly correlated. 2) The data that a networked sensor generates for each sample, such as a temperature value, is relatively small and, given the low bandwidth of the radio, data packets are kept small with a typical size around tens of bytes.

Abstract: This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption in listening to an idle channel, nodes periodically sleep. Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules. Inspired by PAMAS, S-MAC also sets the radio to sleep during transmissions of other nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network. We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley. The experiment results show that, on a source node, an 802.11 like MAC consumes 2? times more energy than S-MAC for traffic load with messages sent every 1?0s.

Comment: divide into frames. use virtual clustering.

Abstract: In this paper we describe T-MAC, a contention-based Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an active/sleep duty cycle. To handle load variations in time and location T-MAC introduces an adaptive duty cycle in a novel way: by dynamically ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages, while still maintaining a reasonable throughput. We discuss the design of T-MAC, and provide a head-to- head comparison with classic CSMA (no duty cycle) and S-MAC ( xed duty cycle) through extensive simulations. Under homogeneous load, T-MAC and S-MAC achieve similar reductions in energy consumption (up to 98 %) compared to CSMA. In a sample scenario with variable load, however, T-MAC outperforms S-MAC by a factor of 5. Preliminary energy-consumption measurements provide insight into the internal workings of the T-MAC protocol.

Comment: improvement over the above S-MAC protocol by adapting the duration of the active part.
 

Abstract: Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the capacity of an IEEE 802.11 network by utilizing frequency diversity. SSCH can be implemented in software over an IEEE 802.11-compliant wireless card. Each node using SSCH switches across channels in such a manner that nodes desiring to communicate overlap, while disjoint communications mostly do not overlap, and hence do not interfere with each other. To achieve this, SSCH uses a novel scheme for distributed rendezvous and synchronization. Simulation results show that SSCH significantly increases network capacity in several multi-hop and single-hop wireless networking scenarios.

Comment: see the talk by Nitin Vaidya on multiple-channel wireless networks.

Wireless Communication Environments
Capacity of Wireless Networks
Location Management
IP Mobility
Mobile IP
Micro Mobility
End-to-end Mobility
Routing in Wireless Networks: Ad Hoc Routing Protocols
Topology Control

Cooperative cell-based strategies have been recently proposed as a technique for extending the lifetime of wireless ad hoc networks, while only slightly impacting network performance. The effectiveness of this approach depends heavily on the node density: the higher it is, the more consistent energy savings can potentially be achieved. However, no general analyses of network lifetime have been done either for a base network (one without any energy conservation technique) or for one using cooperative energy conservation strategies. In this paper, we investigate the lifetime/density tradeoff under the hypothesis that nodes are distributed uniformly at random in a given region, and that the traffic is evenly distributed across the network. We also analyze the case where the node density is just sufficient to ensure that the network is connected with high probability. This analysis, which is supported by the results of extensive simulations, shows that even in this low density scenario, cell-based strategies can significantly extend network lifetime.

"Lifetime Analysis of a Sensor Network with Hybrid Automata Modelling," Sinem Coleri, Mustafa Ergen and T. John Koo, University of California, Berkeley. WSNA 2002.

  • "Critical Density Thresholds in Distributed Wireless Networks," Bhaskar Krishnamachari, Stephen Wicker, Ramon Bejar, and Marc Pearlman, to appear in a book on Advances in Coding and Information Theory, eds. H. Bhargava, H.V. Poor and V. Tarokh, Kluwer Publishers. 2002.
    • "A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks, Di Tian and Nicolas D. Georganas, University of Ottawa.
    • "Sensor Deployment Strategy for Target Detection," Thomas Clouqueur, Veradej Phipatanasuphorn, Parmesh Ramanathan and Kewal Saluja, University of Wisconsin-Madison.
    • "Infrastructure Tradeoffs for Sensor Networks," Sameer Tilak and Nael Abu-Ghazaleh, Binghamton University; Wendi Heinzelman, University of Rochester

  • "Topology Control for Wireless Sensor Networks," Jianping Pan, Thomas Hou, Lin Cai, Yi Shi, and Sherman Shen, MobiCom 2003.

  • "Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks ," MohammadTaghi Hajiaghayi, Nicole Immorlica, and Vahab S. Mirrokni, MobiCom 2003.

Incentive Compatible Routing (and some other incentive papers)
Routing in Wireless Networks: Geographic Routing
Localization
Geographic Routing without Location Information
Broadcast in Wireless Networks
Transport Protocols

Mobile File Systems

OS Design

Abstract: Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of
networked sensors viable. They can be deeply embedded in the physical world and spread throughout our environment like smart dust. The missing elements are an overall system architecture and a methodology for systematic advance. To this end, we identify key requirements, develop a small device that is representative of the class, design a tiny event-driven operating system, and show that it provides support for efficient modularity and concurrency-intensive operation. Our operating system fits in 178 bytes of memory, propagates events in the time it takes to copy 1.25 bytes of memory, context switches in the time it takes to copy 6 bytes of memory and supports two level scheduling. The analysis lays a groundwork for future architectural advances.

Comments: 1) Small physical size and low power consumption; 2) Concurrency-intensive operation; 3) Limited Physical Parallelism and Controller Hierarchy; and 4) Diversity in Design and Usage.

Service Discovery
Application Adaptation
Mobility: Coordinated, Controlled Mobility
Target Mobility: Tracking and Navigation

Software Mobility: Mobile Agents

Process Mobility: Process Migration

  • Process Migration

User Mobility

Cross Layer Design

In Network Processing and Aggregation
Topology Control: Coverage
Clock Synchronization
Security

As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized for resource-constrained environments and wireless communication. SPINS has two secure building blocks: SNEP and TESLA. SNEP provides the following important baseline security primitives: Data confidentiality, two-party data authentication, and data freshness. A particularly hard problem is to provide efficient broadcast authentication, which is an important mechanism for sensor networks. TESLA is a new protocol which provides authenticated broadcast for severely resource-constrained environments. We implemented the above protocols, and show that they are practical even on minimalistic hardware: The performance of the protocol suite easily matches the data rate of our network. Additionally, we demonstrate that the suite can be used for building higher level protocols.

转载于:https://www.cnblogs.com/Aioria0622/archive/2007/11/26/972362.html

weixin_33725722
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
常见端口表汇总
威力的BLOG空间
09-03 3087
常见端口表汇总 1　tcpmux　TCP Port Service Multiplexer 传输控制协议端口服务多路开关选择器 2　compressnet　Management Utility　　　　 compressnet 管理实用程序 3　compressnet　Compression Process　　　　压缩进程 5　rje　Remote Job Entry　　　　　　　　　 远程作业
Leetcode 434. Number of Segments in a String
weixin_30548917的博客
03-21 127
class Solution(object): def countSegments(self, s): """ :type s: str :rtype: int """ return len(s.split()) 转载于:https://www.cnblogs.com/zywscq/p...
WARN com.mchange.v2.resourcepool.BasicResourcePool
laokaizzz的专栏
04-13 7632
[com.mchange.v2.async.ThreadPoolAsynchronousRunner$PoolThread-#1] WARN  com.mchange.v2.resourcepool.BasicResourcePool  - Failed to destroy resource: com.mchange.v2.c3p0.impl.NewPooledConnection@11b608
ANDROID STUDIO 2.2.3 DOWNLOAD FROM DL.GOOGLE.COM
weixin_34234829的博客
03-23 322
立即开始使用 Android Studio Android Studio 包含用于构建 Android 应用所需的所有工具。 下载 ANDROID STUDIO2.2.3FOR WINDOWS(1674 MB) 版本：2.2.3.0 发布日期：DECEMBER 6, 2016 选择其他平台 平台Android Studio ...
Reading List
Ejikuangren的博客
09-13 360
Computer Systems: A Programmer’s Perspective Advanced Programming in the UNIX Environment UNIX Network Programming HTTP: The Definitive Guide
reading list
hs105的专栏
05-08 342
in machine learning
Deep learning Reading List
菜鸟成长日记
04-24 491
Deep learning Reading List Following is a growing list of some of the materials i found on the web for Deep Learning beginners. Reprinted from：http://jmozah.github.io/links/ Free Online Books
强化学习 Reading list
hestendelin的专栏
09-30 146
本文给出了一些强化学习的学习资源Reinforcement Learning: An Introduction Second edition, in progressUR...
Yale CS的Reading List
循环递归－liyangcn的专栏
09-09 901
看看你都读过那些Comprehensive Exam Reading ListProgramming Languages and Systems:1. "Computer architecture: a quantitative approach" Patterson & Hennessy        1       Fundamentals of Computer Design       
Static Program Analysis Reading List (UCLA CS232)
03-08
### Static Program Analysis: Understanding and Solving Set Constraints Static program analysis is an essential technique used to infer properties about the behavior of programs without executing them...
Advanced Topics in Computer Systems Reading List (UCB CS262A)
03-10
### 高级计算机系统主题阅读列表（UCB CS262A）——深入解析 #### 一、引言 在《高级计算机系统主题阅读列表（UCB CS226A）》这一课程资料中，主要介绍了由埃里克·布鲁尔（Eric A. Brewer）重新编辑的关于UNIX...
Advanced Topics in Compilers Reading List (Stanford CS343)
03-09
### 高级编译器主题阅读列表（斯坦福CS343）详解 #### 标题解析 **“高级编译器主题阅读列表（斯坦福CS343）”** 这一标题指出了该文档的主要内容是针对斯坦福大学计算机科学系开设的课程CS343中的高级编译器主题...
290c-reading-list:UCSB 的 CS 290G 引文阅读清单
06-29
标题中的“290c-reading-list”指的是美国加利福尼亚大学圣芭芭拉分校（UCSB）计算机科学课程CS 290G的阅读材料列表，这是一门深入探讨高级理论概念的课程。"UCSB"是该课程的主办机构，而“290G”通常表示特定的课程...
CS 188 Project3(RL) Q4: Asynchronous Value Iteration
段智华的博客
03-22 1617
在AsynchronousValueIterationAgent中编写一个值迭代代理，该代理已在ValueIterationAgents.py中为您部分指定。您的价值迭代代理是一个离线计划，而不是强化学习代理，因此相关的训练选项是它在初始计划阶段运行的值迭代的迭代次数（选项-i）。AsynchronicValueIterationAgent构造MDP，并在构造函数返回之前为指定的迭代次数...
Datawhale X 李宏毅苹果书AI夏令营 学习笔记
最新发布
m0_61049596的博客
08-31 448
今天，我继续学习了深度学习中的优化算法，并且着重理解了如何利用。等高级优化器来提高模型训练的效率和效果。2024年8月30日。
关于人工智能（AI）的研究报告
weixin_44196785的博客
08-29 3198
未来，随着技术的不断创新和应用的不断拓展，人工智能将继续发挥重要作用，推动社会的进步和发展。然而，人工智能的发展也带来了一些挑战，需要我们在技术创新、应用拓展和社会治理等方面共同努力，以确保人工智能的发展符合人类的利益和价值观。就业结构的变化：人工智能的发展将导致就业结构的变化，一些传统的工作岗位将被自动化和智能化的设备所取代，同时也会创造出一些新的工作岗位。社会治理的挑战：人工智能的发展将对社会治理带来挑战，例如如何应对人工智能带来的安全风险、如何保障人工智能的公平性和可及性等。
【大模型理论篇】RoPE旋转位置编码底层数学原理分析
源泉的小广场
08-30 1534
大模型、位置编码、Transformer、旋转位置编码、RoPE、Rotary Positional Encoding、数学原理、数学推导、旋转矩阵、相对位置、绝对位置、词元相似性、位置相关性
设备上的实时自定义手势识别
bit_mike的博客
08-31 566
这篇论文的标题是《On-device Real-time Custom Hand Gesture Recognition》，主要研究了如何在移动设备上实时识别自定义手势。论文的重点在于提出了一种新的框架，使得用户可以自定义手势识别流程，并且通过预训练模型和少量的训练数据来实现高准确率的手势识别，这对于AR、VR等领域具有重要的应用价值。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值