ppxscal/embedding_network huggingface dataset:
Intelligent Elevator Control by Application of Computer Vision
Authors: Vagram Vareljian, Ju Jia Zou
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

An age that bears witness to a proliferation of relentlessly higher buildings denotes a necessity for more efficient elevator services. This paper presents a scheme that improves elevator efficiency and passenger comfort by reducing waiting and travel times. The proposed system utilises a background subtraction process to estimate the extent of crowding inside the elevator car, allowing a full elevator to bypass hall calls. Furthermore, using a similar detection technique, the system is capable of estimating the number of patrons waiting on every elevator floor. This information can be relayed to an elevator controller, improving traffic flow by setting higher priorities for busy floors.
MCITP Self-Paced Training Kit: Designing and Developing a Business Intelligence Infrastructure by Using Microsoft SQL Server(TM) 2005, 1st edition
Authors: Paul Turley, Dan Wood, Sara Morgan
Venue: Mcitp Self Paced Training Kit (2007)

Announcing an all-new Self-Paced Training Kit designed to help maximize your performance on 70-446, one of the required exams for the new Microsoft Certified IT Professional (MCITP): Business Intelligence Developer certification. This 2-in-1 kit includes the official Microsoft study guide, plus practice tests on CD to help you assess your skills. It comes packed with the tools and features exam candidates want most including in-depth, self-paced training based on final exam content; rigorous, objective-by-objective review; exam tips from expert, exam-certified authors; and customizable testing options. It also provides real-world scenarios, case study examples, and troubleshooting labs for skills and expertise that you can apply to the job.Work at your own pace through the lessons and lab exercises. Focusing on the job role of designing and developing business intelligence solutions for the enterprise, this official study guide covers topics such as designing BI and data mining solutions using SQL Server Analysis Services, SQL Server Reporting Services, and SQL Server Integration Services.Then assess yourself using 200+ practice questions on the CD, featuring multiple, customizable testing options to meet your specific needs. Choose timed or untimed testing mode, generate random tests, or focus on discrete objectives or chapters. You get detailed explanations for right and wrong answers including pointers back to the book for further study. You also get an evaluation version of SQL Server 2005 Enterprise Edition software and an exam discount voucher making this kit an exceptional value and a great career investment.
LEGO Mindstorms NXT Power Programming: Robotics in C
Authors: John C. Hansen
Venue:  (2007)

NXT Power Programming delivers everything you need to create the robot you've always dreamed about. This is the definitive guide to C programming by the developer of some of the most powerful and popular development tools for LEGO MINDSTORMS. John C. Hansen presents a comprehensive yet friendly set of tools that allow you to create almost any robot you can imagine. Inside, you'll find an ingenious set of projects that explore the complete arsenal of NXT functionality. At the heart of these projects is Versa, a versatile mobile robot platform utilizing modular attachments.Master the Art of:NXC, a C language for the NXT BricxCC, a full featured programming environment Sensors and Motors Utilities for Music, Sound Sampling, Graphics and more NBC, an Assembler Language for the NXT Building Robots without Bricks Handheld Arcade Games on the NXT An Intruder System using a Sphere Cannon NXT to NXT Bluetooth communications NXT to Bluetooth devices The latest sensors from HiTechnic and mindsensors.com 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
Geocomputation and Urban Planning, 1st edition
Authors: Beniamino Murgante, Beniamino Murgante, Giuseppe Borruso, Alessandra Lapucci
Venue: Studies In Computational Intelligence (2009)

Sixteen years ago, Franklin estimated that about 80% of data contain geo-referenced information. To date, the availability of geographic data and information is growing, together with the capacity of users to operate with IT tools and instruments. Spatial data infrastructures are growing and allow a wide number of users to rely on them. This growth has not been fully coupled to an increase of knowledge to support spatial decisions. Spatial analytical techniques, geographical analysis and modelling methods are therefore required to analyse data and to facilitate the decision process at all levels. Old geographical issues can find an answer thanks to new methods and instruments, while new issues are developing, challenging researchers towards new solutions. This volume aims to contribute to the development of new techniques and methods to improve the process of knowledge acquisition. The Geocomputational expression is related to the development and the application of new theories, methods and tools in order to provide better solutions to complex geographical problems. The geocomputational analysis discussed in this volume, could be classified according to three main domains of applications; the first one related to spatial decision support system and to spatial uncertainty, the second connected to artificial intelligence, the third based on all spatial statistics techniques.
Compositionality in deterministic real-time embedded systems
Authors: Thomas A. Henzinger
Venue:  (2008)

