ppxscal/embedding_network huggingface dataset:
Software development monitoring graphs
Authors: Murat M. Tanik
Venue: ACM SIGSOFT Software Engineering Notes (1980)

Two different software tools that can be utilized in software development projects by management, systems analysts, and programmers are developed. These tools are collectively called monitoring graphs. The first type of monitoring graph is called a complexity graph. It is used to represent the complexity of a program or a system of programs. The second type of monitoring graph is called a development graph. It is used in the control of a software project.These monitoring graphs basically look like Kiviat graphs which are used in performance evaluation studies. Fundamentally, a complexity graph is a circle with eight axes. The values to be represented on each axis are obtained from a set of prediction equations which are generated through multiple linear regression analysis. These complexity graphs can further be grouped into three different types depending on the type of data represented on each axis. These types are individual complexity graphs, cumulative complexity graphs and average complexity graphs. Structurally speaking, a development graph is the same as a complexity graph with exception of the information represented on each axis. In a development graph, each axis represents quantities such as percentage of time spent on debugging, percentage of time spent on testing etc. Development graphs are grouped into two different types depending on the function they serve. These types are program development graphs and system development graphs.The userulness of the complexity graphs is tested on a set of COBOL and FORTRAN programs. For development graphs, development patterns of 69 COBOL programs written by two skilled professional programmers are traced for 33 weeks producing weekly patterns of the development graphs to observe the usefulness and efficiency of this method.
Subscription psychology
Authors: Aaron Weiss
Venue: netWorker (2002)

The Internet is really brimming with free stuff, and not just illicit trading of copyrighted music and movies on P2P networks. You can get your intellectual stimulation gratis from The New York Times, Los Angeles Times, The Washington Post, and many local newspapers, plus essays from The Atlantic Monthly, Slate and countless number of Web sites where folks share thoughts great and small. You can be entertained---assuming that your Internet connection is fast enough---with music videos from MTV, Launch.com, and SonicNet, plus view feature film trailers and full-length independent films. It's a pretty great deal, if you're on the receiving end. But for those making and providing all these free words, sounds, and images, times are getting tough. It may be true that 90 percent of everything is crap, but even excreta costs something to produce.
Automatic design of application specific instruction set extensions through dataflow graph exploration
Authors: Nathan Clark, Hongtao Zhong, Wilkin Tang, Scott Mahlke
Venue: International Journal of Parallel Programming (2003)

General-purpose processors are often incapable of achieving the challenging cost, performance, and power demands of high-performance applications. To meet these demands, most systems employ a number of hardware accelerators to off-load the computationally demanding portions of the application. As an alternative to this strategy, we examine customizing the computation capabilities of a processor for a particular application. The processor is extended with hardware in the form of a set of custom function units and instruction set extensions. To effectively identify opportunities for creating custom hardware, a dataflow graph design space exploration engine heuristically identifies candidate computation subgraphs without artificially constraining their size or shape. The engine combines estimates of performance gain, cost, and inherent limitations of the processor to grow candidate graphs in profitable directions while pruning unprofitable paths. This paper describes the dataflow graph exploration engine and evaluates its effectiveness across a set of embedded applications.
Single machine scheduling with early and quadratic tardy penalties
Authors: Jeffrey Schaller
Venue: Computers and Industrial Engineering (2004)

This paper considers the problem of scheduling a single machine when the objective uses a penalty for each job that is equal to the earliness of the job plus the squared tardiness of the job. A timetabling algorithm is presented that inserts idle time into a sequence in order to minimize the objective considered. Optimal branch and bound algorithms are presented as well as efficient heuristic algorithms. The procedures are tested on randomly generated problems of varying numbers of jobs and due date tightness parameters. The results show that a branch and bound procedure can solve small and medium sized problems in a reasonable amount of time and that a simple descent procedure can quickly generate solutions that are close to optimal.
On increasing the developability of a trimmed NURBS surface
Authors: L. Wang, Yu Wang, F. Yuen
Venue: Engineering with Computers (2004)

