ppxscal/embedding_network huggingface dataset:
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
Authors: David Tolliver, Gary L. Miller, Robert T. Collins
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, optimizing over the set CL naturally exploits the matrix sparsity by operating solely on the diagonal. This structure is critical to image segmentation applications because the number of vertices is generally proportional to the number of pixels in the image. CL optimization provides a guiding principle for improving the combinatorial solution over the spectral relaxation, which is important because small improvements in the cut cost often result in significant improvements in the perceptual relevance of the segmentation. We develop an optimization procedure to accommodate prior information in the form of statistical shape models, resulting in a segmentation method that produces foreground regions which are consistent with a parameterized family of shapes. We validate our technique with ground truth on MRI medical images, providing a quantitative comparison against results produced by current spectral relaxation approaches to graph partitioning.
Generalized Exponents and Forms
Authors: Anne V. Shepler
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We consider generalized exponents of a finite reflection group acting on a real or complex vector space V. These integers are the degrees in which an irreducible representation of the group occurs in the coinvariant algebra. A basis for each isotypic component arises in a natural way from a basis of invariant generalized forms. We investigate twisted reflection representations (V tensor a linear character) using the theory of semi-invariant differential forms. Springer's theory of regular numbers gives a formula when the group is generated by dim V reflections. Although our arguments are case-free, we also include explicit data and give a method (using differential operators) for computing semi-invariants and basic derivations. The data give bases for certain isotypic components of the coinvariant algebra.
Innovation in undergraduate computer science education
Authors: Amruth N. Kumar, Homma Farian, Matthew Haas, David G. Kay, Frank Lee, Yelena Kushleyeva
Venue: Journal of Computing Sciences in Colleges (2005)

What's new in the undergraduate Computer Science curriculum? Change is constant in Computer Science. Keeping up with the discipline requires that educators periodically design new courses or re-invent existing courses, re-organize majors and carve out new majors. This panel will present some of the innovations that have been introduced into the undergraduate Computer Science curriculum.
Cognitive science vs. artificial intelligence?: an early Greek fragment of dialogue found on an abandoned disk area
Authors: Andrew Ortony, Yorick Wilks
Venue: Issue 69 (January 1980) (1980)

HOMOGENES: If Cognitive Science is ever to become more than a part of AI, as I think and hope it will, then it is going to require a cooperative effort from those concerned with cognition, regardless of their principal discipline. This, in turn, requires a certain degree of humility and intellectual modesty that is patently lacking in many of the most visible AI scholars. I think there is a real danger that the "we know it all "mentality will do irreparable harm to Cognitive Science by driving away those form other disciplines.
Towards Quantitative Analysis of Real-Time UML Using Stochastic Petri Nets
Authors: J. Trowitzsch, A. Zimmermann, G. Hommel
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

In recent years the Unified Modeling Language (UML) including its profiles gained increasing acceptance as a specification language for modeling real-time systems. It is crucial to enable early quantitative predictions during the modeling phase of real-time systems development processes. UML itself is not directly analyzable. Performance evaluation techniques are thus necessary for these UML models. The challenge within our research work is the derivation of Stochastic Petri nets (SPNs) from UML models aimed at performance evaluation of real-time systems.
Monitoring internal body heat using water proton chemical shift during a fast spin echo pulse sequence
Authors: Yasutoshi Ishihara, Kazuya Okamoto, Tomoyuki Kanamatsu, Yasuzo Tsukada
Venue: Systems and Computers in Japan (2004)

