Miracle-dz/UniFAR-FTUs huggingface dataset:
HRCT: hop-by-hop rate control technique for congestion control in wireless sensor network

In Wireless Sensor Networks, congestion occurs when the traffic rate is high. This happens when the an event is detected in a network. Congestion causes packet loss thus degrading the performance of the network. Hence it necessitates to develop an effective congestion control technique. This paper focuses on congestion due to concurrent transmission. We have proposed an efficient protocol to detect and control congestion in a MAC. The occurrence of congestion is detected by calculating a new metrics called congestion scale. When the congestion scale exceeds the threshold value it intimates, that, congestion has occurred. Congestion notification signal is send to all the nodes. On receiving the notification signal all nodes adjust their transmission rate to control congestion. We have implemented Hop-by-Hop Rate Control Technique(HRCT) to control congestion and to guarantee both high throughput and minimum delay. This technique is implemented successfully in NS-2 simulator. Finally, simulation results have demonstrated the effectiveness of our proposed algorithm.
Book Review : Enduser Systems and Their Human Factors, A. Blaser and M. Zoeppritz, eds. Berlin: Springer-Verlag, 1983. 138 pp. Paper.

ware package? How can we study software’s userfriendliness, i.e., ease of use? These are the motivating questions for Enduser Systems and Their Human Factors, edited by A. Blaser and M. Zoeppritz. While many software developers talk about &dquo;user-friendliness,&dquo; the contributors to this volume try to do something about it. The book reports the proceedings of an invitational symposium sponsored by IBM Germany at the IBM Science Center in Heidelberg on March
A fast model for simulating reentry in three dimensions with fiber rotation

Transmural rotation of cardiac fibers may have a large influence on reentry in the heart. However, modeling reentry is computationally challenging since the tissue modeled must be large enough to sustain reentry and this leads to a system of with millions of variables. A method is presented which decreases computation time due to its use of a discrete cable model which allows for system order reduction, and because it tracks the activation wavefront and only integrates the neighborhood of the front with a small time step. Simulations of approximately 1.8/spl times/10/sup 6/ cells in a block measuring 2/spl times/4/spl times/0.29 cm were possible in a reasonable amount of time. The effect on speed and accuracy of model parameters is discussed. It is also demonstrated that the method lends itself well to parallel computation. The effect of fiber rotation can be clearly seen during reentry.
Tactile Television - Mechanical and Electrical Image Projection

The feasibility of communicating pictorial information through the skin has been demonstrated. A tactile television system has permitted blind subjects to determine the position, size, shape, and orientation of visible objects and to track moving targets. The system comprises 1) a vidicon camera utilizing a zoom lens, 2) a digital switching matrix to sequentially connect each element of the photocathode surface through a single video amplifier and signal conditioner to each of the 3) 400 tactile stimulators in a 20 × 20 matrix in contact with a 10-inch square of skin. This image-projector matrix impresses on the skin a two-dimensional vibrating facsimile of either the silhouette or the outline of a visible object. The single-channel swept system exhibits inherent economies when a great number of picture elements is to be processed. Since the fovea of the human eye subserving the central two degrees of detailed vision is comprised of cone cells in a matrix about 200 receptors across, the present 20-line system permits picture transmission with a linear resolution about one-tenth that of the fovea, and has proved adequate for the recognition of human faces. Calculations indicate that the input capacity of the skin of the trunk should compare favorably with that of the fovea. We have determined the electrical-stimulus parameters for painless stimulation of the sensation of mechanical vibration with small electrodes in a closely spaced matrix.
Conditional Monitoring using Reliable Reactive Routing Enhancement in IWSN

The use of reactive routing protocol in an efficient manner to safeguard the routing in Industrial Wireless Networks (IWSNs) can provide reliable and very efficient communication even in the fading channels. The channel fading is considered to be one of the most challenging factor in routing process. The use of Reliable Reactive Routing Enhancement (R3E) in condition monitoring can increase the link dynamics which is playing a vital role in IWSNs enhancing the existing reactive routing protocol. The robust guide path helps in cooperative forwarding in the route discovery phase of the reactive routing method. Here the guide path follows greedy method to find the destination nodes and also to utilize the location information. Thus the packet delivery ratio and energy efficiency is improved in a considerable amount.
Combining per-pixel and object-based classifications for mapping land cover over large areas

