ppxscal/embedding_network huggingface dataset:
Statistical properties of simple types
Authors: M. Moczurad, J. Tyszkiewicz, M. Zaionc
Venue: Mathematical Structures in Computer Science (2000)

We consider types and typed lambda calculus over a finite number of ground types. We are going to investigate the size of the fraction of inhabited types of the given length n against the number of all types of length n. The plan of this paper is to find the limit of that fraction when n &rarr; &infin;. The answer to this question is equivalent to finding the &lsquo;density&rsquo; of inhabited types in the set of all types, or the so-called asymptotic probability of finding an inhabited type in the set of all types. Under the Curry&ndash;Howard isomorphism this means finding the density or asymptotic probability of provable intuitionistic propositional formulas in the set of all formulas. For types with one ground type (formulas with one propositional variable), we prove that the limit exists and is equal to 1&sol;2 + &radic;5&sol;10, which is approximately 72.36%. This means that a long random type (formula) has this probability of being inhabited (tautology). We also prove that for every finite number k of ground-type variables, the density of inhabited types is always positive and lies between (4k + 1)&sol;(2k + 1)2 and (3k + 1)&sol;(k + 1)2. Therefore we can easily see that the density is decreasing to 0 with k going to infinity. From the lower and upper bounds presented we can deduce that at least 1&sol;3 of classical tautologies are intuitionistic.
Automating survey coding by multiclass text categorization techniques
Authors: Daniela Giorgetti, Fabrizio Sebastiani
Venue: Journal of the American Society for Information Science and Technology (2003)

Survey coding is the task of assigning a symbolic code from a predefined set of such codes to the answer given in response to an open-ended question in a questionnaire (aka survey). This task is usually carried out to group respondents according to a predefined scheme based on their answers. Survey coding has several applications, especially in the social sciences, ranging from the simple classification of respondents to the extraction of statistics on political opinions, health and lifestyle habits, customer satisfaction, brand fidelity, and patient satisfaction. Survey coding is a difficult task, because the code that should be attributed to a respondent based on the answer she has given is a matter of subjective judgment, and thus requires expertise. It is thus unsurprising that this task has traditionally been performed manually, by trained coders. Some attempts have been made at automating this task, most of them based on detecting the similarity between the answer and textual descriptions of the meanings of the candidate codes. We take a radically new stand, and formulate the problem of automated survey coding as a text categorization problem, that is, as the problem of learning, by means of supervised machine learning techniques, a model of the association between answers and codes from a training set of precoded answers, and applying the resulting model to the classification of new answers. In this article we experiment with two different learning techniques: one based on naive Bayesian classification, and the other one based on multiclass support vector machines, and test the resulting framework on a corpus of social surveys. The results we have obtained significantly outperform the results achieved by previous automated survey coding approaches.
Integrating Heterogeneous Web Services with WebXcript
Authors: Dickson K. W. Chiu, Danny Kok, Alex K. C. Lee, S. C. Cheung
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Despite recent uprising of the Web Servicestechnology for programmed interfaces ofbusiness-to-business (B2B) E-commerce services(e-services) over the Internet, most sites (e.g.,online purchases) can only support HypertextMarkup Language (HTML) for human interactionsthrough web browsers. Automating client access tothese services generally requires developingsophisticated programs to simulate human accessby handling HTML pages and forms. However,these HTML interfaces vary across web sites, andare often subjected to changes. Client maintenanceis therefore tedious and expensive. This paperpresents a novel approach to automate dialogs withweb-based services, using a high-level scriptlanguage, called WebXcript. WebXcript providesfeatures for HTML forms based dialogues and XMLmessaging. The XML syntax of WebXcript furtherenables convenient user authoring and easy enginedevelopment with extensively available XML tools.It supports expected responses and exceptionhandling. We further propose a wrapperarchitecture to integrate heterogeneous WebServices based on WebXcript. We demonstrate theapplicability of our approach with examples inintegrating distributed information, online ordering,and XML messaging.
Web-based discussion forums: the staff perspective
Authors: Judy Sheard, Jan Miller, Sita Ramakrishnan
Venue: ACM SIGCSE Bulletin (2003)

