ppxscal/embedding_network huggingface dataset:
Characterization of interfacial reaction and chemical bonding features of LaOx/HfO2 stack structure formed on thermally-grown SiO2/Si(100)
Authors: Akio Ohta, Daisuke Kanme, Hideki Murakami, Seiichiro Higashi, Seiichi Miyazaki
Venue: Microelectronic Engineering (2009)

A stack structure consisting of ~1.5nm-thick LaO"x and ~4.0nm-thick HfO"2 was formed on thermally grown SiO"2 on Si(100) by MOCVD using dipivaloymethanato precursors, and the influence of N"2 annealing on interfacial reaction for this stack structure was examined by using X-ray photoelectron spectroscopy and Fourier transform infrared attenuated total reflection. We found that compositional mixing between LaO"x and HfO"2 becomes significant from 600^oC upwards and that interfacial reaction between HfLa"yO"z and SiO"2 proceeds consistently at 1000^oC in N"2 ambience.
Elastic block ciphers: method, security and instantiations
Authors: Debra L. Cook, Moti Yung, Angelos D. Keromytis
Venue: International Journal of Information Security (2009)

We introduce the concept of an elastic block cipher which refers to stretching the supported block size of a block cipher to any length up to twice the original block size while incurring a computational workload that is proportional to the block size. Our method uses the round function of an existing block cipher as a black box and inserts it into a substitution- permutation network. Our method is designed to enable us to form a reduction between the elastic and the original versions of the cipher. Using this reduction, we prove that the elastic version of a cipher is secure against key-recovery attacks if the original cipher is secure against such attacks. We note that while reduction-based proofs of security are a cornerstone of cryptographic analysis, they are typical when complete components are used as sub-components in a larger design. We are not aware of the use of such techniques in the case of concrete block cipher designs. We demonstrate the general applicability of the elastic block cipher method by constructing examples from existing block ciphers: AES, Camellia, MISTY1, and RC6. We compare the performance of the elastic versions to that of the original versions and evaluate the elastic versions using statistical tests measuring the randomness of the ciphertext. We also use our examples to demonstrate the concept of a generic key schedule for block ciphers.
Large-Scale Parallel Computing of Cloud Resolving Storm Simulator
Authors: Kazuhisa Tsuboki, Atsushi Sakakibara
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

A sever thunderstorm is composed of strong convective clouds. In order to perform a simulation of this type of storms, a very fine-grid system is necessary to resolve individual convective clouds within a large domain. Since convective clouds are highly complicated systems of the cloud dynamics and microphysics, it is required to formulate detailed cloud physical processes as well as the fluid dynamics. A huge memory and large-scale parallel computing are necessary for the computation. For this type of computations, we have developed a cloud resolving numerical model which was named the Cloud Resolving Storm Simulator (CReSS). In this paper, we will describe the basic formulations and characteristics of CReSS in detail. We also show some results of numerical experiments of storms obtained by a large-scale parallel computation using CReSS.
Foot-driven computing: our first glimpse of location privacy issues
Authors: Frank Stajano
Venue: SIGSPATIAL Special (2009)

Ubiquitous computing has been a fashionable research theme for the past twenty years, so much so that many research groups have felt the urge to give it a different name (pervasive computing, calm computing, ambient intelligence etc etc) in order to claim that they were doing something new or at least slightly different from everyone else. One of these many alternate names has been "context-aware computing", to suggest systems and devices that would sense the "context" of a situation and behave accordingly: for example, a mobile phone might sense that its owner is "in a meeting" and automatically switch from ringtone to vibration mode.
Polyamide 66/Brazilian clay nanocomposites
Authors: E. M. Araújo, K. D. Araujo, R. A. Paz, T. R. Gouveia, R. Barbosa, E. N. Ito
Venue: Journal of Nanomaterials (2009)

Polyamide 66 (PA66)/Brazilian clay nanocomposites were produced via direct melt intercalation. A montmorillonite sample from the Brazilian state of Paraíba was organically modified with esthearildimethylammonium chloride (Praepagen), quaternary ammonium salt and has been tested to be used in polymer nanocomposites. The dispersion analysis and the interlayer spacing of the clay particles in matrix were investigated by X-ray diffraction (XRD) and transmission electron microscopy (TEM). Thermal behavior of the obtained systems was investigated by differential scanning calorimetry (DSC), thermogravimetry (TG), and heat deflection temperature (HDT) was reported too. The nanocomposites exhibited a partially exfoliated structure, very interesting HDT values which are higher than those of pure PA66, and good thermal stability.
Achieving On-Time Delivery: A Two-Stage Probabilistic Scheduling Strategy for Software Projects
Authors: Xiao Liu, Yun Yang, Jinjun Chen, Qing Wang, Mingshu Li
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

