ppxscal/embedding_network huggingface dataset:
Monitoring Requirements Evolution using Views
Authors: Marco Lormans
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

This paper describes a research project concentrating on improving requirements management. We started this research by identifying the problems companies face with respect to requirements engineering in general, and requirements management in particular. We learned that monitoring requirements satisfaction is a major problem in practice. Requirements change continuously, making the traceability of requirements hard and the monitoring of requirements unreliable. As a solution, we develope a framework (Requirements Engineering System (RES)) that structures the process of requirements evolution, and a methodology that improves the traceability and monitoring of requirements. This methodology covers most of the processes defined in RES. We will implement the methodology in a tool, called ReqAnalyst. It uses Latent Semantic Index (LSI), an Information Retrieval technique, to recover the traceability links between the requirements and other work products. This traceability information will be used to generate 'requirements views' that help monitoring the requirements. We will apply the methodology in several case studies.
Vehicle System Development: A Challenge of Ultra-Large-Scale Systems
Authors: Robert Baillargeon
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Scale and complexity have been the topical elements of the vehicle system development for years. Whereas traditional systems engineering methods have been believed to be the solution to vehicle design challenges, recent shifts in the vehicle domain question their adequacy. Specifically, the character of vehicle systems, and their development environment, has shifted away from singular-use independent systems to multipurpose collaborating systems. The characteristics of this change are contained within the themes of scale, diversity, and dynamics. Each of these dimensions is contributing to the "wickedness" of vehicle systems in understanding, development, deployment, and maintenance. Such complexity and dynamics of interactions, by both users and developers, make vehicle systems exhibit the characteristics of Ultra-Large Scale (ULS) systems. The scale and concerns of vehicle system development challenge traditional approaches, and demand new fundamental research to reason the design, manage the scale, and create the capability for developing future vehicle systems.
Refactoring Methods
Authors: PVR Murthy, T. Rajaram, S. Hemanth
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

This tutorial provides an introduction to the problems faced in software evolution, and why we need to be concerned about refactoring design and code on a continuous basis.
Implementing lottery scheduling: matching the specializations in traditional schedulers
Authors: David Petrou, John W. Milford, Garth A. Gibson
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

We describe extensions to lottery scheduling, a proportional-share resource management algorithm, to provide the performance assurances present in traditional non-real time process schedulers. Lottery scheduling enables flexible control over relative process execution rates with a ticket abstraction and provides load insulation among groups of processes using currencies. We first show that a straightforward implementation of lottery scheduling does not provide the responsiveness for a mixed interactive and CPU-bound workload offered by the decay usage priority scheduler of the FreeBSD operating system. Moreover, standard lottery scheduling ignores kernel priorities used in the FreeBSD scheduler to reduce kernel lock contention. In this paper, we show how to use dynamic ticket adjustments to incorporate into a lottery scheduler the specializations present in the FreeBSD scheduler to improve interactive response time and reduce kernel lock contention. We achieve this while maintaining lottery scheduling's flexible control over relative execution rates and load insulation. In spite of added scheduling overhead, the throughput of CPU-bound workloads under our scheduler is within one percent of the FreeBSD scheduler for all but one test. We describe our design, evaluate our implementation, and relate our experience in deploying our hybrid lottery scheduler on production machines.
Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints
Authors: Ingo Feinerer, Gernot Salzer
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

