ppxscal/embedding_network huggingface dataset:
What's New in Microsoft Office 2007 Quick Reference
Authors: Beezix Inc
Venue:  (2007)

4-page laminated quick reference guide showing instructions for the new and changed features of Microsoft Office 2007 for Word, Excel, and PowerPoint. Also includes a command reference for each product, showing Office 2003 commands and their 2007 equivalents. Office: The Ribbon; The Office Button; The Quick Access Toolbar; Status Bar; Mini Toolbar; Using Themes to Format a Document; SmartArt; Shape Styles; Showing the Developer Tab; Saving as PDF; Emailing a PDF; Compatibility with Previous Versions; New File Formats; Features No Longer Available. Word: Spacing between Paragraphs; Showing the Ruler; Contextual Spelling; Creating and Using Quick Styles; Displaying the Styles Pane; Using the Apply Styles Window; The Style Inspector; Mail Merge; Building Blocks; Creating a Quick Part Building Block; Inserting a Quick Part; Using Cover Page Building Blocks; Adding a Watermark Building Block; The Reviewing Pane; Tracking Moved Text; Improved Compare and Combine; Features No Longer Available; New Word File Types. Excel: Limit Changes; Resizing the Formula Bar; Formula AutoComplete; Improvements to Named Ranges; Inserting a Sheet; Page Layout View; Showing Invalid Data; Changes to Excel Tables (Lists); Enhanced Filtering; Structured References in Excel Tables; New Conditional Formatting; Conditional Formatting Rules Manager; Sorting by Icon, Cell Color, or Font Color; Changes to PivotTables; New Excel File Types. PowerPoint: The Selection and Visibility Pane; Converting to SmartArt; Adding Placeholders to a Slide Master; Resetting Placeholders; Adding a Customized Layout; Converting a Shape to Freeform; Improvements to Gradients; Background Styles; New or Changed Text Features: Text Wrapping, Text Direction, Columns, Selecting Separate Areas of Text, Indents & Tabs by Paragraph, and more; New PowerPoint File Types; Features No Longer Available. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
A cache invalidation scheme for continuous partial match queries in mobile computing environments
Authors: Yon Dohn Chung
Venue: Distributed and Parallel Databases (2008)

The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.
Presentation Zen: Simple Ideas on Presentation Design and Delivery (Voices That Matter), 1 edition
Authors: Garr Reynolds
Venue:  (2008)

FOREWORD BY GUY KAWASAKI Presentation designer and internationally acclaimed communications expert Garr Reynolds, creator of the most popular Web site on presentation design and delivery on the net presentationzen.com shares his experience in a provocative mix of illumination, inspiration, education, and guidance that will change the way you think about making presentations with PowerPoint or Keynote. Presentation Zen challenges the conventional wisdom of making "slide presentations" in todays world and encourages you to think differently and more creatively about the preparation, design, and delivery of your presentations. Garr shares lessons and perspectives that draw upon practical advice from the fields of communication and business. Combining solid principles of design with the tenets of Zen simplicity, this book will help you along the path to simpler, more effective presentations.
An Enhanced ART2 Neural Network for Clustering Analysis
Authors: Jianhong Luo, Dezhao Chen
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The adaptive resonance theory 2 (ART2) neural network exhibits several properties which can be useful in the data mining and which are lacking in most other neural networks. But ART2 has deficiencies that the categories clustered by ART2 are very mutable to slight changes in training conditions. An improved ART2 with enhanced triplex matching mechanism, named as ETM-ART2, is presented to redress the deficiencies. Several tests results show that ETM-ART2 performs better than classic ART2 when applied to clustering tasks. It is an effective improved algorithm and can be applied to a wide variety of problems.
A network calculus with effective bandwidth
Authors: Chengzhi Li, Almut Burchard, Jörg Liebeherr
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