Developable surfaces are desired in designing products manufactured from planar sheets. Trimmed non-uniform rational B-spline (NURBS) surface patches are widely adopted to represent 3D products in CAD/CAM. This paper presents a new method to increase the developability of an arbitrarily trimmed NURBS surface patch. With this tool, designers can first create and modify the shape of a product without thinking about the developable constraint. When the design is finished, our approach is applied to increase the developability of the designed surface patches. Our method is an optimisation-based approach. After defining a function to identify the developability of a surface patch, the objective function for increasing the developability is derived. During the optimisation, the positions and weights of the free control points are adjusted. When increasing the developability of a given surface patch, its deformation is also minimised and the singular points are avoided. G0 continuity is reserved on the boundary curves during the optimisetion, and the method to reserve G1 continuity across the boundaries is also discussed in this paper. Compared to other existing methods, our approach solves the problem in a novel way that is close to the design convention, and we are dealing with the developability problem of an arbitrarily trimmed NURBS patch.
Effect of low-k dielectric on stress and stress-induced damage in Cu interconnects
Authors: Jong-Min Paik, Hyun Park, Young-Chang Joo
Venue: Microelectronic Engineering (2004)

The effect of low-k materials on the stress and stress distribution in via-line structures of dual damascene Cu interconnects were analyzed using three-dimensional finite element analysis. For this purpose, via-line structures incorporating two different dielectric materials, tetraethyl orthosilicate (TEOS) and organic polymer-based low-k materials, were investigated. In the case of TEOS, which has a relatively low coefficient of thermal expansion (CTE) and a high elastic modulus, hydrostatic stress was concentrated at the via and the top of the lines, where it was suspected that the void should nucleate. On the other hand, in the via line structures integrated with organic low-k materials, which have higher CTE and very low Young's modulus, large von Mises stress is maintained at the via, and thus the deformation of the via, rather than voiding, is the anticipated main failure mode. A good correlation between the FEM prediction and experimentally observed failure was obtained in the different dielectric materials.
Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

We propose in this paper a trade-off between hardand soft real-time guarantees to maintain an acceptableQoS guarantee in overload condition and maximizeefficiently the utilization of network resources. The key ofour solution is that many real-time applications are loss-tolerant,but the loss profile must be well defined sincesuccessive packet losses are not suitable. We use theconcept of (m,k)-firm timing constraints to define a novelguaranteed loss-tolerant QoS. Therefore, we extend thebasic WFQ algorithm to take into account the firm timingconstraints to provide lower delay guarantees withoutviolating bandwidth fairness or misusing networkresources. The proposal is called (m,k)-WFQ. UsingNetwork Calculus formalism, analytic study gives thedeterministic delay bound provided by the (m,k)-WFQalgorithm for upper bounded arrival curve traffic.Theoretical results and simulations show a noticeableimprovement on delay guarantee made by (m,k)-WFQcompared to standard WFQ algorithm without muchdegrading bandwidth fairness.
Algorithms for Building Annular Structures with Minimalist Robots Inspired by Brood Sorting in Ant Colonies
Authors: Matt Wilson, Chris Melhuish, Ana B. Sendova-Franks, Samuel Scholes
Venue: Autonomous Robots (2004)

This study shows that a task as complicated as multi-object &lsquo;ant-like annular sorting&rsquo; can be accomplished with &lsquo;minimalist&rsquo; solutions employing simple mechanisms and minimal hardware. It provides an alternative to &lsquo;patch sorting&rsquo; for multi-object sorting. Three different mechanisms, based on hypotheses about the behaviour of Leptothorax ants are investigated and comparisons are made. Mechanism I employs a simple clustering algorithm, with objects of different sizes. The mechanism explores the idea that it is the size difference of the object that promotes segregation. Mechanism II is an extension to our earlier two-object segregation mechanism. We test the ability of this mechanism to segregate an increased number of object types. Mechanism III uses a combined leaky integrator, which allows a greater segregation of object types while retaining the compactness of the structure. Its performance is improved by optimizing the mechanism's parameters using a genetic algorithm. We compare the three mechanisms in terms of sorting performance. Comparisons between the results of these sorting mechanisms and the behaviour of ants should facilitate further insights into both biological and robotic research and make a contribution to the further development of swarm robotics.
Promoting undergraduate research: a classroom model
Authors: Ann M. Quade
Venue: ACM SIGCSE Bulletin (2004)

This paper describes a computer science course designed to develop and enhance undergraduates' research skills. The course pedagogy served to significantly reduce the faculty mentor's tedious task of building the mentee's research-related skill set, yet facilitated the establishment of partnerships between mentors and mentees.
Programming Style Changes in Evolving Source Code
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

As programs evolve they become harder to maintainas the source code becomes more difficult to comprehend.One aspect of comprehensibility is related to theprogramming style exhibited by the program. However,as this aspect itself is changed during the maintenanceprocess we must attempt to maintain the originalprogramming style quality to maintain thecomprehensibility of the program.This paper presents the initial findings of aninvestigation of how one area of programming style(typographical style), changes over the lifetime of aprogram. The aim is to draw upon these findings toindicate how typographical style should be measured,and where necessary changed, to ensure programcomprehensibility.
A hybrid physical/device-space approach for spatio-temporally coherent interactive texture advection on curved surfaces
Authors: Daniel Weiskopf, Thomas Ertl
Venue: Proceedings of Graphics Interface 2004 (2004)

