ppxscal/embedding_network huggingface dataset:
A hybrid approach for fabrication of polymeric BIOMEMS devices
Authors: Varshni Singh, Yohannes Desta, Proyag Datta, Jason Guy, Mark Clarke, Daniel L. Feedback, J. Weimert, Jost Goettert
Venue: Microsystem Technologies (2006)

Polymeric microfluidic chips are an enabling component for cost-effective, point of care analytical devices for pharmaceutical, agriculture, health, biological and medical applications. The microfluidic structures can be completed with active elements like pumps and valves as well as sensor components for more complex so called total analysis systems. Often, systems are designed as reader and disposable cartridge where the fluidic structures are simple devices that will be inserted into the reader, which executes the analytical protocol and displays the information in digital form, and disposed after completion of the analysis. In this paper, a hybrid fabrication approach was employed to build a polymeric microfluidic device, so-called sweatstick, suitable for collecting small, precise amounts (600&#x00a0;&#x03bc;l) of human sweat, which were further analyzed for the amount of calcium ions indicating bone mass loss. The device was assembled from different parts fabricated by ultra deep X-ray lithography, precision micro-milling, and molding. Surface treatment of liquid exposed surfaces by oxygen plasma ensures hydrophilic behavior and proper capillary action. Preliminary testing of the device was performed by collecting defined amounts of sweat simulant and determining the calcium ion content using a fluorescent technique. The results for low calcium ion concentration typical for human sweat were excellent and repeatable with variation less than 5% demonstrating the ability to perform indirect bone loss measurements.
Protected systems in general systems theory
Authors: A. A. Ponomaryov
Venue: Cybernetics and Systems Analysis (2006)

Within the framework of a synergetic theory of protection and protected systems, the concept of a protected system is defined in the context of mainstreams of general systems theory, the relation of such a system to mathematical and computer modeling is shown, and its possible applications are outlined.
Performance Evaluation of Packet Processing Architectures Using Multiclass Queuing Networks
Authors: Soren Sonntag, Matthias Gries, Christian Sauer
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

Modern real-time systems consist of complex parallel and heterogeneous architectures. Early design decisions, such as the partitioning of functionality onto architecture building blocks and the choice of algorithms, have a large impact on the quality of the resulting platform. In order to support the designer during this concept phase we have developed our performance evaluation framework SystemQ. In this paper, we demonstrate why multiclass queuing networks as used by SystemQ are a natural abstraction for evaluating network processing platforms. In particular we reveal the impact of scheduling policies on the Quality-of- Service, such as the residence time of network traffic in the system. For the same stimuli the packet latency can vary by more than one order of magnitude if only one queuing discipline in the system is modified.
Authenticating mobile phone users using keystroke analysis
Authors: N. L. Clarke, S. M. Furnell
Venue: International Journal of Information Security (2006)

Mobile handsets have found an important place in modern society, with hundreds of millions currently in use. The majority of these devices use inherently weak authentication mechanisms, based upon passwords and PINs. This paper presents a feasibility study into a biometric-based technique, known as keystroke analysis &#x2013; which authenticates the user based upon their typing characteristic. In particular, this paper identifies two typical handset interactions, entering telephone numbers and typing text messages, and seeks to authenticate the user during their normal handset interaction. It was found that neural network classifiers were able to perform classification with average equal error rates of 12.8%. Based upon these results, the paper concludes by proposing a flexible and robust framework to permit the continuous and transparent authentication of the user, thereby maximising security and minimising user inconvenience, to service the needs of the insecure and evermore functional mobile handset.
Introduction to SQL: Mastering the Relational Database Language (4th Edition)
Authors: Rick F. van der Lans
Venue:  (2006)

The Classic SQL Tutorial: Fully Updated for Today's Standards and Today's Top DatabasesFor twenty years, van der Lans' Introduction to SQL has been the definitive SQL tutorial for database professionals everywhere, regardless of experience or platform. Now van der Lans has systematically updated this classic guide to reflect the latest SQL standards and the newest versions of today's leading RDBMSs: Oracle, Microsoft SQL Server, DB2, and MySQL.Using case study examples and hands-on exercises, van der Lans illuminates every key SQL concept, technique, and statement. Drawing on decades of experience as an SQL standards team member and enterprise consultant, he reveals exactly why SQL works as it doesï¾and how to get the most out of it. You'll gain powerful insight into everything from basic queries to stored procedures, transactions to data security. Whether you're a programmer or DBA, a student or veteran, this book will take you from “apprentice” to true SQL master. ï¾ Writing queries and updating data: all you need to know about SELECT ï¾ Working with joins, functions, and subqueries ï¾ Creating database objects: tables, indexes, views, and more ï¾ Specifying keys and other integrity constraints ï¾ Using indexes to improve efficiency ï¾ Enforcing security via passwords and privileges ï¾ Building stored procedures and triggers ï¾ Developing with embedded SQL and ODBC ï¾ Working with transactions, including rollbacks, savepoints, isolation levels, and more ï¾ Optimizing performance by reformulating SQL statements ï¾ Using object-relational features: subtables, references, sets, and user-defined data types ï¾ Reference section: SQL statement definitions and SQL function lists
Analysis of affect expressed through the evolving language of online communication
Authors: Alena Neviarouskaya, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

In this paper, we focus on affect recognition from text in order to facilitate sensitive and expressive communication in computer-mediated environments. Our model for analyzing affect conveyed by text is tailored to handle the style and specifics of informal online conversations. The motivation behind our approach is to improve social interactivity and emotional expressiveness of real-time messaging.In order to estimate affect in text, our model processes symbolic cues, such as emoticons, detects and transforms abbreviations, and employs natural language processing techniques for word/phrase/sentence-level analysis, e.g. by considering relations among words in a sentence. As a result of the analysis, text can be categorized into emotional states and communicative functions. A designed graphical representation of a user (avatar) displays emotions and social behaviour driven by text and performs natural idle movements. The proposed system shows promising results on affect recognition in real examples of online conversation.
Module-based modeling of production-distribution systems considering shipment consolidation
Authors: Xiaohua Wang, Soemon Takakuwa
Venue: Proceedings of the 38th conference on Winter simulation (2006)

A module-based modeling method was developed to analyze the production-distribution systems by using a discrete event simulation with ARENA. Excel VBA was also adopted to automatically generate the simulation programs. Using the proposed method, one can quickly create a multistage, multi-item supply chain system such as serials, convergent, divergent or general networks, for analyzing the performance of a supply chain. Both inventory control and shipment consolidation policy were considered in this study. A number of outputs can be used as a performance measure in the decision making; for example, transportation costs, inventory level and costs, and the fill rate. An actual application model was generated using the proposed method. The result shows that the module-based method is a powerful tool for modeling the supply chain systems.
A New Scheme to Realize the Optimum Watermark Detection for the Additive Embedding Scheme with the Spatial Domain
Authors: Takaaki Fujita, Maki Yoshida, Toru Fujiwara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

A typical watermarking scheme consists of an embedding scheme and a detection scheme. In detecting a watermark, there are two kinds of detection errors, a false positive error (FPE) and a false negative error (FNE). A detection scheme is said to be optimum if the FNE probability is minimized for a given FPE probability. In this paper, we present an optimum watermark detection scheme for an additive embedding scheme with a spatial domain. The key idea of the proposed scheme is to use the differences between two brightnesses for detecting a watermark. We prove that under the same FPE probability the FNE probability of the proposed optimum detection scheme is no more than that of the previous optimum detection scheme for the additive embedding scheme with the spatial domain. Then, it is confirmed that for an actual image, the FNE probability of the proposed optimum detection scheme is much lower than that of the previous optimum detection scheme. Moreover, it is confirmed experimentally that the proposed optimum detection scheme can control the FPE probability strictly so that the FPE probability is close to a given probability.
Dynamic HTML: The Definitive Reference (Dynamic Html)
Authors: Danny Goodman
Venue:  (2006)

Packed with information on the latest web specifications and browser features, this new edition is your ultimate one-stop resource for HTML, XHTML, CSS, Document Object Model (DOM), and JavaScript development. Here is the comprehensive reference for designers of Rich Internet Applications who need to operate in all modern browsers, including Internet Explorer 7, Firefox 2, Safari, and Opera. With this book, you can instantly see browser support for the latest standards-based technologies, including CSS Level 3, DOM Level 3, Web Forms 2.0, XMLHttpRequest for AJAX applications, JavaScript 1.7, and many more. This new edition:Provides at-a-glance references for the tags, attributes, objects, properties, methods, and events of HTML, XHTML, CSS, DOM, and core JavaScript. You can quickly look up a particular feature or language term to see if it is available in desired browser brands and versions.Includes handy cross referencing that lets you look up an attribute (or object property, method, or event type) to find all the items that recognize it, including interrelated HTML tags, style properties, and document object model methods, properties, and events.Offers appendices where you can quickly locate values useful in HTML authoring and scripting. You'll find coverage of commands used across three browsers for user-editable content.Includes a glossary that gives you quick explanations of some of the new and potentially confusing terminology of DHTML.Dynamic HTML: The Definitive Reference speeds the way to adding sophisticated features to your web pages. Indispensable, complete, and succinct, this bestselling guide is the must-have compendium for all web developers involved in creating dynamic web content.
Large triangles in the d-dimensional unit cube
Authors: Hanno Lefmann
Venue: Theoretical Computer Science (2006)

We consider a variant of Heilbronn's triangle problem by asking for a distribution of n points in the d-dimensional unit cube [0, 1]d such that the minimum (two-dimensional) area of a triangle among these n points is as large as possible. Denoting by Δdoff-line (n) and Δdon-line (n) the supremum of the minimum area of a triangle among n points over all distributions of n points in [0, 1]d for the off-line and the on-line situation, respectively, for fixed dimension d ≥ 2 we show that c1ċ(log n)1/(d-1)/n2/(d-1) ≤ Δdoff-line(n) ≤ c'1/n2/d and c2/n2/(d-1) ≤ Δdon-line (n) ≤ c'2/n2/d for constants c1, c2, c'1,c'2 > 0 which depend on d only. Moreover, we provide a deterministic polynomial time algorithm that achieves the lower bound Ω((log n)1/(d-1))/n2/(d-1)) on the minimum area of a triangle among n points in [0, 1]d in the off-line case.
Linear work suffix array construction
Authors: Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt
Venue: Journal of the ACM (JACM) (2006)

Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to linear-time construction algorithms and more explicit structure. We narrow this gap between theory and practice with a simple linear-time construction algorithm for suffix arrays. The simplicity is demonstrated with a C&plus;&plus; implementation of 50 effective lines of code. The algorithm is called DC3, which stems from the central underlying concept of difference cover. This view leads to a generalized algorithm, DC, that allows a space-efficient implementation and, moreover, supports the choice of a space--time tradeoff. For any v &isin; &lsqb;1,&nradic;&rsqb;, it runs in O(vn) time using O(n/&vradic;) space in addition to the input string and the suffix array. We also present variants of the algorithm for several parallel and hierarchical memory models of computation. The algorithms for BSP and EREW-PRAM models are asymptotically faster than all previous suffix tree or array construction algorithms.
EXPINT---A MATLAB package for exponential integrators
Authors: Håvard Berland, Bård Skaflestad, Will M. Wright
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

Recently, a great deal of attention has been focused on the construction of exponential integrators for semilinear problems. In this article we describe a MATLAB1 package which aims to facilitate the quick deployment and testing of exponential integrators, of Runge--Kutta, multistep, and general linear type. A large number of integrators are included in this package along with several well-known examples. The so-called &phiv; functions and their evaluation is crucial for accuracy, stability, and efficiency of exponential integrators, and the approach taken here is through a modification of the scaling and squaring technique, the most common approach used for computing the matrix exponential.
Build Your Own Standards Compliant Website Using Dreamweaver 8 (Build Your Own)
Authors: Rachel Andrew
Venue:  (2005)

Build Your Own Standards Compliant Website with Dreamweaver 8 is written for any user of Dreamweaver who wants to create standards compliant, usable and fully accessible websites. By applying Web Standards and best-practices, readers will learn to create fast-loading, easy-to-maintain and cross-browser compatible Websites. This book focuses on using XHTML & semantic markup, CSS Layouts, and accessibility guidelines to show users how to make the most of Dreamweaver 8.
ActionScript 2.0 Language Reference for Macromedia Flash 8
Authors: Francis Cheng, Jen deHaan, Robert L. Dixon, Shimul Rahim
Venue:  (2005)

The ActionScript 2.0 Language Reference for Macromedia Flash 8 is a comprehensive reference manual that describes the application programming interface (API) for Macromedia Flash Player, the most pervasive client runtime environment in the world. It includes valuable syntax and usage information; detailed descriptions of classes, functions, properties, and events; and copy-and-paste code samples for every element in the ActionScript language. The ActionScript 2.0 Language Reference for Macromedia Flash 8 will help you: ·ï¾ ï¾ ï¾ Learn how to use specific APIs efficiently and effectively ·ï¾ ï¾ ï¾ Understand the range and variety of functionality ActionScript offers ·ï¾ ï¾ ï¾ Repurpose Macromedia-tested code in your own applications Powerful development and design tools require thorough and authoritative technical advice and documentation. When it comes to Macromedia Flash, no one is more authoritative than Macromedia Development and writing teams. Now their official documentation is available to you in printed book form. As you work, keep this guide by your side for ready access to valuable information on using Flash. We've designed it so that it's easy to annotate as you progress.
An Identity-Based Key Management Framework for Personal Networks
Authors: Khaled Masmoudi, Hossam Afifi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

Personal Networks and PN federations are new networking paradigms that merge concepts from ad hoc, P2P and wireless networks, built around user's needs. Even though they are a promise of a practical achievement of ubiquitous computing, managing security associations in these frameworks proves to be a challenge. We present in this paper a security architecture, including a uniform personal namespace using crypto-based identifiers and a key management scheme based on identity-based cryptography. We also provide an evaluation of our scheme, in terms of computation complexity, communication cost and security.
Data Communications and Network Security, 1 edition
Authors: Houston H. Carr, Charles Snyder
Venue:  (2006)

Written for students and managers who do not have a technical background, Data Communications and Network Security comprehensively introduces students to the technology and management of data communications. This includes both wired and wireless technology as well as comprehensive coverage of network security, helping both the organization and the individual create and maintain a data-safe environment. The book's unique organization allows the material to be presented in a variety of ways, making the book a strong match to any teaching approach.Table of contentsPart I: The Basics of Communications1. Basics of Communications Technology2. Media and Their Applications3. Architecture, Models, and StandardsPart II: Network Basics4. Building a Network: Topology and Protocols5. Network Form and FunctionPart III: Wide-Area Networks: The Internet6. From LANs to WANs: Broadband Technology7. The Internet, Intranets, and Extranets8. Internet ApplicationsPart IV: Wireless Networks9. Wireless Networks: The Basics10. Wireless Networks: Issues and ManagementPart V: Security11. Network Security12. Wireless Network SecurityPart VI: Network Management and Control13. Monitoring and Control of Network Activity14. Network and Project ManagementAppendix A: Analog Voice CapabilitiesAppendix B: Epilogue: Emerging Technologies, Innovation, and Risks
METRIC: Memory tracing via dynamic binary rewriting to identify cache inefficiencies
Authors: Jaydeep Marathe, Frank Mueller, Tushar Mohan, Sally A. Mckee, Bronis R. De Supinski, Andy Yoo
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

With the diverging improvements in CPU speeds and memory access latencies, detecting and removing memory access bottlenecks becomes increasingly important. In this work we present METRIC, a software framework for isolating and understanding such bottlenecks using partial access traces. METRIC extracts access traces from executing programs without special compiler or linker support. We make four primary contributions. First, we present a framework for extracting partial access traces based on dynamic binary rewriting of the executing application. Second, we introduce a novel algorithm for compressing these traces. The algorithm generates constant space representations for regular accesses occurring in nested loop structures. Third, we use these traces for offline incremental memory hierarchy simulation. We extract symbolic information from the application executable and use this to generate detailed source-code correlated statistics including per-reference metrics, cache evictor information, and stream metrics. Finally, we demonstrate how this information can be used to isolate and understand memory access inefficiencies. This illustrates a potential advantage of METRIC over compile-time analysis for sample codes, particularly when interprocedural analysis is required.
Provision of agent-based health care services
Authors: Antonio Moreno, David Isern, David Sánchez
Venue: AI Communications (2003)

In the last years there has been a growing interest worldwide in the application of agent technology for providing dynamic, flexible, and compound services. In this paper we report the design and implementation of a multi-agent system that provides health care-related services to the citizens and visitors of a city. The agents of the system allow the user to access his/her medical record, to find out information about the medical centres of the city, and to make a booking to be visited by a particular kind of doctor. Doctors may access and update the medical record of the patient during a visit, and they may also request the performance of clinical tests on the patient. The results of the tests are automatically stored in the patient's medical record, so that they can be accessed by the doctor in the next visit. Two key issues in the design and implementation of the system are discussed: the definition of a basic medical ontology and the implementation of security measures that preserve the confidentiality of sensitive medical information.
Finite horizon analysis of Markov Chains with the Mur&#x03d5; verifier
Authors: Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

In this paper we present an explicit disk-based verification algorithm for Probabilistic Systems defining discrete time/finite state Markov Chains. Given a Markov Chain and an integer k (horizon), our algorithm checks whether the probability of reaching an error state in at most k steps is below a given threshold. We present an implementation of our algorithm within a suitable extension of the Mur&#x03d5; verifier. We call the resulting probabilistic model checker FHP-Mur&#x03d5; (Finite Horizon ProbabilisticMur&#x03d5;). We present experimental results comparing FHP-Mur&#x03d5; with (a finite horizon subset of) PRISM, a state-of-the-art symbolic model checker for Markov Chains. Our experimental results show that FHP-Mur&#x03d5; can handle systems that are out of reach for PRISM, namely those involving arithmetic operations on the state variables (e.g. hybrid systems).
Sequence-driven features for prediction of subcellular localization of proteins
Authors: Jong Kyoung Kim, Sung-Yang Bang, Seungjin Choi
Venue: Pattern Recognition (2006)

Prediction of the cellular location of a protein plays an important role in inferring the function of the protein. Feature extraction is a critical part in prediction systems, requiring raw sequence data to be transformed into appropriate numerical feature vectors while minimizing information loss. In this paper, we present a method for extracting useful features from protein sequence data. The method employs local and global pairwise sequence alignment scores as well as composition-based features. Five different features are used for training support vector machines (SVMs) separately and a weighted majority voting makes a final decision. The overall prediction accuracy evaluated by the 5-fold cross-validation reached 88.53% for the eukaryotic animal data set. Comparing the prediction accuracy of various feature extraction methods, provides a biological insight into the location of targeting information. Our experimental results confirm that our feature extraction methods are very useful for predicting subcellular localization of proteins.