This paper establishes a link between two principal tools for the analysis of network traffic, namely, effective bandwidth and network calculus. It is shown that a general version of effective bandwidth can be expressed within the framework of a probabilistic version of the network calculus, where both arrivals and service are specified in terms of probabilistic bounds. By formulating well-known effective bandwidth expressions in terms of probabilistic envelope functions, the developed network calculus can be applied to a wide range of traffic types, including traffic that has self-similar characteristics. As applications, probabilistic lower bounds are presented on the service given by three different scheduling algorithms: Static Priority, Earliest Deadline First, and Generalized Processor Sharing. Numerical examples show the impact of specific traffic models and scheduling algorithms on the multiplexing gain in a network.
LS-TDF: Low-Switching Transition Delay Fault Pattern Generation
Authors: Jeremy Lee, Mohammad Tehranipoor
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Higher chip densities and the push for higher performance have continued to drive design needs. Transition delay fault testing has become the preferred method for ensuring these chips operate at the specified frequency. However, current industrially used X-filling (random-fill or compression) schemes tend to generate transition delay fault patterns with switching activity much higher than what would be seen during functional mode operation of the chip, potentially causing failures that would not occur in the field. In this paper, we present a low switching transition delay fault pattern generation flow. The flow short-lists patterns based on high switching activity, which is determined by the fault lists of each pattern. Once those patterns with high switching are filtered, they will be replaced by low-switching patterns to recover any lost fault coverage. The proposed pattern generation flow works well with commercial tools and can easily be integrated into an industrial flow.
On the management of grid credentials
Authors: Luiz M. R. Gadelha,  Jr., Bruno Schulze
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

In this work, we provide some insights about the problem of managing credentials in grid environments. Since user mobility is a very common requirement in grid implementations, centralized credential servers are frequently used to store their cryptographic keys. We study some possible solutions for environments with stronger requirements regarding non-repudiation, where the use of credential servers may not be acceptable.
The synthesis of robust polynomial arithmetic with stochastic logic
Authors: Weikang Qian, Marc D. Riedel
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challenging. Indeed, mounting concerns over noise and uncertainty in signal values motivate a new approach: the design of stochastic logic, that is to say, digital circuitry that processes signals probabilistically, and so can cope with errors and uncertainty. In this paper, we present a general methodology for synthesizing stochastic logic for the computation of polynomial arithmetic functions, a category that is important for applications such as digital signal processing. The method is based on converting polynomials into a particular mathematical form --- Bernstein polynomials --- and then implementing the computation with stochastic logic. The resulting logic processes serial or parallel streams that are random at the bit level. In the aggregate, the computation becomes accurate, since the results depend only on the precision of the statistics. Experiments show that our method produces circuits that are highly tolerant of errors in the input stream, while the area-delay product of the circuit is comparable to that of deterministic implementations.
Integration Of Structured And Unstructured Text Data In A Clinical Information System
Authors: Ching-Song D. Wei, Sam Y. Sung, Simon J. Doong, Peter A. Ng
Venue: Journal of Integrated Design Process Science (2006)

This paper describes an integration of structured and unstructured text data in a Clinical Information System (CIS). The input and output data of this Clinical Information System depend heavily on the use of a medical database and an intensive Graphic User Interface (GUI). The data source consists of multiple GUI's fields of various forms which compose structured data and free-text medical reports of patients. These free text medical reports are mostly made of the complicated part of unstructured text data. Usually, the free text medical reports include reports on patient intake, examination, and discharge, which could be an input from a keyboard, a handwriting device, a voice microphone, transcription service or others. Some of the medical language extraction and encoding systems, such as MedLEE, can be used to translate the medical free text into a standard and structured format. These systems will be reviewed and adopted to perform the knowledge extraction from medical free texts, if applicable. To achieve the goal of data sharing for the future application in data interoperability between heterogeneous database systems, a clinical data repository can be stored which is formed by applying a standard-compliant eXtensible Markup Language (XML), with GUI form, for integrating these data. Currently there are a number of healthcare information standards, such as HL7 (Health Level 7, 2006) and Medical Markup Language (Medical Markup Language, 2006) to promote data exchange. But it requires that both the sender and receiver of the data use the same standard in order to achieve the data exchange goal. In this paper, the generic data XML model is therefore developed and the feasibility for transforming the model into any of the standards is also demonstrated.
New Techniques for Modeling File Data Distribution on Storage Nodes
Authors: Alberto Núñez, Javier Fernández, Jose Daniel Garcia, Laura Prada, Jesús Carretero
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

