ppxscal/embedding_network huggingface dataset:
A Rapidly Reconfigurable Computer Lab for Software Engineering Security Experiments and Exercises
Authors: Kyle King, David Manz, Paul Ortman, Doug Shikashio, Paul Oman
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

The Reconfigurable Attack-Defend Instructional Computing Laboratory (RADICL) is a software engineering lab at the University of Idaho. The lab is unique in that it can completely reconfigure its network topology and change the operating system of every machine in the lab in four minutes. The lab has been used for various research projects, classroom exercises, and academic experiments. The organization of the lab and some examples of its classroom use are discussed in this paper.
Table extraction for answer retrieval
Authors: Xing Wei, Bruce Croft, Andrew Mccallum
Venue: Information Retrieval (2006)

The ability to find tables and extract information from them is a necessary component of many information retrieval tasks. Documents often contain tables in order to communicate densely packed, multi-dimensional information. Tables do this by employing layout patterns to efficiently indicate fields and records in two-dimensional form. Their rich combination of formatting and content presents difficulties for traditional retrieval techniques. This paper describes techniques for extracting tables from text and retrieving answers from the extracted information. We compare machine learning (especially, Conditional Random Fields) and heuristic methods for table extraction. To retrieve answers, our approach creates a cell document, which contains the cell and its metadata (headers, titles) for each table cell, and the retrieval model ranks the cells of the extracted tables using a language-modeling approach. Performance is tested using government statistical Web sites and news articles, and errors are analyzed in order to improve the system.
Object oriented programming and program correctness: the students' perspective
Authors: Ioanna Stamouli, Meriel Huggard
Venue: Proceedings of the second international workshop on Computing education research (2006)

Many Computer Science and Engineering curricula contain core modules on computer programming and programming languages. An increasing number of institutions choose to introduce undergraduates to programming through object oriented languages. As part of a longitudinal phenomenographic study we have set out to investigate the understanding of programming concepts that first year undergraduate students have when learning to program and think in the object oriented paradigm.The conceptions that students have developed on what learning to program really means and their perception of program correctness are explored; providing an insight into the levels of abstraction and complexity of the learners' understanding. Our findings suggest that the way students experience learning to program is related to their perception of what constitutes program correctness.
A Case-Based Architecture for Temporal Abstraction Configuration and Processing
Authors: L. Portinale, S. Montani, A. Bottrighi, G. Leonardi, J. M. Juarez
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In this work we propose a case-based architecture tackling the problem of configuring and processing temporal abstractions (trends and qualitative states) produced from raw time series data. The parameter configuration is a critical problem in many temporal abstraction processes; in several application domains (especially in medical ones), contextual knowledge plays a fundamental role in the time series interpretation. Since defining the right configuration for each possible contextual situation may be impractical, we propose to adopt a case-based approach, where the suitable configuration can be obtained by looking at the most similar already configured case, with respect to the current situation. Configured cases are indexed by means of contextual information. The obtained configuration can then be used as input to a temporal abstraction module, providing a set of qualitative states, trends and suitable combination of both as a result. Cases can then be exploited in the processing of such results as well, by providing an evaluation of the whole abstraction processing, possibly leading to the revision of the case base. The approach is illustrated by means of an example taken from a medical application, concerning the monitoring and evaluation of patients undergoing hemodialysis treatment.
The Development and Use of Open-source Spacecraft Simulation and Control Software for Education and Research
Authors: Andrew J. Turner
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

Open-Source software offers key advantages to space systems simulation, design and operations. Mission timelines can span decades, potentially outlasting the lifetime of commercial applications and companies. By contrast, open-source software has the benefit that engineers can inspect the source code to maintain and make modifications as necessary. Educators and students gain the ability to teach and learn how to perform space simulation. To these ends, an Open-Source, extensible spacecraft simulation and modeling (Open-SESSAME) framework is developed with the aim of providing to engineers the capability to quickly simulate and test satellite algorithms while allowing them to view and extend the underlying code. The software is distributed under an open-source license and is free to use and modify. This work presents the purpose and considerations behind the development of the framework, the software design architecture and implementation, and a roadmap of the future for the software package.
Supporting Vocational Education and Training through Mobile Learning Environments
Authors: Demetrios Sampson
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

