ppxscal/embedding_network huggingface dataset:
Designing intelligent user interface for ubiquitous computing environments
Authors: Anxo Cereijo Roibas, Antonio Krüger
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

This full-day tutorial will provide an overview on Intelligent User Interfaces in the context of the technological development associated with the Ubiquitous Computing paradigm. Based on a technological assessment of the main technological areas involved (miniaturization, communication and network structures, advanced display and speech technologies, as well as sensor integration and deployment) this tutorial will discuss the main approaches in context and user modeling, as well as present new interaction paradigms for ubiquitous computing environments. Examples of past and current research projects of the field will be used to explain and discuss the intersection of UbiComp and IUIs. Having discussed the technical foundations, the tutorial aims to explore the design and development of new pervasive applications for mobile devices and other distributed interfaces. It will explore how handhelds can interact with other surrounding devices, intelligent environments and with the social context. The tutorial will also look at how Participatory Design approaches and advanced in-situ evaluation techniques and ethno-methodologies such as living labs, on-the-field data collection, enactments, and 'Cultural Probes', can lead to the representation of significant communication systems.
Relational learning vs. propositionalization: Investigations in inductive logic programming and propositional machine learning
Authors: Stefan Kramer
Venue: AI Communications (2000)

(This work was partly supported by the Austrian Fonds zur F&ouml;rderung der Wissenschaftlichen Forschung (FWF) under grant P12645 INF. The Austrian Research Institute for Artificial Intelligence is supported by the Austrian Federal Ministry for Transport, Innovation and Technology.)
Programming Embedded Systems: With C and GNU Development Tools
Authors: Michael Barr, Anthony Massa
Venue:  (2006)

If you have programming experience and a familiarity with C--the dominant language in embedded systems--Programming Embedded Systems, Second Edition is exactly what you need to get started with embedded software. This software is ubiquitous, hidden away inside our watches, DVD players, mobile phones, anti-lock brakes, and even a few toasters. The military uses embedded software to guide missiles, detect enemy aircraft, and pilot UAVs. Communication satellites, deep-space probes, and many medical instruments would have been nearly impossible to create without embedded software. The first edition of Programming Embedded Systems taught the subject to tens of thousands of people around the world and is now considered the bible of embedded programming. This second edition has been updated to cover all the latest hardware designs and development methodologies.The techniques and code examples presented here are directly applicable to real-world embedded software projects of all sorts. Examples use the free GNU software programming tools, the eCos and Linux operating systems, and a low-cost hardware platform specially developed for this book. If you obtain these tools along with Programming Embedded Systems, Second Edition, you'll have a full environment for exploring embedded systems in depth. But even if you work with different hardware and software, the principles covered in this book apply.Whether you are new to embedded systems or have done embedded work before, you'll benefit from the topics in this book, which include:How building and loading programs differ from desktop or server computersBasic debugging techniques--a critical skill when working with minimally endowed embedded systemsHandling different types of memoryInterrupts, and the monitoring and control of on-chip and external peripheralsDetermining whether you have real-time requirements, and whether your operating system and application can meet those requirementsTask synchronization with real-time operating systems and embedded LinuxOptimizing embedded software for size, speed, and power consumptionWorking examples for eCos and embedded LinuxSo whether you're writing your first embedded program, designing the latest generation of hand-held whatchamacalits, or managing the people who do, this book is for you. Programming Embedded Systems will help you develop the knowledge and skills you need to achieve proficiency with embedded software.Praise for the first edition: "This lively and readable book is the perfect introduction for those venturing into embedded systems software development for the first time. It provides in one place all the important topics necessary to orient programmers to the embedded development process. --Lindsey Vereen, Editor-in-Chief, Embedded Systems Programming
Fast Cluster Polygonization and its Applications in Data-Rich Environments
Authors: Ickjai Lee, Vladimir Estivill-Castro
Venue: Geoinformatica (2006)

We develop a linear time method for transforming clusters of 2D-point data into area data while identifying the shape robustly. This method translates a data layer into a space filling layer where shaped clusters are identified as the resulting regions. The method is based on robustly identifying cluster boundaries in point data using the Delaunay Diagram. The method can then be applied to modelling point data, to displaying choropleth maps of point data without a reference map, to identifying association rules in the spatial dimension for geographical data mining, or to measuring a gap between clusters for cluster validity.
Adobe Acrobat 8 for Windows and Macintosh: Visual QuickStart Guide
Authors: John Deubert
Venue:  (2006)

