Real Time Application

This paper presents a watermarking technique with fast encryption and compression. Recently a number of algorithms exist for watermarking and encryption. Their drawbacks are size, security and time for execution. Compression is necessary to maintain size small where bandwidth and storage capacity is limited. A loss-less compression technique is used to compress speech signal. Due to compression, vacant places are created. These vacant places are used for watermark. In the proposed encryption technique size of encrypted data is increased by only 12.5%. Execution of encryption is faster than present unbreakable algorithms. The proposed encryption is also highly secured and can be used for real-time application and saving signal. Watermark will exist even after signal cropping.

We have observed the failure of RSVP to be widely accepted as the solution to resource reservation in the Internet. Because we are convinced of the need for resource reservation, in at least parts of the Internet, to support multimedia communications, we have set about trying to improve RSVP. By careful study of the protocol, we have identified areas for improvement, and propose REDO RSVP, a reduced overhead version that includes a fast establishment mechanism (FEM). In this paper we describe the rationale for REDO RSVP and present an analysis of its features and operations.

This paper presents an LMI-based method for the design and tuning of robust H 2 output feedback controllers, illustrated with two case studies. The conservatism of design is considerably reduced by a proposed scaling procedure, referred to as K-S iteration. The method is applied to the ACC benchmark problem and shown to outperform previously published solutions. The choice of tuning parameters and tuning strategies are discussed in detail. Real-time experiments on an experimental version of the benchmark problem demonstrate the practicality of the proposed approach.

This paper presents an LMI-based method for the design and tuning of robust H 2 output feedback controllers, illustrated with two case studies. The conservatism of design is considerably reduced by a proposed scaling procedure, referred to as K-S iteration. The method is applied to the ACC benchmark problem and shown to outperform previously published solutions. The choice of tuning parameters and tuning strategies are discussed in detail. Real-time experiments on an experimental version of the benchmark problem demonstrate the practicality of the proposed approach.

Collision detection is an important problem in many kinds of applications. This work presents an efficient approach for exact collision detection between complex, deformable models. The approach consists of a method for fast extraction of semantics from transformation matrices which places models in a scene, together with a general strategy for fast intersection tests. Non-uniform scaling is also supported efficiently. Our experiments demonstrate that our strategies are well suitable for real-time applications.

Biometric recognition has emerged as a highly dependable method for securely verifying an individual's identity by utilizing distinct physical and behavioral characteristics such as fingerprints, facial structure, ocular patterns, vocal attributes, and gait. This approach contrasts with traditional identity verification methods like passwords or tokens, which are susceptible to being forgotten or compromised. Biometric systems offer enhanced security, greater user convenience, and assist in preventing the use of fraudulent identities. This paper provides an in-depth examination of biometric recognition systems, emphasizing the prevalent types employed, the methodologies they utilize, and the recent advancements achieved through machine learning and deep learning. The study delineates the primary stages involved in a biometric authentication system, including data collection, feature extraction, comparison with stored data, and the final decision-making process. It also discusses how sophisticated algorithms such as Convolutional Neural Networks (CNNs) and hybrid deep learning models contribute to enhancing the accuracy and robustness of these systems, even under varying conditions. Nevertheless, despite significant advancements, biometric systems continue to face challenges, including safeguarding personal data, thwarting counterfeit inputs, addressing sensor inaccuracies, managing intra-group variations, and accommodating large user populations. Additionally, the paper addresses emerging security threats, such as attacks that attempt to deceive the system with fabricated data or deepfake videos, which pose risks to the integrity of biometric authentication. To mitigate these challenges, researchers are exploring the integration of multiple biometric modalities, methods for verifying an individual's vitality, and improved strategies for securing stored biometric information. In conclusion, biometric recognition serves as a robust foundation for secure identity verification; however, further research is essential to address existing challenges and enhance the privacy, reliability, and security of these systems. Future endeavors are expected to concentrate on the amalgamation of various biometric techniques, the application of more straightforward deep learning models, and the development of systems that ensure privacy while remaining practical in real-world applications.

