ppxscal/embedding_network huggingface dataset:
A Study on the Packaging for Fast Boot-up Time in the Embedded Linux
Authors: Kyung Ho Chung, Myung Sil Choi, Kwang Seon Ahn
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

This paper attempts to analyze the boot-up time of bootloader and Linux Kernel, and to compare performance of several root file-systems for fast boot-up time in the Embedded Linux. Therefore, it was implemented with time measurement module to analyze the boot-up time of bootloader and Linux kernel, and measured the time at each event point related to boot-up. As a result of analysis of six cases packaging, it has turned out the fact that the data checksum routine, decompressing the kernel and ramdisk image takes most of the boot-up time. Root file-system was packaged through analyzing such performance as boot-up time, memory usage, filesystem size. This is based on raw-kernel image and a combination of CRAMFS and JFFS2, and it has small size of the root file-system, the boot-up time is decreased.
Testing Aspect Oriented Programs: an Approach Based on the Coverage of the Interactions among Advices and Methods
Authors: Mario Luca Bernardi, Giuseppe Antonio Di Lucca
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Testing is a fundamental issue to ensure software quality. Testing Aspect Oriented programs may be more difficult than traditional ones, due to the large impact that aspects have on teh static structure and dynamic behavior of the overall system. Aspects may be sources for failures due to new kinds of faults in their code, by affecting the overall quality of the system. New testing approaches and criteria, taking into account the aspect-oriented constructs, are needed to capture the new kind of program failures. In this paper we propose a set of testing coverage criteria based on the interactions among the advicesand the methods they affect. The proposed critieria are based on the Inter-procedural Aspect Control Flow Graph (IACFG) representing the inter-proceduralinteractions among advices and methods.
Testability and Test Framework for Collaborative Real-Time Editing Tools
Authors: Lian Yu, Lifeng Xu, Guanzhu Wang, Changyan Chi, Wenping Xiao, Hui Su
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The difficulties with testing Internet-based Collaborative Real-time Editing Tools (CRETs) come from the requirements of collaboration, real-time and distribution. This paper considers testability as a quality attribute of CRETs requirements, and explores its design and implementation to facilitate testing CRETs. Dyanmic CRETs' testability aspects include controllability, observability and traceability. In addition, Test agent based test execution framework is built to further smooth the test progress. The automatic test framework provides functionality of estimates of test case parameters, auto-editing robot, time synchronization, testing XMLHttpRequest object, and on-line verification. To provide visualization of test execution, a SVG-based timeline diagram is developed to demonstrate the motions of testing CRETs on-line. Keywords: testability, test framework, collaboration, visualization, timeline diagram, grey-box testing.
Surface Triangulation for Picture Production
Authors: Burkard Wordenweber
Venue: IEEE Computer Graphics and Applications (1983)

Converting from boundary to faceted representation results in a model that is well suited for fast hidden-surface removal, shaded pictures, and finite element mesh generation.
Image Pixel Force Fields and their Application for Color Map Vectorisation
Authors: V. Bucha, S. Ablameyko, S. Uchida
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Pixel force field is a novel image representation where at each pixel a two-dimensional vector is defined for representing the circumstance of the pixel. The vector is oriented to the center of the region composed of vectors having the same qualitative property, such as color and gray-scale level. Using the pixel force field, that is, the orientation and the magnitude of the vector, many fundamental and specific image processing tasks can be solved. As examples of the tasks, the force field is applied to color image thinning, color image segmentation, and color map vectorisation.
A Colour Document Interpretation: Application to Ancient Cadastral Maps
Authors: R. Raveaux, J.-C. Burie, J.-M. Ogier
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, a colour graphic document analysis is proposed with an application to ancient cadastral maps. The approach relies on the idea that images of document are fairly different than usual images, such as natural scenes or paintings... From this statement, we present an architecture for colour document understanding. It is based on two paradigms. Firstly, a dedicated colour representation named adapted colour space which aims to learn the image colour specificity and secondly a document oriented segmentation using a region growing algorithm supervised by a hierarchical strategy. Experiments are performed to judge the whole process and the first results show a good behaviour in term of information retrieval.
Characterizing the Cell EIB On-Chip Network
Authors: Thomas William Ainsworth, Timothy Mark Pinkston
Venue: IEEE Micro (2007)

On-chip network design has become an increasingly important component of computer architecture. The Cell Broadband Engine's Element Interconnect Bus, with its four data rings and common command bus for end-to-end transaction control, interconnects more nodes than most commercial on-chip networks. To help understand on-chip network design and performance issues in the context of a commercial multicore chip, this article evaluates the EIB network using conventional latency and throughput characterization methods.
History and Status of Operations Support Systems
Authors: Rand Edwards
Venue: Journal of Network and Systems Management (2007)

