ppxscal/embedding_network huggingface dataset:
A New RMI Framework for Outdoor Objects Recognition
Authors: Wong Chuan Ern, Ong Teong Joo
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, we present an extension to the Recurrent Motion Image (RMI) motion-based object recognition framework for use in development of automated video surveillance systems. We extended the object classes of RMI to include four-legged animals (such as dog and cat) and enhanced the preprocessing and shadow removal algorithms for better object segmentation and recognition. Under the new framework, object blobs obtained from background subtraction of scenes are tracked using region correspondence. In turn, we calculate the RMI signatures based on the silhouettes of the object blobs for proper classification. This new framework is tested on several real world 320 x 240 resolution color image sequences captured with a low-end digital camera, and all of the moving objects in our samples are properly detected, tracked and classified - indicating the applicability of the new framework in similar task environment.
Insulating substrates for cubic GaN-based HFETs
Authors: E. Tschumak, M. P. F. de Godoy, D. J. As, K. Lischka
Venue: Microelectronics Journal (2009)

The growth of cubic group III-nitrides is a direct way to eliminate polarization effects, which inherently limits the fabrication of normally off heterojunction field-effect transistors (HFETs) in the GaN technology. However, for the achievement of electronic devices with cubic nitrides an important precondition is the availability of a high-resistive substrate or GaN buffer layer with zinc-blende crystal structure. We investigated the applicability of carbonized high resistance Si (001)-substrates and thick conductive free-standing 3C-SiC (100) substrates with an Ar^+-ion-damaged surface layer for this purpose and studied the use of carbon-doped GaN buffer layers for electrical insulation. We found that Ar-implantation of 3C-SiC is an appropriate alternative to fabricate insulation layer for cubic GaN (c-GaN) growth and that C-doped GaN buffers introduce non-linear I-V characteristics. The structural properties of c-GaN on Ar-implanted 3C-SiC are comparable to GaN on untreated 3C-SiC whereas on carbonized Si substrates an increase of dislocation density and surface roughness is observed.
Navigating in a Graph by Aid of Its Spanning Tree
Authors: Feodor F. Dragan, Martin Matamala
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Let G = (V,E) be a graph and T be a spanning tree of G. We consider the following strategy in advancing in G from a vertex x towards a target vertex y: from a current vertex z (initially, z = x), unless z = y, go to a neighbor of z in G that is closest to y in T (breaking ties arbitrarily). In this strategy, each vertex has full knowledge of its neighborhood in G and can use the distances in T to navigate in G. Thus, additionally to standard local information (the neighborhood N G(v)), the only global information that is available to each vertex v is the topology of the spanning tree T (in fact, v can know only a very small piece of information about T and still be able to infer from it the necessary tree-distances). For each source vertex x and target vertex y, this way, a path, called a greedy routing path, is produced. Denote by g G,T(x,y) the length of a longest greedy routing path that can be produced for x and y using this strategy and T. We say that a spanning tree T of a graph G is an additive r -carcass for G if g G,T(x,y) &le; d G(x,y) + r for each ordered pair x,y &epsilon; V. In this paper, we investigate the problem, given a graph family ${\cal F}$, whether a small integer r exists such that any graph $G\in {\cal F}$ admits an additive r-carcass. We show that rectilinear p&times;q grids, hypercubes, distance-hereditary graphs, dually chordal graphs (and, therefore, strongly chordal graphs and interval graphs), all admit additive 0-carcasses. Furthermore, every chordal graph G admits an additive (&omega;(G) + 1)-carcass (where &omega;(G) is the size of a maximum clique of G), each 3-sun-free chordal graph admits an additive 2-carcass, each chordal bipartite graph admits an additive 4-carcass. In particular, any k-tree admits an additive (k + 2)-carcass. All those carcasses are easy to construct.
DFTL: a flash translation layer employing demand-based selective caching of page-level address mappings
Authors: Aayush Gupta, Youngjae Kim, Bhuvan Urgaonkar
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Recent technological advances in the development of flash-memory based devices have consolidated their leadership position as the preferred storage media in the embedded systems market and opened new vistas for deployment in enterprise-scale storage systems. Unlike hard disks, flash devices are free from any mechanical moving parts, have no seek or rotational delays and consume lower power. However, the internal idiosyncrasies of flash technology make its performance highly dependent on workload characteristics. The poor performance of random writes has been a cause of major concern, which needs to be addressed to better utilize the potential of flash in enterprise-scale environments. We examine one of the important causes of this poor performance: the design of the Flash Translation Layer (FTL), which performs the virtual-to-physical address translations and hides the erase-before-write characteristics of flash. We propose a complete paradigm shift in the design of the core FTL engine from the existing techniques with our Demand-based Flash Translation Layer (DFTL), which selectively caches page-level address mappings. We develop a flash simulation framework called FlashSim. Our experimental evaluation with realistic enterprise-scale workloads endorses the utility of DFTL in enterprise-scale storage systems by demonstrating: (i) improved performance, (ii) reduced garbage collection overhead and (iii) better overload behavior compared to state-of-the-art FTL schemes. For example, a predominantly random-write dominant I/O trace from an OLTP application running at a large financial institution shows a 78% improvement in average response time (due to a 3-fold reduction in operations of the garbage collector), compared to a state-of-the-art FTL scheme. Even for the well-known read-dominant TPC-H benchmark, for which DFTL introduces additional overheads, we improve system response time by 56%.
Interactive Panning and Zooming the Virtual Camera
Authors: Stephan Fischer, Ivica Rimac, Ralf Steinmetz
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper we explain how camera pans and zooms in digital video can be used to create a panoramic view of a video clip reordering the frames. As the view will normally be too large to be displayed on a single screen we propose the use of a grid where the user can move a "virtual camera" in different directions which are defined by camera pans as well as by camera zooms. To achieve this goal we explain in detail the architecture of our virtual camera.
The influence of the ground effect, the field strength and the field factor to corona and breakdown of small rod-plate air gaps
Authors: Athanasios Maglaras, Leandros Maglaras
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The ground effect is the phenomenon that occurs due to the different way an air gap is grounded while stressed by high voltage. This phenomenon influences the distribution of the field in the gap, the corona onset voltage and the breakdown voltage in small rod-plate air gaps. In longer air gaps, the ground effect influences the corona effects and consequently the values of the corona current through the gap. The corona leakage current is higher in a rod-plate air gap with the plate grounded, because in such an arrangement the electric field is more inhomogeneous. The average value of the field strength and the field factor across the axis of the gap are determinant factors of major importance for the phenomena of corona and breakdown in rod-plate air gaps. The inhomogeneity of the field determines the evolution of the dielectric behaviour of the gap.
Average power control algorithm with dynamic channel assignment for TDD-CDMA systems
Authors: Zheng Zhihua, Xu He, Wu Jianhua
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In TDD-CDMA system, the different asymmetrical requirements between up-link (UL) and downlink (DL) in different base station (BS) and different timeslot will generate serious inter-cell interference. From the interference points of view, dynamic channel allocation (DCA) is usually adopted in TDD-CDMA systems to improve the system performance. In this paper, a novel DCA with average power control algorithm is investigated. The power control algorithms are addressed on the uplink and downlink power procession, as well as scheme of resource reserving and the BS-BS interference resolving mechanisms. Simulation results show the above DCA scheme has better performance compared to those of the traditional DCA schemes for asymmetrical traffic in TDD-CDMA systems.
AMBLE: An Awareness Model for Balancing the Load in collaborative grid Environments
Authors: Pilar Herrero, Jose Bosque, Manuel Salvadores, Maria Perez
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

