ppxscal/embedding_network huggingface dataset:
Interactive Color Palette Tools
Authors: Barbara J. Meier, Anne Morgan Spalter, David B. Karelitz
Venue: IEEE Computer Graphics and Applications (2004)

Color is fundamental in computer graphics imagery. But despite the importance of good color selection and the difficulty most people have making those color selections, current graphics applications provide only minimal tools for mixing and organizing colors; exploring color combinations; and soliciting historical, theoretical, or expert sources.This article describes a new tool set that addresses these needs. The tools are based on artists' methods, perceptual science, and a task analysis survey conducted by the authors. With these tools, users can quickly experiment with color within the context of their compositions to arrive at deliberate, confident selections. The article describes the tools' rationale, inner workings, and interfaces, and discusses important implementation issues.
Ab initio investigation of structures and properties of mixed silicon-potassium Si$_{n}$K$_{p}$ and Si$_{n}$K$_{p}^{+}$ (n &les;6, p&leq; 2) clusters
Authors: F. Rabilloud, C. Sporea
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The Si$_{n}$K$_{p}^{(+)}$ (n &les; 6, p &les;2) clusters with different spin configurations have been systematically investigated by using the density functional theory with B3LYP. Equilibrium geometries, population analysis, binding energies, adiabatic and vertical ionization potentials as well as electric dipole moments and static dipolar polarizabilities, have been calculated and are discussed for each considered size. For the most stable isomers, the structure of the neutral Si$_{n}$K$_{p}$ and cationic Si$_{n}$K$_{p}^{+}$ clusters are found to keep the frame of the corresponding Si$_{n}$, potassium atoms being adsorbed at the surface. The localization of the potassium cation is not the same one as that of the neutral atom. K$^{+}$ ion is preferentially located on a Si atom while the K atom is preferentially attached at a bridge site. The population analysis show that the electronic structure of Si$_{n}$K$_{p}$ can be described as Si$_{n}^{p-} + p K^{+}$ for the small sizes considered here. Binding energies and ionization potentials are compared to those of sodium and lithium-doped silicon clusters.
Multi-constraint Security Policies for Delegated Firewall Administration
Authors: Cássio Ditzel Kropiwiec, Edgard Jamhour, Manoel C. Penna, Guy Pujolle
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

This work presents a new policy based security framework that is able handle simultaneously and coherently mandatory, discretionary and security property policies. One important aspect of the proposed framework is that each dimension of the security policies can be managed independently, allowing people playing different roles in an organization to define security policies without violating a global security goal. The framework creates an abstract layer that permits to define security policies independently of how they will be enforced. For example, the mandatory and security property polices could be assigned to the risk management staff while the discretionary policies could be delegated among the several departments in the organization.
From CMMI to SPICE --- Experiences on How to Survive a SPICE Assessment Having Already Implemented CMMI
Authors: Fabio Bella, Klaus Hörmann, Bhaskar Vanamali
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Dealing with multiple models for process assessment and improvement is a challenging, time-consuming task. In the automotive sector, for example, several suppliers drive their process improvement on the basis of CMMI®. However, many car manufacturers require process capability ratings determined on the basis of Automotive SPICETM. The approach presented aims at preparing organizations already working according to CMMI for Automotive SPICE assessments. The approach was already successfully applied in industrial settings and lessons learned are discussed. The approach helps to avoid misunderstandings during assessments due to different model taxonomy, achieve appropriate process ratings, and save both effort and costs.
Multispeaker Localization and Tracking in Intelligent Environments
Authors: C. Segura, A. Abad, J. Hernando, C. Nadeu
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

