ppxscal/embedding_network huggingface dataset:
Mac for Linux Geeks, 1 edition
Authors: Tony Steidler-Dennison
Venue:  (2009)

Some might say we all want Linux with an OS X GUI. Mac for Linux Geeks will assist you step by step in migrating from Linuxbased systems to OS X. Dual booting, virtualization, and building out the Linux environment on OS X are discussed in detail, along with a comparative view of wellknown Mac tools and their open source equivalents. Written for daily use, this concise and dependable guide will steer you across the technical landscape from your chosen Linux flavor to the OS X promised land. Live with OS X, but work with Linux tools. Make the OS XLinux hybrid a reality. Use Mac tools where possible and free software where appropriate. What youll learn Dual booting Linux on the Mac Creating a virtual Linux system on the Mac Understanding the OS X GUI Leveraging FOSS tools to meet the traditional Apple strengths of graphics and multimedia Performing routine OS X system administration for Linux administrators Hybridizing the Linux/Mac experience Who is this book for Whether developer, system administrator or hobbyist geek, this book guides all who want to migrate from Linux to OS X, helping to integrate both operating system experiences.
Digital based calibration technique for continuous-time bandpass sigma-delta analog-to-digital converters
Authors: F. Silva-Rivas, C. -Y. Lu, P. Kode, B. K. Thandri, J. Silva-Martinez
Venue: Analog Integrated Circuits and Signal Processing (2009)

In this paper, a calibration technique for Noise Transfer Function (NTF) optimization of Continuous-Time Bandpass Sigma Delta (CT BP ΣΔ) modulators is presented. The proposed technique employs a test tone applied at the input of the quantizer to evaluate the noise transfer function of the Analog-to-Digital Converter (ADC) using the capabilities of the Digital Signal Processing (DSP) platform usually available in mixed-mode systems. Once the ADC output bit stream is captured, necessary information to generate the control signals to tune the ADC parameters for best Signal-to-Quantization Noise Ratio (SQNR) performance is extracted via an LMS software-based algorithm. Simulation results show that notch frequency of the NTF due to process variations and temperature tolerances can be tuned using the proposed methodology. The proposed global calibration approach can be used during the system start-up and the idle system time. The proposed approach uses a single in-band calibration tone, but it can be expanded using out-of band test tones for background calibration schemes.
Validation of an inventory of social connectedness
Authors: Amy L. Gonzales
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Digital technologies are often designed to enhance a sense of social connection between users across physical space. Currently no quantitative scale has been validated to determine how effective a tool is in establishing social connection. This proposal outlines 3 studies designed to rigorously validate a scale of social connection in mediated spaces. To do this, a 24-item scale was developed and tested. In Study 1 the scale was given to 177 people to establish internal and convergent validity. Preliminary analyses suggests good overall internal reliability and convergent validity. Future studies intend to establish predictive validity across systems (Study 2) and within a single system (Study 3). The inventory should prove useful for tests of usability and theory. In the last section I describe its role in my dissertation.
Improving visual search with image segmentation
Authors: Clifton Forlines, Ravin Balakrishnan
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

People's ability to accurately locate target objects in images is severely affected by the prevalence of the sought objects. This negative effect greatly impacts critical real world tasks, such as baggage screening and cell slide pathology, in which target objects are rare. We present three novel image presentation techniques that are designed to improve visual search. Our techniques rely on the images being broken into image segments, which are then recombined or displayed in novel ways. The techniques and their underlying design reasoning are described in detail, and three experiments are presented that provide initial evidence that these techniques lead to better search performance in a simulated cell slide pathology task.
Dynamic Model and Numerical Simulation of Particle Motion in Rotation Flow Field of Centrifuge
Authors: Tong Zhu, Tsutomu Nozaki, Yuanhua Xie, Jin Han, Jing Jiang, Bing Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In this study, in order to determine the size, configuration, rotating speed and other parameters of centrifuge separator, particle motion was simulated by the method of numerical integration of Runge-Kutta. For setting up of dynamic model, besides of forces of gravity, buoyancy, drag force and centrifugal force, the forces of imagination mass force, Basset force, Saffman lift force and pressure gradient force were considered. As the results, it was found that there were some relations among the length of drum, the particle diameter and the revolution of drum. There exist much differences of particle motion between different particles in various sizes. The visualization experiments were carried out to verify the calculated results. The experiment and calculation results were suited well.
Path selection model and algorithm for emergency logistics management
Authors: Yuan Yuan, Dingwei Wang
Venue: Computers and Industrial Engineering (2009)