Web-based discussion forums are used in a range of undergraduate and graduate courses in the School of Computer Science and Software Engineering at Monash University. The enthusiastic adoption of these facilities by students has impacted upon staff worklods and recently concerns have been raised by staff about the time and effort required to manage them. Furthermore, it has been difficult to determine the pedagogical value of these facilities and the level of educational support they provide to the teaching and learning community. This paper reports on staff use and management of discussion forums in their courses, and their perceptions of the value of these facilities as a source of help for students and a mechanism to provide feedback to staff. A final outcome of the study will be the establishment of guidelines for staff and students for the effective use of these facilities.
Using lab exams to ensure programming practice in an introductory programming course
Authors: João Paulo Barros, Luís Estevens, Rui Dias, Rui Pais, Elisabete Soeiro
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

The high variability of students' backgrounds typically found in introductory programming courses creates additional difficulties to foster motivation and ensure the desired competency and retention rates. This paper presents and discusses the results of applying an assessment methodology strongly based upon lab exams (or on-computer exams) with the objective of ensuring programming pratice competency while maintaining students' motivation. It discusses the difficult balances of several assessment methods, details the used assessment methodology and finally presents students results and views. These show that lab exams, although more demanding then group assignments, can be made popular among students if they perceived them as fairer.
Wavelets feature aided tracking (WFAT) using GMTI/HRR data
Authors: Lang Hong, Shan Cong, Mark T. Pronobis, Stephen Scott
Venue: Signal Processing (2003)

This paper presents a research development of wavelets feature aided tracking, which effectively combines information from both high-resolution range (HRR) radar profiles and ground moving target indication (GMTI) radar reports. The state-of-the-art wavelets-based statistical signal processing technique: wavelets domain hidden Markov trees is used to extract robust features from HRR profiles. With the assistance of HRR wavelets features, a GMTI tracker based on a probabilistic data association logic can effectively track ground moving targets in confusing scenarios.
A Web page prediction model based on click-stream tree representation of user behavior
Authors: Şule Gündüz, M. Tamer Özsu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Predicting the next request of a user as she visits Web pages has gained importance as Web-based activity increases. Markov models and their variations, or models based on sequence mining have been found well suited for this problem. However, higher order Markov models are extremely complicated due to their large number of states whereas lower order Markov models do not capture the entire behavior of a user in a session. The models that are based on sequential pattern mining only consider the frequent sequences in the data set, making it difficult to predict the next request following a page that is not in the sequential pattern. Furthermore, it is hard to find models for mining two different kinds of information of a user session. We propose a new model that considers both the order information of pages in a session and the time spent on them. We cluster user sessions based on their pair-wise similarity and represent the resulting clusters by a click-stream tree. The new user session is then assigned to a cluster based on a similarity measure. The click-stream tree of that cluster is used to generate the recommendation set. The model can be used as part of a cache prefetching system as well as a recommendation model.
Simulating spatial assumptions
Authors: Katerina Mania, Andrew Robinson
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This sketch presents a new method for assessing 'functional realism' across a range of applications. The basic premise is that an individual's prior experience will influence how he or she perceives, comprehends and remembers new information in a scene. 36 participants across three conditions of varied rendering quality of the same space were exposed to the computer graphics environment and completed an object-based memory recognition task. The preliminary experiments presented here could have significant implications while identifying areas of an interactive computer graphics scene that require higher quality of rendering as well as areas where lower fidelity could be adequate, based on this premise.
T-ODMG: an ODMG compliant temporal object model supporting multiple granularity management
Authors: Elisa Bertino, Elena Ferrari, Giovanna Guerrini, Isabella Merlo
Venue: Information Systems (2003)

