Multimedia Application

The paper discusses an FPGA-based prototyping system with both wired and wireless programming and data exchange facilities. The system can be efficiently used for different types of portable devices. For example, it can supply additional interfaces to mobile computers; can be seen as a hardware accelerator for solving computationally complex problems or serve as a base for portable embedded applications. The system includes an extendable core prototyping board, development tools and supplementary software. The board is designed in such a way that it provides direct support for reconfiguration and self-reconfiguration. It can also be employed for virtual prototyping systems that require more resources that the capacity of the onboard FPGA. The supplementary software includes all necessary drivers and interfaces to interact with the board. The development tools are targeted to design space exploration and they consist of hardware description language libraries, design templates, IP cores, software models and multimedia applications. The latter are mainly used for different types of experiments and for hardware/software partitioning.

Environmental Sound Classification (ESC) has emerged as a prominent research domain, aiming to categorize various realworld audio events for use in context-aware systems. Unlike speech and music, environmental sounds are inherently unstructured, making their classification more challenging. Over the years, researchers have explored a range of preprocessing methods, feature extraction techniques, and classifiers for ESC. While notable progress has been made in terms of accuracy, there remains potential for enhancement through strategic feature combinations. This study investigates the classification performance of various handcrafted features, including temporal (Root Mean Square, Zero Crossing Rate), spectral (Chroma, Spectral Flatness, Tonnetz), cepstral (Mel Frequency Cepstral Coefficients), and image-based (Log-Mel Spectrogram) features. These features were selectively combined based on insights from previous work and evaluated using five traditional machine learning classifiers. Among the tested combinations, the pairing of Mel Frequency Cepstral Coefficients (MFCCs) and Chroma features delivered the highest classification accuracy of 81.54% with the K-Nearest Neighbor (KNN) classifier. The proposed approach demonstrates superior performance compared to several existing benchmark studies, while maintaining low computational complexity.

Very high throughput satellites (VHTS) are the new trend in satellite communications systems in order to satisfy the increasing demand for both higher throughput and ubiquitous connectivity. Implementing an IP interactive network over a VHTS would enable the satellite to compete with terrestrial networks by offering ubiquitous added value services for end-user traffic. Even so, the simulations presented in this paper show that a 30% of throughput can be lost due to co-channel interferences. In existing interactive satellite networks such as REDSAT or AmerHis, the return uplink transmissions are inherently benefited from the MF-TDMA scheduling to mitigate the co-channel interferences present in VHTS. In such networks dynamic resource assignation (DAMA) is executed at each SuperFrame period (<100 ms). Therefore, any feasible optimization on the scheduling shall be performed in real time. In this paper, two parallel problems are faced at the same time: co-channel interference mitigation and real time scheduling. In particular, two novel interference-aware scheduling algorithms for a DVB-RCS2 return uplink are presented. Despite other previous works, the proposed algorithms are designed on the basis to be executed in real time on a fixed SuperFrame period basis. The performance assessment of the proposed algorithms is carried out through system-level simulations based on realistic satellite scenarios and interactive traffic models using DAMA in real time.

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

The size of network and internet traffic is rising spontaneously by the day, with data usage at zettabyte to petabyte scale at an exponential high rate and therefore considered to generate huge traffic along the way which causes the chance of error in transmission to be high as well. Automatic Repeat Request (ARQ) protocol is an error control function for data transmission that uses acknowledgements. These protocols exist in Data link or Transport layers. ARQ is categorize into three major types such as Stop and wait, Go Bank N and Selective Repeat. Hybrid automatic repeat (HARQ) request which is an advancement to earlier mentioned protocols to detect error via cycle redundancy check was later developed. This paper evaluates the performance of these basic ARQs and HARQ protocols in consideration of the current state of high signal interference and collision during competitive accesses, more especially in highly densely networks.

Resource reservations are a very popular choice to schedule multimedia tasks. However, the high variability of the resource requirements hinders a static choice of the scheduling parameters. In this paper we address this problem by a combination of two strategies: adaptive reservations and resource reclaiming. The first one operates "locally" (using the information of a single task), the second one operates "globally" distributing unused bandwidth between the tasks. In this paper, we show by analytical results and by extensive simulations that the two techniques can be safely and usefully combined.

