ppxscal/embedding_network huggingface dataset:
A graphical microcomputer simulator for classroom use
Authors: C. W. Caldwell, D. L. Andrews, S. S. Scott
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Educational aids for microprocessor courses are typically either hardware trainers or software simulators. The former enable the student to observe the details of I/O interfacing, but tend to be costly, at least to duplicate for many students, and provide only a limited view of the internal operations of the microprocessor. While more cost-effective, the latter are usually limited to displaying hexadecimal values written to I/O addresses with regard to peripheral interfacing. This paper describes a software simulator which illustrates microprocessor operation utilizing a graphical format designed for a PC-DOS platform. The simulator displays the registers and buses of a Motorola 6800 microprocessor. Instructions can be executed on a per-cycle or per-instruction (single-step) basis, with the bus logic values and register contents graphically changing at each step. A one-line assembler is available for writing programs into the 8 kByte RAM. In addition, an R6522 Versatile Interface Adapter (VIA) is also displayed. User-selectable peripherals include a hex keypad, 7-segment displays and an A/D converter. Online help screens are easily accessed. We have employed this simulator in our classes for two semesters and have found that students are able to learn it very quickly. It is an excellent tool for observing the details of microprocessor operation and interfacing to common peripherals.
Dynamic parameter optimization of evolutionary computation for on-line prediction of time series with changing dynamics
Authors: Y. M. Chen, Chun-Ta Lin
Venue: Applied Soft Computing (2007)

This paper introduces a dynamic evolving computation system (DECS) model, for adaptive on-line learning, and its application for dynamic time series prediction. DECS evolve through evolving clustering method and evolutionary computation for structure learning, Levenberg-Marquardt method for parameter learning, learning and accommodate new input data. DECS is created and updated during the operation of the system. At each time moment the output of DECS is calculated through a knowledge rule inference system based on m-most activated fuzzy rules which are dynamically chosen from a fuzzy rule set. An approach is proposed for a dynamic creation of a first order Takagi-Sugeno type fuzzy rule set for the DECS model. The fuzzy rules can be inserted into DECS before, or during its learning process, and the rules can also be extracted from DECS during, or after its learning process. It is demonstrated that DECS can effectively learn complex temporal sequences in an adaptive way and outperform some existing models.
Meeting performance goals with the HP-UX workload manager
Authors: Indira Subramanian, Cliff McCarthy, Michael Murphy
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

The HP-UX Workload Manager helps workloads meet user-specified performance goals by dynamically adjusting their access to resources such as CPU. We implemented this workload manager as a part of a feedback control system, using existing resource control and performance instrumentation infrastructure.
Robust envelope-constrained filter design with Laguerre bases
Authors: C. H. Tseng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The envelope-constrained filtering problem is concerned with the design of a filter such that the noise enhancement is minimized while the noiseless filter response stays within an envelope. Naturally, the optimum filter response to the prescribed input signal tends to touch the output boundaries at some points. Consequently, any disturbance to the prescribed input signal could result in the output constraints being violated. In this paper, we formulate a semi-infinite constrained optimization problem in which the margin of the constraint robustness of the filter is maximized. Using a smoothing technique, it is shown that the solution of the optimization problem can be obtained by solving a sequence of strictly convex optimization problems with integral cost.
A 333-MHz dual-MAC DSP architecture for next-generation wireless applications
Authors: R. K. Kolagotla
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We introduce the first DSP core developed at the Analog Devices and Intel Joint DSP Development Center. The 16-bit fixed-point core combines some of the best features of traditional DSPs and micro-controllers and compares favorably with dual-MAC DSPs on DSP specific benchmarks and with micro-controllers on micro-controller specific benchmarks. In addition, the core supports a rich set of alignment independent packed byte instructions to enable an efficient implementation of 3G algorithms in next-generation wireless applications. The deep and fully interlocked pipeline allows the core to run at 333-MHz in the 0.18-/spl mu/m TSMC process.
TESLA: a transparent, extensible session-layer architecture for end-to-end network services
Authors: Jon Salz, Alex C. Snoeren, Hari Balakrishnan
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

