ppxscal/embedding_network huggingface dataset:
Fostering scientific habits of mind in the context of online play
Authors: Constance Steinkuehler, Marjee Chmiel
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In today's increasingly "flat" world of globalization, the need for a scientifically literate citizenry has only grown more urgent; yet, by some measures, we have done a poor job at fostering the right scientific habits of mind in schools. Recent research on informal games-based learning indicates that such technologies/communities may be one viable alternative -- not to teachers and classrooms but to textbooks and science labs. In this paper, we provide empirical evidence substantiating previous claims about the potential of games for learning and offer specific design heuristics that might inform their future production and use. Using codes based on AAAS benchmarks and Chinn and Malhotra's (2002) framework for evaluating inquiry tasks, we examine the scientific habits of mind that characterize online discussion forums of the MMOG World of Warcraft and the features of the game -- both as designed object and emergent culture -- that appear to foster them.
Exact simulation of option greeks under stochastic volatility and jump diffusion models
Authors: Mark Broadie, Özgür Kaya
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper derives Monte Carlo simulation estimators to compute option price derivatives, i.e., the 'Greeks,' under Heston's stochastic volatility model and some variants of it which include jumps in the price and variance processes. We use pathwise and likelihood ratio approaches together with the exact simulation method of Broadie and Kaya (2004) to generate unbiased estimates of option price derivatives in these models. By appropriately conditioning on the path generated by the variance and jump processes, the evolution of the stock price can be represented as a series of lognormal random variables. This makes it possible to extend previously known results from the Black-Scholes setting to the computation of Greeks for more complex models. We give simulation estimators and numerical results for some path-dependent and path-independent options.
Closed natural splines: an effective solution
Authors: G. Koloskov
Venue: Applied Mathematics and Computation (2006)

An algorithm for construction closed curvature-continuous splines (named as closed natural splines or CN-splines) based on cubic Bézier representation along with supporting FUZ-ZUI Theorem, which provides an effective solution for the inversion of FUZ-ZU--a special case of almost three-diagonal circulant matrix--in explicit form, is presented. Characteristics of FUZ-ZUI matrices examined; exponentially relaxing oscillations for single point disturbance of CN-spline demonstrated.
The interplay between self-directed learning and social interactions: collaborative knowledge building in online problem-based discussions
Authors: Silvia Wen-Yu Lee
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper illustrates collaborative knowledge building through problem-based learning (PBL) in online threaded discussions. PBL has been one of the most popular instructional approaches in health education. However, few qualitative studies described the essential aspects of the PBL learning processes, such as self-directed learning, and its impact on the building of professional knowledge. Therefore, this study illuminates students' ability to select, evaluate and make use of learning resources, a form of self-directed learning, embedded in a social context. This study aimed to 1) reveal different kinds of resources acquired and presented by students during discussions and to 2) describe patterns of knowledge building that emerged from integration of the above learning resources and consequently led to professional knowledge building. Using qualitative research methods, I analyzed 751 text messages from a distance learning class. The results revealed seven kinds of commonly used resources in the discussion. Results also show knowledge building occurred through the process of 1) enriching conceptual understanding, 2) connecting textbook information and personal experiences, and 3) comparing theories and practical approaches.
Home network: road to ubiquitous world
Authors: In Ryu
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Home Network is considered to be a stepping stone for ubiquitous world. The current home network solution in Korea is highly focused on delivering security, home control, and remote management to high-rise multi-dwelling units. Initial deployment case shows that individual users are fairly satisfied with the current solution sets but still looking for high-end entertainment solution as well. In this talk, we will cover the current status of LG HomNet, LG Electronics' home network solution, deployment cases, and future roadmap.
Visual 3D Querying of Spatio-Temporal Data
Authors: Olga Sourina
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

Visual interfaces are very important for human interactions in Cyberworlds. Visual querying should be one of the basic tools for data mining and retrieval in Cyberworlds. In this paper, function-based modeling of spatio-temporal range queries is described. It allows for creating an intuitive visual interface using 2D projection of 3D query shapes. The proposed approach combines visualization of time-dependent data with visualization of the range query formulation employing very compact function-based query model. It is also shown that the proposed geometric model makes constructing the queries on spatio-temporal attributes more intuitive, and allows for posing temporal range queries of any shape.
Detecting Duplications in Sequence Diagrams Based on Suffix Trees
Authors: Hui Liu, Zhiyi Ma, Lu Zhang, Weizhong Shao
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

