ppxscal/embedding_network huggingface dataset:
Adobe Acrobat 8 in the Office
Authors: Donna L. Baker
Venue:  (2006)

Adobe Acrobat is one of the most widely recognized tools for document management, office communications, and improved workflow, and Acrobat 8 is the most powerful version yet, introducing new tools for shared reviews, creating automated forms, license management, additional security, and many others. Now that PDF has become the ubiquitous electronic document format, industries as diverse as engineering, legal, manufacturing, and government all rely on Acrobat to make their tasks run smoother and more efficiently. Here to help guide you, Acrobat expert Donna Baker presents real-life scenarios that you can apply to any situation in which document control and management is an issue. With practical advice, productivity tips, and step-by-step directions for using the latest Acrobat features, Acrobat 8 in the Office will help you understand the broad capabilities of this “what-can't-it-do?” software. Among other useful features, this book also · Shows you how to use Acrobat in real-life situations to improve productivity, cost savings, and communication. · Covers the new features in Acrobat 8, including shared reviewing, Acrobat Connect (an online meeting room), auto-recognition form fields, new merging and document optimizing tools, redaction tools. · Describes how to best combine new and existing Acrobat tools to accomplish nearly any office communication task. · Includes a companion Web site at www.donnabaker.ca/downloads.html that contains source files for examples in the book, plus bonus projects and case study chapters.
Level Lines Selection with Variational Models for Segmentation and Encoding
Authors: Coloma Ballester, Vicent Caselles, Laura Igual, Luis Garrido
Venue: Journal of Mathematical Imaging and Vision (2007)

This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured representation of the family of level lines of an image. This representation has been used for many processing tasks such as filtering, registration, or shape analysis. In this paper we show how this representation can be used for segmentation, rate distortion optimization, and encoding. We address the problem of segmentation and rate distortion optimization using Guigues algorithm on a hierarchy of partitions constructed using the simplified Mumford-Shah multiscale energy. To segment an image, we minimize the simplified Mumford-Shah energy functional on the set of partitions represented in this hierarchy. The rate distortion problem is also solved in this hierarchy of partitions. In the case of encoding, we propose a variational model to select a family of level lines of a gray level image in order to obtain a minimal description of it. Our energy functional represents the cost in bits of encoding the selected level lines while controlling the maximum error of the reconstructed image. In this case, a greedy algorithm is used to minimize the corresponding functional. Some experiments are displayed.
A comparative study of supply chain models under the traditional centralized and coordinating policies with incentive schemes
Authors: Navee Chiadamrong, Kanit Prasertwattana
Venue: Computers and Industrial Engineering (2006)

Recently, great attention has been paid to the supply chain concept. While there is much research material on buyer and supplier performance assessment and management, a relationship perspective can bring an added dimension, especially to the performance of close, mutual relationships. The paper examines the problem of how to establish an incentive scheme to furnish reliable and truthful information in supply chains. The study investigates a relationship performance definition that incorporates the financial dimension. It focuses on a dyadic relationship in a chain including one manufacturer and one retailer, in which stochastic demand and lead-time are considered. The aim of the study is to find proper coordinating mechanisms based on exchanging financial incentives that can improve the overall performance of the whole chain as well as each member in the chain. Using numerical means, the study shows that the functional coordinating policy with incentive schemes can improve the overall channel profitability beyond the traditional centralized policy. Additionally, sensitivity analysis is conducted with respect to the bonus cost parameter, and suggestions are made for further research.
Assistive technologies for the disabled and for the new generation of senior citizens: the e-Tools architecture
Authors: Ulises Cortés, Roberta Annicchiarico, Javier Vázquez-Salceda, Cristina Urdiales, Lola Cañamero, Maite López, Miquel Sànchez-Marrè, Carlo Caltagirone
Venue: AI Communications (2003)

In this paper we present our exploratory ideas about the integration of agent technology with other technologies to build specific e-tools for the disabled and for the new generation of senior citizens. &ldquo;e-Tools&rdquo; stands for Embedded Tools, as we aim to embed intelligent assistive devices in homes and other facilities, creating ambient intelligence environments to give support to patients and caregivers. In particular, we aim to explore the benefits of the concept of situated intelligence to build artefacts that will enhance the autonomy of the target user group in their daily life.
The incredible shrinking bug separation model
Authors: Gene Woolsey
Venue: Issue 18 (February 1975) (1975)