Information technology has revolutionized the field of communication in the digital age. However, these advancements have also raised significant security concerns. Protecting classified information is critical, and steganography is widely used to ensure confidentiality by embedding secret messages into media files in a way that makes them nearly undetectable. Among the various steganographic techniques, the Least Significant Bit (LSB) method is a commonly used approach. However, determining the optimal color space that balances image quality and data hiding capacity remains an active area of research. This study aims to bridge this gap by proposing a generalized evaluation framework that systematically analyzes ten color spaces RGB, HSV, HSI, YUV, YIQ, YCbCr, XYZ, LAB, LMS, and xyY using the LSB method. The framework involves applying LSB embedding across all color spaces, evaluating security using eight standard metrics (MSE, PSNR, SSIM, NAE, NCC, AD, MD, SC). The study further presented a normalized performance score for each space. Experimental results showed that YCbCr consistently outperforms others, achieving highest generalized score ranging between 0.875 and 0.890 for different testing images. The proposed framework provided attractive reproducible and scalable foundation for color space analysis within image steganography.

We propose a practical approach to provide QoS over the existing best-effort Commercial On The Shelf (COTS) IEEE802.11 WLANs using Layer 3 Admission Control and Adaptive Scheduling (L3-ACAS) scheme. This approach enables operators with existing large-scale WLAN deployments to offer QoS control over their networks with minimal disruption, capital expenditure (CAPEX) or infrastructure upgrade. Extensive simulation studies show that with this scheme, the total goodput, flows throughput ratio, packets delay and jitter of the real-time applications such as VoIP and real-time video can be improved significantly. We have also successfully implemented a testbed to evaluate our architecture using the existing COTS hardware and the open source Linux components.

This work presents a methodology to analyze transient stability (first oscillation) of electric energy systems, using a neural network based on ART architecture (adaptive resonance theory), named fuzzy ART-ARTMAP neural network for real time applications. The security margin is used as a stability analysis criterion, considering three-phase short circuit faults with a transmission line outage. The neural network operation consists of two fundamental phases: the training and the analysis. The training phase needs a great quantity of processing for the realization, while the analysis phase is effectuated almost without computation effort. This is, therefore the principal purpose to use neural networks for solving complex problems that need fast solutions, as the applications in real time. The ART neural networks have as primordial characteristics the plasticity and the stability, which are essential qualities to the training execution and to an efficient analysis. The fuzzy ART-ARTMAP neural network is proposed seeking a superior performance, in terms of precision and speed, when compared to conventional ARTMAP, and much more when compared to the neural networks that use the training by backpropagation algorithm, which is a benchmark in neural network area.

The technique of electrospinning was employed to fabricate uniform one-dimensional inorganic-organic composite nanofibers at room temperature from a solution containing equal volumes of aluminum 2, 4-pentanedionate in acetone and polyvinylpyrrolidone in ethanol. Upon firing and sintering under carefully pre-selected time-temperature profiles (heating rate, temperature and soak time), high-purity and crystalline alumina nanofibers retaining the original morphological features present in the as-spun composite (cermer) fibers were obtained. Tools such as laser Raman spectroscopy, scanning and transmission electron microscopy together with energy dispersive spectroscopy and selected area electron diffraction were employed to follow the systematic evolution of the ceramic phase and its morphological features in the as-spun and the fired fibers. X-ray diffraction was used to identify the crystalline fate of the final product.

Embedded real-time applications are often built from scratch on a trial-and-error basis, which leads to sub-optimal designs with latent errors that are not detectable in early stages of use or deployment and often incurs prolonged time-to-market. A new application framework called Verifiable Embedded Real-Time Application Framework (VERTAF) is proposed for embedded real-time application development, with the aim of reducing design errors and increasing design productivity. VERTAF is an integration of three technologies, namely object-oriented technology, software component technology, and formal verification technology. VERTAF consists of five software components: Implanter, Modeler, Scheduler, Verifier, and Generator. Experiences of using VERTAF show a significant increase in design productivity through design reuse, and a significant decrease in design time and effort through design verification. An example shows a relatively low design effort on the part of the designer using VERTAF.

