ppxscal/embedding_network huggingface dataset:
HLDVT'04 - Ninth Annual IEEE International Workshop on High Level Design Validation and Test
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present the effects of using an efficient algorithm for behavior-based model synthesis which is specifically tailored to reactive (legacy) system behaviors. Conceptual backbone is the classical automata learning procedure L*, which we adapt according to the considered application profile. The resulting learning procedure L*Meal , which directly synthesizes generalized Mealy automata from behavioral observations gathered via an automated test environment, drastically outperforms the classical learning algorithm for deterministic finite automata. Thus it marks a milestone towards opening industrial legacy systems to model-based test suite enhancement, test coverage analysis, and online testing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Content-based Robust Mode Decision Scheme for Internet Videophone Applications
Authors: Jin Xu, Limin Sun, Zhimei Wu
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Intra-coding macroblocks (MBs) is a fairly efficient way to make the compressed video bitstream more resilient to channel error because the decoding of an intra MB does not need the information from previous frames. However, too many intra-coded MBs will significantly degrade the compression performance. Therefore, a good mode selection between intra-mode and inter-mode should be in place to enhance the robustness of the video communications system to channel error. Since Rate-Distortion optimized (RDO) video coding framework can provide an efficient means for coding mode selection in an error-free environment, recent researches propose to extent this RDO framework in error-prone environment to intelligently decide which MBs should be intra-coded to better combat the transmission error.
Integrated undergraduate polymer technology laboratory
Authors: R. M. Winter
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes an integrated polymer laboratory, a one-semester senior/first-year graduate level chemical engineering laboratory, designed to provide students with an experience that parallels process and product development in industry. A unique feature of the "integrated" laboratory experience is that students synthesize resins which are used in subsequent experiments. Hence, students gain first-hand experience of the inter-relationships between the various steps of product/process development. Experiments designed and tested include polymer identification, polymer synthesis, polymer rheology, polymer fabrication and mechanical testing and morphology characterization. The polymer identification experiment is designed to introduce students to structure-property relationships. Solution, suspension and/or bulk polymerization are investigated in the polymer synthesis laboratory. The resin produced in this experiment is then used in subsequent experiments. Melt viscosity is studied in the polymer rheology laboratory. A 33 ton injection molding machine is then used to fabricate test specimens and to attain and understanding of process variables in the polymer fabrication laboratory. A torque rheometer is also used to study process variables. Finally, students analyse the test specimens obtained from the resin they synthesized utilizing a servo-hydraulic test system, a Fourier transform infrared spectrometer and a scanning electron microscope.
A decoupled algorithm for geolocation of multiple emitters
Authors: Alon Amar, Anthony J. Weiss
Venue: Signal Processing (2007)

The problem of determining the positions of multiple emitters by widely separated arrays is considered. We propose an iterative algorithm for estimating the positions based on the maximum likelihood (ML) criterion. The position of each emitter is decoupled from the other emitters, and in each iteration is determined by a two dimensional grid search. This approach substantially reduces the computation load of a straightforward implementation of the ML estimator, which requires a multidimensional search. Numerical examples are provided to illustrate the performance. We demonstrate that only a few iterations are required to achieve convergence. The results are compared with the Cramer-Rao lower bound.
Outcomes based assessment and a successful ABET 2000 accreditation at the University of Denver
Authors: R. R. DeLyser
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper addresses the outcome assessment process at the University of Denver, how it was received by the ABET visiting team and what changes were and are continually being made. The Engineering Department at the University of Denver was selected as one of 12 to be visited in autumn 1998 and evaluated under Criteria 2000. The department has undergraduate programs in computer, electrical, general and mechanical engineering. These BS degrees are also combined with a Masters in Business Administration (MBA) resulting in two degrees in 5 years. All 8 programs were evaluated under Criteria 2000 and all received accreditation.
Computer aided design techniques for network-on-chip architectures and system-level low power optimization
Authors: Karamuir S. Chatha
Venue:  (2006)