While working at Sandia Corporation some years ago, there was a need for a mathematical model that would give the minimum number of tests that would detect the presence of certain undesirable microbes or "bugs". We assume that there exists a number of tests that will react in certain ways to the presence of individual "bugs". Unfortunately, there exist bugs for which the tests will react in exactly the same way. Therefore we must find, not just the minimum set of tests that will determine if a bug is present or not, but rather the minimum set of tests such that we can <u>separate</u> and <u>detect</u> all the bugs that are present. To illustrate the problem, assume that we have five "bugs" that could be present on a piece of equipment. Say that we have six tests that either react or do not react in some way when certain bugs are present. Further we have the problem that some tests react with certain probability to the presence of certain bugs. If we arbitrarily establish a confidence limit on this probability, and the probability falls below this level we say that the reaction is "unknown". Therefore for six tests and five bugs we could have the reaction matrix (tij) shown below. 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
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
Authors: Andrea Torsello, Antonio Robles-Kelly, Edwin R. Hancock
Venue: International Journal of Computer Vision (2007)

This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. We show how to transform the tree edit distance problem into a series of maximum weight clique problems, and show how to use relaxation labeling to find an approximate solution. This allows us to compute a set of pairwise distances between graph-structures. We show how the edit distances can be used to compute a matrix of pairwise affinities using ¿2 statistics. We present a maximum likelihood method for clustering the graphs by iteratively updating the elements of the affinity matrix. This involves interleaved steps for updating the affinity matrix using an eigendecomposition method and updating the cluster membership indicators. We illustrate the new tree clustering framework on shock-graphs extracted from the silhouettes of 2D shapes.
Discovering tightly regulated and differentially expressed gene sets in whole genome expression data
Authors: Chun Ye, Eleazar Eskin
Venue: Bioinformatics (2007)

Motivation: Recently, a new type of expression data is being collected which aims to measure the effect of genetic variation on gene expression in pathways. In these datasets, expression profiles are constructed for multiple strains of the same model organism under the same condition. The goal of analyses of these data is to find differences in regulatory patterns due to genetic variation between strains, often without a phenotype of interest in mind. We present a new method based on notions of tight regulation and differential expression to look for sets of genes which appear to be significantly affected by genetic variation. Results: When we use categorical phenotype information, as in the Alzheimer's and diabetes datasets, our method finds many of the same gene sets as gene set enrichment analysis. In addition, our notion of correlated gene sets allows us to focus our efforts on biological processes subjected to tight regulation. In murine hematopoietic stem cells, we are able to discover significant gene sets independent of a phenotype of interest. Some of these gene sets are associated with several blood-related phenotypes. Availability: The programs are available by request from the authors. Contact: cye@bioinf.ucsd.edu
Fusion of Map and Sensor Data in a Modern Car Navigation System
Authors: Dragan Obradovic, Henning Lenz, Markus Schupfner
Venue: Journal of VLSI Signal Processing Systems (2006)

The main tasks of car navigation systems are positioning, routing, and guidance. This paper describes a novel, two-step approach to vehicle positioning founded on the appropriate combination of the in-car sensors, GPS signals, and a digital map. The first step is based on the application of a Kalman filter, which optimally updates the model of car movement based on the in-car odometer and gyroscope measurements, and the GPS signal. The second step further improves the position estimate by dynamically comparing the continuous vehicle trajectory obtained in the first step with the candidate trajectories on a digital map. This is in contrast with standard applications of the digital map where the current position estimate is simply projected on the digital map at every sampling instant.
Modeling the effectiveness of underwater sonar
Authors: Jose A. Sepulveda, Luis Rabelo, Haluk Akin, Yanshen Zhu
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The purpose of this paper is to discuss an object-oriented simulation framework/model for the US Navy that simulates the behavior of ships in a combat environment. This model provides a framework which helps to improve threat recognition, undersea tactical awareness, countermeasure emissions, and counter-weapon fire control to enable surface ships to survive a salvo of torpedo attacks. A Navy ship gathers information from all the sensors it carries and then fuses the information to make a judgment. An Object-Oriented Programming (OOP) approach was adopted for designing and implementing our framework. With OOP, the framework can be easily modified and tested with sophisticated and classified algorithms that may be based on established physics principles. The model was developed by using multiple modeling approaches including hybrid, discrete and continuous systems and capturing complex phenomena. The model can be used to simulate different events in a combat environment.
Runge-Kutta-Nyström methods with maximized stability domain in structural dynamics
Authors: Christoph Lunk, Bernd Simeon
Venue: Applied Numerical Mathematics (2005)