In this paper we investigate some issues arising from the introduction of multiple temporal granularities in an object-oriented data model. Although issues concerning temporal granularities have been investigated in the context of temporal relational database systems, no comparable amount of work has been done in the context of object-oriented models. Moreover, the main drawback of the existing proposals is the lack of a formal basis--which we believe is essential to manage the inherent complexity of the object-oriented data model. In this paper, we define a comprehensive temporal object-oriented data model supporting multiple temporal granularities. We formally define the main notions of the data model such as types, legal values, classes, and objects. We address issues related to inheritance, type refinement, and substitutability. Finally, we describe the implementation of the presented model on top of an ODMG compliant DBMS.
A Security Improved OpenSST Prototype Combining with Smart Card
Authors: Xinhua Zhang, Christoph Meinel, Alexandre Dulaunoy
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Open Simple Secure Transaction (OpenSST) protocol aims to be a secure and transaction-oriented protocol for the unsecured network. OpenSST is a open source project, at present a simple prototype based on HTTP protocol has been implemented. In this paper, we give firstly an overview of openSST, and then we describe the basic architecture of this prototype, as well as make an analysis on its security. Then we introduce a security-enhancedmodel based on this prototype, which utilize the tamper-resistant nature of Smart Card. We will discuss several possible ways of integrating Smart Card into the OpenSST.
Schema-guided wrapper maintenance for web-data extraction
Authors: Xiaofeng Meng, Dongdong Hu, Chen Li
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Extracting data from Web pages using wrappers is a fundamental problem arising in a large variety of applications of vast practical interests. There are two main issues relevant to Web-data extraction, namely wrapper generation and wrapper maintenance. In this paper, we propose a novel schema-guided approach to the problem of automatic wrapper maintenance. It is based on the observation that despite various page changes, many important features of the pages are preserved, such as syntactic patterns, annotations, and hyperlinks of the extracted data items. Our approach uses these preserved features to identify the locations of the desired values in the changed pages, and repair wrappers correspondingly by inducing semantic blocks from the HTML tree. Our intensive experiments on real Web sites show that the proposed approach can effectively maintain wrappers to extract desired data with high accuracies.
A Parallel Two-Level Hybrid Method for Tridiagonal Systems and Its Application to Fast Poisson Solvers
Authors: Xian-He Sun, Wu Zhang
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--A new method, namely, the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH has two levels of parallelism. The first level is based on algorithms developed from the Sherman-Morrison modification formula, and the second level can choose different parallel tridiagonal solvers for different applications. By choosing different outer and inner solvers and by controlling its two-level partition, PTH can deliver better performance for different applications on different machine ensembles and problem sizes. In an extreme case, the two levels of parallelism can be merged into one, and PTH can be the best algorithm otherwise available. Theoretical analyses and numerical experiments indicate that PTH is significantly better than existing methods on massively parallel computers. For instance, using PTH in a fast Poisson solver results in a 2-folds speedup compared to a conventional parallel Poisson solver on a 512 nodes IBM machine. When only the tridiagonal solver is considered, PTH is over 10 times faster than the currently used implementation.
A Reengineering Process for Migrating from an Object-oriented Legacy System to a Component-based System
Authors: Eunjoo Lee, Byungjeong Lee, Woochang Shin, Chisu Wu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Computing environments are evolving from mainframesystems to distributed systems. Stand-alone programs thathave been developed using object-oriented technology arenot suitable for these new environments. However, programsthat have been developed using a component-basedtechnology have proven to be more suitable for the newenvironments due to their granularity and reusability. In thispaper, we present a reengineering process for migratingfrom an object-oriented legacy system to a component-basedsystem. This process consists of two steps: first, tocreate basic components with the relationship of theirconstituent classes, second, to refine components using themetrics we propose.
Computational modeling of internal surfaces in austenite-martensite system
Authors: Luis Adolfo Melara
Venue:  (2003)

In this work, we present a new computational method based on a nonconforming domain decomposition technique for modeling of phase transitions. Phase transitions are the result of thermal or mechanical loading in ferromagnetic materials or shape memory materials. Modeling of phase transitions is important because it can help to predict or control the behavior of these materials. This thesis will focus on phase transitions characterized by two directions of magnetization in the case of ferromagnets and two variants of Martensite in the case of shape memory materials. In both types of materials, branching occurs near an internal surface which is characterized by complex microstructures. These microstructures occur at a minimum energy state. The new computational method simulates the branching behavior of these microstructures near an internal surface. We approximate the microstructures via energy minimization. We minimize the total stored energy stored in vicinity of internal surface with the minimizing function representing the microstructures. We compare the numerical results obtained by the new technique with those obtained by a more standard technique, one not incorporating nonconforming domain decomposition. Furthermore, we verify the various energy scaling laws used to predict the total stored energy near an internal surface. Among these laws, we verify the local-in-y scaling property which has been conjectured but not proven.
A Framework for Creating a Facetted Classification for Genres: Addressing Issues of Multidimensionality
Authors: Kevin Crowston, Barbara H. Kwasnik
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

