ppxscal/embedding_network huggingface dataset:
Using Semantics for Policy-Based Web Service Composition
Authors: Soon Ae Chun, Vijayalakshmi Atluri, Nabil R. Adam
Venue: Distributed and Parallel Databases (2005)

Proliferation of Web technologies and the ubiquitous Internet has resulted in a tremendous increase in the need to deliver one-stop Web services, which are often composed of multiple component services that cross organizational boundaries. It is essential that these Web services, referred to in this paper as service flows, be carefully composed in a dynamic and customized manner to suit to the changing needs of the customers. This composition should be conducted in such a manner that (i) the composed service flow adheres to the policies imposed by the organizations offering the component services, (ii) the selected component services are compatible with one another so that the entire composition would result in a successful service flow, and (iii) the selected component services most closely meet the customer requirements. In this paper, we propose a policy-based Web service composition that utilizes the semantics associated with the component services.We consider policies imposed by different entities while composing service flows, which include service policies (imposed by the organizations offering component services), service flow policies (associated with the entire service flow), and user policies (the user requirements expressed as policies). In addition to these policies, one may consider rules at the syntactic and semantic levels that can be used to select relevant component services in order to compose customized service flows, by considering the notions of syntactic, semantic and policy compatibility. We model the different policies and the service topic ontology using OWL, DAML-S, RuleML and RDF standards.
Duality and Existence of Optimal Policies in Generalized Joint Replenishment
Authors: Daniel Adelman, Diego Klabjan
Venue: Mathematics of Operations Research (2005)

We establish a duality theory for a broad class of deterministic inventory control problems on continuous spaces that includes the classical joint replenishment problem and inventory routing. Using this theory, we establish the existence of an optimal policy, which has been an open question. We show how a primal-dual pair of infinite dimensional linear programs encode both cyclic and noncyclic schedules, and provide various results regarding cyclic schedules, including an example showing that they need not be optimal.
Algorithm and series expansion for the F distribution
Authors: William E. Davis, Hatem M. Khalil
Venue: ACM SIGNUM Newsletter (1972)

POFF computes the probability of F values no greater than some assigned value. The method of evaluation is based on expressing the probability function in a simple algebraic form which is evaluated as a nested polynomial. In this respect it differs from Algorithm 322 [1] which computes the same function by recurrences. A comparison of their efficiency shows that POFF is faster but the core requirements and the accuracy of the results are identical.
Sub-Pixel Estimation Error Cancellation on Area-Based Matching
Authors: Masao Shimizu, Masatoshi Okutomi
Venue: International Journal of Computer Vision (2005)

Area-based image matching and sub-pixel displacement estimation using similarity measures are common methods that are used in various fields. Sub-pixel estimation using parabola fitting over three points with their similarity measures is also a common method to increase the matching resolution. However, few investigations or studies have explored the characteristics of this estimation.This study analyzed sub-pixel estimation error using two different types of matching model. Our analysis demonstrates that the estimation contains a systematic error depending on image characteristics, the similarity function, and the fitting function. This error causes some inherently problematic phenomena such as the so-called pixel-locking effect, by which the estimated positions tend to be biased toward integer values. We also show that there are good combinations of the similarity functions and fitting functions.In addition, we propose a new algorithm to greatly reduce sub-pixel estimation error. This method is independent of the similarity measure and the fitting function. Moreover, it is quite simple to implement. The advantage of our novel method is confirmed through experiments using different types of images.
High-speed systolic architectures for finite field inversion
Authors: Z. Yan, D. V. Sarwate, Z. Liu
Venue: Integration, the VLSI Journal (2005)

Using a new reformulation of the extended Euclidean algorithm, we propose new two-dimensional systolic architectures for inversion in GF(2m). Our new architectures require considerably less hardware in comparison to the architectures we proposed recently, while achieving the same critical path delays, latencies, and throughputs. Our new architectures compare even more favorably to the inversion architectures proposed previously by others. In common with much previous work in this area, one of our new architectures uses a centralized control mechanism. The other new architecture proposed in this paper uses a distributed control mechanism which results in all the cells in our architecture having the same circuitry regardless of the value of m. Hence the latter new architecture has excellent scalability properties.
A general stability analysis on regional and national voting schemes against noise: why is an electoral college more stable than a direct popular election?
Authors: Liang Chen, Naoyuki Tokuda
Venue: Artificial Intelligence (2005)

