ppxscal/embedding_network huggingface dataset:
The ROI of systems engineering: Some quantitative results for software-intensive systems
Authors: Barry Boehm, Ricardo Valerdi, Eric Honour
Venue: Systems Engineering (2008)

This paper presents quantitative results on the return on investment of systems engineering (SE-ROI) from an analysis of the 161 software projects in the COCOMO II database. The analysis shows that, after normalizing for the effects of other cost drivers, the cost difference between projects doing a minimal job of software systems engineering&mdash; as measured by the thoroughness of its architecture definition and risk resolution&mdash; and projects doing a very thorough job was 18&percnt; for small projects and 92&percnt; for very large software projects as measured in lines of code. The paper also presents applications of these results to project experience in determining &lsquo;&lsquo;how much up front systems engineering is enough&rsquo;&rsquo; for baseline versions of smaller and larger software projects, for both ROI-driven internal projects and schedule-driven outsourced systems of systems projects. &copy; 2008 Wiley Periodicals, Inc. Syst Eng
Cloud Computing: Interview with Russ Daniels and Franco Travostino
Authors: Dejan Milojicic
Venue: IEEE Internet Computing (2008)

Milojicić discusses cloud computing with Russ Daniels, Vice President and Chief Technology Officer of Hewlett-Packard’s cloud services strategy, and Franco Travostino, a distinguished architect at eBay.
On the Relevance of Cellular Signaling Pathways for Immune-Inspired Algorithms
Authors: T. S. Guzella, T. A. Mota-Santos
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

In this conceptual paper, we discuss the relevance of cellular signaling pathways for immune-inspired algorithms. With complex dynamics, the mapping of environment stimuli to cellular responses is highlighted as a decision making capability. When considering applications which could benefit from these dynamics, the possibility of incorporating these pathways can be an interesting way to combine more biologically-plausible algorithms and improved performance. The structure of the NF-&kappa;B (Nuclear Factor &kappa;B) and MAP (Mitogen-activated protein) kinases pathways, and the pathways involved in signaling by Toll-like receptors, are presented. As an example, we then consider how these pathways could be incorporated in the Dendritic Cell Algorithm.
Genetic Blind Image Restoration With Dynamical Local Evaluation
Authors: Ivan Gerace, Marcello Mastroleo, Alfredo Milani, Simona Moraglia
Venue: Proceedings of the 2008 International Conference on Computational Sciences and Its Applications (2008)

The blind image restoration problem consists in estimating the original image from blurry and noisy data, without knowing the involved blur operator. The problem is well known to be ill-posed even in the not--blind formulation, nevertheless the use of regularization techniques allows to define the solution of the problem as the minimum of an energy function. In this paper we solve the blind restoration problem with a evolutionary approach. A population of blur operators is evolved with a fitness given by the opposite of the energy function to be minimized. Since the fitness evaluation, calculated on the whole image, represents a significant computational overhead which can make the method unfeasible for large images, an original technique of dynamical local fitness evaluation has been designed and integrated in the evolutionary scheme. The subimage evaluation area is dynamically changed during evolution of the population. The underlying hypothesis is that the explored subareas are significatively representative of the features of blurs and noises in the global image. The experimental results confirm the adequacy of such a method: in some cases the proposed genetic blind reconstruction finds qualitatively better solutions outperforming the not-blind standard deterministic algorithm.
On the Performance of Fuzzy Data Querying
Authors: Mariela Curiel, Claudia González, Leonid Tineo, Angélica Urrutia
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

We are interested in providing databases with fuzzy data representation and flexible querying capabilities. This work concerns with a performance analysis based on statistical techniques to evaluate methods for fuzzy queries over fuzzy data. We introduce the application of Derivation Principle for this kind of queries and show its practical benefit using a prototype that we have built on top of Oracle's DBMS.
Prediction of Crohn's Disease by Profiles of Single Nucleotide Polymorphisms
Authors: Roberto Colella, Annarita D'Addabbo, Anna Latiano, Orazio Palmieri, Vito Annese, Nicola Ancona
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

