ppxscal/embedding_network huggingface dataset:
On Newton-type methods with cubic convergence
Authors: H. H. H. Homeier
Venue: Journal of Computational and Applied Mathematics (2005)

Recently, there has been some progress on Newton-type methods with cubic convergence that do not require the computation of second derivatives. Weerakoon and Fernando (Appl. Math. Lett. 13 (2000) 87) derived the Newton method and a cubically convergent variant by rectangular and trapezoidal approximations to Newton's theorem, while Frontini and Sormani (J. Comput. Appl. Math. 156 (2003) 345; 140 (2003) 419 derived further cubically convergent variants by using different approximations to Newton's theorem. Homeier (J. Comput. Appl. Math. 157 (2003) 227; 169 (2004) 161) independently derived one of the latter variants and extended it to the multivariate case. Here, we show that one can modify the Werrakoon-Fernando approach by using Newton's theorem for the inverse function and derive a new class of cubically convergent Newton-type methods.
Face Detection Using Combinations of Classifiers
Authors: Geovany A. Ramirez, Olac Fuentes
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper we present a two-stage face detection system. The first stage reduces the search space using two heuristics in cascade: 1) In a face image, the average intensity of the eyes is lower than the intensity of the part between the eyes, and 2) The histograms of the grayscale image of a face with uniform lighting have a distinguishable shape. In the second stage we use combinations of different classifiers including: Naive Bayes (NB), Support Vector Machine (SVM), Voted Perceptron (VP), C4.5 rule induction and Feedforward Artificial Neural Network (ANN); we also propose a simple lighting correction method. We use the BioID face dataset to test our system achieving up to a 95.13% of correct detections.
Evaluation of iterative methods for aperture correction in SPECT
Authors: Nobuhiro Haruta, Koichi Ogawa
Venue: Systems and Computers in Japan (2005)

This paper uses simulations of numerical phantoms to compare the performance of different iterative-approximation methods of aperture correction in single-photon emission computed tomography (SPECT); aperture correction is employed to remove blurrings in the reconstructed image that are caused by the collimator used to acquire SPECT data. The comparisons take the size of the aperture angle, radius of the detector's rotation, and amount of Poisson noise as parameters, and follow quantitative standards as a basis for visually assessing the images obtained from seven different iterative correction methods. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 23&ndash;32, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20158
On Design of Parallel Memory Access Schemes for Video Coding
Authors: Jarno K. Tanskanen, Reiner Creutzburg, Jarkko T. Niittylahti
Venue: Journal of VLSI Signal Processing Systems (2005)

Some of the modern powerful digital signal processors (DSPs) have byte-addressable internal data memory. This property is valuable especially in computationally demanding inter frame video encoding, where data accesses are typically unaligned according to word boundaries. The byte-addressable memory allows load or store command to start accessing from any byte-address, providing at most as many successive bytes from subsequent addresses as data bus can handle in parallel. Maybe the simplest way to construct such a byte-addressable memory is to use N 8-bit memory modules or banks to be accessed in parallel, when N is data bus width in bytes. However, in addition to byte-addressable subsequent bytes, memory consisting of parallel memory modules can provide much more versatile addressing capabilities with reasonable implementation cost. Versatile access formats can significantly reduce the need for data reordering in the register file. At first, we provide motivation for using parallel memory architecture with versatile access formats as an internal on-chip data memory of modern DSP. After this, notations are described and general view of parallel memory design is given. We propose some example parallel data memory architecture designs with data access formats especially helpful in H.263 encoding and MPEG-4 core profile motion and texture encoding. The examples are given for different data bus widths (16, 32, 64, and 128 bits). Finally, performance is shortly compared to other memory architectures and area, delay, and power figures are estimated.
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
Authors: H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Rui Zhang
Venue: ACM Transactions on Database Systems (TODS) (2005)