Automatic speaker localization is an important task in several applications such as acoustic scene analysis, hands-free videoconferencing or speech enhancement. Tracking speakers in multiparty conversations constitutes a fundamental task for automatic meeting analysis. In this work, we present the acoustic Person Tracking system developed at the UPC for the CLEAR'07 evaluation campaign. The designed system is able to track the estimated position of multiple speakers in a smart-room environment. Preliminary speaker locations are provided by the SRP-PHAT algorithm, which is known to perform robustly in most scenarios. Data association techniques based on trajectory prediction and spatizal clustering are used to match the raw positional estimates with potential speakers. These positional measurements are then finally spatially smoothed by means of Kalman filtering. Besides the technology description, experimental results obtained on the CLEAR'07 CHIL database are also reported.
Automated Complexity Analysis Based on the Dependency Pair Method
Authors: Nao Hirokawa, Georg Moser
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but significantly extends the analytic power of existing direct methods. Our findings extend the class of TRSs whose linear or quadratic runtime complexity can be detected automatically. We provide ample numerical data for assessing the viability of the method.
Using Semantic Features to Improve Task Identification in Email Messages
Authors: Shinjae Yoo, Donna Gates, Lori Levin, Simon Fung, Sachin Agarwal, Michael Freed
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Automated identification of tasks in email messages can be very useful to busy email users. What constitutes a task varies across individuals and must be learned for each user. However, training data for this purpose tends to be scarce. This paper addresses the lack of training data using domain-specific semantic features in document representation for reducing vocabulary mismatches and enhancing the discriminative power of trained classifiers when the number of training examples is relatively small.
Nominal Unification from a Higher-Order Perspective
Authors: Jordi Levy, Mateu Villaret
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables are treated as atoms, and only free variables are proper unknowns in nominal unification. This allows "variable capture", breaking a fundamental principle of lambda-calculus. Despite this difference, nominal unification can be seen from a higher-order perspective. From this view, we show that nominal unification can be reduced to a particular fragment of higher-order unification problems: higher-order patterns unification. This reduction proves that nominal unification can be decided in quadratic deterministic time.
Brief paper: On the constrained small-time controllability of linear systems
Authors: Mikhail I. Krastanov
Venue: Automatica (Journal of IFAC) (2008)

This note presents a necessary and sufficient condition for small-time controllability of a linear system with respect to a cone. This result extends the controllability conditions for linear systems to the case of control and phase constraints.
Watch-and-comment as a paradigm toward ubiquitous interactive video editing
Authors: Renan G. Cattelan, Cesar Teixeira, Rudinei Goularte, Maria Da Graça C. Pimentel
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

The literature reports research efforts allowing the editing of interactive TV multimedia documents by end-users. In this article we propose complementary contributions relative to end-user generated interactive video, video tagging, and collaboration. In earlier work we proposed the watch-and-comment (WaC) paradigm as the seamless capture of an individual's comments so that corresponding annotated interactive videos be automatically generated. As a proof of concept, we implemented a prototype application, the WaCTool, that supports the capture of digital ink and voice comments over individual frames and segments of the video, producing a declarative document that specifies both: different media stream structure and synchronization. In this article, we extend the WaC paradigm in two ways. First, user-video interactions are associated with edit commands and digital ink operations. Second, focusing on collaboration and distribution issues, we employ annotations as simple containers for context information by using them as tags in order to organize, store and distribute information in a P2P-based multimedia capture platform. We highlight the design principles of the watch-and-comment paradigm, and demonstrate related results including the current version of the WaCTool and its architecture. We also illustrate how an interactive video produced by the WaCTool can be rendered in an interactive video environment, the Ginga-NCL player, and include results from a preliminary evaluation.
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
Authors: Mathias Möhl, Sebastian Will, Rolf Backofen
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is NP-hard, the algorithmic complexity adapts to the complexity of the RNA structures. Due to fixed parameter tractability, we can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm can be considered as a generalization of the algorithm of Jiang et al. [1] to arbitrary pseudoknots. In their absence, it gracefully degrades to the same polynomial algorithm. A prototypical implementation demonstrates the applicability of the method.
Identifying Corresponding Lesions from CC and MLO Views Via Correlative Feature Analysis
Authors: Yading Yuan, Maryellen Giger, Hui Li, Li Lan, Charlene Sennett
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In this study, we present a computerized framework to identify the corresponding image pair of a lesion in CC and MLO views, a prerequisite for combining information from these views to improve the diagnostic ability of both radiologists and CAD systems. A database of 126 mass lesons was used, from which a corresponding dataset with 104 pairs and a non-corresponding dataset with 95 pairs were constructed. For each FFDM image, the mass lesions were firstly automatically segmented via a dual-stage algorithm, in which a RGI-based segmentation and an active contour model are employed sequentially. Then, various features were automatically extracted from the lesion to characterize the spiculation, margin, size, texture and context of the lesion, as well as its distance to nipple. We developed a two-step strategy to select an effective subset of features, and combined it with a BANN to estimate the probability that the two images are of the same physical lesion. ROC analysis was used to evaluate the performance of the individual features and the selected feature subset for the task of distinguishing corresponding and non-corresponding pairs. With leave-one-out evaluation by lesion, the distance feature yielded an AUC of 0.78 and the feature subset, which includes distance, ROI-based energy and ROI-based homogeneity, yielded an AUC of 0.88. The improvement by using multiple features was statistically significant compared to single feature performance (p < 0.001).
Wrapping of Soft IPs for Interface-based Design Using Heterogeneous Metaprogramming
Authors: Robertas Damaševičius Vytautas Štuikys
Venue: Informatica (2003)