In this paper, we present a new extension and reinterpretation of one of the most successful models of awareness in Computer Supported Cooperative Work (CSCW), called the Spatial Model of Interaction (SMI), which manage awareness of interaction through a set of key concepts, to manage task delivery in collaborative distributed systems. This model also applies some theoretical principles and theories of multi-agents systems to create a collaborative and cooperative environment that can be able to provide an autonomous, efficient and independent management of the amount of resources available in a Grid environment. This model has been implemented using web services and some experimental results carried out over a real and heterogeneous grid are presented with the end of emphasizing the performance speedup of the system using the AMBLE model.
Location and relevance
Authors: Patrick Ehlen, Remi Zajac, Kotcherlakota Bapa Rao
Venue: Proceedings of the 2nd International Workshop on Location and the Web (2009)

In traditional information retrieval, relevance is often judged by comparing the similarity of text in a query to the text of a document returned, reflecting a context-independent relevance relation. But mobile search calls for an expanded approach to assessing similarity and relevance---an approach that is highly attuned to the context-dependent factors that occur when people leave their desks and begin requesting information from different environments and perspectives.
Effects of Common Point Distribution and Adjustment Models on Detecting and Distinguishing Gross Error
Authors: Yifan Fang, Cheng Zhong
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

the classical method for detecting and distinguishing gross errors considers redundant observation components, and inner and external reliabilities are the important robustness indicators of an adjustment. It employs data snooping successively to detect gross errors and find dubitable observations, and correlation coefficients to distinguish two gross errors. Based on the method, we systematically and completely investigate the effects of common point distributions and adjustment models on the redundant observation component, interior and exterior reliabilities, and gross error distinguish ability, and find some reliable and directive results.
Relevance Feedback and Category Search in Image Databases
Authors: Christophe Meilhac, Chahab Nastar
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We present a sound framework for relevance feedback in content-based image retrieval. The modeling is based on non-parametric density estimation of relevant and non-relevant items and Bayesian inference. This theory has been successfully applied to benchmark image databases, quantitatively demonstrating its performance for target search, selective control of precision and recall in category search, and improvement of retrieval effectiveness. The paper is illustrated with several experiments and retrieval results on real-world data.
Using subspace algorithm cointegration analysis: Simulation performance and application to the term structure
Authors: Dietmar Bauer, Martin Wagner
Venue: Computational Statistics Data Analysis (2009)