Real-time scheduling theory has traditionally dealt with the problem of scheduling the CPU so that the execution of a set of concurrent tasks can meet some timing con- straints. The kind of real-time constraints considered range from hard real-time constraints (requiring strict and ...

We propose an adaptive scheduling technique to schedule highly dynamic multimedia tasks on a CPU. We use a combination of two techniques: the first one is a feedback mechanism to track the resource requirements of the tasks based on “local” observations. The second one is a mechanism that operates with a “global” visibility, reclaiming unused bandwidth. The combination proves very effective: resource reclaiming increases the robustness of the feedback, while the identification of the correct bandwidth made by the feedback increases the effectiveness of the reclamation. We offer both theoretical results and an extensive experimental validation of the approach.

This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where two types of tasks can coexist simultaneously: multimedia soft real-time tasks and hard real-time tasks. Hard tasks are guaranteed based on worst case execution times and minimum interarrival times, whereas multimedia and soft tasks are served based on mean parameters. The paper describes a server-based mechanism for scheduling soft and multimedia tasks without jeopardizing the a priori guarantee of hard real-time activities. The performance of the proposed method is compared with that of similar service mechanisms through extensive simulation experiments and several multimedia applications have been implemented on the HARTIK kernel.

End-to-end optimised Quality of Service (QoS) and its specific declination for multimedia applications with the end-user Perceived Quality of Service (PQoS) is nowadays a trendy topic in the literature. Many different techniques and approaches have been proposed, which are in general focusing on specific weak technical aspects of the transmission chain in the considered scenario. The end-to-end optimisation of a complete system system is however more complex and its practical realisation remains to be achieved, especially with the added constraint to be transparently integrated in existing legacy systems so as to not perturbate their current modes of operation. In this paper, we propose an architecture set-up within the ICT FP7 OPTIMIX project to study innovative solutions enabling enhanced multimedia streaming in a point to multi-point context for an IP (Internet Protocol) based wireless heterogeneous system, based on cross layer adaptation of the whole transmission chain. The corresponding simulation chain architecture is detailed with the description of the existing and/or future features of each module.

In the near future, Multi-Processor Systems-on-Chip (MPSoC) will become the main thrust driving the evolution of integrated circuits. MPSoCs introduce new challenges, mainly due to growing communication through their interconnect structure. Current electrical interconnects will face hard challenges to overcome such data flows. Integrated optical interconnect is a potential technological improvement to reduce these problems. The main contributions of this paper are i) the optical network integration in a system-level MPSoC platform and ii) the quantitative evaluation of optical interconnect for MPSoC design using a multimedia application.

Effective communication is paramount in the field of education, particularly among school teachers who serve as conduits of knowledge and facilitators of learning. This research article examines the communicative competence of school teachers, exploring its multifaceted dimensions and implications for pedagogical practice. Drawing upon theoretical frameworks and empirical evidence, this study investigates the components of communicative competence, its role in classroom interactions, and the factors influencing its development and enhancement. Additionally, it offers insights into the assessment methods and strategies for fostering communicative competence among school teachers.

Because of bursty high data rate and delay sensitive nature of high quality multimedia application, the resource allocation in wireless network to meet its quality of service (QoS) has become the most challenging and interesting issue. Orthogonal Frequency Division Multiple Access (OFDMA) employing adaptive channel allocation technique can support these requirement while increasing the system capacity many fold. Here, an efficient resource allocation method called two stage rate adaptive (TSRA) ...

In this paper we present our preliminary findings from a survey conducted during 2005 of Australian Multimedia Application Developers. Our objective was to understand what development processes and techniques are used and how these relate to practices cited in the literature. We were also interested in what impact the presence of multimedia content has on the process, as well as the differing skill sets it requires in relation to "traditional" software development. In our findings we report on the process models used and the process tasks most often performed, as a first step to determining what is considered best practice in the industry. We found that developers appear to have a much keener sense of their processes than previous studies have suggested.

