ppxscal/embedding_network huggingface dataset:
Factors influencing exemplary science teachers' levels of computer use
Authors: Meral Hakverdi
Venue:  (2005)

This study examines exemplary science teachers' use of technology in science instruction, factors influencing their level of computer use, their level of knowledge/skills in using specific computer applications for science instruction, their use of computer-related applications/tools during their instruction, and their students' use of computer applications/tools in or for their science class. After a relevant review of the literature certain variables were selected for analysis. These variables included personal self-efficacy in teaching with computers, outcome expectancy, pupil-control ideology, level of computer use, age, gender, teaching experience, personal computer use, professional computer use and science teachers' level of knowledge/skills in using specific computer applications for science instruction. The sample for this study includes middle and high school science teachers who received the Presidential Award for Excellence in Science Teaching Award (sponsored by the White House and the National Science Foundation) between the years 1997 and 2003 from all 50 states and U.S. territories. Award-winning science teachers were contacted about the survey via e-mail or letter with an enclosed return envelope. Of the 334 award-winning science teachers, usable responses were received from 92 science teachers, which made a response rate of 27.5%. Analysis of the survey responses indicated that exemplary science teachers have a variety of knowledge/skills in using computer related applications/tools. The most commonly used computer applications/tools are information retrieval via the Internet, presentation tools, online communication, digital cameras, and data collection probes. Results of the study revealed that students' use of technology in their science classroom is highly correlated with the frequency of their science teachers' use of computer applications/tools. The results of the multiple regression analysis revealed that personal self-efficacy related to the exemplary science teachers' level of computer use suggesting that computer use is dependent on perceived abilities at using computers. The teachers' use of computer-related applications/tools during class, and their personal self-efficacy, age, and gender are highly related with their level of knowledge/skills in using specific computer applications for science instruction. The teachers' level of knowledge/skills in using specific computer applications for science instruction and gender related to their use of computer-related applications/tools during class and the students' use of computer-related applications/tools in or for their science class. In conclusion, exemplary science teachers need assistance in learning and using computer-related applications/tool in their science class.
Flexible and dynamic control of network QoS in grid environments: the QoSINUS approach
Authors: P. V. B. Primet, J. Montagnat, F. Chanussot
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

Grids rely on a complex interconnection of IP domains that may exhibit changing performance characteristics and may offer different quality of service (QoS) facilities. We examine the case of a biomedical application distributed over a grid and show how it may suffer from uncontrolled communication performance. Then we present the QoSINUS service that dynamically allocates the network resources to Grid flows in order to match their specific QoS requirements under different load conditions. The aim of this approach is to optimize the end to end performances the heterogeneous mix of grid flows gets from the network to enhance the individual application's performance as the overall grid infrastructure performance and utilization level. The QoSINUS service is based on the programmable network approach that offers flexibility, evolutivity and enables dynamic adaptation to network load variations. Finally results of QoSINUS experiments conducted in the context of the eToile french grid testbed based on the high speed and DiffServ capable research network infrastructure, VTHD, are presented.
The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System
Authors: Pei-Chi Huang, Wan-Chen Lu, Chun-Nan Chou, Wei-Kuan Shih
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Real-time disk scheduling is an important research topic for time-critical multimedia applications. Some well-known research results, such as SCAN-earliest deadline first (EDF) and DM-SCAN, applied the SCAN scheme to reschedule service sequence of input tasks and reduce their service time. In this paper, we prove that the general disk-scheduling problem with linear cost-function is NP-Hard. We also propose the shortest-task-first-DM, a new real-time disk-scheduling algorithm using the concept of the shortest-task-firstand the deadline modification. As shown in the experimental results, our approach can schedule more tasks to meet their deadlines.
Resource management and QoS control in multiple traffic wireless and mobile Internet systems: Research Articles
Authors: Yong Xu, Huazhou Liu, Qing-An Zeng
Venue: Wireless Communications Mobile Computing (2005)

