ppxscal/embedding_network huggingface dataset:
Software reliability engineering with genetic programming
Authors: Taghi M. Khoshgoftaar
Venue:  (2003)

Software reliability engineering plays a vital role in managing and controlling software quality. As an important method of software reliability engineering, software quality estimation modeling is useful in defining a cost-effective strategy to achieve a reliable software system. By predicting the faults in a software system, the software quality models can identify high-risk modules, and thus, these high-risk modules can be targeted for reliability enhancements. Strictly speaking, software quality modeling not only aims at lowering the misclassification rate, but also takes into account the costs of different misclassifications and the available resources of a project. As a new search-based algorithm, Genetic Programming (GP) can build a model without assuming the size, shape, or structure of a model. It can flexibly tailor the fitness functions to the objectives chosen by the customers. Moreover, it can optimize several objectives simultaneously in the modeling process, and thus, a set of multi-objective optimization solutions can be obtained. This research focuses on building software quality estimation models using GP. Several GP-based models of predicting the class membership of each software module and ranking the modules by a quality factor were proposed. The first model of categorizing the modules into fault-prone or not fault-prone was proposed by considering the distinguished features of the software quality classification task and GP. The second model provided quality-based ranking information for fault-prone modules. A decision tree-based software classification model was also proposed by considering accuracy and simplicity simultaneously. This new technique provides a new multi-objective optimization algorithm to build decision trees for real-world engineering problems, in which several trade-off objectives usually have to be taken into account at the same time. The fourth model was built to find multi-objective optimization solutions by considering both the expected cost of misclassification and available resources. Also, a new goal-oriented technique of building module-order models was proposed by directly optimizing several goals chosen by project analysts. The issues of GP , bloating and overfitting, were also addressed in our research. Data were collected from three industrial projects, and applied to validate the performance of the models. Results indicate that our proposed methods can achieve useful performance results. Moreover, some proposed methods can simultaneously optimize several different objectives of a software project management team.
Probability distributions of volatility in financial time series
Authors: M. I. Krivoruchenko, E. Alessio, V. Frappietro, L. J. Streckert
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The problem with constructing probability density functions (PDFs) of volatility is discussed. The first model we have used represents the simple Gaussian random walk model. The PDF is given in the form of a one-dimensional contour integral. The second model we have used is based on the joint multidimensional Student PDFs of returns. Such distributions are useful for the description of well established deviations from the Gaussian random walk, observed for financial time series, such as an approximate scaling of the PDFs of returns, heavy tails of return distributions, return-volatility correlations and long ranged volatility-volatility correlations. We have fixed free parameters of the Gaussian and modified multidimensional Student PDFs of returns over a short term period by fitting three to eight years of trade-by-trade quotes from the Eurex Bund, Bobl, DAX and EuroSTOXX futures contracts, and over the long term by fitting 100+ years of the DOW Jones 30 Industrial Averages (DJIA) and 50+ years of the Standard & Poors 500 (S&P 500) daily quotes. Two estimators are considered to quantify volatility. These are short-term dynamic and long-term static PDFs that are then constructed. The volatility distributions are compared with the historical ones of the Eurex Bund, Bobl, DAX and EuroSTOXX futures contracts and also with the historical distributions for the DJIA and the S&P 500 indices.
Spectral analysis and the Riemann hypothesis
Authors: Gilles Lachaud
Venue: Journal of Computational and Applied Mathematics (2003)

The explicit formulas of Riemann and Guinand-Weil relate the set of prime numbers with the set of nontrivial zeros of the zeta function of Riemann. We recall Alain Connes' spectral interpretation of the critical zeros of the Riemann zeta function as eigenvalues of the absorption spectrum of an unbounded operator in a suitable Hilbert space. We then give a spectral interpretation of the zeros of the Dedekind zeta function of an algebraic number field K of degree n in an automorphic setting.If K is a complex quadratic field, the torical forms are the functions defined on the modular surface X, such that the sum of this function over the "Gauss set" of K is zero, and Eisenstein series provide such torical forms.In the case of a general number field, one can associate to K a maximal torus T of the general linear group G. The torical forms are the functions defined on the modular variety X associated to G, such that the integral over the subvariety induced by T is zero. Alternately, the torical forms are the functions which are orthogonal to orbital series on X.We show here that the Riemann hypothesis is equivalent to certain conditions bearing on spaces of torical forms, constructed from Eisenstein series, the torical wave packets. Furthermore, we define a Hilbert space and a self-adjoint operator on this space, whose spectrum equals the set of critical zeros of the Dedekind zeta function of K.
Generalized transforms for DSP and generalized spectral analysis
Authors: Michael J. Corinthios
Venue: Systems Analysis Modelling Simulation (2003)

