ppxscal/embedding_network huggingface dataset:
Contributing to the Bottom Line: Optimizing Reliability-Cost-Schedule Tradeoff and Architecture Scalability through Test Technology
Authors: D. Boyd, D. Cura, W. Ehrlich, R. Gotberg, R. Hariharan, P. Reeser
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

A challenging problem in software testing is finding the optimal point at which costs justify the stop-test decision. In this paper, we first present an economic model that can be used to evaluate the consequences of various stop-test decisions. We then discuss two approaches for assessing performance, automated load test generation in the context of empirical testing and performance modeling, and illustrate how these techniques can affect the stop-test decision. We then illustrate the application of these two techniques to evaluating the performance of Web Servers that performs significant server-side processing through object-oriented (OO) computing. Implications of our work for Web Server performance evaluation in general are discussed.
Assessing the Cost-Effectiveness of Inspections by Combining Project Data and Expert Opinion
Authors: Lionel C. Briand, Bernd Freimut, Ferdinand Vollei
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

There is a general agreement among software engineering practitioners that software inspections are an important technique to achieve high software quality at a reasonable cost. However, there are many ways to perform such inspections and many factors that affect their cost-effectiveness. It is therefore important to be able to estimate this cost-effectiveness in order to monitor it, improve it, and convince developers and management that the technology and related investments are worthwhile. This work proposes a rigorous but practical way to do so. In particular, a meaningful model to measure cost-effectiveness is selected and a method to determine the cost-effectiveness by combining project data and expert opinion is proposed. To demonstrate the feasibility of the proposed approach, the results of a large-scale industrial case study are presented.
Evaluation of Concurrent Pools
Authors: David Kotz, Schlatter C Ellis
Venue:  (1987)

In a parallel environment, requests for allocation and deallocation of resources or assignment of tasks should be served in a fashion that helps to balance the load and minimize the total parallel runtime. It is important to perform this allocation in a manner that preserves locality by avoiding remote references (and hence interference with other processes). Concurrent pools, as described by Manber, provide an appropriate data structure for addressing these goals. This paper evaluates the effectiveness of the pool structure under a variety of stressful workloads. It was found that the structure is highly successful at preserving the locality of pool accesses and that a simpler algorithm than that described by Manber may actually provide better performance.
An explicit local basis for C1 cubic spline spaces over a triangulated quadrangulation
Authors: Huan-Wen Liu, Don Hong
Venue: Journal of Computational and Applied Mathematics (2003)

Let S31 (♦) be the bivariate C1-cubic spline space over a triangulated quadrangulation ♦. In this paper, an explicit representation of a locally supported basis of S31 (♦) is given using the interpolation conditions at vertices.
The Performance Comparison between TCP Reno and TCP Vegas
Authors: Yuan-Cheng Lai, Chang-Li Yao
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Following the development of TCP Vegas, the performance comparison between TCP Reno and TCP Vegas has not been discussed thoroughly. The discussion of the revised TCP version, TCP Vegas, remains insufficient to decide whether or not to use it. This paper attempts to compare the performance, throughput and fairness, of Reno and Vegas in the network environments with homogeneous and heterogeneous versions of TCP. Results in this study indicate that while TCP Vegas obtains better throughput and fairness in homogeneous cases, it fails to outperform Reno in heterogeneous cases. This phenomenon prevents users from adopting TCP Vegas despite its better performance.
Quantitative Analysis of Compatibility and Correlation of the Current SPA/SPI Models
Authors: Yingxu Wang, I. Court, M. Ross, G. Staples, G. King, A. Dorling
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

