全文获取类型
收费全文 | 563篇 |
免费 | 29篇 |
学科分类
工业技术 | 592篇 |
出版年
2023年 | 7篇 |
2022年 | 41篇 |
2021年 | 33篇 |
2020年 | 15篇 |
2019年 | 17篇 |
2018年 | 10篇 |
2017年 | 9篇 |
2016年 | 18篇 |
2015年 | 23篇 |
2014年 | 23篇 |
2013年 | 42篇 |
2012年 | 40篇 |
2011年 | 28篇 |
2010年 | 23篇 |
2009年 | 26篇 |
2008年 | 13篇 |
2007年 | 33篇 |
2006年 | 20篇 |
2005年 | 13篇 |
2004年 | 16篇 |
2003年 | 17篇 |
2002年 | 12篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 10篇 |
1998年 | 17篇 |
1997年 | 17篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1971年 | 2篇 |
排序方式: 共有592条查询结果,搜索用时 0 毫秒
1.
Elisabetta Tornatore Pasquale Vetro Stefania Maria Buccellato 《Neural computing & applications》2014,24(2):309-315
We propose a stochastic disease model where vaccination is included and such that the immunity is permanent. The existence, uniqueness, and positivity of the solution and the stability of the disease-free equilibrium are studied. 相似文献
2.
Stefania Perri Pasquale Corsonello Giuseppe Cocorullo 《Computer Vision and Image Understanding》2013,117(1):29-41
This paper presents a new hardware-oriented approach for the extraction of disparity maps from stereo images. The proposed method is based on the herein named Adaptive Census Transform that exploits adaptive support weights during the image transformation; the adaptively weighted sum of SADs is then used as the dissimilarity metric. Quality tests show that the proposed method reaches significantly better accuracy than alternative hardware-oriented approaches. To demonstrate the practical hardware feasibility, a specific architecture has been designed and its implementation has been carried out using a single FPGA chip. Such a VLSI implementation allows a frame rate up to 68 fps to be reached for 640 × 480 stereo images, using just 80,000 slices and 32 RAM blocks of a Virtex6 chip. 相似文献
3.
In this paper we present a novel methodology based on non-parametric deformable prototype templates for reconstructing the
outline of a shape from a degraded image. Our method is versatile and fast and has the potential to provide an automatic procedure
for classifying pathologies. We test our approach on synthetic and real data from a variety of medical and biological applications.
In these studies it is important to reconstruct accurately the shape of the object under investigation from very noisy data.
Here we assume that we have some prior knowledge about the object outline represented by a prototype shape. Our procedure
deforms this shape by means of non-affine transformations and the contour is reconstructed by minimizing a newly developed
objective function that depends on the transformation parameters. We introduce an iterative template deformation procedure
in which the scale of the deformation decreases as the algorithm proceeds. We compare our results with those from a Gaussian
Mixture Model segmentation and two state-of-the-art Level Set methods. This comparison shows that the proposed procedure performs
consistently well on both real and simulated data. As a by-product we develop a new filter that recovers the connectivity
of a shape.
Francesco de Pasquale received his Ph.D. in Applied Statistics from the University of Plymouth, United Kingdom in 2004 discussing a thesis on Bayesian and Template based methods for image analysis. Since his degree in Physics obtained at the University of Rome ‘La Sapienza’in 1999 his work has been focused on developing models and methods for Magnetic Resonance Imaging, in particular image registration, classification and segmentation in a Bayesian framework. After being appointed a 2-year contract as a Lecturer at the University of Plymouth from 2003 to 2004 he is now a post-Doc researcher at the ITAB, Institute for Advanced Biomedical Technologies, University of Chieti, Italy and he works on the analysis of fMRI and MEG data. Julian Stander was born in Plymouth, UK in 1964. He received a BA in Mathematics with first class honours from University of Oxford in 1987, a Diploma in Mathematical Statistics with distinction from University of Cambridge in 1988, and a PhD from University of Bath in 1992. He has been a lecturer at the School of Mathematics and Statistics, University of Plymouth, since 1993, and was promoted to Reader in 2006. His fields of interest are: applications of statistics including image analysis, spatial modelling and disclosure limitation. He has published over 20 refereed journal articles. 相似文献
Francesco de PasqualeEmail: |
Francesco de Pasquale received his Ph.D. in Applied Statistics from the University of Plymouth, United Kingdom in 2004 discussing a thesis on Bayesian and Template based methods for image analysis. Since his degree in Physics obtained at the University of Rome ‘La Sapienza’in 1999 his work has been focused on developing models and methods for Magnetic Resonance Imaging, in particular image registration, classification and segmentation in a Bayesian framework. After being appointed a 2-year contract as a Lecturer at the University of Plymouth from 2003 to 2004 he is now a post-Doc researcher at the ITAB, Institute for Advanced Biomedical Technologies, University of Chieti, Italy and he works on the analysis of fMRI and MEG data. Julian Stander was born in Plymouth, UK in 1964. He received a BA in Mathematics with first class honours from University of Oxford in 1987, a Diploma in Mathematical Statistics with distinction from University of Cambridge in 1988, and a PhD from University of Bath in 1992. He has been a lecturer at the School of Mathematics and Statistics, University of Plymouth, since 1993, and was promoted to Reader in 2006. His fields of interest are: applications of statistics including image analysis, spatial modelling and disclosure limitation. He has published over 20 refereed journal articles. 相似文献
4.
Iovine Andrea Lops Pasquale Narducci Fedelucio de Gemmis Marco Semeraro Giovanni 《Journal of Intelligent Information Systems》2022,58(2):337-362
Journal of Intelligent Information Systems - Conversational Recommender Systems have received widespread attention in both research and practice. They assist people in finding relevant and... 相似文献
5.
6.
Placidi G Franchi D Marsili L Gallo P 《Computer methods and programs in biomedicine》2007,88(2):144-151
Vascular catheterization is a common procedure in clinical medicine. It is normally performed by a specialist using an X-ray fluoroscopic guide and contrast-media. In the present paper, an image-guided navigation system which indicates a path providing guidance to the desired target inside the vascular tree is described with the aim of reducing the exposure of personnel and patients to X-rays during the catheterization procedure. A 3D model of the patient vascular tree, reconstructed with data collected by an angiography before starting the intervention, is used as a guide map instead of fluoroscopic scans. An accurate spatial correspondence between the body of the patient and the 3D reconstructed vascular model is established and, by means of a position indicator installed over the catheter tip, the real-time position/orientation of the tip is indicated correctly. This paper describes the system and the operational procedures necessary to use the proposed method efficiently during a catheter intervention. Preliminary experimental results on a phantom are also reported. 相似文献
7.
A hybrid model for real time simulation of urban traffic 总被引:1,自引:0,他引:1
In this paper a hybrid model is presented to predict the behavior of traffic in urban area. Intersections and on/off-ramps are modeled by Colored Timed Petri Nets while road links are modeled by a stochastic discrete time model. It is assumed that vehicle routings at each intersection are stochastic. A Particle Filter algorithm based on the hybrid model is developed to estimate the system state. The validation of the model by using real data is discussed. The limited computational effort required makes the model suitable to be used in simulation-based control schemes for urban traffic. 相似文献
8.
Dohnal Vlastislav Gennaro Claudio Savino Pasquale Zezula Pavel 《Multimedia Tools and Applications》2003,21(1):9-33
In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations. 相似文献
9.
The multimedia multicasting problem 总被引:4,自引:0,他引:4
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications.
The interaction between multicasting and the delivery of multiple time-correlated continuous-media streams with real-time
delay requirements poses various new and interesting problems in research on communication protocols and architectures. We
describe these problems, and identify where the opportunities are for effective solutions, all in the context of providing
an overview of the current state of research in multimedia multicasting. The issues we discuss include quality of service,
resource reservations, routing, error and traffic control, heterogeneity, and the use of hierarchical coding and open-loop
control techniques. 相似文献
10.
Approximate similarity retrieval with M-trees 总被引:4,自引:0,他引:4
Pavel Zezula Pasquale Savino Giuseppe Amato Fausto Rabitti 《The VLDB Journal The International Journal on Very Large Data Bases》1998,7(4):275-293
Motivated by the urgent need to improve the efficiency of similarity queries, approximate similarity retrieval is investigated
in the environment of a metric tree index called the M-tree. Three different approximation techniques are proposed, which
show how to forsake query precision for improved performance. Measures are defined that can quantify the improvements in performance
efficiency and the quality of approximations. The proposed approximation techniques are then tested on various synthetic and
real-life files. The evidence obtained from the experiments confirms our hypothesis that a high-quality approximated similarity
search can be performed at a much lower cost than that needed to obtain the exact results. The proposed approximation techniques
are scalable and appear to be independent of the metric used. Extensions of these techniques to the environments of other
similarity search indexes are also discussed.
Received July 7, 1998 / Accepted October 13, 1998 相似文献