ppxscal/embedding_network huggingface dataset:
Tree species mapping with Airborne hyper-spectral MIVIS data: the Ticino Park study case
Authors: M. Boschetti, L. Boschetti, S. Oliveri, L. Casati, I. Canova
Venue: International Journal of Remote Sensing (2007)

The present work describes the procedure, which was studied for mapping the spatial distribution of tree forest communities in the Ticino Park located in Northern Italy. Ten overlapping airborne runs of the Multispectral Infrared Visible Imaging Spectrometer (MIVIS) were acquired to cover the entire park extent (920 km2). An integrated supervised classification procedure was developed using band ratios in the red edge portion (REP) of the spectrum and training collected by field survey and visual interpretation. Validation performed with a robust random stratified sampling scheme and taking into account the unequal distribution of the classes showed that, on large-scale application, high-resolution remotely sensed images can generate, in a cost-effective manner, accurate (overall accuracy 75%) local-scale thematic products.
SixthSense: RFID-based Enterprise Intelligence
Authors: Lenin Ravindranath, Venkata N. Padmanabhan, Piyush Agrawal
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

RFID is widely used to track the movement of goods through a supply chain. In this paper, we extend the domain of RFID by presenting SixthSense, a platform for RFID-based enterprise intelligence systems. We consider an enterprise setting where people (or rather their employee badges) and their personal objects such as books and mobiles are tagged with cheap, passive RFID tags, and there is good coverage of RFID readers in the workplace. SixthSense combines mobility information obtained from RFID-based sensing with information from enterprise systems such as calendar and presence, to automatically draw inferences about the association and interaction amongst people, objects, and workspaces. For instance, SixthSense is able to automatically distinguish between people and objects, learn the identities of people, and infer the ownership of objects by people. We characterize the performance of a state-of-the-art RFID system used in our testbed, present our inference algorithms, and evaluate these both in a small testbed and via simulations. We also present the SixthSense programming model that exposes a rich API to applications. To demonstrate the capabilities of the SixthSense platform, we present a few applications built using these APIs, including a mis placed object alert service, an enhanced calendar service, and rich annotation of video with physical events. We also discuss the issue of safeguarding user privacy in the context of SixthSense.
Context sessions: a novel approach for scalable context management in NGN networks
Authors: Martin Strohbach, Martin Bauer, Ernoe Kovacs, Claudia Villalonga, Nils Richter
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

In this paper we present a context-management middleware for Next Generation Networks (NGN). Our middleware, called ICE, is based on the concept of Context Sessions. In contrast to earlier work in context management, we apply NGN design principles to context management and separate signalling from context exchange. We believe that ICE provides an ideal starting point for more flexible and adaptive management of large scale context information compared to existing approaches. In order to allow for easy integration into NGN networks, ICE is implemented as a service on top of the IP Multimedia Subsystem.
Estimating afternoon MODIS land surface temperatures (LST) based on morning MODIS overpass, location and elevation information
Authors: N. C. Coops, D. C. Duro, M. A. Wulder, T. Han
Venue: International Journal of Remote Sensing (2007)

The MODerate Resolution Imaging Spectroradiometer (MODIS) instrument on-board the Terra and Aqua satellites is a critical tool for providing daily estimates of land surface temperature (LST). Terra launched in late 1999 has a morning (AM) overpass, whereas Aqua launched in early 2002 has an afternoon (PM) overpass. Generally, LST is expected, under cloudless conditions, to be warmer in the early afternoon than the morning due to the link between maximum skin temperature and solar insolation peak time, therefore the Aqua PM LST is likely to be closer to the maximum daily LST than that acquired from Terra. This letter investigated differences between the Aqua MODIS PM and Terra MODIS AM LST estimates over a range of land cover classes, locations, and dates, across Canada. The aim was to develop a simple adjustment which can be applied to Terra AM LST estimates to approximate a "synthetic" Aqua PM LST product from 2000 to mid-2002, thereby providing a seamless afternoon MODIS LST product from 2000 to 2006. Results indicate that there are statistically significant differences between the AM and PM LST ranging from 0.3°C to 3.2°C depending on cover type, and between 1.2° and 5.0° depending on time of year. On average, over 90% of the variation observed in the PM record can be explained by the AM LST, land cover types and location.
(Bio)-behavioral CAD
Authors: Miodrag Potkonjak, Farinaz Koushanfar
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We propose the use of functional magnetic resonance imaging (fMRI) systems, techniques, and tools to observe the neuron-level activity of the brains of designers or CAD tool developers. The objective is to enable designers and developers to complete their task in a faster and more creative way with significantly reduced number of logical and design errors. While fMRI techniques are already used in economics, decision and several other social sciences, until now their potential for closing the design productivity-silicon productivity (DPSP) gap has not been recognized. By compounding the new approach with techniques for designing integrated circuits and system within fMRI data collection and analysis, we will establish a positive productivity and creativity feedback loop that may permanently close the DPSP gap. As a preliminary and presently feasible step, we propose the creation of behavioral CAD research and development techniques. The usage of judiciously selected verbal, visual information and reintroduction of successful design paradigm and exposure to beneficial synthesis templates may help current and future designers to learn and design more effectively.
Crossing properties of graph reliability functions
Authors: Alexander K. Kelmans
Venue: Journal of Graph Theory (2000)

