ppxscal/embedding_network huggingface dataset:
Designing Forms for Microsoft Office InfoPath and Forms Services 2007 (Microsoft .NET Development Series)
Authors: Scott Roberts, Hagen Green
Venue:  (2007)

"Microsoft Office InfoPath represents a revolutionary leap in XML technologies and a new paradigm for gathering business-critical information. I am delighted that Scott Roberts and Hagen Green, two distinguished members of the InfoPath product team, decided to share their experience in this book."--From the Foreword by Jean Paoli, cocreator of XML 1.0 and Microsoft Office InfoPathMicrosoft Office InfoPath 2007 offers breakthrough tools for gathering, managing, and integrating business-critical information, and creating efficient forms-driven processes. Two longtime members of Microsoft's InfoPath product team have written the first comprehensive, hands-on guide to building successful XML-based solutions with InfoPath 2007.The book opens with a practical primer on the fundamentals of InfoPath form template design for information workers and application developers at all levels of experience. It then moves into advanced techniques for customizing, integrating, and extending form templates--with all the code examples and detail needed by professional developers.Learn how to: Design form templates: create blank form templates, insert and customize controls, use advanced formatting, and construct and lay out views Work with data: start with XML data or schema, manually edit data sources, and understand design-time visuals Add custom business logic to forms, and integrate them with other applications Retrieve and query data from external data sources, including XML files, databases, SharePoint lists, Web services, and ADO.NET DataSets Submit and receive form data using ADO.NET Save, preview, and publish to e-mail, SharePoint, and more Build reusable components with template parts Create workflows with SharePoint and InfoPath E-Mail Forms Administer Forms Services and Web-enabled form templates Build advanced form templates using C# form code, custom controls, add-ins, and the new InfoPath 2007 managed object model Design form templates using Visual Studio Tools for Office (VSTO) Update, secure, and optimize your form templates
Electronic markets hypothesis redux: where are we now?
Authors: Bonnie C. Glassberg
Venue: Communications of the ACM (2007)

A popular theory on IT's impact fails to consider the rich, dynamic, relationship-filled environment in which IT operates.
Refraction in volume graphics
Authors: David Rodgman, Min Chen
Venue: Graphical Models (2006)

Modeling and rendering transparent and translucent objects is one of the most important features of volume graphics. Refraction is a phenomenon closely coupled with such objects, but has largely been overlooked in volume graphics and visualization. There are two main technical difficulties. First, it is expensive to model heterogeneous refractive properties, and to incorporate refractive effects into volume rendering engines that assume light travels only along a straight line. Second, rendering refraction in volume graphics requires smoothly distributed normals to synthesize good-quality visual representations. Such refractive visualization is more susceptible to noise in the data than visualizations that do not involve refraction. In this paper, we present a comprehensive study of modeling and rendering refraction in volume graphics. In particular, we address the need for improving the continuity of voxel gradients in discretely sampled volume datasets using nonlinear diffusion methods, which were originally developed for image denoising. We consider the need for minimizing unnecessary geometrical distortion, detail the functional specification of a volumetric filter for regularized anisotropic non-linear diffusion (R-ANLD), discuss further improvements of the filter, and compare the efficacy of the filter with an anisotropic nonlinear diffusion (ANLD) filter as well as a Gaussian filter and a linear diffusion filter. Our results indicate that it is possible to make significant improvements in image quality in refractive rendering without excessive distortion. To demonstrate the practical feasibility of modeling and rendering refraction in volume graphics, we describe the implementation of refractive rendering through vlib, a volume graphics API, and discuss the parallelization of vlib in order to meet the increased demands of computational resources imposed by refractive volume rendering.
The +Plus Series: Microsoft (tm) Outlook 2003, 1 edition
Authors: Brenda L. Nielsen
Venue:  (2004)