As with many emerging paradigms, there are several attempts to define m-learning. According to Kinshuk et. al. [1], "m-learning is defined as the ability of using handheld devices to access learning resource". Vavoula and Sharples [2] claim that there are "hree ways that learning can be considered mobile, that is, in terms of space; in different areas of life, and with respect of time" whereas Wood [3] considers that "m-learning refers to the use of mobile and handheld IT devices, such as PDAs, mobile phones, laptops and tablet PCs, in teaching and learning".
Application of piezoelectric layers in electrostatic MEM actuators: controlling of pull-in voltage
Authors: Ghader Rezazadeh, Ahmadali Tahmasebi, Mikhail Zubstov
Venue: Microsystem Technologies (2006)

In this paper, a novel method has been developed to control the pull-in voltage of the fixed-fixed and cantilever MEM actuators and measure the residual stress in the fixed-fixed model using of the piezoelectric layers that have been located on the upper and lower surfaces of actuator. In the developed model, the tensile or compressive residual stresses, fringing-field and axial stress effects in the fixed-fixed end type micro-electro-mechanical systems actuator have been considered. The non-linear governing differential equations of the MEM actuators have been derived by considering the piezoelectric layers and mentioned effects. The results show that due to different applied voltage to the piezoelectric layers, the pull-in voltage can be controlled and in the fixed-fixed type the unknown value of the residual stress can be obtained.
Off-Line Micro-Payment Protocol for Multiple Vendors in Mobile Commerce
Authors: Xiaoling Dai, Oluwatomi Ayoade, John Grundy
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Micro-payment systems have the potential to provide non-intrusive, high-volume and low-cost payas- you-use services for a wide variety of web-based applications. Previously we have developed NetPay, an off-line micro-payment protocol for E-commerce. In this paper we describe a set of extensions, Mobile- NetPay, optimised for mobile E-commerce. Mobile- NetPay provides high performance and security using one-way hashing functions for e-coin encryption. Each mobile user's transaction does not involve any broker and double spending is detected during the redeeming transaction. We describe the motivation for Mobile- NetPay and describe three transactions of the Mobile- NetPay protocol in detail to illustrate the approach. We then discuss future research on this protocol.
Forensic analysis of autonomous system reachability
Authors: DK Lee, Sue Moon, Taesang Choi, Taesoo Jeong
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance degradation in the data plane in terms of delay and loss. Also it has been reported that the number of routing updates increased significantly, which could be a reflection of increased routing instability in the control domain. In this paper, we perform a detailed forensic analysis of routing instability during known security incidents and present useful metrics in assessing damage in AS reachability. Any change in AS reachability is a direct indication of whether the AS had fallen victim to the security incident or not.We choose the Slammer worm attack in January, 2003, as a security incident for closer examination. For our forensic analysis, we use BGP routing data from RouteViews and RIPE. As a way to quantify AS reachability, we propose the following metrics: the prefix count and the address count. The number of unique prefixes in routing tables during the attack fluctuates greatly, but it does not represent the real scope of damage. We define the address count as the cardinality of the set of IP addresses an AS is responsible for either as an origin or transit AS, and observe how address counts changed over time. These two metrics together draw an accurate picture of how reachability to or through the AS had been affected. Though our analysis was done off-line, our methodology can be applied on-line and used in quick real-time assessment of AS reachability.
Benchmarking Knowledge-based Context Delivery Systems
Authors: John Keeney, David Lewis, Declan O'Sullivan
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely heterogeneity across the body of context information can be addressed using runtime reasoning over ontology-based context models. However, existing knowledge-based reasoning is not typically optimised for real-time operation so its inclusion in any context delivery platform needs to be carefully evaluated from a performance perspective. In this paper we propose a benchmark for knowledgebased context delivery platforms and in particular examine suitable knowledge benchmarks for assessing the ability of platforms to deal with semantic interoperability.
Entre-pass: Personalising u-learning with Intelligent Agents
Authors: Brid C. Doherty, Peter T. O'Hare, Michael J. O'Grady, Gregory M. P. O'Hare
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