Operations Support Systems (OSS) have been a critical component of any telecommunications company's business plan. In this paper we examine the history of OSS from the perspectives of maturing support for problem domains, enabling technologies, and system integration. Finally, we will look at the problems posed by the coming "everything over IP" networks, the changing communications provider landscape and the impact on operations support systems.
Predicting epistasis from mathematical models
Authors: Robert B. Heckendorn, Darrell Whitley
Venue: Evolutionary Computation (1999)

Classically, epistasis is either computed exactly by Walsh coefficients or estimated by sampling. Exact computation is usually of theoretical interest since the computation typically grows exponentially with the number of bits in the domain. Given an evaluation function, epistasis also can be estimated by sampling. However this approach gives us little insight into the origin of the epistasis and is prone to sampling error. This paper presents theorems establishing the bounds of epistasis for problems that can be stated as mathematical expressions. This leads to substantial computational savings for bounding the difficulty of a problem. Furthermore, working with these theorems in a mathematical context, one can gain insight into the mathematical origins of epistasis and how a problem's epistasis might be reduced. We present several new measures for epistasis and give empirical evidence and examples to demonstrate the application of the theorems. In particular, we show that some functions display “parity” such that by picking a well-defined representation, all Walsh coefficients of either odd or even index become zero, thereby reducing the nonlinearity of the function.
GPU-Based Interactive, Stereoscopic Visualization of Automotive Crash Simulations
Authors: Chris Seeling, Greg Watson, Kaiwei Sun
Venue: IEEE Computer Graphics and Applications (2007)

The automotive industry has recognized that simulation in key disciplines such as crash worthiness, noise and vibration, and fluid mechanics has matured to a high level. The decision is no longer about whether to use virtual technologies, but rather how to more effectively take advantage of these technologies to reduce time-to-market, lower development costs, and to support innovation. To further this technology, the Victorian Partnership for Advanced Computing (VPAC) developed a GPU-based algorithm (shader) that achieves a high frame rate while also interactively and immersively visualizing production-scale crash simulations.
An IT program assessment process
Authors: Cheryl Aasheim, Art Gowan, Han Reichgelt
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

This paper describes the assessment process designed and implemented for an undergraduate program in IT that was recently accredited by the Computing Accreditation Commission of ABET, Inc., under the general criteria for computing. It places special emphasis on programmatic-level assessment. The assessment process combines direct assessment methods of actual student learning and indirect assessment methods which measure how various stakeholders perceive the program and its students. It includes an explanation of how direct assessment measures at the course-level can be used to evaluate course and program-level outcomes. Indirect assessments include a series of survey instruments to capture perceptions of graduating students, graduates, and employers. Examples are provided.
Physically based hydraulic erosion simulation on graphics processing unit
Authors: Nguyen Hoang Anh, Alexei Sourin, Parimal Aswani
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Visual simulation of natural erosion on terrains has always been a fascinating research topic in the field of computer graphics. While there are many algorithms already developed to improve the visual quality of terrain, the recent simulation methods revolve around physically-based hydraulic erosion because it can generate realistic natural-looking terrains. However, many of such algorithms were tested only on low resolution terrains. When simulated on a higher resolution terrain, most of the current algorithms become computationally expensive. This is why in many applications today, terrains are generated off-line and loaded during the application runtime. This method restricts the number of terrains which can be stored if there is a limitation on storage capacity. Recently, graphics hardware has evolved into an indispensable tool in improving the speed of computation. This has motivated us to develop an erosion algorithm to map to graphics hardware for faster terrain generation. In this paper, we propose a fast and efficient hydraulic erosion procedural technique that utilizes the GPUs powerful computation capability in order to generate high resolution erosion on terrains. Our method is based on the Newtonian physics approach that is implemented on a two-dimensional data structure which stores height fields, water amount, and dissolved sediment and water velocities. We also present a comprehensive comparison between the CPU and GPU implementations together with the visual results and the statistics on simulation time taken.
IP protection: Detecting Email based breaches of confidence
Authors: Neil Cooke, Lee Gillam, Ahmet Kondoz
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper we discuss the ease with which email can be used to breach confidence by the propagation of corporate secrets and intelligence, and propose an intelligent filtering system for outgoing emails aimed at preventing disclosures. We report on a number of experiments undertaken with a corpus of over half a million Enron emails and the use of a variety of techniques from the field of Corpus Linguistics for reducing the number of false alarms produced by naïve keyword filtering systems, and discuss the results in detail. We also give due consideration to the danger of missing messages that should have been prevented from propagation.
Localized Techniques for Broadcasting in Wireless Sensor Networks
Authors: Devdatt Dubhashi, Olle H&#x00e4;ggstr&#x00f6;m, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
Venue: Algorithmica (2007)

