ppxscal/embedding_network huggingface dataset:
Constraints on the generation of referring expressions, with special reference to hindi
Authors: Rashmi Prasad
Venue:  (2003)

This dissertation makes a progress towards the generation of referring expressions in Hindi. We first make a proposal to exploit a combination of Gricean implicatures (Grice, 1975) and Centering theory constraints (Grosz et al., 1995) to formulate a generation algorithm for referring expressions whose domain of application is defined in terms of the Centering Transitions. observed across languages. To set the language-specific parameters of the algorithm, in particular the parameter that decides the relative salience of the discourse entities in an utterance, we propose a corpus-based methodology to identify the ways in which discourse salience is realized linguistically in any language. We apply this method to a Hindi corpus to investigate three possible linguistic reflexes of discourse salience: grammatical role, word order, and information status, and show that Hindi does not display exhibit any correlation between discourse salience and either word order or information status, and that grammatical function emerges as the primary determinant of salience. Using the results of the proposed methodology for Hindi, we provide an analysis of Hindi zero pronouns. We argue that the constraints on the use of zeros in Hindi are neither syntactic (Kameyama, 1985) nor explicable purely in terms of the singular notion of the topic (Butt King, 1997). Our analysis, provided in terms of Centering transition preferences, shows that pronouns can be dropped in Hindi only when they occur in an utterance following a CONTINUE or a SMOOTH-SHIFT transition, thus demonstrating the importance of the Preferred Center for zero pronoun realization. Finally, with respect to the problem of defining the utterance unit for discourse, we provide an analysis of complex sentences containing relative clauses. We argue that different kinds of relative clauses have different utterance statuses as well as different effects on the hierarchical organization of discourse segments. Non-restrictive relative clauses form a distinct but embedded utterance unit, while restrictives are part of the main clause unit. Our data also provide support for partitioning the class of restrictive relatives into indefinite head and definite head restrictives (Prince, 1990), with indefinite head restrictives patterning like non-restrictives.
The importance of explicitly stating educational objectives in computer science curricula
Authors: Faith Clarke, Han Reichgelt
Venue: ACM SIGCSE Bulletin (2003)

Designing an appropriate baccalaureate curriculum is a difficult and challenging process. The process becomes even harder in environments with severe resource limitation, as one is forced to make hard choices about which courses and topics to include in the curriculum. This paper describes the curriculum design efforts made in a small Computer Science Department at the Jamaica campus of the University of the West Indies. The effort started with a formulation of explicit program outcomes, which then guided the curriculum design. The paper also describes the reasons that led the department to embark on this curriculum design process and gives some of the benefits that the Department has seen as a result of its efforts.
Best Practices in Data Warehousing to Support Business Initiatives and Needs
Authors: Jeff Lawyer, Shamsul Chowdhury
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The paper presents the data warehousing architecture and practices used at a major U.S. retailing company. Many considerations were assessed when deciding which data warehousing architecture to adopt. The paper discusses the two pre-dominant styles in Data Warehousing, namely the "Bill Inmon Style" or the top-down approach and the "Ralph Kimball Style" or the bottom-up approach. The company chose the Inmon style due to a unique combination of circumstances in their business and technical environments, which are being discussed in detail.Much of the information presented in this paper is based upon the direct experiences of the lead data architect assigned to the projects under which this U.S. retailing company's customer data warehouse evolved.The architecture has evolved over time and currently has been accepted at the company as a best practice. It is interesting to mention that both the hardware platform (CPU and disk drives) and Relational Database Management System (RDBMS) software employed today at this company for data warehousing is not the same as was selected for the first instantiation. The implication was that the best plan or practice was a flexible one.There were many challenges, like organizational, technical, data sourcing and data naming, needed to be solved during the pre-project, initial stages, and throughout the project and beyond. The initial data warehouse, implemented in 1996, was termed an overall success and approved for expansion. The current data warehouse data are being used by over six hundred registered users to fine-tune customer marketing and leverage and share data in an enterprise manner. The data warehouse has allowed the company to strengthen customer relationship management (CRM) core capabilities and business partnerships. Today, there are many departments benefiting from queries and requests for data warehouse data, many anticipated, some not. Although not planned, the data warehouse has been a valuable source of purchase and customer data in case of a manufacturer recall of merchandise. Above all, the company has been able to leverage and share enterprise customer data to the benefit of the entire company.
Two party immediate response disputes: properties and efficiency
Authors: Paul E. Dunne, T. J. M. Bench-Capon
Venue: Artificial Intelligence (2003)

