ppxscal/embedding_network huggingface dataset:
Algebra and Analysis for Engineers and Scientists, 1 edition
Authors: Anthony N. Michel, Charles J. Herget
Venue:  (2007)

"This is an intermediate level text, with exercises, whose avowed purpose is to provide the science and engineering graduate student with an appropriate modern mathematical (analysis and algebra) background in a succinct, but nontrivial, manner.... [T]he book is quite thorough and can serve as a text, for self-study, or as a reference." Mathematical Reviews Written for graduate and advanced undergraduate students in engineering and science, this classic book focuses primarily on set theory, algebra, and analysis. Useful as a course textbook, for self-study, or as a reference, the work is intended to: * provide readers with appropriate mathematical background for graduate study in engineering or science; * allow students in engineering or science to become familiar with a great deal of pertinent mathematics in a rapid and efficient manner without sacrificing rigor; * give readers a unified overview of applicable mathematics, enabling them to choose additional, advanced topical courses in mathematics more intelligently. Whereas these objectives for writing this book were certainly pertinent over twenty years ago when the work was first published, they are even more compelling now. Todays graduate students in engineering or science are expected to be more knowledgeable and sophisticated in mathematics than students in the past. Moreover, todays graduate students in engineering or science are expected to be familiar with a great deal of ancillary material (primarily in the computer science area), acquired in courses that did not even exist a couple of decades ago. The book is divided into three parts: set theory (Chapter 1), algebra (Chapters 24), and analysis (Chapters 57). The first two chapters deal with the fundamental concepts of sets, functions, relations and equivalence relations, and algebraic structures. Chapters 3 and 4 cover vector spaces and linear transformations, and finite-dimensional vector spaces and matrices. The last three chapters investigate metric spaces, normed and inner product spaces, and linear operators. Because of its flexible structure, Algebra and Analysis for Engineers and Scientists may be used either in a one- or two-semester course by deleting appropriate sections, taking into account the students backgrounds and interests. A generous number of exercises have been integrated into the text, and a section of references and notes is provided at the end of each chapter. Applications of algebra and analysis having a broad appeal are also featured, including topics dealing with ordinary differential equations, integral equations, applications of the contraction mapping principle, minimization of functionals, an example from optimal control, and estimation of random variables. Supplementary material for students and instructors is available at http://Michel.Herget.net.
Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence
Venue: Conference on Hypertext and Hypermedia (2008)

Welcome to the first Hypertext Web Science Workshop (HT WebScience 2008). At last year's Hypertext Conference there was a Birds of a Feather meeting to discuss the new discipline of Web Science, proposed by Tim Berners-Lee, Wendy Hall, Nigel Shadbolt and Danny Weitzner (among others). They have suggested that we need a new academic and research discipline to understand the Web and its impact on the way people think, behave and interact. Web Science is about understanding how technical innovation changes practice, and how behavior in the small translates to behavior in the large. Web Science is of great potential interest to those people in the Hypertext Community, as our work has always been about the coming together of people and technology; last year's lively discussion has spawned this year's workshop, with the goal of creating a venue within the Hypertext conference in which we can help to explore, define and shape the new Web Science discipline. We hoped to attract not only people with a technical expertise, but also those who study the human aspects of Web phenomena, such as on-line communities, and the impact of these technologies on society. We chose to focus on collaborative systems and emerging structure, as these are core areas for existing hypertext research, and we have accepted 10 papers from a wide variety of different institutions and countries.
Simulation models for photogate active pixel sensor
Authors: B. Casadei, C. Dufaza, L. Martin
Venue: Proceedings of the 9th International Conference on Circuits (2005)

The constant reduction in the transistors sizes for the design and the integration of smart sensors on chip requires accurate simulations of electrical characteristics. To this end, new simulation models of photogate active pixel sensor for CMOS imagers are proposed. A preliminary study describes the existing simulation techniques and shows their inaccuracy. Also, from the analysis of the charges transfer and of the photons carriers generation mechanisms in a photogate, two new simulation models are proposed, namely a functional model and a theoretical one. These models, described in Verilog-A language in the CADENCE environment design tool, offer a compromise between precise calculation and simulation time.
Global ultrasonic system with selective activation for autonomous navigation of an indoor mobile robot
Authors: Soo-yeong Yi
Venue: Robotica (2008)