In this paper we tackle the problem of designing simple, localized, low energy consuming, reliable protocols for one-to-all communication in large scale wireless sensor networks. Our first proposed technique, called the Irrigator protocol, relies on the idea to first build a sparse overlay network, and then flood over it. The overlay network is set up by means of a simple, distributed, localized probabilistic protocol and spans all the sensor nodes with high probability. Based on the algorithmic ideas of the Irrigator protocol we then develop a second protocol, dubbed Fireworks, with similar performance that does not require any overlay network to be set up in advance. Asymptotic analytical results are provided which assess the reliability of the Irrigator and Fireworks techniques. The theoretical analysis of the proposed protocols is complemented and validated by a (simulation based) comparative performance evaluation that assesses several advantages of our new protocols with respect to gossiping and simple flooding. Differently from previous studies, we analyze and demonstrate the performance of our protocols for two different node distributions: The typical uniform distribution and a newly defined &#x201c;hill&#x201d; distribution, here introduced to capture some of the important and more realistic aspects of node deployment in heterogeneous terrain. Simulation results show that the proposed schemes achieve very good trade-offs between low overhead, low energy consumption and high reliability. In particular, the Irrigator and Fireworks protocols are more reliable than gossiping, and significantly reduce the number of links along which a message is sent over both flooding and gossiping.
Capability Managers
Authors: R. B. Kieburtz
Venue: IEEE Transactions on Software Engineering (1978)

The use of capabilities to control the access of component programs to resources in an operating system is an attractive means by which to provide a uniform protection mechanism. In this paper, a capability is defined as an abstract encapsulation of the data needed to define access to a protected object. We do not assume that capability checking is necessarily concentrated in a protection kernel, nor that capabilities to different types of objects are all of the same degree of complexity. We explore a language-based capability mechanism in which protection environments are established by declaration, enforcement protocols are automatically produced by a compiler, and access control policy is clearly placed in the hands of the system designer. The basic mechanism introduced is a program component called a capability manager that is an extension of the monitor concept. It can be used to realize most of the facilities associated with kernel-based capabilities, including preemptive revocation.
A New BP Neural Network Model Based on the Random Fuzzy Theory
Authors: Yujuan Sun, Yilei Wang, Tao Li, Peng Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The field of neural networks can be thought of as being related to artificial intelligence, machine learning, parallel processing, statistics, and other fields. The attraction of neural networks is that they are best suited to solving the problems that are the most difficult to solve by traditional computational methods. In this paper, the author first stated the importance and the application of the neural network and then puts the emphasis on presenting the BP neural network that is widely used in many fields. In the second part, the author recommends the random fuzzy theory and gives some useful definition and theorem that will be used in the next part. In the part of this paper, the author put forward a new BP model based on the random fuzzy theory and gives the advantages of it.
Compactly supported wavelet and the numerical solution of the Vlasov equation
Authors: Yacine Benhadid
Venue: Journal of Applied Mathematics and Computing (2007)

A new scheme for solving the Vlasov equation using a compactly supported wavelets basis is proposed. We use a numerical method which minimizes the numerical diffusion and conserves a reasonable time computing cost. So we introduce a representation in a compactly supported wavelet of the derivative operator. This method makes easy and simple the computation of the coefficients of the matrix representing the operator. This allows us to solve the two equations which result from the splitting technique of the main Vlasov equation. Some numerical results are exposed using different numbers of wavelets.
CEDA Currents
Venue: IEEE Design Test (2007)