This paper focuses on the comparison of two different approaches to the analysis of Single Nucleotide Polymorphism (SNP) profiles data regarding Crohn's Disease; the first one is based on a single SNP analysis, conducted by means of classical statistical tools, to assess the correlation existing between SNP's profile and phenotype; the second one makes use of classifiers based on Regularized Logistic Regression. The findings of the study show that the machine learning techniques adopted are able to provide statistically significant prediction accuracy of the phenotypic status of the subjects analyzed by SNP data. Moreover, they are poorly influenced by the noise embedded in the data and are suitable for genome-wide analysis.
Topological Histogram Reduction Towards Colour Segmentation
Authors: Eduard Vazquez, Ramon Baldrich, Javier Vazquez, Maria Vanrell
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

One main process in Computer Vision is image segmentation as a tool to other visual tasks. Although there are many approaches to grey scale image segmentation, nowadays most of the digital images are colour images. This paper introduces a new method for colour image segmentation. We focus our work on a topological study of colour distribution, e.g., image histogram. We argue that this point of view bring us the possibility to find dominant colours by preserving the spatial coherence of the histogram. To achieve it, we find and extract ridges of the colour distribution and assign a unique colour at every ridge as a representative colour of an interest region. This method seems to be not affected by shadows in a wide range of tested images.
Breaking and Provably Fixing Minx
Authors: Erik Shimshock, Matt Staats, Nick Hopper
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

In 2004, Danezis and Laurie proposed Minx, an encryption protocol and packet format for relay-based anonymity schemes, such as mix networks and onion routing, with simplicity as a primary design goal. Danezis and Laurie argued informally about the security properties of Minx but left open the problem of proving its security. In this paper, we show that there cannot be such a proof by showing that an active global adversary can decrypt Minx messages in polynomial time. To mitigate this attack, we also prove secure a very simple modification of the Minx protocol.
A low complexity digital phase-locked loop based frequency synthesizer
Authors: Jingcheng Zhuang
Venue:  (2008)

This dissertation presents a proposed low-complexity digital PLL and a digitally-controlled oscillator with an enhanced frequency resolution for frequency synthesis applications. The basic operation of the conventional PLL-based frequency synthesizers is first briefly reviewed, followed by the literature review of some reported digital PLLs. A low-complexity digital PLL is thus proposed, including the system architecture and implementations of its sub-blocks. In the proposed digital PLL, the complex digital loop filter used in many reported digital PLLs is replaced by a simple logical decision circuit, and digital encoders are avoided to significantly reduce the hardware complexity. A novel digital tuning scheme for the digitally-controlled oscillator is proposed to achieve small frequency tuning steps and to improve the matching accuracy between LSB/MSB tuning banks so that the overlaps between LSB/MSB banks can be eliminated. The loop behavior of the proposed DPLL is analyzed theoretically and its unique noise behavior, automatic adaptation to different reference phase noise levels, is investigated, together with the determination of the design parameters. To confirm the theoretical analysis, behavioral simulations using SimuLink and the event-driven technique were done to observe the locking process and obtain the phase noise performance. To further prove the feasibility of proposed digital PLL two test chips, the proposed high-resolution digitally controlled oscillator and the low-complexity digital PLL were implemented and fabricated. The phase noise performance and the frequency tuning characteristic of the digitally controlled oscillator were measured. The phase noise tracking and compensation characteristics were observed from the digital PLL measurements, which well agree with both the theoretical analysis and the behavioral simulations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Class of Graphs of f-Class 1
Authors: Xia Zhang, Guizhen Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ¿ V(G) at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index of G, and denoted by ¿¿ f (G). Any simple graph G has f-chromatic index equal to Δ f (G) or Δ f (G) + 1, where $\Delta_{f}(G)=\max_{v\in V(G)}\{\lceil\frac{d(v)}{f(v)}\rceil\}$. If ¿¿ f (G) = Δ f (G), then G is of f-class 1; otherwise G is of f-class 2. In this paper, we show that if f(v) is positive and even for all $v\in V_0^*(G)\cup N_G(V_0^*(G))$, then G is of f-class 1, where $V^{*}_{0}(G)=\{v\in V(G):\frac{d(v)}{f(v)}=\Delta_{f}(G)\}$ and $N_G(V_0^*(G))=\{v\in V(G):uv\in E(G), u\in V_0^*(G)\}$. This result improves the simple graph version of a result of Hakimi and Kariv [4].
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Authors: Bayo Omomowo, Inés Arana, Hatem Ahriz
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i.e. the problems are distributed over a number of agents and change over time. Dynamic Distributed Constraint Satisfaction Problems (DDisCSP) [1] are an emerging field for the resolution of problems that are dynamic and distributed in nature. In this paper, we propose DynABT, a new Asynchronous algorithm for DDisCSPs which combines solution and reasoning reuse i.e. it handles problem changes by modifying the existing solution while re-using knowledge gained from solving the original (unchanged) problem. The benefits obtained from this approach are two-fold: (i) new solutions are obtained at a lesser cost and; (ii) resulting solutions are stable i.e. close to previous solutions. DynABT has been empirically evaluated on problems of varying difficulty and several degrees of changes has been found to be competitive for the problem classes tested.
Hybrid GNG Architecture Learns Features in Images
Authors: José García-Rodríguez, Francisco Flórez-Revuelta, Juan Manuel García-Chamizo
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Self-organising neural networks try to preserve the topology of an input space by using their competitive learning. This capacity has been used, among others, for the representation of objects and their motion. In this work we use a kind of self-organising network, the Growing Neural Gas, to represent objects as a result of an adaptive process by a topology-preserving graph that constitutes an induced Delaunay triangulation of their shapes. In this paper we present a new hybrid architecture that creates multiple specialized maps to represent different clusters obtained from the multilevel multispectral threshold segmentation.
Memory Design for Raster Graphics Displays
Authors: Mary Whitton
Venue: IEEE Computer Graphics and Applications (1984)

