ppxscal/embedding_network huggingface dataset:
Synthesis of DSP soft real-time multiprocessor systems-on-silicon
Authors: D. Kirovski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The convergence of applications (Internet and embedded applications) and technology (reuse and very high integration level) trends resulted in a strong need for design of soft real-time DSP systems-on-silicon. We developed a new hierarchical modular approach for synthesis of area efficient soft real-time DSP systems-on-silicon. This synthesis strategy employs a number of optimization intensive scheduling, performance monitoring, and allocation steps. The backbone of the optimization approach is a novel online scheduling algorithm which uses meta-algorithmic techniques for on-the-fly heuristic selection and parameter tuning. Resource allocation refers to a predetermined lower-bound system performance, to perform a branch-and-bound resource allocation search for an area-efficient multiprocessor configuration where each processor has local instruction and data cache. In order to bridge the gap between the profiling, modeling, and synthesis tools of the two traditionally independent synthesis domains (architecture and CAD), we develop a new synthesis and evaluation platform which integrates the existing modeling, profiling, and simulation tools with the new developed system-level synthesis tools. The effectiveness of the approach is demonstrated on the industrial strength MediaBench benchmark suite.
The Impact of Negative Relations on Performance and Satisfaction in Group Work
Authors: Ling Xia, N. Sadat Shami, Y. Connie Yuan, Geri Gay
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper reports on a case study conducted to guide the design and implementation of a group support system. Network analysis of student self-reported interactions was conducted to obtain a better understanding of social relations, which are critical in informing the design of systems that support sociability. Building on previous research on group dynamics, the study examined the impact of negative relations and frequency of communication on performance and satisfaction among 13 groups of students. Results show that group members disliked by others were less likely to perform well; group members were less likely to feel satisfied with the group process when they disliked others; and frequent communication with others could make a person more likeable and help him/her perform better. We conclude by providing suggestions about how to incorporate findings from network analysis into the design of communication technologies to support group work.
An adaptive predictor for media playout buffering
Authors: P. DeLeon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Receiver playout buffers are required to smooth network delay variations for multimedia streams. Playout buffer algorithms such as those commonly used in the Internet, autoregressively measure the network delay and variation and adjust the buffer delay accordingly, to avoid packets arriving too late. In this work, we attempt to adjust the buffer delay based on a prediction of the network delay and a similar measure of variation. The philosophy here is that the use of an accurate prediction will adjust the buffer delay more effectively by tracking rapid fluctuations more accurately. Proper buffer delay can lead to either (or both) a lower total end-to-end delay for a fixed packet lateness percentage or fewer late packets for a fixed total end-to-end delay which are both important metrics for applications such as IP telephony. We present a playout algorithm based on a simple normalized least-mean-square (NLMS) adaptive predictor and demonstrate using Internet packet traces that it can yield reductions in average total end-to-end delays.
Building a table tennis game for three players
Authors: Florian 'Floyd' Mueller, Martin R. Gibbs
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Physical leisure activities such as table tennis provide healthy exercise and can offer a means to connect with others socially; however, players have to be in the same physical location to play. Networked computer games support players in geographically distant locations, but their communication channel is often limited to text or audio only. Furthermore, recent input devices that encourage exertion often do not support adequate force-feedback. We have developed a networked table tennis-like game that is played with a real paddle and ball, augmented with a large-scale videoconference. Similar to networked computer games, this concept can support more than two locations, while simultaneously aiming to provide similar benefits known from traditional physical leisure activity such as exercise, enjoyment and bringing people together to socialize.
Design of narrow-band Laguerre filters using a min-max criterion
Authors: S. S. Abeysekera
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

