ppxscal/embedding_network huggingface dataset:
An overview of a compiler for mapping software binaries to hardware
Authors: Gaurav Mittal, David Zaretsky, Xiaoyong Tang, Prith Banerjee
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

AS new applications in embedded communications and control systems push the computational limits of digital signal processing (DSP) functions, there will be an increasing need for software applications to be migrated to hardware in the form of a hardware-software codesign system. In many cases, access to the high-level source code may not be available. It is thus desirable to have a technology to translate the software binaries intended for processors to hardware implementations. This paper provides details on the retargetable FREEDOM compiler. The compiler automatically translates DSP software binaries to register-transfer level (RTL) VHDL and Verilog for implementation on field-programmable gate arrays (FPGAs) as standalone or system-on-chip implementations. We describe the underlying optimizations and some novel algorithms for alias analysis, data dependency analysis, memory optimizations, procedure call recovery, and back-end code scheduling. Experimental results on resource usage and performance are shown for several program binaries intended for the Texas Instruments C6211 DSP (VLIW) and the ARM 922T reduced instruction set computer (RISC) processors. Implementation results for four kernels from the Simulink demo library and others from commonly used DSP applications, such as MPEG-4, Viterbi, and JPEG are also discussed. The compiler generated RTL code is mapped to Xilinx Virtex II and Altera Stratix FPGAs. We record overall performance gains of 1.5-26.9 × for the hardware implementations of the kernels. Comparisons with the power aware compiler techniques (PACT) high-level synthesis compiler are used to show that software binaries can be used as intermediate representations from any high-level language and generate efficient hardware implementations.
An annotated bibliography on guaranteed graph searching
Authors: Fedor V. Fomin, Dimitrios M. Thilikos
Venue: Theoretical Computer Science (2008)

Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In this annotated bibliography, we give an elementary classification of problems and results related to graph searching and provide a source of bibliographical references on this field.
Robust Routing
Authors: Himanshu Agrawal, Andrew Jennings, Mark Gregory, Daud Channa
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In a network, traffic demands are known with a degree of uncertainty, traffic engineering should take into account the traffic variability. In this research work we focus on the robust routing under changing network conditions. Daily internet traffic pattern shows that network is vulnerable to malicious attacks, denial of service attacks, worms and viruses. Oblivious routing has a substantially better performance than Open Shortest Path First [OSPF] routing for different level of uncertainty. We propose a theoretical framework for Robust Routing aiming to improve online and offline traffic engineering approaches.
Trust-region interior-point method for large sparse l1 optimization
Authors: L. Luksan, C. Matonoha, J. Vlcek
Venue: Optimization Methods Software (2007)

In this article, we propose an interior-point method for large sparse l1 optimization. After a short introduction, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus, relatively difficult l1 optimization problems can be solved successfully. The results of computational experiments given in this article confirm efficiency and robustness of the proposed method.
COVER STORYToto, I've got a feeling we're not in Kansas anymore&hellip;
Authors: Meredith Davis
Venue: interactions (2008)

Editor's Note: Meredith's critique---adapted from her opening keynote address of the 2008 AIGA Massaging Media 2 conference---speaks to design education beyond the boundaries of graphic design. Our thanks to Hugh Dubberly for bringing her speech to our attention.
Challenges in Certification and Accreditation
Authors: Ken Buszta
Venue: IT Professional (2008)

To keep clients' data secure, businesses must stay abreast of certification and accreditation (C&A), particularly when faced with complex, changing, and sometimes contradictory governmental requirements.
Improved certificate-based encryption in the standard model
Authors: David Galindo, Paz Morillo, Carla Rífols
Venue: Journal of Systems and Software (2008)

Certificate-based encryption has been recently proposed as a means to simplify the certificate management inherent to traditional public key encryption. In this paper, we present an efficient certificate-based encryption scheme which is fully secure in the standard model. Our construction is more efficient (in terms of computational cost and ciphertext size) than any of the previous constructions known without random oracles.
A change detection model for credit card usage behavior
Authors: Chieh-Yuan Tsai, Jing-Chung Wang, Chih-Jung Chen
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In recent year, credit card has been one of the most attractive financial products all over the world. The magnificent increase in credit card market leads card issuers put more attentions on how to understand their customers. This research proposes a detection model to identify usage behavior change patterns of credit card customers in two time periods. In the model, customer profiles and purchase transactions of two time periods are retrieved from card issuer databases. Then, a usage behavior rule set for each time period is generated using Apriori association rule algorithm. Finally, significant usage behavior change patterns are identified through rule set comparison using defined similarity and difference measures. The proposed model has been successfully implemented using real credit card data provided by a commercial bank in Taiwan. Several marketing strategies are suggested according the analysis finding. With the proposed model, card issuers can detect critical usage behavior changes and allocate their limited resource to establish suitable marketing strategy for their customers.
A classification method based on generalized eigenvalue problems
Authors: M. R. Guarracino, C. Cifarelli, O. Seref, P. M. Pardalos
Venue: Optimization Methods Software (2007)

