ppxscal/embedding_network huggingface dataset:
Histogram Equalization using Neighborhood Metrics
Authors: Mark Eramian, David Mould
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We present a refinement of histogram equalization which uses both global and local information to remap the image greylevels. Local image properties, which we generally call neighborhood metrics, are used to subdivide histogram bins that would be otherwise indivisible using classical histogram equalization (HE). Choice of the metric influences how the bins are subdivided, affording the opportunity for additional contrast enhancement. We present experimental results for two specific neighborhood metrics and compare the results to classical histogram equalization and local histogram equalization (LHE). We find that our methods can provide an improvement in contrast enhancement versus HE, while avoiding undesirable over-enhancement that can occur with LHE and other methods. Moreover, the improvement over HE is achieved with only a small increase in computation time.
Do text transcoders improve usability for disabled users?
Authors: Giorgio Brajnik, Daniela Cancila, Daniela Nicoli, Mery Pignatelli
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Text transcoders are web--server systems that produce, on the fly, a text-only version of a web page requested by a user of a browser. Although the potential benefits of text transcoders axe multifaceted and discussions on appropriateness of text transcoders to produce accessible versions of web sites are still ongoing, at the moment the impact of transcoded pages on disabled web users has not been scientifically studied yet.This paper describes an experiment aimed at evaluating usability of web pages processed by a text transcoder and used by 29 disabled persons. Results based on subjective and objective data show how usability changes, and which results can be generalized to a wider population.
Partial permutation decoding for codes from finite planes
Authors: J. D. Key, T. P. McDonough, V. C. Mavron
Venue: European Journal of Combinatorics (2005)

We determine to what extent permutation decoding can be used for the codes from desarguesian projective and affine planes. We define the notion of s-PD-sets to correct s errors, and construct some specific small sets for s = 2 and 3 for desarguesian planes of prime order.
CHI '05 extended abstracts on Human factors in computing systems
Venue: Conference on Human Factors in Computing Systems (2005)

On behalf of the Technical Program Committee, welcome to the CHI 2005 conference DVD! The Extended Abstracts portion of this disc includes submissions from all conference venues except Papers (which you can find in the Conference Proceedings section). Here you will find a formal record of the discussions, demonstrations, and debates that will occur during the conference. Highlights include:short papers from the Late-Breaking Results venue,videos of demonstrations from our new Interactivity Chamber,case studies in innovation and excellence from the Design Expo, a forum for best practices in HCI,ideas that are controversial, innovative, or "hard-to-publish" from alt.chi,position papers from the Development Consortium, which looks at SIGCHI's role in serving an increasingly multidisciplinary membership, andpanels and SIGs that reflect on the foundations of our discipline, and look forward at issues affecting the community today, with topics ranging from outsourcing to the CHI Papers process.You will also find brief summaries from Workshop organizers, Doctoral Consortium participants, Student Competition teams, and Late Breaking Results posters. If you are viewing this disc at the conference, we invite you to interact with these authors during the Highlights on Posters sessions on Wednesday and Thursday in the Commons; check your conference program for more information.On a personal note: bringing together such a large and diverse program is no small task, and I am grateful to the dedication of our venue chairs and Web master - from developing the Calls for Participation and handling the submission/review process, to dealing with my endless requests for information and scheduling conference sessions. Many, many thanks for volunteering your efforts for over a year to make this conference happen!
Compiler-optimized usage of partitioned memories
Authors: Lars Wehmeyer, Urs Helmig, Peter Marwedel
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

In order to meet the requirements concerning both performance and energy consumption in embedded systems, new memory architectures are being introduced. Beside the well-known use of caches in the memory hierarchy, processor cores today also include small onchip memories called scratchpad memories whose usage is not controlled by hardware, but rather by the programmer or the compiler. Techniques for utilization of these scratchpads have been known for some time. Some new processors provide more than one scratchpad, making it necessary to enhance the workflow such that this complex memory architecture can be efficiently utilized. In this work, we present an energy model and an ILP formulation to optimally assign memory objects to different partitions of scratchpad memories at compile time, achieving energy savings of up to 22% compared to previous approaches.
Batched Processing for Information Filters
Authors: Peter M. Fischer, Donald Kossmann
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper describes batching, a novel technique in order to improve the throughput of an information filter (e.g. message broker or publish & subscribe system). Rather than processing each message individually, incoming messages are reordered, grouped and a whole group of similar messages is processed. This paper presents alternative strategies to do batching. Extensive performance experiments are conducted on those strategies in order to compare their tradeoffs.
A fast and accurate method for determining a lower bound on execution time: Research Articles
Authors: G. Fursin, M. F. P. O'Boyle, O. Temam, G. Watts
Venue: Concurrency and Computation: Practice Experience (2004)