This tutorial examines the origin and nature of the problem of contention for memory cycles¿a problem that impacts the image update performance of every raster graphics system. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
P3P: Making Privacy Policies More Useful
Authors: Lorrie Faith Cranor
Venue: IEEE Security and Privacy (2003)

This article provides an introduction to the World Wide Web Consortium's Platform for Privacy Preferences (P3P) specification. P3P provides a standard way for Web sites to convey their privacy policies in a computer-readable format. The article describes the motivations behind P3P and how it works. In addition, it includes an overview of P3P-related software, discusses P3P adoption, and describes future P3P standardization efforts. Finally, the article discusses critics' views of P3P and discusses the standards' potential impacts.
Deniable Authentication on the Internet
Authors: Shaoquan Jiang
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, we formalize a natural notion of deniable security and naturally extend the basic authenticator theorem by Bellare et al. [1] to the setting of deniable authentication. Of independent interest, this extension is achieved by defining a deniable MT-authenticator via a game. This game is essentially borrowed from the notion of universal composition [6] although we do not assume any result or background about it. Then we construct a 3-round deniable MT-authenticator. Finally, as our application, we obtain a key exchange protocol that is deniably secure in the real world.
Analysis of inter-area mode oscillations using a PSS for variable speed wind power converter and modal decomposition
Authors: C. Gallardo, P. Ledesma
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

This paper shows a simple approach to damping inter-area oscillations using a PPS for a variable-speed wind power converter. The proposed control is evaluated performing several simulations on modified version of 10-generator, 39-bus New England power system. The simulation represent a three-phase short-circuit, and the damping control system is applied with different gains. The selection of the variable-speed wind power converter's gain is carried out through modal decomposition and the effectiveness of the proposed approach is demonstrated for a fault at bus 4.
An Improvement to Ant Colony Optimization Heuristic
Authors: Youmei Li, Zongben Xu, Feilong Cao
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Ant Colony Optimization (ACO) heuristic provides a relatively easy and direct method to handle problem's constraints (through introducing the so called solution construction process), while in the other heuristics, constraint-handling is normally sophisticated. But this makes its solving process slow for the solution construction process occupies most part of its computation time. In this paper, we propose a strategy to hybridize Hopfield discrete neural networks (HDNN) with ACO heuristic for maximum independent set (MIS) problems. Several simulation instances showed that the strategy can greatly improve ACO heuristic performance not only in time cost but also in solution quality.
Semantic parameterization: A process for modeling domain descriptions
Authors: Travis D. Breaux, Annie I. Antón, Jon Doyle
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2008)