Recent advances in computer, robotics and Internet technologies have enhanced the importance of digital signal processing tools, parallel processing and multi-processing research. The recent developments in microelectronics and fiber optics technologies have called for faster digital signal processors for data compression, coding, secure communication, and multimedia applications. Man-machine interaction, the adaptive control of fast moving objects, spaceships and increasingly intelligent and complex robotics have motivated research in faster computers and massively parallel processors. Adaptive on-line system identification of fast time varying systems is a problem that has received greater attention in recent years. Generalized spectral analysis transforms and factorizations thereof lead to highly efficient tools for parameter identification in the presence of noise and highly efficient coding techniques. This chapter presents novel spectral analysis definitions and general base parallel processors for the implementation of DSP algorithms, and modern generalized spectral analysis transforms destined for such high-speed applications. The Weighted Laplace and z-transform generalized spectra are shown to unmask the poles and zeros of finite duration continuous time and discrete time systems. The Generalized Chrestenson-Walsh transform is shown to be a generalization of the Fourier Transform and as such provides a wider range of coding and multimedia compression possibilities. Massive parallelism is implemented using general base hypercube transformations.
A view of coroutines
Authors: Dick Grune
Venue: ACM SIGPLAN Notices (1977)

The coroutine mechanism is explained as a simplified implementation of a special case in parallel processing.
Incremental training of first order recurrent neural networks to predict a context-sensitive language
Authors: Stephan K. Chalup, Alan D. Blair
Venue: Neural Networks (2003)

In recent years it has been shown that first order recurrent neural networks trained by gradient-descent can learn not only regular but also simple context-free and context-sensitive languages. However, the success rate was generally low and severe instability issues were encountered. The present study examines the hypothesis that a combination of evolutionary hill climbing with incremental learning and a well-balanced training set enables first order recurrent networks to reliably learn context-free and mildly context-sensitive languages. In particular, we trained the networks to predict symbols in string sequences of the context-sensitive language {anbncn; n ≥ 1}. Comparative experiments with and without incremental learning indicated that incremental learning can accelerate and facilitate training. Furthermore, incrementally trained networks generally resulted in monotonic trajectories in hidden unit activation space, while the trajectories of non- incrementally trained networks were oscillating. The non-incrementally trained networks were more likely to generalise.
Bounds on the number of hidden neurons in three-layer binary
Authors: Zhaozhi Zhang, Xiaomin Ma, Yixian Yang
Venue: Neural Networks (2003)

This paper investigates an important problem concerning the complexity of three-layer binary neural networks (BNNs) with one hidden layer. The neuron in the studied BNNs employs a hard limiter activation function with only integer weights and an integer threshold. The studies are focused on implementations of arbitrary Boolean functions which map from {0, 1}n into {0, 1}. A deterministic algorithm called set covering algorithm (SCA) is proposed for the construction of a three-layer BNN to implement an arbitrary Boolean function. The SCA is based on a unit sphere covering (USC) of the Hamming space (HS) which is chosen in advance. It is proved that for the implementation of an arbitrary Boolean function of n-variables (n ≥ 3) by using SCA, ⌊3L/2⌋ hidden neurons are necessary and sufficient, where L is the number of unit spheres contained in the chosen USC of the n-dimensional HS. It is shown that by using SCA, the number of hidden neurons required is much less than that by using a two-parallel hyperplane method. In order to indicate the potential ability of three-layer BNNs, a lower bound on the required number of hidden neurons which is derived by using the method of estimating the Vapnik-Chervonenkis (VC) dimension is also given.
The relationship between the uniqueness ofcomputer ethics and its independence as adiscipline in applied ethics
Authors: Kenneth Einar Himma
Venue: Ethics and Information Technology (2004)

A number of different uniqueness claims have been made about computer ethics in order to justify characterizing it as a distinct subdiscipline of applied ethics. I consider several different interpretations of these claims and argue, first, that none are plausible and, second, that none provide adequate justification for characterizing computer ethics as a distinct subdiscipline of applied ethics. Even so, I argue that computer ethics shares certain important characteristics with medical ethics that justifies treating both as separate subdisciplines of applied ethics.
Invertible substitutions and Sturmian sequences
Authors: Bo Tan, Zhi-Ying Wen
Venue: European Journal of Combinatorics (2003)