This paper presents a new probabilistic model which describes the way data blocks belonging to a certain file are distributed along the disk in general purpose systems. The distribution type is classified depending on the kind of File System, the file size and the disk occupancy ratio. The resulting algorithm will be used to simulate the access timeto the data stored on a disk of an I/O node, where the position of data blocks determines the access time. In orderto perform the modeling, some parameters have been estimatedusing some stress tests with different degrees of diskoccupancy and file sizes on Ext2 and ReiserFS File Systems.
Gene Selection using the GMM-IG Framework based Integrative Analysis
Authors: Mingyi Wang, Jake Y. Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The limitation of sample numbers is becoming a bottle neck in gene expression research. How to integrate the DNA microarray data involving in same or similar biological subjects is a promising way to increase sample numbers. However, the noise and disparities between different microarrays still make integration a challenge. Here we provide a straight forward and easily implemented framework to combine information from multiple microarrays. This framework applies a two-component Gaussian mixture modeling (GMM) to estimate the underlying expression levels of genes and discretize the original continuous values. Then significantly differentially expressed genes are selected and ranked by integrated microarray data and Information-Gain (IG) measure. The real data evaluation showed that this method performed better than other existing integrative methods.
Dice: a game theoretic framework for wireless multipath network coding
Authors: Xinyu Zhang, Baochun Li
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Network coding has emerged as a promising approach that enables reliable and efficient end-to-end transmissions in lossy wireless mesh networks. Existing protocols have demonstrated its resilience to packet losses, as well as the ability to integrate naturally with multipath opportunistic routing. However, these heuristics do not take into account the inherent resource competition in wireless networks, thereby compromising the coding advantages. In this paper, we take a game-theoretic perspective towards optimized resource allocation for network coding based unicast protocols. We design decentralized mechanisms that achieve better efficiency-fairness tradeoff, for both cooperative and selfish users. Our framework features a modularized optimization of two subproblems: the multipath routing of coded information flows for each player, and the broadcast and coding rate allocation among competing players. We have implemented the framework on a wireless emulation testbed and demonstrated its high performance in terms of throughput and fairness.
Logit-transformation Based Confidence Intervals for the Sensitivity of a Continuous-scale Diagnostic Test
Authors: Jihye Kim, Gengsheng Qin
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In the field of modern medicine, diagnostic tests play an important role in detecting diseased patients. The diagnostic accuracy of a test is measured by its sensitivity and specificity. In this paper, we focus on the interval estimation for the sensitivity of a continuous-scale diagnostic test at a fixed level of its specificity. We propose two logit-transformation based confidence intervals for the sensitivity of a test and compare them with two of the best existing intervals (BTI and BTII) proposed by Zhou and Qin [5]. Our simulation studies show that the newly proposed logit-transformation based intervals (LTI and LTII) have shorter interval lengths than the existing BTI and BTII intervals. The applications of the new intervals are illustrated in two real examples.
Universal packet routing algorithms
Authors: T. Leighton
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The packet-routing problem is examined in a network-independent context. The goal is to devise a strategy for routing that works well for a wide variety of networks. To achieve this goal, the routing problem is partitioned into two stages: a path-selection stage and a scheduling stage. In the first stage, paths for the packets are found with small maximum distance and small maximum congestion. Once the paths are fixed, both are lower bounds on the time required to deliver the packets. In the second stage, a schedule is found for the movement of each packet along its path so that no two packets traverse the same edge at the same time and the total time and maximum queue size required to route all of the packets to their destinations are minimized. The second stage is more challenging and is the focus of this study.
Measurability of evaluative criteria used by optimization methods
Authors: Jan Panus, Stanislava Simonova
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The fundamental requirements are to optimize certain suggested solution in directive and decision-making activities. Used methods are derived on mathematical basis and their typical implementation is searching of optimal traffic connection between the two junctions. It means we look for the shortest distance among starting and final points. Evaluative indicator can be another criterion than distance, however. If weighted standpoint is price of realization of certain projects or number of workers that are necessary for proposed business then it is possible to utilize optimization methods for supporting of decision-making operation in common manager profession.
Dynamic predication model for integrated series and application
Authors: Yuan Jia-hai, Zhao Zhi, Xiong Min-peng
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In the paper a predication model for integrated series is proposed. Granger causality analysis is deployed first for finding out the cointegrated series for the interested series. Then granger causality information is used for the identification of the prediction model and designing of prediction process. A case study for electricity consumption modeling for China is studied to validate the viability of the method proposed in the paper.
Semantic Enforcement of Privacy Protection Policies via the Combination of Ontologies and Rules
Authors: Yuh-Jong Hu, Hong-Yi Guo, and Guang-De Lin
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