End-to-end quality of service (QoS) control for multiple traffic in wired networks is carried out through Differentiated services (DiffServ). Edge routers in DiffServ domain classify incoming flows into different per-hop behavior (PHB) groups and give a policy-based QoS guarantee to these behavior aggregates. As Internet extends into the wireless and mobile section, different traffic flows should be treated differently not only in wired core network, but also in wireless resource allocations. In this paper, we propose a preemptive priority handoff and adaptive resource allocation scheme. DiffServ PHB groups are mapped into different wireless and mobile QoS classes. Traffic flows are categorized into these classes in order to allow the system to allocate different bandwidth and make resource reservation according to their priorities. Higher priority traffic flows are permitted to preempt lower priority flows in service. Lower ones, on the contrary, can expand their bandwidth into areas reserved for higher priority traffic flows for better resource utilization. We use both analytical model and simulation to evaluate the system performance in terms of blocking probabilities, forced termination probabilities, and delay. The forced termination probability of high priority traffic flows can be decreased significantly by introducing the preemptive priority scheme. Therefore, this scheme can be used in wireless part of the system along with DiffServ to give further guarantee for low delay, low jitter, and low loss services to high priority services. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Instant Scene Modeler for Crime Scene Reconstruction
Authors: Stephen Se, Piotr Jasiobedzki
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Crime scene reconstruction is a labor-intensive but an essential task of police investigation. Currently, the police spend a lot of time at the crime scene taking many measurements and photos, and then spend more time at the computer recreating the crime scene drawings manually. Automatic generation of photo-realistic three-dimensional calibrated models using a hand-held device is highly desirable for crime scene reconstruction as well as for many other applications. In this paper, we present the instant Scene Modeler (iSM), a 3D imaging system that automatically creates 3D models using an off-the-shelf hand-held stereo camera. The user points the camera at a scene of interest and the system will create a photo-realistic 3D calibrated model automatically within minutes. Forensics field tests have been carried out with promising results and the advantages of 3D imaging for this application are described.
Towards an Enterprise Location Service
Authors: Christof Roduner, Christian Floerkemeier
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

Radio Frequency Identification (RFID) technology has a lot of potential to automate business processes and improve visibility across the supply chain. To realize the full potential of RFID, an IT infrastructure is required that manages readers, filters and aggregates raw RFID data, but also facilitates data exchange among the supply chain partners. In this paper we first provide an overview of the EPC Network, an architecture developed by the Auto-ID Center and its successor organisation EPCglobal, that addresses the above requirements. We then propose the concept of an Enterprise Location Service that captures all location information about products and assets within the enterprise to enable what we call business process debugging.
Resource Allocation Based on Combinatorial Auction in E-manufacturing Environment
Authors: LV Cixing, ZHU Yunlong, YIN Chaowan
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

To solve the problem of resource allocation in the emanufacturing environment, combinatorial auction based negotiation policy was proposed in an internetbased multi-agent system. With the formulation of the allocation problem and that of the combinatorial auction solution, the design and the procedure of the combinatorial auction are given. Then, distributed rules saved in the rule base in corresponding agents are adopted to describe and construct the negotiation policy to realize the combinatorial auction. The final part of the paper gives numerical testing to demonstrate the policy to be feasible and efficient.
A Decentralized Strategy for Resource Allocation
Authors: Antonella Di Stefano, Corrado Santoro
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper presents a new approach for resource allocation in a grid based on "spatial computing" concepts. We model a grid using a flat architecture consisting of nodes connected by an overlay network. The 2D spatial distribution of the nodes of the grid, together with the quantity of resource available in each node, forms a 3D surface, where valleys correspond to nodes with a large quantity of available resource. We propose an algorithm for resource allocation that is based on surfing such a 3D surface, in search for the deepest valley (global minimum). The algorithm, which aims at fairly distributing among nodes the quantity of leased resource, is based on some heuristics that mimic the laws of kinematics. Experimental results show the effectiveness of the algorithm.
Product Specific Security Features Based on RFID Technology
Authors: Zoltan Nochta, Thorsten Staake, Elgar Fleisch
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

In today's business, there is a growing problem of product counterfeiting and piracy. Criminals have considerable expertise and resources that enable them to produce and sell counterfeits of products. The proposed solution aims at providing unique and secure authentication mechanisms of a given item, in order to distinguish between genuine products and counterfeits. As underlying technology, the approach utilizes RFID technology: Transponders hold unique and cryptographically secured data that uniquely binds a given product to a given tag, and thus makes duplication or re-application of tags difficult.
Analysis on packet resequencing for reliable network protocols
Authors: Ye Xia, David Tse
Venue: Performance Evaluation (2005)