Session-layer services for enhancing functionality and improving network performance are gaining in importance in the Internet. Examples of such services include connection multiplexing, congestion state sharing, application-level routing, mobility/migration support, and encryption. This paper describes TESLA, a transparent and extensible framework allowing session-layer services to be developed using a high-level flow-based abstraction. TESLA services can be deployed transparently using dynamic library interposition and can be composed by chaining event handlers in a graph structure. We show how TESLA can be used to implement several session-layer services including encryption, SOCKS, application-controlled routing, flow migration, and traffic rate shaping, all with acceptably low performance degradation.
A new method for detection of watermarks in geometrically distorted images
Authors: I. B. Ozer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The goal of this study is to investigate the performance of the watermarking scheme proposed by Ramkumar and Akansu (see IEEE Trans. on Multimedia, 1999) for watermarked images distorted by geometrical attacks such as StirMark. Although the geometric distortions are not visually noticeable, the watermark cannot be detected due to the resulting high mean square error between the original and attacked images. In order to extract the watermark from distorted images, the effects of these attacks must be minimized. This work focuses on the recovery of an attacked image using a reliable distortion estimation. The performance test is studied for several images attacked by StirMark. The proposed algorithm is shown to reduce false alarm probability in detection of the watermark from about 0.005 for (for StirMarked images) to less than 10/sup -50/.
Concurrent Logic and Automata Combined: A Semantics for Components
Authors: J. K. F. Bowles, S. Moschoyiannis
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as understood in component-based software development. Here, a component-based system consists of several interacting components whereby each component manages calls to and from the component using ports to ensure encapsulation. Further, a component can be complex and made of several simpler interacting components. When a complex component receives a request through one of its ports, the port delegates the request to an internal component. Our logic allows us to describe the different views we can have on the system. For example, the overall component interactions, whether they occur sequentially, simultaneously or in parallel, and how each component internally manages the received requests (possibly expressed at different levels of detail). Using concurrent automata as an underlying formalism we guarantee that the expressiveness of the logic is preserved in the model. In future work, we plan to integrate our truly-concurrent approach into the Edinburgh Concurrency Workbench.
More experiences with Microsoft PROJECT in senior design classes
Authors: T. W. Schultz
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

An update is given on experiences with the use of project scheduling software in a sequence of design classes. In addition to reviewing a previous approach (T.W. Schultz, 1994), it describes new steps taken to improve the student acceptance of the software. The initial learning process has been eased by "Cue Cards" included in the new version of PROJECT. Student acceptance has improved remarkably. The PERT chart has become unnecessary since task dependencies can now be shown directly on the Gantt chart. Homework to teach the concepts of tasks, dependencies, and scheduling now precedes the introduction of the software. This develops a clearer idea of task and scheduling concepts so the software becomes a simple tool rather than an inflexible master. Requiring weekly tracking Gantt charts increases the students' perception of the software's value. The paper concludes with fresh student comments and plans for future changes and improvements.
A periscope for mobile discovery and narrative
Authors: Eric A. Kabisch
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Datascape is a periscope device that allows its operator to view invisible data about the surrounding city. As the user travels through geographic space, they simultaneously explore a 3D virtual topography built from invisible datasets, such as demographic marketing segmentation. As they explore the city, they control a dynamic soundtrack that is generated from local data including the "listening preferences" of the surrounding community. A typical commute or drive around town is turned into a sonic and visual exploration of hidden narratives that surround us and envelop the city.
Signal selective DOA tracking for multiple moving targets
Authors: J. Riba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A new algorithm for signal selective tracking of the directions-of-arrival (DOAs) of multiple moving targets with an array of passive sensors is presented. A new method based on the principles of maximum likelihood estimation and cyclostationarity is used to generate initial angle estimates which, in turn, are refined by a Kalman filter. Source angle dynamics are used to achieve correct data association. High performance is obtained with relatively low computational complexity.
Implications of glottal source for speaker and dialect identification
Authors: L. R. Yanguas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this paper we explore the importance of speaker specific information carried in the glottal source. We time align utterances of two speakers speaking the same sentence from the TIMIT database of American English. We then extract the glottal flow derivative from each speaker and interchange them. Through time alignment and this glottal flow transformation, we can make a speaker of a northern dialect sound more like his southern counterpart. We also time align the utterances of two speakers of Spanish dialects speaking the same sentence and then perform the glottal waveform transformation. Through these processes a Peruvian speaker is made to sound more Cuban-like. From these experiments we conclude that significant speaker and dialect specific information, such as noise, breathiness or aspiration, and vocalization, is carried in the glottal signal.
Fault-Tolerant Reliable Delivery of Messages in Distributed Publish/Subscribe Systems
Authors: Shrideep Pallickara, Hasan Bulut, Geoffrey Fox
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Reliable delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable reliable delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, reliable delivery guarantees will be met even if N-1 repositories fail.
Audio-guided video based face recognition
Authors: Xiaoou Tang
Venue:  (2006)

