首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   144篇
  免费   26篇
化学   6篇
力学   1篇
综合类   7篇
数学   145篇
物理学   11篇
  2023年   2篇
  2022年   6篇
  2021年   6篇
  2020年   5篇
  2019年   5篇
  2018年   8篇
  2017年   3篇
  2016年   10篇
  2015年   3篇
  2014年   11篇
  2013年   10篇
  2012年   5篇
  2011年   11篇
  2010年   4篇
  2009年   10篇
  2008年   19篇
  2007年   11篇
  2006年   9篇
  2005年   7篇
  2004年   5篇
  2003年   4篇
  2002年   3篇
  2001年   2篇
  1999年   1篇
  1998年   5篇
  1997年   2篇
  1996年   1篇
  1986年   1篇
  1982年   1篇
排序方式: 共有170条查询结果,搜索用时 15 毫秒
21.
本利用AHP和模糊综合评价法评价物流中心选址的定性指标、用量化选址模型结合遗传算法计算定量指标,再藉助指标满意度求解把定性和定量的指标进行综合,从而为决策对物流中心选址做出科学的决策提供支持。  相似文献   
22.
Earlier research has shown a relationship between various forms of structural centrality and perceived leadership and role satisfaction in small experimental groups. The limited amount of research on this topic in naturally occurring social networks has yielded results that often conflict with one another. Different results have generally been attributed to possible differences in task environments. This paper examines the relationship between two types of structural centrality and perceived influence, role satisfaction, and perceived effectiveness in an environmental resource management program. Findings in this paper suggest that the observed differences in relationships between the network and other variables is partly a function of global network properties (e.g., marginality of subgroups) and related task environments. This revised version was published online in August 2006 with corrections to the Cover Date.  相似文献   
23.
Given a finite set E and a family F={E1,…,Em} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets Ei are not given in extension because they are very large sets that are possibly infinite. We propose three exact algorithms for solving the LSCP. Two of them determine minimal covers, while the third one produces minimum covers. Heuristic versions of these algorithms are also proposed and analysed. We then give several procedures for the computation of a lower bound on the minimum size of a cover. We finally present algorithms for finding the largest possible subset of F that does not cover E. We also show that a particular case of the LSCP is to determine irreducible infeasible sets in inconsistent constraint satisfaction problems. All concepts presented in the paper are illustrated on the k-colouring problem which is formulated as a constraint satisfaction problem.  相似文献   
24.
We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.  相似文献   
25.
Complex real-world systems consist of collections of interacting processes/events. These processes change over time in response to both internal and external stimuli as well as to the passage of time itself. Many domains such as real-time systems diagnosis, story understanding, and financial forecasting require the capability to model complex systems under a unified framework to deal with both time and uncertainty. Current models for uncertainty and current models for time already provide rich languages to capture uncertainty and temporal information, respectively. Unfortunately, these semantics have made it extremely difficult to unify time and uncertainty in a way which cleanly and adequately models the problem domains at hand. Existing approaches suffer from significant trade offs between strong semantics for uncertainty and strong semantics for time. In this paper, we explore a new model, the Probabilistic Temporal Network (PTN), for representing temporal and atemporal information while fully embracing probabilistic semantics. The model allows representation of time constrained causality, of when and if events occur, and of the periodic and recurrent nature of processes.  相似文献   
26.
本研究探讨团队层面变革型领导与成员团队满意度、团队认同之间的关系,考察团队学习的中介作用,以及影响变革型领导和团队学习关系的权变因素。采用问卷调查方式对某省通讯运营商的85个客服团队进行调查。采用多层线性模型(Hierarchical Linear Modeling)对团队变革型领导、团队学习、团队满意度、团队认同之间的关系进行分析。结果表明,团队学习对团队领导的变革型领导行为与员工工作态度的关系具有一定的中介作用。团队成员工作技能在变革型领导和团队学习间起调节作用。  相似文献   
27.
从期望出发,比较顾客视角的感知服务质量与满意度的区别。首先对期望概念进行明确界定,借鉴卡诺模型分类方法划分期望类别,基于重要性维度得到期望的三个类别:核心属性期望、重要属性期望和附加属性期望。以餐饮行业为实证研究背景,比较期望视角下的顾客满意度和感知服务质量的区别。发现核心属性期望、重要属性期望对顾客的服务质量评价影响更大,而附加属性期望对顾客的满意度评价影响更大。最后,给出企业对顾客期望、服务质量与顾客满意度的管理意义。  相似文献   
28.
结合新提出的满意度方法和混合整数规划方法,给出了多态不确定性环境下可再生能源规划模型.该模型综合描述了多地区、多时期、多品种、多部门之间的可再生能源管理系统的复杂性、系统性、动态性和不确定性.最后的实例求解结果说明该模型能很好地反映能源安全性、系统可靠性与系统成本之间的关系,并能给出不同系统违反水平下的能源配置方式及增容计划,为决策者提供决策参考.  相似文献   
29.
This study proposes a model to optimize postsale services consisting of four factors: (a) the basic warranty length, (b) the extended warranty length, (c) the preventive maintenance level, and (d) the preventive maintenance interval. Furthermore, consumer demand for the product and extended warranty are considered as functions of the length of the basic warranty and extended warranty periods, respectively. Because buyer dissatisfaction with a product can lead to the loss of potential buyers and the switch of current customers to the competitors, both manufacturer and buyer satisfaction are considered in the model. Three comparative studies are done for showing the effectiveness of the model. The first one compares the results of simultaneous optimization from the two perspectives of manufacture and customer with the single‐objective optimization results from each of the mentioned viewpoints. The second comparison studies the provision of extended warranty contract in the proposed model, and the third comparison investigates the effect of preventive maintenance actions on the results of the model.  相似文献   
30.
以目的地型饭店这一新兴饭店业态作为研究对象,从顾客感知层面研究目的地型饭店品牌体验与顾客感知价值以及顾客满意度之间的关系.通过问卷调查获取相关数据,并用SPSS 19.0与AMOS 17.0统计分析软件进行数据分析,得到了以下结论:①目的地型饭店具有旅游休闲吸引力,能够吸引顾客离开常住地到此作短暂停留;②目的地型饭店顾客的消费动机并非单纯食宿,而是更加关注全方位的度假休闲体验;③在品牌体验的5个维度中,关联体验对顾客感知价值与满意度具有最显著影响,而思考体验则最不显著.在此基础上,提出了有效提升目的地型饭店顾客满意度的管理建议.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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