ppxscal/embedding_network huggingface dataset:
Image compression via adaptive self-quantization of wavelet subtrees
Authors: G. M. Davis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Fractal compression schemes do not fit into the standard transform coder paradigm and have proven difficult to analyze. The theory of iterated function systems motivates a broad class of fractal schemes but does not give much guidance for their implementation. We introduce a wavelet-based framework for analyzing fractal block coders which simplifies these schemes considerably. We show that fractal block coders are Haar wavelet subtree quantization schemes, and we thereby place fractal schemes in the context of conventional transform coders. We derive a wavelet-based analog of fractal compression, the self-quantization of subtrees (SQS) scheme. SQS compression outperforms the best fractal schemes in the literature by roughly 1 dB in PSNR across a broad range of compression ratios and has performance comparable to some of the best conventional wavelet schemes. We describe a fast SQS decoding scheme which suffers from none of the convergence problems of fractal decoders.
Millipede: a user-level NT-based distributed shard memory system with thread migration and dynamic run-time optimization of memory references
Authors: Ayal Itzkovitz, Assaf Schuster, Lea Shalev
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

MILLIPEDE is an all user mode, no kernel-patches, "add on" software tool for standard corporate environments, that takes advantage of idle system resources and efficiently utilizes idle processor time in available distributed environments of personal workstations. MILLIPEDE presents to the user a powerful virtual parallel machine which abstracts away the underlying hardware configuration. In this way MILLIPEDE supports mapping of the applications to dynamically varying levels of parallelism according to both changes in the underlying hardware and changes in the application requirements. MILLIPEDE is multi-threaded, thus taking full advantage of SMPs. MILLIPEDE provides a true distributed shared memory with several coherence protocols (and a flexible mechanism for easy inclusion of new ones) and dynamic thread migration [3]. MILLIPEDE studies the memory access pattern and optimizes the locality of memory references by adapting the thread distribution accordingly [5]. MILLIPEDE supports several of the more liberal parallel programming paradigms [2]. Currently we support PARC (which allows for example nested parallelism and barriers among sibling activities), PARC++ (which is as flexible as C++ except for additional parallelizing constructs), the SPLASH macros (which we had to adapt to Windows-NT and to the multi-threaded concept), and of course for best speedups one can use directly the MILLIPEDE job manager library. We are working on the implementation of PARFORTRAN90 and JAVA (for which we came up with a new definition of the JVM memory behavior, and with an efficient algorithm for distributed garbage collection [4]). In order to support many different programming languages on top of a single virtual parallel machine we developed MILLIPEDE Job Event Control (MJEC) [2]. MJEC can be used to efficiently implement a variety of synchronization and communication protocols (e.g., PARC in about 250 lines of code). MILLIPEDE is fully implemented at the Technion, Haifa, using the Windows-NT operating system (previous version on MACH [1]). We refer the reader to our WWW site (see above) for online versions of the papers, and for downloading a distribution of MILLIPEDE.
New methods of radar detection performances analysis
Authors: O. Jean-Philippe
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Original methods of radar detection performance analysis are derived for a fluctuating or non-fluctuating target embedded in additive and a priori unknown noise. This kind of noise can be, for example, the sea or ground clutter encountered in surface-sited radar for the detection of a target illuminated at low grazing angles or in high resolution radar. For these cases, the spiky clutter tends to have a statistic which strongly differs from the gaussian assumption. Therefore, the detection theory becomes difficult to perform since the nature of the statistics has to be known. The new methods proposed here are based on the parametric modelisation of the moment generating function of the noise envelope by Pade approximation and lead to a powerful estimation of its probability density function. They allow to evaluate the radar detection performance of a target embedded in any noise without knowledge of the closed form of its statistic and allow in the same way to take into account any possible fluctuation of the target. These methods have been tested successfully on synthetic signals and have been performed on experimental signals such as ground clutter.
Licence-exempt wireless communication systems
Authors: S. Kawade, T. Hodgkinson
Venue: BT Technology Journal (2007)