System-on-Chip (SoC) integrates several processing cores, ASIC blocks, memory, and communication elements on a single chip. The International Technology Roadmap for Semiconductors (ITRS) predicts that future generations of the high end SoC architectures will be implemented in less than 50nm technology, and clocked in the multi GHz range. These architectures will be composed of tens to hundreds of cores communicating with each other at several Gigabits per second.Along with performance, power minimization will be an important design goal in nanoscale SoC architectures. Aggressive performance optimization and power minimization techniques will be applied by dividing these architectures into voltage and clock islands. These islands will operate on local clocks. Communication between the voltage islands, also known as global communication, will take place asynchronously, thus obviating the need for a global clock. Such architectures are known as Globally Asynchronous and Locally Synchronous (GALS) based systems.This thesis addresses two important problems in GALS based SoC design: (i) Design and optimization of global or inter-core communication architecture, and (ii) system-level power minimization. As a primary contribution, the thesis addresses the optimization problems of the communication architecture in the context of a new communication paradigm to meet the performance requirements in future SoCs. As a secondary contribution, it addresses the problem of low power mapping and scheduling in multiprocessor SoC architecture. We propose mathematical models, heuristic techniques, and provably good polynomial time algorithms to solve the optimization problems of future SoC architectures.Network-on-Chip (NoC) has been proposed as a solution for the global communication challenges in GALS based architectures. NoC supports asynchronous transfer of data, and given a suitable topology, can provide extremely high bandwidth by pipelining signal transmission, and by supporting concurrent communication. This thesis presents techniques for the design of low power NoC architectures, under performance constraints.Dynamic voltage scaling (DVS), and dynamic power management (DPM) are two well known system-level power minimization schemes that are employed at the board level. GALS based SoC architectures will also support these power minimization techniques. The thesis presents techniques that integrate DVS and DPM with algorithmic transformations namely, pipelining and loop unrolling to minimize the power consumption of a multiprocessor GALS based architecture, under performance constraints.
Creating a Culture of Innovation
Authors: Wim Roelandts
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Innovation is key to the success of companies in the semiconductor and IT industry. To successfully enable innovation, a company must create a culture that encourages innovation, and at the same time, deals with the inherent risks and issues associated with innovation. This talk will present how Xilinx creates such a culture. Xilinx has a history of successful product innovation like the award-winning Virtex and Spartan series of FPGAs (Field Programmable Gate Arrays). Xilinx is also the pioneer of innovative business models like the "fabless" semiconductor model. Over the last few years, significant technical advances have made FPGAs ideal for many SoC (System On Chip) applications, and the mainstream solution of choice for digital system designers.
Extracting Salient Objects from Operator-Framed Images
Authors: Daniel Crevier
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In images framed by human operators, as opposed to those taken under computer control, the position of objects can be an important clue to saliency. This paper uses the Berkeley image data set to show how locational and photometric information can be combined to extract a probability of saliency for all image pixels. This probability can then be thresholded and segmented to extract compact image regions with high probability of saliency. A self assessment procedure allows the algorithm to evaluate the accuracy of its results. The method can extract salient regions of non uniform color, brightness or texture against highly variable background.
A new method for estimating the instantaneous frequency based on maximum likelihood
Authors: F. A. C. de Bastos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A brief comparison of several methods to estimate the instantaneous frequency (IF) is carried out taking into consideration computational complexity, bias, and variance. A new method to estimate the IF is then proposed for high signal-to-noise ratio applications. The new method was derived based on the derivative of the phase of the analytic signal and on the assumption that the modulation varies linearly with time. When compared to other methods of similar computational complexity, the proposed method presented smaller bias for a fixed window length and smaller variance for a given acceptable bias threshold.
(Weak) Dual hyper K-ideals
Authors: L. Torkzadeh, M. M. Zahedi, M. Abbasi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

In this note by considering the notion of (weak) dual hyper K-ideal, we obtain some related results. After that we determine the relationships between (weak) dual hyper K-ideals and (weak) hyper K-ideals. Finally, we give a characterization of hyper K-algebras of order 3 or 4 based on the (weak) dual hyper K-ideals.
Nonlinear optical media in photonic crystal waveguides: Intrinsic localized modes and device applications: Research Articles
Authors: A. R. McGurn
Venue: Complexity (2007)

