ppxscal/embedding_network huggingface dataset:
Diagnosis of the significance of inconsistencies in object-oriented designs: a framework and its experimental evaluation
Authors: George Spanoudakis, Hyoseob Kim
Venue: Journal of Systems and Software (2002)

This paper presents: (a) a framework for assessing the significance of inconsistencies which arise in object-oriented design models that describe software systems from multiple perspectives, and (b) the findings of a series of experiments conducted to evaluate it. The framework allows the definition of significance criteria and measures the significance of inconsistencies as beliefs for the satisfiability of these criteria. The experiments conducted to evaluate it indicate that criteria definable in the framework have the power to create elaborate rankings of inconsistencies in models.
Linear and radial canonical transforms of fractional order
Authors: A. Torre
Venue: Journal of Computational and Applied Mathematics (2003)

The Laplace and Barut-Girardello transforms of fractional order are introduced and their relations to canonical transformations, parabolic differential equations and special functions are discussed.
A parallelization of a heuristic for the maximum Clique problem
Authors: Roberto Cruz, Nancy Lopez, Christian Trefftz
Venue: Journal of Computing Sciences in Colleges (2001)

A Parallelization of a new Heuristic for the Maximum Clique Problem is described. The heuristic is based on neural networks. The parallelization was performed on a SMP machine using Fortran and Open MP directives. Reasonable speedups were obtained for a variety of test graphs. Further improvements to the heuristic were developed based on the initial parallel results.
On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial
Authors: Moawwad El-Mikkawy, Beih El-Desouky
Venue: Applied Mathematics and Computation (2003)

This paper gives a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial. The generalized Stirling numbers of the first and second kind denoted sn,k[a] and Sn,k[a] respectively are given symbolically for the case n = 5, as an illustrative example, by using MAPLE programming [MAPLE V R3 Programming Reference Manual]. These numbers depend on n, k and n distinct values a1, a2,..., an. The ordinary Stirling numbers sn,k and Sn,k may be obtained as special cases by taking ai = i - 1, i = 1(1)n.
A data-centric design for n-tier architecture
Authors: Paul D. Manuel, Jarallah AlGhamdi
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

The increasing heterogeneity, complexity, and distributed nature of deployment architectures only serve to compound the problems faced by software solutions. With the advent of the Internet and web technologies, system designers have had to reevaluate the applicability of n-tier architectures, and assess which technologies are appropriate at each tier. In this paper we evaluate the design issues of n-tier architecture. We debate whether it is good to move code or data to communicate messages between applications. Based on the latest technology of J2EE and .NET framework, we recommend a data centric design of n-tier architecture. Based on our experience we also suggest a modified interactive software process model.
Genetic algorithms for MD-optimal follow-up designs
Authors: Chuen-Lung Chen, Rong-Ho Lin, Jianping Zhang
Venue: Computers and Operations Research (2003)

The 2k-p fractional factorial design is the most widely used technique for industrial experimentation. This is because it can significantly reduce the number of experimental runs so that the application of experimental design to problems with a large number of factors becomes possible. However, the application of this technique usually causes the loss of important information. That is, some effects of the experiment may confound with each other and cannot be clearly identified. The follow-up design is a tool used to untangle the confounded effects produced in the initial experiment. In this research, a heuristic based on an effective evolutionary algorithm, Genetic Algorithms, has been developed to generate the optimal follow-up design. The heuristic has been applied in two common test examples. The result showed that the heuristic could simply find optimal follow-up designs, and dominate the existing algorithm.
Bnet: Designing a Connectionless Broadband Data Service in an ATM Network by Simulated Annealing
Authors: B. Stavrov, J. de Jogh, A. van Lomwel, R. in't Velt
Venue: Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (1995)

The advent of ATM technology combined with the new ideas and principles of broadband communications has made possible efficient transmission of voice, video, data and multimedia services. It also has introduced a lot of new operational issues. One such issue is the internetworking of the more traditional connectionless LANs and MANs across a connection-oriented ATM network. One of the proposed concepts is to introduce connectionless servers (CLS) throughout the network for routing of the connectionless traffic. An area of significant challenge to the network providers is where to place the CLSs in the network and how to connect them. This paper describes Bnet, a program tool designed to find the minimum cost CLS network structure with respect to certain budget considerations. A routing algorithm is also provided.
Optimization of Lie group methods for differential equations
Authors: S. Blanes, F. Casas
Venue: Future Generation Computer Systems (2003)

