Hidbid.com - The Free eBay Auction Sniper Directory

Search the directory:
You are here » Hidbid.com - The Free eBay Auction Sniper » Links Directory » Business » Computers (0)

No websites in this category, yet!


Computers RSS Feeds

Node-Pancyclic Properties of Biswapped Networks Based on Cycles in Their Factor Networks ? - <span class="paragraphSection"><div class="boxTitle">Abstract</div>Cycle embedding in networks is one of the fundamental algorithmic issues in interconnection networks. Biswapped networks are a family of composite interconnection networks, applicable to constructing massive parallel computers owing to their attractive attributes. Specifically, each biswapped network is built by taking 2n copies of some <span style="font-style:italic;">n</span>-node factor network as modules and connecting them in a simple inter-module connectivity rule. In this paper, the problem of embedding cycles of various lengths in a biswapped network is investigated based on a given cycle of length l?3 in its factor network. We propose a simple method to address the problem. Using the method, one easily constructs cycles of all even lengths ranging from 8 to 2l2, and also cycles of all odd lengths ranging from l+6 to 2l2?1 for <span style="font-style:italic;">l</span> be...
Feed Source: academic.oup.com

Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences - <span class="paragraphSection"><div class="boxTitle">Abstract</div>There has been long-standing interest in automatically generating test sequences from a finite state machine (FSM) and more recently this has been extended to the case where there are multiple physically distributed testers and so we are testing from a multi-port FSM. This paper explores the problem of generating a controllable preset distinguishing sequence (PDS) from a multi-port FSM, motivated by the fact that many FSM-based test generation algorithms use PDSs. We prove that it is generally undecidable whether a multi-port FSM has a controllable PDS but provide a class of multi-port FSMs for which the problem is decidable. We also consider the important case where there is an upper bound <span style="font-style:italic;">?</span> on the length of PDSs of interest, proving that controllable PDS existence is PSPACE-hard and in EXPSPACE. In practice the upper bound <span style="font-style...
Feed Source: academic.oup.com

Editorial: Zero-Knowledge-Private Counting of Group Triangles in Social Networks - <span class="paragraphSection"><div class="boxTitle">Abstract</div>We introduce a general notion of maturity in social networks that is based on the number of triangles between groups/communities. In order to protect individual privacy upon possible release of such information, we propose privacy mechanisms using zero-knowledge privacy (ZKP), a recently proposed privacy scheme that provides stronger protection than differential privacy for social-graph data. We present techniques to compute the parameters required to design ZKP methods and finally evaluate the practicality of the proposed methods.</span>...
Feed Source: academic.oup.com

Independent Spanning Trees in RTCC-Pyramids - <span class="paragraphSection"><div class="boxTitle">Abstract</div>The independent spanning trees (ISTs) problem is asked to find <span style="font-style:italic;">k</span> spanning trees rooted at a designated vertex <span style="font-style:italic;">r</span> such that, for any vertex <span style="font-style:italic;">v</span>, all paths connecting <span style="font-style:italic;">r</span> and <span style="font-style:italic;">v</span> in <span style="font-style:italic;">k</span> spanning trees are pairwise internally disjoint in the given graph. ISTs have numerous applications in networks such as reliable communication protocols, data broadcasting and secure message distribution. In the past, most of the results focused on constructing <span style="font-style:italic;">k</span>-ISTs on symmetric networks. While the existence of asymmetry makes the <span style="font-style:italic;">k&...
Feed Source: academic.oup.com

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs - <span class="paragraphSection"><div class="boxTitle">Abstract</div>We study the problem of computing drawings of planar graphs in sub-quadratic area, by allowing edge crossings. We first prove that sub-quadratic area cannot be achieved if only a constant number of crossings per edge is allowed. More precisely, we show that the same area lower bounds as in the crossing-free case hold for straight-line and poly-line drawings of planar graphs and series-parallel graphs. Motivated by this result, we study straight-line drawings of planar graphs where the number of crossings per edge is not bounded by a constant. In this case, we prove that every planar graph admits a straight-line drawing with sub-quadratic area and sub-linear thickness (the thickness of a drawing is the minimum number of colors that can be assigned to the edges so that each color class induces a planar drawing). We also prove that every partial 2-tree (and hence every series-parallel graph) admits a line...
Feed Source: academic.oup.com

An Empirical Study on Mutation Testing of WS-BPEL Programs - <span class="paragraphSection"><div class="boxTitle">Abstract</div>Nowadays, applications are increasingly deployed as Web services in the globally distributed cloud computing environment. Multiple services are normally composed to fulfill complex functionalities. Business Process Execution Language for Web Services (WS-BPEL) is an XML-based service composition language that is used to define a complex business process by orchestrating multiple services. Compared with traditional applications, WS-BPEL programs pose many new challenges to the quality assurance, especially testing, of service compositions. A number of techniques have been proposed for testing WS-BPEL programs, but only a few studies have been conducted to systematically evaluate the effectiveness of these techniques. Mutation testing has been widely acknowledged as not only a testing method in its own right but also a popular technique for measuring the fault-detection effectiveness of other testing met...
Feed Source: academic.oup.com