It is known on the one hand that a Sturmian sequence can be generated geometrically by the intersections of a straight line with the unit grid in the plane, and on the other hand that fixed points of invertible substitutions are Sturmian. We give a new characterization of invertible substitutions, which allows to determine the straight line which generates the fixed point of a given invertible substitution.
An adaptive three-dimensional DCT compression based on motion analysis
Authors: Borko Furht, Ken Gustafson, Hesong Huang, Oge Marques
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this paper, we propose an adaptive 3D-DCT compression technique, which dynamically determines an optimal size of the video cube based on the motion analysis. The technique consists of two steps: (a) it analyses the motion within a small (16x16) video cube of eight successive frames, and (b) it selects the size of the cube based on the motion analysis and applies the 3D-DCT algorithm on the selected video cube. The effectiveness of the proposed technique is illustrated by implementing it to a number of video sequences with low, medium, and high motion.
On homological properties of locally polar spaces
Authors: Vladimir P. Burichenko
Venue: European Journal of Combinatorics (2003)

Recall that the flag complex of a geometry is the complex whose points are objects and simplices are flags of this geometry. A geometry is Cohen-Macaulay if the reduced homology of its flag complex vanishes in all dimensions except for the top one, and all residues also have this property. It is proved in the article that the locally polar spaces of order two are Cohen-Macaulay. Results of this kind have applications to studying cohomology of groups acting on geometries.
Constructing a class of designs with proportional balance
Authors: Ken Gray, Anne Penfold Street
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

Proportionally balanced designs were introduced by Gray and Matters in response to a need for the allocation of markers of the Queensland Core Skills Test to have a certain property. They have further application in experiments where efficient achievement of the purposes demands that some of the objects of study (varieties) occur more frequently in the experiment than do others. Subsequently, Gray extended the theoretical results relating to such designs and provided further instances, and two general constructions, in the case that the designs comprise blocks of precisely two sizes.In this paper, we introduce a new construction for proportionally balanced designs when each variety occurs with one of precisely two possible frequencies, and provide some exhaustive lists of possible parameter sets, and sets of blocks for some of the corresponding designs. Two general constructions associated with this method are also discussed.
Pole Placement and Matrix Extension Problems: A Common Point of View
Authors: Meeyoung Kim, Joachim Rosenthal, Xiaochang Alex Wang
Venue: SIAM Journal on Control and Optimization (2003)

This paper studies a general inverse eigenvalue problem which generalizes many well-studied pole placement and matrix extension problems. It is shown that the problem corresponds geometrically to a so-called central projection from some projective variety. The degree of this variety represents the number of solutions the inverse problem has in the critical dimension. We are able to compute this degree in many instances, and we provide upper bounds in the general situation.
A multi-agent system for remote psychological profiling with role playing games based tests
Authors: Stefania Bandini, Sara Manzoni, Giuseppe Vizzari
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper describes a web-based computer system to support psychological evaluation for employee selection or assessment. Candidate profiling is based on jungian psychology and the theory of archetypes. The test is proposed to the candidate in the form of a Role Playing Game session to avoid repetitiveness and predictability, and therefore to increase its effectiveness. The profiling engine is a multi-agent system that dynamically builds the test, basing on the candidate's behaviour and on the kind of job he is being tested for, choosing between available story modules. Information about psychological model, scenographic modules and operative data is stored in a Object Oriented DBMS. The system provides a remote test interface for candidates and configuration tools as well.
Higher-Order Asymptotics of Mutual Information for Nonlinear Channels with Non-Gaussian Noise
Authors: V. V. Prelov, E. C. Van Der Meulen
Venue: Problems of Information Transmission (2003)