In this paper we present a technique for reducing to a minimum the number of commutators required in the practical implementation of Lie group methods for integrating numerically matrix differential equations. This technique is subsequently applied to the linear and nonlinear case for constructing new geometric integrators, optimal with respect to the number of commutators.
Testing for neglected nonlinearity in time series models: a comparison of neural network methods and alternative tests
Authors: Tae-Hwy Lee, Halbert White, Clive W. J. Granger
Venue: Essays in econometrics: Spectral analysis, seasonality, nonlinearity, methodology, and forecasting (2001)

In this paper a new test, the neural network test for neglected nonlinearity, is compared with the Keenan test, the Tsay test, the White dynamic information matrix test, the McLeod-Li test, the Ramsey RESET test, the Brock-Dechert-Scheinkman test, and the Bispectrum test. The neural network test is based on the approximating ability of neural network modeling techniques recently developed by cognitive scientists. This test is a Lagrange multiplier test that statistically determines whether adding 'hidden units' to the linear network would be advantageous. The performance of the tests is compared using a variety of non-linear artificial series including bilinear, threshold autoregressive, and nonlinear moving average models, and the tests are applied to actual economic time series. The relative performance of the neural network test is encouraging. Our results suggest that it can play a valuable role in evaluating model adequacy. The neural network test has proper size and good power, and many of the economic series tested exhibit potential nonlinearities.
Object-oriented programming in TCL/TK
Authors: Peter C. Isaacson
Venue: Journal of Computing Sciences in Colleges (2001)

[incr Tcl], an object-oriented extension for Tcl, will be used to introduce object-oriented concepts into the Introduction to Computer Science course at the University of Northern Colorado. Tcl, an extensible, scripting language, and Tk, an extension to Tcl for building GUIs, have previously been used successfully in the same course.[incr Tcl], written in 1993 by Michael McLennan of Lucent Technologies, has encapsulation, multiple inheritance, composition, and polymorphism (via virtual methods). Tcl itself contains namespaces which extend Tcl's use to large-scale projects.The [incr Tcl] extension allows the programmer to move from Tk's object-based orientation to true object-oriented capabilities.True to Tcl/Tk, [incr Tcl] accomplishes its object-oriented ability within the same simple, command-oriented syntax. Commands like class, inherit, constructor, and protected are used.
Utilization of departmental computing GRID system for development of an artificial intelligent tapping inspection method, tapping sound analysis
Authors: Seung Jo Kim, Joon-Seok Hwang, Chang Sung Lee, Sangsan Lee
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Tapping Sound Analysis is a new NDE method, which determines the existence of subsurface defects by comparing the tapping sound of test structure and original healthy structure. The tapping sound of original healthy structure is named sound print of the structure and is obtained through high precision computation. Because many tapping points are required to obtain the exact sound print data, many times of tapping sound simulation are required. The simulation of tapping sound requires complicated numerical procedures. Departmental Computing GRID system was utilized to run numerical simulations. Three cluster systems and one PC-farm system comprise DCG system. Tapping sound simulations were launched and monitored through Globus and CONDOR. A total of 160 Tera floating-point (double-precision) operations was performed and the elapsed time was 41,880 sec. From the numerical experiments, Grid computing technology reduced the necessary time to make sound print database and made TSA a feasible and practical methodology.
Cross-Platform Software Reuse by Functional Integration Approach
Authors: Jim-Min Lin
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Software integration is an important and useful approach to software reuse. Most of software integration approaches use data-integration paradigm , i.e., a common data format and (or) source code are required for integration. In this paper, we propose a functional integration approach which integrates software by functionalities. No common data format or source codes of the integrated softwares is required in our approach. Techniques used in this paper can be applied to integrate softwares under DOS, Windows, or even CORBA (Common Object Request Broker Architecture) based distributed environments. To make our system user friendly, we adopt the concept of software IC and define a specification language to describe relationship among integrated software ICs. Based on this approach, a real graphical parking lot management system which integrated AutoCAD and dBase by their functionalies has been implemented successfully and demonstrated in this paper.
Nodal solutions for a sublinear elliptic equation
Authors: Mikhaël Balabane, Jean Dolbeault, Hichem Ounaies
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We consider radial solutions of Δu + u - |u|-2θu = 0 in Rd with d 1, θ ∈ (0, ½) and prove by a shooting method the existence of compactly supported solutions with any given number of nodes.
Iterative Bayes
Authors: João Gama
Venue: Theoretical Computer Science (2003)

