ppxscal/embedding_network huggingface dataset:
Including Conditional Operators in Content-Based Image Retrieval in Large Sets of Medical Exams
Authors: Caetano Traina Jr., Agma J. M. Traina, Josiel Maimoni de Figueiredo
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Content-Based Image Retrieval Systems (CBIR) aim at helping in searching large image collections to find those more likely to answer query conditions based on the information represented in the images. To speed up the search process, selected features are extracted from each image when they are stored in the database, so each one is represented by a feature vector. Subsequent image searching operations are performed using the feature vectors in place of the images. The feature extraction algorithms have important issues in CBIR due to the large semantic gap between the low-level features extracted as compared to the high-level, semantic, results expected by the users. A way to approach a semantic analysis of an image, as performed by humans, is to employ a large number of analyzers whose results are processed by a set of rules based on if-then clauses. In this paper we create a framework to define image processing and feature extraction algorithms for CBIR systems as components of a data ow architecture, including an analysis mechanism to interpret images. It is based on decision components that check the results of previously executed feature extractors to choose from a set of configurable execution paths that leads to the creation of the feature vector of each image. In the paper we will describe a real system that has been implemented based on these concepts, which is being used as a teaching tool in a school hospital.
A Probabilistic Approach to Buffer Insertion
Authors: Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati, Ankur Srivastava
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This work presents a formal probabilistic approach for solving optimizationproblems in design automation. Prediction accuracy isvery low especially at high levels of design flow. This can be attributedmainly to unawareness of low level layout information andvariability in fabrication process. Hence a traditional deterministicdesign automation approach where each cost function is representedas a fixed value becomes obsolete. A new approach is gainingattention in which the cost functions are representedas probability distributions and the optimization criteriais probabilistic too. This design optimization philosophy is demonstratedthrough the classic buffer insertion problem. Formally,we capture wirelengths as probability distributions (as compared tothe traditional approach which considers wirelength as fixed values)and present several strategies for optimizing the probabilisticcriteria. During the course of this work many problems are provedto be NP-Complete. Comparisons are made with the Van-Ginneken"optimal under fixed wire-length" algorithm. Results show that theVan-Ginneken approach generated delay distributions at the root ofthe fanout wiring tree which had large probability (0.91 in the worstcase and 0.55 on average) of violating the delay constraint. Ouralgorithms could achieve 100% probability of satisfying the delayconstraint with similar buffer penalty. Although this work considerswirelength prediction inaccuracies, our probabilistic strategy couldbe extended trivially to consider fabrication variability in wire parasitics.
Context-based Personalization of Web Services Composition and Provisioning
Authors: Zakaria Maamar, Ghazi AlKhatib, Soraya Kouadri Mostefaoui, Mohammed B. Lahkim, Wathiq Mansoor
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper presents an approach that aims at personalizing Web services composition and provisioning using context. Composition addresses the situation of a user's request that cannot be satisfied by any available service, and thus requires the combination of several Web services. Provisioning focuses on the deployment of Web services according to users' preferences. A Web service is an accessible application that other applications and humans can discover and trigger. Context is the information that characterizes the interactions between humans, applications, and the surrounding environment. Web services are subject to personalization if there is a need of accommodating users' preferences during service performance and outcome delivery. To be able to track personalization in terms of what happened, what is happening, and what might happen three types of context are devised, and they are referred to as user-, Web service-, and resource-context.
A parallel solver for PDE systems and application to the incompressible Navier-Stokes equations
Authors: Eero Vainikko, Ivan G. Graham
Venue: Applied Numerical Mathematics (2004)

The DOUG (domain decomposition on unstructured grids) package was first developed from 1996-1998 as a parallel solver for scalar elliptic PDEs discretised with finite elements. In this paper we describe its extension to unsymmetric elliptic systems of PDEs, highlighting software design and parallelisation issues. As an application we discuss the performance of the extended package applied to the incompressible Navier-Stokes equations, discretised with mixed finite elements. In particular we focus on discontinuous pressure elements, which are important in many practical applications. We also indicate briefly the application of this solver to Navier-Stokes stability assessment.
A Survey on Dependable Routing in Sensor Networks, Ad hoc Networks, and Cellular Networks
Authors: Matthias Hollick, Ivan Martinovic, Tronje Krop, Ivica Rimac
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The class of wireless and mobile networks features a dissimilar set of characteristics and constraints compared to traditional fixed networks. The various dimensions of these characteristics/constraints strongly influence the routing system, which is often regarded as the glue of a network. We introduce the concept of routing dependability describing the trustworthiness of a routing system such that reliance can justifiably be placed on the consistency of behavior and performance of the routing service delivered. We investigate this concept by analyzing the basic characteristics of various networks. Subsequently, we derive the most important attributes and impairments that contribute to routing dependability in sensor networks, ad hoc networks, and infrastructure-based cellular networks. Departing from state-of-the-art network designs, we extend our survey to cover future network architectures as well. We finish by briefly investigating possible directions and means that allow mitigating the deprivation of dependability.
Detail-Preserving Variational Surface Design with Multiresolution Constraints
Venue: Proceedings of the Shape Modeling International 2004 (2004)