A plethora of national and regional applications need land-cover information covering large areas. Manual classification based on visual interpretation and digital per-pixel classification are the two most commonly applied methods for land-cover mapping over large areas using remote-sensing images, but both present several drawbacks. This paper tests a method with moderate spatial resolution images for deriving a product with a predefined minimum mapping unit (MMU) unconstrained by spatial resolution. The approach consists of a traditional supervised per-pixel classification followed by a post-classification processing that includes image segmentation and semantic map generalization. The approach was tested with AWiFS data collected over a region in Portugal to map 15 land-cover classes with 10 ha MMU. The map presents a thematic accuracy of 72.6 ± 3.7% at the 95% confidence level, which is approximately 10% higher than the per-pixel classification accuracy. The results show that segmentation of moderate-spatial resolution images and semantic map generalization can be used in an operational context to automatically produce land-cover maps with a predefined MMU over large areas.
One-Shot-Learning Gesture Recognition Using Motion History Based Gesture Silhouettes

A novel approach for gesture recognition based on motion history images is proposed in this paper for one- shot learning gesture recognition task. The challenge here is to perform satisfactory recognition operations with only one training example of each action, while no prior knowledge about actions, foreground/background segmentation, or any motion estimation and tracking are available. In the proposed scheme motion history imaging technique is applied to track the motion flow in consecutive frames. The information of motion flow is later utilized to calculate the percent change of motion flow for an action in different spatial regions of the frame. The space-time descriptor computed this way from the query video is a measure of the likeness of a gesture in a lexicon. Finally, gesture classification is performed based on correlation based and Euclidean distance based classifiers and the results are compared. Through extensive experimentations on a much diversified dataset the effectiveness of employing the proposed scheme is established.
Analysis of planar microwave circuits with lumped‐elements by CN‐FDTD

A three‐dimensional implementation of the lumped‐element by Crank‐Nicolson finite‐difference time‐domain (CN‐FDTD) algorithm has been presented in this article. Several examples of planar microwave circuits with lumped resistor, capacitor, and/or inductor are simulated and compared with traditional finite‐difference time‐domain method and measurements. The accuracy of CN‐FDTD implementation for lumped elements in this article has been verified. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 51: 113–116, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.23969
Research on Testability Analysis Methods of Complex Embedded Software

Embedded software gradually tends to be more integrated, modular and complex. The architecture of integrated avionics system software is the typical example. Method for measurement testability of traditional testability analysis model DRR (Domain Range Ratio), due to its reliance on internal information, it is difficult to measure testability for complex embedded software such as IMA. So this article on the basis of the DRR model, it is proposed a model that described internal information of embedded software complex in development phase, Base-Line-Flow Graph, at the same time, we can measure testability index of software through this model. An example of IMA task proved that this method is effective and feasible.
Real-time face tracking and recognition for video conferencing

This paper describes a system of vision in real time, allowing to detect automatically the faces presence, to localize and to follow them in video sequences. We verify also the faces identities. These processes are based by combining technique of image processing and methods of neural networks. The tracking is realized with a strategy of prediction-verification using the dynamic information of the detection. The system has been evaluated quantitatively on 8 video sequences. The robustness of the method has been tested on various lightings images. We present also the analysis of complexity of this algorithm in order to realize an implementation in real time on a FPGA based architecture.
Energy efficient routing for transferring data sets across networks

: This letter proposes a routing scheme to send a data set in units of bits rather than bits/s by considering the predeﬁned transfer time, the period within which the data set should be transferred from the source node to the destination node, to minimize the energy consumed. The energy consumption is minimized with an optimal transfer time. The results show that routing at the optimal transfer time is, for the data set being sent, able to reduce energy consumption at least 7.7% for the networks examined.
Dynamic control gain and tactile feedback in the capture of cursor movements

Recent research at IPO involving a trackball with force feedback has demonstrated that tactile feedback can enhance the acquisition of targets in graphical user interfaces in terms of movement times and errors. The present study seeks to explore the degree to which being able to feel a target in contrast with changes in the display/control gain, over the target, influences movement performance. Tactile feedback over a target is felt as a pulling force towards the centre of a target, with counterforces applied when moving out of the centre. Changes in the target gain can create a cursor-catching effect by requiring more movement of the control device to enter than to leave the centre of the target. Results of an experiment indicated that target acquisition performance was generally higher in the tactile feedback condition, followed by target gain feedback, in comparison with no-target gain feedback. User interface design issues are discussed in respect to gain and tactile feedback.
A CAD framework for simulation and optimization of high-speed VLSI interconnections

