ppxscal/embedding_network huggingface dataset:
A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs
Authors: Cesim Erten, Melih Sözdinler
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Clustering refers to the process of organizing a set of input vectors into clusters based on similarity defined according to some preset distance measure. In many cases it is more desirable to simultaneously cluster the dimensions as well as the vectors themselves. This special instance of clustering, referred to as biclustering, was introduced by Hartigan [3]. It has many applications in areas including data mining, pattern recognition, and computational biology. Considerable attention has been devoted to it from the gene expression data analysis; see [5] for a nice survey. Input is represented in a data matrix, where the rows and columns of the matrix correspond to genes and conditions respectively. Each entry in the matrix reflects the expression level of a gene under a certain condition. From a graph-teoretical perspective the data matrix can be viewed as a weighted bipartite graph, where the vertex set of one partition is the set of genes and the vertex set of the other partition is the set of conditions. An existing weighted edge incident on a gene-condition pair reflects the expression level of the gene under that specific experimental condition. The biclustering problem may then be described in terms of the various versions of the biclique extraction problem in bipartite graphs. Many interesting versions that directly apply to the biclustering problem are NP-hard [4]. Various graph-theoretical approaches employing heuristics have been suggested [1,4,6,7].
Zero loads: canceling load requests by tracking zero values
Authors: Mafijul Md. Islam, Per Stenstrom
Venue: Proceedings of the 9th workshop on MEmory performance: DEaling with Applications, systems and architecture (2008)

The considerable gap between processor and DRAM speed and the power losses in the cache hierarchy calls for more efficient approaches. Broadly speaking, cache-hierarchy efficiency can be increased either by improving cache management or by reducing the number of load instructions that reach the cache hierarchy. We introduce the notion of zero loads to approach the latter. This paper explores the potential of tracking locations that contain the value 'zero'. Loads directed to such locations -- termed Zero Loads -- can be cancelled before they are issued in the cache hierarchy. We find that as many as 21% of the loads are Zero Loads and about one third of them are critical, i.e., ends up on the critical memory path for out-of-order cores. Motivated by this observation, we explore two innovative structures to capture Zero Loads by essentially book-keeping earlier visited blocks/locations that return 'zero'. These schemes are shown to be capable of improving performance and power/energy efficiency considerably.
Concurrency Analysis for Real Time MPEG-4 Video Encoding
Authors: Anastasios Hamosfakidis, Yakup Paker
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The problem of scheduling MPEG-4 video objects for real-time encoding on to parallel architectures is studied. Concurrency is a basic feature in the MPEG-4 video encoding due to the nature of the standard that deals with object-oriented coding. It is shown the need for the analysis of the MPEG-4 video encoder and the design of a scheduler that exploits the MPEG-4 concurrency. A real-time MPEG-4 scheme should take into account characteristics such as VOPs deadlines, precedence constraints, and encoding complexity issues. We formulate the problem of the parallel MPEG-4 video encoding and determine and analyse the characteristics and conditions that the MPEG-4 heuristic solution has to satisfy. Also the acceptable video object encoding patterns, used at the video encoding are defined. Finally an outline of our proposed scheduling scheme is presented.
Framing design in the third paradigm
Authors: Salu Ylirisku, Virtu Halttunen, Johanna Nuojua, Antti Juustila
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper develops vocabulary to discuss the phenomena related to the new design paradigm, which considers designing as a situated and constructive activity of meaning making rather than as problem solving. The paper studies how design projects proceed from the fuzzy early phases towards the issues of central relevance to designing. A central concept is framing, and it is elaborated with examples from two case studies. Several aspects of framing are explicated, exploratory, anticipatory and social framing, and related concepts of 'focusing', 'priming', and 'grounding' are explained. The paper concludes that understanding designing as a situated and constructive making of meaning has bearings on how designing needs to be supported.
Towards Automated Privacy Compliance in the Information Life Cycle
Authors: Rema Ananthanarayanan, Ajay Gupta, Mukesh Mohania
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