In this work, we present our experiences in designing an object-oriented application framework for real-time systems, called SESAG. A components-patterns view is provided so that application developers may easily use the framework to design his/her applications. SESAG consists of five components: Specifier, Extractor, Scheduler, Allocator, and Generator. Within SESAG, several design patterns have been proposed for real-time systems. Experiences of using SESAG show a significant increase in design productivity through design reuse, and a decrease in design time and effort.

The most challenging problem in target detection and classi£cation is the extraction of a robust feature vector which can effectively represent a speci£c type of target. The use of the seismic signals in unattended ground sensor systems brings new challenges to the problem because of the complexity of the seismic waves and their highly dependency on the underlying geology. This paper proposes a new feature extraction algorithm -spectral statistics and wavelet coef£cients characterization (SSWCC). SSWCC extracts a feature vector from both the frequency and the time-frequency domain analysis of the seismic signals, including the spectrum, the power spectral density (PSD) and the wavelet coef£cients. The SSWCC algorithm is designed for real-time applications, and has shown its robustness and effectiveness through a series of experiments. Extensive performance evaluation is conducted to derive the optimal con£guration of the different parameters. The overall classi£cation accuracy can reach as high as 90%.

As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the proliferation of computational power, the detailed nature of these applications causes new problems for the system resource allocation mechanisms. First, these applications are designed to meet their deadlines as long as nearly all the system's resources are available to them; once the system approaches saturation, the collective applications will fail to meet their deadlines. To aggravate the situation, conventional best effort managers will allocate resources to the competing applications based on a static form of equitability rather than addressing the dynamic relative benefit provided by each application. Second, the applications differ from conventional real-time applications: though members of this new class of desktop applications are sensitive to deadlines, their constraints are non-critical. They are also typically designed to use the full spectrum of functions provided by a general purpose system call interface rather than the more limited interface of a real-time OS. This paper describes a flexible soft real-time system design that addresses these two problems. The CPU scheduling strategy accommodates the community of applications by taking application benefit into account during times of heavy load. Applications are written to use the full interface of a general purpose system call interface, yet the system is able to schedule them according to their deadlines and resource reservation and availability. This paper describes the theoretical foundation of the approach, additional application responsibilities, the design of a middleware system to implement the approach, and then it presents an extensive set of experimental studies that demonstrate the behavior of the approach. The Dynamic QoS Manager middleware (implemented on top of two different versions of Unix), is shown to be highly effective system for supporting contemporary soft real-time desktop applications.

As computing capabilities of embedded devices increase, services such as Internet and multimedia are comportably supported by such devices. Users may demand for migrating services from one machine to another that can provide better capabilities and convenience in terms of battery stock and input/output (I/O) method. However, I/O devices capabilities between embedded mobile devices and user interaction behavior are particulary different. So, heterogenous I/O capabilities and functions may make migration of computing states between embedded devices virtually impossible. To guarantee seamless I/O state migration between embedded mobile devices, we propose interface virtualization and capability adaptation. In this paper, we describe a system architecture based on Xen virtualization as well as design principles and performance.

This paper compares and evaluates the suitability of realtime operating systems, VxWorks and LynxOS, and generalpurpose operating systems with real-time extensions, Windows NT, Solaris, and Linux, for real-time ORB middleware. While holding the hardware and ORB constant, we vary these operating systems and measure platform-specific variations in context switching overhead and priority inversions. Our findings illustrate that general-purpose operating systems like Windows NT, Solaris, and Linux are not yet suited to meet the demands of applications with stringent QoS requirements. Although Linux provides good raw performance, its high jitter makes it unsuitable for real-time applications. Both LynxOS and VxWorks do enable predictable and efficient ORB performance, however, thereby making them suitable as OS platforms for real-time CORBA applications. In general, our results underscore the need for a measure-driven methodology to pinpoint sources of overhead and priority inversion in real-time ORB endsystems.

