ppxscal/embedding_network huggingface dataset:
Using Academic Courses for Empirical Validation of Software Development Processes
Authors: Marcus Ciolkowski, Dirk Muthig, Jorg Rech
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Software Process Improvement needs sound empirical data gathered from a range of empirical studies such as controlled experiments or case studies. However, conducting empirical studies is often cost-intensive; in particular in industrial environments. Therefore, we need to find a way to balance cost and value of empirical findings. In this paper, we discuss a way of gathering required empirical data in Software Engineering education programs. Although an academic setting is not representative of industrial organizations, the information gathered there can help organizations to decide upon alternatives to improve current software engineering processes. We describe how a practical software engineering course for graduate students at the University of Kaiserslautern was used as a platform for validating software development approaches. As there are specific restrictions and constraints defined by this context, we discuss how they influence the design of empirical studies. In addition, we present a concrete example of comparing product line approaches.
New notions of security: achieving universal composability without trusted setup
Authors: Manoj Prabhakaran, Amit Sahai
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion involves comparing the real protocol execution with an ideal execution involving ideal functionalities (just as in UC-security), but allowing the environment and adversary access to some super-polynomial computational power. We argue the meaningfulness of the new notion, which in particular subsumes many of the traditional notions of security. We generalize the Universal Composition theorem of [3] to the new setting. Then under new computational assumptions, we realize secure multi-party computation (for static adversaries) without a common reference string or any other set-up assumptions, in the new framework. This is known to be impossible under the UC framework.
An Explicit Construction for a Ramsey Problem
Authors: Dhruv Mubayi
Venue: Combinatorica (2004)

An explicit coloring of the edges of Kn is constructed such that every copy of K4 has at least four colors on its edges. As n &#x2192; &#x221e;, the number of colors used is n1/2+o(1). This improves upon the previous bound of O(n2/3) due to Erd&#x0151;s and Gy&#x00e1;rf&#x00e1;s obtained by probabilistic methods. The exponent 1/2 is optimal, since it is known that at least &#x03a9;(n1/2) colors are required in such a coloring.The coloring is related to constructions giving lower bounds for the multicolor Ramsey number rk(C4). It is more complicated however, because of restrictions imposed on interactions between color classes.
Managing Uncertainties in Image Databases: A Fuzzy Approach
Authors: A. Chianese, A. Picariello, L. Sansone, M. L. Sapino
Venue: Multimedia Tools and Applications (2004)

In this paper we present a fuzzy approach for image databases. We exploit the concept of NF2 relational model as a foundation for building image catalogues containing the semantic description of a given image database. New algebraic operators are defined in order to capture the fuzziness related to the semantic descriptors of an image. We compare our model to the First Normal Form annotated relation model, and show that in a number of interesting cases they can be considered equivalent, from the operational point of view, but in general NF2 relational model is more powerful, and provides a more suitable framework for dealing with uncertainties in image databases.
A First-Order Superscalar Processor Model
Authors: Tejas S. Karkhanis, James E. Smith
Venue: ACM SIGARCH Computer Architecture News (2004)

A proposed performance model for superscalar processorsconsists of 1) a component that models the relationshipbetween instructions issued per cycle and the sizeof the instruction window under ideal conditions, and 2)methods for calculating transient performance penaltiesdue to branch mispredictions, instruction cache misses,and data cache misses.Using trace-derived data dependenceinformation, data and instruction cache miss rates,and branch miss-prediction rates as inputs, the model canarrive at performance estimates for a typical superscalarprocessor that are within 5.8% of detailed simulation onaverage and within 13% in the worst case. The modelalso provides insights into the workings of superscalarprocessors and long-term microarchitecture trends such aspipeline depths and issue widths.
Towards an Event-Driven Workplace for Knowledge Integration
Authors: Alexander Schatten, Stefan Biffl
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

A contemporary office or knowledge worker has to deal with an ever increasing number of information channels and associated ows of events (i.e., software applications using varying terminologies and access procedures). The events from different sources in varying terminology need suitable interpretation in the local context for (a) determining basic relevance, (b) understanding context-specific semantics, and (c) making and maintaining semantic connections between information demands from different sources. Without (tool) support the office-worker has to use her brain for this overhead activity instead of focusing on the actual work. This paper introduces concepts on how to standardize "business events" to allow unified treatment of information ow regardless of the specific information channel they come from. These concepts of unified meta-data extraction, meta-data annotation, and unified user-to-storage interface (i.e., a non-intrusive personal assistant) relieve the user from unnecessary interpretation work load. Further they allow tool support to build up new knowledge based on aggregated information from "relevant semantic connections" between information units coming from any channels.
A primal-dual trust region algorithm for nonlinear optimization
Authors: E. Michael Gertz, Philip E. Gill
Venue: Mathematical Programming: Series A and B (2004)

