全文获取类型
收费全文 | 44639篇 |
免费 | 1050篇 |
国内免费 | 178篇 |
专业分类
电工技术 | 546篇 |
综合类 | 631篇 |
化学工业 | 5050篇 |
金属工艺 | 625篇 |
机械仪表 | 875篇 |
建筑科学 | 919篇 |
矿业工程 | 398篇 |
能源动力 | 446篇 |
轻工业 | 2268篇 |
水利工程 | 627篇 |
石油天然气 | 49篇 |
武器工业 | 4篇 |
无线电 | 2021篇 |
一般工业技术 | 3839篇 |
冶金工业 | 21430篇 |
原子能技术 | 190篇 |
自动化技术 | 5949篇 |
出版年
2024年 | 57篇 |
2023年 | 200篇 |
2022年 | 128篇 |
2021年 | 140篇 |
2019年 | 72篇 |
2018年 | 536篇 |
2017年 | 753篇 |
2016年 | 1149篇 |
2015年 | 845篇 |
2014年 | 506篇 |
2013年 | 573篇 |
2012年 | 2234篇 |
2011年 | 2550篇 |
2010年 | 776篇 |
2009年 | 859篇 |
2008年 | 702篇 |
2007年 | 726篇 |
2006年 | 637篇 |
2005年 | 3414篇 |
2004年 | 2629篇 |
2003年 | 2101篇 |
2002年 | 913篇 |
2001年 | 748篇 |
2000年 | 303篇 |
1999年 | 631篇 |
1998年 | 6166篇 |
1997年 | 3818篇 |
1996年 | 2526篇 |
1995年 | 1461篇 |
1994年 | 1089篇 |
1993年 | 1116篇 |
1992年 | 257篇 |
1991年 | 317篇 |
1990年 | 311篇 |
1989年 | 279篇 |
1988年 | 298篇 |
1987年 | 223篇 |
1986年 | 203篇 |
1985年 | 183篇 |
1984年 | 73篇 |
1983年 | 88篇 |
1982年 | 134篇 |
1981年 | 182篇 |
1980年 | 196篇 |
1979年 | 70篇 |
1978年 | 102篇 |
1977年 | 614篇 |
1976年 | 1322篇 |
1975年 | 100篇 |
1973年 | 50篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
One major service provided by cloud computing is Software as a Service (SaaS). As competition in the SaaS market intensifies, it becomes imperative for a SaaS provider to design and configure its computing system properly. This paper studies the application placement problem encountered in computer clustering in SaaS networks. This problem involves deciding which software applications to install on each computer cluster of the provider and how to assign customers to the clusters in order to minimize total cost. Given the complexity of the problem, we propose two algorithms to solve it. The first one is a probabilistic greedy algorithm which includes randomization and perturbation features to avoid getting trapped in a local optimum. The second algorithm is based on a reformulation of the problem where each cluster is to be assigned an application configuration from a properly generated subset of configurations. We conducted an extensive computational study using large data sets with up to 300 customers and 50 applications. The results show that both algorithms outperform a standard branch-and-bound procedure for problem instances with large sizes. The probabilistic greedy algorithm is shown to be the most efficient in solving the problem. 相似文献
992.
Teemu?Lepp?nenEmail author José?álvarez Lacasia Yoshito?Tobe Kaoru?Sezaki Jukka?Riekki 《Autonomous Agents and Multi-Agent Systems》2017,31(1):1-35
We introduce mobile agents for mobile crowdsensing. Crowdsensing campaigns are designed through different roles that are implemented as mobile agents. The role-based tasks of mobile agents include collecting data, analyzing data and sharing data in the campaign. Mobile agents execute and control the campaign autonomously as a multi-agent system and migrate in the opportunistic network of participants’ devices. Mobile agents take into account the available resources in the devices and match participants’ privacy requirements to the campaign requirements. Sharing of task results in real-time facilitates cooperation towards the campaign goal while maintaining a selected global measure, such as energy efficiency. We discuss current challenges in crowdsensing and propose mobile agent based solutions for campaign execution and monitoring, addressing data collection and participant-related issues. We present a software framework for mobile agents-based crowdsensing that is seamlessly integrated into the Web. A set of simulations are conducted to compare mobile agent-based campaigns with existing crowdsensing approaches. We implemented and evaluated a small-scale real-world mobile agent based campaign for pedestrian flock detection. The simulation and evaluation results show that mobile agent based campaigns produce comparable results with less energy consumption when the number of agents is relatively small and enables in-network data processing with sharing of data and task results with insignificant overhead. 相似文献
993.
Anthony?Etuk Timothy?J.?Norman Murat??ensoyEmail author Mudhakar?Srivatsa 《Autonomous Agents and Multi-Agent Systems》2017,31(3):531-560
The presence of numerous and disparate information sources available to support decision-making calls for efficient methods of harnessing their potential. Information sources may be unreliable, and misleading reports can affect decisions. Existing trust and reputation mechanisms typically rely on reports from as many sources as possible to mitigate the influence of misleading reports on decisions. In the real world, however, it is often the case that querying information sources can be costly in terms of energy, bandwidth, delay overheads, and other constraints. We present a model of source selection and fusion in resource-constrained environments, where there is uncertainty regarding the trustworthiness of sources. We exploit diversity among sources to stratify them into homogeneous subgroups to both minimise redundant sampling and mitigate the effect of certain biases. Through controlled experiments, we demonstrate that a diversity-based approach is robust to biases introduced due to dependencies among source reports, performs significantly better than existing approaches when sampling budget is limited and equally as good with an unlimited budget. 相似文献
994.
Chen?HajajEmail authorView authors OrcID profile Noam?Hazon David?Sarne 《Autonomous Agents and Multi-Agent Systems》2017,31(3):696-714
The plethora of comparison shopping agents (CSAs) in today’s markets enables buyers to query more than a single CSA when shopping, thus expanding the list of sellers whose prices they obtain. This potentially decreases the chance of a purchase within any single interaction between a buyer and a CSA, and consequently decreases each CSAs’ expected revenue per-query. Obviously, a CSA can improve its competence in such settings by acquiring more sellers’ prices, potentially resulting in a more attractive “best price”. In this paper we suggest a complementary approach that improves the attractiveness of the best result returned based on intelligently controlling the order according to which they are presented to the user, in a way that utilizes several known cognitive-biases of human buyers. The advantage of this approach is in its ability to affect the buyer’s tendency to terminate her search for a better price, hence avoid querying further CSAs, without spending valuable resources on finding additional prices to present. The effectiveness of our method is demonstrated using real data, collected from four CSAs for five products. Our experiments confirm that the suggested method effectively influence people in a way that is highly advantageous to the CSA compared to the common method for presenting the prices. Furthermore, we experimentally show that all of the components of our method are essential to its success. 相似文献
995.
Margareta?Ackerman Simina?BranzeiEmail author 《Autonomous Agents and Multi-Agent Systems》2017,31(5):1077-1093
Scientific communities have adopted different conventions for ordering authors on publications. Are these choices inconsequential, or do they have significant influence on individual authors, the quality of the projects completed, and research communities at large? What are the trade-offs of using one convention over another? In order to investigate these questions, we formulate a basic two-player game theoretic model, which already illustrates interesting phenomena that can occur in more realistic settings. We find that contribution-based ordering leads to a denser collaboration network and a greater number of publications, while alphabetical ordering can improve research quality. Contrary to the assumption that free riding is a weakness of the alphabetical ordering scheme, when there are only two authors, this phenomenon can occur under any contribution scheme, and the worst case occurs under contribution-based ordering. Finally, we show how authors working on multiple projects can cooperate to attain optimal research quality and eliminate free riding given either contribution scheme. 相似文献
996.
Leif?W.?Lundmark Chong?OhEmail author J.?Cameron?Verhaal 《Information Systems Frontiers》2017,19(6):1407-1422
Drawing on the organizational legitimacy literature, we propose and test a set of hypotheses arguing that social media, an artifact of information technology, serves as a mechanism for conferring legitimacy in the market for initial public offerings (IPOs). The extant literature identifies third-party authorities, such as traditional media outlets and industry analysts, as a valuable source of organizational legitimacy. Social media and micro-blogging, however, remain outside current classifications of the phenomenon. This study theoretically develops and empirically tests a new mechanism in the legitimation process: the direct interaction with potential investors and society-at-large via social media. Our findings indicate broad support that having a Twitter account, and the extent to which a firm utilizes Twitter, is associated with systematically higher levels of IPO underpricing. Moreover, we find support that social media variables external to the firm, including number of followers and retweets, also impact the level of underpricing in an IPO. In conclusion, we highlight the emerging role of social media in processes of legitimation and invite additional research at the intersection of IS and management. 相似文献
997.
998.
Bram?KlievinkEmail authorView authors OrcID profile Bart-Jan?Romijn Scott?Cunningham Hans?de?Bruijn 《Information Systems Frontiers》2017,19(2):267-283
Big data is being implemented with success in the private sector and science. Yet the public sector seems to be falling behind, despite the potential value of big data for government. Government organizations do recognize the opportunities of big data but seem uncertain about whether they are ready for the introduction of big data, and if they are adequately equipped to use big data. This paper addresses those uncertainties. It presents an assessment framework for evaluating public organizations’ big data readiness. Doing so demystifies the concept of big data, as it is expressed in terms of specific and measureable organizational characteristics. The framework was tested by applying it to organizations in the Dutch public sector. The results suggest that organizations may be technically capable of using big data, but they will not significantly gain from these activities if the applications do not fit their organizations and main statutory tasks. The framework proved helpful in pointing out areas where public sector organizations could improve, providing guidance on how government can become more big data ready in the future. 相似文献
999.
One of the problems with insider threat research is the lack of a complete 360° view of an insider threat dataset due to inadequate experimental design. This has prevented us from modeling a computational system to protect against insider threat situations. This paper provides a contemporary methodological approach for using online games to simulate insider betrayal for predictive behavioral research. The Leader’s Dilemma Game simulates an insider betrayal scenario for analyzing organizational trust relationships, providing an opportunity to examine the trustworthiness of focal individuals, as measured by humans as sensors engaging in computer-mediated communication. This experimental design provides a window into trustworthiness attribution that can generate a rigorous and relevant behavioral dataset, and contributes to building a cyber laboratory that advances future insider threat study. 相似文献
1000.
Yongrui?QinEmail author Quan?Z.?Sheng Nickolas?J.?G.?Falkner Lina?Yao Simon?Parkinson 《World Wide Web》2017,20(5):915-937
Since today’s real-world graphs, such as social network graphs, are evolving all the time, it is of great importance to perform graph computations and analysis in these dynamic graphs. Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem. Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs. A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates (i.e., edge deletions). We propose maintenance algorithms based on distance labeling, which can handle decremental updates efficiently. By exploiting properties of distance labeling in original graphs, we are able to efficiently maintain distance labeling for new graphs. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach. More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL). 相似文献