Path selection is one of the fundamental problems in emergency logistics management. Two mathematical models for path selection in emergency logistics management are presented considering more actual factors in time of disaster. First a single-objective path selection model is presented taking into account that the travel speed on each arc will be affected by disaster extension. The objective of the model is to minimize total travel time along a path. The travel speed on each arc is modeled as a continuous decrease function with respect to time. A modified Dijkstra algorithm is designed to solve the model. Based on the first model, we further consider the chaos, panic and congestions in time of disaster. A multi-objective path selection model is presented to minimize the total travel time along a path and to minimize the path complexity. The complexity of the path is modeled as the total number of arcs included in the path. An ant colony optimization algorithm is proposed to solve the model. Simulation results show the effectiveness and feasibility of the models and algorithms presented in this paper.
Simultaneous control of power/ground current, wakeup time and transistor overhead in power gated circuits
Authors: Yongho Lee, Deog-Kyoon Jeong, Taewhan Kim
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Power gating in circuits is one of the effective technologies to allow low leakage and high performance operations. This work aims to analyze and establish the relations between the three important design parameters in power gated circuits: (i) the maximum current flowing from/to power/ground (ii) the wakeup (sleep to active mode transition) time delay and (iii) the number of sleep transistors. With the understanding of relations between the parameters, we propose solutions to the two problems: (1) finding logic clusters and their wakeup schedule to minimize the sleep transistor overhead under the constraints of wakeup time and peak current and (2) finding logic clusters and their wakeup schedule to minimize the wakeup time under the constraints of peak current and the number of sleep transistors. From an experimentation using ISCAS benchmarks, it is shown that our proposed technique is able to explore the search space, finding solutions with 65% ~ 77% reduced number of sleep transistors and 30% ~ 36% reduced wakeup time delay, compared to the results by the previous work.
A software system for speech therapy and voice quality improvement
Authors: Vania Sivakova, Todorka Terzieva, George Totkov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper discusses software and hardware that enables persons with disabilities to access and use computers. The Bulgarian portal for people with disabilities has been created as leading source of information, communication and repository of assistive tools and technologies. It is presented LOGOPED -- a system for automated development of the intonation, improving speech fluency and perfecting of the communication.
Tailoring click models to user goals
Authors: Fan Guo, Lei Li, Christos Faloutsos
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

Click models provide a principled way of understanding user interaction with web search results in a query session and a statistical tool for leveraging search engine click logs to analyze and improve user experience. An important component in all existing click models is the user behavior assumption -- how users scan, examine and click web documents listed in the result page. Usually the average user behavior pattern is summarized in a small set of global parameters. Can we fit multiple models with different user behavior parameters on a click data set? A previous study showed that the mixture modeling approach did not lead to better performance despite extra computational cost. In this paper, we present how to tailor click models to user goals in web search through query term classification. We demonstrate that better predicative power could be achieved by fitting two click models for navigational queries and informational queries respectively, as evidenced by the likelihood and perplexity evaluation results on a subset of the MSN 2006 RFP data which consists of 121,179 distinct query terms and over 2.8 million query sessions. We also propose search relevance score (SRS) as a flexible evaluation metric of search engine performance. This metric can be derived as summary statistics under any click model, and is applicable to a single query session, a particular query term and the search engine overall.
Data base concepts applied to generalized programming packages
Authors: G. Cort Steinhorst, Barry L. Bateman, Daniel L. Curtis
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Software "packages" are becoming more and more prevalent in both use and availability. These packages provide many useful functions, without the costly, time-consuming development and testing normally required to implement the desired operations. A disadvantage of many packages, however, is the difficulty in modifying them in order to receive the desired result, if the original resultant of the package is not totally satisfactory.
Broadcast filtering: Snoop energy reduction in shared bus-based low-power MPSoCs
Authors: Chun-Mok Chung, Jihong Kim
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