A CAD framework addressing three specific aspects of the high-speed interconnect problem, namely, simulation, sensitivity analysis, and performance optimization, is described. Distributed interconnect models represented by uniform or nonuniform lossy coupled transmission lines are supported. The CAD framework incorporates parallel processing capabilities. It also provides a design environment for integrating accurate simulations or waveform estimation, sensitivity analysis, design specifications, and numerical optimization. Approaches enhancing the accuracy and ensuring the stability of moment-matching techniques used in the asymptotic waveform evaluation (AWE) are introduced. Also described are a parallel implementation of numerical inversion of the Laplace transform (NILT) and parallel interconnect optimization, resulting in substantial CPU speedup over existing NILT simulation and optimization. >
A comparative evaluation of spatial scalability techniques in the compressed domain

A comparative performance evaluation of DCT domain techniques for spatial scalability is presented. In contrast to the traditional spatial domain techniques, the DCT domain techniques remove the unnecessary decompression and recompression procedures, and thus have the advantages of reduced computational complexity and storage requirements. The relative performance is compared in terms of computational complexity and image quality.
Effect of parameterization and joint layer control for video streaming over wireless network

The effect of parameterization combined with joint layer control for video streaming over wireless IEEE 802.11 network is presented in this paper. We describe an architecture that provides the cross-layer optimization and prioritization of the video streaming. The proposed approach allows us to assign various parameter sets to each priority class independently. We examine the performance of the FEC mechanism available at the application layer for the efficient and robust transmission of MPEG-coded video over IEEE 802.11a WLANs. Besides, we develop a joint-layer control policy to reduce bandwidth consumption and maximize the received video quality by investigating and dynamically selecting the optimal combination of application-layer FEC, interleaving depth, UDP packet size and MAC retransmission rate. The performance of the proposed concept will be shown by carrying out experiments in real wireless networks. The results demonstrate that even a small number of parameters utilized in the optimization process have a significant influence on the received video quality and resources consumption.
A VLSI implementation method of a compressor for audio systems

In this paper, we present a VLSI implementation method on a dynamic range controller, audio level compressor, which is used to make sound effects as an important functional part in a digital audio system on a chip. To implement the gain calculation in a digital dynamic range controller, a power calculation with fractional numbers is required and it is difficult to be performed directly in a digital audio system. We introduce a polynomial expression to approximate the power operation, then the gain calculation is easily performed with a number of additions, multiplications and a division. Based on the gain calculation method of the gain, an efficient VLSI architecture with some arithmetic circuits is proposed. We designed the circuit of a 16-bit audio level compressor by using a hardware description language, VHDL. As a result of the compact circuit design, the 16-bit compressor has only 5,688 gates by 1 μm CMOS gate array technology. The design and simulation results show that the presented audio level compressor has high performance and can be integrated into an audio system on a chip for practical use.
Wireless pointing device using capacitive coupling

The increasing demand and use of computers prompted extensive studies on implementing low cost and reliable pointing devices. The use of capacitive coupling technology allows wireless pointing devices to be reliable and do not require any battery. The proposed pointing device uses capacitive coupling technology to detect both the x and y position of the mouse/digitizer and also if any of the buttons were pressed. Detail analysis of the capacitive coupling signals and its performance in both the time and frequency domains were discussed. The proposed pointing device was built and implemented. The experimental results showed potential for commercialization of the wireless pointing device and its robustness.
Knowledge acquisition for expert systems: a practical handbook

Building an expert system involves eliciting, analyzing, and interpreting the knowledge that a human expert uses when solving problems. Expe rience has shown that this process of "knowledge acquisition" is both difficult and time consuming and is often a major bottleneck in the production of expert systems. Unfortunately, an adequate theoretical basis for knowledge acquisition has not yet been established. This re quires a classification of knowledge domains and problem-solving tasks and an improved understanding of the relationship between knowledge structures in human and machine. In the meantime, expert system builders need access to information about the techniques currently being employed and their effectiveness in different applications. The aim of this book, therefore, is to draw on the experience of AI scientists, cognitive psychologists, and knowledge engineers in discussing particular acquisition techniques and providing practical advice on their application. Each chapter provides a detailed description of a particular technique or methodology applied within a selected task domain. The relative strengths and weaknesses of the tech nique are summarized at the end of each chapter with some suggested guidelines for its use. We hope that this book will not only serve as a practical handbook for expert system builders, but also be of interest to AI and cognitive scientists who are seeking to develop a theory of knowledge acquisition for expert systems. "
Advances in Dendrogram Seriation for Application to Visualization