Binary classification refers to supervised techniques that split a set of points in two classes, with respect to a training set of points whose membership is known for each class. Binary classification plays a central role in the solution of many scientific, financial, engineering, medical and biological problems. Many methods with good classification accuracy are currently available. This work shows how a binary classification problem can be expressed in terms of a generalized eigenvalue problem. A new regularization technique is proposed, which gives results that are comparable to other techniques in use, in terms of classification accuracy. The advantage of this method relies in its lower computational complexity with respect to the existing techniques based on generalized eigenvalue problems. Finally, the method is compared with other methods using benchmark data sets.
Using Black-Box Modeling Techniques for Modern Disk Drives Service Time Simulation
Authors: José Daniel Garcia, Laura Prada, Javier Fernandez, Alberto Nuñez, Jesus Carretero
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

One of the most common techniques to evaluate the performance of a computer I/O subsystem performance has been found on detailed simulation models including specific features of storage devices like disk geometry, zone splitting, caching, read-ahead buffers and request reordering. However, as soon as a new technological innovation is added, those models need to be reworked to include new devices making difficult to have general models up to date. Another alternative is modeling a storage device as a black-box probabilistic model, where the storage device itself, its interface and the interconnection mechanisms are modeled as a single stochastic process, defining the service time as a random variable with an unknown distribution. This approach allows generating disk service times needing less computational power by means of a variate generator included in a simulator. This approach allows to reach a greater scalability in the I/O subsystems performance evaluation by means of simulation. In this paper, we present a method for building a variate generator from service time experimental data. In order to build the variate generator, both real workloads and synthetic workloads may be used. The workload is used to feed the evaluated disk to obtain service time measurements. From experimental data we build a variate generator that fits the disk service times distribution. We also present a use case of our method, where we have obtained a relative error ranging from 0.45% to 1%.
EVector: An efficient vector implementation - Using virtual memory for improving memory
Authors: Dries Kimpe, Stefan Vandewalle, Stefaan Poedts
Venue: Scientific Programming (2006)

Every modern operating system provides some form of virtual memory to its applications. Usually, a hardware memory management unit (MMU) exists to efficiently support this. Although most operating systems allow user programs to indirectly control the MMU, few programs or programming languages actually make use of this facility. This article explores how the MMU can be used to enhance memory handling for resizable arrays. A reference implementation in C++ demonstrates its usability and superiority compared to the standard C++ vector class, and how to combine the scheme with an object-oriented environment. A number of other improvements, based on newly emerged insights in C++ are also presented.
Spectral Semi-discretisations of Weakly Non-linear Wave Equations over Long Times
Authors: E. Hairer, C. Lubich
Venue: Foundations of Computational Mathematics (2008)

The long-time behaviour of spectral semi-discretisations of weakly non-linear wave equations is analysed. It is shown that the harmonic actions are approximately conserved for the semi-discretised system as well. This permits to prove that the energy of the wave equation along the interpolated semi-discrete solution remains well conserved over long times and close to the Hamiltonian of the semi-discrete equation. Although the momentum is no longer an exact invariant of the semi-discretisation, it is shown to be approximately conserved. All these results are obtained with the technique of modulated Fourier expansions.
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
Authors: Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide efficient implementations of such algorithms one need to be careful with the underlying arithmetic. It is well known that modular techniques such as the Chinese remainder algorithm or the p-adic lifting allow very good practical performance, especially when word size arithmetic is used. Therefore, finite field arithmetic becomes an important core for efficient exact linear algebra libraries. In this article, we study high performance implementations of basic linear algebra routines over word size prime fields: especially matrix multiplication; our goal being to provide an exact alternate to the numerical BLAS library. We show that this is made possible by a careful combination of numerical computations and asymptotically faster algorithms. Our kernel has several symbolic linear algebra applications enabled by diverse matrix multiplication reductions: symbolic triangularization, system solving, determinant, and matrix inverse implementations are thus studied.
Handbook of Data Visualization (Springer Handbooks of Computational Statistics), 1 edition
Authors: Chun-houh Chen, Wolfgang Hrdle, Antony Unwin, Chun-houh Chen, Wolfgang Hrdle, Antony Unwin
Venue:  (2008)

