ppxscal/embedding_network huggingface dataset:
Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics)
Authors: Nicholas J. Higham
Venue:  (2008)

The only book devoted exclusively to matrix functions, this research monograph gives a thorough treatment of the theory of matrix functions and numerical methods for computing them. The author s elegant presentation focuses on the equivalent definitions of f(A) via the Jordan canonical form, polynomial interpolation, and the Cauchy integral formula, and features an emphasis on results of practical interest and an extensive collection of problems and solutions. Functions of Matrices: Theory and Computation is more than just a monograph on matrix functions; its wide-ranging content including an overview of applications, historical references, and miscellaneous results, tricks, and techniques with an f(A) connection makes it useful as a general reference in numerical linear algebra. Other key features of the book include development of the theory of conditioning and properties of the Frchet derivative; an emphasis on the Schur decomposition, the block Parlett recurrence, and judicious use of Pad approximants; the inclusion of new, unpublished research results and improved algorithms; a chapter devoted to the f(A)b problem; and a MATLAB toolbox providing implementations of the key algorithms. Audience: This book is for specialists in numerical analysis and applied linear algebra as well as anyone wishing to learn about the theory of matrix functions and state of the art methods for computing them. It can be used for a graduate-level course on functions of matrices and is a suitable reference for an advanced course on applied or numerical linear algebra. It is also particularly well suited for self-study. Contents: List of Figures; List of Tables; Preface; Chapter 1: Theory of Matrix Functions; Chapter 2: Applications; Chapter 3: Conditioning; Chapter 4: Techniques for General Functions; Chapter 5: Matrix Sign Function; Chapter 6: Matrix Square Root; Chapter 7: Matrix pth Root; Chapter 8: The Polar Decomposition; Chapter 9: Schur-Parlett Algorithm; Chapter 10: Matrix Exponential; Chapter 11: Matrix Logarithm; Chapter 12: Matrix Cosine and Sine; Chapter 13: Function of Matrix Times Vector: f(A)b; Chapter 14: Miscellany; Appendix A: Notation; Appendix B: Background: Definitions and Useful Facts; Appendix C: Operation Counts; Appendix D: Matrix Function Toolbox; Appendix E: Solutions to Problems; Bibliography; Index.
Validating MAS simulation models with mutation
Authors: Emanuela Merelli, Michal Young
Venue: Multiagent and Grid Systems (2007)

A key reason for choosing agent-based simulation of a biological system over other kinds of simulation model is the potential for structural as well as behavioral correspondence between the simulation model and the modeled system. This correspondence both demands and makes possible new kinds of model validation. Model fidelity can be evaluated by introducing seeded faults that correspond to known or hypothesized mutations, thus tying software validation to biological mutation analysis. The approach is illustrated by application to two implementations of an agent-based model of carbohydrate oxidation in a cell.
Protecting privacy in recorded conversations
Authors: Scot Cunningham, Traian Marius Truta
Venue: Proceedings of the 2008 international workshop on Privacy and anonymity in information society (2008)

Professionals in the field of speech technology are often constrained by a lack of speech corpora that are important to their research and development activities. These corpora exist within the archives of various businesses and institutions; however, these entities are often prevented from sharing their data due to privacy rules and regulations. Efforts to "scrub" this data to make it shareable can result in data that has been either inadequately protected or data that has been rendered virtually unusable due to the loss resulting from suppression. This work attempts to address these issues by developing a scientific workflow that combines proven techniques in data privacy with controlled audio distortion resulting in corpora that have been adequately protected with minimal information loss.
A Parallel Biomedical Data Transportation Component and its Application
Authors: Kun Wang, Zhihui Du, Sanli Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In order to increase the biomedical data transportation efficiency of distributed medical databases and meet the demands of real-time process, we propose a parallel biomedical data transportation component to manage the datasets replicas and use four adaptive parallel transportation strategies within a distributed databases environment. This component makes better use of the bandwidth and storage of each server node in which stored the biomedical databases, the application in distributed breast cancer databases with this component shows remarkably higher data transportation efficiency than the comparative experiment without it.
Topology optimized electrothermal polysilicon microgrippers
Authors: Ozlem Sardan, Dirch H. Petersen, Kristian Mølhave, Ole Sigmund, Peter Bøggild
Venue: Microelectronic Engineering (2008)