Two Party Immediate Response Disputes (TPI-disputes) are one class of dialogue or argument game in which the protagonists take turns producing counter arguments to the 'most recent' argument advanced by their opponent. Argument games have been found useful as a means of modelling dialectical discourse and in providing semantic bases for proof theoretic aspects of reasoning. In this article we consider a formalisation of TPI-disputes in the context of finite Argument Systems. Our principal concern may, informally, be phrased as follows: given a specific argument system, H, and argument x within H, what can be stated concerning the number of moves a dispute might take for one of its protagonists to accept that x has some defence respectively cannot be defended?
OP-Cluster: Clustering by Tendency in High Dimensional Space
Authors: Jinze Liu, Wei Wang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Clustering is the process of grouping a set of objects intoclasses of similar objects. Because of unknownness of thehidden patterns in the data sets, the definition of similarityis very subtle. Until recently, similarity measures are typicallybased on distances, e.g Euclidean distance and cosinedistance. In this paper, we propose a flexible yet powerfulclustering model, namely OP-Cluster (Order PreservingCluster). Under this new model, two objects are similaron a subset of dimensions if the values of these twoobjects induce the same relative order of those dimensions.Such a cluster might arise when the expression levels of (co-regulated)genes can rise or fall synchronously in responseto a sequence of environment stimuli. Hence, discovery ofOP-Cluster is essential in revealing significant gene regulatorynetworks. A deterministic algorithm is designed andimplemented to discover all the significant OP-Clusters. Aset of extensive experiments has been done on several realbiological data sets to demonstrate its effectiveness and efficiencyin detecting co-regulated patterns.
Fibonacci spectral transforms: calculation, algorithms and circuit realizations
Authors: Milena Stanković, Radomir S. Stanković, Jaakko Astola, Karen Egiazarian
Venue: Systems Analysis Modelling Simulation (2003)

In this article, we define the Fibonacci decision diagrams (FibDDs) permitting representation of functions defined in a number of points different from N = 2n by decision diagrams consisting of nodes with two outgoing edges.We show the relationships between the FibDDs and the contracted Fibonacci codes and propose a procedure for calculation of the generalized Fibonacci transforms through FibDDs. This procedure permits calculation of the generalized Fibonacci spectra of functions defined in a number of points equal to a large generalized Fibonacci number. We use FibDDs to design architectures for realization of discrete functions and calculation of the generalized Fibonacci p-transforms. We also consider the circuit realizations of functions represented by FibDDs and the circuit realizations of Fibonacci spectral transforms.
Interchanging group-by and join in distributed query processing
Authors: Weipeng Paul Yan
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

In previous work we have shown that the order of evaluating join and group-by can be interchanged in an SQL query under certain conditions. In many cases, performing group-by before join is a better way of evaluating the query. However, queries do exist for which it is better to perform join before group-by. When the conditions for interchanging the order of join and group-by for an SQL query are satisfied, the evaluation order should be determined mainly by the objective function of the query processor. This paper shows that the conditions can be used for estimating the cost of the two alternative evaluation plans in distributed query processing; specifically, estimating the cardinalities of the results of joins in the two alternative plans. It also proposes some strategies for deciding the direction of the transformation and a procedure for deciding the evaluation order of join and group-by for a distributed query.
On variable blocking factor in a parallel dynamic block: Jacobi SVD algorithm
Authors: Martin Bečka, Gabriel Okša
Venue: Parallel Computing (2003)

The parallel two-sided block-Jacobi singular value decomposition (SVD) algorithm with dynamic ordering, originally proposed in [Parallel Comput. 28 (2002) 243-262], has been extended with respect to the blocking factor ℓ. Unlike the unique blocking factor ℓ = 2p in the original algorithm running on p processors, the current blocking factor is a variable parameter that covers the values in two different regions--namely, ℓ = p/k and ℓ = 2kp for some integer k. Two new parallel two-sided block-Jacobi SVD algorithms with dynamic ordering are described in detail. They arise in those two regions and differ in the logical data arrangement and communication complexity of the reordering step. For the case of ℓ = 2kp, it is proved that a designed point-to-point communication algorithm is optimal with respect to the amount of communication required per processor as well as to the amount of overall communication. Using the message passing programming model for distributed memory machines, new parallel block-Jacobi SVD algorithms were implemented on an SGI-Cray Origin 2000 parallel computer. Numerical experiments were performed on p = 12 and 24 processors using a set of six matrices of order 4000 and blocking factors ℓ, 2 ≤ ℓ ≤ 192. To achieve the minimal total parallel execution time, the use of a blocking factor ℓ ∈ {2,p, 2p} can be recommended for matrices with distinct singular values. However, for matrices with a multiple minimal singular value, the total parallel execution time may monotonically increase with ℓ. In this case, the recommended Jacobi method with ℓ = 2 is just the ScaLAPACK routine with some additional matrix multiplications, and it computes the SVD in one parallel iteration step.
Global stability of neural network with distributed delays
Authors: Hongyong Zhao
Venue: Neural, Parallel Scientific Computations (2003)

