ppxscal/embedding_network huggingface dataset:
Text Categorization Through Probabilistic Learning: Applications toRecommender Systems
Authors: Paul N. Bennett
Venue:  (1998)

With the growth of the World Wide Web, recommender systems have received an increasing amount of attention. Many recommender systems in use today are based on collaborative filtering. This project has focused on LIBRA, a content-based book recommending system. By utilizing text categorization methods and the information available for each book, the system determines a user profile which is used as the basis of recommendations made to the user. Instead of the bag-of-words approach used in many other statistical text categorization approaches, LIBRA parses each text sample into a semi-structured representation. We have used standard Machine Learning techniques to analyze the performance of several algorithms on this learning task. In addition, we analyze the utility of several methods of feature construction and selection (i.e. methods of choosing the representation of an item that the learning algorithm actually uses). After analyzing the system we conclude that good recommendations are produced after a relatively small number of training examples. We also conclude that the feature selection method tested does not improve the performance of these algorithms in any systematic way, though the results indicate other feature selection methods may prove useful. Feature construction, however, while not providing a large increase in performance with the particular construction methods used here, holds promise of providing performance improvements for the algorithms investigated. This text assumes only minor familiarity with concepts of artificial intelligence and should be readable by the upper division computer science undergraduate familiar with basic concepts of probability theory and set theory.
High Dimensional Homotopy Curve Tracking on a Shared Memory Multiprocessor
Authors: Donald C. S. Allison, Kashmira M. Irani, Calvin J. Ribbens, Layne T. Watson
Venue:  (1991)

Results are reported for a series of experiments involving numerical curve tracking on a shared memory parallel computer. Several algorithms exist for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then the tracking of some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. A parallel version of HOMPACK is implemented on a shared memory parallel computer with various levels and degrees of parallelism (e.g., linear algebra, function and Jacobian matrix evaluation), and a detailed study is presented for each of these levels with respect to the speedup in execution time obtained with the parallelism, the time spent implementing the parallel code and the extra memory allocated by the parallel algorithm.
Analysis of Bottlenecks in International Internet Links
Authors: Habib Md. Ahsan, Abrams Marc
Venue:  (1998)

We report on preliminary results of analysis into the sources of congestion in international Internet routes from the United States to several countries: Brazil and South Africa. Using the pathchar and traceroute tools, we identified which links in a variety of routes are a bottleneck. The measures used were throughput, round trip delay, and router queueing delays. Measurements with ping were used to validate the round trip times obtained with pathchar.
The Changing Relationships between Computing Centers, Other Campus Units and University Administrations
Authors: John A. N. Lee
Venue:  (1986)

This is the text of the presentation to the opening session of the 1986 ACM/SIGUCCS annual meeting held in St. Louis, MO. The author presents some concerns regarding the widening gap between university computing centers, as service organizations administered by one particular subgroup of their clients. and those they are committed to serve. 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
Exploring Common Conceptions About Boys and Electronic Games
Authors: Joan Lawry, Rena Upitis, Maria Klawe, Ann Anderson, Kori Inkpen, M. Ndunda, David Hsu, Stephen Leroux, Kamran Sedighian
Venue:  (1994)