Session Initiation Protocol (SIP) was standardized for real-time applications and extended to support terminal mobility by Internet Expert Task Force (IETF). However, SIP terminal mobility suffers from the considerable handoff latency which is unsuitable for the real-time communications. In this paper, we propose Predictive Address Reservation with SIP (PAR-SIP) which decreases handoff delay by proactively processing the address allocation and session update using link layer information of wireless networks.

An algorithm is presented, that provides a fast and robust reconstruction of neutrino induced upward-going muons and a discrimination of these events from downward-going atmospheric muon background in data collected by the ANTARES neutrino telescope. The algorithm consists of a hit merging and hit selection procedure followed by fitting steps for a track hypothesis and a point-like light source. It is particularly well-suited for real time applications such as online monitoring and fast triggering of optical follow-up observations for multi-messenger studies. The performance of the algorithm is evaluated with Monte Carlo simulations and various distributions are compared with that obtained in ANTARES data.

Floorplanning is a a pivotal phase in Very Large-Scale Integration (VLSI) design that significantly impacts performance, cost, manufacturability, and power efficiency. Traditional optimization methods such as Simulated Annealing, Genetic Algorithms, and analytical approaches perform adequately but face scalability challenges in largescale designs with millions of netlists. This work proposes an end-to-end Reinforcement Learning (RL)-based floorplanning framework tailored for large VLSI architectures. The problem is formulated as a Markov Decision Process (MDP), where an RL agent sequentially places macros and standard cells to jointly optimize area utilization and wirelength under design constraints. A deep neural network encodes placement states and learns an optimal policy through reward functions balancing area efficiency and interconnection minimization. Experimental results on benchmark circuits show up to 18% area reduction and 24% wirelength improvement compared to heuristic baselines.

Floorplanning is a a pivotal phase in Very Large-Scale Integration (VLSI) design that significantly impacts performance, cost, manufacturability, and power efficiency. Traditional optimization methods such as Simulated Annealing, Genetic Algorithms, and analytical approaches perform adequately but face scalability challenges in large-scale designs with millions of netlists.
This work proposes an end-to-end Reinforcement Learning (RL)-based floorplanning framework tailored for large VLSI architectures. The problem is formulated as a Markov Decision Process (MDP), where an RL agent sequentially places macros and standard cells to jointly optimize area utilization and wirelength under design constraints.
A deep neural network encodes placement states and learns an optimal policy through reward functions balancing area efficiency and interconnection minimization. Experimental results on benchmark circuits show up to 18% area reduction and 24% wirelength improvement compared to heuristic baselines.
The proposed approach demonstrates the potential of learning-based optimization for physical design, enabling scalable and adaptive solutions within modern Electronic Design Automation (EDA) workflows.

Loeking is eonsidered as a means to aehieve serializable sehedules of eoneurrent transactions. Transactions are assumed to be predeclared such that a pre-analysis for loeking beeomes feasible to inerease eoneurreney. A eondition for safety is introdueed whieh, based on a pre-analysis, allows the design of policies strictly dominating known polieies such as 2-phase loeking. The statie ease, in whieh the eomplete set of transactions is known in advanee, and the online case, in which a transaction is known when it is started, are eonsidered. It is shown that a poliey striet1y dominating 2-phase locking and some other interesting pre-analysis polieies ean also be applied in an online environment. t This papercontains results already presented at the International Conference on Mathematical Fundamentals of DataBase Systems, Visegrad 1989 [9], and, in a revised form, results already presented at the International Conference on Database Theory, Rome 1986 [7]. * The work of this author was ...

Volcanic eruptions represent excellent calibration sources for the IMS infrasound network. The location is precisely known, and the energy released during explosive eruptions may be large enough to generate infrasound waves propagated thousands of kilometers. The purpose of this study is to analyze the network capacity of infrasound from Plostina (Romania) to detect volcanic eruptions. The description of the Plostina network and signal processing procedures are discussed in Section 2, data and methods. The results and discussion of this study are presented in Section 3 and the conclusions at the end.

We present a simple non linear controller based on Lyapunov analysis for a Planar Vertical Take Off and Landing aircraft (PVTOL). It is proved that the proposed control scheme is globally asymptotically stable. The controller performance is shown in a real-time application.