Adobe Acrobat 8 for Windows and Macintosh: Visual QuickStart Guide uses a combination of task-based instruction and strong visuals to teach beginning and intermediate users how to be more productive with Adobe Acrobat. Author John Deubert takes readers step by step through all of the Adobe Acrobat 8 essentials, both basic--creating and viewing electronic documents, streamlining document reviews, using Acrobat's commenting and reviewing tools--and advanced--using digital signatures, creating interactive forms, and protecting sensitive documents. Both beginning users who want a thorough introduction to the topic, and more advanced users looking for a convenient reference will find what they need here in straightforward language, clear steps, and practical tips. By the end of the book, users will be able to smoothly integrate Adobe Acrobat 8 into their workflow. 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
Contention-based airtime usage control in multirate IEEE 802.11 wireless LANs
Authors: Chun-Ting Chou, Kang G. Shin, Sai Shankar N.
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

In a multirate wireless LAN, wireless/mobile stations usually adapt their transmission rates to the channel condition. It is difficult to control each station's usage of network resources since the shared channel can be overused by low transmission-rate stations. To solve this problem, we propose a distributed control of stations' airtime usage which 1) always guarantees each station to receive a specified share of airtime, and 2) keeps service for individual stations unaffected by other stations' transmission rates. Such airtime control enables service differentiation or quality of service (QoS) support. Moreover, it can achieve a higher overall system throughput.The proposed airtime usage control exploits the Enhanced Distributed Channel Access (EDCA) of the IEEE 802.11e standard [1]. Two control mechanisms are proposed: one based on controlling the station's arbitration inter-frame space (AIFS) and the other based on the contention window size. We show how the stations' airtime usage is related to the AIFS and contention window size parameters. Using this relation, two analytical models are developed to determine the optimal control parameters. Unlike the other heuristic controls or analytical models, our model provides handles or parameters for quantitative control of stations' airtime usage. Our evaluation results show that a precise airtime usage control can be achieved in a multirate wireless LAN.
A flexible approach to web component packaging
Authors: Hussein Suleman, Siyabonga Mhlongo
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

Web-based applications are rapidly making the transition to service oriented architectures, but this breaking up of single monolithic applications into multiple cooperating components creates complexity and management problems for system designers. This paper discusses a solution to one of the emerging complexity-related problems: how to package and distribute applications based on Web components for rapid and flexible deployment. To this end, a packaging framework was designed and reference implementations of package building and package installation tools were developed. The usability of such tools was then tested by a sample of users in the context of online information management systems, because of the availability of Web components and the inherent network-aware nature of such systems. The results are promising and demonstrate that the approach taken is reasonable and understandable and that such supporting technology for systems based on Web components is likely to positively impact the growth of advanced Web applications. In addition, the process of developing a proof-of-concept packaging system and the feedback from users has provided a useful set of requirements and guidelines for building such systems in future.
Contains and inside relationships within combinatorial pyramids
Authors: Luc Brun, Walter Kropatsch
Venue: Pattern Recognition (2006)

Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular pyramid framework encode different types of relationships between regions. This paper compares different graph models used within the irregular pyramid framework according to a set of relationships between regions. We also define a new algorithm based on a pyramid of combinatorial maps which allows to determine if one region contains the other using only local calculus.
White noise assumptions revisited: regression metamodels and experimental designs in practice
Authors: Jack P. C. Kleijnen
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Classic linear regression metamodels and their concomitant experimental designs assume a univariate (not multivariate) simulation response and white noise. By definition, white noise is normally (Gaussian), independently (implying no common random numbers), and identically (constant variance) distributed with zero mean (valid metamodel). This advanced tutorial tries to answer the following questions: (i) How realistic are these classic assumptions in simulation practice? (ii) How can these assumptions be tested? (iii) If assumptions are violated, can the simulation's I/O data be transformed such that the analysis becomes correct? (iv) If such transformations cannot be applied, which alternative statistical methods (for example, generalized least squares, bootstrapping, jackknifing) can then be applied?
A New Coding Technique for Digital Holographic Video Using Multi-View Prediction
Authors: Young-Ho Seo, Hyun-Jun Choi, Jin-Woo Bae, Hoon-Jong Kang, Seung-Hyun Lee, Ji-Sang Yoo, Dong-Wook Kim
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we proposed an efficient coding method for digital hologram (fringe pattern) acquired with a CCD camera or by computer generation using multi-view prediction and MPEG video compression standard techniques. It processes each R, G, or B color component separately. The basic processing unit is a partial image segmented as the size of M × N. Each partial image retains the information of the whole object. This method generates an assembled image for a column of the segmented and frequency-transformed partial images, which is the basis of the coding process. That is, a motion estimation and compensation technique of MPEG is applied between the reconstructed images from the assembled images with the disparities found during generation of assembled image and the original partial images. Therefore the compressed results are the disparity of each partial image to form the assembled image for the corresponding column, assembled image, and the motion vectors and the compensated image for each partial image. The experimental results with the implemented algorithm showed that the proposed method has NC (Normalized Correlation) values about 4% higher than the previous method at the same compression ratios, which convinced us that ours has better compression efficiency. Consequently, the proposed method is expected to be used effectively in the application areas to transmit or store in digital format the digital hologram data.
Modular organization of protein interaction networks
Authors: Feng Luo, Yunfeng Yang, Chin-Fu Chen, Roger Chang, Jizhong Zhou, Richard H. Scheuermann
Venue: Bioinformatics (2007)