The Unified Modeling Language (UML) has become a universal tool for the formal object-oriented specification of hard- and software. In particular, UML class diagrams and so-called multiplicities, which restrict the number of links between objects, are essential when using UML for applications like the specification of admissible configurations of components. In this paper we give a formal definition of the semantics of UML class diagrams and multiplicities. We extend results obtained in the context of Entity Relationship diagrams to cover UML specific extensions like the (non-)uniqueness attribute of binary associations. We show that the consistency of such specifications can be checked in polynomial time, and give an algorithm for computing minimal configurations (models). The core of our approach is a translation of UML class diagrams to Diophantine inequations.
On the selection of optimal nonlinearities for stochastic gradient adaptive algorithms
Authors: T. Y. Al-Naffouri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper derives an expression for the optimal error nonlinearity in adaptive filter design. Using an energy conservation relation, and some typical assumptions, the choice of the error function is optimized by minimizing the mean-square deviation subject to a fixed rate of convergence. The resulting optimal choice is shown to subsume earlier results as special cases.
The unsatisfiability threshold revisited
Authors: Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
Venue: Discrete Applied Mathematics (2007)

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the experimentally observed abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to the actual threshold value. In this paper, we consider the problem of bounding the threshold value from above using methods that, we believe, are of interest on their own right. More specifically, we show how the method of local maximum satisfying truth assignments can be combined with results for the occupancy problem in schemes of random allocation of balls into bins in order to achieve an upper bound for the unsatisfiability threshold less than 4.571. In order to obtain this value, we establish a bound on the q-binomial coefficients (a generalization of the binomial coefficients). No such bound was previously known, despite the extensive literature on q-binomial coefficients. Finally, to prove our result we had to establish certain relations among the conditional probabilities of an event in various probabilistic models for random formulas. It turned out that these relations were considerably harder to prove than the corresponding ones for unconditional probabilities, which were previously known.
Sidelobe reduction techniques for range-resolution radar
Authors: K. R. Rajeswari, N. Gangatharan, G. E. Morris
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper mainly discusses the technique used to reduce sidelobes for polyphase pulse compression codes. A brief explanation is given on pulse compression and range resolution. Binary, ternary, quinquenary, multilevel and Barker codes are also discussed. The details of polyphase pulse compression code that comprises Frank code, Extended Frank code, P3 and P4 codes are described. The basic theory on autocorrelation and discrimination is explained briefly. Furthermore, sidelobe reduction techniques for polyphase pulse compression codes are discussed in this paper. The technique of least square amplitude and phase weighting is focussed on P4, binary and ternary codes.. Finally, comparison of mean square error is made between different choices like all sidelobes reduction, some sidelobes reduction etc. to conclude which type of choice; the reduction technique is achieving less error thus providing a good reduction in autocorrelation with maintaining the same mainlobe level.
Analytical Drain Current Model of Nanoscale Strained-Si/SiGe MOSFETs for Analog Circuit Simulation
Authors: M. Jagadesh Kumar, Vivek Venkataraman, Susheel Nawal
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