Management of data is an increasingly challenging task for enterprises because of the increasingly diverse and complex requirements that come to bear from various fronts. One issue is the protection of the privacy of the information held, while ensuring compliance with various rules and regulations relating to data management.One issue is the protection of the privacy of the information held, while ensuring compliance with various rules and regulations relating to data management. Privacy may be defined as the claim of individuals, groups and institutions to determine for themselves when, how and to what extent information about them is communicated to others. In its broadest scope this is a problem that has challenged civil rights advocates the world over, at different times.
Pedagogical resources management for e-learning
Authors: Daniel Hunyadi, Iulian Pah
Venue: WSEAS Transactions on Information Science and Applications (2009)

E-learning leads to evolutions in the way of designing a course. Diffused through the web, the course content cannot be the direct transcription of a face to face course content. A course can be seen as an organization in which different actors are involved. These actors produce documents, information and knowledge that they often share. We present in this paper an ontology-based document-driven memory which is particularly adapted to an e-learning situation. The utility of a shared memory is reinforced in this kind of situation, because the interactions do not usually occur in the same place and in the same time. First we precise our conception of e-learning and we analyze actors needs. Then we present the main features of our learning organizational memory and we focus on the ontologies on which it is based. We consider two kinds of ontologies: the first one is generic and concerns the domain of training; the second one is related to the application domain and is specific to a particular training program. We present our approach for building these ontologies and we show how they can be merged.
An experience report on the design and delivery of two new software design courses
Authors: Alex Baker, André van der Hoek
Venue: ACM SIGCSE Bulletin (2009)

In this paper, we report on our experience in designing and deliv-ering two new software design courses in the Informatics major at UC Irvine. When the major was created in 2004, it explicitly con-tained slots for two software design courses to be created from the ground up. The authors led this effort, focusing one course on the topic of system design and one course on the topic of implementation design. We discuss the philosophy and pedagogy behind the courses, present key class activities, and reflect on having offered each course twice over the past two years.
Process-centered knowledge model and enterprise ontology for the development of knowledge management system
Authors: Kwan Hee Han, Jun Woo Park
Venue: Expert Systems with Applications: An International Journal (2009)

Among many enterprise assets, knowledge is treated as a critical driving force for attaining enterprise performance goals. This is because knowledge facilitates the better business decision makings in a timely fashion. However, since knowledge is created and utilized during the execution of business processes, if knowledge is separated from the business process context, it does not lead to the ability to take the right action for target performance. This paper proposes the framework for process-centered knowledge model and enterprise ontology for the context-rich and networked knowledge storage and retrieval required during task execution. The enterprise knowledge object for a process-centered knowledge model is classified into two types: process knowledge and task support knowledge. In the proposed enterprise ontology, which represents major enterprise concepts, and the relationships between them, all domain concepts are related to the ''process'' concept, both directly and indirectly. As a result, networked and sophisticated knowledge, rather than single-level knowledge, is provided to the participant of unit activity. In order to show the applicability of the proposed framework, a process-centered KMS (knowledge management system) was also developed, which is classified into 3 parts: (1) project management sub-system based on process knowledge. (2) Knowledge management sub-system for maintaining task support knowledge. (3) Infrastructure sub-system which supports the above two sub-systems.
Forecasting the output of integrated circuit industry using genetic algorithm based multivariable grey optimization models
Authors: Li-Chang Hsu
Venue: Expert Systems with Applications: An International Journal (2009)

Accurate and immediate forecast in the short product life cycle of semiconductor market is difficult, but important. This paper proposed a grey model with factor analysis techniques to deal with the multi-factor forecasting problems. In the grey modeling, the use of genetic algorithm has the ability to search global optimum solution to construct two improved multivariable grey forecasting models that are AGAGM(1,N) and GAGM(1,N). These two models are applied for forecasting Taiwanese integrated circuit output. The results of the factor analysis show that the major factors of Taiwan's integrated circuit output comprise R&D intensity, foreign investment, index of industrial production, trade specialization coefficient, and intra-industry trade coefficient. The improved multivariable grey forecasting models are found to be feasible and effective.
Towards automated requirements prioritization and triage
Authors: Chuan Duan, Paula Laurent, Jane Cleland-Huang, Charles Kwiatkowski
Venue: Requirements Engineering (2009)

