ppxscal/embedding_network huggingface dataset:
Predicting the use of web-based information systems: self-efficacy, enjoyment, learning goal orientation, and the technology acceptance model
Authors: Mun Y. Yi, Yujong Hwang
Venue: International Journal of Human-Computer Studies (2003)

With the growing reliance on computerized systems and increasing rapidity of the introduction of new technologies, user acceptance of technology continues to be an important issue. Drawing upon recent findings in information systems, human computer interaction, and social psychology, the present research extends the technology acceptance model by incorporating the motivation variables of self-efficacy, enjoyment, and learning goal orientation in order to predict the use of Web-based information systems. One hundred nine subjects participated in the study, which was conducted in a field setting with the Blackboard system, a Web-based class management system. A survey was administered after a 2-week trial period and the actual use of the system was recorded by the Blackboard system over 8 weeks. The results largely support the proposed model, highlighting the important roles of self-efficacy, enjoyment, and learning goal orientation in determining the actual use of the system. Practical implications of the results are provided.
SPIDA: Abstracting and generalizing layout design cases
Authors: D. Manfaat, A. H. B. Duffy, B. S. Lee
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Abstraction and generalization of layout design cases generate new knowledge that is more widely applicable to use than specific design cases. The abstraction and generalization of design cases into hierarchical levels of abstractions provide the designer with the flexibility to apply any level of abstract and generalized knowledge for a new layout design problem. Existing case-based layout learning (CBLL) systems abstract and generalize cases into single levels of abstractions, but not into a hierarchy. In this paper, we propose a new approach, termed customized viewpoint&mdash;spatial (CV&ndash;S), which supports the generalization and abstraction of spatial layouts into hierarchies along with a supporting system, SPIDA (SPatial Intelligent Design Assistant).
A higher-order subfilter-scale model for large eddy simulation
Authors: Luigi C. Berselli, Traian Iliescu
Venue: Journal of Computational and Applied Mathematics (2003)

This paper presents a new subfilter-scale stress model for large eddy simulation. The unknown velocity field is represented in terms of the filtered velocity by using a higher-order Padé approximation of the Fourier transform of the Gaussian filter. This accurate approximation of the velocity field yields an improved subfilter-scale stress tensor accounting for the information lost in the filtering process. The accuracy of the subfilter-scale stress tensor is especially important in the large eddy simulation of complex flows, such as geophysical flows, where the practical grid size is much larger than the scale of turbulent motion. We illustrate our approach through two simple one-dimensional numerical examples. We also present a rigorous mathematical analysis for this new large eddy simulation model.
Data mining and Chinese medicine
Authors: Josef Siu-wai Leung
Venue: ACM SIGBIO Newsletter (1998)

By using data mining techniques, we are&bull; Searching active ingredients (herbs or chemical compounds) in the effective prescriptions of Chinese medicine for specific diseases;&bull; Identifying Chinese medicine material by their "fingerprints" detected by modern analytical instruments and&bull; identifying the quality criteria of Chinese medicinal products.
Towards Dynamic Process with Variable Structure by Reflection
Authors: Shaohua Liu, Jun Wei, Wei Xu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Advancing information technologies are increasing theevolution and variation of software resources. Applicationsthat cannot adapt to dynamic environments willdecrease their usefulness, particularly to business processsystems that face requirements changed frequently. Aftersurveying related work, we propose a new formalism formodeling Dynamic Process in which the state space andtransition function are enriched so that one model cantransit to another model at runtime by the computationalreflection that aims to represent and modify its own design.Such goal necessitates an appropriate runtime environment.We introduce the Service Cooperation Middleware(SCM) because it is service-oriented, into which thereflection mechanism is easily attached to support structuraland behavioural changes on processes at runtime.
Scope conserving expression evaluation: a class of storage optimal evaluation strategies for arithmetic expressions
Authors: G. Chroust
Venue: ACM SIGPLAN Notices (1977)

One important aspect of the object code generated for arithmetic expressions in higher level languages is the amount of temporary storage needed during evaluation. This amount is a function of the sequence in which an expression's subexpression are evaluated. Usually the implementor has the freedom to choose any order of evaluation, provided that operations are executed after the evaluation of their respective operands. This allows for the use of a multitude of possible evaluation sequences. In 1971 the author identified a large class of such evaluation strategies by the newly coined term 'scope conserving'.In this paper we show that this class of strategies will minimize the amount of temporary storage with respect to a very general cost function. The optimizing sequencing strategies for temporary storage derived by Anderson, Colin, Nakata, Redziejowski, Sethi-Ullmann and Chroust are shown to be expressible in the model.
Independent Transversals and Independent Coverings in Sparse Partite Graphs
Authors: Raphael Yuster
Venue: Combinatorics, Probability and Computing (1997)