It is a fundamental requirement to quantitatively analyze the compatibility and correlation between the current models for software process assessment (SPA) and improvement (SPI). The compatibility and correlation of the SPA/SPI models, such as the SPICE, CMM, BOOTSTRAP, ISO 9000 and the SPRM, are formally and quantitatively analyzed and contrasted in this paper. First, formal definitions of the compatibility and correlation between the models are introduced. Then the relational properties are mutually analyzed from every view points of each of the five models to the others. The objective analysis results provided are useful not only for theoretical research in software engineering, but also for practitioners in the software industry.
Analysis of multipath impulse response of diffuse and quasi-diffuse optical links for IR-WLAN
Authors: R. Perez- Jiménez, V. M. Melián, M. J. Betancor
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper studies the variation on the power budget, in an infrared optical link for indoor channels with multipath propagation. The multipath propagation produces heavy distortion over the received signal and reduces the maximum baud rate for a given bit error rate. Focusing on IR wireless local area network (IRWLAN), we study some emitter and receiver configurations. In order to allow computer portability these links can be diffuse or quasi-diffuse. These channels do not rely upon the line-of-the-sight path. This works deals not only with the total received power, but with its time and spatial distribution. This paper considers the channel as characterized by its channel transfer function in a deterministic way. This is a good approximation if the variations in the environmental conditions are slow enough compared with the baud rate of the communication system. The source is an IR emitter diode (IRED) with different values of directivity, pointing to a reflecting surface, while the receiver is a photodiode characterized through its field of view (F.O.V.) value. The results show that an optical Q-diffuse link improves the performances of a diffuse one. We use for the comparative analysis the RMS spread delay of the impulse response, the spatial distribution of received power and its standard deviation from the mean. We present extensive simulation results, an emitter configuration and the first measured results obtained using an APD as receiver.
Task allocation using a distributed market-based planning mechanism
Authors: Dani Goldberg, Vincent Cicirello, M. Bernardine Dias, Reid Simmons, Stephen Smith, Anthony Stentz
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes a market-based planning mechanism used for task and resource allocation within a larger distributed, multi-robot control and coordination architecture. We are developing an extension to the traditional three-layered robot architecture that enables robots to interact directly at each layer -- at the behavioral level, the robots create distributed control loops; at the executive level, they synchronize task execution; at the planning level, they use market-based techniques to allocate tasks and resources. This paper focusses on the market-based planning layer, which is comprised of two main components: a trader that participates in the market, auctioning and bidding on tasks; and a scheduler that determines task feasibility and cost for the trader, and interacts with the executive layer for task execution.
Performance analysis of a single-server ATM queue with a priority scheduling
Authors: Joris Walraevens, Bart Steyaert, Herwig Bruneel
Venue: Computers and Operations Research (2003)

In this paper, we consider a discrete-time queueing system with head-of-line priority. First, we will give some general results on a GI-1-1 queue with priority scheduling. In particular, we will derive expressions for the probability generating function of the system contents and the cell delay. Some performance measures (such as mean, variance and approximate tail distributions) of these quantities will be derived, and used to illustrate the impact and significance of priority scheduling in an ATM output queueing switch.
Hot-carrier-Induced Circuit Degradation for 0.18 µm CMOS Technology
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Because the supply voltage is not proportional scaled with the device size, the further scaling down of CMOS devices is in turn accompanied with more and more severe hot-carrier reliability problems. Hot-carriers, the high energy carriers due to high electric field in the channel, are injected into the gate oxide or cause trapping states generation between Si and SiO2 interface, which is accumulated and cause long run reliability problems in devices and circuits. In this paper, we describe a systematic method to evaluate the circuit degradation due to hot-carrier stressing. First the substrate current and gate leakage current models are improved for more accuracy in predicting the lifetime of the devices and circuits. The hot-carrier stressing characterization is carried out for 0.18 µm technology. The circuit performance degradation is then evaluated using the parameters extracted from 0.18 µm technology for both digital logic circuits and RF circuits.
Asynchronous interactions on shared data
Authors: William W. Collier
Venue: ACM SIGOPS Operating Systems Review (1973)

In order to write algorithms which interact successfully on shared data, it is necessary to understand the assumptions which are made about each operation and to know whether or not the assumptions are met by the underlying hardware. There are several basic types of operations on shared data; from the number of these operations a measure of the degree of interaction between algorithms can be obtained. This measure can then be used to ensure that all instances of interaction are tested.
A Telecommunication Systems Development Approach with Reuse Technique
Authors: Gil-Jo Kim, Chul-Ho Choo, Yu-Whoan Ahn, Jin-Ok Jeon, Dan-Hyung Lee
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper presents a method to specify telecommunication service systems(TSSs) while managing their complexity. The approach is based on the concept of meta-model and reusable class library. The meta-model is devised from the generic structure of TSSs to provide a conceptual framework for specifying target TSSs. The generic class library(GCL), a collection of reusable components, provides building blocks that can be assembled when a target system is to be specified. This approach utilizes the benefit of reuse techniques and target TSSs are expected to be developed with less time and efforts and to be reliables ones, easy to maintain.
Some Pointed Questions Concerning Asymptotic Lower Bounds
Authors: Eric Allender
Venue:  (1997)