Structural dynamics applications feature a particular type of second order stiff equations, often in combination with low smoothness of the right side, large dimension and non-linear forcing terms. As alternative to implicit schemes, explicit Runge-Kutta-Nyström methods are analysed, with focus on low order and maximized stability domain since spurious high frequency oscillations need not be resolved. It turns out that it is possible to construct methods with a stability domain that stretches up to hω = 2s on the imaginary axis where h is the stepsize, ω the largest frequency in the system, and s the stage number. Simulation examples generated by FEMLAB show that the methods are competitive.
Other recent papers
Authors: Walter Wallach
Venue: ACM SIGMICRO Newsletter (1981)

The June, 1981 issue of the IEEE Transactions on Computers (vol. C-30, no. 6) contains a paper by Alice Parker and John Wallace entitled "SLIDE: An I/O Hardware Descriptive Language" (pp. 423--439).
Analyzing and visualizing the semantic coverage of Wikipedia and its authors: Research Articles
Authors: Todd Holloway, Miran Bozicevic, Katy Börner
Venue: Complexity (2007)

This article presents a novel analysis and visualization of English Wikipedia data. Our specific interest is the analysis of basic statistics, the identification of the semantic structure and the age of the categories in this free online encyclopedia, and the content coverage of its highly productive authors. &copy; 2007 Wiley Periodicals, Inc. Complexity: 12: 30&ndash;40, 2007(This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois&ndash;Urbana Champaign, May 2005)
A distributed hierarchical genetic algorithm for efficient optimization and pattern matching
Authors: Gautam Garai, B. B. Chaudhuri
Venue: Pattern Recognition (2007)

In this paper we propose a new approach in genetic algorithm called distributed hierarchical genetic algorithm (DHGA) for optimization and pattern matching. It is eventually a hybrid technique combining the advantages of both distributed and hierarchical processes in exploring the search space. The search is initially distributed over the space and then in each subspace the algorithm works in a hierarchical way. The entire space is essentially partitioned into a number of subspaces depending on the dimensionality of the space. This is done in order to spread the search process more evenly over the whole space. In each subspace the genetic algorithm is employed for searching and the search process advances from one hypercube to a neighboring hypercube hierarchically depending on the convergence status of the population and the solution obtained so far. The dimension of the hypercube and the resolution of the search space are altered with iterations. Thus the search process passes through variable resolution (coarse-to-fine) search space. Both analytical and empirical studies have been carried out to evaluate the performance between DHGA and distributed conventional GA (DCGA) for different function optimization problems. Further, the performance of the algorithms is demonstrated on problems like pattern matching and object matching with edge map.
Fast multiscale clustering and manifold identification
Authors: Dan Kushnir, Meirav Galun, Achi Brandt
Venue: Pattern Recognition (2006)

We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It uses an aggregation process to obtain reliable scale-dependent global properties, which arise from the local similarities. As the aggregation process proceeds, these global properties affect the formation of coherent clusters. The global features that can be utilized are for example density, shape, intrinsic dimensionality and orientation. The last three features are a part of the manifold identification process which is performed in parallel to the clustering process. The algorithm detects clusters that are distinguished by their multiscale nature, separates between clusters with different densities, and identifies and resolves intersections between clusters. The algorithm is tested on synthetic and real data sets, its running time complexity is linear in the size of the data set.
Discourse markers&colon; a challenge for natural language processing
Authors: Joëlle Rey
Venue: AI Communications (1997)

In this paper, I analyze the important role played by discourse markers in any communication process, and the extremely complex process involved in translating them. The analysis is conducted from a pragmatic standpoint and stresses the importance of context in determining the preference for one marker over another. In order to illustrate this process, examples are presented in both French and English. As a result, suggestions will be made on parameters which should be taken into consideration for natural language processing applications.
Deriving qualitative rules from neural networks &ndash; a case study for ozone forecasting
Authors: Franz Wotawa, Gerhard Wotawa
Venue: AI Communications (2001)

As alternative to physical models, neural networks are a valuable forecast tool in environmental sciences. They can be used effectively due to their learning capabilities and their low computational costs. As far as the relevant variables of the system are measured and put into the network, it works fast and accurately. However, one of the major shortcomings of neural networks is that they do not reveal causal relationships between major system components and thus are unable to improve the explicit knowledge of the user. To overcome this problem, we introduce an approach for deriving qualitative informations out of neural networks. Some of the resulting rules can be directly used by a qualitative simulator for producing possible future scenarios. Because of the explicit representation of knowledge the rules should be easier to understand and can be used as starting point for creating models wherever a physical model is not available. We illustrate our approach using a Network for predicting surface ozone concentrations and discuss open problems and future research directions.
Email: its decision support systems inroads an update
Authors: Edward J. Lusk
Venue: Decision Support Systems (2006)