An [n, k, r]-partite graph is a graph whose vertex set, V, can be partitioned into n pairwise-disjoint independent sets, V1, &hellip;, Vn, each containing exactly k vertices, and the subgraph induced by Vi &cup; Vj contains exactly r independent edges, for 1 &le; i < j &le; n. An independent transversal in an [n, k, r]-partite graph is an independent set, T, consisting of n vertices, one from each Vi. An independent covering is a set of k pairwise-disjoint independent transversals. Let t(k, r) denote the maximal n for which every [n, k, r]-partite graph contains an independent transversal. Let c(k, r) be the maximal n for which every [n, k, r]-partite graph contains an independent covering. We give upper and lower bounds for these parameters. Furthermore, our bounds are constructive. These results improve and generalize previous results of Erdo&Prime;s, Gy&aacute;rf&aacute;s and &Lstrok;uczak [5], for the case of graphs.
WizWhy: an association rule tool for biomedical research
Authors: Abraham Meidan
Venue: ACM SIGBIO Newsletter (1998)

We have developed a new association rules algorithm, that is used not just for revealing all the if-then rules, but for issuing predictions as well. This algorithm avoids the problem of overfitting by calculating the error probability of each rule. Our package, WizWhy for Windows 95/NT, that is based on this algorithm is used in many biomedicine research groups.
Modelling the demand for money in New Zealand
Authors: Daniel Choi, Les Oxley
Venue: Mathematics and Computers in Simulation (2004)

The paper reports on the results of estimating both the long- and short-run demand for money function in New Zealand, 1990-2000 using quarterly data and cointegration- and error-correction-based models. It is found that price, real income and interest rate variables are integrated of order 1 or I(1). Using Phillips and Hansen [Rev. Econ. Stud. 57 (1990) 99] fully modified estimation methods, we establish the existence of a long-run cointegrating relationship among these three variables. Using the residuals from this model to represent the error-correction mechanism (ECM) term, we identify a short-run model utilising Hendry's general-to-specific (GTS) approach. The model is shown to satisfy the typical diagnostic requirements of a multiple regression model. Three event dummies are used to capture key events of relevance to monetary policy in New Zealand.
Pseudo-Random Sequence Based Tuning System for Continuous-Time Filters
Authors: F. Corsi, C. Marzocca, G. Matarrese, A. Baschirotto, S. D'Amico
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Continuos-Time filters are widely used in signal processing but require a tuning system to align their frequency response. Several tuning techniques have been proposed in the literature, which can be grouped in two basic schemes: master-slave and self-calibrationarrangements. Here we propose a novel tuning approach which can be applied to both tuning schemes. The tuning algorithm is based on the application of a pseudo-random input Test Pattern Signal and on the evaluation of a few samples of the input-output cross-correlation function. The key advantages of the proposed technique are basically the use of a pseudo-random pattern signal which can be generated by a very simple circuit in a small diearea and the simple circuitry required to sample the filter output and to perform the cross-correlation operation.Some experimental results of the application of the proposed tuning technique to a benchmark filter are given in order to assess its effectiveness.
A tutor on scope for the programming languages course
Authors: Eric Fernandes, Amruth N. Kumar
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

In order to facilitate problem-based learning in our Programming Languages course, we developed a tutor on static and dynamic scope. Static scope includes the scope of variables, the referencing environment of procedures and the scope of procedure names in a language that permits nesting of procedure definitions (e.g., Pascal, Ada). Dynamic scope includes the scope of variables, and the referencing environment of procedures. In this paper, we will describe the design of our tutor, and present the results of evaluating it for two semesters in our Programming Languages course.
New lower bounds on the maximum number of mutually orthogonal Steiner triple systems
Authors: J. H. Dinitz, P. Dukes
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

Two Steiner triple systems (STS) are orthogonal if their sets of triples are disjoint, and two disjoint pairs of points defining intersecting triples in one system fail to do so in the other. We define the quantity σ(n) as the size of a maximum collection of pairwise orthogonal STS of order n. Special starters in the finite fields are used to improve the best known lower bounds on σ(n) for prime-powers n ≡ 1 (mod 6), n > 500. Additionally, hill-climbing and isomorphisms are used together to show σ(n) ≥ 3 or 4 for certain other small n, including some orders n ≡ 3 (mod 6). Asymptotic existence for three mutually orthogonal STS is a consequence.
Blending digital and physical spaces for ubiquitous community participation
Authors: Elizabeth Churchill, Andreas Girgensohn, Les Nelson, Alison Lee
Venue: Communications of the ACM (2004)

Blurring the notional boundary between the digital and the physical in social activity spaces helps blend---and motivate---online and face-to-face community participation.
Scheduling under machine breakdown in a continuous process industry
Authors: C. J. Liao, W. J. Chen
Venue: Computers and Operations Research (2004)

