ppxscal/embedding_network huggingface dataset:
The Defect Detection Using Human Visual System and Wavelet Transform in TFT-LCD Image
Authors: Jong-Hwan Oh, Byoung-Ju Yun, Kil-Houm Park
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The thin film transistor liquid crystal display (TFT-LCD) image has non-uniform brightness, which is the major difficulty in finding the defect region called Mura. To facilitate Mura segmentation, globally widely varying background signal has to be flattened and Mura signal must be enlarged. In this paper, Mura signal magnification and background signal flattening method is proposed using wavelet coefficients processing and the properties of human visual system (HVS). The wavelet approximation coefficients are used for background signal flattening while wavelet detail coefficients are employed to magnify Mura signal based on adapted contrast sensitivity function (ACSF). For the enhanced image, tri-modal thresholding segmentation technique is used for finding Dark and White Mura at the same time. For final reliable defect confirmation, false region elimination algorithms based on Weber's Law are also proposed. By the experimental results of TFT-LCD image, the proposed algorithms can have promising results and can be applied to the real automated TFT-LCD inspection system.
Use of a ground-based scanning lidar for estimation of biophysical properties of western larch (Larix occidentalis)
Authors: R. Clawges, L. Vierling, M. Calhoon, M. Toomey
Venue: International Journal of Remote Sensing (2007)

Ground-based laser scanners represent a relatively new technology that promises to enhance the ability to remotely sense biophysical properties of vegetation. In this study, we utilized a commercially available discrete-return ground-based laser scanning system to sample properties of western larch (Larix occidentalis) in a northern Idaho forest. Three young trees
Analysis of social voting patterns on digg
Authors: Kristina Lerman, Aram Galstyan
Venue: Proceedings of the first workshop on Online social networks (2008)

The social Web is transforming the way information is created and distributed. Blog authoring tools enable users to publish content, while sites such as Digg and Del.icio.us are used to distribute content to a wider audience. With content fast becoming a commodity, interest in using social networks to promote and find content has grown, both on the side of content producers (viral marketing) and consumers (recommendation). Here we study the role of social networks in promoting content on Digg, a social news aggregator that allows users to submit links to and vote on news stories. Digg's goal is to feature the most interesting stories on its front page, and it aggregates opinions of its many users to identify them. Like other social networking sites, Digg allows users to designate other users as "friends" and see what stories they found interesting. We studied the spread of interest in news stories submitted to Digg in June 2006. Our results suggest that pattern of the spread of interest in a story on the network is indicative of how popular the story will become. Stories that spread mainly outside of the submitter's neighborhood go on to be very popular, while stories that spread mainly through submitter's social neighborhood prove not to be very popular. This effect is visible already in the early stages of voting, and one can make a prediction about the potential audience of a story simply by analyzing where the initial votes come from.
An Information Security Governance Framework
Authors: A. Da Veiga, J. H. P. Eloff
Venue: Information Systems Management (2007)

Information security culture develops in an organization due to certain actions taken by the organization. Management implements information security components, such as policies and technical security measures with which employees interact and that they include in their working procedures. Employees develop certain perceptions and exhibit behavior, such as the reporting of security incidents or sharing of passwords, which could either contribute or be a threat to the securing of information assets. To inculcate an acceptable level of information security culture, the organization must govern information security effectively by implementing all the required information security components. This article evaluates four approaches towards information security governance frameworks in order to arrive at a complete list of information security components. The information security components are used to compile a new comprehensive Information Security Governance framework. The proposed governance framework can be used by organizations to ensure they are governing information security from a holistic perspective, thereby minimising risk and cultivating an acceptable level of information security culture.
A Rekey-Boosted Security Protocol in Hierarchical Wireless Sensor Network
Authors: Yi-Ying Zhang, Wen-Cheng Yang, Kee-Bum Kim, Min-Yu Cui, Myong-Soon Park
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Hierarchical wireless sensor networks (WSNs) have been shown to improve system performance, reduce messages redundancy, and economize energy. However, due to the characteristics of WSN, such as restricted resources and operation in a hostile environment, WSNs are subjected to numerous threats and are vulnerable to attacks. In this paper, we present a rekey-boosted security protocol in LEACH (RBS-LEACH) to enhance network security and survivability. Compared to other LEACH security solutions, the salient advantage of this work is that a unique rekey mechanism, which can efficiently protect the network against attacks of eavesdropping or captured nodes compromise, is adopted to address challenging security issues of runtime WSN. Even if the adversaries crack WSN keys, the entire network still remains safe under the timely protection of the rekey mechanism.
Efficient average-case algorithms for the modular group
Authors: Jin-Yi Cai
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated subgroups of the modular group. The latter result affirms a conjecture of Y. Gurevich (1990).
INFRASTRUCTURE FOR RBAC-MAS: AN APPROACH BASED ON AGENT COORDINATION CONTEXTS
Authors: Mirko Viroli, Andrea Omicini, Alessandro Ricci
Venue: Applied Artificial Intelligence (2007)