This paper concerns general (nonconvex) nonlinear optimization when first and second derivatives of the objective and constraint functions are available. The proposed method is based on finding an approximate solution of a sequence of unconstrained subproblems parameterized by a scalar parameter. The objective function of each unconstrained subproblem is an augmented penalty-barrier function that involves both primal and dual variables. Each subproblem is solved using a second-derivative Newton-type method that employs a combined trust region and line search strategy to ensure global convergence. It is shown that the trust-region step can be computed by factorizing a sequence of systems with diagonally-modified primal-dual structure, where the inertia of these systems can be determined without recourse to a special factorization method. This has the benefit that off-the-shelf linear system software can be used at all times, allowing the straightforward extension to large-scale problems. Numerical results are given for problems in the COPS test collection.
Analysis of sparse representation and blind source separation
Authors: Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari
Venue: Neural Computation (2004)

In this letter, we analyze a two-stage cluster-then-l1-optimization approach for sparse representation of a data matrix, which is also a promising approach for blind source separation (BSS) in which fewer sensors than sources are present. First, sparse representation (factorization) of a data matrix is discussed. For a given overcomplete basis matrix, the corresponding sparse solution (coefficient matrix) with minimum l1 norm is unique with probability one, which can be obtained using a standard linear programming algorithm. The equivalence of the l1 -norm solution and the l0-norm solution is also analyzed according to a probabilistic framework. If the obtained l1 -norm solution is sufficiently sparse, then it is equal to the l0 -norm solution with a high probability. Furthermore, the l1 -norm solution is robust to noise, but the l0 -norm solution is not, showing that the l1 -norm is a good sparsity measure. These results can be used as a recoverability analysis of BSS, as discussed. The basis matrix in this article is estimated using a clustering algorithm followed by normalization, in which the matrix columns are the cluster centers of normalized data column vectors. Zibulevsky, Pearlmutter, Boll, and Kisilev (2000) used this kind of two-stage approach in underdetermined BSS. Our recoverability analysis shows that this approach can deal with the situation in which the sources are overlapped to some degree in the analyzed domain and with the case in which the source number is unknown. It is also robust to additive noise and estimation error in the mixing matrix. Finally, four simulation examples and an EEG data analysis example are presented to illustrate the algorithm's utility and demonstrate its performance.
Self-Adaptive and Self-Optimising Resource Monitoring for Dynamic Grid Environments
Authors: Helene N. Lim Choi Keung, Justin R. D. Dyson, Stephen A. Jarvis, Graham R. Nudd
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

As the number of resources on the Grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper concentrates on the scalability, reliability and performance of Grid discovery and monitoring services, using autonomous concepts. Application scenarios are developed where the notification rate of data is dynamically modified, based on the overhead costs at the MDS3 Index Service. Previously collected performance benchmarks are also utilised to implement two self-adaptive algorithms which are the basis of the scenarios. The objective of these feedback algorithms is to sustain an adequate level of service for clients while minimisingcosts at the MDS. Different types of workload models are also used to assess the efficiency of the algorithms. Experimental results are subsequently shown when varying notification update mechanisms and decision parameters are used, ensuring that the MDS is scalable with accruing concurrent clients. Therefore, a policy is proposed where the notification rate is computed dynamically, thereby creating an autonomous Grid monitoring service.
A Novel Packet Marking Scheme for IP Traceback
Authors: Basheer Al-Duwairi, G. Manimaran
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Recently, several schemes have been proposed for IPtraffic source identification for tracing denial of service(DoS) attacks. Most of these schemes require very largenumber of packets to conduct the traceback process, whichresults in lengthy and complicated procedure. In this paper,we address this issue by proposing a new scheme, calledProbabilistic Pipelined Packet Marking (PPPM), which employsthe concept of "pipeline" for propagating markinginformation from one marking router to another so that iteventually reaches the destination. The key benefit of thispipeline process lies in drastically reducing the number ofpackets that is required for the traceback process. We evaluatethe effectiveness of the proposed scheme for variousperformance metrics through combination of analytical andsimulation studies. Our studies show that the proposedscheme offers high attack source detection percentage, andattack source localization distance of less than two hops underdifferent attack scenarios.
Evaluation of SIMD Architecture Enhancement in Embedded Processors for MPEG-4
Authors: Ali R. Iranpour, Krzysztof Kuchcinski
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents our studies on the effects of using SIMD processor extension developed to enhance the processor performance for streaming applications. Our approach was evaluated using MPEG-4 encoding application as benchmark. Although MPEG-4 consists of many different operations, we concentrated on the Sum of Absolute Differences (SAD), a major part of the motion estimation. The SAD was chosen because it is one of the most frequently used operations in MPEG-4 encoding. It is estimated to consume between 40%-80% of the total video encoding time when implemented on a general purpose processor. We have performed an extensive evaluation of our architecture extension. This evaluation showed that it is possible to achieve high performance with acceptable power consumption. We obtained about two times performance improvement for MPEG-4 encoding with roughly the same power consumption.
A note on the functional estimation of values of hidden variables: an extended module for expert systems
Authors: Nicholas V. Findler, Ron Lo
Venue: ACM SIGACT News (1983)