In this article, we present an efficient B&plus;-tree based indexing method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition. The data points in each partition are transformed into a single dimensional value based on their similarity with respect to the reference point. This allows the points to be indexed using a B&plus;-tree structure and KNN search to be performed using one-dimensional range search. The choice of partition and reference points adapts the index structure to the data distribution.We conducted extensive experiments to evaluate the iDistance technique, and report results demonstrating its effectiveness. We also present a cost model for iDistance KNN search, which can be exploited in query optimization.
Beyond templates: a study of clones in the STL and some general implications
Authors: Hamid Abdul Basit, Damith C. Rajapakse, Stan Jarzabek
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Templates (or generics) help us write compact, generic code, which aids both reuse and maintenance. The STL is a powerful example of how templates help achieve these goals. Still, our study of the STL revealed substantial, and in our opinion, counter-productive repetitions (so-called clones) across groups of similar class or function templates. Clones occurred, as variations across these similar program structures were irregular and could not be unified by suitable template parameters in a natural way. We encountered similar problems in other class libraries as well as in application programs, written in a range of programming languages. In the paper, we present quantitative and qualitative results from our study. We argue that the difficulties we encountered affect programs in general. We present a solution that can treat such template-unfriendly cases of redundancies at the meta-level, complementing and extending the power of language features, such as templates, in areas of generic programming.
Interactive visibility ordering and transparency computations among geometric primitives in complex environments
Authors: Naga K. Govindaraju, Michael Henson, Ming C. Lin, Dinesh Manocha
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We describe a novel algorithm for visibility ordering among non-overlapping geometric objects in complex and dynamic environments. Our algorithm rearranges the objects in a back-to-front or a front-to-back order from a given viewpoint. We perform comparisons between the primitives by using occlusion queries on the GPUs and exploit frame to frame coherence to reduce the number of occlusion queries. Our visibility ordering algorithm requires no preprocessing and is applicable to all kind of models, including polygon soups and deformable models. We have used our algorithm for order-independent transparency computations in high-depth complexity environments and performing N-body collision culling in dynamic environments. We have implemented our algorithm on a PC with a 3.4 GHz Pentium IV CPU with a NVIDIA GeForce FX 6800 Ultra GPU and applied it to complex environments with tens or hundreds of thousands of polygons. Our algorithm can compute a visibility ordering among the objects and triangles at interactive frame rates.
Adding Control-Flow to a Visual Data-Flow Representation
Authors: David Dearman, Anthony Cox, Maryanne Fisher
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Previous studies have shown that novices do not tend to extract or use data-flow information during program comprehension. However, for impact analysis and similar tasks, data-flow information is necessary and highly relevant. Visual data-flow programming languages, such as Prograph/CPX, have been commercially successful, suggesting that they provide effective data-flow representations. To explore data-flow representations for program comprehension, we augment Prograph data-flow programs with control-flow features to determine the effects on comprehension. We hypothesize that combined control/data-flow representations will aide comprehension better than data-flow alone. To validate this hypothesis, we present the results of an experiment comparing three combined representations against a data-flow only representation. While the addition of control-flow was found to be beneficial, the complexity of the representations plays an important role. Complex and highly detailed control-flow, although perceived as useful, is less effective when combined with data-flow, than less detailed and less complex control-flow descriptions. This finding suggests a tradeoff exists between a representation's content and complexity. We found a nested representation describing inter-method control-flow to be the most effective for supporting program comprehension.
Lower Bounds for Simplicial Covers and Triangulations of Cubes
Authors: Adam Bliss, Francis Edward Su
Venue: Discrete Computational Geometry (2005)

We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of a minimal triangulation of P, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their exterior faces.
Practical experience with adaptive service access
Authors: Umar Saif, Justin Mazzola Paluska, Vijay Praful Chauhan
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2005)

The dynamically changing nature of the emerging networked environments warrants a computing model in which resources are dynamically discovered and opportunistically utilized to maintain continuity of service. This paper describes the design and implementation of Lightweight Adaptive Network Sockets (LANS) for accessing services in such a dynamically changing networked environment. A LANS socket takes a high-level description of a service and opportunistically connects to the best provider of the service in the changing environment of the application. LANS builds on the architectural philosophy of Service-oriented Network Sockets (SoNS)[13], in that it integrates a service-oriented abstraction with the operating system socket interface and provides adaptive service access at the end-host session layer. However, our experience with SoNS led to three key improvements for the LANS architecture. 1) The LANS session layer reduces the computation and communication over-head resulting from the SoNS end-to-end architecture. 2) LANS is designed to offer richer semantics for resource selection and allocation to enable better utilization of resources in shared pervasive environments. 3) Applications in LANS can control the opportunistic behavior of the system to avoid perfunctory reconnections. Our experiments show that LANS running on an iPAQ consumes 40% less power, requires less than 1% of the network traffic, and is far less processor hungry than the original version of SoNS --- without compromising performance and offering richer semantics for adaptive service access.
Performance control of scientific coupled models in Grid environments: Research Articles
Authors: Christopher Armstrong, Rupert W. Ford, John R. Gurd, Mikel Luján, Kenneth R. Mayes, Graham D. Riley
Venue: Concurrency and Computation: Practice Experience (2005)