For nanoscale CMOS applications, strained-silicon devices have been receiving considerable attention owing to their potential for achieving higher performance and compatibility with conventional silicon processing. In this work, an analytical model for the output current characteristics (I-V) of nanoscale bulk strained-Si/SiGe MOSFETs, suitable for analog circuit simulation, is developed. We demonstrate significant current enhancement due to strain, even in short channel devices, attributed to the velocity overshoot effect. The accuracy of the results obtained using our analytical model is verified using two-dimensional device simulations.
A new DNA-based evolutionary algorithm with application to the design of fuzzy controllers
Authors: Yongsheng Ding, Lihong Ren
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A new DNA-based evolutionary algorithm (DNA-EA) for automatic design of a class of Takagi-Sugeno (TS) fuzzy controllers is discussed in this paper. The fuzzy rules are automatically discovered, and the design parameters in the input fuzzy sets and the linear rule consequent are optimized simultaneously by the DNA-EA. The DNA-EA uses the DNA encoding method stemmed from the structure of the biological DNA to encode the design parameters of the fuzzy controllers. The gene transfer operation and bacterial mutation operation inspired by a microbial evolution phenomenon are introduced into the DNA-EA. Moreover, frameshift mutation operations based on the DNA genetic operations are used in the DNA-EA. Our encoding method is suitable for complex knowledge representation, and is easy for the genetic operations at gene level to be introduced into the DNA-EA. The length of the chromosome is variable and it is easy to insert and delete parts of the chromosome. As a demonstration, we show how to implement the new method to design automatically a TS fuzzy controller in the control of a nonlinear system. The fuzzy controller can be automatically constructed by the DNA-EA. Computer simulation results indicate that the new method is effective and the designed fuzzy controller is satisfactory.
Modified MMSE multiuser detection
Authors: Cai Guoquan, Yu Dapeng, Song Wentso
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A modified MMSE multiuser detection structure is proposed, which jointly elaborate the received signal and its complex conjugate. Simulation results show that the new structures significantly outperform the conventional MMSE structure, in terms of suppression capability of both multiple-access interference and narrowband interference.
A contemporary science and engineering education program for 8th and 9th grade students
Authors: S. Anwar
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper describes a 5-day science and engineering education program for 8th and 9th grade students, held at Penn State Altoona in August 1997. The objectives of this program were (a) to create a vision of science and engineering that is process-oriented, motivational, exploratory, and encourages problem solving, and (b) to impart students tools which would be helpful to them in learning more advanced scientific concepts. Participants conducted a series of inquiry-based exercises designed to introduce them to contemporary concepts in engineering design, materials science, lasers/electro-optics/fiber-optics, statistical quality control, and biological sciences. Working collaboratively in teams, 8th and 9th graders who participated in this program designed experiments, manipulated equipment, made measurements, and interpreted and presented data in an appropriate style. Each student created a portfolio of written, graphic, and project materials which was evaluated by the project faculty at the conclusion of the program. The portfolio approach was used to enhance: verbal and written communication skills, interdisciplinary learning, conceptual understanding of science and engineering, student responsibility for learning, self esteem. The paper begins with a description of the reasons for conducting the above mentioned summer school of excellence for 8th and 9th graders. A discussion of portfolio approach is presented. The activities carried out as a part of the above mentioned program are described. Finally, the student assessment and program evaluation are discussed.
How can the developer benefit from security modeling?
Authors: Shanai Ardi, David Byers, Per Hakon Meland, Inger Anne Tondel, Nahid Shahmehri
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Security has become a necessary part of nearly every software development project, as the overall risk from malicious users is constantly increasing, due to increased consequences of failure, security threats and exposure to threats. There are few projects today where software security can be ignored. Despite this, security is still rarely taken into account throughout the entire software lifecycle; security is often an afterthought, bolted on late in development, with little thought to what threats and exposures exist. Little thought is given to maintaining security in the face of evolving threats and exposures. Software developers are usually not security experts. However, there are methods and tools available today that can help developers build more secure software. Security modeling, modeling of e.g. threats and vulnerabilities, is one such method that, when integrated in the software development process, can help developers prevent security problems in software. We discuss these issues, and present how modeling tools, vulnerability repositories and development tools can be connected to provide support for secure software development.
A Grid-Ready Clinical Database for Parkinson's Disease Research and Diagnosis
Authors: Susumu Date, Takahito Tashiro, Kazunori Nozaki, Haruki Nakamura, Saburo Sakoda, Shinji Shimojo
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Parkinson's disease is a brain disease whose medical treatment and remedy have not been established yet, although a cause of this disease is considered to be the insufficient formation and action of dopamine, which plays a role of great importance in brain activity. For this reason, there is an increasing demand on the clinical database pertaining to Parkinson's disease which multiple hospitals and research institutions can share to accumulate knowledge and know-how on the disease. In this paper, we present a clinical database for Parkinson's disease research and diagnosis which we have preliminary built, especially focusing on the access control and data filtering mechanisms built in hope that medical Grid services are seamlessly integrated to the database in future.
Box integrals
Authors: D. H. Bailey, J. M. Borwein, R. E. Crandall
Venue: Journal of Computational and Applied Mathematics (2007)

By a ''box integral'' we mean here an expectation where r@? runs over the unit n-cube, with q@? and s fixed, explicitly:@!"0^1...@!"0^1((r"1-q"1)^2+...+(r"n-q"n)^2)^s^/^2dr"1...dr"n.The study of box integrals leads one naturally into several disparate fields of analysis. While previous studies have focused upon symbolic evaluation and asymptotic analysis of special cases (notably s=1), we work herein more generally-in interdisciplinary fashion-developing results such as: (1) analytic continuation (in complex s), (2) relevant combinatorial identities, (3) rapidly converging series, (4) statistical inferences, (5) connections to mathematical physics, and (6) extreme-precision quadrature techniques appropriate for these integrals. These intuitions and results open up avenues of experimental mathematics, with a view to new conjectures and theorems on integrals of this type.
Securing 'classical IP over ATM networks'
Authors: Carsten Benecke, Uwe Ellermann
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