As an alternative to conventional FIR filters, IIR filter architecture based on orthonormal Laguerre functions is proposed for applications in narrow-band filtering. A Laguerre IIR filter design methodology is presented via a frequency transformation in the digital domain. The Laguerre filter can then be efficiently designed using a min-max criterion via a modified Parks-McClellan (1972) FIR filter design algorithm. The proposed Laguerre IIR filter architecture is easy to implement because it needs only a small number of components and therefore well suited for VLSI circuits. The impact of the selection of filter pole on the filter stability and phase linearity is discussed in the paper. The robustness issue of the narrow-band Laguerre IIR filter is also addressed.
VHDL-AMS modelling, simulation and testing of electrostatic micromotors
Authors: A. Endemano, J. Y. Fourniols, H. Camon, A. Marchese, S. Muratet
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A good agreement has been found between the proposed micromotor model simulation results and the collected experimental dat. A better understanding of friction modelling issues has also been achieved through iterative simulation. Developed VHDL-AMS blocks can be considered as an initial phase towards the creation of Intellectual property (IP) blocks for microsystems in general and electrostatic micromotors in particular, enabling MEMS disign reuse and exchange between different designer teams. These blocks can subsequently be used for high level simulation of different types of systems along with other electronic or mechanical blocks, all within the same standard framework provided by VHDL-AMS. Experimental data from the MUMPS fabricated wobble micromotors will be presented in a future along with their VDHL-AMS models.
Double-via-driven standard cell library design
Authors: Tsai-Ying Lin, Tsung-Han Lin, Hui-Hsiang Tung, Rung-Bin Lin
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Double-via placement is important for increasing chip manufacturing yield. Commercial tools and recent work have done a great job for it. However, they are found with a limited capability of placing more double vias (called vial) between metal 1 and metal 2. Such a limitation is caused by the way we design the standard cells and can not be resolved by developing better tools. This paper presents a double-via-driven standard cell library design approach to solving this problem. Compared to the results obtained using a commercial cell library, our library on average achieves 78% reduction in dead vias and 95% reduction in dead vials at the expense of 11% increase in total via count. We achieve these results (almost) at no extra cost in total cell area and wire length.
Application-Oriented Flow Control forWireless Sensor Networks
Authors: Jiong Jin, Wei-Hua Wang, Marimuthu Palaniswami
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper addresses flow control and resource allocation problem for heterogeneous wireless sensor networks which consist of diverse sensor types and applications. The performance of these applications, either elastic data collecting or real-time monitoring, is modelled as a utility function of the sensor source rate. The traditional optimal flow control approach, which requires the utility function to be strictly concave, is no longer applicable because of realtime applications involved. Therefore, we propose a new utility-based flow control framework that is able to allocate the resources (wireless channel usage and sensor node energy) efficiently and guarantee the application performance in a utility proportional or max-min fair manner. Furthermore, the optimization and convergence of the algorithm is examined in the paper as well.
A dynamically adaptive DSP for heterogeneous reconfigurable platforms
Authors: Fabio Campi, Antonio Deledda, Matteo Pizzotti, Luca Ciccarelli, Pierluigi Rolandi, Claudio Mucci, Andrea Lodi, Arseni Vitkovski, Luca Vanzolini
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper describes a digital signal processor based on a multi-context, dynamically reconfigurable datapath, suitable for inclusion as an IP-block in complex SoC design projects. The IP was realized in CMOS 090 nm technology. The most relevant features offered by the proposed architecture with respect to state of the art are zero over head for switching between successive configurations, relevant area and energy computational density on computational kernels (average of 2 GOPS/mm2, 0.2GOPS/mW) and relatively small area occupation (18 mm2), making it suitable for acceleration or upgrade of multi-core heterogeneous embedded platforms. The processor is delivered with a software tool chain providing the application developer algorithmic analysis and design space exploration based on ANSI C, with no utilization of hardware-related constructs or description languages.
New perspectives for maximum-likelihood parameter and time delay estimation using two channels
Authors: J. A. Stuller
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper introduces a new realization for maximum likelihood parameter and time-delay estimation using two channels. We obtain the result by using coupled Karhunen-Loeve expansions to derive the likelihood function. The new realization illuminates the analytical relationship between maximum likelihood time-delay estimation and other methods. Experimental results that support the theoretical findings are included.
Prefix Computation on a Faulty Hypercube
Authors: C. S. Raghavendra, M. A. Sridhar, S. Harikumar
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The fundamental question addressed in this paper is that of computing the parallel prefix operation. In particular, we study the problem of performing such an operation in an n-dimensional SIMD hypercube, Q_n, with up to n-1 node faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. We exhibit an n+5 logn algorithm for this problem. The development of the algorithm is based on the existence of two so-called free dimensions in such a faulty hypercube [6].
HotWire: a visual debugger for C++
Authors: Chris Laffra, Ashok Malhotra
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