In this article, we discuss how to shape a MAS infrastructure to support an agent-oriented, role-based access control model (RBAC-MAS). First, we introduce the RBAC model, and show how it can be extended to capture the essential features of agent systems. Then, we extrapolate the core requirements of an infrastructure for RBAC-MAS, and depict a possible approach based on ACCs (agent coordination contexts). The conceptual framework for an RBAC-MAS infrastructure exploiting ACCs is subsequently formalized through a process-algebraic description of the main infrastructure entities: This is meant to serve as a formal specification of both the infrastructure and the language for expressing roles, operations, and policies in RBAC-MAS.
Linear mixed models with skew-elliptical distributions: A Bayesian approach
Authors: Alejandro Jara, Fernando Quintana, Ernesto San Martín
Venue: Computational Statistics Data Analysis (2008)

Normality of random effects and error terms is a routine assumption for linear mixed models. However, such an assumption may be unrealistic, obscuring important features of within- and among-unit variation. A simple and robust Bayesian parametric approach that relaxes this assumption by using a multivariate skew-elliptical distribution, which includes the Skew-t, Skew-normal, t-Student, and Normal distributions as special cases and provides flexibility in capturing a broad range of non-normal and asymmetric behavior is presented. An appropriate posterior simulation scheme is developed and the methods are illustrated with an application to a longitudinal data example.
Semistrong edge coloring of graphs
Authors: András Gyárfás, Alice Hubenko
Venue: Journal of Graph Theory (2005)

Weakening the notion of a strong (induced) matching of graphs, in this paper, we introduce the notion of a semistrong matching. A matching M of a graph G is called semistrong if each edge of M has a vertex, which is of degree one in the induced subgraph G[M]. We strengthen earlier results by showing that for the subset graphs and for the Kneser graphs the sizes of the maxima of the strong and semistrong matchings are equal and so are the strong and semistrong chromatic indices. Similar properties are conjectured for the n-dimensional cube. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 39&ndash;47, 2005
Energy-efficient MESI cache coherence with pro-active snoop filtering for multicore microprocessors
Authors: Avadh Patel, Kanad Ghose
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We present a snoop filtering mechanism for multicore microprocessors that implement coherent caches using the MESI protocol. The relatively small filter structure at each core maintains coarse-grain sharing information about regions within a page to filter out snoops. On broadcast, the sharing status of all regions within the page is collected proactively and up to 90% of unnecessary snoops are eliminated. The energy savings resulting from snoop filtering in our scheme average about 30% across the benchmarks studied for both a quad core design in 65 nm and 8-core design in 45 nm CMOS.
A citation analysis of the sigcse 2007 proceedings
Authors: Raymond Lister, Ilona Box
Venue: ACM SIGCSE Bulletin (2008)

This paper identifies the most commonly cited conferences, journals and books among the 1398 citations made in the 122 publications of the SIGCSE 2007 proceedings. The SIGCSE 2007 authors cited a very large array of conferences, journals and books, but the majority are only cited within a single paper. There are only a very small set of journals and conferences cited frequently. Most books cited are concerned with technical information or are textbooks. Only 2% of books are concerned with computer science education and 23% with education in general. The picture that emerges from this citation analysis is that the SIGCSE community does not have a substantial core set of educational literature. Also, the epistemology of the SIGCSE community is primarily objectivist, with a focus on content, rather than a constructivist, student-centered focus on learning.
Grid Resource Abstraction, Virtualization, and Provisioning for Time-Targeted Applications
Authors: Yang-suk Kee, Carl Kesselman
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