This newsletter covers news, research, and events related to the IEEE Council on Electronic Design Automation.
Reduction of Transmitted Information Using Similarities between Range Blocks in Fractal Image Coding
Authors: Xiaotong Hu, Shuping Qiu, Hideo Kuroda
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Fractal image coding uses the similarities between the best matching domain blocks and range blocks to reconstruct image. In the transmitted information, the information about the best matching domain blocks occupies a large percentage, so the reduction of information about the best matching domain blocks is the most effective method to reduce the quality of transmitted information. On the other hand, there are similarities between range blocks from each other. So, when range blocks are similar enough, we can reconstruct a range block by its similar range block, in other words, we can use the same domain block as their best matching domain block between similar range blocks. In this paper, we propose a method using similarities between the range blocks to reduce the position and affine information of the best matching domain blocks by sharing the same best matching domain block between similar range blocks.
Application of Punctured Turbo Codes in Distributed Video Coding
Authors: Linbo Qing, Xiaohai He, Rui Lv, Xiewei Deng
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Distributed video coding (DVC) is a new video coding paradigm derived from Slepian & Wolf's and Wyner & Ziv's information-theoretic results in 1970's. Turbo-code-based Wyner-Ziv codec provides a practical solution to lossy DVC schemes. It is able to provide good Rate distortion (RD) performance while shift complexity burden from encoder to decoder. In this paper, we proposed a pixel domain DVC system based on punctured turbo codes. The iterative decoding of turbo codes based on Maximum A Posterior (MAP) for DVC case is elaborated. Virtual channel model estimation is introduced to compute the a priori probabilities to be input to the turbo decoder. The experimental results presents significant gains compared to traditional intraframe coding paradigm. It is concluded that the proposed DVC system obtains better RD performance against previous similar works.
A Comparison of Techniques for Web Effort Estimation
Authors: Emilia Mendes
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

OBJECTIVE - The objective of this paper is to extend the work by Mendes [15], and to compare four techniques for Web effort estimation to identify which one provides best prediction accuracy. METHOD - We employed four effort estimation techniques - Bayesian networks (BN), forward stepwise regression (SWR), case-based reasoning (CBR) and Classification and regression trees (CART) to obtain effort estimates. The dataset employed was of 150 Web projects from the Tukutuku dataset. RESULTS - Results showed that predictions obtained using a BN were significantly superior to those using other techniques. CONCLUSIONS - A model that incorporates the uncertainty inherent in effort estimation, can outperform other commonly used techniques, such as those used in this study.
Detection and tracking using wireless sensor networks
Authors: Nadeem Ahmed, Yifei Dong, Tatiana Bokareva, Salil Kanhere, Sanjay Jha, Travis Bessell, Mark Rutten, Branko Ristic, Neil Gordon
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Target detection and tracking is a well-established area of research. However, a majority of proposed solutions in existing literature rely on expensive and specialized sensors, which often have limited coverage. Using low cost sensor nodes is an attractive and complementary approach to scalable target detection and tracking applications. However, tracking with low cost Wireless Sensor Network (WSN), presents its own challenges, namely real time decision making, high frequency sampling, multi-modal sensing, complex signal processing, and data fusion. In this work, we investigate the use of inexpensive off-the-shelf WSN devices for ground surveillance. Our system estimates and tracks a target based on the spatial differences of the target object's signal strength detected by the monitoring sensors at different locations.
Extended abstract: transition traversal coverage estimation for symbolic model checking
Authors: X. Xu, S. Kimura
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Model checking can exhaustively verify whether a system (implementation) satisfies a set of properties (formal specification). However, the completeness of the formal specification itself is not clear and needs to be evaluated. Several coverage estimation methods have been proposed for this issue. In this paper, we present a transition traversal coverage method for a subset of CTL. With this method, we can detect the transitions, which are not verified by any property. It is more accurate and comprehensive than the state coverage method.
Broadcast Feedback of Stochastic Cellular Actuators Inspired by Biological Muscle Control
Authors: Jun Ueda, Lael Odhner, H. Harry Asada
Venue: International Journal of Robotics Research (2007)

This paper presents a broadcast feedback approach to the distributed stochastic control of an actuator system consisting of many cellular units. This control architecture was inspired by skeletal muscles comprising a vast number of tiny functional units, called sarcomeres. The output of the actuator system is an aggregate e fect of numerous cellular units, each taking a bistable ON&#x2014;OFF state. A central controller &#x201C;broadcasts&#x201D; the error between the aggregate output and a reference input. Rather than ordering the individual units to take specific states, the central controller merely broadcasts the overall error signal to all the cellular units uniformly. In turn each cellular unit makes a stochastic decision with a state transition probability, which is modulated in relation to the broadcasted error. Stochastic properties of both open-loop and closed-loop control systems are analyzed. Stability conditions of the broadcast feedback system are obtained by using a stochastic Lyapunov function. The proposed method is simulated for an artificial cellular actuator, consisting of many segments of smart actuator material. Theoretical results are verified through simulation. It is demonstrated that, even in the absence of deterministic coordination, the ensemble of the cellular units can track a given trajectory stably and robustly.
On the correctness of the Krivine machine
Authors: Mitchell Wand
Venue: Higher-Order and Symbolic Computation (2007)

We provide a short proof of the correctness of the Krivine machine by showing how it simulates weak head reduction.