ppxscal/embedding_network huggingface dataset:
Determination of green herbage ratio in grasslands using spectral reflectance. Methods and ground measurements
Authors: D. Gianelle, L. Vescovo
Venue: International Journal of Remote Sensing (2007)

In this study, the suitability of spectral vegetation indexes for predicting green ratio (the percentage of green biomass with respect to the total phytomass) has been tested with the Italian Alps and New Zealand South Island grasslands. Considering three different datasets, green ratio (GR) was found to be negatively correlated with visible bands, while it was positively correlated in the NIR region (in total, R>0.80 in the 745-950 nm interval). GR proved to be more predictable than biomass and phytomass, both using hyperspectral single narrow bands and band ratios. Considering three different datasets, GR-index correlations were found to be linear and did not involve saturation problems. Many vegetation indices have been tested; they were well correlated with GR. Green Normalized Difference Vegetation Index (NDVIgreen) was the most stable index, with high values of R2 in all areas, low standard deviation and without significant differences in the slopes and intercepts of the linear correlations of the three datasets.
New bounds on representation errors in signal processing systems
Authors: H. Kirshner, M. Porat
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Most signal processing systems are based on discrete-time signals although the origin of many sources of information is analog. In this work we consider the task of signal representation by a set of basis functions. Presently, without prior knowledge of the signal beyond its samples, no bound on the potential representation error is available. The question raised in this paper is to what extent the sampling process keeps algebraic relations, such as inner product, intact. By interpreting the sampling process as a linear bounded operator, an upper bound on the representation error is derived and demonstrated. Based on our theorems, one can then determine the maximum representation error induced by the sampling process. We further propose a new approximation scheme for the calculation of the inner product, which is optimal in the sense of minimizing the maximum representation error. Our results are applicable to signal processing systems where analog signals are represented by their sampled versions.
Test-Pattern Grading and Pattern Selection for Small-Delay Defects
Authors: Mahmut Yilmaz, Krishnendu Chakrabarty, Mohammad Tehranipoor
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Timing-related defects are becoming increasingly important in nanometer technology designs. Small delay variations induced by crosstalk, process variations, power-supply noise, as well as resistive opens and shorts can potentially cause timing failures in a design, thereby leading to quality and reliability concerns. We present a test-grading technique to leverage the method of output deviations for screening small-delay defects (SDDs). A new gate-delay defect probability measure is defined to model delay variations for nanometer technologies. The proposed technique intelligently selects the best set of patterns for SDD detection from an n-detect pattern set generated using timing-unaware automatic test-pattern generation (ATPG). It offers significantly lower computational complexity and it excites a larger number of long paths compared to previously proposed timing-aware ATPG methods. We show that, for the same pattern count, the selected patterns are more effective than timing-aware ATPG for detecting small delay defects caused by resistive shorts, resistive opens, and process variations.
Cross-company vs. single-company web effort models using the Tukutuku database: An extended study
Authors: Emilia Mendes, Sergio Di Martino, Filomena Ferrucci, Carmine Gravino
Venue: Journal of Systems and Software (2008)