In performance critical applications, memory latency is frequently the dominant overhead. In many cases, automatic compiler-based optimizations to improve memory performance are limited and programmers frequently resort to manual optimization techniques. However, this process is tedious and time-consuming. Furthermore, as the potential benefit from optimization is unknown there is no way to judge the amount of effort worth expending, nor when the process can stop, i.e. when optimal memory performance has been achieved or sufficiently approached. Architecture simulators can provide such information but designing an accurate model of an existing architecture is difficult and simulation times are excessively long. In this article, we propose and implement a technique that is both fast and reasonably accurate for estimating a lower bound on execution time for scientific applications. This technique has been tested on a wide range of programs from the SPEC benchmark suite and two commercial applications, where it has been used to guide a manual optimization process and iterative compilation. We compare our technique with that of a simulator with an ideal memory behaviour and demonstrate that our technique provides comparable information on memory performance and yet is over two orders of magnitude faster. We further show that our technique is considerably more accurate than hardware counters. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Browsing fatigue in handhelds: semantic bookmarking spells relief
Authors: Saikat Mukherjee, I. V. Ramakrishnan
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Focused Web browsing activities such as periodically looking up headline news, weather reports, etc., which require only selective fragments of particular Web pages, can be made more efficient for users of limited-display-size handheld mobile devices by delivering only the target fragments. Semantic bookmarks provide a robust conceptual framework for recording and retrieving such targeted content not only from the specific pages used in creating the bookmarks but also from any user-specified page with similar content semantics. This paper describes a technique for realizing semantic bookmarks by coupling machine learning with Web page segmentation to create a statistical model of the bookmarked content. These models are used to identify and retrieve the bookmarked content from Web pages that share a common content domain. In contrast to ontology-based approaches where semantic bookmarks are limited to available concepts in the ontology, the learning-based approach allows users to bookmark ad-hoc personalized semantic concepts to effectively target content that fits the limited display of handhelds. User evaluation measuring the effectiveness of a prototype implementation of learning-based semantic bookmarking at reducing browsing fatigue in handhelds is provided.
Research challenges of autonomic computing
Authors: Jeffrey O. Kephart
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Autonomic computing is a grand-challenge vision of the future in which computing systems will manage themselves in accordance with high-level objectives specified by humans. The IT industry recognizes that meeting this challenge is imperative; otherwise, IT systems will soon become virtually impossible to administer. But meeting this challenge is also extremely difficult, and will require a worldwide collaboration among the best minds of academia and industry. In the hope of motivating researchers in relevant areas to apply their expertise to this vitally important problem, I outline some of the main scientific and engineering challenges that collectively make up the grand challenge of autonomic computing, and provide pointers to initial efforts to address these challenges.
Observation and capture of multimodal interaction in mobile situations
Authors: Moustapha Zouinar, Marc Relieu, Pascal Salembier, Guillaume Calvet
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This paper describes a method and a data collection infrastructure for capturing data about the use of a mobile multimodal system in the field, under realistic conditions. The infrastructure includes instrumentation worn by the user to capture his perspective while moving, a means of capturing a wider view of the context and a multimodal data logger.
Gracenote Fair-Use jukebox
Authors: Will MacMillan
Venue: Journal of Computing Sciences in Colleges (2004)

We have seen online "reserve" systems for professors to allow students to view copyrighted written works, so why not apply this to music? Currently the Union College library allows students to check out CDs or listen to them in a designated lab. This is neither copyright-safe since students have easy access to CD burners, nor is it cost-efficient as CDs are not a durable media and are more vulnerable to data loss than a book. Recent copyright laws like the Digital Millennium Copyright Act have placed heavy restrictions on what is legal and illegal whilst dealing with digital multimedia. What allows professors to share copyrighted works with their class is the doctrine of "Fair-Use". Academia has special exemptions to the restrictive copyright laws that allow students to view copyrighted works for scholarly and critical purposes. Though the exemptions exist, one must be very careful that the copyrighted works stay within the class room environment; this is to ensure that the Fair-Use doctrine applies. 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
Linear time algorithms for the ring loading problem with demand splitting
Authors: Biing-Feng Wang
Venue: Journal of Algorithms (2005)