With the advancements in high-speed imaging technology in MRI (magnetic resonance imaging), clinically useful images have become obtainable within a short time. On the other hand, internal body heating due to many radio-frequency magnetic field pulses applied in a short time has become a problem. In efficient data acquisition while ensuring the safety of a test subject, monitoring its internal body temperature during data acquisition is desirable. In this paper, a method of measuring real-time information regarding temperature changes during image data acquisition that incorporates a temperature measuring method using the temperature dependence (-0.01 ppm&sol;&deg;C) of the water proton chemical shift with a high-speed imaging method is proposed. The efficacy of the proposed method is demonstrated by showing that it can measure temperature changes with an error of less than 0.5 &deg;C in laboratory experiments using agar phantoms. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 49&ndash;58, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10376
Defining and Monitoring Service-Level Agreements for Dynamic e-Business
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Fueled by the growing acceptance of the Web Services Architecture, an emerging trend in application service delivery is to move away from tightly coupled systems towards structures of loosely coupled, dynamically bound systems to support both long and short business relationships. It appears highly likely that the next generation of e-Business systems will consist of an interconnection of services, each provided by a possibly different service provider, that are put together on an "on demand" basis to offer an end to end service to a customer.Such an environment, which we call Dynamic e-Business (DeB), will be administered and managed according to dynamically negotiated Service Level Agreements (SLA) between service providers and customers. Consequently, system administration will increasingly become SLA-driven and needs to address challenges such as dynamically determining whether enough spare capacity is available to accommodate additional SLAs, the negotiation of SLA terms and conditions, the continuous monitoring of a multitude of agreed-upon SLA parameters and the troubleshooting of systems, based on their importance for achieving business objectives.A key prerequisite for meeting these goals is to understand the relationship between the cost of the systems an administrator is responsible for and the revenue they are able to generate, i.e., a model needs to be in place to express system resources in financial terms. Today, this is usually not the case.In order to address some of these problems, this paper presents the Web Service Level Agreement (WSLA) framework for defining and monitoring SLAs in inter-domain environments. The framework consists of a flexible and extensible language based on the XML schema and a runtime architecture based on several SLA monitoring services, which may be outsourced to third parties to ensure a maximum of accuracy.WSLA enables service customers and providers to unambiguously define a wide variety of SLAs, specify the SLA parameters and the way how they are measured, and tie them to managed resource instrumentations. A Java-based implementation of this framework, termed SLA Compliance Monitor, is publicly available as part of the IBM Web Services Toolkit.
Chinese named entity identification using class-based language model
Authors: Jian Sun, Jianfeng Gao, Lei Zhang, Ming Zhou, Changning Huang
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

We consider here the problem of Chinese named entity (NE) identification using statistical language model(LM). In this research, word segmentation and NE identification have been integrated into a unified framework that consists of several class-based language models. We also adopt a hierarchical structure for one of the LMs so that the nested entities in organization names can be identified. The evaluation on a large test set shows consistent improvements. Our experiments further demonstrate the improvement after seamlessly integrating with linguistic heuristic information, cache-based model and NE abbreviation identification.
Semantics and feature discovery via confidence-based ensemble
Authors: Kingshy Goh, Beitao Li, Edward Y. Chang
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2005)

Providing accurate and scalable solutions to map low-level perceptual features to high-level semantics is essential for multimedia information organization and retrieval. In this paper, we propose a confidence-based dynamic ensemble (CDE) to overcome the shortcomings of the traditional static classifiers. In contrast to the traditional models, CDE can make dynamic adjustments to accommodate new semantics, to assist the discovery of useful low-level features, and to improve class-prediction accuracy. We depict two key components of CDE: a multi-level function that asserts class-prediction confidence, and the dynamic ensemble method based upon the confidence function. Through theoretical analysis and empirical study, we demonstrate that CDE is effective in annotating large-scale, real-world image datasets.
MoDeII: Modeling and Analyzing Time-Constraints
Authors: Jewgenij Botaschanjan, Jan Jurjens
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The fulfillment of time requirements is one of the major acceptance criteria of safety-critical and real-time systems. They are dictated by the environment of these systems and are often well known at the early phases of the development process. At the same time, the time behavior is a cross-cutting concern, not bordered by the behavioral design units, e.g. components or classes. This paper argues for consideration of the time behavior as an explicit model-based view on the system under development. It proposes a modeling language and an analysis method. The formal graphical modeling language allows the explicit notation of time requirements and the integration with the architectural and behavioral aspects of the system. The analysis method allows the developer to verify requirements in respect of their consistency and completeness as well as to validate design concerning the fulfillment of time requirements. It supports modular development, for which results are presented.
Reasoning in metaphor understanding: the ATT-Meta approach and system
Authors: John Barnden, Sheila Glasbey, Mark Lee, Alan Wallington
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

A detailed approach has been developed for core aspects of the task of understanding a broad class of metaphorical utterances. The utterances in question are those that depend on known metaphorical mappings but that nevertheless contain elements not mapped by those mappings. A reasoning system has been implemented that partially instantiates the theoretical approach. The system, called ATT Meta, will be demonstrated. The paper briefly indicates how the system works, and outlines some specific aspects of the system, approach and the overall project.
New analysis of the sphere covering problems and optimal polytope approximation of convex bodies
Authors: Long Chen
Venue: Journal of Approximation Theory (2005)