Many researchers have discussed various topics in universal mobile telecommunication system (UMTS) networks: the process of switching from one cell to another for the subscriber and the impact of the quality of the connection during the transition process, quality of services (QoS), the quality of the uplink and downlink carrier line, the various types of code for the voice transmitted through the Internet, especially the research that discussed voice over internet protocol (VoIP) technology as voice travels from cell to cell in mobile networks, depending on the type of delivery. In this paper, a proposed scenario of a UMTS network was implemented to evaluate the multicellular VoIP movement; the proposed UMTS network was simulated using the OPNET 14.5 simulator. The calculation and analysis of the different parameters of the user while moving from one cell to another with different movement speeds considered, the best mean opinion score (MOS) value (3.19) registered for the scenario (soft handover) comparing with another type of handover (3.00).

Mission-critical surveillance applications such as intrusion detection or disaster response have vital requirement in QoS. We consider a Wireless Image Sensor Network (WISN) with a scheduling of image sensor node's activity based on the application criticality level. This approach allows sentry nodes capable of detecting intrusions with a higher probability and alerting neighbor nodes as well as activating one of its cover sets for disambiguation purposes for instance. In this paper, we propose a multi-criteria approach to select the suitable cover set for reliable transmission of images in mission-critical applications. The proposed approach takes into account cover set size and energy, topology and routing information that affect the image quality at the sink in a multi-hop transmission network. The results show that our proposal provides low packet loss probability, low latency, and higher visual quality of received images at the Sink.

In many applications, the amount and resolution of digital images have significantly increased over the past few years. For this reason, there is a growing interest for techniques allowing to efficiently browse and seek information inside such huge data spaces. JPEG 2000, the latest compression standard from the JPEG committee, has several interesting features to handle very large images. In this paper, these features are used in a coarse-to-fine approach to retrieve specific information in a JPEG 2000 code-stream while minimizing the computational load required by such processing. Practically, a cascade of classifiers exploits the bit-depth and resolution scalability features intrinsically present in JPEG 2000 to progressively refine the classification process. Comparison with existing techniques is made in a texture-retrieval task and shows the efficiency of such approach. a A. Descampe and C. De Vleeschouwer are funded by the Belgian NSF (FNRS).

Despite the amelioration in communication technologies, the server network I/O bottleneck remains a severe obstacle in video-on-demand applications. All bandwidth-sharing techniques, proposed to overcome this, assume videos to be requested in their entirety. In this paper, we extend the video-on-demand delivery problem so that it allows users to request parts of video and be able to receive them at that instant. Specifically, we propose an efficient technique called Multicast Jumping (MJ) that provides many desirable properties such as: (1) The demand on the server bandwidth is significantly alleviated; (2) True and scaleable video on demand is achieved; (3) Not only for streaming video segments on demand, but the technique also works for on-demand videos in their entirety.

Digital video is rapidly becoming an important source of information and entertainment, and is used in a host of multimedia applications. With the size of digital video collections growing to many thousands of hours, technology is needed to allow rapid browsing of videos. One way to summarize a video is to select poster frames to represent segments of the video. Previous techniques for extracting poster frames were based on scene segmentation, using color histograms or optical flow. To provide more informative poster frames, this work combines algorithms for extracting image content, specifically faces and on-screen text, with existing scene segmentation technology.

This document proposes an informal management model of Differentiated Services (Diffserv) routers for use in their management and configuration. This model defines functional datapath elements (e.g., classifiers, meters, actions, marking, absolute dropping, counting, multiplexing), algorithmic droppers, queues and schedulers. It describes possible configuration parameters for these elements and how they might be interconnected to realize the range of traffic conditioning and per-hop behavior (PHB) functionalities described in the Diffserv Architecture.

In recent years, there has been a growing interest in supporting component-based software development of complex real-time embedded systems. Techniques such as machine virtualisation have emerged as interesting mechanisms to enhance the security of these platforms, while real-time scheduling techniques have been proposed to guarantee temporal isolation of different virtualised components sharing the same physical resources. This combination also highlighted criticalities due to overheads introduced by hypervisors, particularly for low-end embedded devices. This led to the need of investigating deeper into solutions based on lightweight virtualisation alternatives, such as containers. In this context, this paper proposes to use a real-time deadline-based scheduling policy built into the Linux kernel to provide temporal scheduling guarantees to different co-located containers. The proposed solution extends the SCHED_DEADLINE scheduling policy to schedule Linux control groups, allowing user threads to be scheduled with fixed priorities inside the control group scheduled by SCHED_DEADLINE. The proposed mechanism can be configured via control groups, and it is compatible with commonly used tools such as LXC, Docker and similar. This solution is compatible with existing hierarchical real-time scheduling analysis, and some experiments demonstrate consistency between theory and practice.