Time-to-market deadlines and budgetary restrictions require stakeholders to carefully prioritize requirements and determine which ones to implement in a given product release. Unfortunately, existing prioritization techniques do not provide sufficient automation for large projects with hundreds of stakeholders and thousands of potentially conflicting requests and requirements. This paper therefore describes a new approach for automating a significant part of the prioritization process. The proposed method utilizes data-mining and machine learning techniques to prioritize requirements according to stakeholders&#x2019; interests, business goals, and cross-cutting concerns such as security or performance requirements. The effectiveness of the approach is illustrated and evaluated through two case studies based on the requirements of the Ice Breaker System, and also on a set of stakeholders&#x2019; raw feature requests mined from the discussion forum of an open source product named SugarCRM.
Automatic camera effects system (ACES)
Authors: Steven N. Crane, R. David Snyder
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The need to achieve realism in theatrical motion pictures with miniature models requires precise positioning, close tolerances, and a high degree of repeatability. A particular movement of the camera and the subject(s) may be repeated several times to create mattes or other special effects involving multiple exposures. Traditionally, miniatures photography has been performed "by hand." Each frame would be set up and shot individually, a tedious and time consuming procedure. Effects work of this sort was very expensive and required special skills and lots of patience; consequently, very little of this type of filming was done. The introduction of electronic, and recently computerized, motion control has tremendously advanced the state of the art. It is now possible to create effects relatively easily and inexpensively that a few years ago would not have been feasible. Electronic motion control enables the film maker to control the orientation of the camera and subject to a high degree of precision and move the system through several degrees of freedom.
Drawing slicing graphs with face areas
Authors: Akifumi Kawaguchi, Hiroshi Nagamochi
Venue: Theoretical Computer Science (2009)

We consider orthogonal drawings of a plane graph G with specified face areas. For a natural number k, a k-gonal drawing of G is an orthogonal drawing such that the boundary of G is drawn as a rectangle and each inner face is drawn as a polygon with at most k corners whose area is equal to the specified value. In this paper, we show that every slicing graph G with a slicing tree T and a set of specified face areas admits a 10-gonal drawing D such that the boundary of each slicing subgraph that appears in T is also drawn as a polygon with at most 10 corners. Such a drawing D can be found in linear time.
Conservativity for Logics of Justified Belief
Authors: Robert S. Milnikel
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

In [1], Fitting showed that the standard hierarchy of logics of justified knowledge is conservative (e.g. a logic with positive introspection operator ! is conservative over the logic without !). We do the same with most logics of justified belief, but taking a semantic approach rather than Fitting's syntactic one. A brief example shows that conservativity does not hold for logics of justified consistent belief.
A metric of estimation quality
Authors: Tom DeMarco
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper reports on a metric of the estimating process called Estimating Quality Factor (EQF). EQF is used to gauge progress in estimating technique and to provide an easily measurable standard for good estimating.
Using LDAP as a Management Solution for Distributed OSGi
Authors: Tobias Wegner, Frank Uptmoor, Jürgen Kemper
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper we propose a convenient way to supervise and control a distributed OSGi framework without using a central backend solution, which would add a single point of failure to the system. This is achieved by using LDAP and by benefiting from its replication and referral mechanisms. We also show how bundle migration can be done in such an environment for the purpose of enhancing scalability and reliability of the framework. At the end of this paper we prove the applicableness by testing our implementation in a simple scenario and give a perspective of what can be done in the future.
Scalable proxy mobile IPv6 for heterogeneous wireless networks
Authors: Huu-Nghia Nguyen, Christian Bonnet
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This work uses a cluster-based approach to provide scalability for Proxy Mobile IPv6 in large heterogeneous wireless network. We also propose an enhanced network-based IP-layer movement detection mechanism which allows the network to detect the attachment and the movement of each Mobile Node independently from the access technologies, without any special software support from Mobile Nodes. We implement these extensions on top of Mobile IPv6 for Linux (MIPL) v2.0. An evaluation of Proxy Mobile IPv6 in a cluster based Wireless Mesh Network is provided as a use case: we construct a virtual IPv6 Wireless Mesh Network using User-mode Linux (UML) ad Ns-2 Emulation and provide some early qualitative results to prove the correctness and the advantages of the proposals.
Software defined mobile networks
Authors: Nick McKeown
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