Thousands of learners have asked for high quality materials that focus on technologies that go beyond core applications of Microsoft Office. McGraw-Hill Technology Education has answered these requests with 4 new titles making up the +Plus Series. This books were designed to stand alone as primary texts or to supplement instruction in core courses. The +Plus Series books are brief, easy to use, and less expensive than primary textbooks. Table of contentsPreface Chapter 1: Messaging for Fast Communication Chapter 2: Managing Contacts Chapter 3: Scheduling Calendars for Active People Chapter 4: Working with Notes Tasks and Journals Appendix Solutions Glossary Index The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Implementation of time management in a runtime infrastructure
Authors: Buquan Liu, Yiping Yao, Jing Tao, Huaimin Wang
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The High Level Architecture (HLA) time management is concerned with mechanisms for guaranteeing message order, process synchronization and execution correctness in distributed simulations. Time management greatly influences on the scales of applications, especially for the computation of Greatest Available Logical Time (GALT) and the implementation of optimistic services. StarLink is an RTI with central architecture, which is compliant with the IEEE 1516 standard. This paper systematically describes the implementation algorithms for main time management services in StarLink. Two smart and efficient algorithms about GALT computation and optimistic services are also introduced, which are suitable for many RTIs such as RTI1.3-NG, pRTI and DRTI. For the GALT algorithm, it is not necessary for an RTI to resolve the recursion nor any deadlock. For optimistic services, a simple mechanism without rollback in an RTI is also introduced; therefore, it can greatly simplify the development of an RTI.
Communicating Design: Developing Web Site Documentation for Design and Planning
Authors: Dan Brown
Venue:  (2006)

Most discussion about Web design seems to focus on the creative process, yet turning concept into reality requires a strong set of deliverables-the documentation (concept model, site maps, usability reports, and more) that serves as the primary communication tool between designers and customers. Here at last is a guide devoted to just that topic. Combining quick tips for improving deliverables with in-depth discussions of presentation and risk mitigation techniques, author Dan Brown shows you how to make the documentation you're required to provide into the most efficient communications tool possible. He begins with an introductory section about deliverables and their place in the overall process, and then delves into to the different types of deliverables. From usability reports to project plans, content maps, flow charts, wireframes, site maps, and more, each chapter includes a contents checklist, presentation strategy, maintenance strategy, a description of the development process and the deliverable's impact on the project, and more.
Basis selection in LOBPCG
Authors: U. Hetmaniuk, R. Lehoucq
Venue: Journal of Computational Physics (2006)

The purpose of our paper is to discuss basis selection for Knyazev's locally optimal block preconditioned conjugate gradient (LOBPCG) method. An inappropriate choice of basis can lead to ill-conditioned Gram matrices in the Rayleigh-Ritz analysis that can delay convergence or produce inaccurate eigenpairs. We demonstrate that the choice of basis is not merely related to computing in finite precision arithmetic. We propose a representation that maintains orthogonality of the basis vectors and so has excellent numerical properties.
Exact probability distributions for peer-to-peer epidemic information diffusion
Authors: Emine Şule Yazici, Selda Küçükçifçi, Öznur Özkasap, Mine Çaǧlar
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

An efficient approach for information diffusion in distributed systems is to utilize epidemic algorithms that involve pair-wise propagation of updates. Epidemic algorithms are fully distributed and randomized approaches such that every peer in an information diffusion session picks a (subset of the other) peer(s) randomly for efficient propagation of updates, through periodic rounds. The underlying epidemics theory for the biological systems studies the spreading of infectious diseases through a population [1,2]. When applied to an information diffusion application, such protocols have beneficial features such as scalability, robustness against failures and provision of eventual consistency. Exact as well as asymptotical distributions have been studied for different epidemic models in [3,4]. In contrast to such previous studies, we investigate variations of the epidemic algorithms used in the context of distributed information diffusion and derive exact diffusion probabilities for them.
Image denoising with complex ridgelets
Authors: G. Y. Chen, B. Kégl
Venue: Pattern Recognition (2007)

In this paper, we propose a novel image denoising method by incorporating the dual-tree complex wavelets into the ordinary ridgelet transform. The approximate shift invariant property of the dual-tree complex wavelet and the high directional sensitivity of the ridgelet transform make the new method a very good choice for image denoising. We apply the digital complex ridgelet transform to denoise some standard images corrupted with additive white noise. Experimental results show that the new method outperforms VisuShrink, the ordinary ridgelet image denoising, and wiener2 filter both in terms of peak signal-to-noise ratio and in visual quality. In particular, our method preserves sharp edges better while removing white noise. Complex ridgelets could be applied to curvelet image denoising as well.
The road to COTS-interoperability: from generic HLA-interfaces towards plug-and-play capabilities
Authors: Steffen Strassburger
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Interoperability between commercial-off-the-shelf (COTS) simulation packages (CSPs) is a topic which has been discussed for many years without a solution. With the advent of the High Level Architecture for Modeling and Simulation (HLA) for the first time a real industry standard has been made available which promises interoperability for a wide range of simulation systems and applications. Successful attempts to integrate HLA interfaces into different simulation packages have been made in the past. However, these interfaces typically place a significant overhead on the simulation developer. Also, as often a generic HLA interface is provided, different HLA interfaces for different simulation packages are not necessarily interoperable per se, as there are different possible ways to use HLA for the same task. This article addresses these issues and discusses interoperability solutions based on and beyond of HLA. It further investigates and comments the interoperability reference solutions put forward by SISO's COTS Simulation Package Interoperability Product Development Group.
A Novel Context-based Technique for Web Information Retrieval
Authors: John Zakos, Brijesh Verma
Venue: World Wide Web (2006)

