ppxscal/embedding_network huggingface dataset:
Experience offering a course centered on cyberporn
Authors: Joseph D. Oldham
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In Spring Semester 2007 our small liberal arts college offered a new course, Computer Science 150, Cyberporn: A Seminar in Computing and Society. I proposed and taught the course as a one-hour seminar style course with no prerequisite. This paper describes the course, including motivation and student response.
Platform wide innovations to overcome thermal challenges
Authors: Raj Yavatkar, Murli Tirumala
Venue: Microelectronics Journal (2008)

As the trend towards higher performance with increased integration continues, the emerging platform technology challenges require innovation across multiple disciplines at low cost to deliver compelling products. Customers demand increased performance to enable new usage models across all market segments in ever-constrained form factors. To complement voltage scaling and leakage issues associated with silicon, it is necessary to advance the thermal management and acoustics technologies at the system level. On the other hand, architectural tradeoffs are required to extract maximum performance for a given energy budget. In this paper, we outline the challenges and present a few ideas to expand the performance envelope of future platforms. These challenges should also function as a motivation to the research community at large to develop breakthrough innovations.
Lower bounds for integer greatest common divisor computations
Authors: Y. Mansour
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

An Omega (log log n) lower bound is proved on the depth of any computation tree with operations (+, -, /, mod,
Incremental, scalable tracking of objects inter camera
Authors: Andrew Gilbert, Richard Bowden
Venue: Computer Vision and Image Understanding (2008)

This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated cameras with non overlapping fields of view. The approach relies on the three cues of colour, relative size and movement between cameras to describe the relationship of objects between cameras. This relationship weights the observation likelihood for correlating or tracking objects between cameras. Any individual cue alone has poor performance, but when fused together, a large boost in accuracy is gained. Unlike previous work, this paper uses an incremental technique to learning. The three cues are learnt in parallel and then fused together to track objects across the spatially separated cameras. The colour appearance cue is incrementally calibrated through transformation matrices, while probabilistic links, modelling an object's bounding box, between cameras represent the objects relative size. Probabilistic region links between entry and exit areas on cameras provide the cue of movement. The approach needs no pre colour or environment calibration and does not use batch processing. It works completely unsupervised, and is able to become more accurate over time as new evidence is accumulated.
On 3-choosability of planar graphs without certain cycles
Authors: Haihui Zhang, Zhiren Sun
Venue: Information Processing Letters (2008)

A graph G=(V,E) is L-colorable if for a given list assignment L={L(v):v@?V(G)}, there exists a proper coloring c of G such that c(v)@?L(v) for all v@?V. If G is L-colorable for every list assignment L with |L(v)|>=k for all v@?V, then G is said to be k-choosable. In this paper, we prove that every planar graph with neither 5-, 6-, and 7-cycles nor triangles of distance less than 3, or with neither 5-, 6-, and 8-cycles nor triangles of distance less than 2 is 3-choosable.
Prediction of Alternative 5'/3' Splice Sites in the Human Genome
Authors: Wuritu Yang, Qian-zhong Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Alternative splicing is an important mechanism to increase the transcript diversity. Previous studies which based on expressed sequence tags (ESTs) and microarray analysis have identified many alternative splicing events, and have shown that alternative 5′/3′ splice sites occur frequently in the human genome. Because of the experimental limitations, computational approaches for identification of alternative 5′/3′ splice sites are needed. In this paper, the support vector machine method which combines with position weight matrix and increment of diversity is proposed. And based on the mechanism of splice site competition, more than 71% of alternative splice sites and constitutive splice sites in the human genome can be correctly classified.
On the exact complexity of string matching
Authors: L. Colussi
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript 'online' is added when attention is restricted to online algorithms, and the superscript '1' is added when algorithms that find only one occurrence of the pattern in the text are considered. It is well known that n
Recovery of Damaged Compressed Files for Digital Forensic Purposes
Authors: Bora Park, Antonio Savoldi, Paolo Gubian, Jungheum Park, Seok Hee Lee, Sangjin Lee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Nowadays compressed files are very widespread and can be considered, without any doubt, with regard to the Digital Forensic realm, an important and precious source of probatory data. This is especially true when in a digital investigation the examiner has to deal with corrupted compressed files, which have been gathered in the collection phase of the investigative process. Therefore, in the computer forensic field, data recovery technologies are very important for acquiring useful pieces of data which can become, in a court of low, digital evidence. This kind of technology isused not only by law enforcement, but also by the multitude of users in their daily activities, which justify the relevant presence of tools in the software market which are devoted to rescue data from damaged compressed files. However, state-of-the-art data recovery tools have many limitations with regard to the capability of recovering the original data, especially in the case of damaged compressed files. So far, such recovery tools have been based on a schema which controls the signature/header of the file and, thus, provides the offset to the raw compressed data block. As a result, they cannot recover the compressed files if the first part of the raw compressed data block, which pertains to the header, is damaged or the signature/header block is corrupted. Therefore, in order to deal with this issue, we have developed a new tool capable of rescuing damaged compressed files, according to the DEFLATE compression scheme, even though the header block is missing or corrupted. This represents a new interesting opportunity for the digital forensic discipline.
An O(nlog/sup 3/ n) algorithm for the real root problem
Authors: J. H. Reif
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Given a univariate complex polynomial f(x) of degree n with rational coefficients expressed as a ratio of two integers
Synchronous NDVI and surface air temperature trends in Newfoundland: 1982 to 2003
Authors: C. S. R. Neigh, C. J. Tucker, J. R. G. Townshend
Venue: International Journal of Remote Sensing (2007)

We investigated two unusual systematic normalized difference vegetation index (NDVI) growing season trends in Newfoundland from 1982 to 1999 within a satellite data record from 1982 to 2003 and attempted to determine their causes. We found direct correlations between increasing NDVI and increasing surface air temperature for the 1982-1990 and 1991-1999 growing seasons, punctuated by sharp simultaneous decreases in both surface temperature and the NDVI in 1991 from 1990 that were associated with the volcanic eruption of Mt. Pinatubo. No covarying trend between NDVI and surface air temperatures was found from 2000 to 2003. The responses of increasing plant growth, as indicated by the increasing NDVI, to increasing surface air temperature from 1982 to 1990 and 1991 to 1999, were also associated with a lengthening of the growing seasons of ∼9 and ∼17 days for these two periods, respectively. We found no systematic variations in precipitation, the presence of early season and late season snow cover, systematic variation in down-welling photosynthetically-active radiation, post-forest fire succession, regrowth following logging of coniferous forests, and other land use changes that contributed to the 1982-1990 and 1991-1999 increasing NDVI trends. Our results document the influences of surface air temperature upon boreal forest plant growth and the cooling effects of major volcanic eruptions in this ecological system.
Evaluation of surface roughness of ULE® substrates machined by Ar+ ion beam
Authors: Yuichi Kurashima, Shuhei Miyachi, Iwao Miyamoto, Manabu Ando, Atsushi Numata
Venue: Microelectronic Engineering (2008)

Ion beam figuring is suitable for the final correction of the surface figure error of aspherical substrates in an extreme ultraviolet lithography optics. This paper reports the investigation of the surface roughness of ULE^(R) substrate machined by an Ar^+ ion beam of 3-10keV. For an Ar^+ ion beam in the range of 3-10keV, the mid-spatial frequency roughness of the surfaces machined to a depth of 50nm was comparable to the surface roughness of an unprocessed one. The high-spatial frequency roughness of the unprocessed surface was 0.08nm rms; whereas, the HSFRs of the surface of the substrate at Ar^+ ion beam of 3, 5, 7, and 10keV were 0.10, 0.14, 0.16, and 0.17nm rms, respectively.
From the Archives: Codebreaking (or not) in Shanghai
Authors: Colin Burke
Venue: Cryptologia (2007)

A United States OSS document gives a personal view of the failure of German codebreaking activies in occupied China during World War II.
Instructional-Design Theories Applied on a Web-Based Learning Application
Authors: Ann Svensson
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Instructional-design theories often offer explicit guidance on how to better help people learn and develop. In this paper different instructional-design theories will be applied on a planned multimedia learning web-based application. The application used in this analysis is a planned interactive web-based application for learning about horse exterior assessment. Different instructional-design theories can be applied, but they will each put emphasize on different factors. The theories can be used one at a time, but the result will benefit from mixing useful thoughts from different theories. The theories can then be complements to each other in different ways in developing a useful learning application.
A Case for High Availability in a Virtualized Environment (HAVEN)
Authors: Erin Farr, Richard Harper, Lisa Spainhower, Jimi Xenidis
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The cost and operational complexity of traditional High Availability solutions has limited their widespread adoption. Virtualization allows availability properties to be associated with the system architecture, rather than depending on the intrinsic reliability of components. This paper introduces an extensible grammar that classifies the states and transitions of virtual machine images. From this grammar, rules for recovery and High Availability can be created which define how virtualization allows for simplified fault tolerance, making HAVENs accessible to the mainstream user.
A least squares formulation for canonical correlation analysis
Authors: Liang Sun, Shuiwang Ji, Jieping Ye
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Canonical Correlation Analysis (CCA) is a well-known technique for finding the correlations between two sets of multi-dimensional variables. It projects both sets of variables into a lower-dimensional space in which they are maximally correlated. CCA is commonly applied for supervised dimensionality reduction, in which one of the multi-dimensional variables is derived from the class label. It has been shown that CCA can be formulated as a least squares problem in the binaryclass case. However, their relationship in the more general setting remains unclear. In this paper, we show that, under a mild condition which tends to hold for high-dimensional data, CCA in multi-label classifications can be formulated as a least squares problem. Based on this equivalence relationship, we propose several CCA extensions including sparse CCA using 1-norm regularization. Experiments on multi-label data sets confirm the established equivalence relationship. Results also demonstrate the effectiveness of the proposed CCA extensions.
An analysis of hip fracture treatments in Japan by the discrete-type proportional hazard and ordered probit models
Authors: Kazumitsu Nawata, Ayako Nitta, Sonoko Watanabe, Koichi Kawabuchi
Venue: Mathematics and Computers in Simulation (2008)

The length of stay and the effectiveness of medical treatment are analyzed using data from patients hospitalized for hip fractures in Japan. The influence of the Revision of the Medical Service Fee Schedule in April 2002 is evaluated, and factors which may affect the length of stay and the effectiveness of treatment (walking ability upon leaving the hospital) are also analyzed. The length of stay is analyzed by the discrete-type proportional hazard model, and the effectiveness of treatment is analyzed by the ordered probit models.
A quantitative assessment of approaches to mesh generation for surgical simulation
Authors: Bhautik Joshi, Andriy Fedorov, Nikos Chrisochoides, Simon K. Warfield, S&#x00e9;bastien Ourselin
Venue: Engineering with Computers (2008)

In surgical simulation, it is common practice to use tetrahedral meshes as models for anatomy. These meshes are versatile, and can be used with a number of different physically based modelling schemes. A variety of mesh generators are available that can automatically create tetrahedral meshes from segmented anatomical volumes. Each mesh generation scheme offers its own set of unique attributes. However, few are readily available. When choosing a mesh generator for simulation, it is critical for it to output good-quality, patient-specific meshes that provide a good approximation of the shape or volume to be modelled. To keep computation time within the bounds required for real-time interaction, there is also a limit imposed on the number of elements in the mesh generated. To the authors knowledge, there has been little work directly assessing the suitability of mesh generators for surgical simulation. This paper seeks to address this issue by assessing the use of six mesh generators in a surgical simulation scenario, and examining how they affect simulation precision. This paper aims to perform these comparisons against high-resolution reference meshes, where we examine the precision of meshes from the same mesh generator at different levels of complexity.
DelayEDD-HCCA and RT-HCCA: two new IEEE 802.11 e schemes based HCCA supporting real-time applications
Authors: Wafa Berrayana, Ryad Ben El-Kezadri, Farouk Kamoun, Guy Pujolle
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

This article presents DelayEDD-HCCA and RT-HCCA, two extensions based on the centralized access method of the IEEE 802.11e, HCCA supporting real-time applications. They show very good performances in terms of capacity and delays. Properties of the proposed extensions are investigated both theoretically and using J-SIM simulations. The obtained results prove that the proposed extensions succeed in guaranteeing delay bounds required by audio applications.
Using prototypes in early pervasive game development
Authors: Elina M. I. Ollila, Riku Suomela, Jussi Holopainen
Venue: Computers in Entertainment (CIE) (2008)

In this article we discuss various prototyping methods in early pervasive game development. The focus is on pervasive games that are played with mobile phones. Choosing the right prototyping method is crucial in achieving results that can be used for validating or developing further design ideas. In this article we give guidelines that help the selection process and give ideas on methods that can be used in different situations. We have play-tested pervasive game prototypes using agile software prototype development methods, forum prototypes, and guided paper prototyping methods. We give examples of five pervasive games where these kinds of prototyping methods are used. In concluding, we compare the results and discuss their benefits and disadvantages in the game development process, that is, when the methods should be used and what should be considered when using them.
Context aware reference model: architecture and implications for adaptation of learning activities
Authors: Simon Boung-Yew Lau, Chien-Sing Lee
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

One of the success criteria in e-learning is to deliver context-aware content and services to learners to achieve maximum user satisfaction and positive learning outcome. With the advancements in mobile and networking technology, it is now possible to deliver the right content and services based on the learner's learning context. In this paper, we define context as the information about the learner and its interaction with the e-learning application. Through our study of some related work, we formulate a context reference model, which encompasses some common best practices of numerous context aware e-learning models. This reference model serves to fulfill some of the new requirements regarding contextualisation of learning resources. In the last section of this paper, we propose a service-oriented system architecture that will be implemented using Java Technology to verify and test the effects of learners' learning style as context in context aware e-learning for engineering education, particularly in a computer programming subject.
New estimations of the spectral radii of J, G-S and SOR iterative matrices for a class of linear systems
Authors: Ting-Zhu Huang, D. J. Evans
Venue: International Journal of Computer Mathematics (2007)

Given the linear system Ax=b, new upper bounds for the spectral radii of Jacobi, Gauss-Seidel and SOR iterative matrices are presented. Practical conditions of convergence for these iterations, which are suited to extended matrix classes containing strictly diagonally dominant matrices, are obtained.
Anti-periodic solutions for high-order Hopfield neural networks
Authors: Chunxia Ou
Venue: Computers Mathematics with Applications (2008)

In this paper high-order Hopfield neural networks (HHNNs) with time-varying delays are considered. Sufficient conditions for the existence and exponential stability of anti-periodic solutions are established, which are new and complement previously known results.
Radial basis function meshless method for the steady incompressible Navier-Stokes equations
Authors: Phani P. Chinchapatnam, K. Djidjeli, Prasanth B. Nair
Venue: International Journal of Computer Mathematics (2007)

A meshless collocation method based on radial basis functions is proposed for solving the steady incompressible Navier-Stokes equations. This method has the capability of solving the governing equations using scattered nodes in the domain. We use the streamfunction formulation, and a trust-region method for solving the nonlinear problem. The no-slip boundary conditions are satisfied using a ghost node strategy. The efficiency of this method is demonstrated by solving three model problems: the driven cavity flows in square and rectangular domains and flow over a backward-facing step. The results obtained are in good agreement with benchmark solutions.
On the consistency of the direct forcing method in the fractional step solution of the Navier-Stokes equations
Authors: Federico Domenichini
Venue: Journal of Computational Physics (2008)

In the present work the application of the direct forcing method to the fractional step solution of the Navier-Stokes equations is analyzed in details. The central topic of the study is the satisfaction of the boundary conditions in the presence of immersed bodies. To this aim, simple two-dimensional problems with steady forcing and sharp-edged surfaces are solved with a standard fractional step method. It is shown that the direct forcing scheme is not able to satisfy the impenetrability condition. This fact appears to be strictly related to the use of fractional step methods. A mathematically based explanation is given, suggesting that improvements can be obtained with the iterative solution of the irrotational part of the flow, when spectral methods are used and local modification of the discrete differential operators are difficult to be implemented. The results are then verified in two-dimensional unsteady problems and three-dimensional flows with moving smooth boundaries.
SpotWeb: detecting framework hotspots via mining open source repositories on the web
Authors: Suresh Thummalapenta, Tao Xie
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

The essentials of modern software development (such as low cost and high efficiency) demand software developers to make intensive reuse of existing open source frameworks or libraries (generally referred as frameworks) available on the web. However, developers often face challenges in reusing these frameworks due to several factors such as the complexity and lack of proper documentation. In this paper, we propose a code-search-engine-based approach that tries to detect hotspots in a given framework by mining code examples gathered from open source repositories available on the web; these hotspots are the APIs that are frequently reused. Hotspots can serve as starting points for developers in understanding and reusing the given framework. We developed a tool, called SpotWeb, for frameworks or libraries written in Java and conducted two case studies with two open source frameworks JUnit and Log4j. We also show that the detected hotspots of Log4j and JUnit are consistent with their respective documentations.
Wireless Handheld Devices Become Trusted Network Devices
Authors: Kevin Curran, Paul Canning
Venue: Information Systems Security (2007)

In the world of information technology, a security model is only as secure as its weakest link. There are several layers of security and different measures that can currently be implemented. However, they lack coordination, and therefore potential security breaches might compromise the network. With wireless access becoming the norm, and users requiring "on the move communication" even within a campus, networks are expanding past the traditional wired networks by adding wireless access points. This gives customers the flexibility they require but leaves a net threat vector to the network. There have been various encryption and security steps taken to validate the communication and authentication of the devices and end users connecting. This project addresses the critical problem of secure authentication using the 802.1x standard, which will be implemented using Microsoft's Radius server elements. It will involve the enrollment of secure certificates on Windows mobile devices, thus securing mobile devices from physical attacks. To ensure that all steps are adhered to, that all necessary applications have been installed, and to handle Web service communication, an application will be created that will provide an automated solution.