We present a variational framework for rapid shape prototyping.The modeled shape is represented as a Catmull-Clark multiresolution subdivision surface which is interactively deformed by direct user input. Free-form design goalsare formulated as constraints on the shape and the modelingproblem is cast into a constrained optimization one. The focusof this paper is on handling multiresolution constraintsof different kinds and on preserving surface details throughoutthe deformation process. Our approach eliminates theneed for an explicit decomposition of the input model intofrequency bands and the overhead associated with savingand restoring high-frequency detail after global shape fairing.Instead, we define a deformation vector field over themodel and we optimize its energy. Surface details are consideredas part of the rest shape and are preserved duringfree-form model editing. We explore approximating the solutionof the optimization problem to various degrees to balancetrade-offs between interactivity and accuracy of the results.
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Authors: Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vernon, Ernst W. Biersack
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for short flows while not significantly increasing the average flow time for the long flows that share the same bottleneck. No modification of the packet headers is required to implement the simple LAS policy. However, previous work has also shown that a drawback of the LAS scheduler is that, when link utilization is greater than 70%, long flows experience large jitter in their packet transfer times as compared to the conventional First-Come-First-Serve (FCFS) link scheduling. This paper proposes and evaluates new differentiated LAS scheduling policies that reduce the jitter for long flows that are identified as "priority" flows.To evaluate the new policies, we develop analytic models to estimate average flow transfer time as a function of flow size, and average packet transmission time as a function of position in the flow, for the single-bottleneck "dumbbell topology" used in many ns simulation studies. Models are developed for FCFS scheduling, LAS scheduling, and each of the new differentiated LAS scheduling policies at the bottleneck link. Over a wide range of configu-rations, the analytic estimates agree very closely with the ns estimates. Thus, the analytic models can be used instead of simulation for comparing the policies with respect to mean flow transfer time (as a function of flow size) and mean packet transfer time. Furthermore, an initial discrepancy between the analytic and simulation estimates revealed errors in the parameter values that are often specified in the widely used ns Web workload generator. We develop an improved Web workload specification, which is used to estimate the packet jitter for long flows (more accurately than with previous simulation workloads).Results for the scheduling policies show that a particular policy, LAS-log, greatly improves the mean flow transfer time for priority long flows while providing performance similar to LAS for the ordinary flows. Simulations show that the LAS-log policy also greatly reduces the jitter in packet delivery times for the priority flows.
P-Quadtrees: A Point and Polygon Hybrid Multi-Resolution Rendering Approach
Authors: Junfeng Ji, Sheng Li, Xuehui Liu, Enhua Wu
Venue: Proceedings of the Computer Graphics International (2004)

Point and polygon representations have theirrespective merits in rendering objects. In this paper, wepropose a novel hybrid multi-resolution approach, P-Quadtrees,to efficiently render highly detailed objects. P-Quadtreesare constructed from geometry images. Bothpoint and polygon are tightly integrated into a uniformstructure. While traversing the P-Quadtrees in rendering,the part of surface that face the viewer can be renderedby coarser quad mesh to reduce the numbers of renderingprimitives. The shading details can be enhanced byhardware accelerated normal mapping. The viewdependent LOD selects the finer hierarchy on silhouette,which is rendered by points. The rendering of large-scalemodel is greatly accelerated while the visual effect both atthe surfaces and the silhouette is guaranteed.
Influencing bone remodeling in osteoporosis
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

