全文获取类型
收费全文 | 203篇 |
免费 | 11篇 |
专业分类
电工技术 | 3篇 |
化学工业 | 28篇 |
机械仪表 | 1篇 |
建筑科学 | 4篇 |
能源动力 | 7篇 |
轻工业 | 9篇 |
水利工程 | 3篇 |
无线电 | 21篇 |
一般工业技术 | 41篇 |
冶金工业 | 10篇 |
原子能技术 | 2篇 |
自动化技术 | 85篇 |
出版年
2023年 | 2篇 |
2022年 | 9篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 9篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 10篇 |
2013年 | 21篇 |
2012年 | 20篇 |
2011年 | 16篇 |
2010年 | 5篇 |
2009年 | 11篇 |
2008年 | 6篇 |
2007年 | 12篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 7篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有214条查询结果,搜索用时 31 毫秒
1.
Christos D Melas Leonidas A Zampetakis Anastasia Dimopoulou Vassilis S Moustakis 《欧洲信息系统杂志》2014,23(6):672-690
Technology readiness (TR) represents an individual’s mental readiness to accept new technologies. Although the TR scale has been used in many studies, its application in the healthcare context is limited. This paper focuses on identifying the TR profiles of medical staff and to model preference TR variations with respect to computer use, computer knowledge and computer feature demands. The study reports results from a nationwide study conducted in Greece, during a three-year period, which sampled responses from 604 physicians and nurses working in 14 Greek hospitals. Exploratory Structural Equation Modelling analysis is used in order to confirm the structure of the Technology Readiness Index. The results confirm the five groups of the TR taxonomy. Statistical differences were found between classes in information and communication technology (ICT) knowledge, ICT feature demands, hours of use per week as well as ICT use performance, but not in the general use of ICT. The results facilitate comprehension of the factors, which influence the use of ICT by medical staff and, in addition, they convey important policy and managerial implications. In conclusion, medical staff should be treated according to its TR taxonomy classes in order to expedite the acceptance and use of an ICT system. 相似文献
2.
3.
Although considerable attention in recent years has been given to the problem of symmetry detection in general shapes, few methods have been developed that aim to detect and quantify the intrinsic symmetry of a shape rather than its extrinsic, or pose‐dependent symmetry. In this paper, we present a novel approach for efficiently computing symmetries of a shape which are invariant up to isometry preserving transformations. We show that the intrinsic symmetries of a shape are transformed into the Euclidean symmetries in the signature space defined by the eigenfunctions of the Laplace‐Beltrami operator. Based on this observation, we devise an algorithm which detects and computes the isometric mappings from the shape onto itself. We show that our approach is both computationally efficient and robust with respect to small non‐isometric deformations, even if they include topological changes. 相似文献
4.
Anthony E. Okorodudu Leonidas Fegaras David Levine 《Universal Access in the Information Society》2011,10(2):207-216
There has been a great interest in publish/subscribe systems in recent years. This interest, coupled with the pervasiveness
of light-weight electronic devices, such as cellular phones and personal digital assistants, has opened a new arena in publish/subscribe
networks. Currently, many broker overlay networks are static and rarely change in structure. Often, a network overlay structure
is predefined or manually modified. This paper presents a dynamic broker network for disseminating critical lab and patient
information in a Healthcare information system. The reported work builds upon previous network optimization research on ad
hoc publish/subscribe networks. The underlying framework utilizes user-defined cost functions to satisfy quality of service
constraints. In essence, the broker network optimization problem is reduced to an incremental search problem to generate low
cost network configurations. Certain reliability issues are also addressed by providing a scheduling algorithm to selectively
retransmit information and handle broker connectivity failures. 相似文献
5.
Despite the large amount of work devoted in recent years to the problem of non‐rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice. 相似文献
6.
Justin Solomon Mirela Ben‐Chen Adrian Butscher Leonidas Guibas 《Computer Graphics Forum》2011,30(2):365-374
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost‐isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently‐developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state‐of‐the‐art methods using the Princeton Segmentation Benchmark. 相似文献
7.
Justin Solomon Mirela Ben‐Chen Adrian Butscher Leonidas Guibas 《Computer Graphics Forum》2011,30(5):1543-1552
Cartoon animation, image warping, and several other tasks in two‐dimensional computer graphics reduce to the formulation of a reasonable model for planar deformation. A deformation is a map from a given shape to a new one, and its quality is determined by the type of distortion it introduces. In many applications, a desirable map is as isometric as possible. Finding such deformations, however, is a nonlinear problem, and most of the existing solutions approach it by minimizing a nonlinear energy. Such methods are not guaranteed to converge to a global optimum and often suffer from robustness issues. We propose a new approach based on approximate Killing vector fields (AKVFs), first introduced in shape processing. AKVFs generate near‐isometric deformations, which can be motivated as direction fields minimizing an “as‐rigid‐as‐possible” (ARAP) energy to first order. We first solve for an AKVF on the domain given user constraints via a linear optimization problem and then use this AKVF as the initial velocity field of the deformation. In this way, we transfer the inherent nonlinearity of the deformation problem to finding trajectories for each point of the domain having the given initial velocities. We show that a specific class of trajectories — the set of logarithmic spirals — is especially suited for this task both in practice and through its relationship to linear holomorphic vector fields. We demonstrate the effectiveness of our method for planar deformation by comparing it with existing state‐of‐the‐art deformation methods. 相似文献
8.
The problem of channel sharing by rate adaptive streams belonging to various classes is considered. Rate adaptation provides
the opportunity for accepting more connections by adapting the bandwidth of connections that are already in the system. However,
bandwidth adaptation must be employed in a careful manner in order to ensure that (a) bandwidth is allocated to various classes
in a fair manner (system perspective) and (b) bandwidth adaptation does not affect adversely the perceived user quality of
the connection (user quality). The system perspective aspect has been studied earlier. This paper focuses on the equally important
user perspective. It is proposed to quantify user Quality of Service (QoS) through measures capturing short and long-term
bandwidth fluctuations that can be implemented with the mechanisms of traffic regulators, widely used in networking for the
purpose of controlling the traffic entering or exiting a network node. Furthermore, it is indicated how to integrate the user
perspective metrics with the optimal algorithms for system performance metrics developed earlier by the authors. Simulation
results illustrate the effectiveness of the proposed framework.
Nikos G. Argiriou received the Diploma degree in Electrical Engineering from the Department of Electrical Engineering, Telecommunication Division, Aristotle University of Thessaloniki, Greece, in 1996. He worked as a researcher, on secure medical image transmission over networks, at the Image Processing Lab at the same university during 1996–1997. During 1998–2000 he was a researcher for the European Project Esprit Catserver concerning the use of advanced Quality of Service techniques in CATV networks. He received his Ph.D. degree at Aristotle University of Thessaloniki in 2007. His current research interests are in the development and implementation of QoS techniques for wired and wireless networks. Leonidas Georgiadis received the Diploma degree in Electrical Engineering from Aristotle University, Thessaloniki, Greece, in 1979, and his M.S. and Ph.D degrees both in Electrical Engineering from the University of Connecticut, in 1981 and 1986, respectively. From 1986 to 1987 he was Research Assistant Professor at the University of Virginia, Charlottesville. In 1987 he joined IBM T. J. Watson Research Center, Yorktown Heights as a Research Staff Member. Since October 1995, he has been with the Telecommunications Department of Aristotle University, Thessaloniki, Greece. His interests are in the area of wireless networks, high speed networks, routing, scheduling, congestion control, modeling and performance analysis. 相似文献
Leonidas GeorgiadisEmail: |
Nikos G. Argiriou received the Diploma degree in Electrical Engineering from the Department of Electrical Engineering, Telecommunication Division, Aristotle University of Thessaloniki, Greece, in 1996. He worked as a researcher, on secure medical image transmission over networks, at the Image Processing Lab at the same university during 1996–1997. During 1998–2000 he was a researcher for the European Project Esprit Catserver concerning the use of advanced Quality of Service techniques in CATV networks. He received his Ph.D. degree at Aristotle University of Thessaloniki in 2007. His current research interests are in the development and implementation of QoS techniques for wired and wireless networks. Leonidas Georgiadis received the Diploma degree in Electrical Engineering from Aristotle University, Thessaloniki, Greece, in 1979, and his M.S. and Ph.D degrees both in Electrical Engineering from the University of Connecticut, in 1981 and 1986, respectively. From 1986 to 1987 he was Research Assistant Professor at the University of Virginia, Charlottesville. In 1987 he joined IBM T. J. Watson Research Center, Yorktown Heights as a Research Staff Member. Since October 1995, he has been with the Telecommunications Department of Aristotle University, Thessaloniki, Greece. His interests are in the area of wireless networks, high speed networks, routing, scheduling, congestion control, modeling and performance analysis. 相似文献
9.
Leonidas Lymberopoulos Emil Lupu Morris Sloman 《Journal of Network and Systems Management》2003,11(3):277-303
This paper presents a framework for specifying policies for the management of network services. Although policy-based management has been the subject of considerable research, proposed solutions are often restricted to condition-action rules, where conditions are matched against incoming traffic flows. This results in static policy configurations where manual intervention is required to cater for configuration changes and to enable policy deployment. The framework presented in this paper supports automated policy deployment and flexible event triggers to permit dynamic policy configuration. While current research focuses mostly on rules for low-level device configuration, significant challenges remain to be addressed in order to:a) provide policy specification and adaptation across different abstraction layers; and, b) provide tools and services for the engineering of policy-driven systems. In particular, this paper focuses on solutions for dynamic adaptation of policies in response to changes within the managed environment. Policy adaptation includes both dynamically changing policy parameters and reconfiguring the policy objects. Access control for network services is also discussed. 相似文献
10.
Siome Goldenstein Menelaos Karavelas Dimitris Metaxas Leonidas Guibas Eric Aaron Ambarish Goswami 《Computers & Graphics》2001,25(6):983-998
We present a new methodology for agent modeling that is scalable and efficient. It is based on the integration of nonlinear dynamical systems and kinetic data structures. The method consists of three layers, which together model 3D agent steering, crowds and flocks among moving and static obstacles. The first layer, the local layer employs nonlinear dynamical systems theory to models low-level behaviors. It is fast and efficient, and it does not depend on the total number of agents in the environment. This dynamical systems-based approach also allows us to establish continuous numerical parameters for modifying each agent's behavior. The second layer, a global environment layer consists of a specifically designed kinetic data structure to track efficiently the immediate environment of each agent and know which obstacles/agents are near or visible to the given agent. This layer reduces the complexity in the local layer. In the third layer, a global planning layer, the problem of target tracking is generalized in a way that allows navigation in maze-like terrains, avoidance of local minima and cooperation between agents. We implement this layer based on two approaches that are suitable for different applications: One approach is to track the closest single moving or static target; the second is to use a pre-specified vector field, which may be generated automatically (with harmonic functions, for example) or based on user input to achieve the desired output. We also discuss how hybrid systems concepts for global planning can capitalize on both our layered approach and the continuous, reactive nature of our agent steering.
We demonstrate the power of the approach through a series of experiments simulating single/multiple agents and crowds moving towards moving/static targets in complex environments. 相似文献