ppxscal/embedding_network huggingface dataset:
Social isolation meets technological innovation: towards developing a model of communication among parents who homeschool
Authors: Pamela Kalbfleisch
Venue:  (2007)

The purpose of this study was to understand how a sample of homeschoolers were using blogs. In this study of homeschoolers and their blog use, a content analysis of 25 blogs with entries from September 2006, February 2007, and June 2007 were studied. The subjects were homeschoolers who blogged; 19 were females, three were males, and six did not clearly identify themselves as male or female. Seven themes emerged through a content analysis: resources, succeeding at homeschooling, homeschooling and fun, advice, questioning homeschoolers, current events, and socialization. These themes were verified through a word count listing from the software used to collect the data from the sample of blogs. The findings indicate that homeschoolers are not using blogs in the traditional sense, as an online journal. The findings also support that homeschoolers are posting openly about their teaching. The homeschoolers in this sample are sharing resources with each other.
Algorithms for Balancing Demand-Side Load and Micro-Generation in Islanded Operation
Authors: Albert Molderink, Vincent Bakker, Johann L. Hurink, Gerard J. M. Smit
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Micro-generators are devices installed in houses producing electricity at kilowatt level. These appliances can increase energy efﬁciency signiﬁcantly, especially when their runtime is optimized. During power outages micro-generators can supply critical systems and decrease discomfort. In this paper a model of the domestic electricity infrastructure of a house is derived and ﬁrst versions of algorithms for load/generation balancing during a power cutare developed. In this context a microCHP device, producing heat and electricity at the same time with a high efﬁciency, is used as micro-generator. The model and the algorithms are incorporated in a simulator, which is used to study the effect of the algorithms for load/generation balancing. The results show that with some extra hardware all appliances in a house can be supplied, however not always at the preferred time.
A Study on Optimal Face Ratio for Recognition Using Part-Based Feature Extractor
Authors: Han Foon Neo, Chuan Chin Teo, Andrew Beng Jin Teoh
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper aims to investigate the optimal face ratio for recognition. Face data are normalized to several ratios, which are 25%, 50% (equivalent to right and left face), and 75% of the full-face. The advantages of using different face ratios are these face data reduce the amount of computational power and storage requirements significantly. For fair comparison, various part-based linear subspace feature extractors, namely Non-negative matrix factorization (NMF), Local NMF (LNMF) and Spatially Confined NMF (SFNMF) are used to estimate the optimal face ratio. Our results show that 75% faces are good enough to produce demonstrably recognition accuracy.
A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks
Authors: Ahmad Al Hanbali, Roland Haan, Richard J. Boucherie, Jan-Kees Ommeren
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called delay-tolerant networking which exploits the mobility of the nodes by letting them operate as relays according to the store-carry-and-forward paradigm.In this work, we analyze the delay performance of a small mobile ad hoc network by considering a tandem queueing system. We present an exact packet-level analysis by applying ideas from the polling literature. Due to the state-space expansion, this analysis cannot efficiently be applied for all model parameter settings. For this reason, an analytical approximation is constructed and its excellent performance has extensively been validated. Numerical results on the mean end-to-end delay show that the switch-over time distribution impacts this metric only through its first two moments. Finally, we study delay optimization under power control.
Markerless Outdoor Localisation Based on SIFT Descriptors for Mobile Applications
Authors: Frank Lorenz Wendt, Stéphane Bres, Bruno Tellez, Robert Laurini
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This study proposes augmented reality from mobile devices based on SIFT (Scale Invariant Feature Transform) features for markerless outdoor augmented reality application. The proposed application is navigation help in a city. These SIFT features are projected on a digital model of the building façades of the square to obtain 3D co-ordinates for each feature point. The algorithms implemented calculate the camera pose for frame of a video from 3D-2D point correspondences between features extracted in the current video frame and points in the reference dataset. The algorithms were successfully tested on video films of city squares. Although they do not operate in real-time, they are capable of a correct pose estimation and projection of artificial data into the scene. In case of a loss of track, the algorithms recover automatically. The study shows the potential of SIFT features for purely image based markerless outdoor augmented reality applications. This study takes place in the MoSAIC project.
Investigation of 3D copper grade changeability by neural networks in metasomatic ore deposit
Authors: Stanislav Topalov, Vesselin Hristov
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The following neural networks (NN) types: Radial Basis Function (RBF), Generalized Regression Neural Networks (GRNN), and two/three layers Multilayer Perceptron (MLP 2, MLP 3) were examined and MLP2 and MLP3 ware determined as a suitable for the copper grade prognostication on one layer of ore deposit. In this paper following the same approach we attempt to determine the potentialities of the same NN types for copper grade prognostication to the deeper levels of the open pit mine. This approach of 3D training and testing of NN efficiency for prognostication is realized with raw exploration data in metasomatic ore deposit.
Urban Data Visualization with Voronoi Diagrams
Authors: Manuel Abellanas, Belén Palop
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Filtering and clustering of the data are very important aspects in data visualization. We will concentrate on these two topics and study how can we combine them to simulate a multiresolution scheme. We will focus on the properties of Voronoi Diagrams in order to avoid the need to compute any other time- or space-consuming data structure. Voronoi Diagrams capture deeply the notion of proximity between elements in an environment and allow queries to be efficiently performed. In this paper we present an application of Voronoi Diagrams and their use in visualization of georreferenced data. The input is a 2.5 data-set, and the output is a colored map where proximity to the given locations is used in order to compute the region contours. We have implemented the proposed techniques in C++. Examples of the results obtained with our application GeoVyS are given in this paper.
RFID Noisy Reader How to Prevent from Eavesdropping on the Communication?
Authors: O. Savry, F. Pebay-Peyroula, F. Dehmas, G. Robert, J. Reverdy
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