Counting more than two billion devices, Android is nowadays one of the most popular open-source general-purpose operating systems, based on Linux. Because of the diversity of applications that can be installed, it manages a number of di erent workloads, many of them requiring performance/QoS guarantees. When running audio processing applications, the user would like an uninterrupted, glitch-free, output stream that reacts to the user input, typically with a delay not bigger than 4− 10 ms, while keeping the energy consumption of the mobile device as low as possible. This work focuses on improvements to the real-time audio processing performance on Android that preserves energy-e ciency. Such improvements are achieved by using a deadline based scheduler and an adaptive scheduling strategy that dynamically and proactively modulates the allocated runtime. The proposed strategy is evaluated through an extensive experimentation, showing that 1) compared to the existing way to ensure low-l...

In this paper, we propose to use resource reservations scheduling and feedback-based allocation techniques for the provisioning of proper timeliness guarantees to audio processing applications. This allows real-time audio tasks to meet the tight timing constraints characterizing them, even if other interactive activities are present in the system. The JACK sound infrastructure has been modified, leveraging the real-time scheduler present in the Adaptive Quality of Service Architecture (AQuoSA). The effectiveness of the proposed approach, which does not require any modifiction to existing JACK clients, is validated through extensive experiments under different load conditions.

We consider soft real-time applications organised as pipelines of tasks using resources of different type (communication, computation, storage). The applications are assumed to be periodically triggered and the different tasks communicate by unidirectional buffers. The problem we cope with is how to effectively share the resources so that some specified Quality of Service (QoS) requirements are met. The QoS considered here is tightly related to the end-to-end temporal behaviour of the application. To compensate for time-varying resource requirements, we advocate a distributed control approach whereby the scheduling parameters of each task are tuned depending on the temporal behaviour of the application measured by appropriate sensors. The use of real-time scheduling strategies enables a mathematically safe control design, in which the QoS requirements are translated into formal control goals, and formal proofs are provided on the ability of the controller to fulfil these goals. We also offer extensive simulations that validate the approach for multimedia applications.

We propose an adaptive scheduling technique to schedule highly dynamic multimedia tasks on a CPU. We use a combination of two techniques: the first one is a feedback mechanism to track the resource requirements of the tasks based on “local” observations. The second one is a mechanism that operates with a “global” visibility, reclaiming unused bandwidth. The combination proves very effective: resource reclaiming increases the robustness of the feedback, while the identification of the correct bandwidth made by the feedback increases the effectiveness of the reclamation. We offer both theoretical results and an extensive experimental validation of the approach.

In this paper, we present a software architecture to support soft real-time applications, such as multimedia streaming and telecommunication systems, in open embedded systems. Examples of such systems are consumer electronic devices (as cellular phones, PDAs, etc.), as well as multimedia servers (video servers, VoIP servers, etc.) and telecommunication infrastructure devices. For such applications, it is important to keep under control the resource utilization of every task, otherwise the Quality of Service experienced by the users may be degraded. Our proposal is to combine a resource reservation scheduler (that allows us to partition the CPU time in a reliable way) and a feedback based mechanism for dynamically adjusting the CPU fraction (bandwidth) allocated to a tasks. In particular, our controller enables specified Quality of Service (QoS) levels for the application while keeping the allocated bandwidth close to its actual needs. The adaptation mechanism consists of the combination of a prediction and of a feedback correction that operates locally on each task. The consistency of the system is preserved by a supervisor component that manages overload conditions and enacts security policies. We implemented the framework in AQuOSA, a software architecture that runs on top of the Linux kernel. We provide extensive experimental validation of our results and offer evaluation of the introduced overhead, which is remarkably lower than the one introduced by other different solutions.