With the popularity of UML and MDA, models are re- placing source code as core artifacts of software devel- opment and maintenance. But duplications in models re- duce models' maintainability and reusability. To address the problem, we should detect duplications first. As an ini- tial step to address the problem, we propose an approach to detect duplications in sequence diagrams. With special pre- processing, we convert 2-dimensional sequence diagrams into a 1-dimensional array. Then we construct a suffix tree of the array. We revise the traditional construction algo- rithm of suffix trees by proposing a special algorithm to detect common prefixes of suffixes. The algorithm ensures that every duplication detected with the suffix tree can be extracted into a separate reusable sequence diagram. With the suffix tree, duplications are found as refactoring candi- dates. With tool support, the proposed approach has been applied to real industrial projects, and the evaluation re- sults suggest that the approach is effective.
Mechanisms of Moving the Mind's Eye: Planning and Execution of Spatial Shifts of Attention
Authors: Chad J. Hazlett, Marty G. Woldorff
Venue: Journal of Cognitive Neuroscience (2004)

The usefulness of attentional orienting, both in the real world and in the laboratory, depends not only on the ability to attend to objects or other inputs but also on the ability to shift attention between them. Although understanding the basic characteristics of these shifts is a critical step toward understanding the brain mechanisms that produce them, the literature remains unresolved on a very basic and potentially revealing characteristic of these shifts&mdash;namely, whether attention takes longer to shift a farther distance across the visual field. We addressed this question using a series of behavioral tasks involving the voluntary orienting of attention to locations in the visual field. The findings support a model in which attentional shifts include separate ''planning'' and ''execution'' stages and in which only the planning stage requires more time for shifts of a greater distance. These results offer resolution to the longstanding debate concerning the effect of attentional shift distance on shift time and provide insight into the fundamental mechanisms of attentional shifting.
P3C: A Robust Projected Clustering Algorithm
Authors: Gabriela Moise, Jorg Sander, Martin Ester
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Projected clustering has emerged as a possible solution to the challenges associated with clustering in high dimensional data. A projected cluster is a subset of points together with a subset of attributes, such that the cluster points project onto a small range of values in each of these attributes, and are uniformly distributed in the remaining attributes. Existing algorithms for projected clustering rely on parameters whose appropriate values are difficult to set by the user, or are unable to identify projected clusters with few relevant attributes. In this paper, we present a robust algorithm for projected clustering that can effectively discover projected clusters in the data while minimizing the number of parameters required as input. In contrast to all previous approaches, our algorithm can discover, under very general conditions, the true number of projected clusters. We show through an extensive experimental evaluation that our algorithm: (1) significantly outperforms existing algorithms for projected clustering in terms of accuracy; (2) is effective in detecting very low-dimensional projected clusters embedded in high dimensional spaces; (3) is effective in detecting clusters with varying orientation in their relevant subspaces; (4) is scalable with respect to large data sets and high number of dimensions.
Evolution of spiking neural circuits in autonomous mobile robots: Research Articles
Authors: Dario Floreano, Yann Epars, Jean-Christophe Zufferey, Claudio Mattiussi
Venue: International Journal of Intelligent Systems (2006)

We describe evolution of spiking neural architectures to control navigation of autonomous mobile robots. Experimental results with simple fitness functions indicate that evolution can rapidly generate spiking circuits capable of navigating in textured environments with simple genetic representations that encode only the presence or absence of synaptic connections. Building on those results, we then describe a low-level implementation of evolutionary spiking circuits in tiny microcontrollers that capitalizes on compact genetic encoding and digital aspects of spiking neurons. The implementation is validated on a sugar-cube robot capable of developing functional spiking circuits for collision-free navigation. &copy; 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 1005&ndash;1024, 2006.
Introduction to Software Product Lines
Authors: Patrick Donohoe
Venue: Proceedings of the 10th International on Software Product Line Conference (2006)