Packets are sometimes disordered in the network. Reliable protocols such as TCP require packets to be accepted, i.e., delivered to the receiving application, in the order they are transmitted at the sender. In order to do so, the receiver's transport layer must resequence the packets with the help of a resequencing buffer. Even if the application can consume the packets infinitely fast, the packets may still be delayed for resequencing. In this paper, we model packet disordering by adding an independently and identically distributed (IID) random propagation delay to each packet and analyze the required buffer size for packet resequencing and the resequencing delay for an average packet. We demonstrate that these two quantities can be significant and show how they scale with the network bandwidth.
Massively Parallel Hardware Architecture for Genetic Algorithms
Authors: Nadia Nedjah, Luiza de Macedo Mourelle
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this paper, we propose a massively parallel architecture for hardware implementation of genetic algorithms. This is design is quite innovative as it provides a viable solution to the fitness computation problem, which depends heavily on the problem-specific knowledge. The proposed architecture is completely independent of such specifics. It implements the fitness computation using a neural network. The hardware implementation of the used neural network is stochastic and thus minimise the required hardware area without much increase in response time. Finally, we compare the proposed hardware and existing ones.
A naive genetic approach for non-stationary constrained problems
Authors: K. Basu, K. Bhatia
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

An algorithm to be effective for solving non-stationary problems should be robust, adaptive to the changing environment and efficient. Genetic algorithms (GAs) are increasingly being used to solve non-stationary problems. We use GA with a new approach of gene induction (Bhatia and Basu in Soft Comput 8(1):1&#x2013;9, 2003) to solve non-stationary constrained problems. The approach combines high value genes to form chromosomes from the initial population itself. The efficacy of the method is demonstrated on non-stationary versions of 0/1 knapsack and pure-integer programming problems. The results obtained with the approach are compared with those obtained with feedback thermodynamical genetic algorithm (FTDGA) (Mori et al. in 5th parallel problem solving from nature, number 1498 in LNCS, pp 149&#x2013;157, 1998). It shows that gene-induction approach is more accurate and requires less time compared to the FTDGA.
An optimization problem in adaptive virtual environments
Authors: Ananth I. Sundararaj, Manan Sanghi, John R. Lange, Peter A. Dinda
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

A virtual execution environment consisting of virtual machines (VMs) interconnected with virtual networks provides opportunities to dynamically optimize, at run-time, the performance of existing, unmodified distributed applications without any user or programmer intervention. Along with resource monitoring and inference and application-independent adaptation mechanisms, efficient adaptation algorithms are key to the success of such an effort. In previous work we have described our measurement and inference framework, explained our adaptation mechanisms, and proposed simple heuristics as adaptation algorithms. Though we were successful in improving performance as compared to the case with no adaptation, none of our algorithms were characterized by theoretically proven bounds. In this paper, we formalize the adaptation problem, show that it is NP-hard and propose research directions for coming up with an efficient solution.
Session Editorial: Computer Infrastructure for Systems Biology
Authors: Jake Y. Chen, Bradley K. Sherman
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Computer Infrastructure for Systems Biology is the first international conference session dedicated to systems biology informatics held at the 18th International Conference on Systems Engineering. Our goal is to bring forth ideas and collaborations among industrial and academic bioinformaticians, biocomputing professionals, data analysts, and system biologists to facilitate systems biology research and findings. The compilation of twelve full session papers and four poster papers at this meeting represents a snapshot of emerging research and development trends in systems biology informatics.
Review of "An Anatomy of Risk, by William D. Rowe", John Wiley & Sons, 1977
Venue: ACM SIGSIM Simulation Digest (1979)

An increasing number of models and simulation runs are appearing in the environmental field. Although many simulation specialists are fully aware of the modeling tools and computer techniques, this volume sheds another light on the work they are doing. There is an increasing awareness of the hazards imposed by technology on the safety, health and environmental quality of the world in which we live. 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
The Geometric Dilation of Finite Point Sets
Authors: Annette Ebbers-Baumann, Ansgar Grune, Rolf Klein
Venue: Algorithmica (2006)

Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set, we would like to know the smallest possible dilation of any graph that contains the given points. In this paper we prove that a dilation of 1.678 is always sufficient, and that &#x03c0;/2 = 1.570... is sometimes necessary in order to accommodate a finite set of points.
Geometrical integration of Landau-Lifshitz-Gilbert equation based on the mid-point rule
Authors: Massimiliano d'Aquino, Claudio Serpico, Giovanni Miano
Venue: Journal of Computational Physics (2005)

Landau-Lifshitz-Gilbert (LLG) equation is the fundamental equation to describe magnetization vector field dynamics in microscale and nanoscale magnetic systems. This equation is highly nonlinear in nature and, for this reason, it is generally solved by using numerical techniques. In this paper, the mid-point rule time-stepping technique is applied to the numerical time integration of LLG equation and the relevant properties of the numerical scheme are discussed. The mid-point rule is an unconditionally stable and second order accurate scheme which preserves the fundamental geometrical properties of LLG dynamics. First, it exactly preserves the LLG property of conserving the magnetization magnitude at each spatial location. Second, for constant in time applied fields, it preserves the LLG Lyapunov structure, namely the fact that the free energy is a decreasing function of time. In addition, in the case of zero damping, the mid-point rule preserves the conservation of the system free energy. The above preservation properties are unconditionally valid, i.e. they are fulfilled for any value of the time-step. Finally, the LLG hamiltonian structure in the case of zero damping is preserved up to the third order terms with respect to the time-step. The main difficulty related to this scheme is the necessity of solving a large system of globally coupled nonlinear equations. This problem has been circumvented by using special and reasonably fast quasi-Newton iterative technique. The proposed numerical scheme is then tested on the standard micromagnetic problem no. 4. In the numerical computations, the spatial discretization is obtained by finite difference technique and the magnetostatic field is computed through the Fast Fourier Transform method.
Effectively Maintaining Multiple View Consistency in Web Warehouses
Authors: Yan Zhang, Xiangdong Qin
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

To make a web warehouse reflect the real web accurately, we should keep timeliness, freshness and consistency for the webviews. This paper fouses on one important part of webview maintenance - mutual consistency between webviews, which is formally named as multiple webview consistency (abbreviated as MVC). Although the same problem has been well studied in a traditional data warehouse, however, it has never been considered for a web warehouse. Since data sources in a web warehousing environment do not propagate base data changes to the information consumers, which is different from the case in the traditional data warehouses, it is not feasible to keep complete mutal consistency between the webviews in web warehouses. In this paper we introduce the Interrelated-MVC, a new term based on the features of the web environment. We show that it is enough to keep Interrelated-MVC in web warehouses. After that we present the algorithms which guarantee Interrelated-MVC and are scaleable to the vertiginous real web.
Online learning over graphs
Authors: Mark Herbster, Massimiliano Pontil, Lisa Wainer
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simple algorithms and performance guarantees that we naturally interpret in terms of structural properties of the graph, such as the algebraic connectivity or the diameter of the graph. We also discuss how these methods can be modified to allow active learning on a graph. We present preliminary experiments with encouraging results.
Generalized Dimension-Reduction Framework for Recent-Biased Time Series Analysis
Authors: Yanchang Zhao Shichao Zhang
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Recent-biased approximations have received increased attention recently as a mechanism for learning trend patterns from time series or data streams. They have shown promise for clustering time series and incrementally pattern maintaining. In this paper, we design a generalized dimension-reduction framework for recent-biased approximations, aiming at making traditional dimension-reduction techniques actionable in recent-biased time series analysis. The framework is designed in two ways: equi-segmented scheme and vari-segmented scheme. In both schemes, time series data are first partitioned into segments and a dimension-reduction technique is applied to each segment. Then, more coefficients are kept for more recent data while fewer kept for older data. Thus, more details are preserved for recent data and fewer coefficients are kept for the whole time series, which improves the efficiency greatly. We experimentally evaluate the proposed approach, and demonstrate that traditional dimension-reduction techniques, such as SVD, DFT, DWT, PIP, PAA, and landmarks, can be embedded into our framework for recent-biased approximations over streaming time series.
Mobile Adaptive CALL (MAC): A case-study in developing a mobile learning application for speech/audio language training
Authors: Maria Uther, Iraide Zipitria, Pushpendra Singh, James Uther
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper, we present a case-study on developing an adaptive computer assisted language learning software built for mobile devices. Our application, called Mobile Adaptive CALL (MAC) is aimed at helping Japanese-English speakers in perceptually distinguishing the non-native /r/ vs. /l/ English phonemic contrast with a view to improving their discrimination. The software is adaptive and more practice is given for the learner on contrasts that are most difficult for them, and learners may choose their preferred level of difficulty. MAC is implemented in Java (J2ME), allowing the software to be used on a wide range of mobile devices including most recent mobile phones. In our case-study, we give an overview of the software, results from initial user studies and suggest some considerations for designing and implementing mobile learning applications for speech/audio language training.