In this paper we present context matching, a novel context-based technique for the ad-hoc retrieval of web documents. The aim of the technique is to dynamically generate a measure of document term significance during retrieval that can be used as a substitute or co-contributor of the term frequency measure. Unlike term frequency, which relies on a term occurring multiple times in a document to be considered significant, context matching is based on the notion that if a term in a given document occurs in that document in the context of the query, then that term is deemed to be significant. Context matching has the ability to potentially determine a term to be significant even if it occurs only once in a document. Vice versa, it also has the ability to determine a term to be insignificant, even if occurs frequently within a document. We show how expanded terms generated by a typical query expansion technique can be used effectively as query context for context matching. The technique is ideally suited to the nature of web information retrieval and we show how context matching significantly improves retrieval accuracy through experimental results on TREC web benchmark data.
3D model retrieval using principal plane analysis and dynamic programming
Authors: Chen-Tsung Kuo, Shyi-Chyi Cheng
Venue: Pattern Recognition (2007)

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.
Google: The Missing Manual
Authors: Sarah Milstein, J. D. Biersdorfer, Matthew MacDonald
Venue:  (2006)

Google.com is one of the most popular sites on the Internet and is used around the world by millions of people every day. Sure, you know how to "Google it" when you're searching for something--anything!--on the Web. It's plenty fast and easy to use. But did you know how much more you could achieve with the world's best search engine by clicking beyond the "Google Search" button? While you can interface with Google in 97 languages and glean results in 35, you can't find any kind of instruction manual from Google. Lucky for you, our fully updated and greatly expanded second edition to the bestselling Google: The Missing Manual covers everything you could possibly want to know about Google, including the newest and coolest--and often most underused (what is Froogle, anyway?)--features. There's even a full chapter devoted to Gmail, Google's free email service that includes a whopping 2.5 GB of space).This wise and witty guide delivers the complete scoop on Google, from how it works to how you can search far more effectively and efficiently (no more scrolling through 168 pages of seemingly irrelevant results); take best advantage of Google's lesser-known features, such as Google Print, Google Desktop, and Google Suggest; get your website listed on Google; track your visitors with Google Analytics; make money with AdWords and AdSense; and much more.Whether you're new to Google or already a many-times-a-day user, you're sure to find tutorials, tips, tricks, and tools that take you well beyond simple search to Google gurudom.
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
Authors: Keiichi Kaneko, Naoki Sawada
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-burnt pancake graphs in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n3) and the maximum path length 3n + 4. We conducted a computer experiment for n = 2 to 100 to measure the average performance of our algorithm. The results show that the average time complexity is O(n3.0) and the maximum path length is 3n + 4.
A generalized Macaulay theorem and generalized face rings
Authors: Eran Nevo
Venue: Journal of Combinatorial Theory Series A (2006)

We prove that the f-vector of members in a certain class of meet semi-lattices satisfies Macaulay inequalities 0 ≤ ∂k(fk) ≤ fk-1 for all k ≥ 0. We construct a large family of meet semi-lattices belonging to this class, which includes all posets of multicomplexes, as well as meet semi-lattices with the "diamond property," discussed by Wegner [G. Wegner, Kruskal-Katona's theorem in generalized complexes, in: Finite and Infinite Sets, vol. 2, in: Colloq. Math. Soc. János Bolyai, vol. 37, North-Holland, Amsterdam, 1984, pp. 821-828], as special cases. Specializing the proof to the later family, one obtains the Kruskal-Katona inequalities and their proof as in [G. Wegner, Kruskal-Katona's theorem in generalized complexes, in: Finite and Infinite Sets, vol. 2, in: Colloq. Math. Soc. János Bolyai, vol. 37, North-Holland, Amsterdam, 1984, pp. 821-828].For geometric meet semi-lattices we construct an analogue of the exterior face ring, generalizing the classic construction for simplicial complexes. For a more general class, which also includes multicomplexes, we construct an analogue of the Stanley-Reisner ring. These two constructions provide algebraic counterparts (and thus also algebraic proofs) of Kruskal-Katona's and Macaulay's inequalities for these classes, respectively.
Hardware-oriented ant colony optimization
Authors: Bernd Scheuermann, Stefan Janson, Martin Middendorf
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2007)