The paper is devoted to the global asymptotic stability (GAS)of equilibrium point for a class of neural networks with distributed delays. Some sufficient criteria of the the GAS of equilibrium point are derived. We don't assume that the signal propagation functions satisfy the Lipschitz condition and do not require them to be bounded, differentiable or strictly increasing. Moreover, the symmetry of the connection matrix is not also necessary. These conditions are presented in terms of system parameters and have importance leading significance in designs and applications of the GAS for neural networks system with distributed delays. Two examples are also worked out to demonstrate the advantages of our results.
Generalization of Laguerre orbitals toward an accurate, concise and practical analytic atomic wave function
Authors: Z. Xiong, N. C. Bacalis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Simple analytic, non-orthogonal but selectively orthogonalizable, generalized Laguerre type atomic orbitals are proposed, which, when optimized, provide a concise and clear physical interpretation with near equivalent accuracy to numerical multi-configuration self-consistent field, in atomic multi-configuration calculations. A general Eckart theorem for excited states is analyzed, leading, via a thorough search of these orbitals, to an estimated energy correction, for various excited atomic states prone to variational collapse.
Use of UML stereotypes in business models
Authors: Daniel Brandon,  Jr.
Venue: UML and the unified process (2003)

This chapter presents some particularly useful UML stereotypes for use in business systems. Stereotypes are the core extension mechanism of UML. If you find that you need a modeling element or information extension to an element that is not in UML but it is similar to something that is, you treat your addition/extension as a stereotype. These new stereotypes are defined and the need for them is discussed. The stereotypes aid in both the design/drawing phase and in the implementation (coding) phase of the overall system construction. An example case study illustrates their usage with both design drawings and the implementation code (C++).
On avoiding remote blocking via real-time concurrency control protocols
Authors: LihChyun Shu
Venue: Journal of Systems and Software (2003)

Locking protocols for hard-real-time systems have not generalized well from uniprocessors to multiprocessors. Bounding and reducing so-called "remote blocking" is widely recognized as an important problem for hard-real-time computing. We describe a combination of locking and versioning protocols together with a "chopping" analysis to shorten critical sections. Selective application of chopping and versioning reduces remote blocking and relaxes constraints imposed by pure locking protocols for multiprocessors. Using the same design-time information required for schedulability analysis in pure locking protocols, the integrated locking and versioning protocol can be implemented using only simple data structures with tunable bounded overheads and worst-case access times. Performance evaluation results via case studies and simulation experiments are presented that show that the protocol can improve pure locking protocols in a variety of settings. Experiments show that in some cases the number of tasks that can be guaranteed schedulability by our integrated protocol is 2.5 times more than the number of tasks that can be guaranteed schedulability by pure locking protocols.
VS-VO Numerov method for the numerical solution of the Schr&#x00F6;dinger equation
Authors: J. Vigo-Aguiar, H. Ramos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The goal of providing efficient general purpose numerical methods has been a central activity within the full scope of solving numerically differential equations. But lately there has been a certain change of trend, in the sense that some types of problems are so particular that it is better to develop their own special theory and techniques.
Higher Quality Requirements Specifications through Natural Language Patterns
Authors: Christian Denger, Daniel M. Berry, Erik Kamsties
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

In most current industrial software engineering projects, themajority of requirements documents are written almost entirelyin natural language. However, specifying the requirements innatural language has one major drawback, namely the inherentimprecision, i.e., ambiguity, incompleteness, and inaccuracy, ofnatural language. Since the requirements document forms thebasis of the whole development process, such defects can havesevere consequences for the whole project. Therefore, it isimportant to deal with these defects in a requirements specificationright from the start. This paper presents an approach forreducing the problem of imprecision in natural language requirementsspecifications with the use of natural language patterns,which allow formulating requirements sentences in a lessambiguous, more complete, and more accurate way. To ensurethe applicability of our approach we based our patterns on ametamodel for requirements statements for embedded systems.With this metamodel, we ensure that all forms of requirementsstatements are described with the patterns. We validated theeffectiveness of the patterns by using them to rewrite a substantial,previously written, requirements specification to eliminateits imprecisions.
Toward an integrated framework for modeling enterprise processes
Authors: Nikunj P. Dalal, Manjunath Kamath, William J. Kolarik, Eswar Sivaraman
Venue: Communications of the ACM (2004)