In this paper, we show that both sphere covering problems and optimal polytope approximation of convex bodies are related to optimal Delaunay triangulations, which are the triangulations minimizing the interpolation error between function ||x||2 and its linear interpolant based on the underline triangulations. We then develop a new analysis based on the estimate of the interpolation error to get the Coxeter-Few-Rogers lower bound for the thickness in the sphere covering problem and a new estimate of the constant deln appeared in the optimal polytope approximation of convex bodies.
Synchronization overhead in SOC compressed test
Authors: Paul Theo Gonciari, Bashir Al-Hashimi, Nicola Nicolici
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

Test data compression is an enabling technology for low-cost test. Compression schemes however, require communication between the system under test and the automated test equipment. This communication, referred to in this paper as synchronization overhead, may hinder the effective deployment of this new test technology for core-based systems-on-chip. This paper analyzes the sources of synchronization overhead and discusses the different tradeoffs, such as area overhead, test time and automatic test equipment extensions. A novel scalable and programmable on-chip distribution architecture is proposed, which addresses the synchronization overhead problem and facilitates the use of low cost testers for manufacturing test. The design of the proposed architecture is introduced in a generic framework, and the implementation issues (including the test controller and test set preparation) have been considered for a particular case.
Distribution of Data and Remote Invocation of Programs
Authors: Tomasz Muldner, Zhonghai Luo, Elhadi Shakshuki
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Distributed applications have become very popular and there is a growing need to efficiently and securely distribute data. This paper describes the design and the implementation of a distributed installer (DI), which can accomplish both these tasks. We review goals that any such system should achieve, and show which goals are achieved by DI and several similar systems. This paper provides the description of the functionality, design and the implementation of DI.
Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout
Authors: Satish Verma, Wei Tsang Ooi
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossip-based protocol using adaptive fanout. We model three versions of gossip-based protocols: the Synchronous Protocol, the PseudoSynchronous Protocol and the Asynchronous Protocol. Our objective is to ensure that the members of a group receive a desired message within a bounded latency with very high probability. We argue that the most important parameter that controls the latency of message delivery is the fanout used during gossiping, i.e., the number of gossip targets chosen in a particular instance of gossip. We formally analyze the three protocols and provide expressions for fanout. We introduce the idea of using variable fanouts in different rounds in the Synchronous Protocol. We define fanout as a function of time for the Asynchronous Protocol such that an expected infection pattern is observed with high probability. For a better understanding of the theoretical model, we develop a PseudoSynchronous Protocol to highlight the modelling done in order to derive time dependent fanout. We show that our protocols generate ¿(n log n) messages, which is optimal for gossip protocols. We aim to use the gossiping mechanism for large-scale group communication with soft real time constraints. This would alleviate the dependence on tree-based deterministic protocols which usually lack scalability.
Customer Targeting: A Neural Network Approach Guided by Genetic Algorithms
Authors: YongSeog Kim, W. Nick Street, Gary J. Russell, Filippo Menczer
Venue: Management Science (2005)

One of the key problems in database marketing is the identification and profiling of households that are most likely to be interested in a particular product or service. Principal component analysis (PCA) of customer background information followed by logistic regression analysis of response behavior is commonly used by database marketers. In this paper, we propose a new approach that uses artificial neural networks (ANNs) guided by genetic algorithms (GAs) to target households. We show that the resulting selection rule is more accurate and more parsimonious than the PCA/logit rule when the manager has a clear decision criterion. Under vague decision criteria, the new procedure loses its advantage in interpretability, but is still more accurate than PCA/logit in targeting households.
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
Authors: Panagiota Fatourou, Marios Mavronicolas, Paul Spirakis
Venue: SIAM Journal on Computing (2005)