Delivering learning materials anytime, anywhere is the goal underpinning the ubiquitous learning (u-learning) paradigm. Personalising this u-learning courseware delivers a unique learning experience to each individual user. Personalisation of learning content delivery requires certain system attributes; namely system adaptivity, intelligence, user profiling and awareness of user context (network, device, location). In this paper we describe the entre-pass system which is an example of this new class of adaptive u-learning system. Entre-pass is designed to deliver preliminary entrepreneurial training to individuals working within small and micro-industries. Courseware personalisation and trainee assessment is achieved using a suite of collaborative BDI intelligent agents. Finally, the results of our initial pilot testing and the corresponding modifications to the system are presented.
Identifying demand sources that minimize risk for a selective newsvendor
Authors: Kevin M. Taaffe, Deepak Tirumalasetty
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Consider a firm that offers a product during a single selling season. The firm has the flexibility of choosing which demand sources to serve, but these decisions must be made prior to knowing the actual demand that will materialize in each market. Moreover, we assume the firm operates on a tight budget and cannot afford to record several successive financial losses spanning consecutive periods. In this case, it is likely that their objective is not only to maximize expected profit, but to minimize the variance from that goal. We provide insights into the tradeoff between expected profit, expected revenue, and demand uncertainty. Finally, we present a solution approach, via simulation, to determine the best set of markets to pursue and the associated order quantity when the firm's objective is to minimize the probability of receiving a profit below a critical threshold value.
fMRI Evidence for Dual Routes to the Mental Lexicon in Visual Word Recognition
Authors: Christian J. Fiebach, Angela D. Friederici, Karsten Müller, D. Yves Von Cramon
Venue: Journal of Cognitive Neuroscience (2002)

Event-related fMRI was used to investigate lexical decisions to words of high and low frequency of occurrence and to pseudowords. The results obtained strongly support dual-route models of visual word processing. By contrasting words with pseudowords, bilateral occipito-temporal brain areas and posterior left middle temporal gyrus (MTG) were identified as contributing to the successful mapping of orthographic percepts onto visual word form representations. Low-frequency words and pseudowords elicited greater activations than high-frequency words in the superior pars opercularis &lsqb;Brodmann's area (BA) 44&rsqb; of the left inferior frontal gyrus (IFG), in the anterior insula, and in the thalamus and caudate nucleus. As processing of these stimuli during lexical search is known to rely on phonological information, it is concluded that these brain regions are involved in grapheme-to-phoneme conversion. Activation in the pars triangularis (BA 45) of the left IFG was observed only for low-frequency words. It is proposed that this region is involved in processes of lexical selection.
Integrity regions: authentication through presence in wireless networks
Authors: Srdjan Čapkun, Mario Čagalj
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

We introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of pre-established or pre-certified keys. Integrity regions are based on the verification of entity proximity through time-of-arrival ranging techniques. We demonstrate how I-regions can be efficiently implemented with ultrasonic ranging, in spite of the fact that ultrasound ranging techniques are vulnerable to distance enlargement and reduction attacks. We further discuss how I-regions can be used in key establishment applications in peer-to-peer wireless networks.
Efficient Nonparametric Belief Propagation with Application to Articulated Body Tracking
Authors: Tony X. Han, Huazhong Ning, Thomas S. Huang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

An efficient Nonparametric Belief Propagation (NBP) algorithm is developed in this paper. While the recently proposed nonparametric belief propagation algorithm has wide applications such as articulated tracking [22, 19], superresolution [6], stereo vision and sensor calibration [10], the hardcore of the algorithm requires repeatedly sampling from products of mixture of Gaussians, which makes the algorithm computationally very expensive. To avoid the slow sampling process, we applied mixture Gaussian density approximation by mode propagation and kernel fitting [2, 7]. The products of mixture of Gaussians are approximated accurately by just a few mode propagation and kernel fitting steps, while the sampling method (e.g. Gibbs sampler) needs many samples to achieve similar approximation results. The proposed algorithm is then applied to articulated body tracking for several scenarios. The experimental results show the robustness and the efficiency of the proposed algorithm. The proposed efficient NBP algorithm also has potentials in other applications mentioned above.
Methodology for the Selection of Intelligence Analysis Tools
Authors: Haleh Vafaie, Nichols F. Brown, Lap Truong
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