As a variety of science applications are integrated with large-scale HPDC (High Performance Distributed Com-puting) technologies, timely resource allocation is re-vealed as a critical requirement to be considered. This paper introduces a new HPDC resource management paradigm named resource slot which defines a network of logical machines across time and space. A resource slot is not only a resource programming target but also a virtualized resource provisioning framework for a variety of resource management paradigms by encapsulating the resource management complexity. Especially, we present a resource provisioning technique named guided redun-dant submission (GRS), which probabilistically guarantees a timely resource slot allocation. Experimental results performed against 8 clusters in production show that about 5 redundant resources per slot can secure slot allo-cation with up to 36 logical machines, each cluster having an availability probability as low as 0.25 and the target success probability of slot allocation is 0.95.
Comparative Studies Made Simple in GPFlow
Authors: Lawrence Buckingham, James M. Hogan, Paul Roe, Jiro Sumitomo, Michael Towsey
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Bioinformatic sequence data is typically analyzed via a pipeline of tools which may be realized manually or through some kind of script or workflow system. The explosive increase in the number of genomes available has made single sequence analyses almost obsolete. Bioinformaticians now wish to compare and analyze multiple versions of similar sequences, and the greater statistical significance afforded by automated comparisons is vital to scientific investigation.This work describes recent extensions to the GPFlow scientific workflow system [1] in development at MQUTeR (www.mquter.qut.edu.au), which facilitate interactive experimentation, automatic lifting of computations from single-case to collection-oriented computation and automatic correlation and synthesis of collections. A GPFlow workflow presents as an acyclic data flow graph, yet provides powerful iteration and collection formation capabilities.
Enhancing timing-driven FPGA placement for pipelined netlists
Authors: Ken Eguro, Scott Hauck
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

FPGA application developers often use pipelining, C-slowing and retiming to improve the performance of their designs. Unfortunately, registered netlists present a fundamentally different problem to CAD tools, potentially limiting the benefit of these techniques. In this paper we discuss some of the inherent issues pipelined netlists pose to existing timing-driven placement approaches. We then present two algorithmic modifications that reduce post-routing critical path delay by an average of 40%.
Rough set uncertainty for robotic systems
Authors: Mayukh Bit, Theresa Beaubouef
Venue: Journal of Computing Sciences in Colleges (2008)

The paper provides an overview of the various applications of rough set theory in dealing with uncertainty in modern robotic systems. Rough sets is a relatively young theory that has been gaining popularity in the field of artificial intelligence, and that has direct contribution for the advancement of robotics. This paper provides an introduction to robotics, explains the basics of rough set theory, discusses the various successful applications existing currently in the field of robotics systems, and suggests new areas of robotics that can benefit from rough set techniques.
Energy-Efficient Real-Time Co-scheduling of Multimedia DSP Jobs
Authors: Chien-Wei Chen, Chuan-Yue Yang, Tei-Wei Kuo, Ming-Wei Chang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

While DSP's are now widely adopted in many embedded systems in the cost minimization and the resolving of computing needs of various multimedia applications, little work is done for energy-efficient real-time job scheduling over DSP's. As motivated by the needs, a set of sliding-window-based algorithms are proposed. A sequence of time points and their corresponding processor speeds is generated to run jobs of a periodic task on the DSP, such as that for the decoding of an H.264 stream. An online DVS scheme for energy minimization with constrained buffer size consideration is proposed, and the capability of the scheme is evaluated by a series of experiments over real and synthesized traces. It was shown that the energy saving can be up to 44%, and prediction errors were not significant enough to result in more than 3% in deadline missing.
Toward an understanding of flow in video games
Authors: Ben Cowley, Darryl Charles, Michaela Black, Ray Hickey
Venue: Computers in Entertainment (CIE) (2008)

In the domain of computer games, research into the interaction between player and game has centred on 'enjoyment', often drawing in particular on optimal experience research and Csikszentmihalyi's 'Flow theory'. Flow is a well-established construct for examining experience in any setting and its application to game-play is intuitive. Nevertheless, it's not immediately obvious how to translate between the flow construct and an operative description of game-play. Previous research has attempted this translation through analogy. In this article we propose a practical, integrated approach for analysis of the mechanics and aesthetics of game-play, which helps develop deeper insights into the capacity for flow within games. The relationship between player and game, characterized by learning and enjoyment, is central to our analysis. We begin by framing that relationship within Cowley's user-system-experience (USE) model, and expand this into an information systems framework, which enables a practical mapping of flow onto game-play. We believe this approach enhances our understanding of a player's interaction with a game and provides useful insights for games' researchers seeking to devise mechanisms to adapt game-play to individual players.
A faceted interface for multimedia search
Authors: Robert Villa, Nicholas Gildea, Joemon M. Jose
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