Visualizing the data is an essential part of any data analysis. Modern computing developments have led to big improvements in graphic capabilities and there are many new possibilities for data displays. This new volume in the series Springer Handbooks of Computational Statistics gives an overview of modern data visualization methods, both in theory and practice. There are definitive chapters on modern graphical tools such as mosaic plots, parallel coordinate plots and linked views. There are chapters dedicated to graphical methodology for particular areas of statistics, for example Bayesian analysis, genomic data and cluster analysis, as well as chapters on software for graphics. Specialists from all over the world have contributed papers on their areas of expertise.
On Birnbaum-Saunders inference
Authors: Audrey H. M. A. Cysneiros, Francisco Cribari-Neto, Carlos A. G. Araújo,  Jr.
Venue: Computational Statistics Data Analysis (2008)

The Birnbaum-Saunders distribution, also known as the fatigue-life distribution, is frequently used in reliability studies. We obtain adjustments to the Birnbaum-Saunders profile likelihood function. The modified versions of the likelihood function were obtained for both the shape and scale parameters, i.e., we take the shape parameter to be of interest and the scale parameter to be of nuisance, and then consider the situation in which the interest lies in performing inference on the scale parameter with the shape parameter entering the modeling in nuisance fashion. Modified profile maximum likelihood estimators are obtained by maximizing the corresponding adjusted likelihood functions. We present numerical evidence on the finite sample behavior of the different estimators and associated likelihood ratio tests. The results favor the adjusted estimators and tests we propose. A novel aspect of the profile likelihood adjustments obtained in this paper is that they yield improved point estimators and tests. The two profile likelihood adjustments work well when inference is made on the shape parameter, and one of them displays superior behavior when it comes to performing hypothesis testing inference on the scale parameter. Two empirical applications are briefly presented.
Technology exploration for graphene nanoribbon FETs
Authors: Mihir Choudhury, Youngki Yoon, Jing Guo, Kartik Mohanram
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Graphene nanoribbon FETs (GNRFETs) are promising devices for beyond-CMOS nanoelectronics because of their excellent carrier transport properties and potential for large scale processing and fabrication. This paper combines atomistic quantum transport modeling with circuit simulation to perform technology exploration for GNRFET circuits. A quantitative study of the effects of variations and defects on the performance and reliability of GNRFET circuits is also presented. Simulation results indicate that whereas GNRFET circuits promise higher performance, lower energy consumption, and comparable reliability at similar operating points to scaled CMOS circuits, they are more susceptible to variations and defects. The results also motivate significant engineering, modeling, and simulation challenges facing the device and CAD communities involved in graphene electronics research.
On the scalability of IEEE 802.11 ad-hoc-mode timing synchronization function
Authors: Dong Zhou, Lifei Huang, Ten H. Lai
Venue: Wireless Networks (2008)

The IEEE 802.11 standards support the peer-to-peer mode Independent Basic Service Set (IBSS), which is an ad hoc network with all its stations within each other's transmission range. In an IBSS, it is important that all stations are synchronized to a common clock. Synchronization is essential for the MAC layer power management. Also, if frequency hopping spread spectrum is used in the physical layer, synchronization is needed to ensure that all stations "hop" at the same time. This paper evaluates the synchronization mechanism as specified in the IEEE 802.11 standards. Through rigorous analysis, it is shown that when the number of stations in an IBSS is not very small, there is a non-negligible probability that stations may get out of synchronization. The more stations, the higher probability of asynchronism. In this sense, the current IEEE 802.11 synchronization algorithm does not scale; it cannot support a large-scale IBSS.To alleviate the asynchronism problem, this paper proposes a simple remedy to the 802.11 algorithm. The resulting algorithm enjoys many nice properties--it is compatible, scalable, effective, mobility-friendly and simple. We are able to exceed the industry expectation of time accuracy (maximum clock offset under 12 µs) without any change of beacon format.
Evaluation of automatic mobile playlist generator
Authors: Arto Lehtiniemi, Jarno Seppänen
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Mobile music consumption is increasing and many of the current mobile phones already offer music listening capabilities. Still, most of the current automatic playlist generation systems do not function in the mobile domain. This paper presents an evaluation of a content-based prototype mobile playlist generator. A user study was conducted to find out the quality and performance of our content-based automatic playlist generation engine from the user's perspective. In addition, possible benefits, usage scenarios, and future improvements are covered in this study, to support further development. There were 30 test subjects taking part in the usability study consisting of individual interviews and a trial. The overall performance of the automatic playlist generator satisfied 90% of the test subjects and they would like to use such system. Still, there are many improvements and new design ideas to take into account in further development to gain even better user acceptance and performance. These development ideas include e.g. getting rid of the most unsuccessful recommendations, providing option to group similar artists on the playlists and adding support for new ways of creating playlists by utilizing multiple seed songs.
MedSMan: a live multimedia stream querying system
Authors: Bin Liu, Amarnath Gupta, Ramesh Jain
Venue: Multimedia Tools and Applications (2008)