Visualizations of statistical data benefit from systematic ordering of data objects to highlight features and structure. This article concerns ordering via dendrogram seriation based on hierarchical clustering of data objects. It describes DendSer, a general-purpose dendrogram seriation algorithm which when coupled with various seriation cost functions is easily adapted to different visualization settings. Comparisons are made with other dendrogram seriation algorithms and applications are presented. Supplementary materials for this article are available online.
Design of two-stage cascade FIR digital filters with coefficients of limited word-length

It is shown that the two-stage cascade construction is very effective in the realization of a digital filter with a sufficiently large attenuation in the stop-band. A design method for the two-stage cascade FIR filter with limited word-length is described. Compared with the direct construction, the word-length of the filter coefficient in the two-stage cascade FIR filter is reduced to less than 60 percent. In general, compared with the direct construction, the word-length of the filter coefficient is reduced in the cascade construction, while the order is increased. However, in the proposed method, the order of the two-stage cascade construction need not be very large, compared with the case of direct construction, being 1.5 times in the worst case. By imposing less strict limitation on the word-length of the filter coefficient, the order of the two-stage cascade construction FIR filter never exceeds 4/3 times that of the direct-type FIR filter. In the realization of a linear-phase, two-stage cascade FIR filter, lower-order minimum- and maximum-phase filters than the linear-phase filter can be applied as subfilters. This is effective in further reducing the order of the two-stage cascade FIR filter, thereby reducing the order to 0.8 to 0.9 times the case of the construction based on the linear-phase subfilter.
Asynchronous logic in bit-serial arithmetic

This article is an asynchronous approach to bit-serial processing. A new asynchronous cell (DCVSL like) was designed containing simplified "complete" signal generation as part of a dynamic handshake circuitry. The problem of data feedback has been addressed and its solution in a modified handshake protocol and local memory inclusion is given. Basic arithmetic components are demonstrated and a larger system is used as an example of this new cost effective technique.
The Purpose of Mathematical Programming is Insight, Not Numbers

The ostensible purpose of a mathematical programming model is to optimize a stipulated objective function subject to stipulated constraints. But its true purpose, at least in strategic applications as every experienced practitioner should know, is to help develop insights into system behavior which in turn can be used to guide the development of effective plans and decisions. Such insights are seldom evident from the output of an optimization run. One must know not only what the optimal solution is for a given set of input data, but also why. The desired insights usually have more to do with the “why” than the “what. ” This paper advocates the use of highly simplified analytic models to help explain the “whys” behind the solutions of conventional mathematical programming models. A methodological approach is described which permits the development of richer insights than would otherwise be possible. This approach is illustrated with reference to a facility location study carried out recently for a consumer products manufacturer.
Mobile Network Adaptation in the Ubidata Mobile File System

Abstract An important characteristic of mobile networks is the large variations of available bandwidth. Network conditions can vary from strong to weak to total disconnection. These variations may be masked from the users by a common technique called “data hoarding”. Limited mobile network bandwidth is an expensive resource today and in the foreseeable future. Efficiently utilizing scarce mobile bandwidth is a challenge for managing data in the mobile environment. In this paper, we introduced the network adaptation approaches used in the UbiData mobile file system. UbiData mobile file system is designed to automatically select a mobile user's active data set and automatically migrate that data when the user switches from device to device. Automation of data management, including data set selection, data replication, network adaptation, and data reintegration, is a goal in our system to tackle the problems incurred from data unavailability in weak and disconnection modes. We discuss the adaptation techniques in our UbiData system and present enhancements. To further reduce the network bandwidth requirement, two major approaches are introduced in our system. First, the communication requests are shortly delayed and optimized. Secondly, we employ content aware/transparent adaptation to reduce possible data transmission within acceptable weak connection bandwidth. The mobile network adaptation techniques can significantly reduce the potential communications between the mobile devices and the fixed host.
Motion estimation in video coding

Summary form only given. Motion estimation (ME) is one of the most computational intensive operations in video compression. It can easily account for over 80% of the computation in an MPEG-2 video encoder. Most ME algorithms can be formulated as an optimization problem and the challenge is to avoid being trapped at local minima without the expense of a full search in the optimization space. In this talk, we provide a comprehensive survey of existing ME algorithms in the literature, and present two new algorithms that we have developed. The first algorithm, the 'edge-pattern search' (EPS) algorithm makes use of the visual patterns information in the video signal to provide clues for motion vector search. The second algorithm, the 'adaptive search centre' (ASC) algorithm exploits the inter/intra frame information and a non-uniform distribution of the search points to guide the search process. Both algorithms give accurate ME similar to full search with a computational complexity similar to other less adequate fast algorithms like the three step search.