ppxscal/embedding_network huggingface dataset:
BRIX: Meeting the Requirements for Online Second Language Learning
Authors: Manisa Sawatpanit, Daniel Suthers, Stephen Fleming
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This paper describes the design and evaluation of BRIX, an environment for online learning of second languages. A needs analysis identified specific requirements of online language learning. Commercial course management systems were determined to be inadequate with respect to these requirements. BRIX was developed to address the need for a generic language learning environment that fulfills language educators' requirements focusing on reading, writing, and listening activities and can easily be customized for different language courses. The design of BRIX is based on pedagogic approaches and theories of teaching and learning second languages and on the results of analytic and empirical evaluation of test versions of the software. In this paper we describe the needs analysis and the design of BRIX, and present an evaluation that compares the use and usability of a Chinese course in BRIX to a previous handcrafted version of the same course.
Poaching and the Misappropriation of Information: Transaction Risks of Information Exchange
Authors: Eric K. Clemons, Lorin M. Hitt
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

We introduce the concept of poaching, the risk that in any transactional relationship information that is transferred between parties for purposes specified in the contract will deliberately be used by the receiving party, for purposes outside the contract, to its own economic benefit, and to the detriment of the party that provided the information. We argue that this form of transactional risk, a component of transactions costs, is increasingly importantin our service-centered, information-driven, post-industrial economy. Using case examples and a discussion of the related literature, we show and discuss the conditions under which shared information creates the potential for poaching, examine the impact and efficacy of traditional remedies for contractual problems in managing poaching, and identify additional mechanisms for managing poaching risk. Our analysis suggests that the nature of these risks and their remedies are fundamentally different that those considered in previous theories of supplier relations and contractual governance.
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
Authors: Bin Li, Michael S. Hsiao, Shuo Sheng
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (2) a marked CNF database non-trivially combining success/conflict-driven learning; (3) quantified-jump-back dynamically quantifying primary input variables from the preimage; (4) improved free BDD built on the fly, saving memory and avoiding inclusion of PI variables; finally, (5) a practical method of storing all solutions into a canonical OBDD format. Experimental results demonstrated the efficiency of the proposed approach for very large sequential circuits.
Institution-independent ultraproducts
Authors: Razvan Diaconescu
Venue: Fundamenta Informaticae (2002)

We generalise the ultraproducts method from conventional model theory to an institution-independent (i.e. independent of the details of the actual logic formalised as an institution) framework based on a novel very general treatment of the semantics of some important concepts in logic, such as quantification, logical connectives, and ground atomic sentences. Unlike previous abstract model theoretic approaches to ultraproducts based on category theory, our work makes essential use of concepts central to institution theory, such as signature morphisms and model reducts. The institution-independent fundamental theorem on ultraproducts is presented in a modular manner, different combinations of its various parts giving different results in different logics or institutions. We present applications to institution-independent compactness, axiomatizability, and higher order sentences, and illustrate our concepts and results with examples from four different algebraic specification logics. In the introduction we also discuss the relevance of our institution-independent approach to the model theory of algebraic specification and computing science, but also to classical and abstract model theory.
Detection de bateaux dans les images de radar a ouverture synthetique
Authors: Shengrui Wang, Djemel Ziou
Venue:  (2003)