Naive Bayes is a well-known and studied algorithm both in statistics and machine learning. Bayesian learning algorithms represent each concept with a single probabilistic summary. In this paper we present an iterative approach to naive Bayes. The Iterative Bayes begins with the distribution tables built by the naive Bayes. Those tables are iteratively updated in order to improve the probability class distribution associated with each training example. In this paper we argue that Iterative Bayes minimizes a quadratic loss function instead of the 0-1 loss function that usually applies to classification problems. Experimental evaluation of Iterative Bayes on 27 benchmark data sets shows consistent gains in accuracy. An interesting side effect of our algorithm is that it shows to be robust to attribute dependencies.
A survey of industrial experiences with CMM and the teaching of CMM practices
Authors: Erol Biberoglu, Hisham Haddad
Venue: Journal of Computing Sciences in Colleges (2002)

Teaching Software Engineering at the undergraduate and graduate levels often lacks the emphasis on models and practices that support software process improvement, such as Capability Maturity Model (CMM), ISO(International Organization for Standardization) 9000-3, and Software Process Improvement and Capability dEtermination (SPICE). The Software Engineering Institute's CMM is widely adapted and has received great publicity in the software development industry. The goals of this research project are to conduct a literature survey of industrial experiences with CMM; investigate the status of teaching CMM practices for software process improvement; and draw a recommendation on teaching CMM as a part of Software Engineering or Project Management courses. A listing of colleges and universities that teach CMM practices is provided.
Lessons learned from automating tests for an operations support system
Authors: Mariusz A. Fecko, Christopher M. Lott
Venue: Software&mdash;Practice Experience (2002)

We present experience gained in automating tests for an operations support system. A major portion of the effort was devoted to extending a commercial test tool so that testers could easily manipulate graphical user interface (GUI) objects on two implementations of the application. For this purpose, we developed a test automation library as support infrastructure for writing tests. The challenges and tradeoffs are discussed such as simplicity/complexity for a tester versus a library developer, hiding/exposing window hierarchy to the tester, providing common methods for different types of GUI objects, transparently manipulating custom GUI widgets, and coping with data-dependent test cases. We discuss the requirements of test code reusability, maintainability, and portability, and describe the solutions we found. In addition, we offer observations about benefits and pitfalls of test automation, our recommendations for maximizing return on investment, and results from automating a variety of tests.
High-order schemes for conservative or dissipative systems
Authors: Takayasu Matsuo
Venue: Journal of Computational and Applied Mathematics (2003)

We propose a new method for designing high-order finite difference schemes that inherit conservation or dissipation properties from conservative or dissipative systems such as Hamiltonian systems with/without damping terms. The proposed method has a feature that the computational costs of the resulting schemes do not increase in practice, even when the order of accuracy is increased.
Adaptive leg placement strategies in the fruit fly set an example for six-legged walking systems
Authors: Simon Pick, Roland Strauss
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Poster. Leg placement of the fruit fly Drosophila melanogaster was studied under various visual conditions while walking on a square-wave like linear array of narrow "stepping stones". Three-dimensional high speed video analysis revealed elaborate and error tolerant trajectories of the different legs which depend only to a minor extent on visual influences. Flies do not endeavor to place their legs always on the top surfaces of the treads but equally often cling to the edges or to the side surfaces of the stepping stones. A successful fly-like walking robot would rely on visual influences only for far-field orientation but would exploit a rich mechanosensation at its lower extremities and the ability to attach its legs to various surfaces. Technical solutions for these requirements are currently investigated using a single-leg test stand and a six-legged robot.
Large scale features in DNA genomic signals
Authors: Paul Dan Cristea
Venue: Signal Processing (2003)

Complex representations of the nucleotides, codons and amino acids derived from the projection of the Genetic Code Tetrahedron on adequately oriented planes are presented. By converting the sequences of nucleotides and polypeptides into digital genomic signals, this approach offers the possibility of using signal processing methods for the analysis of genomic information. New tools for genomic signal analysis are introduced at the nucleotide, codon and amino acid levels, in a multiresolution approach. It is shown that some important features of nucleotide sequences can be revealed using these signal representations. The paper reports the existence of large scale and global trends of DNA genomic signals in both eukaryotes and prokaryotes, reflecting an almost constant second order nucleotide statistics along DNA strands even at the points where the first order nucleotide statistics show marked changes, as it is the case in prokaryotes.
Developments in Cartesian cut cell methods
Authors: D. M. Ingram, D. M. Causon, C. G. Mingham
Venue: Mathematics and Computers in Simulation (2003)