This paper presents a global ultrasonic system with selective activation algorithm for autonomous navigation of an indoor mobile robot. The global ultrasonic system consists of several ultrasonic transmitters fixed at reference positions in global coordinates and two receivers at moving coordinates of a mobile robot. By activating the ultrasonic transmitters through an radiofrequency (RF) channel, the robot is able to obtain distance information to the reference positions and localize itself in the global coordinates. Due to limitations in signal strength and beam width, the ultrasonic signals from some transmitters may not be delivered to the robot and the ultrasonic data become invalid. In order to improve the effectiveness of the global ultrasonic system, a so-called selective activation algorithm is developed. Based on the current position of the robot, the selective activation calls a proper ultrasonic transmitter and generates valid ultrasonic data at every sampling instant, resulting in faster, more accurate response for self-localization than does simple sequential activation. Path-following control experiments are conducted to verify the effectiveness of the self-localization based on the proposed selective activation algorithm with the global ultrasonic system.
SAP Solution Manager, 1 edition
Authors: Marc O. Schafer, Matthias Melich
Venue:  (2007)

This unique book helps administrators and IT managers to quickly understand the full functionality of SAP Solution Manager, release 4.0. Readers get expert advice and detailed guidance on Implementation, Operations, Service Desk, Change Request Management, and the brand new function Diagnostics (root cause analysis). Step-by-step instruction is further enhanced using extensively commented configuration examples. In addition, the integration capabilities with third-party tools from the Help Desk and Modeling areas are also covered in detail. The book is based on the latest information derived from release 4.0 Ramp-Up experiences.
Neural modeling of flow rendering effectiveness
Authors: Daniel Pineo, Colin Ware
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

It has been previously proposed that understanding the mechanisms of contour perception can provide a theory for why some flow rendering methods allow for better judgments of advection pathways than others. In the present paper we develop this theory through a numerical model of the primary visual cortex of the brain (Visual Area 1) where contour enhancement is understood to occur according to most neurological theories. We apply a two-stage model of contour perception to various visual representations of flow fields evaluated by Laidlaw et al [2001]. In the first stage, contour enhancement is modeled based on Li's [1998] cortical model. In the second stage, a model of contour integration is proposed designed to support the task of advection path tracing. The model yields insights into the relative strengths of different flow visualization methods for the task of visualizing advection pathways.
Evaluation of Hematocrit Measurement Using Spectral Domain Optical Coherence Tomography
Authors: Xiangqun Xu, Zhongping Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Optical coherence tomography (OCT) has the potential to be a noninvasive method for hematocrit (HCT) measurement. This paper studied the effect of erythrocyte aggregation on hematocrit measurement based on monitoring the slope changes in OCT depth reflectivity profile using spectral domain optical coherence tomography (SDOCT). Our measurement indicates that the HCT estimated by SDOCT depends on erythrocyte aggregation state. Measured hematocrit in the blood samples with 2% Dextran500 is underestimated by 17.1-19.5% for HCT from 35-55% at a flow rate of 4.7 mm/s. The results indicate erythrocyte aggregation is an important factor that will affect accurate hematocrit measurement using SDOCT. Developing methods of simultaneous measurements of RBC aggregation and hematocrit is essential for accurate determination of HCT.
A distributed protocol for safe real-time planning of communicating vehicles with second-order dynamics
Authors: Kostas E. Bekris, Konstantinos I. Tsianos, Lydia E. Kavraki
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This work deals with the problem of planning in real-time, collision-free motions for multiple communicating vehicles that operate in the same, partially-observable environment. A challenging aspect of this problem is how to utilize communication so that vehicles do not reach states from which collisions cannot be avoided due to second-order motion constraints. This paper provides a distributed communication protocol for realtime planning that guarantees collision avoidance with obstacles and between vehicles. It can also allow the retainment of a communication network when the vehicles operate as a networked team. The algorithm is a novel integration of sampling-based motion planners with message-passing protocols for distributed constraint optimization. Each vehicle uses the motion planner to generate candidate feasible trajectories and the message-passing protocol for selecting a safe and compatible trajectory. The existence of such trajectories is guaranteed by the overall approach. Experiments on a distributed simulator built on a cluster of processors confirm the safety properties of the approach in applications such as coordinated exploration. Furthermore, the distributed protocol has better scalability properties when compared against typical priority-based schemes.
Virtual trip lines for distributed privacy-preserving traffic monitoring
Authors: Baik Hoh, Marco Gruteser, Ryan Herring, Jeff Ban, Daniel Work, Juan-Carlos Herrera, Alexandre M. Bayen, Murali Annavaram, Quinn Jacobson
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Automotive traffic monitoring using probe vehicles with Global Positioning System receivers promises significant improvements in cost, coverage, and accuracy. Current approaches, however, raise privacy concerns because they require participants to reveal their positions to an external traffic monitoring server. To address this challenge, we propose a system based on virtual trip lines and an associated cloaking technique. Virtual trip lines are geographic markers that indicate where vehicles should provide location updates. These markers can be placed to avoid particularly privacy sensitive locations. They also allow aggregating and cloaking several location updates based on trip line identifiers, without knowing the actual geographic locations of these trip lines. Thus they facilitate the design of a distributed architecture, where no single entity has a complete knowledge of probe identities and fine-grained location information. We have implemented the system with GPS smartphone clients and conducted a controlled experiment with 20 phone-equipped drivers circling a highway segment. Results show that even with this low number of probe vehicles, travel time estimates can be provided with less than 15% error, and applying the cloaking techniques reduces travel time estimation accuracy by less than 5% compared to a standard periodic sampling approach.
Dynamic virtual ground voltage estimation for power gating
Authors: Hao Xu, Ranga Vemuri, Wen-Ben Jone
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