The performance of subspace algorithm cointegration analysis is discussed in detail by means of both a simulation study, as well as an empirical investigation of the expectations hypothesis of the term structure on four interest rate and bond yield data sets. A new better performing order estimation criterion is introduced. The main finding of the simulation study is that the methods offer some advantages in determining the cointegrating rank, where they often outperform Johansen cointegration analysis. In the empirical application we find much stronger evidence for the cointegration implications of the expectations hypothesis of the term structure than when using VAR cointegration analysis. These favorable findings highlight the potential usefulness of the computationally simple yet widely applicable method.
Exposing UDDI Service Descriptions and Their Metadata Annotations as WS-Resources
Authors: Weijian Fang, Luc Moreau, Rachana Ananthakrishnan, Mike Wilde, Ian Foster
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Service discovery is a critical task in service-oriented architectures. GRIMOIRES is a UDDI-compliant service registry with rich metadata annotation capabilities. In this paper, we present a WSRF-compliant extension of the GRIMOIRES architecture that exposes service descriptions and their metadata annotations as WS-Resources. By doing so, the service registry provides improved interoperability by allowing service descriptions to be accessed and managed via standard Web services operations. In particular, we can access service descriptions, manage the lifetime of service descriptions, and subscribe for notifications of change in service descriptions. The paper discusses the benefits and design choices associated with such an approach and the technical challenges in providing an implementation.
How the Brain Processes Language in Different Modalities
Authors: Bencie Woll
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

