ppxscal/embedding_network huggingface dataset:
Evaluating the Plus Program: a hybrid on-line/conventional classroom approach
Authors: M. L. Nelson
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The Plus Program combines on-line and independent learning with the conventional classroom approach. The typical Plus Program class meets every other week during the semester. This allows for the maximization of both classroom and instructor resources, and also allows both the student and the instructor to spend fifty percent less time in the classroom. It is ideal for those students and subjects who are not prime candidates for on-line learning, but who also do not require the full-time conventional classroom approach. The Plus Program is now in its second semester, and has been generally successful. Primary challenges include identifying students that will most benefit from and be successful with this approach, identifying courses that can best be adapted to this approach, and identifying and/or developing appropriate resources for the student to use outside of the classroom.
Adaptive spectral estimation using the conjugate gradient algorithm
Authors: Hongyu Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A method for spectral estimation is presented, using the modified conjugate gradient (CG) algorithm. It implements an adaptive version of Pisarenko's harmonic retrieval method, where the estimates are updated sample-by-sample. First, a constrained unit norm CG algorithm is formulated, then it is recast into an unconstrained minimization problem. The resulting algorithms can be extended to solve the generalized eigensystem problem, when the noise covariance matrix is known a priori. It is shown that the proposed algorithms convergence rate is comparable to that of a least-squares type algorithm, while being computationally more efficient. Performance simulations are shown, and comparisons with some existing methods are provided.
Digital library education in computer science programs
Authors: Jeffrey Pomerantz, Sanghee Oh, Barbara M. Wildemuth, Seungwon Yang, Edward A. Fox
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In an effort to identify the "state of the art" in digital library education in computer science (CS) programs, we analyzed CS courses on digital libraries and digital library-related topics. Fifteen courses that mention digital libraries in the title or short description were identified; of these, five are concerned with digital libraries as the primary topic of the course. The readings from these five courses were analyzed further, in terms of their authors and the journals in which they were published.
Practical tips for engaging students in team formation for multi-discipline computing projects
Authors: Jakki Sheridan-Ross
Venue: ACM SIGCSE Bulletin (2007)

In this note, we provide three top tips for organising a large scale event designed to engage students in team formation for multi-discipline computing projects. Leeds Metropolitan University's Innovation North Faculty of Information and Technology has an innovative curriculum design. In order to facilitate student engagement with a new cross-faculty module (designed to build upon previously acquired study skills and allow students to develop their range of research methodologies); a large scale event was held in November 2006 for over 700 final year undergraduate students. This one and a half day event included a number of exercises designed to help students meet peers from other computing disciplines with a view to working together to develop a project as part of a multi-discipline team in the second semester.
A 64-bit stream processor architecture for scientific applications
Authors: Xuejun Yang, Xiaobo Yan, Zuocheng Xing, Yu Deng, Jiang Jiang, Ying Zhang
Venue: ACM SIGARCH Computer Architecture News (2007)

Stream architecture is a novel microprocessor architecture with wide application potential. But as for whether it can be used efficiently in scientific computing, many issues await further study. This paper first gives the design and implementation of a 64-bit stream processor, FT64 (Fei Teng 64), for scientific computing. The carrying out of 64-bit extension design and scientific computing oriented optimization are described in such aspects as instruction set architecture, stream controller, micro controller, ALU cluster, memory hierarchy and interconnection interface here. Second, two kinds of communications as message passing and stream communications are put forward. An interconnection based on the communications is designed for FT64-based high performance computers. Third, a novel stream programming language, SF95 (Stream FORTRAN95), and its compiler, SF95Compiler (Stream FORTRAN95 Compiler), are developed to facilitate the development of scientific applications. Finally, nine typical scientific application kernels are tested and the results show the efficiency of stream architecture for scientific computing.
Analyzing engagement taxonomy in collaborative algorithm visualization
Authors: Niko Myller, Mikko Laakso, Ari Korhonen
Venue: ACM SIGCSE Bulletin (2007)