Face recognition is one of the most challenging computer vision research topics since faces appear differently even for the same person due to expression, pose, lighting, occlusion and many other confounding factors in real life. During the past thirty years, a number of face recognition techniques have been proposed. However, all of these methods focus exclusively on image-based face recognition that uses a still image as input data. One problem with the image-based face recognition is that it is possible to use a pre-recorded face photo to confuse a camera to take it as a live subject. The second problem is that the image-based recognition accuracy is still too low in some practical applications comparing to other high accuracy biometric technologies. To alleviate these problems, video based face recognition has been proposed recently. One of the major advantages of video-based face recognition is to prevent the fraudulent system penetration by pre-recorded facial images. The great difficulty to forge a video sequence (possible but very difficult) in front of a live video camera may ensure that the biometric data come from the user at the time of authentication. Another key advantage of the video based method is that more information is available in a video sequence than in a single image. If the additional information can be properly extracted, we can further increase the recognition accuracy. In this thesis, we develop a new video-to-video face recognition algorithm [86]. The major advantage of the video based method is that more information is available in a video sequence than in a single image. In order to take advantage of the large amount of information in the video sequence and at the same time overcome the processing speed and data size problems we develop several new techniques including temporal and spatial frame synchronization, multi-level subspace analysis, and multi-classifier integration for video sequence processing. An aligned video sequence for each person is first obtained by applying temporal and spatial synchronization, which effectively establishes the face correspondence using the information of both audio and video, then multi-level subspace analysis or multi-classifier integration is employed for further analysis based on the synchronized sequence. The method preserves all the temporal-spatial information contained in a video sequence. Near perfect classification results are obtained on the largest available XM2VTS face video database. In addition, using a similar framework, two kinds of much improved still image based face recognition algorithms [93][94] are developed by incorporating the Gabor representation, nonparametric feature extraction method, and multiple classifier integration techniques. Extensive experiments on two famous face databases (XM2VTS database and Purdue database) clearly show the superiority of our new algorithms.
Global Software Engineering: The Future of Socio-technical Coordination
Authors: James D. Herbsleb
Venue: 2007 Future of Software Engineering (2007)

Globally-distributed projects are rapidly becoming the norm for large software systems, even as it becomes clear that global distribution of a project seriously impairs critical coordination mechanisms. In this paper, I describe a desired future for global development and the problems that stand in the way of achieving that vision. I review research and lay out research challenges in four critical areas: software architecture, eliciting and communicating requirements, environments and tools, and orchestrating global development. I conclude by noting the need for a systematic understanding of what drives the need to coordinate and effective mechanisms for bringing it about.
A new false positive reduction method for MCCs detection in digital mammography
Authors: L. Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A new mixed feature multistage false positive (FP) reduction method has been developed for improving the FP reduction performance. Eleven features were extracted from both spatial and morphology domains in order to describe the micro-calcification clusters (MCCs) from different perspectives. These features are grouped into three categories: gray-level description, shape description and clusters description. Two feature sets that focus on describing MCCs on every single calcification and on clustered calcifications, respectively, were combined with a back-propagation (BP) neural network with Kalman filter (KF) to obtain the best performance of FP reduction. First, 9 of the 11 gray-level description and shape description features were employed with BP neural network to eliminate all the obvious FP calcifications in the image. Second, the remaining MCCs will be classified into several clusters by a widely used criterion in clinical practice, and then the two cluster description features will be added to the first feature set to eliminate the FP clusters from the remaining MCCs. The performance results of this approach were obtained using an image database of 100 real cases of patient's mammogram images in H. Lee Moffitt Cancer Center imaging program.
Implementation of mixed precision in solving systems of linear equations on the Cell processor: Research Articles
Authors: Jakub Kurzak, Jack Dongarra
Venue: Concurrency and Computation: Practice Experience (2007)