In multiprocessor system-on-a-chips (MPSoCs) that use snoop-based cache coherency protocols, a miss in the data cache triggers the broadcast of coherency request to all the remote caches, to keep all data coherent. However, the majority of these requests are unnecessary because remote caches do not have the matching blocks and so their tag lookups fail. Both the coherency requests and the tag lookups corresponding to a remote miss consume unnecessary energy. We propose an architecture-level technique for snoop energy reduction, called broadcast filtering, which prevents unnecessary coherency requests from being broadcast to remote caches, and thus reduces snoop energy consumption by both the cache and bus. Broadcast filtering is implemented using a snooping cache and a split bus. The snooping cache checks if a block that cannot be obtained locally exists in remote caches before broadcasting a coherency request. If no remote cache has the matching block, there is no broadcast; and if broadcasting is necessary, the split bus allows coherency requests to be broadcast selectively to the remote caches which have matching blocks. Experimental results show a reduction by 90% of cache lookups, by 60% of bus usage, and by 40% of snoop energy consumption, at a small cost in reduced performance. An analysis result based on the energy model shows the broadcast filtering technique can reduce by up to 55% of energy consumption per cache coherency operation.
Original papers: Use of geostatistical and crop growth modelling to assess the variability of greenhouse tomato yield caused by spatial temperature variations
Authors: Carlos Ricardo Bojacá, Rodrigo Gil, Alexander Cooman
Venue: Computers and Electronics in Agriculture (2009)

Users of potential crop growth models have generally assumed homogenous greenhouse climate conditions for simulation purposes. Geostatistics offers the possibility to represent the spatial dependence of climate variables such as temperature distribution in greenhouses. In order to obtain insight in the relevance of temperature distribution on the performance of a crop, geostatistical and crop growth modeling tools were combined in the present work. A plastic greenhouse with the size used in commercial practices, was used to assess temperature distribution by installing a 25-sensor grid, during a 28-day measurement period. Geostatistical analyses were performed on the temperature data, previously divided in five ranges that were established as a function of solar radiation intensity. Estimated semivariograms were fitted to theoretical spherical model for posterior estimation at unsampled points by ordinary kriging method. Results of this analysis indicated an increasing temperature spatial dependence as global radiation augmented. Crop growth simulations with the Tomgro model applied to the estimated temperature distribution, quantified the faster plant development rates in the central zone of the greenhouse, resulting in plants with one additional truss and a significant higher yield, when compared to plants next to the side walls. The results of this work suggest that the location of the climate sensor station is a sensible factor when using crop simulation models for greenhouse conditions. Final predictions done by crop growth simulation models may be biased and the results cannot be generalized for the entire greenhouse area when microclimate patterns are not considered. Application of geostatistics enabled to assess temperature patterns inside greenhouse and to analyze the relationship with global outside radiation.
Why noise and fluctuations can make life simpler
Authors: Ferdinand Peper
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Noise and Fluctuations are usually considered obstacles in the operation of electronic and mechanical devices, and most strategies to deal with them aim to maximize the Signal/Noise ratio. This presentation gives a short overview of systems that follow a different scenario: such systems exploit noise and fluctuations in order to improve their efficiency of operation. A key element in these systems is the ability of noise and fluctuation to work as a stochastic search process that is able to explore a solution space and settle on a suitable solution. The attraction of this strategy is that it simplifies the mechanisms required to accomplish a task. This presentation reviews an example in computation and speculates about the likely use of this strategy in biological organisms.
Optimization strategies in credit portfolio management
Authors: Benjamin Ivorra, Bijan Mohammadi, Angel Manuel Ramos
Venue: Journal of Global Optimization (2009)