The paper describes an extension of our work on the Generalized Production Rules System. In its original form, it could estimate at a given point of time or space the value of <u>hidden variables</u>---variables that can be measured only intermittently or periodically. In contrast, <u>open variables</u> are readily measurable any time. The system establishes stochastic, causal relations, <u>generalized production rules</u>, between known values of hidden variables and certain mathematical properties of the open variables' behavior. These rules are then used to make the point estimates.We have now provided the system with the additional ability to estimate the <u>functional behavior</u> of the hidden variables. The system can serve as a domain-independent module to a knowledge-based expert system in need of such numerical estimates.
Representing and analysing integrated engineering systems through combinatorial representations
Authors: Offer Shai, Daniel Rubin
Venue: Engineering with Computers (2004)

The current paper introduces a systematic method for representing and analysing coupled integrated engineering systems by means of general discrete mathematical models, called Combinatorial Representations, that can be conveniently implemented in computers. The combinatorial representation of this paper, which is based on graph theory, was previously shown to be useful in representing engineering systems from different engineering domains. Once all of the subsystems of an integrated multidisciplinary system are brought up to the common level of the combinatorial representation, they cease to be separated from one another and the analysis process is applied to all of the engineering elements disregarding the domain to which they belong.During the development of the representation and study of its inherent properties, special attention was dedicated to developing an efficient analysis method. A vectorial extension of the mixed variable method known from electrical network theory was found to be the most suitable choice for this purpose.In the paper, the approach is implemented by representing and analysing two systems: one that is a macro system comprised of truss, dynamic and electric elements, and another that is a comb-driven micro-resonator. The techniques presented in the paper are not limited to analysis only, but can be applied to many other aspects of engineering research. Among them is a systematic derivation of new ways of presenting engineering elements, one of which &#x2013; the process of derivation of a new type of force representation entitled &#x201c;face force&#x201d; &#x2013; is described in the paper.
TOSS: an extension of TAX with ontologies and similarity queries
Authors: Edward Hung, Yu Deng, V. S. Subrahmanian
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

TAX is perhaps the best known extension of the relational algebra to handle queries to XML databases. One problem with TAX (as with many existing relational DBMSs) is that the semantics of terms in a TAX DB are not taken into account when answering queries. Thus, even though TAX answers queries with 100% precision, the recall of TAX is relatively low. Our TOSS system improves the recall of TAX via the concept of a similarity enhanced ontology (SEO). Intuitively, an ontology is a set of graphs describing relationships (such as isa, partof, etc.) between terms in a DB. An SEO also evaluates how similarities between terms (e.g. "J. Ullman", "Jeff Ullman", and "Jeffrey Ullman") affect ontologies. Finally, we show how the algebra proposed in TAX can be extended to take SEOs into account. The result is a system that provides a much higher answer quality than TAX does alone (quality is defined as the square root of the product of precision and recall). We experimentally evaluate the TOSS system on the DBLP and SIGMOD bibliographic databases and show that TOSS has acceptable performance.
Modelling detonation waves in heterogeneous energetic materials
Authors: Ashwin Chinnayya, Eric Daniel, Richard Saurel
Venue: Journal of Computational Physics (2004)