We present a discrete-time prediction-based state-feedback controller. It is shown that this controller stabilizes possibly unstable continuous-time delay systems. The stability is shown to be robust with respect to uncertainties in the knowledge on the plant parameters, the system delay and the sampling period. The proposed prediction-based controller has been tested in a real-time application to control the yaw angular displacement of a 4-rotor mini-helicopter.

The addition to the WiMAX standard through 802.16e has made the standard more flexible and a potential choice as a wireless broadband technology. To support mobility in any wireless scheme, the application of an efficient handover control scheme is crucial. Any inefficiency experienced during data transmission in hard handover in mobile network could cause handover delays with potential connection drops. In order to solve the problem of handover delay, various types of handover scheme have been adopted. This paper proposes the combining of the Relative Signal Strength with Threshold and Hysteresis and Distance (RSTH-D) to initiate handover. Distance is considered as a criterion to initiate fast handover. This scheme seeks to reduce handover delay, which contributes to effective radio resource management. It is shown through the simulation results obtained that the proposed scheme has significant potential performance benefits compared to standard handover schemes.

The support of fast and seamless inter-subnet handovers is critical for throughput-sensitive and delay-intolerant applications such as real-time multimedia services in IP wireless networks. Current mobility management schemes based on Mobile IPv6 (MIPv6) fall short in that respect, especially for high mobility environments such as vehicular scenarios. This has led to the standardisation of Fast handovers for Mobile IPv6 (FMIPv6) by the IETF in order to address such challenges. Nonetheless, FMIPv6 has inherited most of its predecessors drawbacks such as severe packet loss, reduced data throughput and prolonged end-to-end packet delays during inter-subnet handovers. In this paper, we propose an Enhanced FMIPv6 (e-FMIPv6) scheme meant to support throughputsensitive and delay-intolerant applications during inter-subnet handovers. Performance evaluations show that the e-FMIPv6 scheme out-performs the standard FMIPv6 protocol.

Apple browning is an undesirable biochemical change that decreases the value of apple produces on the food market. The colour of apples starts changing immediately after being cut, the speed of colour-change depending on apple-variety and environment: sweeter apples become brown quicker, warmer environment favorizes the browning speed. Monitoring apple browning is part of food quality control and part of studying ways to decrease the browning speed by using different types of inhibitors (anti-browning agents). The monitoring is usually done with colorimetric devices such as spectrophotometers and colorimeters. We propose an alternative way of monitoring colour changes during the browning process for optimizing inhibitor mixtures for fresh-cut green apples, using the Trichromatic Colour Analyser (TCA) system, which turns scanner into colorimeter. TCA has been initially created for the complete study of the traditional Thai colours and subsequently developed for other tasks, one of th...

The QoS provided by today's best effort Internet is not good enough for real-time premium traffic. It is believed that the QoS guarantees of the Internet could be better provided by connection-oriented networks. IP/MPLS is one such technology and these connection-oriented networks are inherently more vulnerable to network failures. Network failures can broadly be classified into two types, ie., link/path and degraded failures. Degraded failures that account for about 50% of total failures are detected by control-plane timers. The control plane and the data plane of IP/MPLS networks are logically separated and therefore a failure in the control plane should not immediately terminate communications on the data plane. The Virtual Path Hopping (VPH) concept proposed in this study distinguishes these degraded failures from link/path failures and avoids the terminations of data communications on the data plane that are due to these degraded failures. It changes the traffic carrying a degraded VP to a new VP in a predetermined VP-pool before the control-plane timer expires due to degraded failure. This paper discusses the concept of VPH and its numerous advantages such as load balancing, traffic distribution, and the ability to support dual-failure situations. Computer simulations were conducted and the results are presented to support the concept of VPH.

Quality of Service issues of IP networks are mostly related to guaranteeing bandwidth for flows. However, many interactive real-time applications also require this bandwidth in an uninterrupted fashion. This paper describes how multi-path routing and local failure reaction can be employed to provide uninterrupted QoS to applications. We show how multi-path route sets can be found in reasonably meshed networks and how multi-path routing can be used to save on the spare capacity required in case of link failures.