More collaborative use of visualizations is taking place in the classrooms due to the introduction of pair programming and collaborative learning as teaching and learning methods. This introduces new challenges to the visualization tools, and thus, research and theory to support the development of collaborative visualization tools is needed. We present an empirical study in which the learning outcomes of students were compared when students were learning in collaboration and using materials which contained visualizations on different engagement levels. Results indicate that the level of engagement has an effect on students' learning results although the difference is not statistically significant. Especially, students without previous knowledge seem to gain more from using visualizations on higher engagement level.
Stereo matching using both orthogonal and multiple image pairs
Authors: B. Jia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In the stereo matching process, a difficult task is to eliminate the false match caused by the repetitive patterns and smooth patterns. A new stereo matching technique that uses multiple image pairs in orthogonal-directions has been proposed. First, it computes the sum of squared-difference (SSD) values for each stereo pair in orthogonal-directions. Then it simply adds individual SSD to produce the sum of SSDs. The resulting function is called the OSSSD. We have proved that the OSSSD function possesses a unique and clear minimum at the true matching position, so it can easily remove the false match caused by both repetitive and smooth patterns. A number of experiments with synthetic and real image sequences are performed, and the results are presented to demonstrate the effectiveness of the technique.
Partition identities and Ramanujan's modular equations
Authors: Nayandeep Deka Baruah, Bruce C. Berndt
Venue: Journal of Combinatorial Theory Series A (2007)

We show that certain modular equations and theta function identities of Ramanujan imply elegant partition identities. Several of the identities are for t-cores.
Achieving global synchrony in a distributed system with free-running local clocks
Authors: Ashok Agrawala
Venue:  (2006)

In any distributed system, there is an intrinsic need to coordinate the events between the nodes. In such a system, even though each individual node only has access to its local clock, global coordination often has to be carried out the basis of time, called the global time, that is common to every nodes. One way to achieve this globally synchronous behavior is to synchronize all local clocks with an external time source such as a Cesium clock. Local time then becomes in effect global time. There are, however, several drawbacks to such clock synchronization method. Highly precise clocks are expensive and can add to the cost of the hardware node. Some approaches depend on a certain network characteristic such as a symmetric latency, a broadcast medium, or a bus structure. Many are also centralized in that they assume the existence of one or more master clocks to which the remaining clocks synchronize with, and this adds additional complexity when the master node fails and or when the network has to reorganize in order to select another master. In this dissertation, we introduce a new method for achieving global synchrony without performing clock synchronization. In our approach, called the Cyclone Network Synchronization (CNS) scheme, the local clocks are free-running and are not modified in any way. CNS relies on the ability of each node to send data at a time of its choosing. Such data are sent at regular interval, with the next instance being determined based only on the local information available at the node. Once the scheme converges, the interval for all nodes becomes exactly the same, supporting a synchronous operation across the whole network. CNS takes into account the finite precision arithmetic and measurements it has to use, while still maintaining global synchrony with very small jitter values. The scheme can be used in many synchronous cyclic networks, and does not require a broadcast medium or depend on a symmetric latency. CNS is a decentralized scheme with no master server, as all of the nodes execute the same set of instructions, and can tolerate most topology changes without the need to recon gure. There is very little overhead since no explicit synchronization messages are sent. A high degree of accuracy can be achieved with the algorithm, and both clock drift as well as latency perturbation are tolerated. Furthermore, this accuracy is not a function of the clock drift rate, as is the case for most clock synchronization approaches.
Efficient bandwidth utilization in LambdaGrids using pricing incentives
Authors: Sumit Naiksatam, Stephen A. Chiappari, Silvia Figueira
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