A physician education piece on osteoporosis and the mechanism of action of Actonel, a drug for its treatment. Bone is living tissue that is constantly renewed. Cells called osteoclasts remove damaged bone and cells called osteoblasts replace it with new bone. Because estrogen suppresses osteoclast activity, postmenopausal estrogen loss causes an imbalance in favor of the osteoclast, that is, bone removal. When more bone is removed than replaced, bone thinning causes osteoporosis. Actonel is absorbed by bone and ingested by osteoclasts during bone removal. By interfering with cell functioning, Actonel kills osteoclasts. Remodeling balance is restored and osteoporotic fracture risk is reduced. Copyright held by creator.
Polar bears "Gary's Fall"
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Captive polar bears Gary and his son Shane are playing football with an old tin. Just as mum Claudia warns Shane not to fall, Gary falls in the recently emptied pool instead. He ends up with both arms sticking out sideways in plaster, prompting the other polar bears to tease him relentlessly. This computer animation was produced over a 7 month period by animation house and post facility MacGuff Ligne in Paris using Maya software for the animation and their own proprietary software MGLR (MacGuff Ligne Rendering) for the rendering and compositing. Copyright held by creator.
Supporting Web-Based Collaboration between Virtual Enterprise Partners
Authors: Damien Bright, Gerald Quirchmayr
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Many of the processes in a dynamic virtual enterprise (VE) are collaborative in nature and require consideration of cross organizational issues. In this paper we present a way of supporting web-based collaboration between organizations within a dynamic real-time virtual enterprise. In our approach we focus on a service oriented view of collaboration that is compatible with emerging web service industry standards based on XML, SOAP, and WSDL. We also introduce a collaboration system which uses multi-agent system (MAS) technology and specialized tuplespaces to realize many of the desired categories of automated support.
On the sunny side of the street
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A Harlem street scene in the 1920's. H.H. Sablin just wants to read his daily newspaper, as his bench-neighbor Pit Doogey acts very busy preparing a barbeque, without taking any regard of Sablin. Under these conditions, the accidental meeting of both couldn't have a happy ending, could it? Copyright held by creator.
Incidence of Oxide and interface degradation on MOSFET performance
Authors: A. Cester, L. Bandiera, S. Cimino, A. Paccagnella, G. Ghidini
Venue: Microelectronic Engineering (2004)

In this work, we have studied how oxide and interface degradation affect the performance of MOSFETs with ultrathin gate oxide, in terms of transconductance (gm). saturation drain current (IdsSAT), and threshold voltage (Vds) before soft breakdown and hard breakdown. MOSFET transconductance and drain current decrease due to oxide traps which act as interface state reducing channel carrier mobility and enhancing the drain current noise. We found strong correlation between these traps and the well-known stress reduced leakage current (SILC) indicating that the same traps producing the degradation of MOSFET characteristics are those involved in SILC conduction.
Integration of UML and VHDL-AMS for analogue system modelling
Authors: C. T. Carr, T. M. McGinnity, L. J. McDaid
Venue: Formal Aspects of Computing (2004)

This paper details a new object-oriented methodology that permits a unified modelling language (UML) behavioural representation of analogue circuits at system level. The proposed method demonstrates a novel approach to the problem of behavioural representation of an analogue topology, by constructing a consistent set of rules for automated mapping of the UML model to a VHDL-AMS specification. The VHDL-AMS specification enables behavioural simulation of the UML model and the methodology is validated using an analogue subsystem level application.
The Full Cost of Cryptanalytic Attacks
Authors: Michael J. Wiener
Venue: Journal of Cryptology (2004)