Due to the uncertainty of software processes, statistic based schedule estimation and stochastic project scheduling both play significant roles in software project management. However, most current work investigates them independently without an integrated process to achieve on-time delivery for software development organisations. For such an issue, this paper proposes a two-stage probabilistic scheduling strategy which aims to decrease schedule overruns. Specifically, a probability based temporal consistency model is employed at the first pre-scheduling stage to support a negotiation between customers and project managers for setting balanced deadlines of individual software processes. At the second scheduling stage, an innovative genetic algorithm based scheduling strategy is proposed to minimise the overall completion time of multiple software processes with individual deadlines. The effectiveness of our strategy in achieving on-time delivery is verified with large scale simulation experiments.
Designing for complex innovations in health care: design theory and realist evaluation combined
Authors: Christina Keller, Klas Gäre, Mats Edenius, Staffan Lindblad
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

Innovations in health care are often characterized by complexity and fuzzy boundaries, involving both the elements of the innovation and the organizational structure required for a full implementation. Evaluation in health care is traditionally based on the collection and dissemination of evidence-based knowledge stating the randomized controlled trial, and the quasi-experimental study design as the most rigorous and ideal approaches. These evaluation approaches capture neither the complexity of innovations in health care, nor the characteristics of the organizational structure of the innovation. As a result, the reasons for innovations in health care not being disseminated are not fully explained. The aim of the paper is to present a design - evaluation framework for complex innovations in health care in order to understand what works for whom under what circumstances by combining design theory and realist evaluation. The framework is based on research findings of a case study of a complex innovation, a health care quality register, in order to understand underlying assumptions behind the design of the innovation, as well as the characteristics of the implementation process. The design - evaluation cycle is hypothesized to improve the design and implementation of complex innovation by using program/kernel theories to develop design propositions, which are evaluated by realistic evaluation, resulting in further refinement of program/kernel theories. The goal of the design - evaluation cycle is to provide support to implementers and practitioners in designing and implementing complex innovations in health care. As a result, the design - evaluation cycle could provide opportunities of improving dissemination of complex innovations in health care.
Analysis on Relationships of Emotional Transmissions between Participants and Their Emotional Aspects in Communication Using Bulletin Board System
Authors: Shogo Kato, Yuuki Kato, Kanji Akahori
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper focuses on communication using bulletin board system (BBS). A practical experiment was conducted to investigate the degree of influence emotional transmissions between senders (writers) of replies and receivers (readers) of replies have on the emotions which they experienced during communication using the BBS. The analysis focused on the readers of postings. Twelve participants of this experiment were divided into two groups based on the degrees of emotional transmissions: a High group and a Low group. The emotions experienced during communication using the BBS were compared between the High group and the Low group. The results of this experiment showed a tendency for negative emotions such as anger and anxiety to increase when emotional transmissions are low (i.e., the Low group).
Density theorems for bipartite graphs and related Ramsey-type results
Authors: Jacob Fox, Benny Sudakov
Venue: Combinatorica (2009)

In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve and generalize earlier results of various researchers. The proofs combine probabilistic arguments with some combinatorial ideas. In addition, these techniques can be used to study properties of graphs with a forbidden induced subgraph, edge intersection patterns in topological graphs, and to obtain several other Ramsey-type statements.
Online Communication in Language Learning and Teaching
Authors: Regine Hampel, Marie-Noelle Lamy
Venue:  (2007)

This book deals with research and practice in online communication and communication technologies of language learning and teaching. These include all forms of computerized media using text, graphics, audio and video, with a particular focus on multimodal teaching and learning. As part of the project the authors describe well-structured action research projects which have transferable features and which can inspire readers wanting to undertake their own projects.
Building an Intelligent Web: Thoery and Practice, 1st edition
Authors: Rajendra Akerkar, Pawan Lingras
Venue:  (2007)

