apue(5)

 

7.3. Process Termination

Return from main

Calling exit

Calling _exit or _Exit

//Return of the last thread from its start routine (Section 11.5)

//Calling pthread_exit (Section 11.5) from the last thread


Calling abort (Section 10.17)

Receipt of a signal (Section 10.2)

//Response of the last thread to a cancellation request

Exit Functions
#include <stdlib.h> void exit(int status); //performs certain cleanup processing and then returns to the kernel. void _Exit(int status); //return to the kernel immediately #include <unistd.h> void _exit(int status); //return to the kernel immediately iso1999 默认exit0= return 0 gcc 加上-std=c99 才符合99标准 #include <stdlib.h> int atexit(void (*func)(void)); 注册顺序与执行顺序相反 linuxmain没有exit0),会以最后函数的返回值返回。

7.5. Environment List

 extern char **environ; 字符串数组和字符串都以0结束。

7.6. Memory Layout of a C Program

Text segment, the machine instructions that the CPU executes. //text Initialized data segment //data Uninitialized data segment //初始化全局数组之类 bss Stack Heap The only portions of the program that need to be saved in the program file are the text segment and the initialized data.
只有textdata在程序文件中分配,其余在运行时分配。bss在运行时初始化。但文件大小一般不等与text+data,有一些symbol table information that can be helpful in debugging a core file.

7.7. Shared Libraries

默认gcc使用shared libraries。阻止它使用的方法是 -static

7.8. Memory Allocation

malloc, which allocates a specified number of bytes of memory. The initial value of the memory is indeterminate.

calloc, which allocates space for a specified number of objects of a specified size. The space is initialized to all 0 bits.

realloc, which increases or decreases the size of a previously allocated area. When the size increases, it may involve moving the previously allocated area somewhere else, to provide the additional room at the end. Also, when the size increases, the initial value of the space between the old contents and the end of the new area is indeterminate.

#include <stdlib.h> void *malloc(size_t size); void *calloc(size_t nobj, size_t size); void *realloc(void *ptr, size_t newsize); void free(void *ptr);
alloca Function

One additional function is also worth mentioning. The function alloca has the same calling sequence as malloc; however, instead of allocating memory from the heap, the memory is allocated from the stack frame of the current function. The advantage is that we don't have to free the space; it goes away automatically when the function returns.

7.9. Environment Variables

#include <stdlib.h> char *getenv(const char *name); Note that this function returns a pointer to the value of a name=value string. We should always use getenv to fetch a specific value from the environment, instead of accessing environ directly. int putenv(char *str); //replace the old one if exists int setenv(const char *name, const char *value, int rewrite); //the old one is not removed, if rewrite is 0. Otherwise , replace. int unsetenv(const char *name);
Figure 7.7. Environment variables defined in the Single UNIX Specification
增加、修改新的环境变量时比较复杂,要考虑内存空间分配。

7.10. setjmp and longjmp Functions(?)

 #include <setjmp.h> int setjmp(jmp_buf env); void longjmp(jmp_buf env, int val); valreturn valuevolatile阻止编译器将一些内存auto变量放进register里。 register里的变量在多层调用时,可能会roll back

7.11. getrlimit and setrlimit Functions(?)

 #include <sys/resource.h> int getrlimit(int resource, struct rlimit *rlptr); int setrlimit(int resource, const struct rlimit *rlptr); struct rlimit { rlim_t rlim_cur; /* soft limit: current limit */ rlim_t rlim_max; /* hard limit: maximum value for rlim_cur */ };

Three rules govern the changing of the resource limits.

  1. A process can change its soft limit to a value less than or equal to its hard limit.

  2. A process can lower its hard limit to a value greater than or equal to its soft limit. This lowering of the hard limit is irreversible for normal users.

  3. Only a superuser process can raise a hard limit.

深度学习是机器学习的一个子领域,它基于人工神经网络的研究,特别是利用多层次的神经网络来进行学习和模式识别。深度学习模型能够学习数据的高层次特征,这些特征对于图像和语音识别、自然语言处理、医学图像分析等应用至关重要。以下是深度学习的一些关键概念和组成部分: 1. **神经网络(Neural Networks)**:深度学习的基础是人工神经网络,它是由多个层组成的网络结构,包括输入层、隐藏层和输出层。每个层由多个神经元组成,神经元之间通过权重连接。 2. **前馈神经网络(Feedforward Neural Networks)**:这是最常见的神经网络类型,信息从输入层流向隐藏层,最终到达输出层。 3. **卷积神经网络(Convolutional Neural Networks, CNNs)**:这种网络特别适合处理具有网格结构的数据,如图像。它们使用卷积层来提取图像的特征。 4. **循环神经网络(Recurrent Neural Networks, RNNs)**:这种网络能够处理序列数据,如时间序列或自然语言,因为它们具有记忆功能,能够捕捉数据中的时间依赖性。 5. **长短期记忆网络(Long Short-Term Memory, LSTM)**:LSTM 是一种特殊的 RNN,它能够学习长期依赖关系,非常适合复杂的序列预测任务。 6. **生成对抗网络(Generative Adversarial Networks, GANs)**:由两个网络组成,一个生成器和一个判别器,它们相互竞争,生成器生成数据,判别器评估数据的真实性。 7. **深度学习框架**:如 TensorFlow、Keras、PyTorch 等,这些框架提供了构建、训练和部署深度学习模型的工具和库。 8. **激活函数(Activation Functions)**:如 ReLU、Sigmoid、Tanh 等,它们在神经网络中用于添加非线性,使得网络能够学习复杂的函数。 9. **损失函数(Loss Functions)**:用于评估模型的预测与真实值之间的差异,常见的损失函数包括均方误差(MSE)、交叉熵(Cross-Entropy)等。 10. **优化算法(Optimization Algorithms)**:如梯度下降(Gradient Descent)、随机梯度下降(SGD)、Adam 等,用于更新网络权重,以最小化损失函数。 11. **正则化(Regularization)**:技术如 Dropout、L1/L2 正则化等,用于防止模型过拟合。 12. **迁移学习(Transfer Learning)**:利用在一个任务上训练好的模型来提高另一个相关任务的性能。 深度学习在许多领域都取得了显著的成就,但它也面临着一些挑战,如对大量数据的依赖、模型的解释性差、计算资源消耗大等。研究人员正在不断探索新的方法来解决这些问题。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值