Motivation: Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules. Identifying these modules is essential to understand the organization of biological systems. Result: In this paper, we present a framework to identify modules within biological networks. In this approach, the concept of degree is extended from the single vertex to the sub-graph, and a formal definition of module in a network is used. A new agglomerative algorithm was developed to identify modules from the network by combining the new module definition with the relative edge order generated by the Girvan-Newman (G-N) algorithm. A JAVA program, MoNet, was developed to implement the algorithm. Applying MoNet to the yeast core protein interaction network from the database of interacting proteins (DIP) identified 86 simple modules with sizes larger than three proteins. The modules obtained are significantly enriched in proteins with related biological process Gene Ontology terms. A comparison between the MoNet modules and modules defined by Radicchi et al. (2004) indicates that MoNet modules show stronger co-clustering of related genes and are more robust to ties in betweenness values. Further, the MoNet output retains the adjacent relationships between modules and allows the construction of an interaction web of modules providing insight regarding the relationships between different functional modules. Thus, MoNet provides an objective approach to understand the organization and interactions of biological processes in cellular systems. Availability: MoNet is available upon request from the authors. Contact: luofeng@cs.clemson.edu Supplementary information: Supplementary Data are available at Bioinformatics online.
Sams Teach Yourself Mac OS X Digital Media All In One
Authors: John Ray, Robyn Ness, Carla Rose, Jeff Sengstack
Venue:  (2003)

Digital Photos, Video, and Music All in One is designed to teach the new computer user how to easily work with a variety of digital media.It doesn't assume the reader wants to learn how to use just one product, but covers multiple products and technologies together in a logical fashion: Digital Cameras Photoshop Elements Burning CDs and DVDs Scanners and Printers MP3s and Digital Music Digital Videos
Earth to orbit logistics and supply chain modeling and simulation for NASA exploration systems
Authors: Mohamed Fayez, Dayana Cope, Assem Kaylani, Mike Callinan, Edgar Zapata, Mansooreh Mollaghasemi
Venue: Proceedings of the 38th conference on Winter simulation (2006)

As exploration operations expand further into space, NASA must enhance its understanding and capability of the increasingly complex "supply chain" management of materials, people, information, and knowledge from sources (somewhere on Earth) to destinations (somewhere in space, e.g. LEO, GEO, Moon, Mars, etc.) and vice versa. Without the ability to understand, define, model, and simulate the supply chain to estimate, project, and affect decision making relevant to the supply chain performance, NASA will find it increasingly difficult to effectively manage this complex supply chain and to work as an informed collaborator with its supply chain partners in the planning, execution, and management of a successful space exploration mission. This paper describes an ongoing project on "the first ever application of 21st century space exploration supply chain modeling, simulation and analysis".
Improved algorithms for two single machine scheduling problems
Authors: Yong He, Weiya Zhong, Huikun Gu
Venue: Theoretical Computer Science (2006)

In this paper, we investigate two single machine scheduling problems. The first problem addresses a class of the two-stage scheduling problems in which the first stage is job production and the second stage is job delivery. For the case that jobs are processed on a single machine and delivered by a single vehicle to one customer area, with the objective of minimizing the time when all jobs are completed and delivered to the customer area and the vehicle returns to the machine, an approximation algorithm with a worst-case ratio of 5/3 is known and no approximation can have a worst-case of 3/2 unless P = NP. We present an improved approximation algorithm with a worst-case ratio of 53/35, which only leaves a gap of 1/70. The second problem is a single machine scheduling problem subject to a period of maintenance. The objective is to minimize the total completion time. The best known approximation algorithm has a worst-case ratio of 20/17 We present a polynomial time approximation scheme.
Microsoft Office PowerPoint 2007 QuickSteps, 1 edition
Authors: Carole Boggs Matthews
Venue:  (2006)