IP real-time multimedia applications present a challenging environment for network and service management, which requires a new approach. DYSWIS (Do You See What I See), proposed in this paper, is peer-to-peer distributed management architecture for multimedia network and service management, characteristic of active fault probing and identification based on protocol and functional scripting and rules.

Despite its popularity, relatively little is known about the traffic characteristics of the Skype VoIP system and how they differ from other P2P systems. We describe an experimental study of Skype VoIP traffic conducted over a five month period, where over 82 mil-lion datapoints were ...

In this paper, we propose an interactive DTV design that converts non-interactive broadcast DTV streams into interactive ones for multiple simultaneous viewers. To enable viewing interactivity, we show that it is critical to organize data intelligently for improving IO resolution, reducing disk latency and minimizing storage cost. We propose three data placement schemes that offer different tradeoffs between IO resolution, disk latency and storage. By employing different schemes under different workload scenarios, an intelligent system can minimize memory use and hence the system cost.

The degree of DLP parallelism in applications is not fixed and varies due to different computational characteristics of applications. On the contrary, most of the processors today include single-width SIMD (vector) hardware to exploit DLP. However, single-width SIMD architectures may not be optimal to serve applications with varying DLP and they may cause performance and energy inefficiency. We propose the usage of VLIW processors with multiple native vector-widths to better serve applications with changing DLP. SHAVE is an example of such VLIW processor and provides hardware support for the native 32-bit and 128-bit wide vector operations. This paper researches and implements the mixed-length SIMD code generation support for SHAVE processor. More specifically, we target generating 32-bit and 128/64-bit SIMD code for the native 32bit and 128-bit wide vector units of SHAVE processor. In this way, we improved the performance of compiler generated SIMD code by reducing the number of overhead operations and by increasing the SIMD hardware utilization. Experimental results demonstrated that our methodology implemented in the compiler improves the performance of synthetic benchmarks up to 47%.

Data transfers and storage are dominating contributors to the area and power consumption for all modern multimedia applications. A cost-efficient realisation of these systems can be obtained by using high-level memory optimisations. This paper demonstrates that the state-of-the-art memory optimisation techniques only partly can deal with code from real-life multimedia applications. We propose a systematic preprocessing methodology that can be applied on top of the existing work. This opens more opportunities for existing memory optimisation techniques. Our methodology is complemented with a postprocessing step, which eliminates the negative effects of preprocessing and may further improve the code quality . Our methodology has been applied on several real-life multimedia applications. Results show a decrease in the number of main memory accesses up to 45.8% compared to applying only state-of-the-art techniques.

Thus far, the L0 buffer organizations proposed and analyzed in the literature are, to a large extent, centralized, i.e., a single logical cluster is assumed and a single controller controls the indexing into the buffer to store and fetch instructions. However, such an organization in the context of VLIW processors is energy inefficient and its scalability is limited. First, the wordlines of the buffers 672