By discarding the previous restrictive weak average distribution assumption on region sizes, we have developed a new general probabilistic model on the regional voting (known as "direct popular voting" in political science) and the national voting (typically, the electoral college), where we regard the percentage of a candidate's supporters in the nation as the probability of a voter voting for the candidate. Our analysis demonstrates that the regional voting is always more stable than the national voting, and that the stability margin of the regional voting always increases as the size of such partitioned regions decreases down to a certain critical value of region size, beyond which the stability margin starts to decrease, asymptoting to a national voting level where the size of the partitioned regions approaches the unit of voting cell so that the improved stability of the regional voting by localizing the effects of noise into a restricted number of smaller effective areas will not be effective. Our stability analysis remains valid over the entire range in size of the partitioned regions for regional voting. We show that the regional voting asymptotes to the national voting in two extreme limiting cases, when the region size decreases to a voting cell size and when the region size increases to the size of the nation.
Mood swings: expressive speech animation
Authors: Erika Chuang, Christoph Bregler
Venue: ACM Transactions on Graphics (TOG) (2005)

Motion capture-based facial animation has recently gained popularity in many applications, such as movies, video games, and human-computer interface designs. With the use of sophisticated facial motions from a human performer, animated characters are far more lively and convincing. However, editing motion data is difficult, limiting the potential of reusing the motion data for different tasks. To address this problem, statistical techniques have been applied to learn models of the facial motion in order to derive new motions based on the existing data. Most existing research focuses on audio-to-visual mapping and reordering of words, or on photo-realistically matching the synthesized face to the original performer. Little attention has been paid to modifying and controlling facial expression, or to mapping expressive motion onto other 3D characters.This article describes a method for creating expressive facial animation by extracting information from the expression axis of a speech performance. First, a statistical model for factoring the expression and visual speech is learned from video. This model can be used to analyze the facial expression of a new performance or modify the facial expressions of an existing performance. With the addition of this analysis of the facial expression, the facial motion can be more effectively retargeted to another 3D face model. The blendshape retargeting technique is extended to include subsets of morph targets that belong to different facial expression groups. The proportion of each subset included in a final animation is weighted according to the expression information. The resulting animation conveys much more emotion than if only the motion vectors were used for retargeting. Finally, since head motion is very important in adding liveness to facial animation, we introduces an audio-driven synthesis technique for generating new head motion.
Teraflows over Gigabit WANs with UDT
Authors: Robert L. Grossman, Yunhong Gu, Xinwei Hong, Antony Antony, Johan Blom, Freek Dijkstra, Cees de Laat
Venue: Future Generation Computer Systems (2005)

The TCP transport protocol is currently inefficient for high speed data transfers over long distance networks with high bandwidth delay products (BDP). The challenge is to develop a protocol which is fast over networks with high bandwidth delay products, fair to other high volume data streams, and friendly to TCP-based flows. We describe here a UDP-based application level transport protocol named UDT (UDP-based Data Transfer) with these properties and which is designed to support distributed data-intensive computing applications. UDT can utilize high bandwidth efficiently over wide area networks with high bandwidth delay products. Unlike TCP, UDT is fair to flows independently of their round trip times (RTT). In addition, UDT is friendly to concurrent TCP flows, which means it can be deployed not only on experimental research networks but also on production networks. To ensure these properties, UDT employs a novel congestion control approach that combines rate-based and window-based control mechanisms. In this paper, we describe the congestion control algorithms used by UDT and provide some experimental results demonstrating that UDT is fast, fair, and friendly.
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
Authors: Inderjit S. Dhillon, Robert W. Heath,  Jr., Mátyás A. Sustik, Joel A. Tropp
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

In this paper, we present new algorithms that can replace the diagonal entries of a Hermitian matrix by any set of diagonal entries that majorize the original set without altering the eigenvalues of the matrix. They perform this feat by applying a sequence of (N-1) or fewer plane rotations, where N is the dimension of the matrix. Both the Bendel--Mickey and the Chan--Li algorithms are special cases of the proposed procedures. Using the fact that a positive semidefinite matrix can always be factored as $\mtx{X^\adj X}$, we also provide more efficient versions of the algorithms that can directly construct factors with specified singular values and column norms. We conclude with some open problems related to the construction of Hermitian matrices with joint diagonal and spectral properties.
The QMESH mesh generation package (abstract)
Authors: Rondall E. Jones
Venue: ACM SIGNUM Newsletter (1975)