In recent years, there has been increasing interest in the development of computer simulations of complex biological systems, and of multi-physics and multi-scale physical phenomena. Applications have been developed that involve the coupling together of separate executable models of individual systems, where these models may have been developed in isolation. A lightweight yet general solution is required to problems of linking coupled models, and of handling the incompatibilities between interacting models that arise from their diverse origins and natures. Many such models require high-performance computers to provide acceptable execution times, and there is increasing interest in utilizing Grid technologies. However, Grid applications need the ability to cope with heterogeneous and dynamically changing execution environments, particularly where run-time changes can affect application performance. A general coupling framework (GCF) is described that allows the construction of flexible coupled models. This approach results in a component-based implementation of a coupled model application. A semi-formal presentation of GCF is given. Components under GCF are separately deployable and coupled by simple data flows, making them appropriate structures for dynamic execution platforms such as the Grid. The design and initial implementation of a performance control system (PERCO) is reviewed. PERCO acts by redeploying components, and is thus appropriate for controlling GCF coupled model applications. Redeployment decisions in PERCO require performance prediction capabilities. A proof-of-concept performance prediction algorithm is presented, based on the descriptions of GCF and PERCO. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles
Authors: Y. Tock, G. F. Inbar, Y. Steinberg, M. Ljubisavljevic, J. Thunberg, U. Windhorst, H. Johansson
Venue: Biological Cybernetics (2005)

The information transmission properties of ensembles of MSs and the effect of the gamma system on these properties were studied. Three converging lines of research were taken: (1) the development of information theoretic estimation tools, and the formulation of an &#x201c;operational&#x201d; interpretation for the information rate; (2) animal experiments in which the mutual information rate was estimated and the effect of the gamma system was quantified; (3) simulation of a muscle spindle model with gamma activation in order to corroborate the results of the animal experiments. The main hypothesis was that the gamma system will enhance information theoretic measures that quantify the quality of the sensory neural channel comprised from an ensemble of primary muscle spindle afferents. A random stimulus was applied to a muscle in the hind limb of a cat, while spike trains from several primary MS afferents were recorded simultaneously. The stimulus was administered twice, with an operative and a disconnected gamma system. The mutual information rate between the stimulus and spike trains, as well as other information theoretic measures, was estimated. The information rate of ensembles of MSs increased with increasing ensemble size. However, with an operative gamma system the &#x201c;ensemble effect &#x201d; was much higher. In addition, the ensemble effect was influenced by the stimulus spectrum. A muscle spindle population model with gamma activation was simulated with stimuli that were identical to that of the animal experiments. The simulation results supported the experimental results and corroborated the main hypothesis. The results indicate that the gamma system has an important role in enhancing information transmission from ensembles of MSs to the spinal cord.
Using Coupled Subspace Models for Recovery of Reflectance Spectra from Airborne Images
Authors: Kartik Chandra, Glenn Healey
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The spectral radiance measured by an airborne sensor is dependent on the spectral reflectance of the ground material, the orientation of the material surface, and the atmospheric and illumination conditions. We present a nonlinear algorithm for estimating surface spectral reflectance of a surface on the ground from the spectral radiance measured by an airborne sensor. The nonlinear separation algorithm uses a low-dimensional subspace model for the reflectance spectra. The algorithm also considers the inter-dependence of the path radiance and illumination spectra by using a coupled subspace model. We have applied the algorithm to a large set of 0.4-1.74 micron sensor radiance spectra. We have examined the use of the recovered reflectance vectors for material identification over a database of materials from the US geological Survey (USGS) library. We also extend the nonlinear algorithm to estimate the reflectance spectra of materials having varying orientations. We have applied the algorithm to 0.42-1.74 micron sensor radiance spectra in Digital imaging and remote sensing image generation (DIRSIG) model scenes that contain 3D objects.
Copyright, law and ethics on the web: issues for the computing educator
Authors: Rebecca H. Rutherfoord
Venue: Journal of Computing Sciences in Colleges (2004)