Establishing which neural systems support processing of sign languages informs a number of important neuroscience and linguistic questions. In this chapter, the linguistic structure of sign languages is introduced with a discussion of common myths about sign languages. This is followed by a more detailed discussion of the linguistics of British Sign Language, with special reference to features which resemble or contrast with spoken languages. The final section describes language and the brain by describing a number of neuroimaging studies with signers and research on signers who have aphasia or other language deficits following strokes. The neuroimaging and aphasia data are used to explore the `core language system' - the regions of the brains used for language regardless of modality.
Unsupervised Pedestrian Re-identification for Loitering Detection
Authors: Chung-Hsien Huang, Yi-Ta Wu, Ming-Yu Shih
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper presents a framework of detecting loitering pedestrians in a video surveillance system. First, to represent pedestrians an appearance feature which contains geometric information and color structure is proposed. After feature extraction, pedestrians are tracked by a proposed Bayesian-based appearance tracker. The tracker takes the advantage of Bayesian decision to associate the detected pedestrians according to their color appearances and spatial location among consecutive frames. The pedestrian's appearance is modeled as a multivariate normal distribution and recorded in a pedestrian database. The database also records time stamps when the pedestrian appears as an appearing history. Therefore, even though the pedestrian leaves and returns to the scene, he/she can still be re-identified as a loitering suspect. However, a critical threshold which determines whether two appearances are associated or not is needed to be set. Thus we propose a method to learn the associating threshold by observing two specific events from on-line video. A 10-minute video about three loitering pedestrians is used to test the proposed system. They are successfully detected and recognized from other passing-by pedestrians.
Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications
Venue: International Conference on Dublin Core and Metadata Applications (2008)

The 2008 International Conference on Dublin Core and Metadata Applications (DC-2008) is the sixteenth Dublin Core workshop, and the eighth full conference program to include peer-reviewed scholarly works (Tokyo, 2001; Florence, 2002; Seattle, 2003; Shanghai, 2004; Madrid, 2005; Manzanillo, 2006; and Singapore, 2007). DC-2008 takes place in Berlin, Germany, a vibrant city in which cultural and scientific ideas are exchanged daily among the many sectors of society. Home to some of the world's most significant libraries and scientific research centers, Berlin is an ideal location for DC-2008, and for further linking the community of researchers, information professionals, and citizens who increasingly work with metadata to support the preservation, discovery, access, use, and re-use of digital information and information associated with physical artifacts.
Cross-layer adaptive modulation and coding design for space-time block coded MIMO-OFDM systems
Authors: Li Zhang, Wei Heng
Venue: Computer Communications (2009)

This paper developed a cross-layer adaptive modulation and coding (AMC) design for space-time block coded (STBC) MIMO-OFDM systems, which combines the AMC at the physical layer with an automatic repeat request (ARQ) protocol at the data link layer, in order to maximize spectral efficiency under specified delay and packet error ratio (PER) constraints. The transmission mode for each subcarrier is updated frame-by-frame to match the time-varying channel conditions, in order to take full advantage of the OFDM systems. The proposed cross-layer AMC design is also incorporated with STBC to further improve the system performance. Numerical results have demonstrated that retransmission at the data link layer alleviate rigorous error-control requirements at the physical layer and thereby allows higher data rate transmission. It is shown that this cross-layer design has achieved considerable spectral efficiency gain in comparison with traditional AMC without cross-layer design. Note that increasing the maximum number of retransmissions beyond one has little effect on spectrum efficiency and will cause longer system delay. This suggests that a desirable trade-off between spectral efficiency and delay in the STBC MIMO-OFDM system is achieved by a small number of retransmission.
Synthesis of reconfigurable high-performance multicore systems
Authors: Jason Cong, Karthik Gururaj, Guoling Han
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerating system performance, lowering power consumption and minimizing operation cost. In order to achieve high performance on this hybrid system, it is important to effectively explore the design space, which includes accelerator synthesis, resource allocation and job scheduling. In this paper we propose novel algorithms for reconfigurable resource allocation and job scheduling to optimize performance of multicore RHPC systems. Specifically, we first propose an interesting approximation algorithm to assign jobs to processors with consideration of coprocessors at the global optimization step. Then we present an optimal solution for coprocessor selection in the local optimization step. In this paper we also demonstrate that designers can quickly explore a large number of accelerator design choices with the help of high-level synthesis tools. Experiments show that our proposed techniques provide efficient solutions for real-life benchmarks and generate higher quality of results. When compared to other heuristic algorithms, our results can achieve up to 47% performance improvement.
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Authors: Pascal Koiran, Klaus Meer
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Starting point of our work is a previous paper by Flarup, Koiran, and Lyaudet [5]. There the expressive power of certain families of polynomials is investigated. Among other things it is shown that polynomials arising as permanents of bounded tree-width matrices have the same expressiveness as polynomials given via arithmetic formulas. A natural question is how expressive such restricted permanent polynomials are with respect to other graph-theoretic concepts for representing polynomials over a field $\mathbb{K}.$ One such is representing polynomials by formulas in conjunctive normal form. Here, a monomial occurs according to whether the exponent vector satisfies a given CNF formula or not. We can in a canonical way assign a graph to such a CNF formula and speak about the tree-width of the related CNF polynomial.In this paper we show that the expressiveness of CNF polynomials of bounded tree-width again gives precisely arithmetic formulas. We then study how far the approach of evaluating subclasses of permanents efficiently using a reduction to CNF formulas of bounded tree-width leads. We show that there does not exist a family of CNF polynomials of bounded tree-width which can express general permanent polynomials. The statement is unconditional. An analoguous result for CNF polynomials of bounded clique-width is given, this time under the assumption that $\# P \not\subseteq FP/poly.$The paper contributes to the comparison between classical Boolean complexity and algebraic approaches like Valiant's one.