In 2004 [Kitchenham, B.A., Mendes, E., 2004a. Software productivity measurement using multiple size measures. IEEE Transactions on Software Engineering 30 (12), 1023-1035, Kitchenham, B.A., Mendes, E., 2004b. A comparison of cross-company and single-company effort estimation models for web applications. In: Proceedings Evaluation and Assessment in Software Engineering (EASE' 04), pp. 47-55] (S1) investigated, using data on 63 Web projects, to what extent a cross-company cost model could be successfully employed to estimate development effort for single-company Web projects. Their effort models were built using Forward Stepwise Regression (SWR) and they found that cross-company predictions were significantly worse than single-company predictions. This study S1 was extended by Mendes and Kitchenham [Mendes, E., Kitchenham, B.A., 2004. Further comparison of cross-company and within company effort estimation models for web applications. In: Proceedings International Software Metrics Symposium (METRICS'04), Chicago, Illinois, September 11-17th, 2004. IEEE Computer Society, pp. 348-357] (S2), who used SWR and Case-based reasoning (CBR), and data on 67 Web projects from the Tukutuku database. They built two cross-company and one single-company models and found that both SWR cross-company models and CBR cross-company data provided predictions significantly worse than single-company predictions. Since 2004 another 83 projects were volunteered to the Tukutuku database, and recently used by Mendes et al. [Mendes, E., Di Martino, S., Ferrucci, F., Gravino, C., in press. Effort estimation: How valuable is it for a web company to use a cross-company data set, compared to using its own single-company data set? In: Proceedings of International World Wide Web Conference (WWW'07), Banff, Canada, 8-12 May] (S3), who partially replicated Mendes and Kitchenham's study (S2), using SWR and CBR. They corroborated some of S2's findings (SWR cross-company model and the CBR cross-company data provided predictions significantly worse than single-company predictions) however they replicated only part of S2. The objective of this paper (S4) is therefore to extend Mendes et al.'s work and fully replicate S2. We used the same dataset used in S3, and our results corroborated most of those obtained in S2. The main difference between S2 and our study was that one of our SWR cross-company models showed significantly similar predictions to the single-company model, which contradicts the findings from S2.
Grand Designs, Competition 'by Other Means' and New Vistas
Authors: Jonathan Fitchen
Venue: International Review of Law, Computers and Technology (2007)

The development and marketing of computer software by market leaders such as Microsoft has a latent potential to 'lock-out' competitors and thus raises regulatory concerns for antitrust and competition law authorities. Within Europe the announcement of 'Vista' generated complaints from competitors, and other interested parties, to the competition directorate of the European Commission. The complaints alleged that aspects of Vista seemed to be likely to breach Article 82 EC (abuse of a dominant position).
Proceedings of the 7th symposium on Identity and trust on the Internet
Venue: IDtrust; Vol. 283 (2008)

Thank you for participating in the 7th Symposium on Identity and Trust on the Internet (IDtrust 2008). This symposium brings together academia, government, and industry to explore all aspects of identity and trust. Previously known as the PKI R&D Workshop (2002-2007), our new name reflects interest in a broader set of tools and the goal of an identity layer for the Internet. We aim to get practitioners in different sectors together to apply the lessons of real-world deployments to the latest research and ideas on the horizon. In addition to the twelve refereed papers, we facilitate discussions among panels of invited experts and symposium participants. Once again, the symposium was an international event with approximately 150 attendees representing a cross-section of the identity management community, with presenters from the USA, Sweden, Denmark, United Kingdom, Brazil, Finland, Canada, and Australia.
One-dimensional thin-film phonon transport with generation
Authors: A. Bulusu, D. G. Walker
Venue: Microelectronics Journal (2008)

The Boltzmann transport equation is often used for non-continuum transport when the mean free path of phonons is of the order of device sizes. One particular application involves heat generation in electronic devices. In a highly scaled MOSFET, for example, the majority of the heat is produced in a localized region immediately below the gate on the drain side. The size of this generation region is often smaller than the mean free path of phonons, which suggests the generation Knudsen number is large and non-continuum models are appropriate. Using a one-dimensional BTE and diffusion equation, a comparison between the continuum and non-continuum models is made. The focus of this comparative study is the behavior of each model for various Knudsen numbers for the device size and generation region. Results suggest that non-continuum distributions are similar to continuum distributions except at boundaries where the jump condition results in deviations from continuum distributions. Furthermore, the peak energy in a device predicted using the noncontinuum formulation is always less than that of the continuum model regardless of generation Knudsen number, which is in contrast to other prevailing studies.
Hippocampus Shape-Space Analysis of Clinically Depressed, High Risk, and Control Populations
Authors: Youngser Park, Carey E. Priebe, Kelly Botteron, Michael Miller, Nikhil R. Mohan
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

By analyzing interpoint comparisons, we obtain significant results describing the relationship in "hippocampus shape-space" of clinically depressed, high risk, and control populations. In particular, our analysis demonstrates that the high risk population is closer in shape-space to the control population than to the clinically depressed population.
An improved Bayesian network structure learning algorithm and its application in an intelligent B2C portal
Authors: Junzhong Ji, Chunnian Liu, Jing Yan, Ning Zhong
Venue: Web Intelligence and Agent Systems (2007)

Web Intelligence (WI) is a new and active research field in current AI and IT. Intelligent B2C Portals are an important research topic in WI. In this paper, we first investigate and analyze the architecture of a B2C portal for personalized recommendation from the viewpoint of conceptual levels of WI. Aiming at knowledge-level data mining in a B2C portal, we present a new improved learning algorithm of Bayesian Networks, which consists of two major contributions, namely, reducing Conditional Independence (CI) test costs by few lower order CI tests and accelerating search process by means of sort order for candidate parent nodes. Experimental results on benchmark ALARM data sets show that the improved algorithm has high accuracy, and is more efficient in the time performance than other algorithms. Finally, we apply this algorithm to learning Customer Shopping Model (CSM) in an intelligent recommendation system. By a number of experiments on real world data, we find that the recommendation method based on the learned CSM outperforms some traditional ones in rates of coverage and precision.
Analzyes of a MAC protocol for GPRS networks
Authors: Roxana Zoican, Dan Galatchi
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

General Packet Radio Service (GPRS) is seen as one of the key steps to evolving today's GSM network to provide value-added packet-switched data service by sharing the air interface with traditional GSM circuit-switched voice demands. This paper analyzes a Media Access Control (MAC) protocol that supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic. Simulation results show that this protocol is able to support guaranteed QoS (Quality of Service) for streaming, conversational, interactive and background traffic.
Data driven methods for improving mono- and cross-lingual IR performance in noisy environments
Authors: Antti Järvelin, Tuomas Talvensaari, Anni Järvelin
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

In cross-language information retrieval (CLIR), novel or non-standard expressions, technical terminology, or rare proper nouns can be seen as noise when they appear in queries or in the target collection. This kind of vocabulary is often out-of-vocabulary (OOV) for dictionaries that are used to translate queries. In historic document retrieval (HDR), OCR errors and historical spelling variants cause similar problems. In this paper, three data driven approaches to these problems are presented. The two first methods, the transformation rule based translation (TRT) method and the classified s-gram method, operate on string level. With them approximate matches of a query word can be recognized from the target document collection and included into the target query. In the third method, the corpus-based approach, parallel or comparable corpora are employed to derive translation knowledge that can be used to translate OOV words. Besides the overview of the methods, three case studies highlighting their practical applications in CLIR are also presented. The methods are shown to be effective in query translation without dictionaries between closely related languages (TRT and s-grams), OOV word translation (s-grams), and boosting dictionary-based CLIR performance by way of OOV word translation (corpus based methods).
Can students reengineer?
Authors: Ronald J. Leach, Legand L. Burge, Harry N. Keeling
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

A recent paper by David Lechner stated that for many long-lived systems, it is more efficient to reengineer portions of systems than to continually repair them. That paper made an implicit assumption about the ability of software engineers to determine precisely which software should be reengineered. We report the results of a study that addresses the readiness of graduates, who will soon be beginning software engineers, to make such an assessment, based on comprehension of reusable vs. reengineered software. We address this comprehension in the context of software engineering education.
Beginning XNA 2.0 Game Programming: From Novice to Professional
Authors: Alexandre Santos Lobao, Bruno Pereira Evangelista, Jos Antonio Leal de Farias
Venue:  (2008)

Would you like to create your own games, but never have the time to dig into the details of multimedia programming? Now you dont have to! XNA makes it simple to create your own games, which will run on your PC and Xbox 360 console. Even if you dont know how to program at all, Beginning XNA 2.0 Game Programming: From Novice to Professional will teach you the basics of C# 2005 programming along the way. Dont get overwhelmed with details you dont need to know just learn what you need to start creating your own games right now! The fastpaced introduction to XNA and the C# language provides professional developers a quick-start guide to creating a commercial product using XNA, as well as offering home enthusiasts or hobbyists everything they need to begin putting together games in their spare time. Youll discover and understand all the key concepts required to create smooth, professionallooking results in a range of gaming genres. Every reader will come away with a firm foundation onto which they can build more advanced ideas. What youll learn An introduction to the C# language Basics of game programming XNA basics Xbox 360 controller and keyboard input Fully worked examples of how to create 2D and 3D games Who is this book for? Anyone approaching XNA programming for the Xbox 360 for the first time About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entry-level job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory!
A novel face and hands tracking in a complex background
Authors: Sang Hwan Lee, Sang Min Yoon, Ji Hoon Jeong
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

We present a novel face and hands tracking algorithm for solving problems of partial occlusion in complex backgrounds. Without background subtraction or training, we successfully extracted the features with incorporation of color and motion information to reject the static background objects that have similar skin color. Hybrid tracking algorithm based on MAWUPC algorithm and particle filter is robust to the multiple objects' movement and some kinds of distracters. This is the essential and necessary process of natural Human Computer Interaction, Video Surveillance and Monitoring.
Brightness of the glare illusion
Authors: Akiko Yoshida, Matthias Ihrke, Rafał Mantiuk, Hans-Peter Seidel
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

The glare illusion is commonly used in CG rendering, especially in game engines, to achieve a higher brightness than that of the maximum luminance of a display. In this work, we measure the perceived luminance of the glare illusion in a psychophysical experiment. To evoke the illusion, an image is convolved with either a point spread function (PSF) of the eye or a Gaussian kernel. It is found that 1) the Gaussian kernel evokes an illusion of the same or higher strength than that produced by the PSF while being computationally much less expensive, 2) the glare illusion can raise the perceived luminance by 20 -- 35%, 3) some convolution kernels can produce undesirable Mach-band effects and thereby reduce the brightness boost of the glare illusion. The reported results have practical implications for glare rendering in computer graphics.
Short communication: Analysis of self-describing gridded geoscience data with netCDF Operators (NCO)
Authors: Charles S. Zender
Venue: Environmental Modelling Software (2008)