Most educators are familiar with copyright and fair use practices. However, there are new considerations for copyright and fair use on the web. Copyright includes seven different categories, many of which are applicable to presentations and papers on the web. The seven categories are: 1) literary works; 2) musical works, including words; 3) dramatic works, including music; 4) pantomimes and choreographic works; 5) pictorial, graphic and sculptural works; 6) motion pictures and audiovisual works; and 7) sound recordings. Educators need to become aware of the implications of using any of these seven categories on the web. Other issues pertaining to law are patents, trademarks and trade secrets.Computing educators need to become aware of the new laws pertaining to copyright. The 1996 Telecommunications Act and the 1998 Digital Millenium Act are important for their implications for copyright. The newest TEACH act has implications for on-line and web courses. Some of the newest information concerning both of these acts shows that there may be some contradiction between the two. In addition, computing educators need to be aware of laws pertaining to access, privacy and accessibility when providing course material on the web. These issues are extremely important for not only copyright issues, but also for personal privacy issues. How the emerging technologies affect how we teach and what we are doing with our materials is important for all educators to know.This workshop will examine the various copyright law and ethical considerations, particularly as they pertain to the internet. Particular examples will be given using classroom scenarios. On-line documents, labs and other materials will be examined for use on the web pertaining to law, ethics and copyright issues. Participants will create various scenarios to use with their own classes. The participants will leave the workshop with a set of usable examples to use in various computer science, information technology or software engineering courses. These examples would be of possible ethical or law violations.
MUC-5 evaluation metrics
Authors: Nancy Chinchor, Beth Sundheim
Venue: Proceedings of the 5th conference on Message understanding (1993)

The metrics used for the Fifth Message Understanding Conference (MUC-5) evaluation are a major update to those used for MUC-4 in 1992. The official MUC-5 metrics express error rates while the official MUC-4 metrics express performance in terms of recall and precision (used for MUC-5 only as "unofficial" metrics). This paper discusses the current metrics and the reasons for their adoption.
Running Mac Os X Tiger (Animal Guide)
Authors: James Duncan Davidson
Venue:  (2005)

Running Mac OS X Tiger is the ideal resource for power users and system administrators like you who want to tweak Tiger, the new release of Mac OS X, to run faster, better, or just differently. If you areready to dig deep into your Mac, this book expertly guides you to the core of Mac OS X. It helps you understand the inner workings of the operating system so you can know how to get the most out of it. And it gives you countless ideas--and step-by-step instruction--for customizing and revving up Tiger to your specific needs and your liking. Completely revised and updated for Mac OS X Tiger, Running Mac OS X Tiger covers all the new features and functionality of Tiger. You can count on authors Jason Deraleau and James Duncan Davidson to give what you need--and not bother with what you don't. They don't spend time on Finder tips and keyboard shortcuts; they focus on showing you what makes a Mac tick and, more importantly, how you can make it tick just the way you want it to. Easy to follow and intuitively organized, Running Mac OS X Tiger is divided into three parts: "Getting Started" introduces Mac OS X and explains how it's put together and why it works; "Administration Essentials" gives you the tools you need to examine how your system is running and adjust all the knobs behind its operation; and "Networking and Network Services" covers the ways Mac OS X interfaces with the world around it, including wireless and spontaneous networking. Developer Tools for Mac OS X, including Xcode, are discussed throughout the book as appropriate. For the growing number of intermediate to advanced users who are ready and eager to customize Mac OS X, Running Mac OS X Tiger delivers everything you need to become master of your Mac.
Rules of thumb for secure software engineering
Authors: Holger Peine
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Profile before optimizing: a cognitive metrics approach to workload analysis
Authors: Wayne D. Gray, Michael J. Schoelles, Christopher W. Myers
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The Intelligence Analyst (IA) community will soon be the designated users of many new software tools. In the multitasking world of the IA, any one tool cannot be permitted to greedily consume cognitive resources. This situation requires a new approach to usability assessment; one that profiles the moment-by-moment demands placed on embodied cognition by a given software tool during task performance. The approach we have taken relies on families of cognitive models that interleave cognition, perception, and action at the 1/3 to 3 sec timescale. This is the level of analysis where embodied cognition forms interactive routines that adapt to the cost-benefit structure of the software tool. Our proof-of-concept is a model that performs a task that the IAs find challenging. From the trace of the model, we derive a cognitive metrics profile that pinpoints dynamic changes in workload demands on human cognitive, perceptual, or action systems.