People recognize and use document genres as a way of identifying useful information and of participating in mutually understood communicative acts. Crowston and Kwasnik [1] discuss the possibility of improving information access in large digital collections through the identification and use of document genre metadata. They draw on the definition of genre proposed by Orlikowski and Yates [3], who describe genre as "a distinctive type of communicative action, characterized by a socially recognized communicative purpose and common aspects of form" (p. 543). Scholars in fields such as rhetoric and library science have attempted to describe and systematize the notion of genre, and have offered many different definitions of genre. We like Orlikowski and Yates's definition because it takes into account all three aspects of genre that we recognize as fundamental: content, form, and purpose.A document's genre is a subtle and complex concept in which the content and form of a document are fused with its purpose or function. As such, a document's genre cannot be separated from the context in which it is used; the same document may be construed as being of a different genre depending on how it is invoked in a given situation. Starting from the document, a letter may be a personal communication, or a piece of evidence in a courtof law, or an agreement, or even a work of art. Starting from the situation, we note that differences in an information situation are often reflected in the kind of document that is considered helpful (e.g., a problem set vs. a lesson plan vs. a tutorial about mathematics, forinstance). Thus, we see genre as a multidimensional phenomenon, which takes into account not only the attributes of the document itself, but also of its role in human endeavor. In this paper, we discuss some considerations in developing a facetted classification for genres to address the problem of multi-dimensionality.
Beyond the digital divide in Canadian schools: from access to competency in the use of information technology
Authors: E. Dianne Looker, Victor Thiessen
Venue: Social Science Computer Review (2003)

This article provides a descriptive analysis of issues related to the access and use of information and communication technology (ICT) among Canadian youth. In particular, it examines the extent to which inequities in the use of and access to ICT exist among Canadian high school students based on gender, socioeconomic status, and rural-urban location. The analyses suggest that there is a digital divide for Canadian youth in access to and experience with ICT. Rural youth are less likely to have access to computers in the home; however, frequency of use and perceived competency levels are not compromised because they make greater use of computers at school. Female youth and those from families with low levels of parental education are also less likely to have access to computers in their homes; they tend to access computers less frequently and report lower levels of computer skills competency.
On Regular Graphs Optimally Labeled with a Condition at Distance Two
Authors: John P. Georges, David W. Mauro
Venue: SIAM Journal on Discrete Mathematics (2004)

For positive integers $j \geq k$, the $\lambda_{j,k}$-number of graph G is the smallest span among all integer labelings of V(G) such that vertices at distance two receive labels which differ by at least k and adjacent vertices receive labels which differ by at least j. We prove that the $\lambda_{j,k}$-number of any r-regular graph is no less than the $\lambda_{j,k}$-number of the infinite r-regular tree $T_{\infty}(r)$. Defining an r-regular graph G to be $(j,k,r)$-optimal if and only if $\lambda_{j,k}(G) = \lambda_{j,k}(T_{\infty}(r))$, we establish the equivalence between $(j,k,r)$-optimal graphs and r-regular bipartite graphs with a certain edge coloring property for the case ${j \over k} > r$. The structure of $r$-regular optimal graphs for ${j \over k} \leq r$ is investigated, with special attention to ${j \over k} = 1,2$. For the latter, we establish that a (2,1,r)-optimal graph, through a series of edge transformations, has a canonical form. Finally, we apply our results on optimality to the derivation of the $\lambda_{j,k}$-numbers of prisms.
Web cache optimization with nonlinear model using object features
Authors: Timo Koskela, Jukka Heikkonen, Kimmo Kaski
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this paper, Web cache optimization by utilizing syntactic features extracted from cache objects is studied. A nonlinear model is used to predict the value of each cache object by using features from the HTTP responses of the server, the access log of the cache, and from the HTML structure of the object. In a case study, linear and nonlinear models are used to classify about 50,000 HTML documents according to their popularity. The nonlinear model yields classification percentages of 64 and 74 for the documents to be stored or to be removed from the cache, respectively. A synthetic workload is then used to study the performance gain from the classifier in a conventional Least Recently Used cache model. The results suggest that the proposed approach can improve the performance of the cache substantially.
Convergence of the Iterated Prisoner's Dilemma Game
Authors: Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, Gabriel Istrate, Mark Jerrum
Venue: Combinatorics, Probability and Computing (2002)

We consider a stochastic process based on the iterated prisoner's dilemma game. During the game, each of n players has a state, either cooperate or defect. The players are connected by an &lsquo;interaction graph&rsquo;. During each step of the process, an edge of the graph is chosen uniformly at random and the states of the players connected by the edge are modified according to the Pavlov strategy. The process converges to a unique absorbing state in which all players cooperate. We prove two conjectures of Kittock: the convergence rate is exponential in n when the interaction graph is a complete graph, and it is polynomial in n when the interaction graph is a cycle. In fact, we show that the rate is O(n log n) in the latter case.