A package of five programs centering around the highly flexible, powerful, two-dimensional mesh generation program, QMESH, is presented. Together, the five programs provide a tool for generation, bandwidth minimization and display of meshes with Q4 or Q8 elements. The package's primary purpose is generation of input for finite element analysis programs.
An FPGA Based Coprocessor for GLCM and Haralick Texture Features and their Application in Prostate Cancer Classification
Authors: M. A. Tahir, A. Bouridane, F. Kurugollu
Venue: Analog Integrated Circuits and Signal Processing (2005)

Grey Level Co-occurrence Matrix (GLCM), one of the best known tool for texture analysis, estimates image properties related to second-order statistics. These image properties commonly known as Haralick texture features can be used for image classification, image segmentation, and remote sensing applications. However, their computations are highly intensive especially for very large images such as medical ones. Therefore, methods to accelerate their computations are highly desired. This paper proposes the use of programmable hardware to accelerate the calculation of GLCM and Haralick texture features. Further, as an example of the speedup offered by programmable logic, a multispectral computer vision system for automatic diagnosis of prostatic cancer has been implemented. The performance is then compared against a microprocessor based solution.
I Want My IPTV: Internet Protocol Television Predicted a Winner
Authors: Benjamin Alfonsi
Venue: IEEE Distributed Systems Online (2005)

Among the technologies IEEE Spectrum magazine predicted to surge in 2005 is Internet protocol television. By delivering a relatively low-speed broadband TV connection through telephone wires, IPTV is expected to enable telephone carriers to one day give cable providers a run for their money.
Windows XP Color Management
Authors: Joshua Weisberg
Venue:  (2005)

If you could leave color management to the pros, you probably would. But with the proliferation of desktop systems and devices, everyone (regardless of role) is expected to get color right these days- to do that, you need to know about a lot more than just tools and software. Lucky for you, this hands-on guide delivers, describing precisely how to apply color consistently and correctly across various hardware, software, and output devices using a Windows-based workflow. By matching color workflow to color use (for example, photography and image capture, page layout and content creation, and output to desktop or press), author and color management pro Josh Weisberg distills a complicated process into its need-to-know essentials. Whether you're an artist, illustrator, designer, photographer, or hobbyist, the series of illustrated steps, instructions, and advice contained in this full-color volume will have you mastering color management in Windows XP environments in no time.
A Design Methodology for Dynamic Reconfiguration: The Caronte Architecture
Authors: Fabrizio Ferrandi, Marco D. Santambrogio, Donatella Sciuto
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

The most common reconfigurable devices today are Field Programmable Gate Arrays, FPGAs. Aim of this paper is to propose a design methodology for dynamically reconfigurable systems providing a dynamic architecture that, thanks to the processor embedded in the FPGA, is able to dynamically change the design implementation to meet and satisfy all the requirements of the system implementation. The proposed methodology provides a solution for the partial dynamic reconfiguration of an embedded system, using a common FPGA and development board, without any specific or dedicated device. This paper describes the Caronte architecture used to implement the proposed approach, showing how it is possible to obtain a reconfigurable system just using tools that are already widely used to design FPGA-based systems.
Getting Started with Your Mac and Mac OS X Tiger: Peachpit Learning Series (Apple Training)
Authors: Scott Kelby
Venue:  (2005)

You bought your Mac OS X Tiger computer because you thought it would be easy to use-and it is! But if you've never used a computer before, never stared at a graphical user interface or clicked an icon to launch a program or open a file, getting going with your new machine can still be a daunting proposition. With this guide from legendary author Scott Kelby, it doesn't have to be! Realizing there are still plenty of novice users just like yourself whose Macs represent their very first foray into personal computing, this guide provides a simple, practical approach guaranteed to get you sending email, going on the Internet, creating Word documents, and more immediately with Mac OS X Tiger. Focused lessons take you step-by-step through all of the tasks you're most eager to tackle with your Mac OS X Tiger machine (in the order you're likely to approach them): using the mouse, going on the Internet, sending email, initiating iChat sessions, creating address books and calendars, importing and sharing photos, making play lists and burning CDs, synching music with your iPod, launching and saving Word documents, using search (Spotlight), organizing files, and more.
Secure Group Communication with Multiplicative One-way Functions
Authors: Heeyoul Kim, Seong-min Hong, H. Yoon, J. W. Cho
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Secure group communication enables only the users in that group securely communicate with each other. Because the users can join or leave the group dynamically, scalability is a major concern. In this paper we propose a communication-efficient model using multiplicative oneway functions. It also has well known tree-based structure but uses exclusive keys that are held by the users not in some subtree. When totally n users are in the group, proposed model reduces the size of multicast message required in join or leave operation from O(log n) to O(1) keeping other costs comparable. The security of proposed model is based on the difficulty of finding square root modulo composite number and it also satisfies both forward and backward secrecy. Therefore, proposed model is very applicable to a wide area network environment or a low-bandwidth channel such as ad hoc network.
An Axiomatic Approach to Corner Detection
Authors: C. S. Kenney, M. Zuliani, B. S. Manjunath
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents an axiomatic approach to corner detection. In the first part of the paper we review five currently used corner detection methods (Harris-Stephens, Förstner, Shi-Tomasi, Rohr, and Kenney et al. ) for graylevel images. This is followed by a discussion of extending these corner detectors to images with different pixel dimensions such as signals (pixel dimension one) and tomographic medical images (pixel dimension three) as well as different intensity dimensions such as color or LADAR images (intensity dimension three). These extensions are motivated by analyzing a particular example of optical flow in pixel and intensity space with arbitrary dimensions. Placing corner detection in a general setting enables us to state four axioms that any corner detector might reasonably be required to satisfy. Our main result is that only the Shi-Tomasi (and equivalently the Kenney et al. 2-norm detector) satisfy all four of the axioms
Efficient implementation of multiprocessor scheduling algorithms on a simulation testbed
Authors: Jorge R. Ramos, Vernon Rego
Venue: Software&mdash;Practice Experience (2005)