Enterprise process modeling is the most important element in the design of next-generation ERP systems.
Evaluating Mission Critical Large-Scale Embedded System Performance In Real-Time Java
Authors: David C. Sharp, Edward Pla, Kenn R. Luecke
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Many of the benefits of Java, including its inherentportability, networking support and simplicity, are ofincreasing importance to large-scale distributed real-timeembedded (DRE) systems, but have beenunavailable due to the lack of acceptable real-timeperformance. Recent work establishing the Real-TimeSpecification for Java (RTSJ) [i] has led to theemergence of associated Real-Time Java VirtualMachines (RT JVMs) which promise to bridge this gap.This paper describes benchmarking results on a RT JVMin a uni-processing environment, and compares them toboth C++ implementations of similar behavior andapplication requirements associated with large-scaleavionics systems. This paper extends previouslypublished results [ii][iii] by including avionicsapplication level tests.
Context Based Coding of Binary Shapes by Object Boundary Straightness Analysis
Authors: Shankar Manuel Aghito, Sren Forchhammer
Venue: Proceedings of the Conference on Data Compression (2004)

A new lossless compression scheme for bi-level images targeted at binary shapesof image and video objects is presented. The scheme is based on a local analysisof the digital straightness of the causal part of the object boundary, which is usedin the context definition for arithmetic encoding. Tested on individual images ofbinary shapes and binary layers of digital maps the algorithm outperforms PWC,JBIG and MPEG-4 CAE. On the binary shapes the code lengths are reduced by21%, 25%, and 42%, respectively. On the maps the reductions are 34%, 32%, and59%, respectively. The algorithm is also more efficient than the state-of-the-art andmore complex Free Tree coder for most of the binary shape and map test images.
Multilevel First-Order System Least Squares for Nonlinear Elliptic Partial Differential Equations
Authors: A. L. Codd, T. A. Manteuffel, S. F. McCormick
Venue: SIAM Journal on Numerical Analysis (2003)

A fully variational approach is developed for solving nonlinear elliptic equations that enables accurate discretization and fast solution methods. The equations are converted to a first-order system that is then linearized via Newton's method. First-order system least squares (FOSLS) is used to formulate and discretize the Newton step, and the resulting matrix equation is solved using algebraic multigrid (AMG). The approach is coupled with nested iteration to provide an accurate initial guess for finer levels using coarse-level computation. A general theory is developed that confirms the usual full multigrid efficiency: accuracy comparable to the finest-level discretization is achieved at a cost proportional to the number of finest-level degrees of freedom. In a companion paper, the theory is applied to elliptic grid generation (EGG) and supported by numerical results.
Heuristics and lower bounds for the bin packing problem with conflicts
Authors: Michel Gendreau, Gilbert Laporte, Frédéric Semet
Venue: Computers and Operations Research (2004)

In the bin packing problem with conflicts, the aim is to pack items into the minimum number of bins subject to incompatibility restrictions. Two lower bounding procedures and six heuristics for this problem are developed and compared.
Evolution of behaviors in autonomous robot using artificial neural network and genetic algorithm
Authors: Malrey Lee
Venue: Information Sciences: an International Journal (2003)

In distributed autonomous robot (agents) systems, each robot (predator or prey) must behave by itself according to its states and environments, and if necessary, must cooperate with other robots in order to carry out a given task. Therefore it is essential that each robot have both learning and evolution ability to adapt to dynamic environment. This paper proposes a pursuing system utilizing the artificial life concept where autonomous mobile robots emulate social behaviors of animals and insects and realize their group behaviors. Each robot contains sensors to perceive other robots in several directions and decides its behavior based on the information obtained by the sensors. In this paper, a neural network is used for behavior decision controller. The input of the neural network is decided by the existence of other robots and the distance to the other robots. The output determines the directions in which the robot moves. The connection weight values of this neural network are encoded as genes, and the fitness individuals are determined using a genetic algorithm. Here, the fitness values imply how much group behaviors fit adequately to the goal and can express group behaviors. The validity of the system is verified through simulation. Besides, in this paper, we could have observed the robots' emergent behaviors during simulation.