The main purpose of this thesis is to develop efficient algorithms and design a system for ship detection from Synthetic Aperture Radar (SAR) imagery. Ship detection usually involves through detection of point targets on a radar clutter background. The detection of a ship depends on the physical properties of the ship itself, such as size, shape, and structure; its orientation relative to the radar look-direction; and the general condition of the sea state. Our strategy is to detect all possible ship targets in SAR images, and then search around each candidate for the wake as further evidence. The objectives of our research are (1) to improve estimation of the parameters in the K-distribution model and to determine the conditions in which an alternative model (Gamma, for example) should be used instead; (2) to explore a PNN (Probabilistic Neural Networks) model as an alternative to the commonly used parameteric models; (3) to design a FC (Fuzzy Clustering) model capable of detecting both small and large ship targets from single-channel images or multi-channel images; (4) to combine wake detection with ship target detection; (5) to design a detection model that can also be used to detect ship targets in coastal areas. We have developed algorithms for each of these objectives and integrated them into a system comprising six models. The system has been tested on a number of SAR images (SEASAT, ERS and RADARSAT-1, for example) and its performance has been assessed.
Home grown CGI: the cultivation of "Henry's Garden"
Authors: Kevin Geiger, Moon Seun
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Can a home-based production beset with software incompatibilities, corrupt hard drives, earthquakes and teething puppies make it to the big screen? The creators of "Henry's Garden" air their dirty laundry in this candid look at the making of an independent, animated short film.
Efficient Distributed Admission Control for Anycast Flows
Authors: Weijia Jia, Wanqing Tu, Lidong Lin
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Anycasting becomes an important research topic recently especially for the replicated servers where availability and fault-tolerance are critical for quality of service. With anycasting, applications can request the "nearest" server for provision of a desired services. In this paper, we study efficient Admission Control for Anycast (ACA) flows. We focus on algorithms that perform smart destination selection and efficient route establishment weighing at the probe message round trip time (RTT). Taking advantages of anycasting, our ACA algorithms differ from other approach in their dependence on system status information. Performance data obtained through simulation show that our ACA system performs efficiently in terms of admission delay, overhead and admission probability.
Generative Systems in Design
Authors: Samir Emdanat, George Stiny, Emmanuel-George Vakaló
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Generative research in design investigates compact representations that facilitate the rapid exploration of large design spaces. It includes among other things: rule-based systems, feature structures, and genetic algorithms. Generative systems are being applied to a variety of design problems from various disciplines including engineering, product design, and architecture. The objective is to further our understanding of the design operations and manipulations to create systems that better support the designers' activity.
Pedagogical tools for database design, development and use
Authors: Dzenan Ridjanovic
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

I teach undergraduate and graduate (MBA) courses in information systems. My primary teaching objective is to help students design and develop dynamic web applications. My students are primarily business oriented; therefore I cannot spend too much time on technical details.A database is a very important part of any dynamic web application. It is also its most technical part. To hide the complexity of database technologies, I developed two tools: Magic Models to design a data model and generate a relational database schema, and Database Framework to allow an easy database access. Both tools are developed in Java. Magic Models is Swing based graphical tool and Database Framework uses JDBC for databases access and updates.
Radar Dwell Scheduling Considering Physical Characteristics of Phased Array Antenna
Authors: Chang-Gun Lee, Phil-Su Kang, Chi-Sheng Shih, Lui Sha
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

This paper proposes novel techniques for schedulingradar dwells in phased array radar systems. In order tohandle complex physical characteristics such as dwell inter-leaving,transmitting duty cycle constraint, and energy constraint,we propose a notion of schedulability envelope. Theschedulability envelope designed offline hides the details ofcomplex radar dwell scheduling and provides a simple measurefor the schedulability check. Using the schedulabilityenvelope, the proposed technique can efficiently perform theadmission control for dynamic target tracking tasks. Thesimulation results show that the proposed approach can significantlyimprove the system utilization by taking advantageof dwell interleaving while guaranteeing the schedulabilityand physical constraints.
Nonparametric Frontier Estimation by Linear Programming
Authors: G. Bouchard, S. Girard, A. B. Iouditski, A. V. Nazin
Venue: Automation and Remote Control (2004)

A new method for estimating the frontier of a set of points (or a support, in other words) is proposed. The estimates are defined as kernel functions covering all the points and whose associated support is of smallest surface. They are written as linear combinations of kernel functions applied to the points of the sample. The weights of the linear combination are then computed by solving a linear programming problem. In the general case, the solution of the optimization problem is sparse, that is, only a few coefficients are non zero. The corresponding points play the role of support vectors in the statistical learning theory. The L1-norm for the error of estimation is shown to be almost surely converging to zero, and the rate of convergence is provided.
A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering
Authors: Chihli Hung, Stefan Wermter
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Clustering by document concepts is a powerful way ofretrieving information from a large number of documents.This task in general does not make any assumption on thedata distribution. In this paper, for this task we propose anew competitive Self-Organising (SOM) model, namelythe Dynamic Adaptive Self-Organising Hybrid model(DASH). The features of DASH are a dynamic structure,hierarchical clustering, non-stationary data learning andparameter self-adjustment. All features are data-oriented:DASH adjusts its behaviour not only by modifying itsparameters but also by an adaptive structure. Thehierarchical growing architecture is a useful facility forsuch a competitive neural model which is designed fortext clustering. In this paper, we have presented a newtype of self-organising dynamic growing neural networkwhich can deal with the non-uniform data distributionand the non-stationary data sets and represent the innerdata structure by a hierarchical view.
Using ToolBook authoring tool to facilitate the teaching of algorithms
Authors: George Papadopoulos, Hariton M. Polatoglou
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

