ppxscal/embedding_network huggingface dataset:
Online assessment of SQL query formulation skills
Authors: Julia Coleman Prior
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Being able to formulate useful SQL queries is a fundamental skill required by many software development professionals. Mastering this skill is a difficult process, requiring considerable practice and effort on the part of the student. In addition, assessment of SQL query formulation skills is a process that does not appear to have been thoroughly researched, and numerous problems are inherent to the approaches commonly taken in universities to do this assessment. This paper examines two of these approaches, identifies problems with them, and then proposes another method of assessment. The way that students are assessed in a subject has a significant impact on their learning approach, and it is crucial that assessment tasks are carefully designed and implemented to inculcate a deep learning experience. The online assessment method proposed is described, evaluated, and the challenges and benefits of using it are discussed. This is a work-in-progress and the conclusion states that further validation is needed, and there is opportunity for additional research and development in this particular area of assessment.
Existence of solutions of boundary value problems for differential equations with delayed arguments
Authors: Tadeusz Jankowski
Venue: Journal of Computational and Applied Mathematics (2003)

We study the existence and approximation of solution of boundary value problems for differential equations with delayed arguments. Sufficient conditions are established for the existence of a unique solution or extremal ones of the given problem. A monotone iterative technique is applied.
Teaching secure communication protocols using a game representation
Authors: Leonard G. C. Hamey
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

The Security Protocol Game is a highly visual and interactive game for teaching secure data communication protocols. Students use the game to simulate protocols and explore possible attacks against them. The power of the game lies in the representation of secret and public key cryptography. Specifically, the game provides representations for plain text and encrypted messages, message digests, digital signatures and cryptographic keys. Using these representations, students can construct public key certificates and perform multiple encryption, tunnelling and encrypted key transmission. They can simulate a wide range of protocols including authentication, key exchange and blind signature protocols. Application protocols such as Transport Layer Security and Pretty Good Privacy can be simulated in detail. The game clearly reveals the key issues of confidentiality, integrity, authentication and non-repudiation in secure data communications. Used as a small group learning activity, students gain a deep understanding of protocol design and operation issues. The game is suitable for use in tertiary and professional education courses for managers and information technology students at all levels.
Practical Web Databases
Authors: Chris Auld, Rudy Limeback, Nigel Stanger, Allan Kent, Thearon Willis
Venue:  (2002)

:Although many web professionals will have incorporated a database into a web site before, they may not have much experience of designing them - this book will teach you all you need to know about designing a database for use with a web site or web application. From first principles to designing a successful web database, this book will show you how to get the most out of database design. Unlike other database design books in the market, this one focuses on design of databases for use on the Web. Web databases benefit from good general database design principles, but also have their own set of caveats, which must be considered for their design to be truly successful. This book covers both the general, and the web-specific database principles.
Multicast Flow Control on Local Area Networks
Authors: Guerney D Hunt
Venue:  (1995)

