全文获取类型
收费全文 | 133篇 |
免费 | 2篇 |
专业分类
管理学 | 17篇 |
民族学 | 1篇 |
人口学 | 10篇 |
丛书文集 | 29篇 |
理论方法论 | 8篇 |
综合类 | 14篇 |
社会学 | 36篇 |
统计学 | 20篇 |
出版年
2022年 | 2篇 |
2020年 | 5篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 16篇 |
2012年 | 7篇 |
2011年 | 28篇 |
2010年 | 4篇 |
2009年 | 2篇 |
2008年 | 8篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 1篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有135条查询结果,搜索用时 15 毫秒
41.
Joseph Wun-Tat Chan Francis Y. L. Chin Hing-Fung Ting Yong Zhang 《Journal of Combinatorial Optimization》2011,22(3):359-377
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integer parameter 0≤i≤h, is served by assigning a (tree) node of level (or height) i and a release request is served by releasing a specified assigned node. The node assignments have to guarantee that no node is assigned to two
assignment requests unreleased, and every leaf-to-root path of the tree contains at most one assigned node. With assigned
node reassignments allowed, the target of the problem is to minimize the number of assignments/reassignments, i.e., the cost,
to serve the whole sequence of requests. This online tree node assignment problem is fundamental to many applications, including
OVSF code assignment in WCDMA networks, buddy memory allocation and hypercube subcube allocation. 相似文献
42.
免于公开的商业机密的界定问题 总被引:1,自引:0,他引:1
王红一 《暨南学报(哲学社会科学版)》2005,27(5):47-52
信息公开立法中对商业机密等免于公开的规定体现了公益与私益平衡原则,而如何体现这一原则,还有赖于立法和实践中对免于公开规定的商业机密进行界定。通过对目前信息立法最为完善的美国的相关经验进行梳理和分析,对我国目前各地信息公开立法中的有关规定进行评析,进而对我国完善相关立法和规范相关实践提出建议。 相似文献
43.
从短波数传中载波同步问题的分析入手,提出了一种稳健的软件载波同步方法。详细地编写了算法过程并作了主要性能分析,得知其速度及精度均能达到高质量数传的要求。此方法应用简便可靠,能在较强干扰下工作。对于中、低速数传,此方法可直接用作载波同步,而对于高速数传则可作为有效的载波预同步措施以改善误码性能。 相似文献
44.
Workers with disabilities are entitled to have their individual needs accommodated in a way that allows them to perform the essential duties of their job. However, adults with disabilities are often lacking in career development and are ill-prepared to negotiate workplace accommodations. This has led educators to seek workplaces that can accommodate the needs of adolescents with disabilities, so these adolescents can learn to negotiate accommodations and enhance their career development through work-based education. This paper reports on two case studies in which employers had agreed to accommodate the needs of adolescents with disabilities participating in work-based education. Social Cognitive Career Theory (SCCT) framed the analyses of these two cases - a case of a student with physical disabilities and a case of a student with developmental disabilities. SCCT proves valuable in understanding the role of work-based education in the career development of disabled youth. 相似文献
45.
A qualitative study of older women living in their own homes and older women living in aged care facilities found that the concerns of the women living in their own homes were the realities of life for the residents in the aged care facilities. Twenty-five female residents across two facilities and 11 older women living in their own homes were interviewed. The positive outcomes of aging at home are relevant and desirable for residents of aged care facilities. A smooth transition from community living to residential aged care involves retaining some of these positive aspects of their lives. 相似文献
46.
Yong Zhang Joseph Wun-Tat Chan Francis Y. L. Chin Hing-Fung Ting Deshi Ye Feng Zhang Jianyu Shi 《Journal of Combinatorial Optimization》2016,31(1):79-94
This paper considers the minimax regret vertex 2-sink location problem in a dynamic path network with positive edge lengths and uniform edge capacity. Let \(P\) be an undirected path graph of \(n\) vertices, and the weight (initial supply) of every vertex is known as an interval. The problem is to find two vertices \(x\) and \(y\) as two sinks on the path such that all the weights can evacuate to \(x\) and \(y\) with minimum regret of evacuation time in case of an emergency for any possible weight distribution. We present an \(O(n^3\log n)\) time algorithm. 相似文献
47.
Yong Zhang Francis Y. L. Chin Hing-Fung Ting Xin Han 《Journal of Combinatorial Optimization》2013,26(2):223-236
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space P ij . When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90°-rotation on any plane P ij is allowed. The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For d-dimensional bin packing, an online algorithm with competitive ratio 4 d is given. Moreover, we consider d-dimensional hypercube packing, and give a 2 d+1-competitive algorithm. These two results are the first study on 1-space bounded multi dimensional bin packing and hypercube packing. 相似文献
48.
The negative impact of incorrect requirements on information system development (ISD) project performance has long been acknowledged. This study addresses the problem of incorrect requirements by proposing a model that combines the error reduction and coping concepts proposed by Field, Ritzman, Safizadeh, and Downing (2006) with the view that ISD is a knowledge‐intensive process. The model hypothesizes that when developers and users possess an understanding of each other's primary domain of knowledge, the prevention of incorrect requirements and the mitigation of the negative consequences of incorrect requirements tend to improve project performance. Data collected from 250 ISD professionals on the basis of their experiences of recently completed ISD projects confirmed all of our hypotheses. The results demonstrate that the eliciting of incorrect requirements can be reduced when users and developers possess cross‐domain understanding and when requirement analysis methodologies and techniques are available. Furthermore, the negative impact of incorrect requirements on project performance can be mitigated when developers have sufficient ISD knowledge and behavioral knowledge. 相似文献
49.
Chin Long Chiang 《统计学通讯:理论与方法》2013,42(5-6):905-921
This article was written for a keynote speech to present a few highlights of my life as a statistician. It has seven sections beginning with an introduction in Section 17 some prospects of biostatistics in Section 2, and a tribute to J. Neyman in Section 3. In Section 4 is a sample of my work including motivation for my studies on the life table and competing risks, contributions and comments in survival analyses, a solution for Kolmogorov differential equations, and an explicit formula for the n-step transition probability in discrete time Markov chains. 相似文献
50.
AbstractThis keynote speech was presented at the SSR-NAI Conference 2017. It explores the changes Singapore Prison Service (SPS) has made through the years and discuss its future developments. The speaker, Desmond Chin Kim Tham, Commissioner of Prisons, examines the Throughcare framework and community involvement program that the SPS has put in place, and describes the future directions of in-care practices and the involvement of community in corrections. 相似文献