This tutorial introduces the essential activities and underlying practice areas of software product line development. It reviews the basic concepts of software product lines, discusses the costs and benefits of product line adoption, introduces the SEI's Framework for Software Product Line Practice, and describes approaches to applying the practices of the framework.
Single-pass online learning: performance, voting schemes and online feature selection
Authors: Vitor R. Carvalho, William W. Cohen
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such as perceptron or Winnow are naturally suited to stream processing; however, in practice multiple passes over the same training data are required to achieve accuracy comparable to state-of-the-art batch learners. In the current work we address the problem of training an on-line learner with a single passover the data. We evaluate several existing methods, and also propose a new modification of Margin Balanced Winnow, which has performance comparable to linear SVM. We also explore the effect of averaging, a.k.a. voting, on online learning. Finally, we describe how the new Modified Margin Balanced Winnow algorithm can be naturally adapted to perform feature selection. This scheme performs comparably to widely-used batch feature selection methods like information gain or Chi-square, with the advantage of being able to select features on-the-fly. Taken together, these techniques allow single-pass online learning to be competitive with batch techniques, and still maintain the advantages of on-line learning.
A new approach to multi-pass scheduling in shop floor control
Authors: Taejong Yoo, Daehong Kim, Hyunbo Cho
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Real-time planning and scheduling in a shop floor are not easy to accomplish due to the concurrent flow of various parts as well as sharing of different types of resources. Multi-pass scheduling is a well known method for solving the aforementioned problem. Its success depends largely on selecting the best decision-making rule fast and effectively. Although many efforts have been made in the past, a way to minimize the computational load of rule evaluation and selection has yet to appear. The objective of the paper is to apply a nested partitioning (NP) method and an optimal computing budget allocation (OCBA) method to reduce the computational load without the loss of the performance of multi-pass scheduling. The experimental design and analysis was performed to validate that NP and OCBA can be successfully applied to multi-pass scheduling in order to enhance the performance of multi-pass scheduling.
Recommendation on Item Graphs
Authors: Fei Wang, Sheng Ma, Liuzhong Yang, Tao Li
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

A novel scheme for item-based recommendation is proposed in this paper. In our framework, the items are described by an undirected weighted graph G = (V, E). V is the node set which is identical to the item set, and E is the edge set. Associate with each edge e_ij \inE is a weight w_ij \geqslant0, which represents similarity between items i and j. Without the loss of generality, we assume that any user's ratings to the items should be sufficiently smooth with respect to the intrinsic structure of the items, i.e., a user should give similar ratings to similar items. A simple algorithm is presented to achieve such a "smooth" solution. Encouraging experimental results are provided to show the effectiveness of our method.
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Authors: André Große, Jörg Rothe, Gerd Wechsung
Venue: Information Processing Letters (2006)

We show that computing the lexicographically first four-coloring for planar graphs is Δ2p-hard. This result optimally improves upon a result of Khuller and Vazirani who prove this problem NP-hard, and conclude that it is not self-reducible in the sense of Schnorr, assuming P ≠ NP. We discuss this application to non-self-reducibility and provide a general related result. We also discuss when raising a problem's NP-hardness lower bound to Δ2p-hardness can be valuable.
TPO, Preference and Short Time History Based for Recommendation Service in Mobile Environment
Authors: Sineenard Pinyapong, Toshikazu Kato
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Most information service today considers about location-based service or time service. However, it has more factors that make system achieve more efficient service. In this paper, we propose the relationship of time, place and purpose(TPO), preference and short time history. The three factors which time, place and purpose are mutually dependent which we have summarized the basic rules to analyze essential data. We are filtering the message with important factors are preference and history. We illustrate scenarios about "push", "pull" and "don't disturb mode" service in Odaiba area, which our DB queries can be recommended relevant messages to users. Furthermore, we discuss the implementation of prototype system including results of experimental evaluation.
A Shape-Based Image Retrieval System Using the Curvature Scale Space (CSS) Technique and the Self-Organizing Map (SOM) Model
Authors: Carlos W. D. de Almeida, Renata M. C. R. de Souza, Nicomedes L. Cavalcanti Junior
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