This paper describes the design concepts behind implementations of mixed-precision linear algebra routines targeted for the Cell processor. It describes in detail the implementation of code to solve linear system of equations using Gaussian elimination in single precision with iterative refinement of the solution to the full double-precision accuracy. By utilizing this approach the algorithm achieves close to an order of magnitude higher performance on the Cell processor than the performance offered by the standard double-precision algorithm. The code is effectively an implementation of the high-performance LINPACK benchmark, as it meets all of the requirements concerning the problem being solved and the numerical properties of the solution. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A modulated complex lapped transform and its applications to audio processing
Authors: H. Malvar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper introduces a new structure for a modulated complex lapped transform (MCLT), which is a complex extension of the modulated lapped transform (MLT). The MCLT is a particular kind of a 2/spl times/ oversampled generalized DFT filter bank, whose real part corresponds to the MLT. That property can be used for efficient implementation of joint echo cancellation, noise reduction, and coding, for example. Fast algorithms for the MCLT are presented, as well as examples that show the good performance of the MCLT in noise reduction and echo cancellation.
System support for bandwidth management and content adaptation in internet applications
Authors: David Andersen, Deepak Bansal, Dorothy Curtis, Srinivasan Seshan, Hari Balakrishnan
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

This paper describes the implementation and evaluation of an operating system module, the Congestion Manager (CM), which provides integrated network flow management and exports a convenient programming interface that allows applications to be notified of, and adapt to, changing network conditions. We describe the API by which applications interface with the CM, and the architectural considerations that factored into the design. To evaluate the architecture and API, we describe our implementations of TCP; a streaming layered audio/video application; and an interactive audio application using the CM, and show that they achieve adaptive behavior without incurring much end-system overhead. All flows including TCP benefit from the sharing of congestion information, and applications are able to incorporate new functionality such as congestion control and adaptive behavior.
Highly dependable concurrent programming using design for verification
Authors: Aysu Betin-Can, Tevfik Bultan
Venue: Formal Aspects of Computing (2007)

There has been significant progress in automated verification techniques based on model checking. However, scalable software model checking remains a challenging problem. We believe that this problem can be addressed using a design for verification approach based on design patterns that facilitate scalable automated verification. In this paper, we present a design for verification approach for highly dependable concurrent programming using a design pattern for concurrency controllers. A concurrency controller class consists of a set of guarded commands defining a synchronization policy, and a stateful interface describing the correct usage of the synchronization policy. We present an assume-guarantee style modular verification strategy which separates the verification of the controller behavior from the verification of the conformance to its interface. This allows us to execute the interface and behavior verification tasks separately using specialized verification techniques. We present a case study demonstrating the effectiveness of the presented approach.
A fast algorithm for Toeplitz-block-Toeplitz linear systems
Authors: A. E. Yagle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A Toeplitz-block-Toeplitz (TBT) matrix is block Toeplitz with Toeplitz blocks. TBT systems of equations arise in 2D interpolation, 2D linear prediction and 2D least-squares deconvolution problems. Although the doubly Toeplitz structure should be exploitable in a fast algorithm, existing fast algorithms only exploit the block Toeplitz structure, not the Toeplitz structure of the blocks. Iterative algorithms can employ the 2D FFT (fast Fourier transform), but usually take thousands of iterations to converge. We develop a new fast algorithm that assumes a smoothness constraint on the matrix entries. For an M/sup 2//spl times/M/sup 2/ TBT matrix with M M/spl times/M Toeplitz blocks along each edge, the algorithm requires only O(6M/sup 3/) operations to solve an M/sup 2//spl times/M/sup 2/ linear system of equations; parallel computing on 2M processors can be performed on the algorithm as given. Two examples show the operation and performance of the algorithm.