With the technology moving into the deep sub-100nm region, the increase of leakage power consumption necessitates more aggressive power reduction techniques. Power gating is a promising technique. Our research emphasizes the virtual ground voltage (VVG) as the key to make critical design trade-offs for power gating. We develop an accurate model to estimate the dynamic VVG value of a circuit block as a function of time after its ground is gated. Experimental results show that the model has less than 1% average error compared with HSPICE results. The CAD tool implemented based on the model has a 100 times speedup over HSPICE.
Mobile IPv6 with Linux
Authors: Salah M. S. Al-Buraiky
Venue: Linux Journal (2008)

An MIPv6 primer.
Wrong Assumptions and Neglected Areas in Real-Time Systems
Authors: E. Douglas Jensen
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The real-time computing community uses the terms “predictability” and “determinism” - usually referring to timeliness - without defining them, orincorrectly as synonyms. That results in confusion, errors, and neglect of important mainstream real-time systems, especially dynamic distributed ones.
General weak random sources
Authors: D. Zuckerman
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from such a source is exhibited. Under the generalized Paley graph conjecture, a generator that runs in polynomial time and simulates RP is given, as well as a different generator that produces almost perfectly random bits at a rate arbitrarily close to optimal using as seeds strings from a constant number of independent weak random sources.
FEM for elliptic eigenvalue problems: how coarse can the coarsest mesh be chosen? An experimental study
Authors: L. Banjai, S. B&#x00f6;rm, S. Sauter
Venue: Computing and Visualization in Science (2008)

In this paper, we consider the numerical discretization of elliptic eigenvalue problems by Finite Element Methods and its solution by a multigrid method. From the general theory of finite element and multigrid methods, it is well known that the asymptotic convergence rates become visible only if the mesh width h is sufficiently small, h&#x00a0;&#x2264;&#x00a0;h 0. We investigate the dependence of the maximal mesh width h 0 on various problem parameters such as the size of the eigenvalue and its isolation distance. In a recent paper (Sauter in Finite elements for elliptic eigenvalue problems in the preasymptotic regime. Technical Report. Math. Inst., Univ. Z&#x00fc;rich, 2007), the dependence of h 0 on these and other parameters has been investigated theoretically. The main focus of this paper is to perform systematic experimental studies to validate the sharpness of the theoretical estimates and to get more insights in the convergence of the eigenfunctions and -values in the preasymptotic regime.
Hybrid Approach for Spectrum Bidding in Wireless Communications for Maximizing the Profit
Authors: Y. B. Reddy, N. Gajendar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Optimum allocation of spectrum and achieving the best revenue is highly desirable for electronic market places. Currently static allocation of spectrum is underutilized. The majority of the researchers are working to achieve optimum allocation and better utilization of the spectrum. Selecting a better part of the spectrum for bidding is equally important part in the market to transfer the information with minimum errors. In this research we used the case-based reasoning (CBR) with automated collaborated filtering (ACF) for selecting the best part of the spectrum with an affordable price and allocate the spectrum through auctions (bidding for spectrum in open market) for better profit. A case-based reasoning algorithm is provided and a mathematical model for ACF is introduced for profit maximization. A genetic algorithm is used for optimum allocation of resource (spectrum).
AVHRR compatible vegetation index derived from MERIS data
Authors: K. P. Günther, S. W. Maier
Venue: International Journal of Remote Sensing (2007)