This paper presents the topology optimized design procedure and fabrication of electrothermal polysilicon microgrippers for nanomanipulation purposes. Performance of the optimized microactuators is compared with a conventional three-beam microactuator design through finite element analysis. The accuracy of the finite element model is verified by comparison of simulated and measured displacement vs. bias voltage curves. A considerable improvement in the mechanical stiffness is indicated by AFM force measurements, being 9 times higher compared to the conventional three-beam actuator.
Transient thermal characterisation of hot plates
Authors: Gy. Bogn&#x00e1;r, P. F&#x00fc;rjes, V. Sz&#x00e9;kely, M. Rencz
Venue: Microsystem Technologies (2005)

The paper will present the methodology and the results of measuring and simulating the thermal transient behaviour of micro hotplates. The investigated devices were designed for integrated gas sensors of calorimetric operation principle, e.g. micro-pellistors, heat conductivity type sensors or mass flow meters. They consist of a platinum heater filament embedded in silicon-nitride membranes that can be used both for heating and temperature sensing.
Entire or meromorphic functions sharing one value
Authors: Xiao-Yu Zhang, Jun-Fan Chen, Wei-Chuan Lin
Venue: Computers Mathematics with Applications (2008)

In this paper, we deal with the uniqueness problems on entire or meromorphic functions concerning differential polynomials that share one value with the same multiplicities. Moreover, we greatly generalize some results obtained by Fang, Lin and Yi, Fang and Fang.
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Venue: International Conference on Management of Data (2008)

Welcome to SIGMOD 2008! We think you will find both the conference and the setting to be invigorating. The natural timeless beauty of British Columbia will provide a fitting counterpoint to the dynamism of our field in which large scale, high performance, and ever more intelligent database systems are being conceived and deployed. This dynamism is reflected in our (extreme) keynote presentations, tutorials, research papers, demonstrations, industrial papers, and product presentations. The only unfortunate side of our program is that the five parallel session structure may prevent you from hearing every talk in which you are interested. The conference statistics give an indication of how SIGMOD's selectivity. Out of 435 submitted research papers, we accepted 78; out of 40 submitted industrial papers, we accepted 15; out of 94 demo submissions, we accepted 30; and out of 15 tutorial submissions, we accepted 5. Reviewing is an imperfect art, so we may have rejected some papers that we should have accepted, but we hope the written reviews have helped authors improve their papers for future submissions. The main methodological innovation in SIGMOD this year has been the repeatability option. Papers submitting experiments were invited to submit code and data to enable the pioneering members of the repeatability committee to verify that the experiments worked as advertised. Any paper satisfying the repeatability criteria will include the sentence "The results in this paper were verified by the SIGMOD repeatability committee." The goal is to count our field among the repeatable sciences and to pave the way for the archiving of code and data. The response to this initiative has been overwhelmingly positive and we look forward to a greater participation by all members of the community in the future.
Biometrics Could Streamline Border Crossings
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2008)

Both the US and the EU are moving toward biometrically enabled travel documents and new border-control proposals meant to combine greater security and more convenience for legitimate travelers. However, technology and policy differences characterize a bumpy journey.
WindChimer: The Partially Centralized and Controlled P2P System for Better Discovery
Authors: Jedsada Phengsuwan, Naiyana Sahavechaphan
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Rich information from various data sources has been recognized for enabling people to perform an efficient decision-making and problem-solving. According to thousands of data sources and numerous information types available at the edge of the Internet, the discovery of all potential data sources are needed to facilitate the procurement of rich information. However, current P2P approaches are limited to the discovery of potential data sources in which the number of data sources does not cause tremendous consequences for decision-making and problem-solving. In this paper, we thus propose WindChimer, a partially centralized and controlled P2P system that hybridly combines network topology of structured and unstructured P2P systems. Our experiments showed that the partially centralized and controlled topology enables an efficient discovery of all potential peers as per a given information type. This was accomplished via (i) acceptable number of messages sent throughout the network; (ii) high messaging accuracy for propagating the message to potential peers; and (iii) effective scalability when adding more peers. However, it is currently applicable for low degree of transient peer population, and sustainable data sources of organizations only.
Computer Society Releases Q3 & 4 Conference Slate
Authors: Bob Ward
Venue: Computer (2008)