The World Wide Web has become an extremely popular way of publishing and distributing electronic resources. Though the Web is rich with information, collecting and making sense of this data is difficult because it is rather unorganized. Building an Intelligent Web introduces students and professionals to the state-of-the art development of Web Intelligence techniques and teaches how to apply these techniques to develop the next generation of intelligent Web sites. Each chapter contains theoretical bases, which are also illustrated with the help of simple numeric examples, followed by practical implementation. Students will find Building an Intelligent Web to be an active and exciting introduction to advanced Web mining topics. Topics covered include Web Intelligence, Information Retrieval, Semantic Web, Classification and Association Rules, SQL, Database Theory, Applications to e-commerce and Bioinformatics, Clustering, Modeling Web Topology, and much more!
Design of hybrid authentication scheme and key distribution for mobile multi-hop relay in IEEE 802.16j
Authors: Y. Lee, H. K. Lee, G. Y. Lee, H. J. Kim, C. K. Jeong
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

Mobile multi-hop relay (MMR) network is known to have the strength of easy installation and convenient management because of its self-organizing and self-healing characteristics. However, MMR is also known to be vulnerable to security problems for the very same reason. In this paper, we propose a new hybrid authentication algorithm for IEEE 802.16j MMR network service. The proposed scheme uses centralized authentication when a mobile station (MS) or a relay station (RS) initially joins the MMR network, and uses distributed authentication for hop-by-hop authentication between the mobile nodes. We analyze the procedure of the proposed scheme in detail, and examine its usefulness when applied to the MMR network. The proposed scheme can be used in any mobile multi-hop network as well as IEEE 802.16j MMR network.
Background Subtraction for Temporally Irregular Dynamic Textures
Authors: Gerald Dalley, Joshua Migdal, W. Eric L. Grimson
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

In the traditional mixture of Gaussians background model, the generating process of each pixel is modeled as a mixture of Gaussians over color. Unfortunately, this model performs poorly when the background consists of dynamic textures such as trees waving in the wind and rippling water. To address this deficiency, researchers have recently looked to more complex and/or less compact representations of the background process. We propose a generalization of the MoG model that handles dynamic textures. In the context of background modeling, we achieve better, more accurate segmentations than the competing methods, using a model whose complexity grows with the underlying complexity of the scene (as any good model should), rather than the amount of time required to observe all aspects of the texture.
Sub Node Extraction with Tree Based Wrappers
Authors: Stefan Raeymaekers, Maurice Bruynooghe
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

String based as well as tree based methods have been used to learn wrappers for extraction from semi-structured documents (e.g., HTML documents). Previous work has shown that tree based approaches perform better while needing less examples than string based approaches. A disadvantage is that they can only extract complete text nodes, whereas string based approaches can extract within text nodes. This paper proposes a hybrid approach that combines the advantages of both systems and compares it experimentally with a string based approach on some sub node extraction tasks.
The effect of visualizing roles of variables on student performance in an introductory programming course
Authors: Nouf M. Al-Barakati, Arwa Y. Al-Aama
Venue: ACM SIGCSE Bulletin (2009)

The use of variables in computer programming is one of the difficulties faced by students enrolled in introductory level programming classes. The Roles of Variables (ROV) concept associates small comprehensible roles to variables to help novice programmers comprehend how variables should be used. This paper describes an experiment that was conducted to test the effect of different engagement levels with ROV visualization on student programming skills. 91 Female students at King Abdul Aziz University (KAU), Jeddah, Saudi Arabia, participated in the experiment. The students were divided into three groups where they all had the ROV concept explained to them in a traditional classroom setting, but were given different visualization treatments during lab sessions. Results showed that while viewing the ROV visualization significantly improved student debugging skills, no other significant effects on student programming skills were reported.
Automatically capturing source code context of NL-queries for software maintenance and reuse
Authors: Emily Hill, Lori Pollock, K. Vijay-Shanker
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

As software systems continue to grow and evolve, locating code for maintenance and reuse tasks becomes increasingly difficult. Existing static code search techniques using natural language queries provide little support to help developers determine whether search results are relevant, and few recommend alternative words to help developers reformulate poor queries. In this paper, we present a novel approach that automatically extracts natural language phrases from source code identifiers and categorizes the phrases and search results in a hierarchy. Our contextual search approach allows developers to explore the word usage in a piece of software, helping them to quickly identify relevant program elements for investigation or to quickly recognize alternative words for query reformulation. An empirical evaluation of 22 developers reveals that our contextual search approach significantly outperforms the most closely related technique in terms of effort and effectiveness.
Stepping Through the InfoSec Program, 1st edition
Authors: J. L. Bayuk
Venue:  (2007)