In many continuous process industries, machine breakdowns may affect the planned activities, especially when maintaining high shop performance is desired. In this paper, we consider a practical problem encountered in a textile company where the machine breakdown occurs frequently. A heuristic is developed as the solution approach for the problem. The basic idea of the heuristic is to provide a longer setup time (or equivalently, a longer idle time) to reduce the breakdown rate. The performance of the heuristic is evaluated by comparing its solution with both the solutions of the current scheduling method and the branch-and-bound algorithm. The real data from the company are used to demonstrate the effectiveness of the heuristic.
Modelling the natural gas consumption in a changing environment
Authors: F. A. Batzias, N. P. Nikolaou, A. S. Kakos, I. Michailides
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A composite function was used successfully for modelling the Natural Gas (NG) consumption in 16 European energy markets. Background of the model is a logistic function where the upper limit is also a logistic function of time, with secondary parameters determined either endogenously together with the rest primary parameters or exogenously in a sample space of the energy market. Fitting of this 'double logistic' dynamic model to NG consumption data of the period 1980-2000 gave better Standard Errors of Estimate (SEEs) for ten energy markets in comparison with the linear, the expone-ntial/asymptotic and the static logistic model. Supplementary results obtained by statistical analysis of answers selected by circulating a questionnaire in the wider area of Attica in Greece, led to the conclusion that income/welfare, residential place and information play an important role as regards the intention of inhabitants to adopt the NG alternative.
Partial Error Masking to Reduce Soft Error Failure Rate in Logic Circuits
Authors: Kartik Mohanram, Nur A. Touba
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

A new methodology for designing logic circuits with partial error masking is described. The key idea is to exploit the asymmetric soft error susceptibility of nodes in a logic circuit by targeting the error masking capability towards the nodes with the highest soft error susceptibility to achieve cost-effective tradeoffs between overhead and reduction in the soft error failure rate. Such techniques can be used in cost-sensitive high volume main-stream applications to satisfy soft error failure rate requirements at minimum cost. Two reduction heuristics, cluster sharing reduction and dominant value reduction, are used to reduce the soft error failure rate significantly with a fraction of the overhead required for conventional TMR.
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
Authors: Dmitri Kaznachey, Arun Jagota, Sajal Das
Venue: Journal of Parallel and Distributed Computing (2003)

The graph coloring problem is a classic one in combinatorial optimization with a diverse set of significant applications in science and engineering. In this paper, we study several versions of this problem generalized to hypergraphs and develop solutions based on the neural network approach. We experimentally evaluate the proposed algorithms, as well as some conventional ones, on certain types of random hypergraphs. We also evaluate our algorithms on specialized hypergraphs arising in implementations of parallel data structures. The neural network algorithms turn out to be competitive with the conventional ones we study. Finally, we construct a family of hypergraphs that is hard for a greedy strong coloring algorithm, whereas our neural network solutions perform quite well.
A quantum algorithm using NMR computers to break secret-key cryptosystems
Authors: Kazuo Ohta, Tetsuro Nishino, Seiya Okubo, Noboru Kunihiro
Venue: New Generation Computing (2003)

In this paper, we discuss quantum algorithms that, for a given plaintext m0 and a given ciphertext c0, will find a secret key, k0, satisfying c0 = E(k0, m0), where an encryption algorithm, E, is publicly available. We propose a new algorithm suitable for an NMR (Nuclear Magnetic Resonance) computer based on the technique used to solve the counting problem. The complexity of our algorithm decreases as the measurement accuracy of the NMR computer increases. We discuss the possibility that the proposed algorithm is superior to Grover's algorithm based on initial experimental results.
Electrical modelling of lossy on-chip multilevel interconnecting lines
Authors: K. Z. Dimopoulos, J. N. Avaritsiotis, S. J. White
Venue: Proceedings of the conference on European design automation (1991)