The ability to reserve network bandwidth is a critical factor for the success of high-performance grid applications. Reservation of lightpaths in dynamically switched optical networks facilitates guaranteed bandwidth. However, reservation of bandwidth can often lead to bandwidth fragmentation which significantly reduces system utilization and increases the blocking probability of the network. An interesting approach to mitigating this problem is to induce quasi-flexibility in the user requests. A smart scheduling strategy can then exploit this quasi-flexibility and optimize bandwidth utilization. However, there has to be an incentive for flexibility from the user's perspective as well. In this paper, we explore how the network service provider (NSP) can influence user flexibility by dynamically engineering pricing incentives. Ultimately, user flexibility will lead to efficient network utilization, reduce the price for the users, and increase the revenue for the NSP.
Web Service Recommendation Based on Client-Side Performance Estimation
Authors: Niko Thio, Shanika Karunasekera
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Quality of Service (QoS) is one of the important factors to be considered when choosing a Web Service (WS). This paper focuses on performance which is one of the most important QoS attributes. Currently WS recommendation and selection are based on the advertised server-side performance. Since WS clients reside in a heterogeneous environment, performance experienced by clients for the same WS can vary widely. Therefore, WS recommendation based on server-side performance may not be very effective. We propose a WS analysis and recommendation framework that takes into account environment heterogeneity. The analysis framework helps establish WS profiles and client profiles, which are used in the recommendation process to estimate the client-side performance and to determine the most suitable WS provider. By carrying out experiments in the real world (Internet) environment, we demonstrate the fundamental concepts related to client-side performance estimation. Some recommendation scenarios which utilize these estimation techniques are also demonstrated.
Discovering Association Patterns in Large Spatio-temporal Databases
Authors: Eric M. H. Lee, Keith C. C. Chan
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Over the past few years, a considerable number of studies have been made on market basket analysis. Market basket analysis is a useful method for discovering customer purchasing patterns by extracting association from stores' transaction databases. In many business of today, customer transactions can be made in many different geographical locations round the clock, especially after e-business have become prevalent. The traditional methods that consider only the association rules of an individual location or all locations as a whole are not suitable for such a multi-location environment. We design a novel and efficient algorithm for mining spatio-temporal association rules which have multi-level time and location granularities, in spatio-temporal databases. Experimental results have shown that our methods are efficient and we can find spatio-temporal association rules satisfactorily.
Invariance and efficiency of convex representations
Authors: Chek Beng Chua, Levent Tun&#x00e7;el
Venue: Mathematical Programming: Series A and B (2007)

We consider two notions for the representations of convex cones G-representation and lifted-G-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation. We first study the basic properties of these representations. We show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, we prove that lifted-G-representation is closed under duality when the representing cone is self-dual. We also prove that strict complementarity of a convex optimization problem in conic form is preserved under G-representations. Then we move to study efficiency measures for representations. We evaluate the representations of homogeneous convex cones based on the &#x201c;smoothness&#x201d; of the transformations mapping the central path of the representation to the central path of the represented optimization problem.
Step-by-Step Control of the Dynamics of a Superconducting QED-like System
Authors: R. Migliore, A. Messina, L. L. Sánchez-Soto
Venue: Open Systems Information Dynamics (2007)

We discuss the modus operandi of a theoretical scalable coupling scheme to control step by step the time evolution of a pair of flux qubits embedded in a lossy resonant cavity. The sequential interaction of each qubit with the quantized cavity mode is controlled by externally applied magnetic fluxes. Our analysis indicates that indirect qubit-qubit interactions, with the electromagnetic mode acting as a data bus, can be selectively performed and exploited both for the implementation of entangling gates and for the generation of states with a priori known characteristics.
Dynamic Service Deployment using an Ontologybased Description of Devices and Services
Authors: Christos Chrysoulas, Giannis Koumoutsos, Spyros Denazis, Kleanthis Thramboulidis, Odysseas Koufopavlou
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In the FlexiNET IST research project a service called Dynamic Service Deployment dynamically installs, monitors and uninstalls new services upon user demand, or by a default configuration. There was a need for a module to keep all the required information, in terms of resources, of the FlexiNET Wireless Access Node. For that purpose the Node Model was designed and implemented. The current paper describes in detail the modeling and implementation of an OWL-based Distributed Router's architecture in order to provide a formal and well defined framework to describe devices and their services, in terms of resources, to support effective service discovery and implementation. The proposed approach is trying to give a more dynamic approach to the already used Node model by adopting what the Semantic-web is offering in the area of modeling and well defining of devices. In this framework a more dynamic and reusable model is proposed in order to fulfill the various needs of a complex network architecture.
HDF: Heat diffusion fields for polyp detection in CT colonography
Authors: E. Konukoğlu, B. Acar
Venue: Signal Processing (2007)

