全文获取类型
收费全文 | 105304篇 |
免费 | 1732篇 |
国内免费 | 487篇 |
专业分类
电工技术 | 1041篇 |
综合类 | 2353篇 |
化学工业 | 16344篇 |
金属工艺 | 5192篇 |
机械仪表 | 3454篇 |
建筑科学 | 3831篇 |
矿业工程 | 718篇 |
能源动力 | 1772篇 |
轻工业 | 5651篇 |
水利工程 | 1439篇 |
石油天然气 | 397篇 |
武器工业 | 1篇 |
无线电 | 10629篇 |
一般工业技术 | 20199篇 |
冶金工业 | 5328篇 |
原子能技术 | 390篇 |
自动化技术 | 28784篇 |
出版年
2023年 | 152篇 |
2022年 | 308篇 |
2021年 | 534篇 |
2020年 | 314篇 |
2019年 | 330篇 |
2018年 | 14806篇 |
2017年 | 13679篇 |
2016年 | 10379篇 |
2015年 | 1074篇 |
2014年 | 903篇 |
2013年 | 1685篇 |
2012年 | 4173篇 |
2011年 | 10766篇 |
2010年 | 9237篇 |
2009年 | 6491篇 |
2008年 | 7905篇 |
2007年 | 8752篇 |
2006年 | 1043篇 |
2005年 | 2044篇 |
2004年 | 1876篇 |
2003年 | 1835篇 |
2002年 | 1179篇 |
2001年 | 484篇 |
2000年 | 545篇 |
1999年 | 464篇 |
1998年 | 463篇 |
1997年 | 400篇 |
1996年 | 383篇 |
1995年 | 302篇 |
1994年 | 311篇 |
1993年 | 305篇 |
1992年 | 260篇 |
1991年 | 234篇 |
1990年 | 201篇 |
1989年 | 230篇 |
1988年 | 193篇 |
1987年 | 177篇 |
1986年 | 174篇 |
1985年 | 239篇 |
1984年 | 214篇 |
1983年 | 184篇 |
1982年 | 168篇 |
1981年 | 195篇 |
1980年 | 130篇 |
1979年 | 147篇 |
1978年 | 143篇 |
1977年 | 127篇 |
1976年 | 138篇 |
1975年 | 120篇 |
1974年 | 105篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Sebastiano Battiato Giovanni Maria Farinella Giovanni Giuffrida Catarina Sismeiro Giuseppe Tribulato 《Multimedia Tools and Applications》2009,42(1):5-30
Traditionally, direct marketing companies have relied on pre-testing to select the best offers to send to their audience.
Companies systematically dispatch the offers under consideration to a limited sample of potential buyers, rank them with respect
to their performance and, based on this ranking, decide which offers to send to the wider population. Though this pre-testing
process is simple and widely used, recently the industry has been under increased pressure to further optimize learning, in
particular when facing severe time and learning space constraints. The main contribution of the present work is to demonstrate
that direct marketing firms can exploit the information on visual content to optimize the learning phase. This paper proposes
a two-phase learning strategy based on a cascade of regression methods that takes advantage of the visual and text features
to improve and accelerate the learning process. Experiments in the domain of a commercial Multimedia Messaging Service (MMS)
show the effectiveness of the proposed methods and a significant improvement over traditional learning techniques. The proposed
approach can be used in any multimedia direct marketing domain in which offers comprise both a visual and text component.
Sebastiano Battiato was born in Catania, Italy, in 1972. He received the degree in Computer Science (summa cum laude) in 1995 and his Ph.D in Computer Science and Applied Mathematics in 1999. From 1999 to 2003 he has lead the “Imaging” team c/o STMicroelectronics in Catania. Since 2004 he works as a Researcher at Department of Mathematics and Computer Science of the University of Catania. His research interests include image enhancement and processing, image coding and camera imaging technology. He published more than 90 papers in international journals, conference proceedings and book chapters. He is co-inventor of about 15 international patents. He is reviewer for several international journals and he has been regularly a member of numerous international conference committees. He has participated in many international and national research projects. He is an Associate Editor of the SPIE Journal of Electronic Imaging (Specialty: digital photography and image compression). He is director of ICVSS (International Computer Vision Summer School). He is a Senior Member of the IEEE. Giovanni Maria Farinella is currently contract researcher at Dipartimento di Matematica e Informatica, University of Catania, Italy (IPLAB research group). He is also associate member of the Computer Vision and Robotics Research Group at University of Cambridge since 2006. His research interests lie in the fields of computer vision, pattern recognition and machine learning. In 2004 he received his degree in Computer Science (egregia cum laude) from University of Catania. He was awarded a Ph.D. (Computer Vision) from the University of Catania in 2008. He has co-authored several papers in international journals and conferences proceedings. He also serves as reviewer numerous international journals and conferences. He is currently the co-director of the International Summer School on Computer Vision (ICVSS). Giovanni Giuffrida is an assistant professor at University of Catania, Italy. He received a degree in Computer Science from the University of Pisa, Italy in 1988 (summa cum laude), a Master of Science in Computer Science from the University of Houston, Texas, in 1992, and a Ph.D. in Computer Science, from the University of California in Los Angeles (UCLA) in 2001. He has an extensive experience in both the industrial and academic world. He served as CTO and CEO in the industry and served as consultant for various organizations. His research interest is on optimizing content delivery on new media such as Internet, mobile phones, and digital tv. He published several papers on data mining and its applications. He is a member of ACM and IEEE. Catarina Sismeiro is a senior lecturer at Imperial College Business School, Imperial College London. She received her Ph.D. in Marketing from the University of California, Los Angeles, and her Licenciatura in Management from the University of Porto, Portugal. Before joining Imperial College Catarina had been and assistant professor at Marshall School of Business, University of Southern California. Her primary research interests include studying pharmaceutical markets, modeling consumer behavior in interactive environments, and modeling spatial dependencies. Other areas of interest are decision theory, econometric methods, and the use of image and text features to predict the effectiveness of marketing communications tools. Catarina’s work has appeared in innumerous marketing and management science conferences. Her research has also been published in the Journal of Marketing Research, Management Science, Marketing Letters, Journal of Interactive Marketing, and International Journal of Research in Marketing. She received the 2003 Paul Green Award and was the finalist of the 2007 and 2008 O’Dell Awards. Catarina was also a 2007 Marketing Science Institute Young Scholar, and she received the D. Antonia Adelaide Ferreira award and the ADMES/MARKTEST award for scientific excellence. Catarina is currently on the editorial boards of the Marketing Science journal and the International Journal of Research in Marketing. Giuseppe Tribulato was born in Messina, Italy, in 1979. He received the degree in Computer Science (summa cum laude) in 2004 and his Ph.D in Computer Science in 2008. From 2005 he has lead the research team at Neodata Group. His research interests include data mining techniques, recommendation systems and customer targeting. 相似文献
Giuseppe TribulatoEmail: |
Sebastiano Battiato was born in Catania, Italy, in 1972. He received the degree in Computer Science (summa cum laude) in 1995 and his Ph.D in Computer Science and Applied Mathematics in 1999. From 1999 to 2003 he has lead the “Imaging” team c/o STMicroelectronics in Catania. Since 2004 he works as a Researcher at Department of Mathematics and Computer Science of the University of Catania. His research interests include image enhancement and processing, image coding and camera imaging technology. He published more than 90 papers in international journals, conference proceedings and book chapters. He is co-inventor of about 15 international patents. He is reviewer for several international journals and he has been regularly a member of numerous international conference committees. He has participated in many international and national research projects. He is an Associate Editor of the SPIE Journal of Electronic Imaging (Specialty: digital photography and image compression). He is director of ICVSS (International Computer Vision Summer School). He is a Senior Member of the IEEE. Giovanni Maria Farinella is currently contract researcher at Dipartimento di Matematica e Informatica, University of Catania, Italy (IPLAB research group). He is also associate member of the Computer Vision and Robotics Research Group at University of Cambridge since 2006. His research interests lie in the fields of computer vision, pattern recognition and machine learning. In 2004 he received his degree in Computer Science (egregia cum laude) from University of Catania. He was awarded a Ph.D. (Computer Vision) from the University of Catania in 2008. He has co-authored several papers in international journals and conferences proceedings. He also serves as reviewer numerous international journals and conferences. He is currently the co-director of the International Summer School on Computer Vision (ICVSS). Giovanni Giuffrida is an assistant professor at University of Catania, Italy. He received a degree in Computer Science from the University of Pisa, Italy in 1988 (summa cum laude), a Master of Science in Computer Science from the University of Houston, Texas, in 1992, and a Ph.D. in Computer Science, from the University of California in Los Angeles (UCLA) in 2001. He has an extensive experience in both the industrial and academic world. He served as CTO and CEO in the industry and served as consultant for various organizations. His research interest is on optimizing content delivery on new media such as Internet, mobile phones, and digital tv. He published several papers on data mining and its applications. He is a member of ACM and IEEE. Catarina Sismeiro is a senior lecturer at Imperial College Business School, Imperial College London. She received her Ph.D. in Marketing from the University of California, Los Angeles, and her Licenciatura in Management from the University of Porto, Portugal. Before joining Imperial College Catarina had been and assistant professor at Marshall School of Business, University of Southern California. Her primary research interests include studying pharmaceutical markets, modeling consumer behavior in interactive environments, and modeling spatial dependencies. Other areas of interest are decision theory, econometric methods, and the use of image and text features to predict the effectiveness of marketing communications tools. Catarina’s work has appeared in innumerous marketing and management science conferences. Her research has also been published in the Journal of Marketing Research, Management Science, Marketing Letters, Journal of Interactive Marketing, and International Journal of Research in Marketing. She received the 2003 Paul Green Award and was the finalist of the 2007 and 2008 O’Dell Awards. Catarina was also a 2007 Marketing Science Institute Young Scholar, and she received the D. Antonia Adelaide Ferreira award and the ADMES/MARKTEST award for scientific excellence. Catarina is currently on the editorial boards of the Marketing Science journal and the International Journal of Research in Marketing. Giuseppe Tribulato was born in Messina, Italy, in 1979. He received the degree in Computer Science (summa cum laude) in 2004 and his Ph.D in Computer Science in 2008. From 2005 he has lead the research team at Neodata Group. His research interests include data mining techniques, recommendation systems and customer targeting. 相似文献
992.
In this paper, based on nonnegative matrix theory, the Halanay’s inequality and Lyapunov functional, some novel sufficient
conditions for global asymptotic robust stability and global exponential robust stability of neural networks with time-varying
delays are presented. It is shown that our results improve and generalize several previous results derived in the literatures.
From the obtained results, some linear matrix inequality criteria are derived. Finally, a simulation is given to show the
effectiveness of the results. 相似文献
993.
Broadcasting scheme with low client buffers and bandwidths for video-on-demand applications 总被引:1,自引:1,他引:0
Hsiang-Fu Yu Hung-Chang Yang Yao-Tien Wang Ping-Lin Fan Chu-Yi Chien 《Multimedia Tools and Applications》2009,42(3):295-316
Efficient data broadcasting is independent of request arrivals, and is thus highly promising when transmitting popular videos.
A conventionally adopted broadcasting method is periodic broadcasting, which divides a popular video into segments, which
are then simultaneously broadcast on different data channels. Once clients want to watch the video, they download the segments
from these channels. The skyscraper broadcasting (SkB) scheme supports clients with small bandwidths. An SkB client requires
only two-channel bandwidths to receive video segments. This work proposes a reverse SkB (RSkB) scheme, which extends SkB by
reducing buffering spaces. The RSkB is mathematically shown to achieve on-time video delivery and two-channel client bandwidths.
A formula for determining the maximum number of segments buffered by an RSkB client is presented. Finally, an analysis of
RSkB reveals that its client buffer requirements are usually 25–37% lower than SkB. Extensive simulations of RSkB further
demonstrate that RSkB yields lower client buffer demand than other proposed systems.
相似文献
Hsiang-Fu YuEmail: |
994.
995.
996.
Sebastian Klenk Jürgen Dippon Peter Fritz Gunther Heidemann 《Information Systems Frontiers》2009,11(4):391-403
Medical data mining is currently actively pursued in computer science and statistical research but not in medical practice.
The reasons therefore lie in the difficulties of handling and statistically analyzing medical data. We have developed a system
that allows practitioners in the field to interactively analyze their data without assistance of statisticians or data mining
experts. In the course of this paper we will introduce data mining of medical data and show how this can be achieved for survival
data. We will demonstrate how to solve common problems of interactive survival analysis by presenting the Online Clinical
Data Mining (OCDM) system. Thereby the main focus is on similarity based queries, a new method to select similar cases based
on their covariables and the influence of these on their survival. 相似文献
997.
This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable
needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ
γ
(t), that specifies his needs in this slot. The rates satisfy the restriction ∑
γ
ρ
γ
(t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which
the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ
-smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑
t∈I
ρ
γ
(t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers
a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents
the first online smooth schedulers for variable rates under this restriction.
The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that
this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized
and, of course, was never proved. Our paper formalizes and proves some aspects of this observation.
Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards
by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player
is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the
pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to
approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation,
the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the
schedule.
Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement 相似文献
998.
Degree-Optimal Routing for P2P Systems 总被引:1,自引:0,他引:1
Giovanni Chiola Gennaro Cordasco Luisa Gargano Mikael Hammar Alberto Negro Vittorio Scarano 《Theory of Computing Systems》2009,45(1):43-63
We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g.
optimal average path length O(log 2
n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004).
Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing
the NoN technique to be implemented without adding any overhead to the corresponding deterministic network.
We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages
of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system.
We also provide a matching lower bound for the average path length of the routing schemes for any c.
This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed
Services), . 相似文献
999.
A Randomized Algorithm for Online Unit Clustering 总被引:1,自引:0,他引:1
In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions. 相似文献
1000.