<?xml version="1.0" encoding="UTF-8"?>
<!-- Generated on Thu, 11 Mar 2010 18:07:06 -0500 -->
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <atom:link href="http://pdfcast.org/rss/cat/computer-internet" rel="self" type="application/rss+xml" />
    <title>PDF by Category: Computer / Internet - PDFCast.org</title>
    <link>http://pdfcast.org/rss/cat/computer-internet</link>
    <description></description>
    <language>en-us</language>
    <item>
      <title>Potential Effect of Creeping User Requirements on Project  Management: A Simulation Approach</title>
      <description><![CDATA[Requirements management has been discussed for at least fifteen
years. As a discipline and as a practice, it has become more and
more complex. In software projects new requirements are]]></description>
      <content:encoded><![CDATA[Requirements management has been discussed for at least fifteen<br />
years. As a discipline and as a practice, it has become more and<br />
more complex. In software projects new requirements are<br />
continuously issued and the objective of the requirement<br />
management is to elicit, manage and prioritize requirements. In<br />
the present study, a specific requirement management process is<br />
simulated. The stochastic parameters of the proposed system<br />
with specific system boundaries under a given environment have<br />
been estimated using event to event simulation. The present<br />
study will yield realistic results which are very near to the<br />
functioning of the live system. Based on results from simulation,<br />
conditions that result in an overload situation are identified.<br />
Simulation is also used to find process change proposals.<br />
]]></content:encoded>
      <link>http://pdfcast.org/pdf/potential-effect-of-creeping-user-requirements-on-project-management-a-simulation-approach</link>
      <pubDate>Mon, 08 Mar 2010 07:32:53 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/potential-effect-of-creeping-user-requirements-on-project-management-a-simulation-approach</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>ATM Switch: Impact Of Heuristic Approach To Static  Bandwidth Allocation</title>
      <description><![CDATA[In this paper, the performance
evaluation of two Asynchorous Transfer
Mode (ATM) scheduler strategies, static
bandwidth allocation with and without
heuristic approach are ...]]></description>
      <content:encoded><![CDATA[In this paper, the performance<br />
evaluation of two Asynchorous Transfer<br />
Mode (ATM) scheduler strategies, static<br />
bandwidth allocation with and without<br />
heuristic approach are presented. Several<br />
experiments were carried out by using the<br />
ON-OFF distribution source model based on<br />
the ATM Various Bit Rate (VBR) service<br />
category. The strategy with the heuristic<br />
approach improves the buffer cell loss ratio<br />
(CLR) performance significantly. Several<br />
numerical results are presented to show the<br />
effects of the heuristic approach to<br />
bandwidth allocation. ]]></content:encoded>
      <link>http://pdfcast.org/pdf/atm-switch-impact-of-heuristic-approach-to-static-bandwidth-allocation</link>
      <pubDate>Mon, 08 Mar 2010 06:46:35 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/atm-switch-impact-of-heuristic-approach-to-static-bandwidth-allocation</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>Can We Learn to Beat the Best Stock</title>
      <description><![CDATA[A novel algorithm for actively trading stocks is presented. While tradi-tional universal algorithms (and technical trading heuristics) attempt topredict winners or trends, our approach relies on ...]]></description>
      <content:encoded><![CDATA[A novel algorithm for actively trading stocks is presented. While tradi-tional universal algorithms (and technical trading heuristics) attempt topredict winners or trends, our approach relies on predictable statisticalrelations between all pairs of stocks in the market. Our empirical resultson historical markets provide strong evidence that this type of techni-cal trading can “beat the market” and moreover, can beat the best stockin the market. In doing so we utilize a new idea for smoothing criticalparameters in the context of expert learning.]]></content:encoded>
      <link>http://pdfcast.org/pdf/can-we-learn-to-beat-the-best-stock</link>
      <pubDate>Tue, 23 Feb 2010 20:43:34 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/can-we-learn-to-beat-the-best-stock</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>Change Management Environments, Policies &amp; Procedures</title>
      <description><![CDATA[The objective of this document is to define the Change Management program and processes for the Department of Clemson Computing and Information Technology (CCIT) at Clemson University. The Change ...]]></description>
      <content:encoded><![CDATA[The objective of this document is to define the Change Management program and processes for the Department of Clemson Computing and Information Technology (CCIT) at Clemson University. The Change Management processes presented in this document are based on the Information Technology Infrastructure Library (ITIL) methodology for IT Service Management best practices. The goal of the CCIT Change Management program is to: Ensure standardized methods and procedures are used for efficient and prompt handling of all changes to IT Systems, in order to minimize disruptions to service delivery, improve service quality, and reduce service delivery costs.]]></content:encoded>
      <link>http://pdfcast.org/pdf/change-management-environments-policies-procedures</link>
      <pubDate>Fri, 12 Feb 2010 10:08:34 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/change-management-environments-policies-procedures</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>Calculation of Overhead Transmission Line Impedances  A Finite Element Approach</title>
      <description><![CDATA[In this paper, the finite element method (FEM) is used to
calculate the frequency dependent series impedance matrix of an
overhead transmission line. A novel approach is proposed, leading ...]]></description>
      <content:encoded><![CDATA[In this paper, the finite element method (FEM) is used to<br />
calculate the frequency dependent series impedance matrix of an<br />
overhead transmission line. A novel approach is proposed, leading from<br />
FEM results to the direct computation of the symmetrical components<br />
impedance matrix of any single or double circuit transmission line.<br />
Results show excellent agreement with those obtained by classical<br />
computation methods. Test cases examined include impedance<br />
calculations in the presence of certain terrain irregularities in the line<br />
neighborhood, such as line by a mountain side of variable slope, line<br />
inside a canyon or line near a water region.]]></content:encoded>
      <link>http://pdfcast.org/pdf/calculation-of-overhead-transmission-line-impedances-a-finite-element-approach</link>
      <pubDate>Thu, 11 Feb 2010 00:32:10 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/calculation-of-overhead-transmission-line-impedances-a-finite-element-approach</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>New Directions in Traffic Measurement and Accounting</title>
      <description><![CDATA[Accurate network traffic measurement is required for ac-
counting, bandwidth provisioning and detecting DoS at-
tacks. These applications see the traffic as a collection of
flows ...]]></description>
      <content:encoded><![CDATA[Accurate network traffic measurement is required for ac-<br />
counting, bandwidth provisioning and detecting DoS at-<br />
tacks. These applications see the traffic as a collection of<br />
flows they need to measure. As link speeds and the number<br />
of flows increase, keeping a counter for each flow is too ex-<br />
pensive (using SRAM) or slow (using DRAM). The current<br />
state-of-the-art methods (Cisco’s sampled NetFlow) which<br />
log periodically sampled packets are slow, inaccurate and<br />
resource-intensive. Previous work showed that at different<br />
granularities a small number of “heavy hitters” accounts for<br />
a large share of traffic. Our paper introduces a paradigm<br />
shift for measurement by concentrating only on large flows<br />
— those above some threshold such as 0.1% of the link ca-<br />
pacity.<br />
We propose two novel and scalable algorithms for iden-<br />
tifying the large flows: sample and hold and multistage fil-<br />
ters, which take a constant number of memory references per<br />
packet and use a small amount of memory. If M is the avail-<br />
able memory, we show analytically that the errors of our new<br />
algorithms are proportional to 1/M; by contrast, the error<br />
of an algorithm based on classical sampling is proportional<br />
to 1/<br />
?<br />
M, thus providing much less accuracy for the same<br />
amount of memory. We also describe further optimizations<br />
such as early removal and conservative update that further<br />
improve the accuracy of our algorithms, as measured on re-<br />
al traffic traces, by an order of magnitude. Our schemes<br />
allow a new form of accounting called threshold accounting<br />
in which only flows above a threshold are charged by usage<br />
while the rest are charged a fixed fee. Threshold accounting<br />
generalizes usage-based and duration based pricing.<br />
]]></content:encoded>
      <link>http://pdfcast.org/pdf/new-directions-in-traffic-measurement-and-accounting</link>
      <pubDate>Wed, 10 Feb 2010 04:08:09 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/new-directions-in-traffic-measurement-and-accounting</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>Horizontal Decomposition of Prevayler</title>
      <description><![CDATA[Aspect-Oriented Programming (AOP) is an emerging paradigm to modularize crosscutting concerns. A series of guidelines to refactor a software system into a common core and a set of variable ...]]></description>
      <content:encoded><![CDATA[Aspect-Oriented Programming (AOP) is an emerging paradigm to modularize crosscutting concerns. A series of guidelines to refactor a software system into a common core and a set of variable functionalities have become known as Horizontal Decomposition (HD). In this paper we apply the HD principles to the Prevayler main memory database management system. The objective is to evaluate and refine these principles and to extract patterns of their use through a case study on a popular open-source software system. Our evaluation shows that HD reveals six crosscutting functionalities. The refactoring of these concerns yield 36 different configurations of the Prevayler system which were previously not possible. The refactoring also reduces the core Pre- vayler code size by 53%, demonstrates a decrease of coupling between core functionality components by 43%, and reduces the lack of cohesion of the core system by 71%. Given the heterogeneous nature of crosscutting displayed in Prevayler, the size and separation of concern metrics have not reduced for the overall refactored system, i.e., for the core composed with the aspects. A posterior analysis of the re-engineering process reveals 22 refactoring patterns that could be readily used by an automatic aspect refactoring tool.]]></content:encoded>
      <link>http://pdfcast.org/pdf/horizontal-decomposition-of-prevayler</link>
      <pubDate>Mon, 08 Feb 2010 10:56:14 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/horizontal-decomposition-of-prevayler</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>The Java Generic Programming System</title>
      <description><![CDATA[In this paper, we explore how to implement support for generic programming in Java using a combination of the compile time type system, the runtime type system, and the reflection features of Java ...]]></description>
      <content:encoded><![CDATA[In this paper, we explore how to implement support for generic programming in Java using a combination of the compile time type system, the runtime type system, and the reflection features of Java without using Java Generics. As a starting point, we specifically looked at what generic programming techniques could be exploited in Java without using Java Generics. In addition, while the Java Generics approach seems heavily weighted towards being able to use templates in a fashion that mimics C++, our approach was to instead determine what is actually required for generic programming to be implemented and then to determine the extent to which those requirements can or cannot be met using the current version of Java. To do this, we provide a definition of Generic Programming and use it to design and implement the generic programming system in Java. We used portions of both the Standard Template Library (STL) and the Boost Graph Library in C++ to demonstrate our approach.]]></content:encoded>
      <link>http://pdfcast.org/pdf/the-java-generic-programming-system</link>
      <pubDate>Mon, 08 Feb 2010 10:40:00 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/the-java-generic-programming-system</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>What is Generic Programming?</title>
      <description><![CDATA[The last two decades have seen an ever-growing interest in generic programming. As for most programming paradigms, there are several definitions of generic programming in use. In the simplest view ...]]></description>
      <content:encoded><![CDATA[The last two decades have seen an ever-growing interest in generic programming. As for most programming paradigms, there are several definitions of generic programming in use. In the simplest view generic programming is equated to a set of language mechanisms for implementing type-safe polymorphic containers, such as List<T>in Java. The notion of generic programming that motivated the design of the Standard Template Library (STL) advocates a broader definition: a programming paradigm for designing and developing reusable and efficient collections of algorithms. The functional programming community uses the term as asynonym for polytypic and type-indexed programming, which involves designing functions that operate on data-types having certain algebraic structures. This paper aims at analyzing core mathematical notions at the foundations of rational approaches to generic programming and library design as reasoned and principled activity. We relate several methodologies used and studied in the imperative and functional programming communities. As a necessary step, we provide abase for common understanding of techniques underpinning generic software components and libraries, and their construction, not limited to a particular linguistic support.]]></content:encoded>
      <link>http://pdfcast.org/pdf/what-is-generic-programming</link>
      <pubDate>Mon, 08 Feb 2010 10:39:04 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/what-is-generic-programming</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>A Comparative Study of Language Support for Generic Programming</title>
      <description><![CDATA[Many modern programming languages support basic generic programming, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support to a broader, more ...]]></description>
      <content:encoded><![CDATA[Many modern programming languages support basic generic programming, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support to a broader, more powerful interpretation of generic programming, and their extensions have proven valuable in practice. This paper reports on a comprehensive comparison of generics in six programming languages: C++, Standard ML, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#. By implementing a substantial example in each of these languages, we identify eight language features that support this broader view of generic programming. We find these features are necessary to avoid awkward designs, poor maintainability, unnecessary runtime checks, and painfully verbose code. As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for programmers.]]></content:encoded>
      <link>http://pdfcast.org/pdf/a-comparative-study-of-language-support-for-generic-programming</link>
      <pubDate>Mon, 08 Feb 2010 10:30:43 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/a-comparative-study-of-language-support-for-generic-programming</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>Klassen im Fokus &#45; Der Kantor</title>
      <description><![CDATA[Einführungsartikel zu den Klassen in Aion]]></description>
      <content:encoded><![CDATA[Einführungsartikel zu den Klassen in Aion]]></content:encoded>
      <link>http://pdfcast.org/pdf/klassen-im-fokus-der-kantor</link>
      <pubDate>Sat, 06 Feb 2010 21:25:14 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/klassen-im-fokus-der-kantor</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  74&#45;924exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  74-924exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  74-924exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-74-924exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:24:31 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-74-924exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;643exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-643exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-643exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-643exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:23:10 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-643exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;642exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-642exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-642exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-642exam-study-guides-trainning-materials-1</link>
      <pubDate>Tue, 02 Feb 2010 03:21:45 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-642exam-study-guides-trainning-materials-1</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;640exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-640exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-640exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-640exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:19:48 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-640exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;622exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-622exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-622exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-622exam-study-guides-trainning-materials-1</link>
      <pubDate>Tue, 02 Feb 2010 03:17:43 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-622exam-study-guides-trainning-materials-1</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;561exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-561exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-561exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-561exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:15:58 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-561exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;549exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-549exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-549exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-549exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:13:49 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-549exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;548VBexam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-548VBexam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-548VBexam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-548vbexam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 03:11:55 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-548vbexam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
    <item>
      <title>test4pass  70&#45;526exam  study guides  trainning materials</title>
      <description><![CDATA[test4pass  70-526exam  study guides  trainning materials]]></description>
      <content:encoded><![CDATA[test4pass  70-526exam  study guides  trainning materials]]></content:encoded>
      <link>http://pdfcast.org/pdf/test4pass-70-526exam-study-guides-trainning-materials</link>
      <pubDate>Tue, 02 Feb 2010 02:59:06 -0500</pubDate>
      <guid isPermaLink="true">http://pdfcast.org/pdf/test4pass-70-526exam-study-guides-trainning-materials</guid>
      <category>Computer / Internet</category>
    </item>
  </channel></rss>