Nonlinear channels with non-Gaussian noise where the transmitted signal is a random function of the input signal are considered. Under some assumptions on smoothness and the behavior of tails of the noise density function, higher-order asymptotics of the mutual information between the input and output signals in such channels is obtained, as the mean power of the input signal (or, equivalently, the signal-to-noise ratio) goes to zero.
A Proposal of an Upfront Requirements Modeling and Design Practice for e-Commerce Projects
Authors: Ghada Alaa, Guy Fitzgerald
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This paper examines the nature of e-commerce systems development and finds that e-commerce is different requiring a high degree of business innovation and responsiveness. A study undertaken on a B-B e-marketplace in Egypt illustrates the problems with the use of traditional analysis and design techniques. They reduce imagination and the ability to respond to change, as they are systematic, comprehensive and plan-driven. The study focuses attention on the importance of modeling value-added services beside businesses processes for e-commerce applications, as well as the need for self-organizing, non-prescriptive activities, which we call the Practice', that enhances creative thinking and self-reflection on the problem situation. As a response to these findings an upfront requirements modeling and design practice' is identified, outlined, and experimented with. It is based on brainstormingsessions guided by the use of a 'non-prescriptive' requirements modeling tool that provides aclassification of the possible different e-commerce issues. The introduced tool (the e-Business Issues Roadmap) helps to trigger issues and design ideas. The results found a number of business innovative ideas that were unlikely to have been generated by traditional analysis models.
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models
Authors: Maziar Goudarzi, Shaahin Hessabi, Alan Mycroft
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We unify virtual-method despatch (polymorphism implementation) and network packet-routing operations; virtual-method calls correspond to network packets, and network addresses are allocated such that routing the packet corresponds to dispatching the call. As the run-time routing structure is inherent in Network-on-Chip platforms, this unification implements polymorphism for free.
Helping to avoid e-discrimination in UK tertiary education
Authors: David Sloan, Lawrie Phipps
Venue: Proceedings of the 2003 conference on Universal usability (2003)

The UK e-learning and disability agenda is discussed, and how it is affected by social inclusion and government initiatives and legislation. The important role of the TechDis service in this initiative is also described, and how it is helping the tertiary education community in the UK to use technology to improve inclusion for staff and students with disabilities. An outline of the approach TechDis has taken to achieve its goals is provided, along with current issues being addressed by the service.
Comparing the sizes of nondeterministic branching read-k-times programs
Authors: E. A. Okol'nishnikova
Venue: Discrete Applied Mathematics (2004)

We compare the complexities of Boolean functions for nondeterministic syntactic read-k-times branching and branching read-sk-times programs. It is shown that for each natural number k, k ≥ 2, there exists a sequence of Boolean functions such that the complexity of computation of each function of this sequence by nondeterministic syntactic branching read-k-times programs is exponentially larger (with respect to the number of variables of the Boolean function) than by nondeterministic branching read-(k ln k/ln 2 + C)-times programs, where C is a constant independent of k. Besides, it is shown that for each natural numbers N and k(N), where 4 ≤ k(N) < C2 √ln N/ln ln N and C2 < √2 is a constant independent of k and N, there exists a Boolean function in N variables such that the complexity of this function for nondeterministic syntactic read-k-times branching programs is exponentially larger (with respect to N) than for nondeterministic syntactic read-(k, ln k/ln 2 + C)-times branching programs.
Key indicators for successful internet commerce: a South African study
Authors: Sam Lubbe, Shaun Pather
Venue: The economic and social impacts of e-commerce (2003)

The advent of e-commerce has brought about new implications on research directions in the business arena. Is it not sufficient to just study the formation of electronic markets in e-commerce. It is also necessary to have insight into the electronic markets' innermost workings. This chapter, therefore, highlights the factors that give these new organizational forms (e-commerce enterprises) sustainable competitive advantages. The chapter is present in three main sections: A study of variety of reports of practitioners and researchers from the international arena, provide a background of prior knowledge in the filed. The analysis of this knowledge base is conceptualized into a framework of key factors affecting e-commerce success. Finally, the results of an empirical study of South African e-businesses are reported on. The authors provide some insight on the application of the conceptual framework as applied in the South African situation.
A Cooperative Framework for Inter-Organizational Workflow System
Authors: Shung-Bin Yan, Feng-Jian Wang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Workflow management systems (WfMSs) are acceptedworldwide due to their capability to model and controlbusiness processes. With WfMS, enterprises can improvework efficiency and react to the emergent situationquickly. However, most WfMSs adopt the centralizedarchitecture in an organization so that they usually lackof a cooperative communication mechanism acrossdifferent organizations.In this paper, we propose a cooperative framework forinter-organizational workflow systems. The frameworkconsists of an inter-workflow meta-model, CA-PLAN(Cooperative Agentflow Process LANguage), and aprototype system based on Agentflow, a system developedin our laboratory. The cooperation mechanism betweenWfMSs in CA-PLAN is modeled as a Remote Call Process(RCP) paradigm.A Process Service is a mechanism that defines aprocess to participate in an inter-organizational processamong different WfMSs and specifies the associatedarguments in and out. A Remote Process is a proxymechanism that refers to a process service on anotherWfMS. RCP provides the mechanism by which theprocess service and the remote process communicate andpass information back and forth and process monitormechanism. The mechanism, also allowing dynamicchanges and reconfiguration, can adapt dynamic andcompetitive business environment. Through RCP, thecooperative process across organizations becomessimple, faster, and flexible.