Let G be a graph and p&thinsp;&epsi;&thinsp;(0,&thinsp;1). Let A(G,&thinsp;p) denote the probability that if each edge of G is selected at random with probability p then the resulting spanning subgraph of G is connected. Then A(G,&thinsp;p) is a polynomial in p. We prove that for every integer k&thinsp;&ge;&thinsp;1 and every k-tuple (m1, m2,&thinsp;&hellip;&thinsp;,mk) of positive integers there exist infinitely many pairs of graphs G1 and G2 of the same size such that the polynomial A(G1, p)&thinsp;-&thinsp;A(G2, p) has exactly k roots x1&thinsp;<&thinsp;x2&thinsp;<&thinsp;&middot;&middot;&middot;&thinsp;<&thinsp;xk in (0,&thinsp;1) such that the multiplicity of xi is mi. We also prove the same result for the two-terminal reliability polynomial, defined as the probability that the random subgraph as above includes a path connecting two specified vertices. These results are based on so-called A- and T-multiplying constructions that are interesting in themselves. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 206&ndash;221, 2000
The ncsu catalog research testbed: a tool for evaluating faceted library catalog interfaces
Authors: Tito Sierra, Joseph Ryan, Jason Casden
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Many libraries have recently been devoting significant efforts to modernizing their library catalog web interfaces. One popular approach is to create a faceted search interface to the library catalog. Faceted search interfaces can be complex, requiring designers to make many decisions about the placement and display of faceted search design elements on the page. Unfortunately little empirical research exists on how to optimize faceted search interfaces for library catalogs. To facilitate research in this area, the NCSU Libraries has developed the NCSU Catalog Research Testbed, a tool for developing and evaluating faceted library catalog interfaces.
Choosing the Right Prioritisation Method
Authors: Sarah Hatton
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

There are many methods available for prioritising software requirements. Choosing the most suitable one can often be quite difficult. A number of factors need to be considered such as the project development methodology being used, the amount of time available, the amount of information known about requirements, the stage of the project and the degree of information about priority required. This paper examines the type of information available at different stages in a project and matches it to the properties of prioritisation methods. It then recommends the usage of specific prioritisation methods at certain stages of a project.
XBRL: from common financial vocabularies to intelligent decision making
Authors: Eduardo Carrillo Zambrano, José Javier Samper
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