The information security professional has evolved from computer operator to chief information security officer; from controlling punched cards to negotiating strategic plans, defining policies, documenting processes, managing technology, measuring performance, controlling costs, supporting business recovery and demonstrating regulatory compliance. This publication includes a case study and steps to: Compose an information security program Cement a relationship between an information security program and IT governance Design roles and responsibilities to ensure accountability Identify and allocate resources to achieve information security program objectives Determine if an information security program is achieving objectives
Experiences on Processing Spatial Data with MapReduce
Authors: Ariel Cary, Zhengguo Sun, Vagelis Hristidis, Naphtali Rishe
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

The amount of information in spatial databases is growing as more data is made available. Spatial databases mainly store two types of data: raster data (satellite/aerial digital images), and vector data (points, lines, polygons). The complexity and nature of spatial databases makes them ideal for applying parallel processing. MapReduce is an emerging massively parallel computing model, proposed by Google. In this work, we present our experiences in applying the MapReduce model to solve two important spatial problems: (a) bulk-construction of R-Trees and (b) aerial image quality computation, which involve vector and raster data, respectively. We present our results on the scalability of MapReduce, and the effect of parallelism on the quality of the results. Our algorithms were executed on a Google IBM cluster, which became available to us through an NSF-supported program. The cluster supports the Hadoop framework --- an open source implementation of MapReduce. Our results confirm the excellent scalability of the MapReduce framework in processing parallelizable problems.
Cloud Computing: An Overview
Venue: Queue (2009)

A summary of important cloud-computing issues distilled from ACM CTO Roundtables
Increasing computer science participation in the FIRST robotics competition with robot simulation
Authors: Caitlin Buckhaults
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

The FIRST (For Inspiration and Recognition of Science and Technology) Robotics Competition is an international program aimed at inspiring high school students to pursue careers in science and technology through a yearly challenge in which teams of students design and build robots with which to compete against other teams from all over the world. The teams are given 6 weeks to create a competitive robot; the greatest amount of time is dedicated to building the mechanical and electrical systems. Since the software cannot be tested and debugged until after the mechanical and electrical subsystems are functional and nearly complete, programmers have minimal time with the robot, and thus, encounter great difficulty in developing and optimizing their control code. Implementing the robot and the contest environment in a simulator such as Microsoft Robotics Developer Studio allows students to develop their software and hardware concurrently. This greatly improves individual team performance in the competition and provides students with increased exposure to software design, which should result in increased numbers of students entering into computing careers.
A virtual laboratory for studying long-term relationships between humans and virtual agents
Authors: Timothy Bickmore, Daniel Schulman
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Longitudinal studies of human-virtual agent interaction are expensive and time consuming to conduct. We present a new concept and tool for conducting such studies---the virtual laboratory---in which a standing group of study participants interacts periodically with a computer agent that can be remotely manipulated to effect different study conditions, with outcome measures also collected remotely. This architecture allows new experiments to be dynamically defined and immediately implemented in the continuously-running system without delays due to recruitment and system reconfiguration. The use of this tool in the study of a virtual agent that plays the role of an exercise counselor for older adults is described, along with the results of an initial experiment into the effects of conversational variability on user engagement and exercise behavior.
The Advent of Formal Diagrammatic Reasoning Systems
Authors: Frithjof Dau
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

In knowledge representation and reasoning systems, diagrams have many practical applications and are used in numerous settings. Indeed, it is widely accepted that diagrams are a valuable aid to intuition and help to convey ideas and information in a clear way. On the other side, logicians have viewed diagrams as informal tools, but which cannot be used in the manner of formal argumentation. Instead, logicians focused on symbolic representations of logics. Recently, this perception was overturned in the mid 1990s, first with seminal work by Shin on an extended version of Venn diagrams. Since then, certainly a growth in the research field of formal reasoning with diagrams can be witnessed. This paper discusses the evolution of formal diagrammatic logics, focusing on those systems which are based on Euler and Venn-Peirce diagrams, and Peirces existential graphs. Also discussed are some challenges faced in the area, some of which are specifically related to diagrams.