We argue that visualization is essential in a modern debugger. Instead of inserting debug statements throughout the code, it should be possible to easily define visualizations while running the program under control of the debugger, resulting in what might be called "visual printf's". A visualization of a C++ program can provide exciting insights. Bugs that cannot be found that easily with non-visual techniques are now found, just by watching the visualizations. However, the mechanisms to define the visualizations should be easy to understand, easy to apply and cause only minimal overhead to the programmer (who is the end-user of the visual debugger). HotWire is not only equipped with a couple of standard visualizations, but also with a small declarative script language (using constraints) that can be used to define new custom visualizations. This paper addresses user interface aspects of debugging tools. Specifically, the user interface of HotWire, a debugger for C++ and SmallTalk on AIX and OS/2 is described.
Suitability of Object and Aspect Oriented Languages for Software Maintenance
Authors: Khalid Al-Jasser, Peter Schachte, Ed Kazmierczak
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Program maintenance is an important and frequently a difficult part of the software life cycle. One reason for its difficulty is the presence of crosscutting concerns: aspects of a program that cannot be confined to a single program component. Crosscutting concerns defy the standard wisdom of program design that individual components should be highly cohesive (they should address only one concern) and loosely coupled (they should not share concerns with other components). We consider several approaches to a simple maintenance task in both object-oriented and aspect-oriented languages, analyzing how well they maintain high cohesion and low coupling. We conclude that none of these approaches is entirely satisfactory, and present a few changes to aspect oriented programming language design that would better support maintenance in the face of crosscutting concerns.
Novel techniques in genetic programming
Authors: Borko Furht
Venue:  (2006)

Three major problems make Genetic Programming unfeasible or impractical for real world problems. The first is the excessive time complexity. In nature the evolutionary process can take millions of years, a time frame that is clearly not acceptable for the solution of problems on a computer. In order to apply Genetic Programming to real world problems, it is essential that its efficiency be improved. The second is called overfitting (where results are inaccurate outside the training data). In a paper [36] for the Federal Reserve Bank, authors Neely and Weller state "a perennial problem with using flexible, powerful search procedures like Genetic Programming is overfitting, the finding of spurious patterns in the data. Given the well-documented tendency for the genetic program to overfit the data it is necessary to design procedures to mitigate this." The third is the difficulty of determining optimal control parameters for the Genetic Programming process. Control parameters control the evolutionary process. They include settings such as, the size of the population and the number of generations to be run. In his book [45], Banzhaf describes this problem, "The bad news is that Genetic Programming is a young field and the effect of using various combinations of parameters is just beginning to be explored." We address these problems by implementing and testing a number of novel techniques and improvements to the Genetic Programming process. We conduct experiments using data sets of various degrees of difficulty to demonstrate success with a high degree of statistical confidence.
Deep Submicron Technology: Opportunity or Dead End for Dynamic Circuit Techniques
Authors: Claas Cornelius, Frank Grassert, Siegmar Koppe, Dirk Timmermann
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Dynamic circuit techniques offer potential advantages over static CMOS, especially if more complex logic is to be implemented. Therefore, they are extensively used in high performance designs to speed up critical subsystems. However, the speed benefit is traded off for increased power consumption, area overhead, design effort, and reduced noise margins. The continuing process of technology scaling raises further concerns of reliability and limits the wide use of dynamic logic. This paper presents evaluations in terms of area, power dissipation, and propagation delay for several dynamic logic styles as well as for static CMOS in a 90 nm technology. The intention is to assess if dynamic circuit techniques are still an option to boost performance against the background of the issues of nanotechnology. Moreover, issues of reliability and signal integrity, gained from practical experience for different testbenches, and possible solutions are discussed. Finally, an automated design flow for dynamic logic, derived from a standard CMOS flow, is presented.
A generalized lattice decoder for asymmetrical space-time communication architecture
Authors: M. O. Damen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We present a generalized sphere decoding (GSD) algorithm and its application for detecting information symbols in the case where one has a system with more inputs (symbols) than outputs or the opposite situation. We study the special case of a multi-antenna scenario in a cellular system with N antennas at the mobile and M/spl ges/N antennas at the base station. GSD reaches the maximum likelihood (ML) performance for both up and down link with a moderate complexity.
A wavelength sensor using a structure of curved optical waveguide
Authors: R. Panthasa, S. Khuntaweetep, S. Somkuarnpanit
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper proposes a wavelength sensor using a section of the curved optical waveguide. The finite-difference time-domain (FDTD) is used in the analysis of the field intensity of the light propagating thorough the structure. The device with a width of 0.6 /spl mu/m and a thickness of 0.6 /spl mu/m provides the maximum light transmission. At the particular curve radius of 3 /spl mu/m, the structure could be employed to measure the communication wavelength, in this case in a range between 1520 and 1580 nm, with the correlation factor of 99.82%. The wide band of wavelengths could possibly be done using a number of wavelength-sensing modules for the required bands. Therefore, it could be employed as a wavelength sensing device for most optical communications, optoelectronics, laser applications.
Towards fingerpointing in the Emulab dynamic distributed system
Authors: Michael P. Kasick, Priya Narasimhan, Kevin Atkinson, Jay Lepreau
Venue: Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems - Volume 3 (2006)