This paper describes the main contributions in relation with the develop of an XBRL (Extensible Business Reporting Language) taxonomy proposed by the PRISMA research group at University UNAB. This taxonomy has been developed for public institutions in Colombia. This taxonomy is based on the information exchange of financial information. It is also described the creation of a wiki system which includes real information of existing XBRL projects in the world and the creation of a demostration center of XBR reports.
A Hybrid P2P Overlay Network for Non-Strictly Hierarchically Categorized Contents
Authors: Yi Wan, Takuya Asaka, Tatsuro Takahashi
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In P2P content distribution systems, there are many cases in which the content can be classified into hierarchically organized categories. In this paper, we propose a hybrid overlay network design suitable for such content called Pastry/NSHCC (Pastry for Non-Strictly Hierarchically Categorized Content). The semantic information of classification hierarchies of the content can be utilized regardless of whether they are in a strict tree structure or not. By doing so, the search scope can be restrained to any granularity, and the number of query messages also decreases while maintaining keyword searching available. Through simulation, we showed that the proposed method provides better performance and lower overhead than unstructured overlays exploiting the same semantic information.
Standardized and cost-effective MPEG4 video streaming server
Authors: J. Martínez, B. Molina, C. Palau, M. Esteve
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Current commercial video servers are implemented in a closed way. The video server is the most important device in a video surveillance system. All components in a video surveillance system depend on the video compression protocol and the encapsulation method used in the video server. The majority of commercial video servers are implemented with a dedicated DSP design. The hardware architecture and the video applications are usually closed in these devices. Furthermore, in commercial video servers, the video encoding protocols and encapsulation methods are also closed. This article shows a video server implemented with general-purpose hardware, open source software and standardized protocols. The proposed video server has been compared with commercial video servers and it has showed to be the best solution in terms of interoperativity, cost and scalability.
Semantics based buffer reduction for queries over XML data streams
Authors: Chi Yang, Chengfei Liu, Jianxin Li, Jeffrey Xu Yu, Junhu Wang
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buffer scale may increase exponentially, which can cause memory bottleneck. Some optimization techniques have been proposed to solve the problem. However, the limit of these techniques has been defined by a concurrency lower bound and been theoretically proved. In this paper, we show through an empirical study that this lower bound can be broken by taking semantic information into account for buffer reduction. To demonstrate this, we build a SAX-based XML stream query evaluation system and design an algorithm that consumes buffers in line with the concurrency lower bound. After a further analysis of the lower bound, we design several semantic rules for the purpose of breaking the lower bound and incorporate these rules in the lower bound algorithm. Experiments are conducted to show that the algorithms deploying semantic rules individually and collectively all significantly outperform the lower bound algorithm that does not consider semantic information.
Performance of Cooperative Time-Reversal Communication in a Mobile Wireless Environment
Authors: Richard J. Barton, Ji Chen, Kyle Huang, Dagang Wu, Hsiao-Chun Wu
Venue: International Journal of Distributed Sensor Networks (2007)

In this paper, we study the performance of a technique called time reversal for cooperative communication in a mobile wireless environment. To put the work in context, a brief introduction to time-reversal communication (TRC) in general and cooperative TRC in particular is presented. Performance of a proposed cooperative TRC scheme is evaluated numerically via a simulated indoor environment containing multiple wireless communication nodes. We characterize the behavior of the peak power received at a target node as a function of the number of cooperating transmitting nodes and as a function of the distance of the target from its predicted location within the simulated environment. The results demonstrate that the performance of cooperative TRC is less sensitive to uncertainty in the target position than might be expected from standard assumptions regarding the relationship between signal wavelength and spatial channel correlation in a complex multipath environment.
System-controlled user interaction within the service robotic control architecture massive
Authors: Oliver Prenzel, Christian Martens, Marco Cyriacks, Chao Wang, Axel Gräser
Venue: Robotica (2007)

This paper presents an approach to reduce the technical complexity of a service robotic system by means of systematic and well-balanced user-involvement. By taking advantage of the user's cognitive capabilities during task execution, a technically manageable robotic system, which is able to execute tasks on a high level of abstraction reliably and robustly, emerges. For the realisation of this approach, the control architecture MASSiVE has been implemented, which is used for the control of the rehabilitation robot FRIEND II. It supports task execution on the basis of a priori defined and formally verified task-knowledge. This task-knowledge contains all possible sequences of operations as well as the symbolic representation of objects required for the execution of a specific task. The seamless integration of user interactions into this task-knowledge, in combination with MASSiVE's user-adapted human–machine interface layer, enables the system to deliberately interact with the user during run-time.
ε-Optimality conditions for composed convex optimization problems
Authors: Radu Ioan Boţ, Ioan Bogdan Hodrea, Gert Wanka
Venue: Journal of Approximation Theory (2008)

The aim of the present paper is to provide a formula for the @?-subdifferential of f+g@?h different from the ones which can be found in the existent literature. Further we equivalently characterize this formula by using a so-called closedness type regularity condition expressed by means of the epigraphs of the conjugates of the functions involved. Even more, using the @?-subdifferential formula we are able to derive necessary and sufficient conditions for the @?-optimal solutions of composed convex optimization problems.
A NON-PARAMETRIC APPROACH TO SIMPLICITY CLUSTERING
Authors: Peter Hines, Emmanuel M. Pothos, Nick Chater
Venue: Applied Artificial Intelligence (2007)