A review is given of some of the properties of photonic crystal waveguides containing or interacting with nonlinear optical media including discussions of potential device applications. An introduction is given to photonic crystals, photonic crystal waveguide technologies, the properties of Kerr nonlinear dielectric media, the properties of new types of excitations in these systems known as intrinsic localized modes, and optical bistability. Device designs for switches, waveguide couplers, interferometers, transistors, photonic crystal receivers and transmitters, and photonic crystal sensors are reviewed. &copy; 2007 Wiley Periodicals, Inc. Complexity 12: 18&ndash;32, 2007
Transform predictive coding of wideband speech signals
Authors: Juin-Hwey Chen, Dongmei Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents a novel wideband speech coding algorithm called transform predictive coding (TPC). The main emphasis is on low complexity. TPC uses short-term and long-term prediction to remove the redundancy in speech. The prediction residual is quantized in the frequency domain based on a calculated noise masking threshold. In its simplest form, the TPC coder uses only open-loop quantization and therefore has a low complexity. A 16 kb/s full-duplex, open-loop TPC coder takes only 22% of the CPU load on a 150 MHz SGI Indy workstation and about 34% on a 90 MHz Pentium PC. The speech quality of TPC is almost transparent at 32 kb/s, very good at 24 kb/s, and acceptable at 16 kb/s. In the second half of the paper, we report our recent progress in using closed-loop quantization techniques to improve TPC output speech quality.
Bandelet Union Optimal Matrix Norms Constructing Lossless Watermarking
Authors: Yue-Xiang Yang, Li-Zhi Cheng, Yong Luo, Rui Wang
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

A multi-frequency lossless watermarking algorithm is proposed in this paper. Bandelet and optimal matrix norms are used to draw the geometric feature and the statistic feature. The bandelet transform is applied to the image, and the texture and edge traced by using the geometric flow via feature of the image to build the high frequency lossless watermarking. A low frequency watermarking scheme is also achieved, by selecting optimal matrix norm to process the low frequency part of wavelets coefficients. The experiments show the offered watermarking system is evaluated against standard watermarking attacks.
The Better Bubbling Lemma
Authors: Robert K. Meyer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

BCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, JSL 48 (1983), 931-940] relies for its modeling of @l calculus in intersection type filters on a key theorem which I call BL (for the Bubbling Lemma, following someone). This lemma has been extended in [Castagna, Giuseppe, and Alain Frisch. A gentle introduction to semantic subtyping. In PPDP05, ACM Press (full version) and ICALP05, LNCS volume 3580, Springer-Verlag (summary), 2005. Joint ICALP-PPDP keynote talk; Dezani-Ciancaglini, M., A. Frisch, E. Giovannetti and Y. Motohama, 2002. The Relevance of Semantic Subtyping, Electronic Notes in Theoretical Computer Science 70 No. 1, 15pp] to encompass Boolean structure, including specifically union types; this extended lemma I call BBL (the Better Bubbling Lemma). There are resonances, explored in [Dezani-Ciancaglini, M., R.K. Meyer and Y. Motohama, The semantics of entailment omega, NDJFL 43 (2002), 129-145] and [Dezani-Ciancaglini, M., A. Frisch, E. Giovannetti and Y. Motohama, 2002. The Relevance of Semantic Subtyping, Electronic Notes in Theoretical Computer Science 70 No. 1, 15pp], between intersection and union type theories and the already existing minimal positive relevant logic B+ of [Routley, Richard, and Robert K. Meyer, The semantics of entailment III, JPL 1 (1972), 192-208]. (Indeed [Pal, Koushik, and Robert K. Meyer. 2005. Basic relevant theories for combinators at levels I and II, AJL 3, http://www.philosophy.unimelb.edu.au/2005/2003_2.pdf, 19 pages] applies BL and BBL to get further results linking combinators to relevant theories and propositions.) On these resonances the filters of algebra become the theories of logic. The semantics of [Meyer, Robert K., Yoko Motohama and Viviana Bono, Truth translations of relevant logics, in B. Brown and F. Lepage, eds., ''Truth and Probability: Essays in Honour of Hugues Leblanc,'' pages 59-84, College Publications, King's College, London, 2005] yields here a new and short proof of BBL, which takes account of full Boolean structure by encompassing not only B+ but also its conservative Boolean extension CB [Routley, Richard, and Robert K. Meyer, The semantics of entailment III, JPL 1 (1972), 192-208; Meyer, Robert K., 1995. Types and the Boolean system CB+, cslab.anu.edu.au/ftp/techreports/SRS/1995/TR-SRS-5-95/meyer.ps.gz; Meyer, Robert K., Yoko Motohama and Viviana Bono, Truth translations of relevant logics, in B. Brown and F. Lepage, eds., ''Truth and Probability: Essays in Honour of Hugues Leblanc,'' pages 59-84, College Publications, King's College, London, 2005.].
An Improved Analysis of Linear Mergers
Authors: Zeev Dvir, Amir Shpilka
Venue: Computational Complexity (2007)

Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has min-entropy rate ¿ then the output has min-entropy rate close to ¿. Mergers were first introduced by Ta-Shma [28th STOC, pp. 276-285, 1996] and have proven to be a very useful tool in explicit constructions of extractors and condensers. In this work we present a new analysis of the merger construction of Lu et al [35th STOC, pp. 602-611, 2003]. We prove that the merger's output is close to a distribution with min-entropy rate of at least $$\frac{6}{11}\delta$$ . We show that the distance from this distribution is polynomially related to the number of additional random bits that were used by the merger (i.e., its seed). We are also able to prove a bound of $$\frac{4}{7}\delta$$ on the min-entropy rate at the cost of increasing the statistical error. Both results are improvements to the previous known lower bound of $$\frac{1}{2}\delta$$ (however, in the $$\frac{1}{2}\delta$$ result the error decreases exponentially in the length of the seed). To obtain our results we deviate from the usual linear algebra methods that were used by Lu et al and introduce techniques from additive number theory.
Visualizing personal web caches with Caubview
Authors: Charles L. Brooks, Murray S. Mazer, Frederick J. Hirsch
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

Caubview is a companion visualizer for the Caubweb system: Caubweb enables a user to create a local collection of Web documents to read and update when disconnected. Caubview allows the visual selection of alternative views of the cache as well as reorganizing and restructuring these views. This paper describes our ongoing work on the Caubweb system, focusing on its visualization component, Caubview. We describe the relationship between these two systems, how we developed Caubview by re-using code from the HistoryGraph application, our results, and our plans for further development. We further describe our experiences using Tcl/Tk as the development language and "programming culture" for these applications, and indicate how ongoing developments in Tcl/Tk have influenced our work. We conclude with some observations concerning our future use of Tcl/Tk, and recommendations for ongoing efforts for the Tcl/Tk community.
A survey of randomized algorithms for control synthesis and performance verification
Authors: Giuseppe Calafiore, Fabrizio Dabbene, Roberto Tempo
Venue: Journal of Complexity (2007)

In this paper, we present an overview of probabilistic techniques based on randomized algorithms for solving ''hard'' problems arising in performance verification and control of complex systems. This area is fairly recent, even though its roots lie in the robustness techniques for handling uncertain control systems developed in the 1980s. In contrast to these deterministic techniques, the main ingredient of the methods discussed in this survey is the use of probabilistic concepts. The introduction of probability and random sampling permits overcoming the fundamental tradeoff between numerical complexity and conservatism that lie at the roots of the worst-case deterministic methodology. The simplicity of implementation of randomized techniques may also help bridging the gap between theory and practical applications.
A technology-enhanced learning environment for a graduate/undergraduate course on optical fiber communications
Authors: H. S. Hinton
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We have created a technology-enhanced learning environment (TELE) for a graduate/undergraduate course on optical fiber communications. In this work, the, TELEs have content presentation, interaction, and assessment to the learning styles of the students. This personal tailoring of the content to the individual abilities and aptitudes of the learners is possible because of rapid development of the computer and Internet technologies.
Philosophy and Ethics in Knowledge Management
Authors: Jim Sheffield, Robert M. Mason
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The mini-track builds on last year's Philosophical Foundations of KM Research mini-track that attracted a large and enthusiastic audience. This year the mini-track looks at the philosophical and ethical foundations of knowledge management, organizational memory and organizational learning. Of particular concern is the way KM researchers conceptualize the role of information systems in the conversion of tacit knowledge to explicit knowledge to create an organizational memory; and how to effectively organize, store, extract, and manage this knowledge to facilitate organizational learning.
Efficient Software Development Platforms for Multimedia Applications at Different Abstraction Levels
Authors: Katalin Popovici, Xavier Guerin, Frederic Rousseau, Pier Stanislao Paolucci, Ahmed Jerraya
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Multimedia applications require heterogeneous multiprocessor architectures with specific I/O components in order to achieve computation and communication performances. The different processors run different software stacks made of the application code and the hardware dependent software layer. Developing this software usually makes use of a high level programming environment that does not handle specific architecture capabilities. We propose abstract software development platforms allowing to debug incrementally the different software layers and able to accurately estimate the use of the resources of the architecture. The software development platform is an abstract model of the architecture allowing to execute the software with detailed hardware-software interaction, performance measurement and software debug. Different software development platforms are generated automatically from an initial Simulink model and are used to debug the different software components and to easily experiment with several mappings of the application onto the platform resources. In this paper we apply the proposed approach on a multimedia platform, involving a high performance DSP and a RISC processor, to validate the executable code for a MJPEG decoder application.