Two important performance parameters of distributed, rate-based flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their scheduling mechanisms, while the latter is defined as the number of update operations performed on rates of individual sessions until max-min fairness is reached. Optimistic algorithms allow any session to intermediately receive a rate larger than its max-min fair rate; bottleneck algorithms finalize the rate of a session only if it is restricted by a certain, highly congested link of the network. In this work, we present a comprehensive collection of lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, bottleneck, rate-based flow control algorithms.Say that an algorithm is oblivious if its scheduling mechanism uses no information of either the session rates or the network topology. We present a novel, combinatorial construction of a capacitated network, which we use to establish a fundamental lower bound of $\frac{dn}{4} + \frac{n}{2}$ on the convergence complexity of any oblivious algorithm, where n is the number of sessions laid out on a network, and d, the session dependency, is a measure of topological dependencies among sessions. Moreover, we devise a novel simulation proof to establish that, perhaps surprisingly, the lower bound of $\frac{dn}{4} + \frac{n}{2}$ on convergence complexity still holds for any partially oblivious algorithm, in which the scheduling mechanism is allowed to use information about session rates, but is otherwise unaware of network topology.On the positive side, we prove that the lower bounds for oblivious and partially oblivious algorithms are both tight. We do so by presenting optimal oblivious algorithms, which converge after $\frac{dn}{2} + \frac{n}{2}$ update operations are performed in the worst case. To complete the picture, we show that linear convergence complexity can indeed be achieved if information about both session rates and network topology is available to schedulers. We present a counterexample, nonoblivious algorithm, which converges within an optimal number of n update operations.Our results imply a surprising convergence complexity collapse of oblivious and partially oblivious algorithms, and a convergence complexity separation between (partially) oblivious and nonoblivious algorithms for optimistic, bottleneck rate-based flow control.
Evolutionary IPv6
Authors: Adam Stone
Venue: IEEE Internet Computing (2004)

As IPv6ýs implementation rolls forward, others are looking at the specific implications for the wider Internet community, especially the rapidly expanding move toward Internet mobility.
A Simple Forward Secure Blind Signature Scheme Based on Master Keys and Blind Signatures
Authors: Yeu-Pong Lai, Chin-Chen Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The forward secure property is important in digital signature schemes. Many schemes have been proposed for the forward secure signature. Among them, only a few have been proposed for the forward secure blind signature. The blind signature is, however, a critical technique in e-business and other applications and , thus, more research should be devoted on it. This paper focuses on the design of forward secure blind signature schemes. Digital signature schemes have been proposed and discussed for years. Some of them areefficient and secure. Even specific computing hardware is designed for these schemes. Our idea is, therefore, to combine two existing schemes, Koyamaýs master key scheme and Chaumýs blind signature scheme, so that a forward secure blind signature scheme results. This proposed scheme is also fully examined for the forward secure property and the blind signing property. Since these two schemes are both based on the RSA cryptosystem, the security of the proposed scheme depends on the difficulty of solving the factoring problem.
Algorithm and software implementation of QR decomposition of rectangular matrices
Authors: Todor Stoilov, Krasimira Stoilova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The QR decomposition in linear algebra calculation is widely applied. Despite that the algorithms for the decomposition are available, it lacks explanations how to implement them for non-square matrices. The research gives descriptions about the modifications, needed to apply for rectangular form of matrices. A software implementation of the algorithm is presented. It can be used for client or server side programming tools, performing linear algebra calculations and optimization.
Mixed Discontinuous Galerkin Approximation of the Maxwell Operator: Non-Stabilized Formulation
Authors: Paul Houston, Ilaria Perugia, Dominik Schötzau
Venue: Journal of Scientific Computing (2005)

A non-stabilized mixed discontinuous Galerkin method for the discretization of the Maxwell operator on simplicial meshes is studied. In contrast to the stabilized scheme introduced in Houston, Perugia and Schötzau, Siam J. Numer. Anal., 42: 434--459, 2004, the proposed formulation contains no normal-jump stabilization; instead, it is based on discontinuous mixed-order $$(P^{\ell})^{3} - P^{\ell + 1}$$ elements for the approximation of the unknowns. A priori error bounds in the energy norm are derived that show convergence rates of the order $${\cal O}(h^{\ell})$$ in the mesh size h. The error analysis relies on suitable decompositions of discontinuous spaces and on stability properties of the underlying conforming spaces. The formulation is tested on a set of numerical examples in two space dimensions.
Conservative Input-State-Output Systems with Evolution on a Multidimensional Integer Lattice
Authors: Joseph A. Ball, Cora Sadosky, Victor Vinnikov
Venue: Multidimensional Systems and Signal Processing (2005)

A fundamental object of study in both operator theory and system theory is a discrete-time conservative system (variously also referred to as a unitary system or unitary colligation). In this paper we introduce three equivalent multidimensional analogues of a unitary system where the "time axis" $${\mathbb Z}^{d}$$ , d>1, is multidimensional. These multidimensional formalisms are associated with the names of Roesser, Fornasini and Marchesini, and Kalyuzhniy--Verbovetzky. We indicate explicitly how these three formalisms generate the same behaviors. In addition, we show how the initial-value problem (including the possibility of "initial conditions at infinity") can be solved for such systems with respect to an arbitrary shift-invariant sublattice as the analogue of the positive-time axis. Some of our results are new even for the d=1 case.