Many computing applications, especially those in safety critical embedded systems, require highly predictable timing properties. However, time is often not present in the prevailing computing and networking abstractions. In fact, most advances in computer architecture, software, and networking favor average-case performance over timing predictability. This thesis studies several methods for the design of concurrent and/or distributed embedded systems with precise timing guarantees. The focus is on flexible and compositional methods for programming and verification of the timing properties. The presented methods together with related formalisms cover two levels of design: (1) Programming language/model level. We propose the distributed variant of Giotto, a coordination programming language with an explicit temporal semantics&mdash;the logical execution time (LET) semantics. The LET of a task is an interval of time that specifies the time instants at which task inputs and outputs become available (task release and termination instants). The LET of a task is always non-zero. This allows us to communicate values across the network without changing the timing information of the task, and without introducing nondeterminism. We show how this methodology supports distributed code generation for distributed real-time systems. The method gives up some performance in favor of composability and predictability. We characterize the tradeoff by comparing the LET semantics with the semantics used in Simulink. (2) Abstract task graph level. We study interface-based design and verification of applications represented with task graphs. We consider task sequence graphs with general event models, and cyclic graphs with periodic event models with jitter and phase. Here an interface of a component exposes time and resource constraints of the component. Together with interfaces we formally define interface composition operations and the refinement relation. For efficient and flexible composability checking two properties are important: incremental design and independent refinement. According to the incremental design property the composition of interfaces can be performed in any order, even if interfaces for some components are not known. The refinement relation is defined such that in a design we can always substitute a refined interface for an abstract one. We show that the framework supports independent refinement, i.e., the refinement relation is preserved under composition operations.
Augmenting the generalized hough transform to enable the mining of petroglyphs
Authors: Qiang Zhu, Xiaoyue Wang, Eamonn Keogh, Sang-Hee Lee
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Rock art is an archaeological term for human-made markings on stone. It is believed that there are millions of petroglyphs in North America alone, and the study of this valued cultural resource has implications even beyond anthropology and history. Surprisingly, although image processing, information retrieval and data mining have had large impacts on many human endeavors, they have had essentially zero impact on the study of rock art. In this work we identify the reasons for this, and introduce a novel distance measure and algorithms which allow efficient and effective data mining of large collections of rock art.
Making cluster applications energy-aware
Authors: Nedeljko Vasić, Martin Barisits, Vincent Salzgeber, Dejan Kostic
Venue: Proceedings of the 1st workshop on Automated control for datacenters and clouds (2009)

Power consumption has become a critical issue in large scale clusters. Existing solutions for addressing the servers' energy consumption suggest "shrinking" the set of active machines, at least until the more power-proportional hardware devices become available. This paper demonstrates that leveraging the sleeping state, however, may lead to unacceptably poor performance and low data availability if the distributed services are not aware of the power management's actions. Therefore, we present an architecture for cluster services in which the deployed services overcome this problem by actively participating in any action taken by the power management. We propose, implement, and evaluate modifications for the Hadoop Distributed File System and the MapReduce clone that make them capable of operating efficiently under limited power budgets.
Essential JavaFX, 1st edition
Authors: Gail Anderson, Paul Anderson
Venue:  (2009)

A complete introduction for beginners to Sun's powerful JavaFX scripting language JavaFX is a scripting language which provides built-in properties for manipulating objects within a 2D coordinate system. A competing technology to Microsoft's Silverlight, JavaFX provides the tools to fill and pen stroke colors, and create special effects, shapes and lines. It also manipulates images and play videos and sound and defines animations that affect objects over time. This complete introduction for any level doesn't bury you with details. It starts quickly with an introduction to the power of JavaFX key features--scene node graphs, nodes as components, the coordinate system, layout options, colors and gradients, custom classes with inheritance, animation, binding, and event handlers. It then shows step-by-step how these features could be used in a real JavaFX application and will help an application look professionally designed. Commissioned by JavaFX product team and reviewed by renowned Java author, Brian Goetz, this guide is intended as the first and most accessible book for people new to JavaFX. The Andersons are working directly with the JavaFX team at Sun for a complete and authoritative guide Gets you started on building rich Web apps quickly without having to sort through unnecessary details or search the Web for answers Focuses on most useful features and shows how to build apps that tap the full potential of JavaFX
On an infinite family of graphs with information ratio 2 &#x2212; 1/k
Authors: L&#x00e1;szl&#x00f3; Csirmaz, P&#x00e9;ter Ligeti
Venue: Computing (2009)