The computation of detonation waves in heterogeneous explosives involves compressible multiphase mixtures due to the chemical decomposition of the energetic material as well as its heterogeneous initial formulation. Also material interfaces are present between the explosive and the surrounding inert or reactive materials. We develop a new method for the modelling of interface problems and multiphase mixtures in the particular limit where phases pressures and velocities relax towards equilibrium very fast. This method is a variant of the discrete equations for multiphase mixtures proposed by Abgrall and Saurel [J. Comput. Phys. 186 (2) (2003) 361]. The new discrete model is adapted to reacting flows with mass, momentum and energy transfer. The model is based on the pure material equation of state only (no mixture equation of state is used) for the computation of the reaction zone of detonation waves. The algorithm is full Eulerian and fulfills interface conditions between mixtures and pure materials automatically. It is validated over a set of difficult test problems with exact solution and its multi-dimensional capabilities are shown over problems involving a large number of materials.
Provisioning Expedited Forwarding DiffServ Channels using Multimedia Aggregates
Authors: Enrique Hernandez-Orallo, Joan Vila-Carbo, Sergio Saez-Barona, Silvia Terrasa-Barrena
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper presents methods and tools for the optimal dimensioning of Differentiated Services Networks and, in particular, for the Expedited Forwarding Class of Service. The proposed method minimises the bandwidth reservation of a traffic aggregate to provide a given maximum delay. The paper also introduces several methods to generate multimedia traffic aggregation using real video traces. The method is evaluated in several scenarios using these traffic traces. The results of these simulations allow us to discover the relationship between a required delay and the necessary bandwidth reservation (or the achievable utilisation limit). An interesting conclusion of these scenarios is that, following several recommendations, the link utilisation can reach values of around 80% or higher. The advantages of using short-term provisioning versus long-term provisioning are also studied.
Boundary Feedback Stabilization of the Undamped Euler--Bernoulli Beam with Both Ends Free
Authors: Faming Guo, Falun Huang
Venue: SIAM Journal on Control and Optimization (2004)

In this paper, we are concerned with a boundary feedback system of a class of nonuniform undamped Euler--Bernoulli beam with both ends free. We give some sufficient conditions and some necessary conditions for the system to have exponential stability. Our method is based on the operator semigroup technique, the multiplier technique, and the contradiction argument of the frequency domain method.
OOP via C++, C#...?
Authors: Vladimir Nodelman
Venue: ACM SIGCSE Bulletin (2004)

This presentation describes our experience in transition from C++ to C# while teaching object-oriented programming.
Optimization of query streams using semantic prefetching
Authors: Ivan T. Bowman, Kenneth Salem
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Streams of relational queries submitted by client applications to database servers contain patterns that can be used to predict future requests. We present the Scalpel system, which detects these patterns and optimizes request streams using context-based predictions of future requests. Scalpel uses its predictions to provide a form of semantic prefetching, which involves combining a predicted series of requests into a single request that can be issued immediately. Scalpel's semantic prefetching reduces not only the latency experienced by the application but also the total cost of query evaluation. We describe how Scalpel learns to predict optimizable request patterns by observing the application's request stream during a training phase. We also describe the types of query pattern rewrites that Scalpel's cost-based optimizer considers. Finally, we present empirical results that show the costs and benefits of Scalpel's optimizations.
Interface trapping properties of nMOSFETs with Al2O3/SiOxNy/Si(100) gate dielectric stacks after exposure to ionizing radiation
Authors: J. A. Felix, H. D. Xiong, D. M. Fleetwood, E. P. Gusev, R. D. Schrimpf, A. L. Sternberg, C. D'Emic
Venue: Microelectronic Engineering (2004)

The interface properties of Al2O3/SiOx, Ny,/Si(100) nMOSFETs are examined using sub-threshold current-voltage. variable base charge pumping, and low frequency (1/f) noise measurements. It is shown that exposure to ionizing irradiation leads to a reduction in effective interface trap density (Dit) for both positive and negative bias irradiations. This effect may result from radiation-induced neutralization of a large pre-irradiation density of border traps.
Owned Policies for Information Security
Authors: Hubie Chen, Stephen Chong
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

In many systems, items of information have ownersassociated with them. An owner of an item of informationmay want the systemto enforce a policy thatrestricts use of that information; we call such a policyan owned policy . Owned policies can be used in manycontexts, including information flow, access control,and software licensing. In this paper we introduce andstudy a general framework for owned policies.Relationships between security policies for a givensystem may be dependent on system aspects thatchange between or during system execution. As a result,there may be only partial knowledge of thestructure of security policies available when analyzinga system statically. We demonstrate that ourframework permits static reasoning about owned policiesunder partial knowledge, and we also exhibittractability results for the problem of inferring securitypolicies.