A new kind of ant colony optimization (ACO) algorithm is proposed that is suitable for an implementation in hardware. The new algorithm - called Counter-based ACO - allows to systolically pipe artificial ants through a grid of processing cells. Various features of this algorithm have been designed so that it can be mapped easily to field-programmable gate arrays (FPGAs). Examples are a new encoding of pheromone information and a new method to define the decision sequence of ants. Experimental results that are based on simulations for the traveling salesperson problem and the quadratic assignment problem are presented to evaluate the proposed techniques.
MDSL: a microcomputer design and simulation language
Authors: Michael Adamowicz, Jamshed Mirza
Venue: ACM SIGMICRO Newsletter (1977)

MDSL, which stands for Microcomputer Design and Simulation Language, is one of an ever growing number of computer hardware design (or description) languages or CHDL's. The introduction of any new language, particularly a new CHDL, is accompanied by a number of WHYs. Why should anyone bother to develop a CHDL? Why did we bother to develop a new one? Why did MDSL take the form it did?
A step towards the establishment of a "systems optimization laboratory"
Authors: Jerome L. Kreuser
Venue: Issue 15 (November 1973) (1973)

The Madison Optimization Applications Laboratory, MOAL, is an organization which is being established to provide extensive services in the theoretical and computational applications of optimization techniques. The establishment of a similar service, "The Systems Optimization Laboratory," was proposed by G. B. Dantzig in a talk at the Advanced Seminar on Mathematical Programming at the University of Wisconsin - Madison on September 11-13, 1972.
Access 2007: The Missing Manual
Authors: Matthew MacDonald
Venue:  (2006)

Compared to industrial-strength database products such as Microsoft's SQL Server, Access is a breeze to use. It runs on PCs rather than servers and is ideal for small- to mid-sized businesses and households. But Access is still intimidating to learn. It doesn't help that each new version crammed in yet another set of features; so many, in fact, that even the pros don't know where to find them all. Access 2007 breaks this pattern with some of the most dramatic changes users have seen since Office 95. Most obvious is the thoroughly redesigned user interface, with its tabbed toolbar (or "Ribbon") that makes features easy to locate and use. The features list also includes several long-awaited changes. One thing that hasn't improved is Microsoft's documentation. To learn the ins and outs of all the features in Access 2007, Microsoft merely offers online help. Access 2007: The Missing Manual was written from the ground up for this redesigned application. You will learn how to design complete databases, maintain them, search for valuable nuggets of information, and build attractive forms for quick-and-easy data entry. You'll even delve into the black art of Access programming (including macros and Visual Basic), and pick up valuable tricks and techniques to automate common tasks -- even if you've never touched a line of code before. You will also learn all about the new prebuilt databases you can customize to fit your needs, and how the new complex data feature will simplify your life. With plenty of downloadable examples, this objective and witty book will turn an Access neophyte into a true master.
A spatial high-order hexahedral discontinuous Galerkin method to solve Maxwell's equations in time domain
Authors: G. Cohen, X. Ferrieres, S. Pernet
Venue: Journal of Computational Physics (2006)

In this paper, we present a non-dissipative spatial high-order discontinuous Galerkin method to solve the Maxwell equations in the time domain. The non-intuitive choice of the space of approximation and the basis functions induce an important gain for mass, stiffness and jump matrices in terms of memory. This spatial approximation, combined with a leapfrog scheme in time, leads also to a fast explicit and accurate method. A study of the dispersive error is carried out and a stability condition for the proposed scheme is established. Some comparisons with other schemes are presented to validate the new scheme and to point out its advantages. Finally, in order to improve the efficiency of the method in terms of CPU time on general unstructured meshes, a strategy of local time-stepping is proposed.
Publish and Prosper: Blogging for Your Business
Authors: D. L. Byron, Steve Broback
Venue:  (2006)

While personal blogs take up much of the blogosphere, blogs are quickly gaining popularity in business as an inexpensive and amazingly effective marketing tool. It's time for a practical book about business blogging: this is the first book to demonstrate how businesses are blogging and how you can use blogging technology to converse with your customers to build your brand and sell your products.Written from the business person/designer's perspectives, this book shows how businesses can leverage current, real-world blogging techniques, tools, and platforms to promote and enhance their ventures. The key idea is that the conversation with your market is stronger and more meaningful with a blog. Filled with practical information and a how-to approach, this book provides case studies of companies as large as Boeing or General Motors and as small as Clip-'n-seal. Readers will learn about the types of business blogs, how companies use blogs, how to sell blogs to management and IT, effective blog design, content, and conversation, pitfalls to avoid, how to develop Web presence, and more.