Querying live media streams is a challenging problem that is becoming an essential requirement in a growing number of applications. Research in multimedia information systems has addressed and made good progress in dealing with archived data. Meanwhile, research in stream databases has received significant attention for querying alphanumeric symbolic streams. The lack of a data model capable of representing different multimedia data in a declarative way, hiding the media heterogeneity and providing reasonable abstractions for querying live multimedia streams poses the challenge of how to make the best use of data in video, audio and other media sources for various applications. In this paper we propose a system that enables directly capturing media streams from sensors and automatically generating more meaningful feature streams that can be queried by a data stream processor. The system provides an effective combination between extendible digital processing techniques and general data stream management research. Together with other query techniques developed in related data stream management streams, our system can be used in those application areas where multifarious live media senors are deployed for surveillance, disaster response, live conferencing, telepresence, etc.
A Model Driven Approach to Automate the Implementation of Clinical Guidelines in Decision Support Systems
Authors: Ivan Porres, Eladio Domínguez, Beatriz Pérez, Áurea Rodríguez, María A. Zapata
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Clinical guidelines and protocols are used to aid decision making in health care. This paper presents a modelbased approach to the development of decision support systems for clinical guidelines. The guidelines are modelled using the UML State chart language and the final system is automatically generated using an automated model transformation. Our approach is illustrated with a Spanish clinical guideline developed on the basis of a guideline published by the well-known National Guideline Clearing House (NGC).
Perceptibility and utility of sticky targets
Authors: Regan L. Mandryk, Carl Gutwin
Venue: Proceedings of graphics interface 2008 (2008)

Researchers have suggested that dynamically increasing control-to-display (CD) gain can assist in targeting, by increasing the effective width of targets in motor space, which makes targets feel sticky. Although this method has been shown to be effective, there are several unexplored issues that could affect its use in real-world interfaces. One of these is perceptibility: in particular, the difference between the perceptibility and the utility of the technique. If CD gain changes are highly noticeable even at levels that are not helpful, the technique could be seen as overly intrusive. If CD gain changes are more useful than noticeable, however, the technique could be applied more widely. To explore this issue, we carried out a study that tested both the utility and the perceptibility of CD gain in single-target selection tasks. We found that although even small amounts of gain reduction significantly improved targeting times, participants did not consistently notice the effect until the gain difference was much higher. Our results provide new understanding of how changes in CD gain are experienced by users, and provide initial evidence to suggest that sticky targets can benefit users without a high perceptual cost.
Enhancing User-Service Interaction through a Global User-Centric Approach to SOA
Authors: Javier Soriano, David Lizcano, Juan J. Hierro, Marcos Reyes, Christoph Schroth, Till Janner
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Considered as enablers of seamless application-to-application integration both within company boundaries and on a global scale, Web Services-based SOAs have traditionally focused on automating service-to-service collaboration. However, they have never featured a "face" to human users. This gap between human users and services still prevents enterprises from realizing how innovations at the SOA front-end help to make people more productive. And, ultimately, it hinders the emergence of a real Web of Services driven by a global, user-centric SOA. In this paper, we revisit the notion of SOA and analyze its major shortcomings with regard to the emergence of a Web of Services enhancing user-service interaction and increased service usability. We then elaborate on novel, currently emerging technologies that facilitate the establishment of the global mesh of interoperable user-centric services. A novel platform architecture is presented that builds on all the key technical enablers.
Dynamic phase transitions in Korteweg fluids
Authors: M. Affouf
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

We describe the qualitative behavior of traveling wave solutions for thermodynamic phase transitions under Landau equation of state and Korteweg's theory of capillarity.