We propose a novel approach for a dense texture-based visualization of vector fields on curved surfaces. Our texture advection mechanism relies on a Lagrangian particle tracing that is simultaneously computed in the physical space of the object and in the device space of the image plane. This approach retains the benefits of previous image-space techniques, such as output sensitivity, independence from surface parameterization or mesh connectivity, and support for dynamic surfaces. At the same time, frame-to-frame coherence is achieved even when the camera position is changed, and potential inflow issues at silhouette lines are overcome. Noise input for texture advection is modeled as a solid 3D texture and constant spatial noise frequency on the image plane is achieved in a memory-efficient way by appropriately scaling the noise in physical space. For the final rendering, we propose color schemes to effectively combine the visualization of surface shape and flow. Hybrid physical/device-space texture advection can be efficiently implemented on GPUs and therefore supports interactive vector field visualization. Finally, we show some examples for typical applications in scientific visualization.
Ensemble Clustering in Medical Diagnostics
Authors: Derek Greene, Alexey Tsymbal, Nadia Bolshakova, Padraig Cunningham
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Ensemble techniques have been successfully applied in the context of supervised learning toincrease the accuracy and stability of classification. Recently, analogous techniques for cluster analysis have been suggested. Research has demonstrated that, by combining a collection of dissimilar clusterings, an improved solution can be obtained. In this paper, we examine the potential of applying ensemble clustering techniques with a focus on the area of medical diagnostics. We present several ensemble generation and integration strategies, and evaluate each approach on a number of synthetic and real-world datasets. In addition, we show that diversity among ensemble members is necessary, but not sufficient to yield an improved solution without the selection of an appropriate integration method.
System Support for Dynamic Optimization of Application Performance
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Today's high performance and parallel computer systems provide substantial opportunities for concurrency of execution and scalability that is largely untapped by the applications that run on them. Under traditional frameworks, developing efficient applications can be a labor-intensive process that requires an intimate knowledge of the machines, the applications, and many subtle machine-application interactions. Optimizing applications so that they can achieve their full potential on target machines is often beyond the programmer's or the compiler's ability or endurance.This paper argues for addressing the performance optimization problem by providing support for tuning application codes with substantially reduced human intervention by exploiting dynamic information gathered at run time so that the optimization is responsive to actual run time behavior as data sets change and installed systems evolve.
Propulsion shaft alignment method and analysis for surface crafts
Authors: K. H. Low, S. H. Lim
Venue: Advances in Engineering Software (2004)

This paper presents an approach to determine the changing displacement of the propulsion shaft due to the vessel's hull deflection. The model considered is a 60 m long shafting system of a ship consisting of 10 bearings, one gearbox and one main engine. This paper presents a comprehensive alignment analysis process for a long shafting system. A deflection analysis program, Shaftflex, is to shorten the analyzing time and to maintain consistency in the analysis process. Alignment of the first four bearings, which are exposed to the sea, has to be determined first and while on the launch way. As the ship hull is flexible, hogging occurs when it is afloat. It is observed that there is an inherent upward tilting of the shaft as such pre-tilting the projected shaftline downwards is necessary in order to counter the problem. Furthermore, as the shaft is more flexible than the ship' s hull, it will be able to deflect as much as the hull and as a result causing variation in the loading at bearings. Therefore, the hull deflection characteristic of a vessel is a major concern in the analysis and alignment of a long shaft system. It is found that the alignment of the first four external bearings greatly affects vertical position of the gearbox and the main engine, which are aligned afloat and taking reference from the bearings. Numerical algorithm is also developed for such an analysis. The work presented in this paper is based on analytical geometry, arithmetic and trigonometry expressions. The derived mathematical expressions are incorporated into commonly used and comprehensive software for a quick analysis and parametric study.
A non-linear model to approximate the dynamics of a pulse width-modulated spray nozzle
Authors: R. Delen, L. Clijmans, J. Anthonis, H. Ramon
Venue: Mathematics and Computers in Simulation (2004)

