ppxscal/embedding_network huggingface dataset:
Noteblogging: taking note taking public
Authors: Beth Simon, Krista Davis, William G. Griswold, Michael Kelly, Roshni Malani
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Classroom note taking tends to be a private activity, hiding a wealth of knowledge in both content and method. With the advent of the web, whose technology and culture seemingly invites everyone to share everything, we are prompted to ask how making note taking a public activity -- noteblogging -- might advance learning. What does a blog about a computer science classroom look like? What supports are needed to enable noteblogging as a form of auxiliary instruction? In this paper we overview the design and use of noteblogging as part of the Ubiquitous Presenter digital classroom system. With NoteBlogger, students with Tablet PCs take handwritten notes digitally on top of the instructor's slides, and their notes are instantly reviewable by other students in class using a web browser. We examine the impact of noteblogging on a CS1 course through interviews with bloggers (to reveal their motivation and understand their choice of content) and blog watchers (to learn when and why they watch). We also analyze the blogs in this CS1 course to identify their educational contribution. We find that noteblogging enables a unique classroom participation model that specifically engages more advanced students. Blog content spans many levels of intellectual engagement, which can support a range of learners in CS1 as well as perhaps model for them various levels of reflection.
On the diameter of i-center in a graph without long induced paths
Authors: Jinquan Dong
Venue: Journal of Graph Theory (1999)

A graph G is said to be Pt-free if it does not contain an induced path on t vertices. The i-center Ci(G) of a connected graph G is the set of vertices whose distance from any vertex in G is at most i. Denote by I(t) the set of natural numbers i, &lfloor;t-2&rfloor; &le; i &le; t - 2, with the property that, in every connected Pt-free graph G, the i-center Ci(G) of G induces a connected subgraph of G. In this article, the sharp upper bound on the diameter of G[Ci(G)] is established for every i &isin; I(t). The sharp lower bound on I(t) is obtained consequently. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 235&ndash;241, 1999
A power and temperature aware DRAM architecture
Authors: Song Liu, Seda Ogrenci Memik, Yu Zhang, Gokhan Memik
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Technological advances enable modern processors to utilize increasingly larger DRAMs with rising access frequencies. This is leading to high power consumption and operating temperature in DRAM chips. As a result, temperature management has become a real and pressing issue in high performance DRAM systems. Traditional low power techniques are not suitable for high performance DRAM systems with high bandwidth. In this paper, we propose and evaluate a customized DRAM low power technique based on Page Hit Aware Write Buffer (PHA-WB). Our proposed approach reduces DRAM system power consumption and temperature without any performance penalty. Our experiments show that a system with a 64-entry PHA-WB could reduce the total DRAM power consumption by up to 22.0% (9.6% on average). The peak and average temperature reductions are 6.1&deg;C and 2.1&deg;C, respectively.
The integral equation approach to kinematic dynamo theory and its application to dynamo experiments in cylindrical geometry
Authors: M. Xu, F. Stefani, G. Gerbeth
Venue: Journal of Computational Physics (2008)

The conventional magnetic induction equation that governs hydromagnetic dynamo action is transformed into an equivalent integral equation system. An advantage of this approach is that the computational domain is restricted to the region occupied by the electrically conducting fluid and to its boundary. This integral equation approach is first employed to simulate kinematic dynamos excited by Beltrami-like flows in a finite cylinder. The impact of externally added layers around the cylinder on the onset of dynamo actions is investigated. Then it is applied to simulate dynamo experiments within cylindrical geometry including the ''von Karman sodium'' (VKS) experiment and the Riga dynamo experiment. A modified version of this approach is utilized to investigate magnetic induction effects under the influence of externally applied magnetic fields which is also important to measure the proximity of a given dynamo facility to the self-excitation threshold.
A New Method to Improve the Gradient Based Search Direction to Enhance the Computational Efficiency of Back Propagation Based Neural Network Algorithms
Authors: Nazri Mohd Nawi, Rajesh S. Ransing, Meghana R. Ransing
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Neural-network techniques, particularly backpropagation algorithms, have been widely used as a tool for discovering a mapping function between a known set of input and output examples. Neural networks learn from the known example set by adjusting its internal parameters, referred to as weights, using an optimisation procedure based on the ‘least square fit principle’. The optimisation procedure normally involves thousands of iterations to converge to an acceptable solution. Hence, improving the computational efficiency of a neural networkalgorithm is an active area of research. It has been shown in the existing literature that the variation of the gain parameter improves the learning efficiency of the gradient-descent method. However, it can be concluded from previous researchers’ claims that the adaptive-gain variation improved the learning rate and hence the efficiency. It was discovered in this research that the gain variation has no influence on the learning rate; however, it actually influences the search direction. A novel technique of integrating the adaptive-learning rate method coupled with an improved search direction for improving the computational efficiency of neural networks is presented. The new approach had shown that this modification can significantly enhance the computational efficiency of training process.
You Are Your Cell Phone
Authors: Roy Want
Venue: IEEE Pervasive Computing (2008)