IEEE Computer Society conferences scheduled from June through December 2008 will address topics spanning all aspects of the computing profession.
Architecture of secure cross-platform and network communications
Authors: Weijia Jia, Dai Bin, Lin Liao
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The convenience of Wireless LAN and the deployment of 3G network make the cross platform/network services (CPS) are getting popular. The core reasons for vulnerabilities for CPS stems from the transform of data and control messages and protocol translation occurred in cross networks and platforms operations. During the translation/transcoding, new threats could be introduced as it may go beyond of data cryptography. We particularly investigate the threats facing in Internet-3G-WiFi and propose the architecture of the secure CPS (SCPS). We illustrate newly defined five types of attacks uniquely in CPS and analyze the traditional attacks (TA) and the cross platform attacks (CPA) which are conducted mode and propose the corresponding countermeasures to the attacks in the cross platform.
Semantics-based composition-oriented discovery of Web services
Authors: Antonio Brogi, Sara Corfini, Razvan Popescu
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

Service discovery and service aggregation are two crucial issues in the emerging area of service-oriented computing (SOC). We propose a new technique for the discovery of (Web) services that accounts for the need of composing several services to satisfy a client query. The proposed algorithm makes use of OWL-S ontologies, and explicitly returns the sequence of atomic process invocations that the client must perform in order to achieve the desired result. When no full match is possible, the algorithm features a flexible matching by returning partial matches and by suggesting additional inputs that would produce a full match.
Accelerated GWT: Building Enterprise Google Web Toolkit Applications (Accelerated)
Authors: Vipul Gupta
Venue:  (2008)

Ajax is a web development technique that takes advantage of JavaScript to display and interact dynamically with information embedded into a web page. Its emergence has made it possible to create web applications that closely resemble their desktopbased brethren. With this exciting new ability came several challenges; not only did developers have to learn JavaScript, but they were also forced to use inefficient development processes, not to mention deal with crossplatform and browser difficulties. But with the release of Google Web Toolkit (GWT), Java developers are able to continue using their favorite language to write powerful Ajax applications while using not only the Java language, but also the very same development tools theyre already using on a daily basis! Serious Java developers wanting to write Ajax applications using GWT can expect a fastpaced, yet thorough, introduction to GWT from Java expert Vipul Gupta. Youll gain key insights into the GWT frameworks capabilities and can rely on clear instruction that will show you how to incorporate GWT into your daily development routine in the most effective way. Accelerated GWT introduces you to the popular GWT framework in a way that will allow you to begin using GWT in short order. Foregoing superfluous introductions to JavaScript and Ajax, youll instead be immersed in GWT fundamentals from the very first chapter. Subsequent chapters discuss key GWT concepts such as architecture, widgets, and RPC. Understanding youll want to efficiently integrate GWT into your development workflow, the author also devotes time to sound GWT application design, testing, and internationalization issues. What youll learn Use GWTs Remote Procedure Call (RPC) capabilities to greatly enhance the user experience by optimizing application performance. Go beyond basic syntax fundamentals to learn how to most effectively design and test your GWT applications. Build complex interfaces by taking advantage of GWTs advanced widget offerings. Who is this book for? Javaminded web developers seeking to incorporate Ajax capabilities into their web applications without sacrificing sound development principles. Related Titles Ajax and REST Recipes: A Problem-Solution Approach The Definitive Guide to Grails Practical JRuby on Rails Web 2.0 Projects: Bringing Ruby on Rails to Java
Some topics in analysis of boolean functions
Authors: Ryan O'Donnell
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a brief introduction to Fourier analysis of boolean functions and then discuss some applications: Arrow's Theorem and other ideas from the theory of Social Choice; the Bonami-Beckner Inequality as an extension of Chernoff/Hoeffding bounds to higher-degree polynomials; and, hardness for approximation algorithms.
Publish/subscribe notification middleware for vehicular networks
Authors: Ilias Leontiadis
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