Given a ring of size n and a set K of traffic demands, the ring loading problem with demand splitting (RLPW) is to determine a routing to minimize the maximum load on the edges. In the problem, a demand between two nodes can be split into two flows and then be routed along the ring in different directions. If the two flows obtained by splitting a demand are restricted to integers, this restricted version is called the ring loading problem with integer demand splitting (RLPWI). In this paper, efficient algorithms are proposed for the RLPW and the RLPWI. Both the proposed algorithms require O(|K| + ts) time, where ts is the time for sorting |K| nodes. If |K| ≥ nε for some small constant ε > 0, integer sort can be applied and thus ts = O(|K|); otherwise, ts = O(|K| log |K|). For real world applications, |K| is usually not smaller than n and thus our algorithms achieve linear time. The proposed algorithms improve the previous upper bounds from O(min{n|K|, n2}) for RLPW and from O(n|K|) for RLPWI.
An Optimized Hardware Accelerator for Real Time Registration of Aerial Video Imagery and Its Applications
Authors: Rehan Hafiz, M. Ali Tahir, Omair Arshad, Shoab A. Khan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Aerial video imagery is widely used in mapping, surveillance and monitoring applications. An aerial video can give sufficient information, but it does not offer the freedom and flexibility of working with a geo-registered image or map. Our paper provides a cost effective, robust and efficient solution for real time Video Registration. We propose a fast compact FPGA processing module. The FPGA module implements the computationally intensive routines of the algorithm. Three level pipelining is incorporated to enhance the clock speed to 30 MHz. We also present two applications of our proposed hardware using the core Registration algorithm. The first is anair-to-ground target tracker. The second application is a jerky hand-held video stabilizer application. It can be used for improved targeting from telescope-mounted weapons e.g. sniper, while firing from a moving vehicle. C++ implementations of these algorithms have been tested to demonstrate encouraging results.
University Course Scheduling System (UCSS): a UML application with database and visual programming
Authors: Sueychyun (Roger) Fang
Venue: Journal of Computing Sciences in Colleges (2005)

Course scheduling of universities is a large, complex, and time-consuming task. Along the time line of each classroom slots must be able to be allocated to instructors and their classes of different departments without violating any predefined rules. This paper describes the use of UML (Unified Modeling Language) in a course scheduling system which is designed to assist users to solve this resource-constrained timetabling problem. The system is written in Visual Basic .NET and SQL Server 2000 and is successfully deployed to support two schools' course scheduling tasks in Arkansas Tech University.
The synergy of electronic commerce, agents, and semantic Web services
Authors: M. Brian Blake, Simon Parsons, Terry R. Payne
Venue: The Knowledge Engineering Review (2004)

Advancements in software agents and Semantic Web service technologies are generally enhancing the landscape of electronic commerce. Semantic Web service technologies promise the standardisation and discoverability of software capabilities for network-enabled organisations. Moreover, with the addition of the intelligence and autonomy of software agents, transactions may be equally automated for consumer-to-consumer, business-to-consumer, and business-to-business collaborations. The 2003 Workshop on Electronic Commerce, Agents, and Semantic Web Services was held in conjunction with the International Conference on Electronic Commerce (ICEC2003). The purpose of this workshop was to bring together researchers and practitioners in the areas of electronic commerce, agents, and Semantic Web services to discuss the state-of-art in each individual area in addition to the synergies among the areas. This paper contains a summary of the workshop presentations and a discussion of next steps for Semantic Web services created in the working sessions concluding the workshop.
History Calls: Delivering Automated Audio Tours to Visitors' Cell Phones
Authors: Matthew Nickerson
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Many museums around the world rent audio players to their visitors to provide automated tours delivering pre-recorded information about their exhibits. Though generally pleased with their patrons' responses to automated audio tours museum administrators find that hosting them can be expensive, time consuming, and frustrating. Ongoing advances in mobile wireless technology provide an alternative to the current cumbersome method of renting sound players to museum visitors. Many patrons bring their own "digital sound player" with them in the guise of their personal cell phone. As cell phones proliferate and the price of calling plans falls cell phones may present a viable alternative to current audio tour systems. History Calls was a recent experiment using VXML technology to deliver an automated audio museum tour directly to patrons' cell phones.
Many-Valued Intuitionistic Implication and Inference Closure in a Bilattice-Based Logic
Authors: Zoran Majkic
Venue: Proceedings of the 35th International Symposium on Multiple-Valued Logic (2005)

In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intuitionistic logics. This kind of logic programming is particularly useful for data integration with possibly incomplete and inconsistent information.We define an ontological encapsulation of the epistemic many-valued logic programs with negation, based on this bilattice, into 2-valued meta logic programs. Obtained 2-valued logic semantically reflects original epistemic many-valued logic, and can be used in order to define many-valued logic entailment and inference closure for many-valued truth assignments.
Signal processing for a benchmark for radar resource allocation in the presence of ECM
Authors: V. Behar, C. Kabakchiev, X. R. Li
Venue: Signal Processing (2005)