Learn how your mobile device is becoming a proxy for you and your activities, improving your effectiveness while on the go.
A data placement service for petascale applications
Authors: Ann L. Chervenak, Robert Schuler
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

We examine the use of policy-driven data placement services to improve the performance of data-intensive, petascale applications in high performance distributed computing environments. In particular, we are interested in using an asynchronous data placement service to stage data in and out of application workflows efficiently as well as to distribute and replicate data according to Virtual Organization policies. We propose a data placement service architecture and describe our implementation of one layer of this architecture, which provides efficient, priority-based bulk data transfers.
Case-based myopic reinforcement learning for satisfying target service level in supply chain
Authors: Ick-Hyun Kwon, Chang Ouk Kim, Jin Jun, Jung Hoon Lee
Venue: Expert Systems with Applications: An International Journal (2008)

In the last decade, driven by global competition in the marketplace, many companies have taken initiatives to revamp their supply chains in order to increase responsiveness to changes in the marketplace. The renovation of inventory control system is central to such an effort. However, experiences in industry have shown that the control of inventory in supply chain is not an easy task because of uncertainties inherent in customer demand. In this paper, we propose a reinforcement learning algorithm appropriate for the nonstationary inventory control problem of supply chain that has a large state space. Traditional reinforcement learning algorithms such as learning automata and Q-learning have the difficulty of slow convergence when applied to the situations with large state spaces. To resolve the problems of nonstationary customer demand and large state space, we develop a case-based myopic reinforcement learning (CMRL) algorithm. A simulation-based experiment was performed to show good performance of CMRL.
Effective learn-quiz generation for handheld devices
Authors: Wolfgang Hürst, Sabine Jung, Martina Welte
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this demonstration, we present a system that enables users to easily generate quizzes for mobile devices. With our program, they can create multiple choice tests and general question-answer pairs by just entering (or copy-pasting) text into an input mask. The text is automatically processed and formatted and corresponding images or text notes are created for representation on an Apple iPod.
A novel approach for assigning wavelengths in multihop WDM optical networks
Authors: Sahadeb Jana, Debashis Saha, Amitava Mukherjee, Pranay Chaudhuri
Venue: Computer Communications (2008)

This paper presents a new algorithm for effectively assigning wavelengths to ligthpaths in a multihop wavelength division multiplexed (WDM) optical network, wherein the physical medium consists of optical fiber segments interconnected by wavelength selective optical switches. WDM permits a limited number of wavelengths to be re-used among various fiber links, thereby offering a very high aggregate capacity. For a given network, we first construct its auxiliary graph and then formulate wavelength assignment as a graph coloring problem on the auxiliary graph. However, we do not follow the conventional two-step procedure, unlike most of the existing techniques. While generating the auxiliary graph from the given physical topology and the given set of ligthpath requests, simultaneously we apply a dynamic coloring technique to assign colors (i.e., wavelengths) to nodes (i.e., lightpaths) on the fly. The number of colors needed at the end of the algorithm represents the number of wavelengths required for the network. The algorithm is proven to be correct, and its complexity is analyzed. The performance of the algorithm is tested on several networks for various lightpath demands through extensive simulations. The coloring scheme, blocking performance and timing efficiencies are studied and compared with the existing best-known wavelength assignment heuristics. It is found that, for a wide range of network sizes and lightpath requests, the proposed algorithm performs equally well, when compared with the existing ones.
It's easy to produce chartjunk using Microsoft®Excel 2007 but hard to make good graphs
Authors: Yu-Sung Su
Venue: Computational Statistics Data Analysis (2008)