Electronic games are an integral part of many boys'' lives. Based on observations made over a two-month period at an electronic games exhibit in an interactive science museum in Vancouver, Canada, we examine three commonly held views about boys and electronic game culture: (a) electronic games and boys'' behaviour while playing them contain elements of aggression, violence, competition, fast-action, and speed; (b) electronic games encourage anti-social, ``loner'''' behaviour; and (c) boys who play electronic games are susceptible to becoming so devoted to playing the games that they neglect other areas of their lives, such as school, physical activity, and family. Our findings indicate the following: (a) while violent games are popular, many boys prefer games that challenge them mentally; (b) there appears to be little connection between anti-social behavior and electronic game playing; and (c) many boys who play electronic games have interests also in music, programming, reading, and school. This paper depicts one facet of the first, exploratory phase of the Electronic Games for Education in Math and Science (E-GEMS) enterprise. E-GEMS is an ongoing research project with the ultimate goal of increasing the proportion of children who enjoy learning and using math and science---specifically by engaging children''s interest in these subjects through the play of electronic games in the context of existing classroom educational methods. Hence, we also consider some of the implications for educational electronic game design in view of our findings about current commercial electronic games.
A Unified Approach to the Geometric Rectification of remotely Sensed Imagery
Authors: Frank H Wong
Venue:  (1984)

Many applications of remotely sensed digital imagery require images that are corrected for geometric distortions. It is often desirable to rectify different types of satellite imagery to a common data base. A high throughput rectification system is required for commercial application. High geometric and radiometric precision must be maintained. The thesis has accomplished the following tasks: \begin{enumerate} \item The sensors used to obtain remotely sensed imagery have been investigated and the associated geometric distortions inherent with each sensor are identified. \item The transformation between image coordinates and datum coordinates has been determined and the values of the parameters in the transformation are estimated. \item A unified rectification approach has been developed, for all types of remotely sensed digital imagery, which yields a high system throughput. \item Use of digital terrain models in the rectification process to correct for relief displacement has been incorporated. \item An efficient image interpolation algorithm has been developed. This algorithm takes into account the fact that imagery does not always correspond to sampling on a uniform grid. \item The applications of rectified imagery such as mosaicking and multisensor integration have been studied. \item Extension of the rectification algorithm to a future planetary mission has been investigated. \end{enumerate} The sensors studied include TIROS-N Landsat-1, -2 and -3 multispectral scanners, Seasat synthetic aperture radar, Landsat-4 thematic mapper and SPOT linear array detectors. Imagery from the last two sensors is simulated.
An Example of Deriving Performance Properties from a VisualRepresentation of Program Execution
Authors: Marc Abrams
Venue:  (1995)

This paper demonstrates that one can use a visual representation of the execution of a program to analyze performance properties. The method starts with a visualization of the progress of processes, and then applies geometric properties of the visualization to analyze program execution behavior. The visualization is based on progress graphs from the literature, which map the progress of each process to one Cartesian graph axis. Line segments represent interprocess synchronization. A directed, continuous path that does not cross a segment represents a particular execution of a program, and can be found using computational geometric algorithms. A special case is also considered in which programs display periodic behavior. The relation of the program class studied to Petri nets is also examined.
Failure Transparency in Remote Procedure Calls
Authors: K. Ravindran, Samuel T. Chanson
Venue:  (1987)

Remote procedure call (RPC) is a communication abstraction widely used in distributed programs. The general premise entwined in existing approaches to handle machine and communication failures during RPC is that the applications which interface to the RPC layer cannot tolerate the failures. The premise manifests as a top level constraint on the failure recovery algorithms used in the RPC layer in these approaches. However, our premise is that applications can tolerate certain types of failures under certain situations. This may in turn relax the top level constraint on failure recovery algorithms and allow exploiting the inherent tolerance of applications to failures in a systematic way to simplify failure recovery. Motivated by the premise. The paper presents a model of RPC. The model reflects certain generic properties of the application layer that may be exploited by the RPC layer during failure recovery. Based on the model a new technique of adopting orphans caused by failures is described. The technique minimizes Ihe rollback which may be required in orphan killing techniques. Algorithmic details of the adoption technique are described followed by a quantitative analysis. The model has been implemented as a prototype on a local area network. The simplicity and generality of the failure recovery renders the RPC model useful in distributed systems. particularly those that are large and heterogeneous and hence have complex failure modes.
Behaviour of steel-concrete composite beam with flexible shear stud
Authors: H. G. Kwak, Y. J. Seo
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Slip behaviour of steel and concrete composite beams with flexible shear stud is investigated using a numerical model proposed in this paper. A linear partial interaction theory is adopted in formulation of the structural behaviour, and a linear load-slip relation is assumed for the computational convenience. On the basis of governing equations representing the slip between steel beam and concrete slab, the numerical model is derived through the force equilibrium equations and strain compatibility conditions at each node, with an assumption of piecewise linear distribution of the bending moment. The correlation studies between analytical and numerical results and several parameter studies are conducted to establish the validity of the proposed model.
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
Authors: L. A. Goldberg, M. Jerrum, S. Kannan, M. S. Paterson
Venue:  (2000)

We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, lambda, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgement-based protocol.
On Symmetric Schemes and Differential-Algebraic Equations.
Authors: Uri Ascher
Venue:  (1988)

An example is given which demonstrates a potential risk in using symmetric difference schemes for initial value differential-algebraic equations (DAEs) or for very stiff ODEs. The basic difficulty is that the stability of the scheme is controlled by the stability of an auxiliary (ghost) ODE problem which is not necessarily stable even when the given problem is. \n The stability of symmetric schemes is better understood in the context of boundary value problems. In this context, such schemes are more naturally applied as well. For initial value problems, better alternatives may exist. A computational algorithm is proposed for boundary value index-l DAEs.
Parallelisation of Block Matching Motion Estimation Algorithms
Authors: M. K. Steliaros, G. R. Martin, R. A. Packwood
Venue:  (1997)

Block matching motion estimation accounts for a high computational overhead in most low bit-rate video coders intended for video-conferencing and multimedia applications. Conventional fixed size block matching (FSBM) and more sophisticated variable size block matching (VSBM) algorithms are profiled to determine how parallelism can be applied to increase efficiency. Three parallel implementations are considered: a homogeneous workstation network using PVM; a Parsytec Super-Cluster, 128-node T800 transputer-based MIMD machine; and a shared memory multiprocessor, using a `threads'' programming model. It is shown that significant improvements in computational performance can be made, even on commonly available computing platforms. Using an MPEG-4 image test sequence, detailed evaluation of a POSIX-conformant threads implementation resulted in near-theoretical maximum speedups being obtained.
Non-linear finite element analysis of slab effects in reinforced concrete structures subjected to earthquake loads
Authors: M. B. Emara, H. M. Hosny
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The proper application of the capacity design approach in earthquake resistant design requires a deep understanding of the behavioural characteristics of the different members comprising the structure. As well, an accurate assessment of the strengths of these members is essential. Of particular importance are the relative strengths of the beams and columns. The analytical investigation carried out in this paper was primarily focused towards assessing the effects of the floor slab on enhancing both the strength and stiffness of the supporting beams under negative (hogging) moments.For this purpose, a nonlinear finite element analysis of an exterior slab-beam-column subassembly was performed. The computer program is based on a nonlinear iterative secant stiffness formulation. Three different three-dimensional finite elements were used to model the structure. The finite element analysis performed showed significant contribution of the slab reinforcement and yielded valuable results regarding the assessment of slab contribution under negative moments when the structure is subjected to lateral earthquake type loads. The results are compared with the provisions of both the Canadian and American codes. Recommendations are given for an effective slab width for exterior connections under similar conditions.
LEARNING BINARY RELATIONS USING WEIGHTED MAJORITY VOTING
Authors: Sally A. Goldman, Manfred K. Warmuth
Venue:  (1993)

In this paper we apply a weighted majority voting algorithm to the problem of learning a binary relation between two sets of objects. When using exponentially many weights, the mistake bound of the algorithm is essentially optimal. We present a construction where a number of copies of our algorithm divide the problem amongst themselves and learn the relation cooperatively. In this construction the total number of weights is polynomial. The mistake bounds are non-optimal (at least when compared to the best bound obtainable when computational resources are ignored) but significantly improve previous mistake bound bounds achieved by polynomial algorithms. Moreover our method can handle noise, which widens the applicability of the results.
Implementation of fuzzy classification query language in relational databases using stored procedures
Authors: Yauheni Veryha
Venue: Enterprise information systems IV (2003)

A framework of the fuzzy classification query language (fCQL) for data mining in information systems is presented. The fuzzy classification query language provides easy-to-use functionality for data extraction similar to the conventional non-fuzzy classification and SQL querying. The developed prototype is based on the stored procedures and database extensions of Microsoft SQL Server 2000. It can be used as data mining tool in large information systems and easily integrated with conventional relational databases. The benefits of using the presented approach include high flexibility for data analysis, user-friendly data presentation at the report generation phase and additional data security features due to the introduction of additional view-based data layer.
Toward Empirically Derived Methodologies and Tools for Human-Computer Interface Development
Authors: H. R Hartson, Deborah Hix
Venue:  (1988)

This term, unknown only a few years ago, now conjures up images of icons and objects, windows and words that comprise the human-computer interface. A UIMS is an interactive system composed of high-level tools that support production and execution of human-computer interfaces. UIMS have become a major topic of both academic and trade journal articles, conference technical presentations, demonstrations, and special interest sessions. Many commercial software packages and research products even tangentially related to the area of human-computer interaction now claim to be UIMS. As young and exciting as the field is, there are already signs of promises unfulfilled, due to a lack of both functionality and usability factors that can make the difference between whether UIMS are a passing fad or a viable tool. But what does the future hold for UIMS? All indications are that they are here to stay. We perceive a trend in UIMS evolution that we have divided into generations based primarily on common characteristics and only loosely on chronology.
Experimental Comparison of Schemes for Interpreting Boolean Queries
Authors: Whay C. Lee, Edward A. Fox
Venue:  (1988)

The standard interpretation of the logical operators in a Boolean retrieval system is in general too strict. A standard Boolean query rarely comes close to retrieving all and only those documents which are relevant to the user. An AND query is often too narrow and an OR query is often too broad. The choice of the AND results in retrieving on the left end of a typical average recall-precision graph, while the choice of the OR results in retrieving on the right end, implying a tradeoff between precision and recall. This study basically examines various proposed schemes, the P-norm, Classical Fuzzy-Set, MMM, Paice and TIRS, which provide means to soften the interpretation of the logical operators, and thus to attain both high precision and high recall search performance. Each of the above schemes has shown great improvement over the standard Boolean scheme in terms of retrieval effectiveness. The differences in retrieval effectiveness between P-norm, Paice and MMM are shown to be relatively small. However, related performance results obtained gives evidence of the ranking: P-norm, Paice, MMM and then TIRS.
Parallel Rule-Based Isotach Systems
Venue:  (1999)

The rule-based system is an important tool used to build expert systems. Much research has gone into trying to speed up rule-based systems, especially by using parallelism, but limited success has been observed so far. Most of the attempts have been in the direction of improving the Match-Recognize-Act (MRA) cycle [BROW85], which is the technique used in the sequential execution of rule-based systems. We present a parallel algorithm (ISORULE) for the execution of rule-based programs, which is based on isotach time [REYN89], and which eliminates the MRA algorithm. We compare ISORULE to a conventional parallel technique based on MRA (PARAMRA). We describe the design and implementation of ISORULE, and analyze the ways in which ISORULE exploits parallelism. We describe a static model to analyze ISORULE performance, and use it to demonstrate that ISORULE exploits most of the statically determinable parallelism in a rule set. We detail our simulation of ISORULE and PARAMRA, and report results obtained by running synthesized as well as real rule-based programs on it. Our experiments with synthetic rule sets reveal order of magnitude performance improvement of ISORULE over PARAMRA. Since our initial analysis suggests that the performance improvement increases with the amount of concurrency in the rule sets, multiple orders of magnitude in performance improvement seem likely with larger rule sets exhibiting a low degree of conflict. Further, we analyze the results obtained from our initial investigation of real rule sets, and explain the more limited performance improvement we observed with these sets. 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
Multiobjective optimal design of structures under stochastic loads
Authors: H. Jensen
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper presents a general methodology for computer-aided multi-criteria optimal design which allows all the different design criteria to be traded off while accounting for modeling and loading uncertainties. Uncertain system parameters are modeled as random variables with a prescribed joint probability density function, whereas the loads are modeled as stochastic processes. Second-order probabilistic descriptors are combined with approximate extreme response theories to obtain reliability estimates for the structural systems. A multi-criteria optimal design methodology, based on a preference aggregation rule, is used in this formulation. Optimization is carried out by generating and solving a sequence of explicit approximate problems. The uncertainty in system parameters is taken explicitly in the analysis and its effect is investigated on the optimal design. Uncertainties are important because they can change the optimal design significantly. A numerical example demonstrates the performance and efficiency of the proposed methodology.