The netCDF Operator (NCO) software facilitates manipulation and analysis of gridded geoscience data stored in the self-describing netCDF format. NCO is optimized to efficiently analyze large multi-dimensional data sets spanning many files. Researchers and data centers often use NCO to analyze and serve observed and modeled geoscience data including satellite observations and weather, air quality, and climate forecasts. NCO's functionality includes shared memory threading, a message-passing interface, network transparency, and an interpreted language parser. NCO treats data files as a high level data type whose contents may be simultaneously manipulated by a single command. Institutions and data portals often use NCO for middleware to hyperslab and aggregate data set requests, while scientific researchers use NCO to perform three general functions: arithmetic operations, data permutation and compression, and metadata editing. We describe NCO's design philosophy and primary features, illustrate techniques to solve common geoscience and environmental data analysis problems, and suggest ways to design gridded data sets that can ease their subsequent analysis.
Stability of two-dimensional blind grasping under the gravity effect and rolling constraints
Authors: S. Arimoto, M. Yoshida, J.-h. Bae
Venue: Robotica (2008)

This paper aims to show a sensory-motor coordination control scheme that realizes stable pinching of rigid objects with parallel or nonparallel flat surfaces movable in 2-dimensional vertical plane by a pair of robot fingers with hemispherical ends. The proposed control signal is composed of gravity compensation for fingers, damping shaping, exertion of forces to the object from opposite directions, generation of moments for balancing of rotational moments, and regressors for estimating unknown steady-state terms, all of which neither need the knowledge of object parameters nor use any object sensing data. In other words, stable grasping can be realized by using only finger-joint sensing in a blind manner without using force sensors or tactile sensing. Stability of pinching motion with convergence to the state of force/torque balance is shown through computer simulations and is also proved theoretically.
A scalable correlation aware aggregation strategy for wireless sensor networks
Authors: Yujie Zhu, Ramanuja Vedantham, Seung-Jong Park, Raghupathy Sivakumar
Venue: Information Fusion (2008)