The simplicity principle-an updating of Ockham's razor to take into account modern information theory-states that the preferred theory for a set of data is the one that allows for the most efficient encoding of the data. We consider this in the context of classification, or clustering, as a data reduction technique that helps describe a set of objects by dividing the objects into groups. The simplicity model we present favors clusters such that the similarity of the items in the clusters is maximal, while the similarity of items between clusters is minimal. Several novel features of our clustering criterion make it especially appropriate for clustering of data derived from, psychological procedures (e.g., similarity ratings): It is non-parametric, and may be applied in situations where the metric axioms are violated without requiring (information-forgetting) transformation procedures. We illustrate the use of the criterion with a selection of data sets. A distinctive aspect of this research is that it motivates a clustering algorithm from psychological principles.
Dynamic programming strikes back
Authors: Guido Moerkotte, Thomas Neumann
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products: DPccp, which is based on dynamic programming, and Top-Down Partition Search, based on memoization. Both have two severe limitations: They handle only (1) simple (binary) join predicates and (2) inner joins. However, real queries may contain complex join predicates, involving more than two relations, and outer joins as well as other non-inner joins. Taking the most efficient known join-ordering algorithm, DPccp, as a starting point, we first develop a new algorithm, DPhyp, which is capable to handle complex join predicates efficiently. We do so by modeling the query graph as a (variant of a) hypergraph and then reason about its connected subgraphs. Then, we present a technique to exploit this capability to efficiently handle the widest class of non-inner joins dealt with so far. Our experimental results show that this reformulation of non-inner joins as complex predicates can improve optimization time by orders of magnitude, compared to known algorithms dealing with complex join predicates and non-inner joins. Once again, this gives dynamic programming a distinct advantage over current memoization techniques.
Design guidelines for web applications based on local patterns
Authors: César I. Llanos, Marcia N. Muñoz
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

We present the results of a project to determine web design guidelines bases on user interface design patterns present in Chilean web applications. The scope of the work is restricted to web applications in the .cl domain. We consider three types of web applications: web sites, search engines and blogs. First, we chose a study sample of 178 web sites, 4 search engines and 16 blogs. Then, a typical web application's elements were identified, and their most common page locations were determined. Usability tests were performed on a representative sample of web sites so as to evaluate them qualitatively and thus determine which elements are relevant to the users from a usability point of view. Finally, we derive design guidelines for the most representative features for each type of web application, based on analysis of the study sample and the usability test results.
Flow control of real-time unicast multimedia applications in best-effort networks
Authors: Alexander G. Parlos
Venue:  (2007)

One of the fastest growing segments of Internet applications are real-time multimedia applications, like Voice over Internet Protocol ( VoIP). Real-time multimedia applications use the User Datagram Protocol (UDP) as the transport protocol because of the inherent conservative nature of the congestion avoidance schemes of Transmission Control Protocol (TCP). The effects of uncontrolled flows on the Internet have not yet been felt because UDP traffic frequently constitutes only &sim;20% of the total Internet traffic. It is pertinent that real-time multimedia applications become better citizens of the Internet, while at the same time deliver acceptable Quality of Service (QoS). Traditionally, packet losses and the increase in the end-to-end delay experienced by some of the packets characterizes congestion in the network. These two signals have been used to develop most known flow control schemes. The current research considers the flow accumulation in the network as the signal for use in flow control. The most significant contribution of the current research is to propose novel end-to-end flow control schemes for unicast real-time multimedia flows transmitting over best-effort networks. These control schemes are based on predictive control of the accumulation signal. The end-to-end control schemes available in the literature are based on reactive control that do not take into account the feedback delay existing between the sender and the receiver nor the forward delay in the flow dynamics. The performance of the proposed control schemes has been evaluated using the ns-2 simulation environment. The research concludes that active control of hard real-time flows delivers the same or somewhat better QoS as High Bit Rate (HBR, no control), but with a lower average bit rate. Consequently, it helps reduce bandwidth use of controlled real-time flows by anywhere between 31:43% to 43:96%. Proposed reactive control schemes deliver good QoS. However, they do not scale up as well as the predictive control schemes. Proposed predictive control schemes are effective in delivering good quality QoS while using up less bandwidth than even the reactive control schemes. They scale up well as more real-time multimedia flows start employing them.
Network Sender Multicast Routing Protocol
Authors: Khalid A. Farhan
Venue: Proceedings of the Seventh International Conference on Networking (2008)

An efficient and scalable multicast routing protocol for ad hoc networks is proposed. Network Sender Multicast Routing Protocol (NSMRP) is a mesh based protocol. A central node called mesh sender (MS) is selected periodically from among the group(s) sender(s) to create one mesh in order to be used in forwarding control and data packets to all multicast group(s) member(s). One invitation message will be periodically flooded to all group(s) member(s) by MS to join the group(s). NSMRP is evaluated by simulation, and the simulation results show that NSMRP is achieving better performance and low overheads by varying the maximum mobility speeds or increasing the number of multicast groups or senders.