An application is developed and used in teaching the subject of algorithms. It is used in classroom practice, at Lyceum and the University. The results show that the application increased students interest, helped the students to realize the importance of the algorithums and their workings, and grasp some abstract computer science concepts.
A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods
Authors: Xinwei Liu, Jie Sun
Venue: Journal of Global Optimization (2004)

Multistage stochastic linear programming (MSLP) is a powerful tool for making decisions under uncertainty. A deterministic equivalent problem of MSLP is a large-scale linear program with nonanticipativity constraints. Recently developed infeasible interior point methods are used to solve the resulting linear program. Technical problems arising from this approach include rank reduction and computation of search directions. The sparsity of the nonanticipativity constraints and the special structure of the problem are exploited by the interior point method. Preliminary numerical results are reported. The study shows that, by combining the infeasible interior point methods and specific decomposition techniques, it is possible to greatly improve the computability of multistage stochastic linear programs.
Variable complexity algorithms and adaptive computation control in video coding and communications
Authors: Antonio Ortega
Venue:  (2002)

With the current trend towards Internet wireless access, there is an increased interest in portable, hand-held digital communication devices, where power is an important performance metric. If we assume that algorithm complexity is a good approximation of the power consumption, then variable complexity algorithms are beneficial since they enable reduced power modes. This dissertation addresses variable complexity algorithms in three areas: First, we propose a novel variable complexity algorithm (VCA) for transform coding based on energy thresholds. Since our VCA computes a subset of the transform coefficients, it yields different complexity and rate distortion performance than standard transform coders. We present analytical results for the optimal bit allocation in this VCA. Experiments show that our VCA can achieve better rate distortion tradeoff at low rates than the popular JPEG techniques. Second, we propose a new proxy-based framework that is capable of accelerating video decoding operations of portable devices with wireless access ability. We demonstrate that an adaptive proxy can significantly reduce the complexity of the Inverse Discrete Cosine Transform running at the client without violating any applicable constraint on the proxy-client bandwidth. Third, we solve the problem of computation control for variable complexity Fano decoders. Fano decoders can provide the desirable tradeoff between bit error rate and decoder complexity. However, buffers are required due to large variations in decoding delays. In order to minimize the overall probability of block loss under a finite buffer size constraint, we propose algorithms for controlling the decoding complexity adaptively with changes of buffer occupancy. For memoryless additive white Gaussian noise channels, our control algorithms can reduce the block loss by as much as 40%. For slow flat Rayleigh fading channels corresponding to low/medium degree of mobility, we introduce prediction algorithms based on finite state Markov models that characterize the memory of the channel. Simulations show that block loss can be lowered by an additional 5% as compared to results obtained under the assumption of memoryless channels.
A Probability-based Uncertainty Model for Point-in-Polygon Analysis in GIS
Authors: Chui Kwan Cheung, Wenzhong Shi, Xian Zhou
Venue: Geoinformatica (2004)

In a geographical information system (GIS), a conventional point-in-polygon analysis is used to determine whether a point is located inside a polygon with a Boolean result. Due to positional uncertainties existing with both the point and the polygon, the Boolean answer cannot describe the relationship of closeness between the point and the polygon. This paper aims to develop a model and to provide a continuous index&mdash;the probability value&mdash;to indicate the extent of the uncertain point located inside the uncertain polygon based upon existing research development. This probability index is derived based on probability and statistical theories considering the statistical uncertainty distributions of the point and the polygon&rsquo;s vertices. The associated mathematical expressions for the probability index are addressed in cases depending on the intersection between the polygon and the error ellipse of the point. The proposed probability index can provide an objective description of the relationship of closeness between an uncertain point and an uncertain polygon.
An examination of ICT planning maturity in schools: a stage theory perspective
Authors: Julie Mackey, Annette Mills
Venue: Current issues in IT education (2003)

Information and communication technology (ICT) has the potential to revolutionize teaching and learning as well as school administration, yet little is known about the maturity of ICT planning in schools and the manner in which schools plan for the acquisition and use of these technologies in the educational environment. However, as school investments in ICT increase and they become more reliant on ICT, effective planning becomes more central to schools' ability to maximize their use of technology. This research examines ICT planning in schools and proposes a four-stage model of the evolution of ICT planning maturity in schools. The model emerges from case studies conducted in eight New Zealand primary schools and provides insight into the nature of ICT planning in schools and the factors that contribute to planning maturity.
A "Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequences
Authors: András György, Tamás Linder, Gábor Lugosi
Venue: Proceedings of the Conference on Data Compression (2004)

