System-On-Chessboard is a novel System-On-Chip design technique targeted at Time-To-Market aspects of system level design. Various methodologies, tools and recommendations already exist but there is none which can cla...
详细信息
ISBN:
(纸本)0889865450
System-On-Chessboard is a novel System-On-Chip design technique targeted at Time-To-Market aspects of system level design. Various methodologies, tools and recommendations already exist but there is none which can claim to provide chip-in-a-day design productivity. this paper presents a brief overview of our strategy, devised to achieve chip-in-a-day and recommendations to handle various obstacles in achieving this target. this coarse-grained grid based technique involves efficient use of conventional tools, technologies and design methodologies and hence leverages existing development environments. the main emphasis in this paper is the physical design part of the system design flow. 505-043 in display pdf
Artificial neural networks, with radial basis functions (ANNRB), are used to diagnose patients with multiple sclerosis on the basis of their auditory evoked potentials. the wavelet transform coefficients of the evoked...
详细信息
ISBN:
(纸本)0889865477
Artificial neural networks, with radial basis functions (ANNRB), are used to diagnose patients with multiple sclerosis on the basis of their auditory evoked potentials. the wavelet transform coefficients of the evoked potentials are employed as inputs to the network. the paucity of the number of clinical cases available put a lot of restrictions on the network architecture. Only a handful of coefficients can be used to train the network, and we must select the coefficients that contain the most significant features [1].this feature selection is done using different statistical criteria, and we reduce the number to eight significant coefficients out of the hundreds or thousands of wavelet coefficients obtained in the transformation of the signals [2]. In a radial basis functions neural network, the number of free parameters jumps proportionally to the dimension of the input space when a new input node is added. A good selection of some of the centers for the radial basis functions will allow us to use more functions in the network architecture, making it more robust. To this end, we are going to use the power of unsupervised learning, before we apply the supervised one. In particular, we want to create clusters on the join input-output vector space of the supplied data utilizing a deterministic clustering algorithm. the centers and radii of these clusters could be employed for the centers and radii of the radial basis functions. To extract the maximum information from our preprocessing, we apply the locally most entropic estimate of the true join input-output probability density function to each of the obtained cluster-partitions and find the partition, and therefore the number of clusters, that has the lowest one [3]. the information from this partition, with its groups, centers and radii will be used to build the artificial network for diagnosing multiple sclerosis.
Recent research in the field of case-based reasoning has seen an increasing focus on its application within temporal domains. though many significant advances have been made, unsolved issues still remain in the fundam...
详细信息
ISBN:
(纸本)0889866104
Recent research in the field of case-based reasoning has seen an increasing focus on its application within temporal domains. though many significant advances have been made, unsolved issues still remain in the fundamental representation and retrieval tasks. In this paper, we review past work using point-based and interval-based case representations and retrieval. From this review, we highlight unexamined areas in temporal case-based reasoning.
With Wireless Sensor Networks becoming more and more prominent, a lot of new routing protocols are being proposed. But most of the routing protocols are designed to address the limitations of sensor nodes especially t...
详细信息
ISBN:
(纸本)0889865701
With Wireless Sensor Networks becoming more and more prominent, a lot of new routing protocols are being proposed. But most of the routing protocols are designed to address the limitations of sensor nodes especially their sparse energy resources. However, advances in technology have led to highly sophisticated sensor nodes that can transmit video/images and critical information. the routing protocol should be able to handle real-time or critical data where latency is important and non-real-time or non-critical data where energy efficiency is important using different approaches. In this paper, we propose a priority-based routing approach for sending data using different routes based on the priority and Quality of Service (QoS) requirements. the proposed adaptive routing protocol framework, AdProc, supports two different routes;a short rapid route for data with high priority and strict QoS requirements, and an energy efficient route for lower priority data. Simulation results suggest that AdProc achieved higher QoS by reducing the latency while remaining energy efficient. the protocol framework also helps distribute energy consumption thereby prolonging the network life and reducing network holes.
Recent advances in technology have enabled the development of ad hoc mobile networks in which a collection of mobile hosts (nodes) may move freely and self-organize into arbitrary and temporary network topologies in a...
详细信息
Recent advances in technology have enabled the development of ad hoc mobile networks in which a collection of mobile hosts (nodes) may move freely and self-organize into arbitrary and temporary network topologies in areas where communication infrastructures do not exist. In such networks, hosts frequently need data items to finish a certain task. the hosts chosen to store data items are called data servers. If the data items are stored too far away from the requiring host, multiple intermediate hosts are needed to relay the data. this creates a certain amount of delay which is not insignificant in time-critical applications. In this paper, we propose three approaches to locate minimum number of data servers that allow each host to obtain data items in at most k hops. the approaches include one centralized approach and two distributed approaches. Simulation results show that comparing withthe centralized approach, the two distributed ones are practical algorithms to find minimum number of data servers in ad hoc mobile networks.
Although the 2D desktop metaphor has been the dominating paradigm of user interfaces for over two decades, 3D models of interaction are becoming more feasible due to advances in computer output hardware and software t...
详细信息
ISBN:
(纸本)1595934731
Although the 2D desktop metaphor has been the dominating paradigm of user interfaces for over two decades, 3D models of interaction are becoming more feasible due to advances in computer output hardware and software technology. However, conventional input devices such as a mouse or track-pad generally restrict direct manipulation interaction to a 2D paradigm. More sophisticated 3D input devices such data-gloves have been available for some time, but these tend to be expensive or restrictive in their use. In this paper we describe a simple and inexpensive single camera-based video input system which allows 3D interaction with existing computer application using bare hands. Copyright 2006 ACM.
the proceedings contain 50 papers. the topics discussed include: on-demand index for efficient structural joins;spatial index compression for location-based services based on a MBR semi-approximation scheme;KCAM: conc...
详细信息
ISBN:
(纸本)3540352252
the proceedings contain 50 papers. the topics discussed include: on-demand index for efficient structural joins;spatial index compression for location-based services based on a MBR semi-approximation scheme;KCAM: concentrating on structural similarity for XML fragments;automated extraction of hit numbers from search result pages;keyword extraction using support vector machine;efficient evaluation of multiple queries on streamed XML fragments;succinct and informative cluster descriptions for document repositories;an efficient approach for hiding sensitive knowledge in data publishing;dynamic configuring service on semantic grid;optimizing the profit of on-demand multimedia service via a service development queuing system;minitasking: improving cache performance for multiple query workloads;and compressing spatial and temporal correlated data in wireless sensor networks based on ring topology.
this paper reports the design of a micromanipulation system with stereoscopic imaging for handling and assembly in microtechnology. the system consists of the Kleindiek Micromanipulator MM3A, a mobile stage, a microgr...
详细信息
ISBN:
(纸本)0889865957
this paper reports the design of a micromanipulation system with stereoscopic imaging for handling and assembly in microtechnology. the system consists of the Kleindiek Micromanipulator MM3A, a mobile stage, a microgripper, an electromagnetic microactuator, a stereoscopic microscope in combination with a CCD camera, 2 additional external CCD cameras and a computer. the microgripper is mounted on the micromanipulator, which has 3 degrees of freedom (two rotational axes, one linear axis), subnanometer resolution and a wide working range (240 in the rotational axes, 12 mm in linear axis). However, the micromanipulator does not possess positional encoders;therefore a feedback of the current position of the manipulator's axes is not available. Hence, the control unit of the manipulator allows only stepwise manual control of the micromanipulator. Due to this fact, this study mainly focused on the development of automated control of the micromanipulator. Visual feedback was chosen to provide position information of the manipulator's axes and a PC based control has been implemented by connecting the control unit to the PC by serial port. Moreover, since the microgripper is electromagnetically driven it is easier to control the displacement of the tips as well as the gripping force by controlling the applied current.
A new algorithm for the best repair path of power distribution network is presented. the algorithm is based on particle swarm optimization (PSO) approach, which is a new general-purpose meta-heuristic algorithm and ha...
详细信息
ISBN:
(纸本)0863412467
A new algorithm for the best repair path of power distribution network is presented. the algorithm is based on particle swarm optimization (PSO) approach, which is a new general-purpose meta-heuristic algorithm and has been demonstrated to be effective in solving hard combinatorial optimization problems. In this paper, PSO algorithm is improved in two parts of the parameter inertia weight and the discrete idea is added to, so that it can easily run out the local optimum and provide high speed of convergence as well as for the proposed application. the mathematical model of the best repair path of power distribution network is established which takes the shortest travel time as object and the solution algorithm is developed based on the mathematical model. the feasibility and efficiency of the algorithm are verified by the result of applying it to a sample system.
暂无评论