The primary LAN technologies in use today --ethernet, FDDI, and token-ring --all provide hardware support for broadcast and multicast capability. However, distributed systems have traditionally used unicast messaging exclusively, even when multicast communication patterns arise. As the number of distributed applications grows, the load on networks caused by unnecessary unicasts will increase. In addition, for some applications performance and group size are limited by using unicast technologies for multicast. If multicast technologies are exploited, the network load caused by ``redundant'''' packets will be reduced. Exploiting multicast will also improve the performance and scalability of some distributed applications. However, as distributed systems move towards exploiting multicast, multicast flow control protocols are becoming more important. Finding a general, effective solution for multicast flow control will help facilitate the exploitation of the multicast primitives provided in LANs and Wide Area Networks (WANs). This dissertation presents the results of an investigation into multicast performance on local area networks. An analysis of multicast flow control is presented which distinguishes between {\it rate reservation} and {\it rate control}, followed by a discussion of the major design issues associated with multicast flow control and a presentation of a proposed protocol family. The proposed protocol family is based on send-rate control. An unreliable and a reliable multicast flow control protocol based on the proposed family are presented. A study of the performance of these protocols is also presented. This dissertation concludes with an investigation into how well the proposed reliable multicast flow control protocol performs when used to disseminate messages. This dissertation argues that direct rate control has merit as a technique for multicast flow control on local area networks.
Ambient Computational Environments
Authors: Gary J. Minden, Joseph B. Evans
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The cost of computational resources is expected to continue to decrease. This allows us to consider embedding these resources in our environment for use as needed. Ambient Computational Environments (ACEs) represent a computer architecture in which computational resources, sensors, and actuators, in their widest sense, are available in our offices, conference rooms, hallways, and other places. Users must be able to control, with authorization, these computational resources within their proximate area, and access computational services that are long-lived and extremely robust. These users must also be able to interact in multiple ways with ACEs. We are developing prototype Ambient Computational Environments with these features, and are exploring the related architectural and deployment issues.
Analysis of kinematic linked interpolation methods for Reissner-Mindlin plate problems
Authors: Ferdinando Auricchio, Carlo Lovadina
Venue:  (1999)

The approximation to the solution of Reissner-Mindlin plate problem is considered in the framework of finite element techniques. A general strategy, involving a linking operator between rotations and vertical displacements, is analyzed. An abstract convergence result is provided. Examples of elements falling into this framework are presented and shown to be stable and locking-free. Numerical tests detail the performances of the elements. EMAIL:: lovadina@ing.unitn.it
Metamathematical Extensibility in Type Theory
Authors: Todd B. Knoblock
Venue:  (1987)

An automated theorem prover is said to be metamathematically extensible if a metalanguage can be employed by the user to soundly extend the reasoning capabilities of the system. In this thesis, we present a framework for metamathematical extensibility for a system based upon a type-theoretic logic, the Nuprl system. Using this framework, the user can construct programs called proof tactics that may be used to provide new reasoning capabilities for the logic. These proof tactics can encode reasoning methods as simple asd a derived rule of inference or as ambitious as a theorem prover. The design of the framework ensures that all proof tactics are correct. A formal metalanguage called Metaprl is defined that represents the proof theory of Nuprl in a natural and computationally-oriented fashion. The logic of Metaprl is an extension of the constructive type theory of Nuprl. Type theories like Nuprl and Metaprl are distinguished by the uniform treatment of computations (programs) and logical propositions and by rich languages for expressing computations. In Metaprl, formal specifications for tactics may be written and formally correct tactics extracted from the proofs of the specification. Three classes of tactics are defined: complete tactics, partial tactics, and search tactics. Complete tactics are analogous to derived axioms for the Nuprl logic. Partial tactics are analogous to derived rules of inference. Search tactics are analogous to the procedural tactics of LCF and the current Nuprl system. Examples from each class of tactics are presented. There are a number of advantages to using a formal logic as a metalanguage for metamathematical extensibility. System-implemented reflection principles guarantee that the framework is a conservative extension of Nuprl. The expressiveness of the Metaprl logic allows the validity of tactics to be ensured. Often it is not even necessary to execute tactics since they have been proved correct and all that is required is that a proof exists; the exact form for the proof is not needed. This can result in substantial computational savings. Finally, the construction of a metalanguage for metamathematical extensibility for Nuprl is generalized to a hierarchy of metalanguages, each logic providing for metamathematical extensibility of the preceeding logic.
On the Time and Tape Complexity of Languages, I
Authors: Harry B. Hunt,  III
Venue:  (1973)

We investigate the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines and the relationship between the classes of languages accepted by deterministic polynomial time bounded and by nondeterministic polynomial tape bounded Turing machines. In both cases we study generators of the nondeterministic class that generate it by operations that the deterministic class is closed under.
Dynamical properties of higher order random neural networks
Authors: Hiromi Miyajima, Lixin Ma, Hiroyuki Suwa
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In the previous paper,we have shown dynamical properties, dynamics of the activities for states, for higher order random neural networks, which uses the weighted sum of products of input variables, with the digital state {1-,1}-model. This paper describes dynamical properties for higher order random neural networks with the analog state models and the digital state {0,1}-model.
Closure Properties of GapP and #P
Authors: Richard Beigel
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We classify the relativizable closure properties of GapP, solving a problem posed by Hertrampf, Vollmer, and Wagner (Structures '95). We also give a simple proof of their classification of functions that are relativizable closure properties of #P.
Factorization of linear differential operators in exponential extensions
Authors: Anne Fredet
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present here an algorithm for an efficient computation of factorizations of linear differential operators with power series coefficients in an exponential extension of a base field. This algorithm is based on the results presented by Mark van Hoeij on factorization of linear differential operators with coefficients in C((x)). On the positive slopes of the Newton polygon associated to the linear differential operator, if the factors of the Newton polynomial are coprime, the algorithm does not require the use of differential algebra but only Bézout's theorem.
The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
Authors: Thomas F. Coleman, Jin Cai
Venue:  (1984)

Numerical optimization algorithms often require the (symmetric) matrix of second derivatives, $\nabla^{2} f (x)$, of some problem function $f: R^{n} \rightarrow R^{1}$. If the Hessian matrix is large and sparse then estimation by finite differences can be quite attractive since several schemes allow for estimation in $\ll n$ gradient evaluations. The purpose of this paper is to analyze, from a combinatorial point of view, a class of methods known as substitution methods. We present a concise characterization of such methods in graph-theoretic terms. Using this characterization, we develop a complexity analysis of the general problem and derive a roundoff error bound on the Hessian approximation. Moreover, the graph model immediately reveals procedures to effect the substitution process optimally (ie. using fewest possible substitutions given the differencing directions) in space proportional to the number of nonzeroes in the Hessian matrix.
Paradigms of Interpretation and Modeling
Authors: Peter Wegner
Venue:  (1991)

We examine the interpretation of literary texts in Umberto Eco''s {\em The Limits of Interpretation}, explore parallels with interpretation in science and engineering, and then focus on modeling and interpretation in computer science. Interpretation in both the humanities and the sciences requires a {\em model} employed by an {\em agent} to define {\em meaning} for a {\em modeled world}. The literary debate between those who ascribe inherent meaning to texts and those who believe that meaning is determined by the reader or critic is analogous to the scientific debate between realists who believe in the reality of the modeled world and formalists who ascribe reality to the model. The debate between realists and formalists takes a remarkably similar form in the humanities and the sciences, focusing attention on epistemological issues fundamental to all branches of knowledge. There are parallels between the literary interpretation of texts, analytic models of science, and synthetic models of engineering. Computer science spans an exceptionally broad spectrum of modeling paradigms, since it employs engineering, empirical, and mathematical techniques. Modeling is the central goal in constructing computer systems, while interpretation (execution) of programs is the primary tool for computing specific dynamic consequences of the static model determined by the program. In exploring modeling and interpretation in computer science we focus on models of computation, paradigms of computation, types versus values, and computational versus software complexity. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
What Should a Discrete Mathematics Course Be?
Authors: Kenneth P. Bogart
Venue:  (1986)

This paper presents the results of a survey of mathematics and computer science departments on their needs and intentions for survey courses in discrete mathematics. The paper then presents an idealized syllabus for such a course, recognizing that many topics in the syllabus should be regarded as optional. The paper concludes with a brief summary of the experience at Dartmouth in teaching such a course.
Rational Transitivity and its Models
Authors: Hassan Bezzazi, Ramon Pino Perez
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We study here the Preferential Logic enriched by a rule called rational transitivity. We prove that the preferential relations satisfying this new rule are stronger than rational relations. Our main result is a representation theorem for these new relations. As a corollary we obtain the equivalence between the rational transitivity and a form of contraposition.
Detecting Moving Objects With a Moving Camera by Comparing Edge Contours
Authors: Daniel P. Huttenlocher, Eric W. Jaquith
Venue:  (1994)

This paper introduces a method for detecting moving objects in a monocular image sequence that is obtained using a moving camera. The method first estimates the motion of the edge contours in a given image frame, by recovering a transformation that best matches each edge contour with the edges in the subsequent frame. Any contour that is not well accounted for by a single transformation is split into subparts. The transformation of each edge contour together with the relative spatial locations of the contours is used to partition the image into regions with similar motions. Hypotheses about the locations of possible moving objects are then made based on these motion regions. One of the key aspects of the approach is that it is based on estimating the motion of entire edge contours, as opposed to recovering a velocity field that measures the motion of individual points. We present some examples for image sequences taken of animate objects using a hand-held video camera. Keywords: Motion estimation, motion segmentation, edge matching.
A Process for Specifying Black Box Behavior, Demonstrated in a Case Study
Authors: Stephanie White, Herbert Warner
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Prior to designing a system, customers and contractors should agree on required black box (externally apparent) system behavior. To define this behavior, practical, precise, design independent methods are needed. This paper describes results of a case study in which formal event-based approaches are used, demonstrating that a combination of history based traces and guarded event-action statements is practical for defining black box behavior. Externally apparent modes (states) simplify the specification to promote human understanding. The specifier is allowed to use both traces and event-action statements in a single specification, as requirements that define sequential events are best specified using traces, and requirements that are conditional are best specified using event-action statements. Graph generation from the model, as opposed to graph definition makes this type of specification easier to define and maintain.
A Framework for Digital Topology
Authors: Eladio Domingues, Angel Frances, Alberto Marquez
Venue:  (1992)

The main goal of this paper is to show the functional architecture of a framework for digital topology. This architecture has four levels, called the device, logical, conceptual, and continuous levels. In each one of them we can use several models according to a particular problem. The models in the device level represent the physical problem, whereas the models in the continuous level are topological spaces that allow us to use the well-known results of continuous topology (actually, the stronger results of polyhedral topology). The other two levels are used to find a digital solution. The logical level is closer to the device level and is used for processing, for writing algorithms and to show their correctness. The conceptual level is the nearest to the continuous level and it is used to translate results and notions from the continuous level to the logical level.
OMI - A Standard Model Interface for IP Delivery
Authors: Doug Dunlop, Kathy McKinley
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

The Open Model Forum (OMF) industry consortium has developed a simulator-independent and HDL-independent interface between an EDA tool such as a simulator and a "black box" model of a block of intellectual property. This interface, called the Open Model Interface (OMI), allows interoperable models to be developed, distributed and used with any compliant tool without exposing the internal structure or operation of the model. An IEEE effort was recently launched to begin the process of standardizing OMI. In this paper the need for OMI is motivated, expected usage scenarios are discussed, and an overview of the technical solution is presented.
The Muse approach to OR-parallel Prolog
Authors: Roland Karlsson, Khayry M Ali
Venue:  (1990)

Muse(Multi-sequential Prolog engines) is a simple and efficient approach to Or-parallel execution of Prolog programs. It is based on having several sequential Prolog engines, each with its local address space, and some shared memory space. It is cur-rently implemented on a 7-processors machine with local/shared memory constructed at SICS, a 16-processors Sequent Symmetry, a 96-processors BBN Butterfly I, and a 45-processors BBN Butterfly II. The sequential SICStus Prolog system has been adapted to Or-parallel implementation. Extra overhead associated with this adapta-tion is very low in comparison with the other approaches. The speed-up factor is very close to the number of processors in the system for a large class of problems. The goal of this paper is to present the Muse execution model, some of its imple-mentation issues, a variant of Prolog suitable for multiprocessor implementations, and some experimental results obtained from two different multiprocessor systems.
Fast and Accurate Self-Calibration
Authors: J. Oliensis
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper describes new techniques for self calibration and for recovering the motion from a projective reconstruction when the calibration is known. We show that our approach deals with the ambiguities in self calibration produced by special motions. We extend our techniques to deal with varying calibration parameters. In passing, we prove convergence for the iterative projective reconstruction algorithm of Sturm/Triggs and Berthilsson/Heyden/Sparr.
Maintaining Node Consistency in the Face of Dynamic Change
Authors: Kaveh Moazami-Goudarzi, Jeff Kramer
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

With the increasing demand for long running and highly available distributed services, interest in systems which can undergo dynamic reconfiguration has risen. However for dynamic change to yield valid systems, change actions must be carried out such that the consistency of the software modules making up the system is not breached. This can be ensured if the subset of the system which is to undergo change is in a state amenable to reconfiguration. This paper presents an algorithm which imposes a safe state over the part of the system undergoing change. The algorithm suits a particular class of transactional systems and places special emphasis on minimizing the interference to the rest of the system and reducing the programmer contribution necessary for achieving this safe state.