RFID applications do not always use encryption to ensure the security as public key cryptographic algorithms that are costly in term of computing resources. We proposed to secure the communication from an ISO 14443 RFID card to the reader against passive eavesdropping at the physical layer by adding noise. During the card reply, the reader generates an appropriate noise that is modulated by the load of the card. By knowing the noise it emitted, the reader is able to subtract it and to retrieve the card message when a spying probe in the field is inefficient.
Neural Control of Uncertain Nonlinear Systems with Minimum Control Effort
Authors: Dingguo Chen, Jiaben Yang, Ronald R. Mohler
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

A special class of nonlinear systems are studied in this paper in the context of fuel optimal control, which feature parametric uncertainties and confined control inputs. The control objective is to minimize the integrated control cost over the applicable time horizon. The conventional adaptive control schemes are difficult to apply. An innovative design approach is proposed to handle the uncertain parameters, physical limitations of control variables and fuel optimal control performance simultaneously. The proposed control design methodology makes an analysis of the fuel control problem for nominal cases, employs a hierarchical neural network structure, constructs the lower level neural networks to identify the switching manifolds, and utilizes the upper level neural network to coordinate the outputs of the lower level neural networks to achieve the control robustness in an approximately fuel-optimal control manner. Theoretical results are presented to justify the proposed design procedures for synthesizing adaptive, intelligent hierarchical neural controllers for uncertain nonlinear systems.
An Effective XML Data Release in Dynamic Environments
Authors: Hyuk Jin Ko, Kyu Il Kim, Eun Ju Lee, Won Gil Choi, Ung Mo Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

As XML is de facto becoming a standard for information representation and exchange in IT world, XML release methods are receiving intense attentions. The crucial requirement of XML release is scalability that affords to manage efficiently large number of users and great amounts of data. Although many existing approaches (e.g. famous SDI approach) have challenged to support XML release, because they have adopted the pre-configured key share approaches, they are not suitable for the dynamic environments characterized by the variant population, such as Peer-to-Peer, Ubiquitous and Ad-hoc networks. In this paper, we suggest a novel method that provides a more effective, reusable key share for dynamic environments by means of authorization, derive key and secret sharing scheme.
TARtool: A Temporal Dataset Generator for Market Basket Analysis
Authors: Asem Omari, Regina Langer, Stefan Conrad
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