We discuss the application of heterogeneous metaprogramming (MPG) for the interface-based design, which deals with the synthesis of the communication interfaces between Intellectual Property components (IPs). Heterogeneous MPG is based on the simultaneous usage of a domain language for describing domain functionality and a metalanguage for developing generic components and program generators. We present a design framework based on the MPG techniques. The novelty of our approach is that we apply the concept of heterogeneous MPG for the automatic generation of IP wrappers for communication between the third-party soft IPs systematically. We present a case study for the synthesis of the communication interfaces using a FIFO protocol.
ONTRACK: Dynamically adapting music playback to support navigation
Authors: Matt Jones, Steve Jones, Gareth Bradley, Nigel Warren, David Bainbridge, Geoff Holmes
Venue: Personal and Ubiquitous Computing (2008)

Listening to music on personal, digital devices whilst mobile is an enjoyable, everyday activity. We explore a scheme for exploiting this practice to immerse listeners in navigation cues. Our prototype, ONTRACK, continuously adapts audio, modifying the spatial balance and volume to lead listeners to their target destination. First we report on an initial lab-based evaluation that demonstrated the approach's efficacy: users were able to complete tasks within a reasonable time and their subjective feedback was positive. Encouraged by these results we constructed a handheld prototype. Here, we discuss this implementation and the results of field-trials. These indicate that even with a low-fidelity realisation of the concept, users can quite effectively navigate complicated routes.
States on semi-divisible generalized residuated lattices reduce to states on MV-algebras
Authors: Janne Mertanen, Esko Turunen
Venue: Fuzzy Sets and Systems (2008)

A semi-divisible residuated lattice is a residuated lattice L satisfying an additional condition weaker than that of divisibility. Such structures are related to mathematical fuzzy logic as well as to extended probability theory by the fact that the subset of complemented elements induces an MV-algebra. We define generalized residuated lattices by omitting commutativity of the corresponding monoidal operation and study semi-divisibility in such structures. We show that, given a good generalized residuated lattice L, the set of complemented elements of L, denoted by MV(L), forms a pseudo-MV-algebra if and only if L is semi-divisible. Maximal filters on a semi-divisible generalized residuated lattice L are in one-to-one correspondence with maximal filters on MV(L). We study states on semi-divisible generalized residuated lattices. Riecan states on a semi-divisible generalized residuated lattice L are determined by Riecan states on MV(L). The same holds true for Bosbach states whenever L is a good divisible generalized residuated lattice. Extremal Riecan states on a semi-divisible generalized residuated lattice L are in one-to-one correspondence with maximal and semi-normal filters on L.
STARMIND: Automated Classification of Astronomical Data Based on an Hybrid Strategy
Authors: Alejandra Rodríguez, Iciar Carricajo, Minia Manteiga, Carlos Dafonte, Bernardino Arcay
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper describes the formulation and development of STARMIND, a hybrid system devoted to the automated classification of stellar spectra in the MK system. The MK system is an astronomical classification system used to cluster stars in morphological types based on stellar temperatures and luminosities. Our hybrid system is composed by a knowledge-based system that performs the first taxonomy in stellar types. A second-level system is based on Artificial Neural Networks and performs a more refined classification in stellar subtypes. Artificial Neural Networks were defined by selecting the optimal algorithms for training and architecture for each of the stellar spectra subtypes.
A New Method for Multi-objective TDMA Scheduling in Wireless Sensor Networks Using Pareto-Based PSO and Fuzzy Comprehensive Judgement
Authors: Tao Wang, Zhiming Wu, Jianlin Mao
Venue: Proceedings of the 3rd international conference on High Performance Computing and Communications (2007)