The purpose of default settings in a graphic tool is to make it easy to produce good graphics that accord with the principles of statistical graphics, e.g., [Tufte, E.R., 1990. Envisioning Information. Graphics Press, Cheshire, Conn, Tufte, E.R., 1997. Visual Explanations: Images and Quantities, Evidence and Narrative, 2nd Edition. Graphics Press, Cheshire, Conn, Cleveland, W.S., 1993. Visualizing Data. Hobart Press, N.J Cleveland, W.S., 1994. The Elements of Graphing Data, rev. edition. AT&T Bell Laboratories, Murray Hill, N.J, Wainer, H., 1997. Visual revelations: Graphical tales of fate and deception from Napoleon to Ross Perot. Copernicus, New York, Spence, R., 2001. Information Visualization. ACM Press & AddisonWesley, New York, and Few, S., 2004. Show Me the Numbers. Analytic Press, Hillsdale, NJ]. If the defaults do not embody these principles, then the only way to produce good graphics is to be sufficiently familiar with the principles of statistical graphics. This paper shows that Excel graphics defaults do not embody the appropriate principles. Users who want to use Excel are advised to know the principles of good graphics well enough so that they can choose the appropriate options to override the defaults. Microsoft^(R) should overhaul the Excel graphics engine so that its defaults embody the principles of statistical graphics and make it easy for non-experts to produce good graphs.
Distributed Wireless Links Repair for Maximizing Reliability and Utilization in Multicast MANET
Authors: Ben-Jye Chang, Yan-Min Lin, Ying-Hsin Liang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

For achieving multicast routing in self-organizing wireless on demand networks, the Multicast Ad hoc On-Demand Distance Vector (MAODV) routing protocol is proposed. In MAODV, a multicast tree is created when a sender wants to send packets to several receivers in Mobile Ad hoc Networks (MANETs). In such ad hoc networks, wireless links may be lost occasionally due to mobile nodes on the multicast tree that are unreachable, which causes broken branches, low network reliability, and low packet delivery rate. For overcoming the problem, MAODV provides a simple local repair mechanism that tries to find an alternative route to a tree by broadcasting the RREQ message from the downstream nodes of the broken link, but results in extensive control messages and obvious low successful repair rate. Therefore, in this paper we propose a unicast-type multihop local repair protocol in multicasting MANET to recover lost links efficiently while increasing network reliability, minimizing the number of control messages, and reducing repair delay. Meanwhile, the optimal number of hops of neighbor table is also analyzed. Numerical results demonstrate that the proposed multihop local repair approach outperforms other repair approaches in successful repair rate and control message overhead.
A Mobile-Device-Supported Brain-Friendly Reading System
Authors: Yu-Ju Lan, Yao-Ting Sung, Kuo-En Chang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

The purposes of this study were to implement a brain-friendly learning environment for EFL early reading by a mobile-device-supported computer assisted reciprocal early English reading (CAREER) system and evaluate its effect upon elementary EFL learners’ early reading skills. Results appeared that the students were benefited by collaborating with each other with the support of CAREER.
So-Grid: A self-organizing Grid featuring bio-inspired algorithms
Authors: Agostino Forestiero, Carlo Mastroianni, Giandomenico Spezzano
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2008)

This article presents So-Grid, a set of bio-inspired algorithms tailored to the decentralized construction of a Grid information system that features adaptive and self-organization characteristics. Such algorithms exploit the properties of swarm systems, in which a number of entities/agents perform simple operations at the local level, but together engender an advanced form of swarm intelligence at the global level. In particular, So-Grid provides two main functionalities: logical reorganization of resources, inspired by the behavior of some species of ants and termites that move and collect items within their environment, and resource discovery, inspired by the mechanisms through which ants searching for food sources are able to follow the pheromone traces left by other ants. These functionalities are correlated, since an intelligent dissemination can facilitate discovery. In the Grid environment, a number of ant-like agents autonomously travel the Grid through P2P interconnections and use biased probability functions to: (i) replicate resource descriptors in order to favor resource discovery; (ii) collect resource descriptors with similar characteristics in nearby Grid hosts; (iii) foster the dissemination of descriptors corresponding to fresh (recently updated) resources and to resources having high quality of service (QoS) characteristics. Simulation analysis shows that the So-Grid replication algorithm is capable of reducing the entropy of the system and efficiently disseminating content. Moreover, as descriptors are progressively reorganized and replicated, the So-Grid discovery algorithm allows users to reach Grid hosts that store information about a larger number of useful resources in a shorter amount of time. The proposed approach features characteristics, including self-organization, scalability and adaptivity, which make it useful for a dynamic and partially unreliable distributed system.
SP-NUCA: a cost effective dynamic non-uniform cache architecture
Authors: Javier Merino, Valentín Puente, Pablo Prieto, José Ángel Gregorio
Venue: ACM SIGARCH Computer Architecture News (2008)