Step-by-Step, Full-Color Graphics! Create great-looking presentation slides right away using Microsoft Office PowerPoint 2007. Color screenshots and clear instructions show you how to use the new and improved capabilities featured in this powerful presentation program. Follow along and learn to work with the new Office interface and ribbon, create slides, and add text, tables, charts, graphics, sound, and video. Plus, it's easy to flip straight to the information you need using the color-coded tabs, detailed index, and chapter "How to" lists. Get the book that gets you started using PowerPoint 2007 in no time.In each chapter:Shortcuts for accomplishing common tasksNeed-to-know facts in concise narrativeHelpful reminders or alternate ways of doing things Bonus information related to the topic being coveredErrors and pitfalls to avoidTable of contentsChapter 1. Stepping into PowerPointChapter 2. Creating the PresentationChapter 3. Working with Slides, Notes, and MastersChapter 4. Modifying Slides TextChapter 5. Creating Tables in SlidesChapter 6. Working with Clip Art and GraphsChapter 7. Working with Organization Charts and DiagramsChapter 8. Special Effects and Drawing in PowerPointChapter 9. Working with Multimedia and the InternetChapter 10. Printing and Running a Slide Show
Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements
Authors: O. A. Yemets, T. N. Barbolina, O. A. Chernenko
Venue: Cybernetics and Systems Analysis (2006)

The paper proposes an exact method to solve an optimization problem on arrangements with a linear-fractional objective function and additional linear constraints. The efficiency of the solution algorithm is analyzed by means of numerical experiments.
Gaussianization: An Efficient Multivariate Density Estimation Technique for Statistical Signal Processing
Authors: Deniz Erdogmus, Robert Jenssen, Yadunandana N. Rao, Jose C. Principe
Venue: Journal of VLSI Signal Processing Systems (2006)

Multivariate density estimation is an important problem that is frequently encountered in statistical learning and signal processing. One of the most popular techniques is Parzen windowing, also referred to as kernel density estimation. Gaussianization is a procedure that allows one to estimate multivariate densities efficiently from the marginal densities of the individual random variables. In this paper, we present an optimal density estimation scheme that combines the desirable properties of Parzen windowing and Gaussianization, using minimum Kullback---Leibler divergence as the optimality criterion for selecting the kernel size in the Parzen windowing step. The utility of the estimate is illustrated in classifier design, independent components analysis, and Prices' theorem.
Simple crosscutting concerns are not so simple: analysing variability in large-scale idioms-based implementations
Authors: Magiel Bruntink, Arie van Deursen, Maja D'Hondt, Tom Tourwé
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

This paper describes a method for studying idioms-based implementations of crosscutting concerns, and our experiences with it in the context of a real-world, large-scale embedded software system. In particular, we analyse a seemingly simple concern, tracing, and show that it exhibits significant variability, despite the use of a prescribed idiom. We discuss the consequences of this variability in terms of how aspect-oriented software development techniques could help prevent it, how it paralyses (automated) migration efforts, and which aspect language features are required in order to obtain precise and concise aspects. Additionally, we elaborate on the representativeness of our results and on the usefulness of our proposed method.
Protein classification by matching and clustering surface graphs
Authors: M. A. Lozano, F. Escolano
Venue: Pattern Recognition (2006)

In this paper, we address the problem of comparing and classifying protein surfaces with graph-based methods. Comparison relies on matching surface graphs, extracted from the surfaces by considering concave and convex patches, through a kernelized version of the Softassign graph-matching algorithm. On the other hand, classification is performed by clustering the surface graphs with an EM-like algorithm, also relying on kernelized Softassign, and then calculating the distance of an input surface graph to the closest prototype. We present experiments showing the suitability of kernelized Softassign for both comparing and classifying surface graphs.
Simulating order fulfillment with product substitutions in an assemble-to-order supply chain
Authors: Thomas R. Ervolina, Markus Ettl, Young M. Lee, Daniel J. Peters
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In today's competitive and dynamic business environment, companies need to continually evaluate the effectiveness of their supply chain and look for ways to transform business processes to achieve superior customer service and higher profitability. In this paper we propose a novel availability management process called Available-to-Sell (ATS) that incorporates demand shaping and profitable demand response to drive better operational efficiency through improved synchronization of supply and demand. We develop an order fulfillment simulation model to assess how the proposed availability management system affects supply chain performance, and apply the model in a server computer manufacturing environment. The simulation plays an important role in making strategic business decisions that impact customer service, revenue and profitability.