This paper focuses on the application of an original global optimization algorithm, based on the hybridization between a genetic algorithm and a semi-deterministic algorithm, for the resolution of various constrained optimization problems for realistic credit portfolios. Results are analyzed from a financial point of view in order to confirm their relevance.
Deterministic analog circuit placement using hierarchically bounded enumeration and enhanced shape functions
Authors: Martin Strasser, Michael Eick, Helmut Gräb, Ulf Schlichtmann, Frank M. Johannes
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The analog placement algorithm Plantage, presented in this paper, generates placements for analog circuits with comprehensive placement constraints. Plantage is based on a hierarchically bounded enumeration of basic building blocks, using B*-trees. The practically relevant solution space is thereby enumerated quasi-complete. The sets of possible placements of the basic building blocks are represented and combined in a new efficient way, using enhanced shape functions. The result of Plantage is the Pareto front of placements with respect to different aspect ratios. The whole approach is deterministic, in contrast to existing analog placement algorithms.
Accessibility of Unsupervised Biometric Systems
Authors: John Gill
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

Although biometric systems have been in use for many years, it is only now that they are being introduced for use by the general pubic. The general public includes children, older people, people with disabilities as well as those not familiar with the local language. Some people will be first time users but many are likely to be occasional users. Therefore it is important that unsupervised systems can be used easily by such users. 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
Web 3.0 Emerging
Authors: Jim Hendler
Venue: Computer (2009)

While Web 3.0 technologies are difficult to define precisely, the outline of emerging applications has become clear over the past year.
Hybrid signal processing and machine intelligence techniques for detection, quantification and classification of power quality disturbances
Authors: B. K. Panigrahi, P. K. Dash, J. B. V. Reddy
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper presents an advanced signal processing technique known as S-transform (ST) to detect and quantify various power quality (PQ) disturbances. ST is also utilized to extract some useful features of the disturbance signal. The excellent time-frequency resolution characteristic of the ST makes it an attractive candidate for analysis of power system disturbance signals. The number of features required in the proposed approach is less than that of the wavelet transform (WT) for identification of PQ disturbances. The features extracted by using ST are used to train a support vector machine (SVM) classifier for automatic classification of the PQ disturbances. Since the proposed methodology can reduce the features of disturbance signal to a great extent without losing its original property, it efficiently utilizes the memory space and computation time of the processor. Eleven types of PQ disturbances are considered for the classification purpose. The simulation results show that the combination of ST and SVM can effectively detect and classify different PQ disturbances.
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Authors: Andrew Brzezinski, Gil Zussman, Eytan Modiano
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multi-radio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly. These topologies are used in order to develop a number of centralized channel assignment algorithms that are based on a matroid intersection algorithm. These algorithms pre-partition a network in a manner that not only expands the capacity regions of the subnetworks but also allows distributed algorithms to achieve these capacity regions. We evaluate the performance of the algorithms via simulation and show that they significantly increase the distributedly achievable capacity region. We note that while the identified topologies are of general interference graphs, the partitioning algorithms are designed for networks with primary interference constraints.
Enhancing the serviceability of IMS-based multimedia services: preventing core service failures
Authors: M. Boucadair, P. Morand, I. Borges, M. Tomsu
Venue: International Journal of Internet Protocol Technology (2008)

The delivery of highly available and robust service offerings is a critical objective for Service Providers. Despite current deployment of IMS-based architectures assumes a vertical integration, IMS-based services can be offered without having a control on the underlying IP network. This paper introduces a solution to enhance the robustness of IMS-based architectures without assuming a vertically integrated system. The paper focuses on failures experienced by core service nodes and describes an autonomic solution to allow customers access to the service during failures.
Coupling of large scale groundwater models
Authors: Bernhard Becker, Christoph Homann, J&#x00fc;rgen K&#x00f6;ngeter
Venue: Computing and Visualization in Science (2009)

This article describes the idea of coupling three site-specific large scale finite element groundwater models. Each independent groundwater model represents one geological unit containing adjacent boundaries. In order to preserve consistency of the simulation results, the exchange rates at the shared borders used to be calculated independently, set up as boundary condition for the adjacent model unit and adjusted in an iterative process. To overcome this time- consuming procedure of generating consistent boundary condition values for the exchange rates, the adjacent boundary nodes of the three models are linked to form a unified model. As a first result it is shown, how the quality of simulation results in the vicinity of shared boundaries increase by the proposed solution.