Sensors-to-sink data in wireless sensor networks (WSNs) are typically characterized by correlation along the spatial, semantic, and/or temporal dimensions. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In this paper, we first identify that most of the existing upstream routing approaches in WSNs can be translated to a correlation-unaware data aggregation structure - the shortest-path tree. Although by using a shortest-path tree, some implicit benefits due to correlation are possible, we show that explicitly constructing a correlation-aware structure can result in considerable performance improvement. Toward this end, we present a simple, scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation-aware and -unaware structures.
Cooperative proxy caching for wireless base stations
Authors: James Z. Wang, Zhidian Du, Pradip K. Srimani
Venue: Mobile Information Systems (2007)

This paper proposes a mobile cache model to facilitate the cooperative proxy caching in wireless base stations. This mobile cache model uses a network cache line to record the caching state information about a web document for effective data search and cache space management. Based on the proposed mobile cache model, a P2P cooperative proxy caching scheme is proposed to use a self-configured and self-managed virtual proxy graph (VPG), independent of the underlying wireless network structure and adaptive to the network and geographic environment changes, to achieve efficient data search, data cache and date replication. Based on demand, the aggregate effect of data caching, searching and replicating actions by individual proxy servers automatically migrates the cached web documents closer to the interested clients. In addition, a cache line migration (CLM) strategy is proposed to flow and replicate the heads of network cache lines of web documents associated with a moving mobile host to the new base station during the mobile host handoff. These replicated cache line heads provide direct links to the cached web documents accessed by the moving mobile hosts in the previous base station, thus improving the mobile web caching performance. Performance studies have shown that the proposed P2P cooperative proxy caching schemes significantly outperform existing caching schemes.