The problem of finding a suitable dataset to test different data mining algorithms and techniques and specifically association rule mining for Market Basket Analysis is a big challenge. A lot of dataset generators have been implemented in order to overcome this problem. ARtool is a tool that generates synthetic datasets and runs association rule mining for Market Basket Analysis. But the lack of datasets that include timestamps of the transactions to facilitate the analysis of Market Basket data taking into account temporal aspects is notable. In this paper, we present the TARtool. The TARtool is a data mining and generation tool based on the ARtool. TARtool is able to generate datasets with timestamps for both retail and e-commerce environments taking into account general customer buying habits in such environments. We implemented the generator to produce datasets with different format to ease the process of mining such datasets in other data mining tools. An advanced GUI is also provided. The experimental results showed that our tool overcomes other tools in efficiency, usability, functionality, and quality of generated data.
Electronic and vibrational polarizability and first hyperpolarizability of charge transfer chromophores: Quantum chemistry investigation
Authors: Amar Saal, Ourida Ouamerali
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Static vibrational and electronic contributions to the longitudinal polarizability (&alpha;) and first hyperpolarizability (&beta;) have been calculated, within the double harmonic oscillator approximation, at the HF/6-31G for a set of polyconjugated, D-linker-A, compounds. Effects due to the nature of the linker and of the D/A-pair type, on the geometrical structures and the electrical properties, are investigated. It turns out that, for a given linker, in almost all cases, the static &beta;$^e_L$ (0) and &beta;$^v_L$ (0) vary in the same order, with the type of the acceptor group A (A # NO$_2$, COH, CF$_3$). As well, the pair HO/NO$_2$ was associated the greatest &beta;$^e_L$ (0) and &beta;$^v_L$ (0) values. The analysis upon the SOM expressions, due to Bishop and Kirtman, demonstrates that, more than 50% of &beta;$^v_L$ owes to three, two or even to only one vibrational normal mode contribution. Moreover, the vibrational modes with frequencies at, or more than, 3000 cm$^{-1}$ present a null individual vibrational first hyperpolarizability.
Hurdles Hardly Have to Be Heeded
Authors: Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard M. Moret
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also called reversals), was characterized by Hannenhalli and Pevzner and this characterization in turn extended by various authors. The characterization relies on the concepts of breakpoints, cycles, and obstructions colorfully named hurdles and fortresses. In this paper, we study the probability of generating a hurdle in the process of sorting a permutation if one does not take special precautions to avoid them (as in a randomized algorithm, for instance). To do this we revisit and extend the work of Caprara and of Bergeron by providing simple and exact characterizations of the probability of encountering a hurdle in a random permutation. Using similar methods we, for the first time, find an asymptotically tight analysis of the probability that a fortress exists in a random permutation.
Towards a Narrative Mind: The Creation of Coherent Life Stories for Believable Virtual Agents
Authors: Wan Ching Ho, Kerstin Dautenhahn
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

This paper describes an approach to create coherent life stories for Intelligent Virtual Agents (IVAs) in order to achieve long-term believability. We integrate a computational autobiographic memory, which allows agents to remember significant past experiences and reconstruct their life stories from these experiences, into an emotion-driven planning architecture. Starting from the literature review on episodic memory modelling and narrative agents, we discuss design considerations for believable agents which interact with users repeatedly and over a long period of time. In the main body of the paper we present the narrative structure of human life stories. Based on this, we incorporate three essential discourse units and other characteristics into the design of the autobiographic memory structure. We outline part of the implementation of this memory architecture and describe the plan for evaluating the architecture in long-term user studies.
The Wrong Question to the Right People. A Critical View of Severity Classification Methods in ATM Experimental Projects
Authors: Alberto Pasquini, Simone Pozzi, Luca Save
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The knowledge of operational experts plays a fundamental role in performing safety assessments in safety critical organizations. The complexity and socio-technical nature of such systems produce hazardous situations which require a thorough understanding of concrete operational scenarios and cannot be anticipated by simply analyzing single failures of specific functions. This paper addresses some limitations regarding state-of-the-art safety assessment techniques, with special reference to the use of severity classes associated to specific outcomes (e.g. accident, incident, no safety effect, etc.). Such classes tend to assume a linear link between single hazards considered in isolation and specified consequences for safety, thus neglecting the intrinsic complexity of the systems under analysis and reducing the opportunities for an effective involvement of operational experts. An alternative approach is proposed to overcome these limitations, by allowing operational people to prioritize the severity of hazards observed in concrete operational scenarios and by involving them in the definition of the possible means of mitigation.
Using Genetic Algorithms for Album Page Layouts
Authors: Joe Geigel, Alexander Loui
Venue: IEEE MultiMedia (2003)