A self contained method for the electrical modelling of lossy 3-D multilevel interconnections has been developed. The method allows for the generation of a multiple coupled line model, compatible with SPICE-like CAD programs, from the interconnection line constants and parasitic coupling parameters which are computed by the so-called method of moments. The proposed method can be used for the analysis of coupled line systems with linear or nonlinear/time varying terminators, as well as for the study of the pulse propagation characteristics in high-speed ICs. Numerical results are presented for 3-D parallel and galvanically separated crossed planar lines.
GASP: a Genetic Algorithm for Standard cell Placement
Authors: K. Shahookar, P. Mazumder
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the implementation of the Genetic Algorithm for Standard-cell Placement, GASP-1. As opposed to simulated annealing, which normally uses pairwise interchange for transforming the layout configuration, in a genetic algorithm, the crossover operator is used to combine two current configurations to generate a new configuration (similar to reproduction in living organisms). The traditional genetic crossover operator, as proposed by Holland, cannot be applied to the cell placement problem without modification, because it occasionally results in illegal placement. A great deal of effort has there fore been directed towards finding an efficient crossover operator for this problem domain. Three powerful crossover operators have been implemented, and their performance in reducing the interconnect length has been compared. The results of this comparison were conclusively in favor of Cycle crossover. Besides crossover, two other genetic operators --- mutation and inversion --- have been used to improve the efficiency of the search process. In order to benchmark the performance of GASP-1, the best possible compromise of the parameters was picked, and the algorithm was run to place five industrial circuits consisting of 100 to 800 cells. The results were very encouraging. The total number of configurations examined by GASP-1 was 19 to 50 times less than that for Timber Wolf 3.3 and the run time was marginally better. The percentage improvement in the wire length was better in three out of five circuits The overall conclusion from this research is that adaptive search based on the genetic algorithm yields results comparable to simulated annealing, both in the final result quality and computation time required.
Decision and Visualization for Negotiation
Authors: J. S. Monzani, S. Bendahan, Y. Pigneur
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

We present a new strategic model for solving large scale negotiation problems involving numerous actors and issues. It merges previous multi-issues and actors methods based on power relationship between stakeholders and their ability to bargain in order to increase their utility. We apply new Visualization techniques to analyse its outputs: Dissatisfaction analsys, Proximity map, Passive In.uences and Power repartition on issues. We simultaneously describe the implemented system on an assessment in the Wireless Internet Service Provider scenario.
Performance Models in GSM and GPRS Networks
Authors: Yue Li, Irfan Awan, Khalid Al-Begain
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Queueing networks models are widely used as important tools for the performance modelling and evaluation of both computer systems and communication networks. Exact solutions are generally not attainable except for some special cases. Consequently, numerical techniques and analytic approximations are needed for the study of queueing networks with bursty traffic. This paper presents the performance modelling and evaluation of General Packet Radio Service (GPRS) for wirelss Global System for Mobile telecommunication (GSM) cells with bursty multiclass traffic under a partial sharing scheme (PSS). The model has been developedusing a new powerful tool, MOSEL (MOdelling, Specification and Evaluation Language), which is based on numerical methods and the Petri-Nets. The proposed model has been validated against simulation and those developed using maximum entry (ME), a well established methodology for approximate solutions. Numerical results demonstrate the credibility of our models.
The trouble with out-of-the-box thinking
Authors: Ubiquity staff
Venue: Ubiquity (2003)

Andrew Hargadon on continuity and its critical role in the innovation process
Intrusion Detection: A Bioinformatics Approach
Authors: Scott Coull, Joel Branch, Boleslaw Szymanski, Eric Breimer
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

This paper addresses the problem of detectingmasquerading, a security attack in which an intruderassumes the identity of a legitimate user. Manyapproaches based on Hidden Markov Models and variousforms of Finite State Automata have been proposed tosolve this problem. The novelty of our approach resultsfrom the application of techniques used in bioinformaticsfor a pair-wise sequence alignment to compare themonitored session with past user behavior. Our algorithmuses a semi-global alignment and a unique scoring systemto measure similarity between a sequence of commandsproduced by a potential intruder and the user signature,which is a sequence of commands collected from alegitimate user. We tested this algorithm on the standardintrusion data collection set. As discussed in the paper,the results of the test showed that the described algorithmyields a promising combination of intrusion detection rateand false positive rate, when compared to publishedintrusion detection algorithms.
Benchmarking Least Squares Support Vector Machine Classifiers
Authors: Tony Van Gestel, Johan A. K. Suykens, Bart Baesens, Stijn Viaene, Jan Vanthienen, Guido Dedene, Bart De Moor, Joos Vandewalle
Venue: Machine Learning (2004)

In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of equations in the dual space. While the SVM classifier has a large margin interpretation, the LS-SVM formulation is related in this paper to a ridge regression approach for classification with binary targets and to Fisher's linear discriminant analysis in the feature space. Multiclass categorization problems are represented by a set of binary classifiers using different output coding schemes. While regularization is used to control the effective number of parameters of the LS-SVM classifier, the sparseness property of SVMs is lost due to the choice of the 2-norm. Sparseness can be imposed in a second stage by gradually pruning the support value spectrum and optimizing the hyperparameters during the sparse approximation procedure. In this paper, twenty public domain benchmark datasets are used to evaluate the test set performance of LS-SVM classifiers with linear, polynomial and radial basis function (RBF) kernels. Both the SVM and LS-SVM classifier with RBF kernel in combination with standard cross-validation procedures for hyperparameter selection achieve comparable test set performances. These SVM and LS-SVM performances are consistently very good when compared to a variety of methods described in the literature including decision tree based algorithms, statistical algorithms and instance based learning methods. We show on ten UCI datasets that the LS-SVM sparse approximation procedure can be successfully applied.