Software engineers must systematically account for the broad scope of environmental behavior, including nonfunctional requirements, intended to coordinate the actions of stakeholders and software systems. The Inquiry Cycle Model (ICM) provides engineers with a strategy to acquire and refine these requirements by having domain experts answer six questions: who, what, where, when, how, and why. Goal-based requirements engineering has led to the formalization of requirements to answer the ICM questions about when, how, and why goals are achieved, maintained, or avoided. In this article, we present a systematic process called Semantic Parameterization for expressing natural language domain descriptions of goals as specifications in description logic. The formalization of goals in description logic allows engineers to automate inquiries using who, what, and where questions, completing the formalization of the ICM questions. The contributions of this approach include new theory to conceptually compare and disambiguate goal specifications that enables querying goals and organizing goals into specialization hierarchies. The artifacts in the process include a dictionary that aligns the domain lexicon with unique concepts, distinguishing between synonyms and polysemes, and several natural language patterns that aid engineers in mapping common domain descriptions to formal specifications. Semantic Parameterization has been empirically validated in three case studies on policy and regulatory descriptions that govern information systems in the finance and health-care domains.
An Annotation Tool for Semantic Documents
Authors: Henrik Eriksson
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Document annotation is a common technique for relating text and knowledge representation. Although the semantic web emphasizes the annotation of web pages, there are other types of documents that can benefit from ontology-based annotations. PDF documents combined with OWL ontologies form semantic documents that support professional printing, on-line viewing, and ontological models. PDFTab is an extension to the Protégé ontology editor that allows developers to annotate PDF documents with OWL-based ontologies. It is possible to add OWL ontologies to preexisting PDF documents and to relate document parts to concepts in the ontology. PDFTab integrates Adobe Acrobat with Protégé and allows users to switch seamlessly between the document and ontology views. PDFTab illustrates how it is possible to extend semantic-web techniques to the widely-used PDF format while maintaining strong support for ontology development and editing.
IRC Traffic Analysis for Botnet Detection
Authors: Claudio Mazzariello
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Networked hosts' vulnerabilities pose some serious threats to the operation of computer networks. Modern attacks are increasingly complex, and exploit many strategies in order to perform their intended malicious tasks. Attackers have developed the ability of controlling large sets of infected hosts, characterized by complex executable command sets, each taking part incooperative and coordinated attacks. There are many ways to perform control onan \emph{army} of possibly unaware infected hosts, and an example of such techniques is discussed in this paper. We will address the problem of detecting \emph{botnets}, by introducing a network traffic analysis architecture, and describing a behavioral model, for a specific class of network users, capable of identifying \emph{botnet}-related activities.
Energy R&D and Conservation Require Greater Computer Power
Authors: J. Schallan
Venue: Computer (1978)

"The resolution of our energy problems is crucially dependent upon computing," Dr. Joel A. Snow asserted in his technical keynote address before the opening session of the National Computer Conference. The Department of Energy official went on to sketch the implications of the energy crisis, detailing the ways in which his department utilizes computers in energy research and development. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Distributed Applications from Scratch: Using GridMD Workflow Patterns
Authors: I. Morozov, I. Valuev
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

A new approach is proposed to generate workflow scenarios of scientific applications such as Molecular Dynamics and Monte-Carlo simulations in a distributed environment. The approach is based on embedding all workflow elements into the source (C++) code of the application as external library (GridMD) function calls. Thus the compiled executable is used both to generate the scenario and to perform computations related to the individual scenario elements. Having the scenario, its execution may be delegated to any resource manager which supports workflows.
Probabilistic and Logical Beliefs
Authors: John W. Lloyd, Kee Siong Ng
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

This paper proposes a method of integrating two different concepts of belief in artificial intelligence: belief as a probability distribution and belief as a logical formula. The setting for the integration is a highly expressive logic. The integration is explained in detail, as its comparison to other approaches to integrating logic and probability. An illustrative example is given to motivate the usefulness of the ideas in agent applications.
Rough Set Approach to Spam Filter Learning
Authors: Mawuena Glymin, Wojciech Ziarko
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

This article presents an elementary overview of techniques employed for spam detection via probabilistic decision table-based predictive data modelling. The focus here is to present a solution that combines simple algorithms together with some heuristics to construct generalized rough approximations of spam and legitimate e-mails using the variable precision rough set (VPRSM) approach. Experiments were conducted to explore the application of VPRSM for designing an intelligent agent for spam filtering.
Some Theorems Concerning the Core Function
Authors: Angelo Raffaele Meo
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

In a preceding paper an NP-complete problem has been discussed pertaining to a function, called "core function", which plays an important role in the well known Boolean satisfiability problem (see the first item in the references list). In this paper, some theorems concerning the minimal Boolean implementation of the core function are proved.