There is a general trend towards "cleaving apart" computer and networking systems, abstracting the layers below, and providing a platform for competition and innovation above. For computers this happened first with operating systems, and now virtualization. In wireless, software defined radios promise greater programmability, and faster innovation. But in-between, in the network, where the division of responsibility between hardware and software is less clear, the right programmable platform has been elusive, as we have explored active networks, network processors, and software routers. An emerging trend indicates that more and more of the infrastructure - for wired and wireless networks - will be defined in software outside the datapath. This is great news for researchers as the infrastructure will be more open, more programmable, and virtualized to allow experimental networks to co-exist on the same datapath. This is great news for the industry, as it will accelerate innovation. It may also lead to the separation of network service providers from the underlying infrastructure. This talk will be a call to arms for us all to embrace and help this trend along, as it makes the network a better place for all. I will also describe some of the steps we are taking at Stanford in this direction.
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
Authors: Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adjacent nodes are vertically visible to each other. If G is a plane graph, i.e., a planar graph equipped with a planar embedding, a visibility representation of G has the additional requirement of reflecting the given planar embedding of G. For the case that G is an n-node four-connected plane graph, we give an O(n)-time algorithm to produce a visibility representation of G with height at most $\left\lceil\frac{n}{2}\right\rceil+2\left\lceil\sqrt{\frac{n-2}{2}}\right\rceil$. To ensure that the first-order term of the upper bound is optimal, we also show an n-node four-connected plane graph G, for infinite number of n, whose visibility representations require heights at least $\frac{n}{2}$.
Self-calibration using a particular motion of camera
Authors: A. Saaidi, A. Halli, H. Tairi, K. Satori
Venue: WSEAS Transactions on Computer Research (2008)

In this article, we are interested in the camera self-calibration from three views of a 3-D scene. The originality of our method resides in the new technique used to estimate the homography of the plane at infinity by the minimization of a non-linear cost function that is based on a particular motion of the camera "translation and small rotation". Our approach also permits to calculate the camera parameters and the depths of interest points detected in the images. Experimental results demonstrate the performance of our algorithms, in term of precision and convergence.
Human and organizational factors in security screening and inspection systems: conceptual framework and key research needs
Authors: Sara Kraemer, Pascale Carayon, Thomas F. Sanquist
Venue: Cognition, Technology and Work (2009)

This paper presents a macroergonomic conceptual framework for human and organizational factors in security screening and inspection (SSI) systems of cargo and passengers across three transportation modes: air, rail, and sea. The framework categorizes human and organizational factors into five categories of the SSI work system: organization, operational environment, individual or operator, tasks and workload, and SSI tools and technologies. The framework is an expanded description of human and organizational factors in each transportation mode with key areas for human factors research in SSI systems. Research recommendations and implications for the intelligent design and intelligent support of SSI systems include organizational and job design of SSI systems, roles of human error and violations in SSI systems, and design of effective alarm systems.
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Authors: M. Ferrer, E. Valveny, F. Serratosa
Venue: Pattern Recognition Letters (2009)

Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.
Recording and Modeling Paleolithic Caves through Laser Scanning
Authors: D. Gonzalez-Aguilera, A. L. Muñoz, J. G. Lahoz, J. S. Herrero, M. S. Corchón, E. García
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

This paper deals with the application of a non-destructive technique, terrestrial laser scanner, for the recording and modeling of rock art at caves. Two emblematic paleolithic caves have been tested using this technology: ‘Las Caldas’ cave, declared Good of Cultural Interest in the 70’s and nowadays, Protected Natural Area; and ‘Peña de Candamo’ cave, declared National Monument from the XXth century beginnings. Both caves share the same geographical context, the north of Spain (Asturias region), and belong to the most brilliant Upper Paleolithic period: Middle Magdalenian (ca. 14,000 BP). As a result, a metric laser model is generated which allow to the prehistorian works in three different levels, integrating different datasets belong to Paleolithic Art. From a basic level based on a metric 3D support with points cloud and polygonal models to a digital archiving of rock art at caves and even the development of virtual and interactive environments.