An open question about the asymptotic cost of connecting many processors to a large memory using three dimensions for wiring is answered, and this result is used to find the full cost of several cryptanalytic attacks. In many cases this full cost is higher than the accepted complexity of a given algorithm based on the number of processor steps. The full costs of several cryptanalytic attacks are determined, including Shanks&#x2019; method for computing discrete logarithms in cyclic groups of prime order n, which requires n1/2+o(1) processor steps, but, when all factors are taken into account, has full cost n2/3+o(1). Other attacks analyzed are factoring with the number field sieve, generic attacks on block ciphers, attacks on double and triple encryption, and finding hash collisions. In many cases parallel collision search gives a significant asymptotic advantage over well-known generic attacks.
Design and Implementation of Reciprocal Unit Using Table Look-up and Newton-Raphson Iteration
Authors: Umut Kucukkabak, Ahmet Akkas
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Combination of initial approximation through a table look-up and Newton-Raphson iteration is an effective way to compute reciprocal, which may replace the division op-eration. This paper presents the design and implementation of reciprocal unit, which computes the reciprocal of double precision of floating-point number in eleven clock cycles. The presented design utilizes a 2^{10} x 20 bits ROM followed by two Newton-Raphson iterations.The design is implemented in VHDL and synthesized to estimate the area and the worst case delay.Simulation results show that the least significand bit of the result cannot be guaranteed to be correct for all cases.
Connectors " A Framework for Building Graphical Applications in Squeak
Authors: Ned Konz
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Connectors is a framework for building structureddrawing editors using Squeak. The rich componentlibrary provided with Connectors makes it easy tocustomize shapes and connectors, in many caseswithout writing any code.This paper will describe how Connectors can beused to quickly construct a Squeak application forediting and visualizing structured data. It will describethe entire process of developing a simple Connectorsapplication, including customizing connectors,connection policy, shapes, toolbars, flaps, and worlds.Integration with the Genie gesture recognitionsystem and the eToy tile scripting system is alsodescribed.
High-Throughput Microarray-Based Genotyping
Authors: Geoffrey Yang, Ming-Hsiu Ho, Earl Hubbell
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A high throughput genotyping platform that scores over 10,000 single-nucleotide polymorphisms (SNPs) per individual on a single GeneChip® high-density oligonucleotide microarray has been developed to conduct studies to elucidate the genetic basis for complex diseases. Currently, the genotyping of individual SNPs relies on the summary statistics (based on the observed intensities of probes on the microarray) for the entirety of the sample set. A classification scheme of those statistics across hundreds of individual DNA samples is obtained to make individual genotyping calls. In contrast to the current approach, the method in this work makes individual genotyping call by finding the minimum residual, i.e. highest likelihood, among four possible states corresponding to three genotypes and no-call. Initially, the residual is calculated based on a given set of probe affinities for that individual sample. Auspiciously, the multitude of samples was utilized to iterate to refine the probe affinities, sample concentration, and background intensities. These refined parameters entail an improved call rate while maintaining high accuracy.
Electrophotographic printer control as embodied in the IBM 3800 printing subsystem models 3 and 8
Authors: C. Barrera,  III, A. V. Strietzel
Venue: IBM Journal of Research and Development (1984)

Control of the IBM 3800 Models 3 and 8 electrophotographic printers is achieved by use of a fundamentally different control system than was used in their predecessors, the Models 1 and 2. As a result, printing of composed pages or electronic overlays can include text of many different font sizes and styles printed in multiple orientations, as well as raster images up to a full page in size. The printers manage stored resources, including fonts, segments of pages, and electronic overlays. Pages are composed inside the printers in a logical sequence, instead of by the more traditional line-by-line sequence. This, as well as the capability to position text and images at any addressable point, enhances usability. A high-speed, table-driven character generator, a new command set, and a microcoded control unit make all of this possible.
Lower Bounds for Testing Bipartiteness in Dense Graphs
Authors: Andrej Bogdanov, Luca Trevisan
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We consider the problem of testing bipartitenessin the adjacency matrix model. The best known algorithm,due to Alon and Krivelevich, distinguishes betweenbipartite graphs and graphs that are ¿-far frombipartite using \mathop 0\limits^ \sim(1/\varepsilon ^2 ) queries. We show that thisis optimal for non-adaptive algorithms, up to polylogarithmicfactors. We also show a lower bound of\Omega (1/\varepsilon ^{3/2} ) for adaptive algorithms.
Vocabulary Use in XML Standards in the Financial Market Domain
Authors: Jian Qin, Mary D. Taffet
Venue: Knowledge and Information Systems (2004)

Vocabulary issues are central to XML-based e-commerce standards. The rapid increase in the number of XML standards has made the vocabulary issues a critical area of XML applications. This paper reports the result from a study of the vocabulary use in XML standards. Choosing five DTDs from the financial and capital markets domain, we examined a total of 1346 elements in nine categories. Inconsistent naming conventions and varying practices were major problems among other findings. We also observed a number of linguistic and semantic patterns in element names. Such patterns show a potential to serve as a foundation for building ontology-based conceptual models for XML schemas. The authors propose an ontology-driven, dynamic coordination approach in developing schema elements.
Customized Answers to Summary Queries via Aggregate Views
Authors: Francesco M. Malvestuto, Elaheh Pourabbas
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Statistical users typically require summary tables andwant fast and accurate answers to their queries. Usually,the query system keeps materialized aggregate viewsto speed up the evaluation of summary queries. If the summarytable on the variable of interest to a statistical user isnot derivable from the set of materialized aggregate views,the answer to his query will consist of an estimate and, if theuser is a domain expert, he would like to participate in theestimation process. Therefore, he should be left the possibilityof "tuning" the response to an auxiliary variable, forwhich either there is a materialized aggregate view or aggregatedata can be externally provided by the user himself.In this framework, we solve the computational problems relatedto the estimation of summary queries, and propose efficientalgorithms which make use of notions and techniquesdeveloped in the theory of acyclic database schemes.