We propose that the semantic formal model for P3P and EPAL-based privacy protection policies can be enforced and expressed as a variety of ontologies and rules (ontologies+rules) combinations, such as DLP, SWRL, AL-log, DL-log, DL+log, and MKNF, etc. Based on P3P and EPAL's original expressions and their dictionaries, several ontologies+rules semantic enforcement of privacy protection policies will be proposed in this study that can be compared with existing others. Furthermore, we express privacy protection management policies as a set of ontology statements, rules, and facts for both information disclosure and rights delegation using one of the above ontologies+rules combinations for two specific use case scenarios. When verifying P3P/EPAL formal semantics, we exploit which ontologies+rules combination will be a feasible information disclosure control scenario under certain conditions. We hope that this study might shed some light on the study of future general information disclosure and rights delegation controlled on the open Web environment.
Combining Physico-chemical Properties with PSSM for Protein Secondary Structure Prediction Using BP Neural Network
Authors: Huiyun Yang, Ouyan Shi, Xin Tian
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

A two-stage neural network has been used to predict protein secondary structure based on the method of combining physico-chemical properties of amino acid residues with evolutionary information. We employed CB513 as the dataset. After excluding the protein chains containing X, B and which with sequence length shorter than 30 amino acids, there were 492 protein chains in this dataset totally. The network has been trained and tested by 7-fold cross-validation. The result indicated that the prediction accuracy reached 75.96%, which was 0.5% higher than that of only using PSSM as input. Although QH was found to be lower than that of PSSM, CH had an improvement, which indicates that the method we developed is successful.
Managing RFID Consumer Privacy and Implementation Barriers
Authors: Rajni Goel
Venue: Information Systems Security (2007)

Radio Frequency Identification (RFID) technologies have increasing visibility in the business processes: automating inventory management (supply chains), facilitating innovation, and increasing competitiveness. Since the potential applications of RFID systems are numerous, it is essential to address the industry and consumer perspective issues that have resulted in barriers to RFID implementation. This paper outlines critical barriers in implementing RFID technologies, specifically for authentication and privacy in an RFID tagged world, and provides organizational leaders with a set of initial responses, including a new scheme (Veri-RFID) for consumer privacy, that would assist in the process to overcome these challenges.
A versatile timing unit for traffic shaping, policing and charging in packet-switched networks
Authors: L. Sarakis, N. Moshopoulos, D. Loukatos, K. Marinis, P. Stathopoulos, N. Mitrou
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Timing has a key role in several traffic control functions encountered in modern packet-switched networks. In order to be effective, a timing unit must provide fine resolution, be simple to implement and scale well with the number of controlled traffic streams. This paper addresses the design, implementation and evaluation of a timing unit that can support accurate and efficient implementations of traffic shaping, policing and charging in packet-switched networks. The timing unit is implemented in hardware and, therefore, overcomes constraints associated with software-based timers. It accommodates a pool of independently-clocked timers and counters, organised in timing blocks, and, consequently, is able to support, in parallel, traffic streams with diverse timing requirements. The design supports shaping and policing through token buckets, leaky buckets and a scheme, variation of the token bucket, that aims at providing statistical quality of service guarantees by exploiting the effective rate concept. Charging is supported by dedicated counters that measure the utilization of the effective rate. The granularity of the timing unit is adjustable in run-time to adapt to changes in the rate parameters of the shaping and policing functions. The validation of the timing unit is done through the development of a prototype board consisting of programmable hardware and embedded software blocks. The temporal resolution of the timing unit and the advantages of the hardware/software co-design are experimentally evaluated.