The use of commercial-off-the-shelf (COTS) / government-off-the-shelf (GOTS) applications as components in software systems is increasingly prevalent. The critical step of tool selection for an integrated suite is usually based on identifying the tools that best match the functionality requirements needed. Other factors tangential to technical performance are playing a more important role in the tool selection process and making the mapping of customer needs to technical requirements less obvious. This paper suggests a shift from the traditional "best tools" selection approach, where tools are selected for their performance to a more holistic "end-to-end" approach, where customer concerns, business and cost benefits, and technical performance are weighed concurrently. The end-to-end methodology was applied to an integrated suite for the intelligence analysis process and was compared to a theoretical system employing a best tools approach. This showed that the end-to-end approach resulted in significant software related cost reductions.
Clique-Width for 4-Vertex Forbidden Subgraphs
Authors: Andreas Brandstadt, Joost Engelfriet, Hoang-Oanh Le, Vadim V. Lozin
Venue: Theory of Computing Systems (2006)

Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends the one of treewidth, since bounded treewidth implies bounded clique-width. We give a complete classification of all graph classes defined by forbidden induced subgraphs of at most four vertices with respect to bounded or unbounded clique-width.
Modeling uncertain domains with polyagents
Authors: H. Van Dyke Parunak, Sven Brueckner
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Agents are a powerful tool for systems modeling. Instantiating each domain entity with an agent captures many aspects of system dynamics and interactions that other modeling techniques do not. However, an entity's agent can execute only one trajectory per run, and so does not capture the alternative trajectories accessible in the evolution of any realistic system. Averaging over multiple runs does not capture the range of individual interactions. We address these problems with a new modeling construct, the polyagent, which represents each entity with a single persistent avatar supported by a swarm of transient ghosts. Each ghost interacts with the ghosts of other avatars through digital pheromone fields, capturing a wide range of alternative trajectories in a single run of the system that can proceed faster than real time.
VisLab and the Evolution of Vision-Based UGVs
Authors: Massimo Bertozzi, Alberto Broggi, Alessandra Fascioli
Venue: Computer (2006)

Unmanned ground vehicles will shape our future by providing enhanced safety and improved mobility. Four decades after researchers first developed the concept, they are still building prototypes, but they are now moving toward demonstrations, indicating that the early ideas have real applicability.
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
Authors: Tian Hong, Henryk Rybinski
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the generalized discernibility matrix, the missing attribute set of an object, the indiscernible object set of an object, and the missing object set of an information system. A new algorithm for computing weighted attributes values of incomplete information systems is presented. This algorithm can reveal weighted attributes values and rules contained from an original given data alone with small computational cost. Therefore it is suitable to be used in the data preprocessing stage of knowledge discovery process. An example is given in the paper to show that the proposed algorithm well foresees real value of missing attribute and outperforms the methods based on ignoring missing values.
Type-sensitive control-flow analysis
Authors: John Reppy
Venue: Proceedings of the 2006 workshop on ML (2006)

Higher-order typed languages, such as ML, provide strong support for data and type abstraction. While such abstraction is often viewed as costing performance, there are situations where it may provide opportunities for more aggressive program optimization. Specifically, we can exploit the fact that type abstraction guarantees representation independence, which allows the compiler to specialize data representations. This paper describes a first step in supporting such optimizations; namely a control-flow analysis that uses the program's type information to compute more precise results. We present our algorithm as an extension of Serrano's version of 0-CFA and we show that it respects types. We also discuss applications of the analysis with examples of optimizations enabled by the analysis that would not be possible using normal CFA.
Bootstrapping a community of practice: learning science by doing projects in a high school classroom
Authors: Joseph Polman
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Researchers and theorists have extolled the promise of learning achieved through participation in the activities of a community of practice. Although he did not use the term "community of practice" in his seminal work Mindstorms, [Paper], 1980] described intergenerational learning that takes place in the preparation for a Brazilian festival. Experienced adults work with novice children on teams over an extended period of time, supporting learning and passing on expertise naturally through the construction of displays and the production of street theater. Similarly, [Lave & Wenger, 1991] describe how apprentice tailors gradually learn their craft by aiding master tailors in ever expanding portions of work they are hired to do. [Brown, Collins, & Duguid, 1989] have described the general processes of modeling, coaching, and fading as important means by which more experienced members of a community help novices learn to contribute to activities.