This column was originally written to appear in the Bulletin of the EATCS. In this column, I survey some aspects of complexity theory that can hardly be considered ``recent''''. Instead, I will focus on some fundamental truths relating complexity theory to practical computing. These truths deserve repeating, lest they become forgotten. 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 Study of Concurrency in MPEG-4 Video Encoder
Authors: A. Hamosfakidis, Y. Paker, J. Cosmas
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

The traditional boundaries between the computer, TV/Film industries and telecommunications, are blurring. Therein lies the focus of MPEG-4: the convergence of common applications of the above mentioned three industries. MPEG-4 aims to satisfy the new requirements and expectations, by providing an audio visual coding standard allowing for interactivity, high compression and universal accessibility. Moreover coding of video data is an important feature in digital industry and the MPEG-4 Video Encoder has to be able to encode efficiently visual information and probably in real time conditions. Therefore a lot of effort has been spent in real time video encoding and decoding issues using either hardware or software solutions. This paper addresses these issues by describing a parallel software implementation of the MPEG-4 Video Encoder using multithread techniques. A scheduling policy is proposed to guarantee via a buffer synchronisation a significantly speed up which under some special circumstances reach an optimised load balancing solution. The proposed scheme is tested using the hardware resources of Unix multiprocessor hardware platform (running Solaris 2.0) by rewriting and modifying the current MPEG-4 Encoder.
Telearbeit fur Behinderte LOCTITLE:: Telearbeit fur Behinderte
Authors: bibliothek ARRAY(0x8474f18) EMAIL::
Venue:  (1998)

TEDIS (Teleworking for Disabled People) was a research and development project publicly funded by the German Federal Ministry for Education, Science, Research and Technology (BMBF) from 1995-1997. It was a development effort of the research group on Human-Computer Interaction of the GMD - German National Research Center for Information Technology, Institute for Applied Information Technology. The project was targeted at implementing a suitable teleworking environment for disabled end-users thereby taking into account usability issues as well as a social technology assessment. The promising potentialties of adaptive and adaptable user interfaces for the vocational integration of the disabled are exemplified as well as the disappointing truth that their participation in todays working world with long-termed professional occupation are almost impossible to achieve. However, there are indications, that concepts of a center-based organization of the labourforce of disabled people could resolve this antogonism. LOCLANGUAGE:: German LOC :: TEDIS (Teleworking for Disabled People/Telearbeit fur behinderte Menschen) war ein von 1995-1997 vom Bundesministerium fur Bildung, Wissenschaft, Forschung und Technologie (BMBF) gefrdertes Forschungs- und Entwicklungsprojekt. Es wurde von der Forschungsgruppe Mensch-Maschine-Kommunikation in der GMD - Forschungszentrum Informationstechnik, Institut fur Angewandte Systemtechnik, durchgefuhrt. Ziel des Forschungsvorhabens war es, einen prototypischen Telearbeitsplatz fur Endbenutzer mit Spezialanforderungen wie behinderte oder altere Menschen zu entwickeln. Dabei wurden im Zuge einer Technikfolgenabschatzung die sozialen Auswirkungen von Teleheimarbeit sowie Fragen der Gebrauchstauglichkeit (Usability) des eingesetzten Telekooperationssystems berucksichtigt. Die zukunftsweisenden Potentiale adaptiv und adaptierbarer Benutzerschnittstellen zur beruflichen Integration behinderter Menschen wurden im Laufe des Projektes deutlich wie auch die ernuchternde Tatsache, da? die erfolgreiche Integration dieser Menschen in die Arbeitswelt im Sinne dauerhafter Beschaftigungsverhaltnisses sehr schwierig ist. Zur Auflsung dieses Antagonismus knnte die Organisation der Arbeitskraft behinderter Menschen in Form von zentrumsbasierten Telearbeitszentren beitragen. 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 comparison of methods for locating features in legacy software
Authors: Norman Wilde, Michelle Buckellew, Henry Page, Vaclav Rajlich, LaTreva Pounds
Venue: Journal of Systems and Software (2003)

Software engineers frequently need to locate the code that implements a specific feature of a program in order to fix a problem or add an enhancement. Several methods have recently been proposed to aid in feature location, notably the software reconnaissance method, which uses dynamic analysis of traces of execution, and the dependency graph method which involves static tracing of calling and data flow relationships in the program's dependency graph. Most studies performed so far on these methods have used relatively modern C code. However there is a large body of existing legacy software in Fortran and similar languages which is often much more poorly structured. This paper describes a case study to locate two features in a sample of poorly structured legacy Fortran code. Both methods were applied to locate the features, along with the well known "grep" text search method for comparison. Both the software reconnaissance and dependency graph methods located both features, although some difficulties were encountered and adaptations were needed due to the very tangled nature of the code. The "grep" search method worked well for one of the two features, but was ineffective for the second, more complex case.
DVD Demystified
Authors: Jim Taylor
Venue:  (2002)

:This brand new, comprehensive edition of the best-selling guide to DVD technology is a must-read for DVD hardware/software developers, A/V publishers, IT/MIS professionals, and video/audio professionals. Includes a new chapter on DVD production, and completely new DVD-ROM demo material. Covers the use of DVD with computers -- plus rewritable DVD, DVD audio, DIVX, and other new technologies.
On Stabbing Lines for Convex Polyhedra in 3D
Authors: K P Agarwal
Venue:  (1993)

\def\B{{\cal B}} \def\reals{{\bf R}} Given a set $\B$ of convex polyhedra in $\reals^3$, a line $\ell$ in $\reals^3$ is called a {\em stabbing line\/} for $\B$ if it intersects all polyhedra of $\B$. %Pellegrini and Shor \cite{PeS} proved that the %combinatorial complexity of the space of stabbing lines %for $\B$ is $O(n^3 2^{\sqrt{\log n}})$, where $n$ is the total number of %edges in the polyhedra of $\B$. This paper presents an upper bound of $O(n^3 \log n)$ on the complexity of the space of stabbing lines for $\B$. We solve a more general problem which counts the number of faces in a set of convex polyhedra, which are implicitly defined by a set of half-spaces and an arrangement of hyperplanes. We show that the former problem is a special case of the latter problem. We also apply this technique to obtain an upper bound on the number of distinct faces that ever appear on the intersection of a set of half-spaces as we insert or delete half-spaces dynamically.
PhotoShop 6: Superfacil
Authors: Carmen Cordoba Gonzalez
Venue:  (2002)

:Photoshop is one of the most powerful programs for the digital management of photographs. This guide for Photoshop 6 offers easy, clear, and concise explanations for each function and provides the answers to practical questions including improving image quality, making color corrections, retouching, and manipulating images.Es esta guía dedicada a Photoshop 6, uno de los programas mas potentes para el manejo de fotografía digital. Se encuentran explicaciones faciles y paso de su funcionamiento. Expone preguntas practicas por ejemplo como mejorar la imagen, como hacer la correccion de color, el retoque y manipulacion de imagenes. Explica cuales son los fundamentos de la impresion y las pruebas de color, y trata la incidencia del numero de puntos por pulgada."C. Cordoba, C. Gonzalez, and E. Cordoba are the authors of CorelDRAW 9 curso completo.
DRPM: dynamic speed control for power management in server class disks
Authors: Sudhanva Gurumurthi, Anand Sivasubramaniam, Mahmut Kandemir, Hubertus Franke
Venue: ACM SIGARCH Computer Architecture News (2003)

A large portion of the power budget in server environments goes into the I/O subsystem - the disk array in particular. Traditional approaches to disk power management involve completely stopping the disk rotation, which can take a considerable amount of time, making them less useful in cases where idle times between disk requests may not be long enough to outweigh the overheads. This paper presents a new approach called DRPM to modulate disk speed (RPM) dynamically, and gives a practical implementation to exploit this mechanism. Extensive simulations with different workload and hardware parameters show that DRPM can provide significant energy savings without compromising much on performance. This paper also discusses practical issues when implementing DRPM on server disks.
A Parallel Triangular Solver for a Hypercube Multiprocessor
Authors: Guangye Li, Thomas F. Coleman
Venue:  (1986)

We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifically, we propose a fast parallel algorithm, applicable when the triangular matrix is distributed around the cube by column in a wrap fashion. Numerical experiments indicate that the new algorithm is very efficient. A theoretical analysis confirms that the total running time varies linearly, with respect to the matrix order, up to a threshold value of the matrix order, after which the dependence is quadratic. Moreover, we show that total message traffic is essentially the minimum possible. Finally, we describe an analogous row-oriented algorithm.
Sequential Product Design
Authors: Sencer Ecer
Venue: Netnomics (2003)

I consider a model of duopoly where firms make sequential product design changes prior to price competition. I show that a socially desirable outcome is possible in this model. In equilibrium, the leader's product is less specific, implying a customer attraction strategy, and the follower's product is more specific, implying a customer retention strategy. This outcome is in contrast with the equilibrium outcome of a similar model, where simultaneous design competition takes place prior to price competition. In this latter model, the product designs are more specific and the prices are higher in equilibrium, leading to a reduction in welfare. I compare the design incentives under price competition with those in models where price collusion or merger is expected and with multi-product monopoly. In models with no price competition, less specific designs may serve to attract more customers, to improve current or future pie of monopoly profits, or to improve the outside option in bargaining game, depending on the model.
Competitive Relations in Imperfect Commodity Markets
Authors: I. N. Karbovskii, A. M. Lukatskii, A. A. Men'shikova, D. V. Shapot
Venue: Automation and Remote Control (2003)

Studies are made of the organization and results of multi-agent simulation modeling of a local competitive market of electric energy and power-generating coal. Market agents carry out mutual deliveries, make decisions on their own about the share of sales and price discounts for the local market and also perform sales and purchases in an external (global) market at appropriate prices of the sales and purchases that do not depend on the behavior of local market agents. The most compliant agents receive the priority of the access to cheaper resources. It is shown that on fulfilling sufficiently soft conditions of the &ldquo;valid competition,&rdquo; all local market agents can receive an appreciable increment of the profitability. Small and low-profitable enterprises obtain the highest relative gains of the profitability.