There is a large number of interesting applications for vehicular networks: traffic information dissemination, warnings, free parking spots finders, fuel prices advertising, etc. The Publish/ Subscribe (P/S) communication paradigm enables the application developers to easily design flexible notification systems. Furthermore, it enables the drivers/vehicles to indicate their interests about certain types of notifications (e.g. receive warnings concerning traffic jams only within 1km from the vehicle's route). And finally, P/S is an asynchronous communication protocol (spatial and temporal decoupling) that is suitable for the delay-tolerant network conditions. Our main goal is to design a P/S Middleware for vehicular networks that considers location and time in its primitives. We would like to enable the application developers to easily publish notification in specific location by treating location as context. We will use subscriptions and the navigation system to automatically express interests on the affected vehicles and to filter incoming notifications. Additionally, our middleware incorporates the appropriate communication mechanisms that implement the tasks instructed by the middleware primitives.
Automatic generation of explicitly embedded advertisement for interactive TV: concept and system architecture
Authors: J. Royer, H. Nguyen, D. O Mishra
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

This paper proposes the concept and implementation of Explicitly Embedded Advertisement (EEA), a non-intrusive advertisement embedded in the multimedia contents. This concept thrives on the fact that typical multimedia contents can be linked to further information like advertisement for a particular vendor. A new service platform is proposed enabling automatic generation of interactive EEA. For example, interactive embedded advertisement on audio products can be automatically generated when user clicks on the tape recorder used by M. Phelps to discover the new mission at the beginning of each episode of the serial TV "Mission : Impossible".
Simulating midlet's security claims with automata modulo theory
Authors: Fabio Massacci, Ida S. R. Siahaan
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

Model-carrying code and security-by-contract have proposed to augment mobile code with a claim on its security behavior that could be matched against a mobile platform policy before downloading the code. In order to capture realistic scenarios with potentially infinite transitions (e.g. "only connections to urls starting with https") we have proposed to represent those policies with the notion of Automata Modulo Theory (AMT), an extension of Buchi Automata (BA), with edges labeled by expressions in a decidable theory. Our objective is the run-time matching of the mobile's platform policy against the midlet's security claims expressed as AMT. To this extent the use of on-the-fly product and emptiness test from automata theory may not be effective. In this paper we present an algorithm extending fair simulation between Büchi automata that can be more efficiently implemented.
On minimum k-modal partitions of permutations
Authors: Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
Venue: Journal of Discrete Algorithms (2008)

Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result to minimum partitioning into k-modal subsequences; here unimodal is the special case k=1. Based on a network flow interpretation we formulate both, the monotone and the k-modal version, as mixed integer programs. This is the first proposal to obtain provably optimal partitions of permutations. LP rounding gives a 2-approximation for minimum monotone partitions and a (k+1)-approximation for minimum (upper) k-modal partitions. For the online problem, in which the permutation becomes known to an algorithm sequentially, we derive a logarithmic lower bound on the competitive ratio for minimum monotone partitions, and we analyze two (bin packing) online algorithms. These immediately apply to online cocoloring of permutation graphs.
Engaging a corporate community to manage technology and embrace innovation
Authors: A. W. Chow, B. D. Goodman, J. W. Rooney, C. D. Wyble
Venue: IBM Systems Journal (2007)

It has been estimated that approximately 50 percent of technology implementation failures are due to scheduling and budget issues and 27 percent are due to customer dissatisfaction. If typical technology solutions face these odds, how can riskier emerging technology and innovation activities succeed? This paper describes the IBM Technology Adoption Program (TAP), an effort by its technology and innovation team to formalize its innovation management discipline. Instead of using structured governing processes, the program uses an organic approach for accelerating change. TAP is focused on cultivating and harnessing the existing early adopter and innovator communities within the enterprise to shorten the technical development cycle and deliver solutions that engage a variety of users, ensuring rapid, widespread accommodation. We describe TAP in the context of the challenges enterprises face in fostering and measuring innovation, focusing on three key areas: rallying the community, encouraging the technical investment supporting the community, and gauging the priority and value of new technology. We present several examples to illustrate the benefits that materialize from overcoming obstacles and delivering significant innovation.
SystemVerilog implicit port enhancements accelerate system design & verification
Authors: Clifford E. Cummings
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The IEEE Std 1800-2005 SystemVerilog Standard added new implicit port instantiation enhancements that help accelerate top-level composition of large ASIC & FPGA Designs. This paper details the new .* and .name implicit port instantiation capabilities, the rules related to the use of these new enhancements, and how these enhancements offer concise RTL coding styles while enforcing stronger port-type checking.
The skew spectrum of graphs
Authors: Risi Kondor, Karsten M. Borgwardt
Venue: Proceedings of the 25th international conference on Machine learning (2008)

The central issue in representing graph-structured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We present a new system of invariant graph features which we call the skew spectrum of graphs. The skew spectrum is based on mapping the adjacency matrix of any (weigted, directed, unlabeled) graph to a function on the symmetric group and computing bispectral invariants. The reduced form of the skew spectrum is computable in O(n3) time, and experiments show that on several benchmark datasets it can outperform state of the art graph kernels.
Implementable requirements in problem orientation
Authors: Derek P. Mannering
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

The goal of this paper is to demonstrate how Problem Oriented Software Engineering (POSE), an extension and generalisation of Problem Frames, supports the systematic transformation of requirements from overall system level requirements through to specific requirements that can be implemented by the machine to be designed. We will apply POSE in the context of safety systems development, which particularly benefits from the ability of POSE to distinguish between the extant, indicative properties of the environment and the desired properties expressed as the requirements.