We describe a system that uses a genetic algorithm to interactively generate personalized album pages for visual content collections on the Internet. The system has three modules: preprocessing, page creation, and page layout. We focus on the details of the genetic algorithm used in the page-layout task.
Computing Stack Maps with Interfaces
Authors: Frédéric Besson, Thomas Jensen, Tiphaine Turpin
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This paper describes an improved bytecode analyser together with algorithms for optimizing the stack maps generated. The analyser is simplified in its treatment of base values (keeping only the necessary information to ensure memory safety) and enriched in its representation of interface types, using the Dedekind-MacNeille completion technique. The computed interface information allows to remove the dynamic checks at interface method invocations. We prove the memory safety property guaranteed by the bytecode verifier using an operational semantics whose distinguishing feature is the use of untagged 32-bit values. For bytecode typable without sets of types we show how to prune the fix-point to obtain a stack map that can be checked without computing with sets of interfaces i.e., lightweight verification is not made more complex or costly. Experiments on three substantial test suites show that stack maps can be computed and correctly pruned by an optimized (but incomplete) pruning algorithm.
NISD: A Framework for Automatic Narrow Instruction Set Design
Authors: Xianhua Liu, Jiyu Zhang, Xu Cheng
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Code size is becoming an important design factor in the embedded domain. To deal with this problem, many embedded RISC processors support a dual-width instruction set. Mixed code generation is also introduced in expectation of achieving both higher code density from the narrow instruction set (usually 16 bits) and good performance from the normal one (usually 32 bits), with little extra cost. To a certain application domain, processors can combine an efficient general purpose instruction set and a narrow instruction set tailored to the particular applications. Since the design of instruction set is highly related to the compiler and the application programs, a feedback driven technique will be a good choice.In this paper, we introduce a framework of automatic narrow instruction set design. The instructions are described in our Instruction Set Description Template (ISDT). Given a set of application programs, the design tool will iteratively use the suggested narrow instruction set represented in ISDT to do mixed-code generation and to update the narrow instruction set according to the evaluation feedback, thus to get an ultimate fine narrow instruction set without human designer's involvement. We describe our method in detail by example of designing narrow instruction set for UniCore with the mediabench as the application set, and show its usefulness through the experiments.
Agora UCS Ubiquitous Collaborative Space
Authors: Pascal Dugénie, Stefano A. Cerri, Philippe Lemoisson, Abdelkader Gouaich
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Agora UCS is a new architecture designed for distributed learning as a side effect of communication and collaboration. This architecture aims to achieve (i) ubiquity (time and space independent access by community members); (ii) immanence (full internal control of the destiny of the community) and (iii) multi-modal communication (reinforcing the interactions between the members of the community). The theoretical model underlying Agora UCS is inspired by an integration of agents and Grid concepts (AGIL). Agora UCS has been experimented by a dozen of communities, which represent alltogether about seventy members. We achieved quite promising results in terms of motivation and collective performances.
Research on Next Generation Grids Using a Fuzzy Assessment Method
Authors: Chunyang Ye, Feng Xiong, Qi Luo
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

Main issues to be faced by next-generation Grids are the management and exploitation of the overwhelming amount of data produced by applications but also by Grid operation, and the intelligent use of Grid resou-rces and services. To achieve these very ambitious goals, next-generation Grids should include knowledge discovery and knowledge management functionalities, for both applications and system management. This paper proposes a fuzzy assessment method. The assessment of Next-generation Grids is composed of objective and subjective assessment. The results manifest that the assessment method is effective through testing in some system.
A Study on Real-Time Scheduling for Holonic Manufacturing Systems --- Simulation for Estimation of Future Status by Individual Holons
Authors: Koji Iwamura, Atsushi Nakano, Yoshitaka Tanimizu, Nobuhiro Sugimura
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

This paper deals with a real-time scheduling system of the holonic manufacturing systems (HMS). In the previous papers, real-time scheduling processes based on the utility values have been proposed and applied to the HMS. A simulation based procedure has also been implemented to estimate the future status of HMS and to determine the utility values aiming at improving scheduling method. However, it was assumed that only one holon in the HMS carries out the estimation for the ease of the estimation process. A simulation based real-time scheduling method is newly proposed, in the paper, to improve the estimation process which enable all the holons to estimate the future status of the HMS. An estimation process is developed for the individual holons to estimate the future status of HMS through the simulation. Some case studies of the real-time scheduling are carried out to verify the effectiveness of the proposed method.
A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL
Authors: Martin Lange
Venue: Information Processing Letters (2008)

We provide a conceptually simple and elementary proof of the exponential succinctness gap between the two branching time temporal logics CTL^+ and CTL. It only uses CTL's small model property instead of automata- or game-theory and combinatorics as in previous proofs by Wilke and Adler/Immerman.