This paper deals with the mathematical model construction of a PWM-nozzle in order to analyse the impact of its dynamics on the flow discharge through multiple simulation tests. A structured analysis is proposed where the system is divided up into two linked subsystems: an electromagnetic subsystem and a mechanical subsystem. Due to the ferromagnetic property of the solenoid, hysteresis effects occur that have been approximately described by third order polynomial functions. The motion of the core inside the solenoid is defined by linear differential equations (mass spring-damper subsystem) with these differences that the displacement is physically restricted. Coulomb friction is appended and the initial preload of the spring is covered so that the final solution is non-linear. An experimental test in which the resulting displacements of the core due to a voltage pulse input are compared with the model simulations demonstrates the exactness of the model.
What to Adapt in a High-Performance Microprocessor
Authors: Pedro Trancoso
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

High-performance processors usually require large amounts of power for their operation. Adapting resources in such processors is very relevant as each application and distinct use of the system has a different demand. A frequent use of adaptationis to have the processor operating in either high-performance or low-power mode. In this work we analyze how power and performance change while modifying most of the resources in a processor. This leads to identifyingwhich resources are more important for adaptation. This analysis was performed for three distinct workloads: multimedia, scientific, and database. Four criteria were defined to limit the adaptation range considering the cost and/or the efficiency of the system. The results of our experiments showed that the resource to be adapted depends on the: (1) operating mode (e.g. low-power or high-performance), (2) the workload, and (3) the criteria. Overall, for our baseline processor configuration, the dominant resources to be adapted are the voltage-frequency and the first-level instruction cache. Adapting resources may lead to an increase in the performance by up to 44% or a reduction in power by up to 93% with no restrictions. For configurations of the same cost and efficiency as the baseline, adaptation of resources may improve the performance by 33% or reduce the power by 34%.
Adaptive incremental checkpointing for massively parallel systems
Authors: Saurabh Agarwal, Rahul Garg, Meeta S. Gupta, Jose E. Moreira
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in these systems. However, huge memory footprints of parallel applications place severe limitations on scalability of normal checkpointing techniques. Incremental checkpointing is a well researched technique that addresses scalability concerns, but most of the implementations require paging support from hardware and the underlying operating system, which may not be always available. In this paper, we propose a software based adaptive incremental checkpoint technique which uses a secure hash function to uniquely identify changed blocks in memory. Our algorithm is the first self-optimizing algorithm that dynamically computes the optimal block boundaries, based on the history of changed blocks. This provides better opportunities for minimizing checkpoint file size. Since the hash is computed in software, we do not need any system support for this. We have implemented and tested this mechanism on the BlueGene/L system. Our results on several well-known benchmarks are encouraging, both in terms of reduction in average checkpoint file size and adaptivity towards application's memory access patterns.
Magnetic Resonance Elastography: in vivo Measurements of Elasticity for Human Tissue
Authors: Takenori Oida, Akira Amano, Tetsuya Matsuda
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

Elasticity is an important physical property of material.In the clinical practice, elasticity is used for physical examinationin several ways, such as palpation or percussion.Differences in elasticity can help facilitate the diagnosisof tumors and their extent. Elasticity is an essentialproperty in the diagnosis of liver cirrhosis, or soft degenerationin tissue necrosis. In addition, information of tissueelasticity is utilized in virtual reality systems such astelepalpation and computer assisted surgery. It was difficultto obtain such properties in vivo by using conventional measurementmethods. To overcome this problem, magnetic resonanceelastography (MRE) has been developed that providesnoninvasive in vivo measurements of elasticity for humantissue. We summarize this MRE method in this paper.When an object is oscillated from the surface in a knownfrequency, acoustic strain waves propagate into the materialand one can calculate the physical constants of a materialelasticity by the wave velocity. In MRE measurements,a cyclic micromotion caused by the acoustic strain wavesis obtained as an MR image that is synchronized to the oscillation.By measuring the local wavelength of the strainwaves, we can obtain the elasticity constants. Several examplesof MRE image including in vivo measurements areprovided as well as several methods to estimate the localwavelength from MRE images are described in this paper.
Eliciting gaps in requirements change
Authors: Colette Rolland, Camille Salinesi, Anne Etien
Venue: Requirements Engineering (2004)

We consider requirements change due to system evolution which results from contextual forces such as the decision to standardise practices across subsidiaries of a company. Our experience with the financial branch of the French Renault group is that eliciting change requirements poses its own specific problems. We propose to model change as a set of gaps between the requirements specification of the current and the future system. Our approach is to define a generic typology of gaps to facilitate a precise definition of change requirements. It adopts a goal oriented requirements specification and shows how to customise the generic gap typology to this specific requirements representation formalism. The paper presents the approach to elicit gaps and illustrates it with the Renault case study.