There is growing international interest in providing users with broadband wireless connectivity using licence-exempt networks rather than next generation licenced ones. This is a potentially disruptive trend, but because these systems are fundamentally different, it is still very unclear how significant this potential disruption is likely to be. Consequently, the aim of this paper is to overview the capabilities of the technologies typically used in licence-exempt systems and to then consider their potential performance limitations within the context of designed and randomly deployed Wi-Fi networks for different deployment densities.
Analysis of selective strategies to build a dependency-analyzed corpus
Authors: Kiyonori Ohtake
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper discusses sampling strategies for building a dependency-analyzed corpus and analyzes them with different kinds of corpora. We used the Kyoto Text Corpus, a dependency-analyzed corpus of newspaper articles, and prepared the IPAL corpus, a dependency-analyzed corpus of example sentences in dictionaries, as a new and different kind of corpus. The experimental results revealed that the length of the test set controlled the accuracy and that the longest-first strategy was good for an expanding corpus, but this was not the case when constructing a corpus from scratch.
A hands-on approach to teaching manufacturing processes
Authors: M. E. Ssemakula
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This paper describes a laboratory-based course in manufacturing processes. The course provides a general understanding of the behavior of the materials commonly used in manufacturing, the basic techniques used in processing them into useful products, the scientific theory underlying those processes, and the criteria for selecting particular processes. The course incorporates an innovative hands-on laboratory, which involves team projects that help students gain experience with selected manufacturing processes. The projects start with simple components that can be made on a single machine such as a lathe or a mill, and progress to the manufacture and assembly of a fully operational model engine. This approach exposes students to the issues involved in putting together a nontrivial assembly. The projects also expose students to the idea of working in teams, a skill that is highly sought by industry. The paper also discusses the implementation of collaborative learning techniques, using Internet tools to promote interaction among team members. 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
Energy conservation policies for web servers
Authors: Mootaz Elnozahy, Michael Kistler, Ramakrishnan Rajamony
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

Energy management for servers is now necessary for technical, financial, and environmental reasons. This paper describes three policies designed to reduce energy consumption in Web servers. The policies employ two power management mechanisms: dynamic voltage scaling (DVS), an existing mechanism, and request batching, a new mechanism introduced in this paper. The first policy uses DVS in isolation, except that we extend recently introduced task-based DVS policies for use in server environments with many concurrent tasks. The second policy uses request batching to conserve energy during periods of low workload intensity. The third policy uses both DVS and request batching mechanisms to reduce processor energy usage over a wide range of workload intensities. All the policies trade off system responsiveness to save energy. However, the policies employ the mechanisms in a feedback-driven control framework in order to conserve energy while maintaining a given quality of service level, as defined by a percentile-level response time. We evaluate the policies using Salsa, a web server simulator that has been extensively validated for both energy and response time against measurements from a commodity web server. Three daylong static web workloads from real web server systems are used to quantify the energy savings: the Nagano Olympics98 web server, a financial services company web site, and a disk intensive web workload. Our results show that when required to maintain a 90th-percentile response time of 50ms, the DVS and request batching policies save from 8.7% to 38% and from 3.1% to 27% respectively of the CPU energy used by the base system. The two polices provide these savings for complementary workload intensities. The combined policy is effective for all three workloads across a broad range of intensities, saving from 17% to 42% of the CPU energy.
HEAD: The Human Encephalon Automatic Delimiter
Authors: Andre G. R. Balan, Agma J. M. Traina, Marcela X. Ribeiro, Paulo M. A. Marques, Caetano Traina-Jr.
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In this paper we present HEAD, the Human Encephalon Automatic Delimiter, a new and efficient method for skull-stripping in T1-weighted MRI that combines an unique histogram analysis with binary mathematical morphology. In our experiments we use real images with highly variable noise ratios and intensity non-uniformity. We evaluate our results based on manually generated true masks and the well known Jaccard metric, achieving accuracy close to 99%. We compare our method with the popular Brain Extractor Surface algorithm (BSE), which in the same experiments achieved less than 95% of accuracy.
A Modeling Paradigm for Multidatabases
Authors: Suresh K. Damodaran-Kamal, Joan M. Francioni, Niki Pissinou
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

