首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   152篇
  免费   1篇
管理学   38篇
民族学   2篇
人口学   11篇
丛书文集   2篇
理论方法论   12篇
综合类   3篇
社会学   52篇
统计学   33篇
  2024年   1篇
  2021年   1篇
  2020年   3篇
  2019年   4篇
  2018年   3篇
  2017年   8篇
  2016年   5篇
  2015年   2篇
  2014年   6篇
  2013年   35篇
  2012年   5篇
  2011年   8篇
  2010年   5篇
  2009年   4篇
  2008年   6篇
  2007年   6篇
  2006年   7篇
  2005年   5篇
  2004年   6篇
  2003年   3篇
  2002年   2篇
  2001年   3篇
  2000年   1篇
  1999年   1篇
  1998年   6篇
  1997年   3篇
  1996年   2篇
  1995年   3篇
  1988年   1篇
  1985年   1篇
  1984年   3篇
  1982年   1篇
  1981年   2篇
  1975年   1篇
排序方式: 共有153条查询结果,搜索用时 15 毫秒
151.
This paper gives optimal algorithms for the construction of the Nearest Neighbor Embracing Graph (NNE-graph) of a given point set V of size n in the k-dimensional space (k-D) for k = 2,3. The NNE-graph provides another way of connecting points in a communication network, which has lower expected degree at each point and shorter total length of connections with respect to those using Delaunay triangulation. In fact, the NNE-graph can also be used as a tool to test whether a point set is randomly generated or has some particular properties. We show that in 2-D the NNE-graph can be constructed in optimal time in the worst case. We also present an time algorithm, where d is the -th largest degree in the utput NNE-graph. The algorithm is optimal when . The algorithm is also sensitive to the structure of the NNE-graph, for instance when , the number of edges in NNE-graph is bounded by for any value g with . We finally propose an time algorithm for the problem in 3-D, where d and are the -th largest vertex degree and the largest vertex degree in the NNE-graph, respectively. The algorithm is optimal when the largest vertex degree of the NNE-graph is .  相似文献   
152.
This paper proposes a methodology to measure the management performance of the firms of an industry. The idea is to break down the very complicated concept of management into subjects such that the performance of each subject can be measured. The performances of all subjects are then aggregated to form an overall performance of management. The weights associated with the subjects which play a decisive role in aggregation are determined from a two-stage method. This method takes into account both the experience of the experts and the reality reflected by the data collected from the firms. Therefore, the weights generated are more acceptable to the firms. An example of the manufacturing firms in Taiwan illustrates how management is broken down into subjects and how their performances are aggregated. A regression analysis shows that management, in addition to capital and labor, makes a significant contribution to organizational performance. Although the discussion of this paper is confined to the manufacturing industry in Taiwan, the methodology can be applied to other industries and other countries.  相似文献   
153.
There is little understanding as to why firms have various degrees of cell usage. The intent of this study was to identify factors that had arrested continued implementation of cells at surveyed manufacturing plants. We found no dominant factor that had prevented the firms from continued cellularization. However, by sub‐dividing the plants into those with low and high degrees of direct labor hours spent in cells, short and long experience with cells, and those with and without plans for further cells, a clearer pattern emerged. The inability to find families with high and stable demand, lack of time to implement more cells, the existence of service processes, and the difficulty of cost justifying new cells were the most important factors, although their relative importance varied. The findings support the notion that cellular manufacturing has broad applicability as a form of work organization and that cell users pursue further implementations until no more viable cells with sufficient utilization, demand stability, or economic value can be found.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号