Email is compared to four communication alternatives: telephone, face-to-face, facsimile, and letter. The survey and analysis are follow-ups to the work of Plaisent and Bernard (1993) [6] [M. Plaisent, P.M. Bernard, Electronic mail: Efficient and effective or a fad?, European Business Review 93 (1993) 27-30]. The results are that email is ranked higher on all five of the attributes analyzed: efficiency, convenience, preference, most-used, and importance. In addition, it appears that email is increasingly taking on the role of DSS, being used in problem-solving, and continues to constitute about half of the activity regarding the exchange of information.
Some remarks on "Ambiguous Machine Architecture"
Authors: Ian J. Hayes
Venue: ACM SIGARCH Computer Architecture News (1978)

I would like to respond to an article, entitled "Ambiguous Machine Architecture and Program Efficiency", by Andrew Tanenbaum in Computer Architecture News Vol. 6 No. 3 (August 1977).
A Variational Model for Capturing Illusory Contours Using Curvature
Authors: Wei Zhu, Tony Chan
Venue: Journal of Mathematical Imaging and Vision (2007)

Illusory contours, such as the classical Kanizsa triangle and square [9], are intrinsic phenomena in human vision. These contours are not completely defined by real object boundaries, but also include illusory boundaries which are not explicitly present in the images. Therefore, the major computational challenge of capturing illusory contours is to complete the illusory boundaries. In this paper, we propose a level set based variational model to capture a typical class of illusory contours such as Kanizsa triangle. Our model completes missing boundaries in a smooth way via Euler's elastica, and also preserves corners by incorporating curvature information of object boundaries. Our model can capture illusory contours regardless of whether the missing boundaries are straight lines or curves. We compare the choice of the second order Euler's elastica used in our model and that of the first order Euler's elastica developed in Nitzberg-Mumford-Shiota's work on the problem of segmentation with depth [15, 16]. We also prove that with the incorporation of curvature information of objects boundaries our model can preserve corners as completely as one wants. Finally we present the numerical results by applying our model on some standard illusory contours.
DB2 Express-c: The Developer Handbook for Xml, Php, C/c++, Java, and .net
Venue:  (2006)

DB2 Express Edition for Community (DB2 Express-C) is a no charge data server for use in development and deployment. DB2 Express-C supports a full range of APIs, drivers, and interfaces for application development including PHP, C/C++, and .NET. In addition, DB2 Express-C V9 contains advanced XML features. DB2 Express-C provides ISVs an ideal starting database server for Web, enterprise, and eBusiness applications. This IBM Redbook provides fundamentals of DB2 application development with DB2 Express-C. It covers the DB2 Express-C installation and configuration for application development and skills and techniques for building DB2 applications with XML, PHP, C/C++, Java, and .NET. Code examples are used to demonstrate how to develop a DB2 application in a different language. By following the examples provided, you will be able to learn DB2 application development with XML, PHP, C/C++, Java, and .NET in a short time. 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
Mastering the Requirements Process (2nd Edition)
Authors: Suzanne Robertson, James Robertson
Venue:  (2006)

"If the purpose is to create one of the best books on requirements yet written, the authors have succeeded."-Capers JonesIt is widely recognized that incorrect requirements account for up to 60 percent of errors in software products, and yet the majority of software development organizations do not have a formal requirements process. Many organizations appear willing to spend huge amounts on fixing and altering poorly specified software, but seem unwilling to invest a much smaller amount to get the requirements right in the first place.Mastering the Requirements Process, Second Edition, sets out an industry-proven process for gathering and verifying requirements with an eye toward today's agile development environments. In this total update of the bestselling guide, the authors show how to discover precisely what the customer wants and needs while doing the minimum requirements work according to the project's level of agility.Features include The Volere requirements process-completely specified, and revised for compatibility with agile environments A specification template that can be used as the basis for your own requirements specifications New agility ratings that help you funnel your efforts into only the requirements work needed for your particular development environment and project How to make requirements testable using fit criteria Iterative requirements gathering leading to faster delivery to the client Checklists to help identify stakeholders, users, nonfunctional requirements, and more Details on gathering and implementing requirements for iterative releases An expanded project sociology section for help with identifying and communicating with stakeholders Strategies for exploiting use cases to determine the best product to build Methods for reusing requirements and requirements patterns Examples showing how the techniques and templates are applied in real-world situations