Computer aided detection (CAD) in computed tomography colonography (CTC) aims at detecting colonic polyps that are the precursors of cancer. We propose to use heat diffusion patterns for polyp detection and identification in CTC. The underlying idea of the proposed method is to utilize the heat diffusion process, which is closely related to the diffusion filtering, to generate a vector field (HDF) that is correlated with the shape of the colon wall. The HDF and a local voxel distribution parameter were used for detection and identification. We evaluated the method on real patient CTC data acquired from eight volunteers. 100% sensitivity is achieved at 0.53 false positives per patient for polyps >=8mm and 78% sensitivity is achieved at 0.53 false positives per patient when all polyps >=5mm are considered.
Improved Remote User Authentication Scheme Preserving User Anonymity
Authors: Lanlan Hu, Yixian Yang, Xinxin Niu
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Most of smart card-based remote authentication schemes proposed didn't protect the users' identities while authenticating the users, even though user anonymity is an important issue in many e-commerce applications. In 2004, Das et al. proposed a remote authentication scheme to authenticate users while preserving the users' anonymity. Their scheme adopted dynamic identification to achieve this function. Then in 2005, Chien and Chen pointed out Das et al.'s scheme fails to protect the user's anonymity and proposed a new remote authentication scheme preserving user anonymity. This paper, however, will demonstrate that Chien and Chen's scheme has also some problems: it cannot resist strong masquerading server/user attack, insider attack, denial of service attack and restricted replay attack; it also has the problem of slow wrong password detection. Therefore, an improved scheme is proposed to conquer these problems.
Static reformulation: a user study of static hypertext for query-based reformulation
Authors: Michael Huggett, Joel Lanir
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Hypertext allows users to navigate between related materials in digital libraries. The most fundamental automated hypertexts are those constructed on the basis of semantic similarity. Such hypertexts have been evaluated by a variety of means, but seldom by real users given simulated real-world tasks. We claim that while other methods exist, one of the best ways to prove the usefulness of hypertext is to show the benefits for users performing realistic tasks. We compare the reformulation of queries that users perform in keyword searching, to the query reformulation implicit in browsing between documents linked by similarity of content. We find that a static automatically-constructed similarity hypertext provides useful linking between related items, improving the retrieval of targets when used to augment standard keyword search.
A comparison of two techniques for detecting seizure in newborn EEG data
Authors: M. Roessgen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper considers the problem of automatic classification of newborn electroencephalogram (EEG) data in order to diagnose for seizure. It is shown that good detection performance of seizure EEG is possible using a methodology based on a model for the generation of the EEG. This model is derived from the histology and biophysics of a localised portion of the brain and is thus physically motivated. The model based detection scheme is first presented and used to detect seizure in real newborn EEG data. These results are then compared with an alternative classification approach known as the quadratic detection filter (QDF). It is shown that the model based scheme is far superior to the QDF since it is not adversely affected by the variability (or non-stationarity) of EEG data, which hinders the performance of most traditional EEG classifiers (such as the QDF).
A Hybrid Policy for Job Scheduling and Load Balancing in Heterogeneous Computational Grids
Authors: Kai Lu, Albert Y. Zomaya
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

In this paper, we present a load balancing scheme that grid sites are clustered into regional grids around a set of well-known broker sites in terms of network transfer delay and the broker sites are organized in a fully decentralized fashion. Based on above scheme, we propose a hybrid policy to the job scheduling and load balancing in a computational grid which integrates static and dynamic approaches to make load distribution and redistribution driven by performance benefit jobs can gain. The hybrid policy also achieves a balance between the inherent efficiency of centralized approach, and the autonomy, load balancing and fault tolerant features offered by distributed approach. It is naturally suitable for large-scale grids. The main goal of our scheme is to improve the average response times of jobs. Our load balancing scheme is evaluated by simulations. We present some results that verify the effectiveness of our scheme.
Mining a digital library for influential authors
Authors: David Mimno, Andrew McCallum
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

When browsing a digital library of research papers, it is natural to ask which authors are most influential in a particular topic. We present a probabilistic model that ranks authors based on their influence in particular areas of scientific research. This model combines several sources of information: citation information between documents as represented by PageRank scores, authorship data gathered through automatic information extraction, and the words in paper abstracts. We compare the performance of a topic model versus a smoothed language model by assessing the number of major award winners in the resulting ranked list of researchers.