This paper discusses some security issues of 'Classical IP over ATM' networks. After analyzing new threats to IP networks based on ATM, security mechanisms to protect these networks are introduced. The integration of firewalls into ATM networks requires additional considerations. We conclude that careful configuration of ATM switches and ATM services can provide some level of protection against spoofing and denial of service attacks. Our solutions are intended to be applied to current IP over ATM networks and do not require any changes to these protocols or additions to current switch capabilities.
Whole Genome Comparison on a Network of Workstations
Authors: Arpith Jacob, Sugata Sanyal, Marcin Paprzycki, Rajan Arora, Maria Ganzha
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Whole genome comparison consists of comparing or aligning genome sequences with a goal of finding similarities between them. Previously we have shown how SIMD Extensions used in Intel processors can be used to efficiently implement the, genome comparing, Smith-Waterman algorithm. Here we present distributed version of that algorithm. We show that on somewhat outdated hardware we can achieve speeds upwards of 8000 MCUPS; one of the fastest implementations of the Smith-Waterman algorithm.
Efficient computation of discrete voronoi diagram and homotopy-preserving simplified medial axis of a three-dimensional polyhedron
Authors: Dinesh Manocha
Venue:  (2006)

The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the Blum medial axis, a well known skeletal representation. Voronoi diagrams and medial axes have been shown useful for many 3D computations and operations, including proximity queries, motion planning, mesh generation, finite element analysis, and shape analysis. However, their application to complex 3D polyhedral and deformable models has been limited. This is due to the difficulty of computing exact Voronoi diagrams in an efficient and reliable manner. In this dissertation, we bridge this gap by presenting efficient algorithms to compute discrete Voronoi diagrams and simplified medial axes of 3D polyhedral models with geometric and topological guarantees. We apply these algorithms to complex 3D models and use them to perform interactive proximity queries, motion planning and skeletal computations. We present three new results. First, we describe an algorithm to compute 3D distance fields of geometric models by using a linear factorization of Euclidean distance vectors. This formulation maps directly to the linearly interpolating graphics rasterization hardware and enables us to compute distance fields of complex 3D models at interactive rates. We also use clamping and culling algorithms based on properties of Voronoi diagrams to accelerate this computation. We introduce surface distance maps, which are a compact distance vector field representation based on a mesh parameterization of triangulated two-manifolds, and use them to perform proximity computations. Our second main result is an adaptive sampling algorithm to compute an approximate Voronoi diagram that is homotopy equivalent to the exact Voronoi diagram and preserves topological features. We use this algorithm to compute a homotopy-preserving simplified medial axis of complex 3D models. Our third result is a unified approach to perform different proximity queries among multiple deformable models using second order discrete Voronoi diagrams. We introduce a new query called N-body distance query and show that different proximity queries, including collision detection, separation distance and penetration depth can be performed based on N-body distance query. We compute the second order discrete Voronoi diagram using graphics hardware and use distance bounds to overcome the sampling errors and perform conservative computations. We have applied these queries to various deformable simulations and observed up to an order of magnitude improvement over prior algorithms.
Self-Adapting Context Definition
Authors: Neil O'Connor, Raymond Cunningham, Vinny Cahill
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Many approaches to context-aware computing have focused on providing means for developers to define application contexts. In these approaches, correct application behavior depends on the developer defining the right contexts. The application cannot adapt incorrectly defined contexts as they are statically defined by the developer. We propose a method by which an application can use feedback to evaluate its contexts and adapt them where necessary. This results in more accurate context definitions and should lead to improved application performance. We discuss how this is achieved using Q-learning, and present a scenario and experimental results to support our approach.
Wi-Fi--The Nimble Musician in Your Laptop
Authors: David G. Leeper
Venue: Computer (2007)

Thanks to a marriage of computer engineering and wireless technology, Wi-Fi gives every laptop its own nimble musician to send and receive data.
A new differential space-time block coding scheme
Authors: Xun Shao, Jinhong Yuan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Most existing space-time coding schemes rely heavily on accurate channel estimation at the receiver., which is a difficult task in rapidly fading environment. The previous Tarokh and Jafarkhani (see IEEE Journal on Selected Areas in Comm., vol.18, no.7, p.1169-1174, 2000) differential space-time block code (DSTBC) suffers from the signal constellation expansion for QPSK and 8PSK modulation. We present a new differential space-time block coding scheme without constellation expansion. This is achieved by choosing differential coefficients appropriately in the signal mapping. The new scheme can be decoded by a Viterbi decoder. More importantly, it provides a differential coding gain of 1 dB-1.5 dB due to the redundancy introduced in the differential coding and it is only 2 dB away from the coherent space-time block codes.