This paper describes research into signal transformation operators allowing to modify the vibrato extent in recorded sound signals. A number of operators are proposed that deal with the problem taking into account different levels of complexity. The experimental validation shows that the operators are effective in removing existing vibrato in real world recordings at least for the idealized case of long notes and with properly segmented vibrato sections. It shows as well that for instruments with significant noise level (flute) independent treatment of noise and harmonic signal components is required. * Now with Audionamix, Paris 1 This side by side presentation of expressive speech and music synthesis does not intend to imply that expressive effects will be generated by means of similar means for these two signal classes.

This paper addresses the task of sound-source localization from time delay estimates using arbitrarily shaped non-coplanar microphone arrays. We fully exploit the direct path propagation model and our contribution is threefold: we provide a necessary and sufficient condition for a set of time delays to correspond to a sound source position, a proof of the uniqueness of this position, and a localization mapping to retrieve it. The time delay estimation task is casted into a non-linear multivariate optimization problem constrained by necessary and sufficient conditions on time delays. Two global optimization techniques to estimate time delays and localize the sound source are investigated. We report an extensive set of experiments and comparisons with state-of-the-art methods on simulated and real data in the presence of noise and reverberations.

Performance of network coding protocols have been largely evaluated using metrics such as packet delivery ratio and routing load, which can only determined how effective a protocol is. We describe the process of routing information in wireless network based on network coding and evaluate the efficiency of throughput benefits that network coding offers. This is archived with a specialized method known as data envelopment analysis (DEA). As a result, efficiency of COPE performance is compared with the traditional IEEE802.11. In additional, decision making unit called DMUs of protocols are determined. This could assist network designer to better plan for optimum benefits. Simulation results show that for all network scenarios examined, COPE protocol performs better than IEEE802.11 in terms of network effectiveness but its performance in terms of network efficiency depends on both inputs and outputs values.

Recent trends show that there are swift developments and fast convergence of wireless and mobile communication networks with internet services to provide the quality of ubiquitous access to network users. Most of the wireless networks and mobile cellular networks are moving to be all IP based. These networks are connected through the private IP core networks using the TCP/IP protocol or through the Internet. As such, there is room to improve the mobility support through the Internet and support ubiquitous network access by providing seamless handover. This is especially true with the invention of portable mobile and laptop devices that can be connected almost everywhere at any time. However, the recent explosion on the usage of mobile and laptop devices has also generated several issues in terms of performance and quality of service. Nowadays, mobile users demand high quality performance, best quality of services and seamless connections that support real-time application such as audio and video streaming. The goal of this paper is to study the impact and evaluate the mobility management protocols under micro mobility domain on link layer and network layer handover performance. Therefore, this paper proposes an integration solution of network-based mobility management framework, based on Proxy Mobile IPv6, to alleviate handover latency, packet loss and increase throughput and the performance of video transmission when mobile host moves to new network during handover on high speed mobility. Simulations are conducted to analyze the relationship between the network performances with the moving speed of mobile host over mobility protocols. Based on simulation results, we presented and analyzed the results of mobility protocols under intra-domain traffics in micro mobility domain.

The phenomenal growth of Internet technology as well as the convergence in network communication technologies has improved the overall quality of ubiquitous communication significantly. In recent years, Network-based Localized Mobility Management (NETLMM) working group has proposed a protocol namely Proxy Mobile IPv6 (PMIPv6), which is actively receiving standardization by the Internet Engineering Task Force (IETF). PMIPv6 is an effective mobility management protocol for next generation wireless networks that has salient features and is expected to expedite the real deployment of IP mobility management. Even though PMIPv6 offers many advantages, it still suffers from handover latency. In order to reduce the handover latency, we propose a seamless handover integrated solution. The purpose of this paper is to simulate, analyze and evaluate the performance of video Transmission over PMIPv6 in a Micro mobility domain on link-layer and network layer. Through simulations, we analyzed the video transmission quality for our proposed protocol as compared to PMIPv6.

The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD), which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time) and the power consumption optimization. The scheduler was embedded into a system on chip (SoC) developed to support the wireless body area network-a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices.