This paper describes the Cartesian cut cell method, which provides a flexible and efficient alternative to traditional boundary fitted grid methods. The Cartesian cut cell approach uses a background Cartesian grid for the majority of the flow domain with special treatments being applied to cells which are cut by solid bodies, thus retaining a boundary conforming grid. The development of the method is described with applications to problems involving both moving bodies and moving material interfaces.
Multivariate resource performance forecasting in the network weather service
Authors: Martin Swany, Rich Wolski
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

This paper describes a new technique in the Network Weather Service for producing multi-variate forecasts. The new technique uses the NWS's univariate forecasters and emprically gathered Cumulative Distribution Functions (CDFs) to make predictions from correlated measurement streams. Experimental results are shown in which throughput is predicted for long TCP/IP transfers from short NWS network probes.
The Coevolution of New Organizational Forms in the Fashion Industry: a Historical and Comparative Study of France, Italy, and the United States
Authors: Marie-Laure Djelic, Antti Ainamo
Venue: Organization Science (1999)

In many industries, the contemporary context of acute environmental dislocation shows the limits of traditional organizational recipes. In direct response to environmental challenges, companies are experimenting with new organizational solutions. While flexibility, or the capacity to redefine organizational form to follow changing purposes, is undeniably a common trend, these experiments otherwise differ greatly. Diversity is such, in fact, that it is difficult to clearly identify and define a unique organizational paradigm for the future. To explore the connection between environmental dislocation and organizational transformations, we adopt a historical and comparative perspective. Our empirical base of evidence is the luxury fashion industry in three countries, France, Italy, and the United States. For many years, this industry was defined by stable environmental conditions, and a craft model of organization remained dominant. We show that, over a more recent period, increasing environmental turbulence has brought about a redefinition of the rules of the game. A common response has been for organizations to move towards greater flexibility or modularity and to experiment with network forms. However, we also show that the paths or trajectories leading to organizational flexibility have varied significantly across countries, reflecting historical legacies and institutional constraints. We identify in fact three different network forms in that industry, which represent national ideal types-the "umbrella holding" company in France, the "flexible embedded network" in Italy, and the "virtual organization" in the United States. We argue that the process of change in the luxury fashion industry has been one of coevolution, where environmental transformation and organizational change have fed upon each other through time. Pioneer firms in the luxury fashion industry originally devised organizational solutions within the bounds set by nationally defined constraints and opportunities. Becoming institutionalized, these early solutions in turn shaped the environment for individual organizations and organizational populations, creating new sets of opportunities and constraints. In a path-dependent manner, different models of organization and national competitiveness thus emerged. In conclusion, we are brought to question the likelihood of full and stable convergence towards a unique organizational form or paradigm. There appears to be, in each national context, a process of construction of new organizational solutions that starts from local foundations. Embedded as they are in powerful historical and institutional legacies, organizational differences are there to stay, we believe, beyond the period of transition and acute environmental dislocation.
A rectangular immersed finite element space for interface problems
Authors: Tao Lin, Yanping Lin, Robert Rogers, M. Lynne Ryan
Venue: Scientific computing and applications (2001)

We consider an immersed finite element space for boundary value problems of partial differential equations with discontinuous coefficients. The basis functions in this space are constructed as piecewise bi-linear polynomials that satisfy jump conditions approximately (or even exactly in certain situations). The mesh in this space does not have to be aligned with the interface because the interface is allowed to pass through its elements. Therefore a structured Cartesian mesh can be used to solve boundary value problems with arbitrary interfaces. Numerical results are presented to show the convergence of the Galerkin method based on this space.
On the permutation sequence and its some properties
Authors: Zhang Wenpeng
Venue: Smarandache Notions Journal (2002)

The main purpose of this paper is to prove that there is no any perfect power among the permutation sequence: 12, 1342, 135642, 13578642, 13579108642, ...... This answered the question 20 of F.Smarandach in [1].
Capacitated Network Design with Uncertain Demand
Authors: Morten Riis, Kim Allan Andersen
Venue: INFORMS Journal on Computing (2002)

We consider a capacity-expansion problem arising in the design of telecommunication networks. The problem is to install capacity on links of the network so as to meet customer demand while minimizing total costs incurred. When studying this and related problems it is customary to assume that point-to-point demands are given. This will not bethe case in practice, however, since future demand is generally unknown and the decision must be based on uncertain forecasts. We develop a stochastic integer programming formulation of the problem and propose an L-shaped solution procedure based on well-known cutting-plane procedures for the deterministic problem. The algorithm was tested on two sets of real-life problem instances and we present results of our computational experiments.