This paper presents a simple but effective method to reduce on-chip access latency and improve core isolation in CMP Non-Uniform Cache Architectures (NUCA). The paper introduces a feasible way to allocate cache blocks according to the access pattern. Each L2 bank is dynamically partitioned at set level in private and shared content. Simply by adjusting the replacement algorithm, we can place private data closer to its owner processor. In contrast, independently of the accessing processor, shared data is always placed in the same position. This approach is capable of reducing on-chip latency without significantly sacrificing hit rates or increasing implementation cost of a conventional static NUCA. Additionally, most of the unnecessary interference between cores in private accesses is removed. To support the architectural decisions adopted and provide a comparative study, a comprehensive evaluation framework is employed. The workbench is composed of a full system simulator, and a representative set of multithreaded and multiprogrammed workloads. With this infrastructure, different alternatives for the coherence protocol, replacement policies, and cache utilization are analyzed to find the optimal proposal. We conclude that the cost for a feasible implementation should be closer to a conventional static NUCA, and significantly less than a dynamic NUCA. Finally, a comparison with static and dynamic NUCA is presented. The simulation results suggest that on average the mechanism proposed could improve system performance of a static NUCA and idealized dynamic NUCA by 16% and 6% respectively.
Resource allocation neural network in portfolio selection
Authors: Po-Chang Ko, Ping-Chen Lin
Venue: Expert Systems with Applications: An International Journal (2008)

Portfolio selection is a resource allocation problem in a finance market. The investor's asset optimization requires the distribution of a set of capital (resources) among a set of entities (assets) with the trade-off between risk and return. The ANN with nonlinear capability is proven to solve a large-scale complex problem effectively. It is suitable to solve NP-hard resource allocation problem. However, the traditional ANN model cannot guarantee the summation of produced investment weight always preserves 100% in output layer. This article introduces a resource allocation neural network model to optimize investment weight of portfolio. This model will dynamically adjust the investment weight as a basis of 100% of summing all of asset weights in the portfolio. The experimental results demonstrate the feasibility of optimal investment weights and superiority of ROI of buy-and-hold trading strategy compared with benchmark Taiwan Stock Exchange (TSE).
An Ontological Approach to Secure MANET Management
Authors: Mark E. Orwat, Timothy E. Levin, Cynthia E. Irvine
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Mobile Ad hoc Networks (MANETs) rely on dynamic configuration decisions to efficiently operate in a rapidly changing environment of limited resources. The ability of a MANET to make decisions that accurately reflect the real environment depends on the quality of the input to those decisions. However, collecting and processing of the multitudinous factors related to the operation of a MANET is a significant challenge. Equally significant in current approaches to dynamic MANET management is the lack of consideration given to security factors. We show how our ontology of MANET attributes including device security and performance characteristics can be leveraged to efficiently and effectively make dynamic configuration decisions for managing a MANET.
Lie methods for color robot vision
Authors: Reiner Lenz
Venue: Robotica (2008)

We describe how Lie-theoretical methods can be used to analyze color related problems in machine vision. The basic observation is that the nonnegative nature of spectral color signals restricts these functions to be members of a limited, conical section of the larger Hilbert space of square-integrable functions. From this observation, we conclude that the space of color signals can be equipped with a coordinate system consisting of a half-axis and a unit ball with the Lorentz groups as natural transformation group. We introduce the theory of the Lorentz group SU(1, 1) as a natural tool for analyzing color image processing problems and derive some descriptions and algorithms that are useful in the investigation of dynamical color changes. We illustrate the usage of these results by describing how to compress, interpolate, extrapolate, and compensate image sequences generated by dynamical color changes.
Design and Implementation of Embedded Multimedia Surveillance System
Authors: Yan Liu, Ren-Fa Li, Cheng Xu, Fei Yu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Due to the thrive of networking multimedia, artificial intelligence and embedded system, video surveillance system is evolved from computer-based to embedded-based. This paper presents an intelligent multimedia surveillance system based on embedded video server. Design and implementation issues of this surveillance system are discussed including system architecture, hardware design and software framework. Moreover, practical applications show that our framework can suitable for commercial applications.
Inference rules for proving the equivalence of recursive procedures
Authors: Benny Godlin, Ofer Strichman
Venue: Acta Informatica (2008)

Inspired by Hoare&#x2019;s rule for recursive procedures, we present three proof rules for the equivalence between recursive programs. The first rule can be used for proving partial equivalence of programs; the second can be used for proving their mutual termination; the third rule can be used for proving the equivalence of reactive programs. There are various applications to such rules, such as proving equivalence of programs after refactoring and proving backward compatibility.
Extracting structural information from bug reports
Authors: Nicolas Bettenburg, Rahul Premraj, Thomas Zimmermann, Sunghun Kim
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

In software engineering experiments, the description of bug reports is typically treated as natural language text, although it often contains stack traces, source code, and patches. Neglecting such structural elements is a loss of valuable information; structure usually leads to a better performance of machine learning approaches. In this paper, we present a tool called infoZilla that detects structural elements from bug reports with near perfect accuracy and allows us to extract them. We anticipate that infoZilla can be used to leverage data from bug reports at a different granularity level that can facilitate interesting research in the future.