Real-time applications of Discrete Wavelet Transform (DWT) like video and audio compression necessitate fast computation of DWT. Full-custom VLSI devices have been used for fast though expensive implementations of DWT. Field-Programmable Gate Array (FPGA) architectures offer economical but area-constrained implementation of DWT. The present paper proposes an efficient FPGA architecture for DWT as well as inverse DWT (IDWT). Use of distributed arithmetic allows us to do without area-consuming multipliers in the present realization. The proposed architecture is modular and allows extension to any precision without much effect on the clock frequency. Simulation results have established that the proposed fast implementation scheme can produce high-quality reconstructed signals.

With the widespread use of videos in many fields of our lives, it becomes very important to develop new techniques for video denoising. Spatial video denoising using wavelet transform has been the focus of the current research, as it requires less computation and more suitable for real-time applications. Two specific techniques for spatial video denoising using wavelet transform are considered in this work: 2D Discrete Wavelet Transform (2D DWT) and 2D Dual Tree Complex Wavelet Transform (2D DTCWT). We performed an analytical analysis to investigate the performance of each of these techniques. From this analysis, we found out that each of these techniques has its advantages and disadvantages. The first technique gives less quality at high levels of noise but consumes less time, whereas the second gives high quality video while consuming a large amount of time. In this work, we introduce an intelligent denoising system that makes a tradeoff between the quality of the denoised video a...

Artists historically have had problems texturing terrain. Hiding texture seams and repetitive patterns is a difficult problem most games suffer from. This shader shows how to programmatically interpolate between two textures based on their normal. The interpolation provides varying combinations of base textures when rendered as a combination of two textures. In the example below, a brown rocky texture is biased towards polygons that are generally facing towards the sky. A strange blue texture is given to anything that is on an incline. For hills that are in between, a blended combination of the two textures is used.

The paper presents the DSPIN micro-network, that is an evolution of the SPIN architecture. DSPIN is a scalable packet switching micro-network dedicated to GALS (Globally Asynchronous, Locally Synchronous) clustered, multi-processors, systems on chip. The DSPIN architecture has a very small footprint and provides to the system designer both guaranteed latency, and guaranteed throughput services for real-time applications.

This paper describes an Ada framework called Cheddar which provides tools to check if a real time application meets its temporal constraints. The framework is based on the real time scheduling theory and is mostly written for educational purposes. With Cheddar, an application is defined by a set of processors, tasks, buffers, shared resources and messages. Cheddar provides feasibility tests in the cases of monoprocessor, multiprocessor and distributed systems. It also provides a flexible simulation engine which allows the designer to describe and run simulations of specific systems. The framework is open and has been designed to be easily connected to CASE tools such as editors, design tools, simulators, ...

This paper describes an Ada framework called Cheddar which provides tools to check if a real time application meets its temporal constraints. The framework is based on the real time scheduling theory and is mostly written for educational purposes. With Cheddar, an application is defined by a set of processors, tasks, buffers, shared resources and messages. Cheddar provides feasibility tests in the cases of monoprocessor, multiprocessor and distributed systems. It also provides a flexible simulation engine which allows the designer to describe and run simulations of specific systems. The framework is open and has been designed to be easily connected to CASE tools such as editors, design tools, simulators, ...

This paper provides an overview of the on-going European Project called WIreless DEployable Network System (WIDENS) which aims at defining a rapidly deployable communication system for public safety or emergency services. In this context, users expect a highly reliable communication system that can support real time applications to allow teams to collaborate in an efficient way. They also want the system to work in a spontaneous fashion and with no pre-installed infrastructures. To fit all the requirements, WIDENS takes advantage of the technology of wireless ad hoc networks to establish high data rate communication links on the fly. In this paper we describe the overall architecture of the WIDENS network and highlight the design of its major components.