A novel hybrid system for shape-based image retrieval using the curvature scale space (CSS) and self-organizing map (SOM) methods is presented. The shape features of images are represented by CSS images extracted from, for example, a large database and they are processed using the PCA technique. These processed CSS images constitutes the training dataset for a SOM neural network which, in turn, will be used for performing efficient image retrieval. Experimental results using a benchmark database are presented to demonstrate the usefulness of the proposed methodology.
Early Usability Evaluation in Model Driven Architecture Environments
Authors: Silvia Abrahao, Emilio Insfran
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Due to the increasing interest in the Model Driven Architecture (MDA) paradigm, the conceptual models have become the backbone of the software development process. So far some methods exist to develop a user interface according to a MDA-compliant method, none of them explicitly connects usability to their process activities. In this paper, we present a framework which incorporates usability as part of a MDA development process. In particular, a usability model for early evaluation is proposed. Using this model, the usability of a software system is evaluated and improved at the platform independent model (PIM) level. It focuses on the correspondences between the abstract user interface elements and the final user interface elements in a specific platform (CM). This framework has been successfully applied to an industrial MDA tool.
A Smart TCP Acknowledgment Approach for Multihop Wireless Networks
Authors: Ruy de Oliveira Torsten Braun
Venue: IEEE Transactions on Mobile Computing (2007)

Reliable data transfer is one of the most difficult tasks to be accomplished in multihop wireless networks. Traditional transport protocols like TCP face severe performance degradation over multihop networks given the noisy nature of wireless media as well as unstable connectivity conditions in place. The success of TCP in wired networks motivates its extension to wireless networks. A crucial challenge faced by TCP over these networks is how to operate smoothly with the 802.11 wireless MAC protocol which also implements a retransmission mechanism at link level in addition to short RTS/CTS control frames for avoiding collisions. These features render TCP acknowledgments (ACK) transmission quite costly. Data and ACK packets cause similar medium access overheads despite the much smaller size of the ACKs. In this paper, we further evaluate our dynamic adaptive strategy for reducing ACK-induced overhead and consequent collisions. Our approach resembles the sender side's congestion control. The receiver is self-adaptive by delaying more ACKs under nonconstrained channels and less otherwise. This improves not only throughput but also power consumption. Simulation evaluations exhibit significant improvement in several scenarios.
Soft-partition-based weighted sum filters for image enhancement
Authors: Min Shao, K. E. Barner
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Images are nonstationary in nature. Hard-partition-based weighted sum (HWS) filters give good results in handling both flat regions and details in application such as image enhancement. But due to their non-differentiable filtering operation, their global optimization is difficult to achieve. In this paper, we introduced a new type of soft-partition-based weighted sum (SWS) filters, whose filter operations are differentiable, allowing a steepest decent adaptive optimization to be applied. It is shown that SWS filters provide better performance than HWS filters in an image enhancement application. SWS filters are, therefore, an effective class of nonlinear filters for image enhancement.
Application Protocol for a DICOM Real Time Collaborative System
Authors: D. D. Abdala, M. , . Prusse, A. G. Regert, A. von Wangenheim
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This work presents a new generic application protocol for DICOM conformant medical collaborative systems. It implements simple techniques for data flow and encapsulation between two or more clients and a single server, using an extension of the DICOM Communication Layer within a server or a client as a session manager. The protocol was tested working over two image viewer clients remotely distributed and the synchronization level shows that collaborative systems can be executed in real time.
An efficient quality-of-service MAC protocol for infrastructure WLANs
Authors: Shih-Lin Wu, Sui Fan-Jiang, Zi-Tsan Chou
Venue: Journal of Network and Computer Applications (2006)

In this paper, we propose a new efficient MAC protocol, named quality-of-service MAC (QMAC), which is an integrated solution for providing QoS guarantees to real-time multimedia applications in infrastructure WLANs. In addition, QMAC has the following attractive features: (i) its reservation scheme ensures that real-time stations enter the polling list in bounded time, (ii) it supports multiple priority levels and guarantees that high-priority stations always join the polling list earlier than low-priority stations, (iii) it employs the distributed pre-check technique such that the access point can admit as many newly flows as possible, while not violating admitted flows' guarantees, (iv) its dynamic bandwidth allocation scheme provides real-time traffic transmission with per-flow probabilistic bandwidth assurances, and (v) it uses a multipoll frame to poll all stations on the polling list at a time, therefore, the bandwidth can be utilized more efficient. Through simulations, we demonstrate the advantage of our QMAC.