Zero-delay lossy source coding schemes are considered for individual sequences.Performance is measured by the distortion redundancy, defined asthe difference between the normalized cumulative mean squared distortion ofthe scheme and the normalized cumulative distortion of the best scalar quantizerof the same rate which is matched to the entire sequence to be encoded.Recently, Weissman and Merhav constructed a randomized scheme which, forany bounded individual sequence of length n, achieves a distortion redundancyO(n-1/3log n). However, this scheme has prohibitive complexity (both spaceand time) which makes practical implementation infeasible. In this paper, wepresent an efficiently computable algorithm based on a "follow the perturbedleader"-type prediction method by Kalai and Vempala. Our algorithm achievesdistortion redundancy O(n-1/4 log n), which is somewhat worse than that of thescheme by Merhav and Weissman, but it has computational complexity that islinear in the sequence length n, and requires O(n1/4) storage capacity.
On the expressiveness of pure safe ambients
Authors: Pascal Zimmer
Venue: Mathematical Structures in Computer Science (2003)

We consider the Pure Safe Ambient Calculus, which is Levi and Sangiorgi's Safe Ambient Calculus (a variant of Cardelli and Gordon's Mobile Ambient Calculus) restricted to its mobility primitives &ndash; in particular, we focus on its expressive power. Since it has no form of communication or substitution, we show how these notions can be simulated by mobility and modifications in the hierarchical structure of ambients. As a main result, we use these techniques to design an encoding of the synchronous $\pi$-calculus into pure ambients, and we study its correctness, thus showing that pure ambients are as expressive as the $\pi$-calculus. In order to simplify the proof and give an intuitive understanding of the encoding, we design an intermediate language, the $\pi$-Calculus with Explicit Substitutions and Channels, which is an extension of the $\pi$-calculus in which communication and substitution are broken into simpler steps, and we show that is has the same expressive power as the $\pi$-calculus.
A flexible and scalable authentication scheme for JPEG2000 image codestreams
Authors: Cheng Peng, Robert H. Deng, Yongdong Wu, Weizhong Shao
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

JPEG2000 is an emerging standard for still image compression and is becoming the solution of choice for many digital imaging fields and applications. An important aspect of JPEG2000 is its "compress once, decompress many ways" property [1], i. e., it allows extraction of various sub-images (e.g., images with various resolutions, pixel fidelities, tiles and components) all from a single compressed image codestream. In this paper, we present a flexible and scalable authentication scheme for JPEG2000 images based on the Merkle hash tree and digital signature. Our scheme is fully compatible with JPEG2000 and possesses a "sign once, verify many ways" property. That is, it allows users to verify the authenticity and integrity of different sub-images extracted from a single compressed codestream protected with a single digital signature.
Redesign using state splitting
Authors: Raul Camposano, Reinaldo A. Bergamaschi
Venue: Proceedings of the conference on European design automation (1990)

In high-level synthesis, the generation of different designs is generally referred to as design space exploration. This paper presents an efficient and accurate method for design space exploration based on redesign. Initially, a design that optimizes a design criterion such as performance is synthesized. State splitting them successively generates new designs by introducing additional control states. The size of each design is accurately estimated using a tentative data-path allocation and then computing its area using a typical CMOS cell library implementation. Results for six benchmark examples illustrate these techniques.
Edison: Database-Supported Synchronization for PDAs
Authors: Matthew Denny, Michael J. Franklin
Venue: Distributed and Parallel Databases (2004)

One of the most important features provided by personal digital assistants is the ability to synchronize device data with data on a user's PC. Unfortunately, current synchronization protocols have significant shortcomings that limit the availability, usability, and performance of synchronization. We present Edison, a service that leverages existing off-the-shelf ORDBMS technology to address these problems. Edison allows large numbers of users to synchronize handheld devices from any point on the internet with subsets of large, shared data sets. Edison supports this functionality while transferring the minimal amount of data to and from the device. We describe the implementation of the Edison data server and protocol, and show that Edison requires minimal overhead in terms of DBMS storage and additional time per synchronization.
Web Service Conversation Modeling: A Cornerstone for E-Business Automation
Authors: Boualem Benatallah, Fabio Casati, Farouk Toumani
Venue: IEEE Internet Computing (2004)

Several issues remain before Web services will have benefits similar to what traditional middleware brings to intra-organizational application integration. This article presents a framework that builds on current standards to help developers define extended service models and richer Web service abstractions. The framework's conversation metamodel is derived from the authors' analysis of e-commerce portal sites.