In this paper we consider the secret sharing problem on special access structures with minimal qualified subsets of size two, i.e. secret sharing on graphs. This means that the participants are the vertices of the graph and the qualified subsets are the subsets of V(G) spanning at least one edge. The information ratio of a graph G is denoted by R(G) and is defined as the ratio of the greatest size of the shares a vertex has to remember and of the size of the secret. Since the determination of the exact information ratio is a non-trivial problem even for small graphs (i.e. for V(G)&#x00a0;=&#x00a0;6), every construction can be of particular interest. Let k be the maximal degree in G. In this paper we prove that R(G)&#x00a0;=&#x00a0;2 &#x2212; 1/k for every graph G with the following properties: (A) every vertex has at most one neighbour of degree one; (B) vertices of degree at least 3 are not connected by an edge; (C) the girth of the graph is at least 6. We prove this by using polyhedral combinatorics arguments and the entropy method.
Using sensors and labeled graphs to detect the space confusion's problem of patients suffering from Alzheimer's disease
Authors: Ali Larab, Remi Bastide, Bernard Rigaud
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering in Health Care (2009)

The past few years have witnessed major developments in the field of home care for dependent people or people in loss of autonomy. Our work focuses more specifically on Alzheimer's disease patients. After introducing the problems these patients are confronted with, we propose a tool allowing for the detection of abnormalities in the behavior of the monitored people, as well as the generation and transmission of alarms to a remote monitoring center.
Compiling generics through user-directed type specialization
Authors: Iulian Dragos, Martin Odersky
Venue: Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems (2009)

Compilation of polymorphic code through type erasure gives compact code but performance on primitive types is significantly hurt. Full specialization gives good performance, but at the cost of increased code size and compilation time. Instead we propose a mixed approach, which allows the programmer to decide what code to specialize. Our approach supports separate compilation, allows mixing of specialized and generic code, and gives very good results in practice.
A study on the effects of temperature and loading on the power consumption in energy recovery resonant clocking
Authors: S. E. Esmaeili, A. J. Al-Khalili, G. E. R. Cowan
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

In this paper, an observatory study on the effects of temperature and loading on the power consumption in energy recovery circuits is conducted. Simulation results show that the percentage increase in power in the energy recovery circuit increases as the temperature is increased. In addition, the results illustrate that there is a maximum value for the capacitance at which the optimum amount of charge can be stored and recycled by the inductor in each resonant cycle and that any additional increase in the capacitance value would not add any additional power savings. Simulation results also illustrate the destructive impact of any resistance in the energy recovery path.
Learning-Rate Adjusting Q-Learning for Two-Person Two-Action Symmetric Games
Authors: Koichi Moriyama
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

There are many multiagent Q-learning methods, and most of them aim to converge to a Nash equilibrium that is not desirable in games like the Prisoner's Dilemma (PD). The author proposed the utility-based Q-learning (UB-Q) for PD that used utilities instead of rewards so as to maintain mutual cooperation once it had occurred. However, UB-Q has to know the payoffs of the game to calculate the utilities and works only in PD. Since a Q-learning agent's action depends on the relation of Q-values, the mutual cooperation can also be maintained by adjusting the learning rate. Thus, this paper deals with the learning rate directly and introduces another Q-learning method called the learning-rate adjusting Q-learning (LRA-Q). It calculates the learning rate from received payoffs and works in other kinds of two-person two-action symmetric games as well as PD. Numeric verification showed success of LRA-Q, but, it also revealed a side-effect.
Determination of Cardiac Ejection Fraction by Electrical Impedance Tomography - Numerical Experiments and Viability Analysis
Authors: Franciane C. Peters, Luis Paulo Barra, Rodrigo Weber Santos
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Cardiac ejection fraction is a clinically relevant parameter that is highly correlated to the functional status of the heart. Today the non-invasive methods and technology that measure cardiac ejection fraction, such as MRI, CT and echocardiography do not offer a continuous way of monitoring this important parameter. In this work, we numerically evaluate a new method for the continuous estimation of cardiac ejection fraction based on Electrical Impedance Tomography. The proposed technique assumes the existence of recent Magnetic Resonance (MR) images of the heart to reduce the search space of the inverse problem. Simulations were performed on two-dimensional cardiac MRI images with electric potentials numerically obtained by the solution of the Poisson equation via the Boundary Element Method. Different protocols for current injection were evaluated. Preliminary results are presented and the potentialities and limitations of the proposed technique are discussed. 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
Parallel algorithms for geographic processing
Authors: Keith Clarke
Venue:  (2008)

When geographers and other geo-spatial practitioners are benefiting from the advancements in GIScience and GeoComputation, the gap between the ever-increasing demands and the limited resources of computing power is emerging quickly. High performance computing (HPC), i.e., parallel computing, is needed to handle the massive volume of high-resolution geo-spatial data, and perform increasingly sophisticated and complex Geoprocessing algorithms and models. In this study, a parallel statistical areal interpolation algorithm, which includes two parallel processes, was developed to improve the performance of the computationally intensive FFT-based areal interpolation. A generic parallel Raster Processing programming Library (pRPL) was developed for general geographers to parallelize almost any raster processing algorithms and models with any arbitrary neighborhood configurations. pRPL effectively reduces the development complexity, and efficiently reduces the computing time of computationally intensive algorithms. Finally, the well-known urban land-use simulation Cellular Automata (CA) model, SLEUTH, was parallelized using pRPL. By fully utilizing the advanced features of pRPL, pSLEUTH is able to significantly shorten the computing time for the calibration process.Experiments with real-world datasets suggest: (1) Vector processing can be parallelized using spatial object de-clustering, and cyclic-based mapping schemes deliver better performances than block-based schemes; (2) Regular decomposition methods, i.e., row/column/block-wise decomposition, yield good performance when the workload is rather homogeneous than heterogeneous over the space, and the spatial-adaptive decomposition method, i.e., quad-tree decomposition, deliver the best performance only when the workload is highly clustered over the space; (3) Reducing the decomposition granularity helps improve the performance; (4) data-task-hybrid parallelization delivers better performance than data parallelization when an iterative algorithm is to be parallelized; (5) dynamic tasking yields better performance than static tasking when dealing with a large number of tasks, especially on a parallel computing system where the computing and transfer rates vary among the processors.Furthermore, with the largely improved computing power, the simplifying assumptions that had to be used in sequential computing to make the algorithm computationally feasible on a single-processor computer can be removed, and the findings obtained based on the simplifying assumptions may be altered. Parallelizing Geoprocessing provides geographers a computational test-bed to validate and discover new theories.
The Changing Face of Open Source
Authors: George Lawton
Venue: Computer (2009)

The inability of vendors to make money using pure open source approaches caused many to change their business models. They also now view open source as just one efficient way to develop software, not as a social movement.
The Engineering Design of Systems: Models and Methods, 2nd edition
Authors: Dennis M. Buede
Venue: Wiley Series In Systems Engineering And Management (2009)

The Engineering Design of Systems compiles a wealth of information from diverse sources, providing a unique, one-stop reference of current methods and models for systems engineering. This updated edition features important new information on Systems Modeling Language (SysML), more descriptive material on usage scenarios based on literature from use case development, updated homework assignments, and use of the software product CORE to generate the SysML figures. This book serves as an excellent introductory reference suitable for students and professionals alike.
Analog Integrated Circuits for Communication: Principles, Simulation and Design, 2nd edition
Authors: Donald O. Pederson, Kartikeya Mayaram
Venue:  (2007)

Analog Integrated Circuits for Communication: Principles, Simulation and Design, Second Edition covers the analysis and design of nonlinear analog integrated circuits that form the basis of present-day communication systems. Both bipolar and MOS transistor circuits are analyzed and several numerical examples are used to illustrate the analysis and design techniques developed in this book. Especially unique to this work is the tight coupling between the first-order circuit analysis and circuit simulation results. Extensive use has been made of the public domain circuit simulator Spice, to verify the results of first-order analyses, and for detailed simulations with complex device models. Highlights of the new edition include: A new introductory chapter that provides a brief review of communication systems, transistor models, and distortion generation and simulation. Addition of new material on MOSFET mixers, compression and intercept points, matching networks. Revisions of text and explanations where necessary to reflect the new organization of the book Spice input files for all the circuit examples that are available to the reader from a website. Problem sets at the end of each chapter to reinforce and apply the subject matter. An instructors solutions manual is available on the book's webpage at springer.com. Analog Integrated Circuits for Communication: Principles, Simulation and Design, Second Edition is for readers who have completed an introductory course in analog circuits and are familiar with basic analysis techniques as well as with the operating principles of semiconductor devices. This book also serves as a useful reference for practicing engineers.
Remarks on ubiquitous intelligent supportive spaces
Authors: Peter Mikulecky
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

Ubiquitous computing applications and technologies, frequently studied also under the name ambient intelligence, are more and more matured to be able of creating an environment that is intelligently helpful to users surrounded by such an environment. Besides other helpful application we may consider them also as being very suitable for intelligent workplaces development. In the paper some discussion about basic features of such intelligent workplaces for managers is presented, and a couple of remarks related to possible problems that could arise in such ubiquitous intelligent spaces are presented as well.