A Petri-Net-Based Virtual Deployment Testing Environment for Enterprise Software Systems - <span class="paragraphSection"><div class="boxTitle">Abstract</div>The landscape of modern enterprise IT environments is that a large number of distributed software systems interact and cooperate with each other to support daily business operations. With the prevalence of cloud computing, the level of system connectivity increases further. The <span style="font-style:italic;">large scale</span> of such an environment makes it difficult to test a system's quality attributes such as performance and scalability before it is actually deployed in the production environment. Under the currently dominant iterative and incremental software development paradigm, this difficulty is even more pronounced when the quality attributes of an enterprise system need to be examined and evaluated at early stages but a large part of its operating environment is not available or accessible. In this paper, we present a Coloured Petri nets (CPN) based system behaviour emulation a...
Feed Source: academic.oup.com

Dynamic Upward Planarity Testing of Single Source Embedded Digraphs - <span class="paragraphSection"><div class="boxTitle">Abstract</div>In this paper, we present a dynamic algorithm that checks if a single-source embedded digraph is upward planar in the presence of edge insertions and edge deletions without changing the embedding of the digraph. We show that it can be checked in O(logn) amortized time whether the updated graph is a single-source upward planar digraph with a fixed external face.</span>...
Feed Source: academic.oup.com

PMCTrack: Delivering Performance Monitoring Counter Support to the OS Scheduler - <span class="paragraphSection"><div class="boxTitle">Abstract</div>Hardware performance monitoring counters (PMCs) have proven effective in characterizing application performance. Because PMCs can only be accessed directly at the OS privilege level, kernel-level tools must be developed to enable the end-user and userspace programs to access PMCs. A large body of work has demonstrated that the OS can perform effective runtime optimizations in multicore systems by leveraging performance-counter data. Special attention has been paid to optimizations in the OS scheduler. While existing performance monitoring tools greatly simplify the collection of PMC application data from userspace, they do not provide an architecture-agnostic kernel-level mechanism that is capable of exposing high-level PMC metrics to OS components, such as the scheduler. As a result, the implementation of PMC-based OS scheduling schemes is typically tied to specific processor models. To address this s...
Feed Source: academic.oup.com

On the Use of C# Partial Classes for the Implementation of Software Product Lines - <span class="paragraphSection"><div class="boxTitle">Abstract</div>Nowadays, many software companies have a flagship product that is sold to several customers, but customized to the particular requirements of each one of them. In these cases, <span style="font-style:italic;">Software Product Line Engineering</span> (SPL), whose goal is the effective engineering of software products families, can be helpful. In the last years, several methodologies, techniques, languages and tools for SPL engineering have been released. They aim to improve state-of-the-art technologies, such as object-oriented technologies, regarding SPL engineering. Some years ago, a new programming concept, called <span style="font-style:italic;">partial class</span>, was added to the C# programming language. This concept was considered by some authors as helpful for SPL implementation. Nevertheless, this idea has not been seriously explored until now. In order to fill this ga...
Feed Source: academic.oup.com

DNA Profiles Link Dope to Its Source - 09 Jul 03 Forensic scientists in the U.S. are applying DNA fingerprinting methods to the cannabis plant. They say the technique, which is being used to create a database of DNA profiles of different marijuana plants, will help them to trace the source of any sample. 'It links everybody together: the user, the distributor, the grower,' says the database's creator, Heather Miller Coyle of the Connecticut State Forensic Science Laboratory in Meriden. 'That's the real intent of it, to show it's not just one guy with a little bag of marijuana, but it's a group of people.' A method for spotting the tiniest traces of marijuana, based on detecting DNA unique to cannabis chloroplasts, has already been developed in the UK (New Scientist print edition, 07 Aug 1999). B...
Feed Source: www.newscientist.com

Mathematics: Does the Proof Stack Up? - by George Szpiro 03 Jul 03 Just under five years ago, Thomas Hales made a startling claim. In an e-mail he sent to dozens of mathematicians, Hales declared that he had used a series of computers to prove an idea that has evaded certain confirmation for 400 years. The subject of his message was Kepler's conjecture, proposed by the German astronomer Johannes Kepler, which states that the densest arrangement of spheres is one in which they are stacked in a pyramid - much the same way as grocers arrange oranges. Soon after Hales made his announcement, reports of the breakthrough appeared on the front pages of newspapers around the world. But today, Hales's proof remains in limbo. It has been submitted to the prestigious Annals of Mathematics, but...
Feed Source: www.nature.com

Scientists Discover Planetary System Similar to Our Own - The image shows an impression by David A. Hardy of a possible scene from a moon orbiting the extra-solar planet in orbit around the star HD70642. Photo Credit: David A. Hardy. ...
Feed Source: www.nsf.gov

Hacker How-To Good Summer Reading - by Michelle Delio 27 Jun 03 Stealing the Network: How to Own the Boxby Ryan RussellSyngress, 330 pp., $49.95 Stealing The Network: How to Own the Box, a compendium of tales written by well-known hackers, is a perfect summer read. The stories are fictional. The technology and techniques described are very real. A warning: Those...
Feed Source: www.wired.com

Add your link - Submission Guidelines

Copyright © 2019, Hidbid.com - The Free eBay Auction Sniper. All Rights Reserved.