Current multimedia applications demand complex heterogeneous multiprocessor architectures with specific communication infrastructure in order to achieve the required performances. Programming these architectures usually results in writing separate low-level code for the different processors (DSP, microcontroller), implying late global validation of the overall application with the hardware platform. We propose a platform-based software design flow able to efficiently use the resources of the architecture and allowing easy experimentation of several mappings of the application onto the platform resources. We use a high-level environment to capture both application and architecture initial representations. An executable software stack is generated automatically for each processor from the initial model. The software generation and validation is performed gradually corresponding to different software abstraction levels. Specific software development platforms (abstract models of the ar...

In this paper, we share our experience of designing single-chip multiprocessor controller for advanced multimedia application. We cover the architecture design and validation, the encountered problems and our solutions and we will provide some simulation results.

Memory represents a major bottleneck in embedded systems. For multimedia applications bulky of data in these embedded systems require shared memory. But the integration of this kind of memory implies some architectural modifications and code transformations. And no automatic tool exists allowing designers to integrate shared memory in the SoC design flow. In this work, we present a systematic approach for the design of shared memory architectures for application-specific multiprocessor systems-on-chip. This work focuses on the code-transformations related to the integration of a shared memory.

More than providing a wireless structure for Internet access, Wireless Mesh Networks are being challenged to support diverse kinds of multimedia applications such as Voice over IP and video streaming in publish-subscriber and peer-to-peer service models. In this context, several routing metrics have been proposed to improve the routing performance as well as the network capability to satisfy the requirements of multimedia applications. However, most routing metrics lack the consistent integration of efficient monitoring mechanisms for interference and traffic load characterization in order to support the adequate decisions by the routing algorithms. In this sense, a new routing metric is proposed in this paper, called Metric for INterference and channel Diversity (MIND), that measures network interference and load, based on a passive monitoring mechanism in order to avoid the overhead of active network state information gathering. An evaluation of MIND and relevant existing routing metrics was performed using NS2. The results showed that when path selection is based on MIND, traffic performance is significantly better than with the other metrics.

In order to minimize the main memory consumption, a multi-bank architecture is adopted. The main advantage in this architecture is the capability of setting banks in low power modes when they are not accessed, such that only the accessed bank is maintained in active mode. In this paper, an heuristic approach is developed at system level to find, both an efficient allocation of application's tasks to memory banks, and the corresponding memory configuration that lessen the energy consumption: number of banks and the size of each bank. Experiments on a multimedia application show the effectiveness of this approach.

In order to minimize the main memory consumption, a multi-bank architecture is adopted. The main advantage in this architecture is the capability of setting banks in low power modes when they are not accessed, such that only the accessed bank is maintained in active mode. In this paper, an heuristic approach is developed at system level to find, both an efficient allocation of application's tasks to memory banks, and the corresponding memory configuration that lessen the energy consumption: number of banks and the size of each bank. Experiments on a multimedia application show the effectiveness of this approach.

Heterogeneous MPSoCs present unique opportunities for emerging embedded applications, which require both high-performance and programmability. Although, software programming for these MPSoC architectures requires tedious and error-prone tasks, thereby automatic code generation tools are required. A code generation method based on fine-grain specification can provide more design space and optimization opportunities, such as exploiting fine-level parallelism and more efficient partitions. However, when partitioned, fine-grain models may require a large number of inter-processor communications, decreasing the overall system performance. This paper presents a Simulink-based multithread code generation method, which applies Message Aggregation optimization technique to reduce the number of interprocessor communications. This technique reduces the communication overheads in terms of execution time by reduction on the number of messages exchanged and in terms of memory size by the reduction on the number of channels. The paper also presents experiment results for one multimedia application, showing performance improvements and memory reduction obtained with Message Aggregation technique.

Principles of Multimedia introduces and explains the theoretical concepts related to the representation, storage, compression, transmission and processing of various multimedia components, including text, image, graphics, audio, video and animation, as well as their use across various applications. The book provides the necessary programming tools and analysis technique concepts to perform practical processing tasks in software labs and to solve numerical problems at the postgraduate level. For this new third edition, every chapter has been updated and the book has been carefully streamlined throughout. Chapter 1 provides an overview of multimedia technology, including the definition, major characteristics, hardware, software, standards, technologies and relevant theorems with mathematical formulations. Chapter 2 covers text, including digital text representations, text editing and processing tools, text application areas and text file formats. Chapter 3 explores digital image input and output systems, image editing and processing tools, image application areas, image color management and image file formats. Chapter 4 discusses 2D and 3D graphics algorithms, transformation matrices, splines, fractals, vectors, projection application areas and graphics file formats. Chapter 5 covers audio, including digital audio input and output systems, audio editing and processing tools, audio application areas and audio file formats. Chapter 6 looks at video, including digital video input and output systems, video editing and processing tools, video application areas and video file formats. Chapter 7 focuses on animation, covering 2D and 3D animation algorithms, interpolations, modeling, texture mapping, lights, illumination models, camera, rendering, application areas and animation file formats. Finally, Chapter 8 covers compression, including lossless and lossy compression techniques, and various algorithms related to text image audio and video compression. Every chapter includes solved numerical problems, coding examples and references for further reading. Including theoretical explanations, mathematical formulations, solved numerical problems and coding examples throughout, Principles of Multimedia is an ideal textbook for graduate and postgraduate students studying courses on image processing, speech and language processing, signal processing, video object detection and tracking, graphic design and modeling and related multimedia technologies.

Color reproductions in most LCD are quite different from those of standard CRT (cathode ray tube) monitor display because of the nonlinear characteristic in subtractive color reproduction. Moreover, gray scale CCT (correlated color temperature) reproductions in a typical mobile phone LCD depend on the input RGB levels. A simple LUT (Look-up table) method for constant gray scale CCT and gamma characteristic of mobile phone LCD is presented in this paper. We investigate the mobile phone LCD's characteristic of compensation of CCT with using the LUT. LCD's CCT is maintaining about 7500 K, which is the target CCT of mobile phone LCD in this paper. Also LCD's gamma is similar to target gamma.

This research work studies the performance of the internet services of institution of higher learning in Nigeria. Data was collated from Lagos State University of Science and Technology (LASUSTECH) as case study of this research work. The problem of Internet Bandwidth optimization in the institution of higher learning in Nigeria was extensively addressed in this paper. The operation of the Link-Load balancer which provides an efficient costeffective and easy-to-use solution to maximize utilization and availability of Internet access is discussed. In this research work, the Lagrange's method of interpolation was used to predict effective internet data bandwidth for significantly increasing number of internet users. The linear Lagrange's interpolation model (LILAGRINT model) was proposed for LASUSTECH. The predictions allow us to view the effective internet data bandwidth with respect to the corresponding acceptable number of internet users as the number of user's increases. The integrity of the model was examined, verified and validated at the ICT department of the institution. The LILAGRINT model was integrated into the management of ICT and tested. The result showed that the proposed LILAGRINT model proved to be highly effective and innovative in the area of internet data bandwidth predictability.

This research focuses on the motion illustration tendency of "The Tales of Sang Kancil," a compilation of popular Malaysian folktale stories. The findings demonstrate a considerable increase in the number of adaptations and their online views, demonstrating a rising interest in this medium, based on a complete examination of motion illustration films from various sources using qualitative methods by doing visual analysis. The motion drawings include a variety of visual styles, use numerous narrative tactics, and successfully maintain cultural components while combining current animation technology. The trend pattern could also be seen at the end of the study comparing the significant elements of motion illustrations in adapting the story. This trend helps preserve Malaysian folktale stories and acts as a link between generations, assuring the timeless tales' continuous relevance and enjoyment.

Lifetime of node-to-node communication in a wireless ad hoc network is defined as the duration that two nodes can communicate with each other. Failure of the two nodes or failure of the last available route between them ends their communication. In this paper, we analyze the maximum lifetime of node-to-node communication in static ad hoc networks when alternative routes that keep the two nodes connected to each other are node-disjoint. We target ad hoc networks with random topology modeled as a random geometric graph. The analysis is provided for (1) networks that support automatic repeat request (ARQ) at the medium access control level and (2) networks that do not support ARQ. On the basis of this analysis, we propose numerical algorithms to predict at each moment of network operation, the maximum duration that two nodes can still communicate with each other. Then, we derive a closed-form expression for the expected value of maximum node-tonode communication lifetime in the network. As a byproduct of our analysis, we also derive upper and lower bounds on the lifetime of node-disjoint routes in static ad hoc networks. We verify the accuracy of our analysis using extensive simulation studies.

Aura is a new sound synthesis system designed for portability and flexibility. Aura is designed to be used with W, a real-time object system. W provides asynchronous, priority-based scheduling, supporting a mix of control, signal, and user interface processing. Important features of Aura are its design for efficient synthesis, dynamic instantiation, and synthesis reconfiguration.

Digital Signal Processing (DSP) architectures are specialized for high performance numerical algorithms such as those found in communication and multimedia applications. The development of efficient compilers for DSP processors is a growing research area. The Texas Instruments ThIS32OC6x (C6x) is a Very Long Instruction Word (VLIW) DSP architecture capable of issuing eight operations in parallel. In this paper, we present the results of implementing a software pipelining algorithm for the C6x. We provide a description of the C6x and detail the architectural features that impact software pipelining such as a moderately sized register tile, constraints on code size, homogeneous resources, and multiple assignment code. We discuss how we adapted modulo scheduling to implement software pipelining for the C6x. Finally, we present the results of modulo scheduling a set of 40 loop kernel benchmarks and measure the algorithm in terms of schedule quality and algorithm complexity.