In the large-scale Emulab distributed system, the many failure reports make skilled operator time a scarce and costly resource, as shown by statistics on failure frequency and root cause. We describe the lessons learned with error reporting in Emulab, along with the design, initial implementation, and results of a new local error-analysis approach that is running in production. Through structured error reporting, association of context with each error-type, and propagation of both error-type and context, our new local analysis locates the most prominent failure at the procedure, script, or session level. Evaluation of this local analysis for a targeted set of common Emulab failures suggests that this approach is generally accurate and will facilitate global fingerpointing, which will aim for reliable suggestions as to the root-cause of the failure at the system level.
Opportunities of Today's ICT Technologies for Support of Education and Training in Radiology
Authors: Petr Krupa, Michal Javornik, Otto Dostal
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The DICOM-based teaching archive was established by the Medical Faculty and Institute of Computer Science of the Masaryk University in Brno, Czech Republic. In fact, the teaching archive is a full PACS system working with anonymized patients´ imaging studies. The supportive technology was developed in cooperation of Institute of Computer Science of Masaryk University and TatraMed company within the MeDiMed(Metropolitan Digital Imaging in Medicine) project. Individual studies are encoded by a chain of keywords based on diagnosis and thus enable several levels of searching possibilities. The clinical cases can be sent directly from local PACS with little effort and can be viewed in any DICOM viewer and/or manipulated on any connected workstation. At this time being, the database of anonymized image studies is available to certified members at the University teaching institutions only and on parallel network, mainly because of security and sufficient bandwidth availability reasons. Beside the database of normal and pathologic findings, the technology is also planned to become part of the electronic library system with direct use within the e-publications and other teaching materials published by the University. Copyright of the archive and individual authors who submitted the cases must be observed.
Light Dialectica Program Extraction from a Classical Fibonacci Proof
Authors: Mircea-Dan Hernest
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof is available in MinLog's library of examples. The term of Godel's T extracted by the LDI is, after strong normalization, exactly the usual recursive algorithm which defines the Fibonacci numbers (in pairs). This outcome of the Light Dialectica meta-algorithm is much better than the T-program extracted by means of the pure Godel Dialectica Interpretation. It is also strictly less complex than the result obtained by means of the refined A-translation technique of Berger, Buchholz and Schwichtenberg on an artificially distorted variant of the input proof, but otherwise it is identical with the term yielded by Berger's Kripke-style refined A-translation. Although syntactically different, it also has the same computational complexity as the original program yielded by the refined A-translation from the undistorted input classical Fibonacci proof.
Forecasting Asia Pacific Mobile Market Trends Using Regression Analysis
Authors: Leijia Wu, Kumbesan Sandrasegaran
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

This paper forecasts Asia Pacific mobile market trends by observing growth trends of GSM and UMTS user numbers. Regression analysis is selected as the forecasting tool. It is predicted that both of the GSM and UMTS markets in Asia Pacific will keep experiencing an exponential growth. However, the growth rate for GSM will be relatively stable while the one for UMTS will gradually decrease. The share of Asia Pacific GSM market will be relatively steady while the share of Asia Pacific UMTS market will slowly go down in the next couple of years. In the near future, GSM will still occupy the largest market share in the mobile world. In Asia Pacific, the coming of the 3G era will be later than the rest of the world. It is expected that the GSM subscriber number will reach to about 1.5 billion in Asia Pacific by the end of 2008.
Using FreeBSD for a console server
Authors: Branson Matheson
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Managing serial consoles for multiple servers has always been a challenging problem for system administrators. Finding the space and right layout for the multitudes of terminals is difficult. There is no remote connectivity or security besides the access in the computer room. Any important events that are logged to the console are lost or difficult fo find in the fanfold paper for printing terminals. A console server can aleviate these problems and provide other services that make it a cost effective and reliable solution.