One component of efficient object management in large multidatabase systems is efficient object identification. This paper defines and formalizes concepts related to decentralized object identifier assignment, and presents a model for object identification, shared access and communication in a multidatabase domain.
Minitrack Summary: Using Information: New Technologies, Ways & Means
Authors: Daniel M. Russell, Jonathan Grudin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As the quantity of digital information rises, so have the number and variety of tools to route, access, differentiate, label, assess, structure, synthesize, manage, and route it. Digital tools are not as expensive as they once were, and much of the experimentation with these tools is done by young people focused on exploring and understanding the world. They will bring their skills and knowledge of when, where, and how to use these tools. With digital infrastructures in place, this can happen more quickly than in the past.
Gabor's signal expansion on a quincunx lattice and the modified Zak transform
Authors: A. J. van Leest
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Gabor's expansion of a signal on a quincunx lattice with oversampling by a rational factor is presented for continuous-time signals. It is shown how a modified Zak transform instead of the ordinary Zak transform can be helpful in determining Gabor's signal expansion coefficients and how it can be used in finding the dual window. Furthermore, some examples of dual windows for the quincunx case are given and compared with dual windows for the rectangular case.
Technology and You: an engineering service course for non-engineering students
Authors: M. N. O. Sadiku
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper presents the rationale and content of an undergraduate course, "Technology and You", for nonengineering students. In addition to increasing the awareness of the importance, role and impact of technology to modern society, the course introduces the students to all aspects of the field of engineering, with special emphasis on design and failure. The motivation for such a course, its philosophical basis, the problems encountered in its development and the reaction from students are discussed.
Markov blanket-embedded genetic algorithm for gene selection
Authors: Zexuan Zhu, Yew-Soon Ong, Manoranjan Dash
Venue: Pattern Recognition (2007)

Microarray technologies enable quantitative simultaneous monitoring of expression levels for thousands of genes under various experimental conditions. This new technology has provided a new way of biological classification on a genome-wide scale. However, predictive accuracy is affected by the presence of thousands of genes many of which are unnecessary from the classification point of view. So, a key issue of microarray data classification is to identify the smallest possible set of genes that can achieve good predictive accuracy. In this study, we propose a novel Markov blanket-embedded genetic algorithm (MBEGA) for gene selection problem. In particular, the embedded Markov blanket-based memetic operators add or delete features (or genes) from a genetic algorithm (GA) solution so as to quickly improve the solution and fine-tune the search. Empirical results on synthetic and microarray benchmark datasets suggest that MBEGA is effective and efficient in eliminating irrelevant and redundant features based on both Markov blanket and predictive power in classifier model. A detailed comparative study with other methods from each of filter, wrapper, and standard GA shows that MBEGA gives a best compromise among all four evaluation criteria, i.e., classification accuracy, number of selected genes, computational cost, and robustness.
Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks
Venue: High Performance Distributed Computing (2007)

It is our great pleasure to welcome you to the 2th edition of the UPGRADE-CN workshop that takes place this year at the IEEE HPDC 2007 Conference, in Monterey Bay, California. The mission of the workshop is to provide a forum to discuss recent enhancements of Content Networks (CNs). Content Networks extend Content Distribution Networks (CDNs) in that they do not just allow content retrieval and delivery to Internet users but are also exploited to create, modify and manage content, and actively place content at appropriate locations. Design and implementation of robust and efficient CNs in large-scale computing environments demand for emerging paradigms and software technologies. Agent, P2P and Grid computing paradigms have already demonstrated their suitability in supporting the development of high-performance systems over large-scale, dynamic and heterogeneous environments. Therefore their use, which accounts for dynamism (P2P), robustness (Grid), and intelligence (Agents), can augment the effectiveness and boost the efficiency of future content management infrastructures. The nine regular papers selected for presentation offer a very interesting and broad range of views on the potential use of these new technologies for CN infrastructures and applications. Though this research area is very recent, some of the selected papers already present an evaluation of real systems and prototypes, whereas others discuss architectural aspects of content-oriented systems based on innovative technologies, and provide simulation or analytical performance analysis. The workshop will be opened by an invited talk given by Ian Taylor, who will report about recent research at the Cardiff University pertaining to the construction of grouping overlays based on the super-peer paradigm. Furthermore, the organizers decided to reserve space for two invited papers: the first is authored by Guillaume Pierre, of the Vrije University of Amsterdam, and focuses on the use of Content Networks and P2P technologies to build next generation Grids; the second is authored by Novelli, Pappalardo, Santoro and Tramontana, of the University of Catania (Italy), and proposes the development of a CN for multimedia data delivery by means of a Grid computing environment. The quality and variety of the topics covered by the presented papers reflect the vitality of this research area. The work of the program committee members guaranteed an accurate review process, with at least three reviews per paper, and assured a selection of high quality papers that reflect current research efforts and are a valuable source of information for the researchers that want to become familiar with the field of content-oriented distributed systems. We hope that you will find this program interesting and thought-provoking and that the workshop will provide you with a valuable opportunity to share ideas with other researchers and practitioners from institutions around the world.
A framework for extensible component customization for component-based software development
Authors: Stephen S. Yau
Venue:  (2006)

