Is there a field of social work?: Trainees evaluating social problems and social work

My aim was to study the experiences and priorities of two age groups of social work students practicing in client-centered social work. This article is based on the research on rationality and language games in social work. The target groups of the research project as a whole were the actors: the heads and social workers or activists in public social welfare and health care agencies and institutions and in voluntary associations and action groups, and finally, two subsequent classes of students from a school of social work, during their practicing periods. This article concentrates on the trainees. At first, the trainees wrote essays and kept diaries. Secondly, they marked their standings on graphs visualizing different types of information contents and social relation structures. Thirdly, they made their choices of reasons for and solutions to social problems on a problem wheel. The trainees' study, using different data gathering techniques, partly confirms the results of the research of the other actor groups, in which the data were derived using questionnaires and interviews. The trainees' study shows variation in the respondents' priorities within and between specified social problem categories. Qualitatively analyzed, however, the characterizations of social work, both those who currently act in and those aiming to enter this field, resemble one another.     

强对抗是提高中国男篮水平的关键

通过对中国国家男队在第 2 6届、2 7届奥运会和 2 0 0 1— 2 0 0 2CBA篮球联赛冠军争夺比赛中进行了较为系统的研究 ,从中发现缺乏对抗性是当前中国篮球运动存在的主要问题 ,从而提出我们近一个时期要解决的主要问题是加强队员在对抗条件下技战术的发挥     

近代女子教育的发展及其蕴含的社会意义

20世纪上半期中国社会正处于急剧变革的时代。在教育向近代化的转型过程中,女子教育开始了缓慢的发展,但是,存在的现实是：女子文盲率居高不下,成为当时迫切解决的社会问题之一。其所带来的社会意义是十分深远的,严重阻碍了个人及其整个社会向近代化的转型．文盲问题的解决任重道远。     

会计电算化实践中存在的问题与对策

分析了我国会计电算化实践中存在的问题,这些问题包括:领导的重视与支持不够,忽视会计电算化人员的教育,软件功能单一数据共享性差,会计电算化内部管理不规范等。从企业领导、会计人员、财务软件、制度管理等方面提出了改进措施。     

货物运输车辆的调度算法

本文以上海煤炭公司为例,讨论了运煤车辆的计算机调度问题,提出一个数学模型及有效的近似算法。在算法实现中,采用了一些较为先进的数据结构,使运算速度及存储需求均有较大的改善。对实际算例计算结果表明,采用本算法进行运输车辆调度,经济效益比人工调度有明显的提高。     

Effects of fixed costs in two-person sequential bargaining

Rubinstein (1982) considered the problem of dividing a given surplus between two players sequentially, and then proposed a model in which the two players alternately make and respond to each other's offers through time. He further characterized the perfect equilibrium outcomes, which depend on the players time preferences and order of moves. Using both equal and unequal bargaining cost conditions and an unlimited number of rounds, two experiments were designed to compare the perfect equilibrium model to alternative models based on norms of fairness. We report analyses of final agreements, first offers, and number of bargaining rounds, which provide limited support to the perfect equilibrium model, and then conclude by recommending a shift in focus from model testing to specification of the conditions favoring one model over another.     

复调和函数的混合边值问题

利用Ｆｏｕｒｉｅｒ方法得到复调和函数的混合边值问题解的表示式及解的存在性定理并讨论了解的唯一性．     

A Class of Efficient Non-parametric K-sample Tests for Multivariate Counting Processes with Frailties

A K -sample testing problem is studied for multivariate counting processes with time-dependent frailty. Asymptotic distributions and efficiency of a class of non-parametric test statistics are established for certain local alternatives. The concept of efficiency is to show that for every non-parametric test in this class, there is a parametric submodel for which the optimal test has the same asymptotic power as the non-parametric one. The theory is applied to analyse a diabetic retinopathy study data set. A simulation study is also presented to illustrate the theory     

用线性互补及二次规划理论分析市场均衡问题

本文讨论了一类完全竞争条件下的市场均衡问题,供给方的生产特征用线性规划模型进行刻划,市场需求函数源于一般经济意义下的模型,它是一系列相互独立的价格变量的函数．我们将此问题归结为线性互补问题,并依此讨论了均衡点的存在性．本文还讨论了一种用二次规划进行刻划的经济问题,并指出此二次规划的K－K－T条件等价于所讨论的线性互补问题．     

The web proxy location problem in general tree of rings networks

The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn ²) time complexity.This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).