The Advanced Very High Resolution Radiometer (AVHRR) compatible vegetation index derived from data of the MEdium Resolution Imaging Spectrometer (MERIS) is regarded as a continuity index for the well known Normalized Difference Vegetation Index (NDVI) derived from AVHRR with 300 meter resolution. For deriving the AVHRR compatible vegetation index MERIS full resolution (FR) top of atmosphere radiances (ESA L1b data) are used as input. The design of the "AVHRR compatible NDVI" is based on radiative transfer models for simulating the reflectance of the broad spectral channels of the NOAA-AVHRR and the narrow spectral bands of MERIS. Linear combinations of the MERIS reflectances in the red and near-infrared describe the AVHRR reflectance in channel 1 and 2. The weighting factors for adjusting the reflectances of both sensors are determined from the results of the modelling approach taking into account atmospheric effects by using the Simplified Method for Atmospheric Correction (SMAC), by regarding canopy and soil reflectance and transmission using the Scattering of Arbitrarily Inclined Leaf (SAIL) model and by calculating leaf reflectance and transmittance using the Stochastic model for Leaf Optical Properties Extended for fluorescence (SLOPE). The first validation results show good agreement between the AVHRR NDVI and the "AVHRR compatible NDVI". The mean difference between the two vegetation indices is of the order of 0.025 units. In 2005 the "AVHRR compatible NDVI" will be available for Europe as maximum value composite (daily, 10-days and monthly) on a regular basis from the German Aerospace Centre (DLR).
Updating the principal angle decomposition
Authors: Peter Strobach
Venue: Numerische Mathematik (2008)

A class of fast Householder-based sequential algorithms for updating the Principal Angle Decomposition is introduced. The updated Principal Angle Decomposition is of key importance in the adaptive implementation of several fundamental operations on correlated processes, such as adaptive Wiener filtering, rank-adaptive system identification, and rank and data compression concepts using canonical coordinates. An instructive example of rank-adaptive system identification is examined experimentally.
Grassmann discriminant analysis: a unifying view on subspace-based learning
Authors: Jihun Hamm, Daniel D. Lee
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this paper we propose a discriminant learning framework for problems in which data consist of linear subspaces instead of vectors. By treating subspaces as basic elements, we can make learning algorithms adapt naturally to the problems with linear invariant structures. We propose a unifying view on the subspace-based learning method by formulating the problems on the Grassmann manifold, which is the set of fixed-dimensional linear subspaces of a Euclidean space. Previous methods on the problem typically adopt an inconsistent strategy: feature extraction is performed in the Euclidean space while non-Euclidean distances are used. In our approach, we treat each sub-space as a point in the Grassmann space, and perform feature extraction and classification in the same space. We show feasibility of the approach by using the Grassmann kernel functions such as the Projection kernel and the Binet-Cauchy kernel. Experiments with real image databases show that the proposed method performs well compared with state-of-the-art algorithms.
Iwoz: How I Invented the Personal Computer and Had Fun Along the Way, MP3 Una edition
Authors: Steve Wozniak
Venue:  (2007)

The mastermind behind Apple sheds his low profile and steps forward to tell his story for the first time. From the invention of the first personal computer to the rise of Apple as an industry giant, iWoz presents a no-holds-barred, rollicking, firsthand account of the humanist inventor who ignited the computer revolution.
A Novel Multiple Description Video Codec Based on Slepian-Wolf Coding
Authors: Yuhua Fan, Jia Wang, Jun Sun, Peng Wang, Songyu Yu
Venue: Proceedings of the Data Compression Conference (2008)

Most multiple description video coding (MDVC) schemes use predictive coding for inter-frame compression, suffering from the notorious drift problem, especially at high packet loss rates. In this paper, a novel MDVC scheme without any prediction loops is proposed. The new scheme is based on a code construction for the multiple description problem in the Wyner-Ziv setting [1], which is also presented in the paper. An iterative algorithm is proposed for codebook optimization. A high-rate analysis is given, showing a 3.07dB gap between the performance of the code construction and the theoretical bound. Inter-frame compression is achieved by using distributed video coding approaches instead of prediction loops. Hash check bits are transmitted instead of motion vectors. High robustness is achieved because the drift problem is completely avoided. Experiment results show that our MDVC scheme significantly outperforms the classical scheme proposed in [4] at high packet loss rates.
Kinematic-structural analysis of spatial mechanisms application to the parallel kinematic machines
Authors: E. Ispizua, C. Pinto, D. Del Pozo, M. J. López, O. Altuzarra, A. Hernández
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

A kinematic-structural analysis is considered on a well-known parallel kinematics manipulator: the Tsai manipulator, using procedures useful for other generic parallel manipulators. Firstly the kinematic analysis will be made, obtaining the singular configurations and the blocking positions, key points for the later structural analysis. Then the structural analysis of the mechanism will be made, observing the stiffness that presents for different positions within its workspace, and obtaining graphs that represent the stiffness of the mechanism based on the position.