Component Based Software Development (CBSD) approach has shown significant promises in distributed application software development. CBSD changes the focus of software development from programming to software construction from independently developed, high quality, off-the-shelf components. It thus increases productivity of application developers and quality of software systems. Despite of the promises of CBSD, it is very difficult to reuse software components in practice. Software developers often cannot find components fully matching the requirements in the new applications because components are developed based on requirements and assumptions different from those for the new applications. Hence, it is important that software developers are able to customize behavior of components to resolve various mismatches before the components can be used. Component customization is inherently challenging because encapsulation hides internal behavior of components from software developers, who interact with the components only through the interfaces of the components. The software developers can work around this restriction by externally customizing around the interfaces. However, this cannot modify internal behavior of the components. Asking component providers, who created the components, to modify each component for each software developer is prohibitively expensive. A more viable approach is for the component providers to prepackage a customization mechanism inside the components that allows the software developers to modify internal behavior of the components. However, because there are usually a number of different ways to customize a component in different application domains, it is impossible for the component providers to foresee and accommodate all of them ahead of time. This dissertation presents a framework for extensible component customization, which can be used in a wide range of application domains. The framework facilitates the customization of the internal behavior of components with little interactions between component providers and software developers. The framework includes a language for component providers, based on their extensive knowledge of the components, to specify the internal points of the components where the required changes can be made. Using the framework, software developers, without extensive knowledge of the components and access to the source code of the components, can customize the components to their requirements.
Characterising Testing Preorders for Finite Probabilistic Processes
Authors: Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both problems for finite processes with silent moves. It characterises the may preorder in terms of simulation, and the must preorder in terms of failure simulation. It also gives a characterisation of both preorders using a modal logic. Finally it axiomatises both preorders over a probabilistic version of CSP.
A freshman design and engineering tools course
Authors: J. J. Freeman, S. Rositano
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Since 1991, the students enrolled in the Electrical Engineering and Computer Engineering Departments at San Jose State University have had an experimental course in engineering design and computer tools. In the Fall of 1994, the College of Engineering adopted the course as a required two-unit course (one unit lecture and three hours laboratory work per week) for all engineering students. The course is divided into three parts. The first covers the disassembly and reassembly of a computer peripheral, a report on the operation of the device and one improvement to add value. The second uses spreadsheets (either Lotus or Excel) to aid in the mathematical solution of an engineering problem. The third part uses Matlab to solve the mathematics of an engineering problem. The emphasis in the course is in defining the engineering solution for a particular engineering problem, using the computer packages to analyze the input variables, and then presenting the data so that "everyone" will come to the same conclusion. We use a data acquisition system with a computer system to generate data for the various student projects. All projects are conducted by teams of three students. All grades, except two for class exams, are team grades. The student projects are chosen from a list generated by the course faculty and other faculty in the College of Engineering.
Rethinking/dev and devices in the UNIX kernel
Authors: Poul-Henning Kamp
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

An outstanding novelty in UNIX at its introduction was the notion of "a file is a file is a file and even a device is a file." Going from "hardware only changes when the DEC Field engineer is here" to "my toaster has USB" has put serious strain on the rather crude implementation of the "devices as files" concept, an implementation which has survived practically unchanged for 30 years in most UNIX variants. Starting from a high-level view of devices and the semantics that have grown around them over the years, this paper takes the audience on a grand tour of the redesigned FreeBSD device-I/O system, to convey an overview of how it all fits together, and to explain why things ended up as they did, how to use the new features and in particular how not to.