In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packet delay and the energy consumed on node state transition. To realize the scheme, a mapping between the problem and evolutionary algorithm is reasonably set up. A multi-objective particle swarm optimization based on Pareto optimality (PAPSO) is then proposed to solve such multi-objective optimization problem and find a better tradeoff between time delay and energy consumption. The simulation results validate the effectivity of PAPSO algorithm and also show that PAPSO outperforms other techniques in the literature.
A quotient-universal digital topology
Authors: Josef lapal
Venue: Theoretical Computer Science (2008)

We study a special topology on Z^2 and show that both the Marcus topology and the Khalimsky topology and also one more digital topology on Z^2 may be obtained as three of its quotient topologies. A quotient closure operator of the topology studied is discussed, too, and an analogue of the Jordan curve theorem for this closure operator is proved.
Efficient state transfer for hypervisor-based proactive recovery
Authors: Tobias Distler, Rüdiger Kapitza, Hans P. Reiser
Venue: Proceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems (2008)

Proactive recovery of replicated services is a novel approach that allows tolerating a potentially unlimited number of malicious faults during system lifetime by periodically restarting replicas from a correct state. Recovering a stateful replica requires a time-consuming transfer and verification of the state. During this time, the replica usually is unable to handle client requests. Our VM-FIT architecture harnesses virtualization to significantly reduce this service unavailability. Our approach allows recovery in parallel with service execution, and uses copy-on-write techniques and provides efficient state transfer support between virtual replicas on a host.
Combining regression and estimation by analogy in a semi-parametric model for software cost estimation
Authors: Nikolaos Mittas, Lefteris Angelis
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software Cost Estimation is the task of predicting the effort or productivity required to complete a software project. Two of the most known techniques appeared in literature so far are Regression Analysis and Estimation by Analogy. The results of the empirical studies show the lack of convergence in choosing the best prediction technique between the parametric Regression Analysis and the non-parametric Estimation by Analogy models. In this paper, we introduce the use of a semi-parametric model that achieves to incorporate some parametric information into a non-parametric model combining in this way regression and analogy. Furthermore, we demonstrate the procedure of building such a model on two well-known datasets and we present the comparative results based on the predictive accuracy of the new technique using several accuracy measures. We also perform statistical tests on the residuals in order to assess the improvement in the predictions attained through the new semi-parametric model in comparison to the accuracy of Regression Analysis and Estimation by Analogy when applied separately. Our results show that the semi-parametric model provides more accurate predictions than each one of the parametric and non-parametric approaches.
Building and applying geographical information system Grids
Authors: Galip Aydin, Ahmet Sayar, Harshawardhan Gadgil, Mehmet S. Aktas, Geoffrey C. Fox, Sunghoon Ko, Hasan Bulut, Marlon E. Pierce
Venue: Concurrency and Computation: Practice Experience (2008)

We discuss the development and application of Web-service-based geographical information system (GIS) Grids. Following the WS-I+ approach of building Grids on Web service standards, we have developed data Grid components for archival and real-time data, map generating services that can be used to build user interfaces, information services for storing both stateless and stateful metadata, and service orchestration and management tools. Our goal is to support dynamically assembled Grid service collections that combine both GIS services with more traditional Grid capabilities such as file transfer and remote code execution. We are applying these tools to problems in earthquake modeling and forecasting, but we are attempting to build general purpose tools by using and extending appropriate standards. Copyright &copy; 2008 John Wiley & Sons, Ltd.
The Quantum Complexity of Markov Chain Monte Carlo
Authors: Peter C. Richter
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Markov chain Monte Carlo (MCMC) is the widely-used classical method of random sampling from a probability distribution ¿ by simulating a Markov chain which "mixes" to ¿ at equilibrium. Despite the success quantum walks have been shown to have in speeding up random walk algorithms for search problems ("hitting") and simulated annealing, it remains to prove a general speedup theorem for MCMC sampling algorithms. We review the progress toward this end, in particular using decoherent quantum walks.