A simple post-detection integration technique is proposed to solve the benchmark problem for radar resource allocation in the presence of false alarms (FA) and electronic counter measurements (ECM). The benchmark problem is considered only from the point of view of target detection, and as a result, two new algorithms for adaptive radar resource allocation are presented. The algorithms proposed adaptively select radar dwells (type and number), form thresholds for signal detection and RGPO elimination, and evaluate current estimates of target and SOJ parameters. Simulation results show that the non-coherent integration technique is the most effective in the presence of stationary radar environment while improving the target-to-signal ratio (SNR). In the presence of ECM, however, the non-coherent technique is desired only at the first several scans, at which the more accurate measurements of target and SOJ parameters are produced. In the presence of RGPO, the excision technique is used to remove RGPO from the range gate before target detection.
On the Use of Wavelet-Based Denoising to Improve Power Delay Profile Estimates from 1.8 GHz Indoor Wideband Measurements
Authors: M. H. Dias, G. L. Siqueira
Venue: Wireless Personal Communications: An International Journal (2005)

This work presents an alternative processing scheme to improve measurement-based power delay profiles (PDP) estimates, using wavelet-based denoising. The usual PDP processing comprises cutting off all the data below a previously determined flat noise threshold. The proposed method is a more refined approach, since it tries to extract the noise from the measured data, keeping only the estimated signal. Wavelet denoising can be performed in many different ways, for it depends on several parameters, like the noise threshold selection rule, the wavelet function, the choice or not for a wavelet coefficients shrinkage and the number of decomposition levels. Several parameter combinations have been tested, in special for the Visu selection rule, which presented the best performance for the available data in the overall. Denoising was applied to real data from indoor environments, collected from wideband channel sounding surveys, centered at 1.8 GHz. Since frequency domain sounding has been carried out, denoising has been tested both directly over the frequency domain, and over the time--delay domain (PDP). The major result of the proposed processing was a qualitative improvement of the PDP, with smoother noise floors, and also with increases up to 8 dB on signal-to-noise ratios, in special for delay domain denoising.
Replication techniques for a metal microcomponent having real 3D shape by microcasting process
Authors: S. Chung, S. Park, I. Lee, H. Jeong, D. Cho
Venue: Microsystem Technologies (2005)

In this paper, new replication techniques for a metal microcomponent having a real 3D shape were introduced. A helical gear was selected as one of a real 3D microcomponents for this study. The helical gear, which was made of photo-curable resin, was fabricated as a master pattern by microstereolithography (MSL) technology. Then, a silicone rubber mold was fabricated from the master pattern. Lastly, a final bismuth alloy pattern was transferred from the silicone rubber mold by the microcasting process. In this paper, the replication technique is described in detail from the master pattern to the final pattern with some investigation on factors related to the technique.
Reconstructing camera projection matrices from multiple pairwise overlapping views
Authors: Jacob Goldberger
Venue: Computer Vision and Image Understanding (2005)

In this work we address the problem of projective reconstruction from multiple views with missing data. Factorization based algorithms require point correspondences across all the views. In many applications this is an unrealistic assumption. Current methods that solve the problem of projective reconstruction with missing data require correspondence information across triplets of images. We propose a projective reconstruction method that yields a consistent camera set given the fundamental matrices between pairs of views without directly using the image correspondences. The algorithm is based on breaking the reconstruction problem into small steps. In each step, we eliminate as much uncertainty as possible.
The accounting system as an algebraic automaton: Research Articles
Authors: Salvador Cruz Rambaud, José García Pérez
Venue: International Journal of Intelligent Systems (2005)

This article aims to present a mathematical model to describe the accounting system. In effect, in the literature on accounting we can find several mathematical models trying to introduce the accounting mechanics but in this article we use the concept of algebraic automaton, which has been successfully used in other economic fields, like finance. Thus, from this new point of view we can construct all definitions and accounting techniques as a particular case of the concept of automaton. &copy; 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 827&ndash;842, 2005.
An example of practical component testing
Authors: Catherine V. Stringfellow, Duane Lee York
Venue: Journal of Computing Sciences in Colleges (2004)

Studying real world software development practices benefits student learning of software engineering concepts. Results of a survey on component testing conducted by a student show how some software developers in industry actually perform component testing and how important they feel certain testing techniques are.