A layered and modular approach to implementing a process-oriented simulator testbed is described. The simulation kernel is supported by a threads library and is, in turn, capable of supporting distinct domains or application areas for various applications. The testbed offers an implementation methodology for testing novel simulation algorithms at the domain level, without interfacing with the kernel. To demonstrate its utility, a novel algorithm for simulating multiprocessing with round-robin scheduling is presented. The algorithm is more complex than the naïve round-robin implementation in use, but offers significant performance improvement.
Fast Co-Simulation of Transformative Systems with OS Support
Authors: Zhengting He, Aloysius Mok
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Transformative applications are a class of dataflow computation characterized by iterative behavior. The problem of partitioning a transformative application specification to a set of available hardware (HW) and software (SW) processing elements (PEs) and derivation of a job execution order (scheduling) on them has been quite well studied, but the problem of obtaining fast simulation of these applications poses different constraints. In this paper, we propose an efficient framework for a symmetric multi-processor (SMP) simulation host to achieve fast HW/SW co-simulation for transformative applications, given the partition solutions and the derived schedulers. The framework overcomes the limitations in existing Linux SMP kernel and requires only a reasonable amount of modifications to it. We also present a heuristic algorithm which effectively assigns simulation tasks to the processors on the simulation host, considering both average job simulation time on each processor and other simulation overhead. Our experiments show that the algorithm is able to find satisfactory suboptimal solutions with very little computation time. Based on the task assignment solution, the simulation time can be reduced by 25% to 50% from the obvious but naive approach.
Corpus-based generation of numeral classifier using phrase alignment
Authors: Michael Paul, Eiichiro Sumita, Seiichi Yamamoto
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A severe problem for NLP applications dealing with multilingual language resources is the acquisition of knowledge that is obligatory in one language but not explicitly expressed in another language. In this paper, we focus on numeral classifiers, which are required in languages like Japanese but are usually not explicitly used in languages like English, which don't have such a classifier system.We propose a uniform method to assign the numeral classifiers of languages that have a numeral classifier system to the numerals of non-classifier languages. The omitted classifier information is extracted from a bilingual corpus based on phrasal correspondences in the contexts of the respective sentences.
Matrix calculations on hand-held calculators
Authors: G. W. Stewart
Venue: ACM SIGNUM Newsletter (1981)

Recently there have appeared three hand-held calculators of such large capacity that they might well be called computers. They are the Texas Instruments TI-59, the Hewlit-Packard HP-41C and the Radie Shack TRS-80PC. These computers are characterized by a comparatively large memory which can be variably partitioned into an instruction bank and a data bank. In all three computers the memory is large enough to accommodate a Gaussian elimination program and at least an 8x8 matrix. Thus it is possible to develop serious matrix software for these computers. In this article I would like to describe some of the things I have learned from my own endeavors along this line.
The Software that Launched Cisco Systems
Authors: Bill Yeager
Venue: IEEE Internet Computing (2005)

Stanford University received a Christmas present from Xerox PARC in 1979: several Xerox Alto workstations, Ethernet hardware, and documentation on network protocols. My director asked me to figure out how to link the Stanford Medical Center where I worked to the computer science and electrical engineering departments across campus. I thus embarked on a project that led to the invention of the Internet multiple-protocol Ethernet router. This story picks five years later in the spring of 1985.