The popularity of opportunistic spectrum access (OSA), implemented by cognitive radios (CRs), necessitates that these networks should be able to provide service differentiation for different classes of traffic. One of the classic schemes for such a goal is through priority queueing. As link interruptions in OSA networks are frequent, we discuss in this paper four priority queueing disciplines in the presence of interruptions: preemptive-resume, non-preemptive, exceptional non-preemptive and preemptive in case of occurrence of an interruption. Analytical results, in addition to simulation results to validate their accuracy, are provided.

Free-form deformations are widely used to model 3D objects. In these methods "free-form" designates: "whatever the object is, whatever its description and topology, we are able to deform it". They limit the user interaction to pull some points of an embedding rough mesh. From the user point-of-view, it does not matter if the object manipulated is 3-dimensional, of 0-genus or a parametric surface, he or she always uses the same process to model a complex object: load an initial object from a library and deform it via Ffd methods to follow his (her) needs. A large number of deformation methods have been published, allowing new deformations, new kinds of controls or enhancing the description of resulting objects. In fact advantage of deformation non-constrained by geometries is also a drawback: as it only manipulates points it could only result in points, so its necessary to use and maintain the neighborhood (the topology) or the surface expression on a second hand, as these methods do not care of object description. The work of creating an object from an empty scene is quite tedious, first methods of mesh manipulation highlight the future needs of user-oriented, efficient modeling methods. They first deform an object from a single vertex, diffusing the deformation on neighbors according to edges distance weights. The work of Barr [2] initiates free-form deformation techniques. It permits to deform an existing object globally (see Fig. ), with mathematical functions (taper, bend, twist). Since it was not a "vertex by vertex" displacement method it simplifies the creation process. This method does not act on topology, keeping the neighbors as they were, with the edges R. Raffin (B)

Em primeiro lugar à Deus, pela oportunidade de estar aqui evoluindo. Ao Professor Dr. Olinto José Varela Furtado, pela sua preciosa orientac ¸ão, incentivos e participac ¸ão durante o desenvolvimento deste trabalho. Aos membros da banca, por terem aceitado julgar este trabalho e pelos expressivos e frutíferos comentários feitos. Aos meus familiares, em especial meus pais, que sempre me apoiaram, pelo incentivo e pelo companheirismo, em todos os momentos. À Universidade Federal de Santa Catarina, seus funcionários e professores, por todo esforc ¸o despendido em manter a educac ¸ão, pesquisa e desenvolvimento do nosso país. Aos colegas e amigos, que de certa forma contribuíram para a realizac ¸ão deste trabalho. À minha noiva Mariana, que nunca deixou de me apoiar, me defender, me amar e, principalmente, compreender, pelo tempo que precisei dedicar ao trabalho e não pude estar com ela.

After logical correction, Real-Time Systems require the results available within the specified time limit, usually despite memory, processor or energy consumption constraints. Because of this, the development of Real-Time Systems is more complex if compared to normal computing systems development. This dissertation presents an alternative to soft Real-Time Systems development, using the Real-Time Reflexive Model implemented over the J AVA TM programming language. The result of this union is the Java/RTR programming language, that has its formal description detailed here, and for which a translator is developed. This translator processes the Java/RTR code and generates J AVA TM code with the Real-Time Specification for J AVA TM functionalities. This specification adds real-time concepts to JAVA TM through a programming API and a new, extended J AVA TMVirtual Machine. Aiming to make easy using Java/RTR, a plug-in for Eclipse Platform is included, allowing a better interaction between ...

Next-generation mobile networks are evolving towards network architectures relying entirely on IP. Approach: These networks had to be scalable in order to support future IP traffic, namely new multimedia services and real time applications, while providing an effective mobility management mechanism to cope with increasingly mobile users. In addition to global connectivity, next-generation mobile networks will have to offer quality of service guarantees such as assured bandwidth, low rate of packet loss, low delay and jitter. Results: In this study, we proposed an MPLS-based architecture for mobility management and end-to-end quality of service support in fourth-generation all-IP mobile networks (MAFI). Conclusion/Recommendations: Our scheme aimed to reduce handoff latency by implementing the fast handover technique and to increase the robustness and flexibility of the mobile system. The results obtained confirm the efficiency of MAFI when compared to FHMIPv6 and others schemes well-known in the literature.