With the rapid increase in online video services, video retrieval systems are becoming increasingly important search tools to many users in many different fields. In this poster we present a novel video retrieval interface, which supports the creation of multiple search "facets", to aid users carrying out complex, multi-faceted search tasks. The interface allows multiple searches to be executed and viewed simultaneously, and allows material to be reorganized between the facets. An experiment is presented which compares the faceted interface to a tabbed interface similar to that on modern web browsers, and some preliminary results are given.
AdImage: video advertising by image matching and ad scheduling optimization
Authors: Wei-Shing Liao, Kuan-Ting Chen, Winston H. Hsu
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

With the prevalence of recording devices and the ease of media sharing, consumers are embracing huge amounts of Internet videos. There arise the needs for effective video advertisement systems following their phenomenal success in text. We propose a novel advertising system, AdImage, which automatically associates relevant ads by matching characteristic images, referred to as adImages (analogous to adWords) here. The proposed image matching method is invariant to certain distortions commonly observed in shared videos. AdImage also avoids the pitfalls of poor tagging qualities in shared videos and provides a brand-new venue to specify ad targets by image objects. Moreover, we formulate the image matching scores and the parameterized bidding information as a nonlinear optimization problem for maximizing the system revenues and user perception.
Interfaces for team coordination
Authors: Romeo Sanchez, Jing Jin, Rajiv T. Maheswaran, Pedro Szekely
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Coordinators are intelligent software agents that help humans to collaborate and coordinate execution of multiple activities in dynamic, distributed and uncertain domains. One of the main challenges is the generation of effective user interfaces for team coordination. Intelligent interfaces that avoid information overload, and facilitate user interactions to repair mission plans are needed, and they are the focus of this work.
Automated Registration Evaluation System (ARES)
Authors: Derek Lewis, Stuart Bergeron, Melissa Kim, Peter Doucette
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

This paper describes the Automated Registration Evaluation System (ARES). The goal of the ARES is to dramatically reduce the cost of evaluating different automated data (raster and/or vector) registration technologies. Under the first year of the ARES project,five different automated registration methods were selected for evaluation. These methods represented the state-of-the-art in automated image-to-image registration and image-to-3D feature registration. During the first year of testing, over two terabytes of commercial imagery and GIS feature (vector) data were acquired. ARES performed over 4000 individual registration test cases among the five different automated registration methods. ARES was able to ascertain the operating conditions and performance of each of these methods against a wide range of user requirements. Results from ARES suggest that automated image-to-image matching for near-nadir satellite imagery (with good initial approximations) is essentially a solved research problem, whereas feature-to-image matching is not.
L-MMIRA: Light Multicast Minimal Interference Routing Module in MPLS Network
Authors: Li Xuan, Liu Ying
Venue: Proceedings of the Seventh International Conference on Networking (2008)

LSP path selection problem in MPLS network has been a hot research field. For unicast, there are already many algorithms to solve it, making the network more resource balanced and useable. Among these algorithms, Minimal Interference Routing Algorithm (MIRA) is the most valued one. This paper presents a novel algorithm for multicast LSP setting upproblem based on MIRA, which replaces Maxflow with K time Dijkstra algorithm, and the experiment result shows it achieves much less complexity than traditional algorithm MIRA while providing a good conflict avoiding mechanism.
A spheroidal control volume for the quantitative measurement of regurgitant flow by cardiac MRI
Authors: Eduardo Kortright, Geetha Rayarao, Longchuan Li, Andreas S. Anayiotos, Robert W. W. Biederman, Mark Doyle
Venue: Technology and Health Care (2008)

Purpose: We sought to show that a spheroidally shaped control volume (CV), formed from a minimal MRI data set, can be used to measure regurgitant flow through a defective cardiac valve consistently and accurately under a variety of flow conditions. Materials and Methods: Using a pulsatile flow pump and phantoms simulating severe valvular regurgitation, we acquired 31 scans of two or three radially oriented slices, using a variety of flow waveforms and regurgitant volumes of 12 to 55 ml. Data sets included high- and low-resolution scans, and variable-rate sparse sampling was also applied to reduce the scan time. An oblate spheroid was placed in the pump chamber opposite the jet and fit as tightly as possible to isomagnitude velocity contours at 25% of the velocity encoding limit. Results: Normalized regurgitant volumes (NRVs) expressed as a percentage of the pump setting were obtained from the product of the spheroid surface area with the velocities normal to it. Mean &plusmn; SD NRV values were 96.8 &plusmn; 6.6% for all scans. Imaging times in the breath-hold range were obtained using reduced resolution and variable-rate sparse sampling approaches without significant degradation in accuracy. Conclusion: In our preliminary findings, the spheroidal CV method showed clear potential for the development of a robust, clinically feasible technique for the measurement of regurgitant volume.