ppxscal/embedding_network huggingface dataset:
Designing for spatial competence
Authors: Susanne Seitinger
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

Child-computer interaction designers are increasingly concerned with developing technologies that support and encourage physical activity in children in everyday indoor and outdoor settings. This trend mirrors commercial developments towards so-called exertion interfaces like the Nintendo&reg;Wii&trade; that require full-body engagement. Physical health benefits aside, these types of interfaces present an important and underexplored design opportunity because they also engage children's spatial cognitive abilities. Can we harness this potential and design interfaces that support the development of spatial competence in children? To explore this question, the paper describes some of the cognitive and neural underpinnings of spatial competence as they relate to interaction design for children. With this background, I explore five interaction design examples: taking multiple perspectives on the environment, zooming in and out, estimating distances, experiencing motion, and encountering rich visual cues. These examples provide a starting point for new directions in designing exertion interfaces and ubiquitous computing interfaces for children that support different aspects of spatial cognitive development.
Plenary lecture 1: EHDMR based bound analysis methods in multivariate interpolation problems
Authors: M. Alper Tunga
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

If a multivariate data set is given to specify a multivariate function and it is asked to determine an analytical structure for the sought multivariate function, instead of using standard interpolation methods, given multivariate data can be partitioned into low-variate data and then an analytical structure is determined with the aid of these partitioned data. However, the given data is collected or produced by some devices or means which may cause unavoidable errors. This results in an uncertainty interval for each datum. The errors in data may come from their construction because of the incapabilities or limited capabilities of the devices, tools, and/or algorithms used to construct data. This implies that each component of data is reliable only within an interval which contains the data value. If the length of the interval is assumed to be sufficiently small to enable us to approximate the differentiation operator with corresponding order difference operator then we may proceed to make an error analysis which reveals how the errors propagate. The main purpose here is to determine the analytical structure of a multivariate function when a data set including measurement or construction errors is given. In this case, not a unique structure but a band structure with a presumably small thickness will be obtained for the multivariate function in accordance with the given data set and the given error ratios for this data set. In this lecture, Interval GHDMR, Interval FHDMR and Interval HHDMR methods are given to explain one way of obtaining these abovementioned band structures for the given multivariate interpolation problems in which the errors in data occur.
First Principle Study of the Anti--- and Syn---Conformers of Thiophene---2---Carbonyl Fluoride and Selenophene---2---Carbonyl Fluoride in the Gas and Solution Phases
Authors: Hassan H. Abdallah, Ponnadurai Ramasami
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The anti- and syn-conformers of thiophene-2-carbonyl fluoride (A) and selenophene-2-carbonyl fluoride (B) have been studied in the gas phase. The transition states have also been obtained for the interconversion of the anti- and syn-conformers. The methods used are MP2 and DFT/B3LYP and the basis sets used for all atoms are 6-311++G(d,p). The optimized geometries, dipole moments, moment of inertia, energies, energy differences and rotational barriers are reported. This study has been extended to include solvent effect. Some of the vibrational frequencies of the conformers are reported with appropriate assignments. The results indicate that in the gas phase the syn conformer is more stable and the CCSD(T)//MP2 energy differences are 2.97 kJ/mol (A) and 3.02 kJ/mol (B) and barriers of rotation are 38.50 kJ/mol (A) and 36.89 kJ/mol (B). The structures and vibrational frequencies of (A) and (B) are not much affected by the solvents but the more polar conformer gets more stabilized. The major effect of the solvents is that energy difference decreases but rotational barrier increases. The peculiar characteristic of fluorine affecting conformational preference is not observed.
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
Authors: Stephen L. Olivier, Jan F. Prins
Venue: Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism (2009)

The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of an irregular and unpredictable search space, as arises e.g. in combinatorial optimization problems. As such UTS presents a highly unbalanced task graph that challenges scheduling, load balancing, termination detection, and task coarsening strategies. Scalability and overheads are compared for OpenMP 3.0, Cilk, and an OpenMP implementation of the benchmark without tasks that performs all scheduling, load balancing, and termination detection explicitly. Current OpenMP 3.0 implementations generally exhibit poor behavior on the UTS benchmark.
Semantics for Containment Belief Revision in the Case of Consistent Complete Theories
Authors: Omar Doukari
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

In this paper, we provide system of spheres semantics for the containment property. First, we extend Parikh's relevance-sensitive model for belief revision by generalizing the idea of a containment property of an inconsistency which is defined in a spatial context and defining a new model for belief representation and local Belief revision. Second, we identify two possible versions of the containment property, namely the strong and the weak versions. Finally, having Grove's system of spheres construction as a base, we consider additional constraints on measuring distance between possible worlds, and we prove that these constraints characterize precisely the containment property in the case of consistent complete theories. The containment property limits the effects of quality which means that an inconsistency cannot have an infinite influence on other information, but in an “area of local effect” which depends on the nature of data. For example, in meteorology, the effect is limited to a continental scale. It also depends on the structure or topology of information and the constraints defined on this structure.
New insights into the OCST problem: integrating node degrees and their location in the graph
Authors: Wolfgang Steitz, Franz Rothlauf
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

This paper considers the Euclidean variant of the optimal communciation spanning tree (OCST) problem. Researches have analyzed the structure of the problem and found that high quality solutions prefer edges of low cost. Further, edges pointing to the center of the network are more likely to be included in good solutions. We add to the literature and provide additional insights into the structure of the OCST problem. Therefore, we investigate properies of the whole tree, such as node degrees and the Wiener index. The results reveal that optimal solutions are structured in a star-like manner. There are few nodes with high node degrees, these nodes are located next to the graph's center. The majority of the nodes have very low node degrees. Especially, nodes with degree one are very common and located far away of the center. We exploit these insights to develop a construction heuristic, which builds spanning trees with similar properties. Experiments indicate a high solution quality for the OCST problem. In a next step, we seed the initial population of an evolutionary algorithm (EA) with solutions constructed with our method. An experimental study demonstrates the merits of using a biased initialization: the algorithm is faster, better compared to the same algorithm using random starting solutions.
An X-ray on web-available XML schemas
Authors: Alberto H.F. Laender, Mirella M. Moro, Cristiano Nascimento, Patrícia Martins
Venue: ACM SIGMOD Record (2009)

XML has conquered its place as the most used standard for representing Web data. An XML schema may be employed for similar purposes of those from database schemas. There are different languages to write an XML schema, such as DTD and XSD. In this paper, we provide a general view, an X-Ray, on Web-available XSD files by identifying which XSD constructs are more and less frequently used. Furthermore, we provide an evolution perspective, showing results from XSD files collected in 2005 and 2008. Hence, we can also draw some conclusions on what trends seem to exist in XSD usage. The results of such study provide relevant information for developers of XML applications, tools and algorithms in which the schema has a distinguished role.
Plenary lecture XII: the risk of modeling biomedical physics
Authors: Calin I. Ciufudean
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Thinking of the risk analysis of modeling biomedical physics (BP's) from a probabilistic perspective, leads to the conclusion that probability is a measure of expressing uncertainty about the process seen through the point of view of the assessor (i.e. the controller of the process), and based on some background information and knowledge that we have at the time we quantify our uncertainty. A distinction between objective, real risk, and perceived risk cannot be made. Risk is primarily a judgment, not a fact. As risk expresses uncertainty about the process outcomes, risk perception has a role to play to guide the decision of the controller. A number of different types of models are used in risk analysis. These include both quantity-oriented models and event oriented models. It is difficult to give a detailed specification of what a satisfactory model is. How accurate must a model be in order to be considered satisfactory? One may say that a necessary requirement for a risk model is that any improvement in the model to make it more accurate, as judged by the controller, should not lead to a change in the conclusions considered. Also, when analyzing BP's performance, human and organizational factors need to be taken into account. For instance, the conventional reliability analysis is based on the premise that increasing the reliability of a system will decrease the losses from failures; but an inappropriate increase of the reliability of the system may determine the risk of a simultaneous increase of the losses from the failure. In order to avoid these situations, an efficient discrete-event simulation model has been proposed for modeling the immune system of mammalians.
More Windows Vista for Seniors: Customizing and Managing Your Computer
Authors: Studio Visual Steps
Venue:  (2007)

Written specifically for seniors who want to manage their own computers, thisguide explainshow Windows Vista can be configured to an individual's own preferences and teaches the beginner how to navigate through this sometimes intimidating new technology.Various lessons include how to protecta computer with Windows Security Center andset up passwords, as well ashow to burn data CDs andcreate backups.Full of helpful screenshots and a convenient reference section, this large-print, easy-to-read guide will help those with little or no technical background begin to understand all that can beachieved with Windows Vista. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A novel analysis (I -KAZ 3D) for three axial vibration signal in bearing condition monitoring
Authors: N. Z. Nuawi, S. Abdullah, A. R. Ismail, N. F. Kamaruddin
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The purpose of this study is to present a novel analysis, I-kaz 3D for three axial vibration signal in bearing condition monitoring. The performance of the I-kaz 3D and coefficient of I-kaz 3D are tested during the experiment. I-kaz 3D was developed in order to measure the degree of scattering for three axial signal and I-kaz 3D coefficient played an important role in clustering process with the parameters of statistical analysis. Y-bearing is used in the research. Two main kinds of defects, outer ring's defect and roller's defect are designed to test the performance of I-kaz 3D. In the experiment, three single axial accelerometers are mounted to the housing of Y-bearing in the direction of axial, vertical and horizontal vibration. Each axis of I-kaz 3D represents the signal from these direction. A four channel analyzer, Yokogawa is used in the acquisition of signal. The reliability of I-kaz 3D has been evaluated by observing the difference of I-kaz 3D coefficient and also the degree of scattering for healthy bearing and defect bearing. The results show that the I-kaz 3D and I-kaz 3D coefficient are very effective in bearing condition monitoring even that the defects are very weak. This finding may be useful in bearing condition monitoring especially for the weak defects to prevent the catastrophic failure.
Integrating preservation functions into the web server
Authors: Michael L. Nelson
Venue:  (2008)

Digital preservation of the World Wide Web poses unique challenges, different from the preservation issues facing professional Digital Libraries. The complete list of a website's resources cannot be cited with confidence, and the HyperText Transfer Protocol (HTTP) provides a bare minimum of metadata with each resource transfer&mdash;HTTP is optimized for access today rather than tomorrow. In short, the Web suffers from a counting problem and a representation problem. Refreshing the bits, migrating from an obsolete file format to a newer format, and other classic digital preservation problems also affect the Web. As digital collections devise solutions to these problems, the Web will also benefit. But the core World Wide Web problems of Counting and Representation need a targeted solution. As the host of web content, the web server is uniquely positioned to assist in the preservation of the resources it serves. It recognizes the resources it has, and knows what kind of resources they are. This dissertation presents research in which preservation functions have been integrated into the web server itself to produce archive-ready versions of the website's resources. The proposed approach addresses the Counting Problem through the use of Sitemaps, created from a combination of crawling, Sitemap tools, and log analysis. The Representation Problem is addressed by a preservation-preparation module installed on the web server. The module enables each resource to be packaged together with the output from a variety of relevant metadata utilities, creating the aforementioned archive-ready version of the resource. The CRATE Model defines a simple XML structure for the creation and delivery of such resources. A series of experiments which evaluated CRATE, Sitemaps, and extemporaneous metadata analysis of resources are presented, along with a technical review of the MODOAI web server module which acts as the preservation agent. The feasibility of this approach is demonstrated by a quantitative analysis of its use in a commercial web testing environment.
The impact of frustration-mitigating messages delivered by an interface agent
Authors: Amy L. Baylor, Daniel Warren, Sanghoon Park, E. Shen, Roberto Perez
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Mitigating frustration is important within computer-based learning contexts. In this experimental study where participants were purposefully frustrated, the interface agent message (apologetic, empathetic, or silent) was manipulated to investigate its impact on student attitude toward the task, attitude toward the agent, and attribution toward the cause of frustration. Fifty-seven undergraduate students responded to an invitation to participate in a web-based survey and to receive a movie ticket for their effort. An animated interface agent, “Survey Sam,” was present as students answered survey items and were confronted with a frustrating obstacle --an error message pop-up window that blocked them from answering the survey items. Survey Sam delivered either an affective message (apologetic or empathetic) or remained silent to the thirty students who actually completed the survey. Results revealed that the presence of an affective message (either apologetic or empathetic) led participants to report significantly greater frustration, suggesting that the affective message reinforced and validated their frustration. However, and more importantly, they attributed the cause of their frustration to the program instead of to themselves (as did the no message group). A comparison of message type (apologetic or empathetic) indicated that participants receiving the empathetic message rated Survey Sam as significantly more believable and sincere. Implications of these findings as a catalyst for further research in the development of frustration-mitigating support for computer-based contexts are discussed.
Towards efficient mining of proportional fault-tolerant frequent itemsets
Authors: Ardian Kristanto Poernomo, Vivekanand Gopalkrishnan
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Fault-tolerant frequent itemsets (FTFI) are variants of frequent itemsets for representing and discovering generalized knowledge. However, despite growing interest in this field, no previous approach mines proportional FTFIs with their exact support (FT-support). This problem is difficult because of two concerns: (a) non anti-monotonic property of FT-support when relaxation is proportional, and (b) difficulty in computing FT-support. Previous efforts on this problem either simplify the general problem by adding constraints, or provide approximate solutions without any error guarantees. In this paper, we address these concerns in the general FTFI mining problem. We limit the search space by providing provably correct anti monotone bounds for FT-support and develop practically efficient means of achieving them. Besides, we also provide an efficient and exact FT-support counting procedure. Extensive experiments using real datasets validate that our solution is reasonably efficient for completely mining FTFIs. Implementations for the algorithms are available from www.cais.ntu.edu.sg/~vivek/pubs/ftfim09.
PLR: A Software Approach to Transient Fault Tolerance for Multicore Architectures
Authors: Alex Shye, Joseph Blomstedt, Tipp Moseley, Vijay Janapa Reddi, Daniel A. Connors
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Transient faults are emerging as a critical concern in the reliability of general-purpose microprocessors. As architectural trends point toward multicore designs, there is substantial interest in adapting such parallel hardware resources for transient fault tolerance. This paper presents process-level redundancy (PLR), a software technique for transient fault tolerance, which leverages multiple cores for low overhead. PLR creates a set of redundant processes per application process and systematically compares the processes to guarantee correct execution. Redundancy at the process level allows the operating system to freely schedule the processes across all available hardware resources. PLR uses a software-centric approach to transient fault tolerance, which shifts the focus from ensuring correct hardware execution to ensuring correct software execution. As a result, many benign faults that do not propagate to affect program correctness can be safely ignored. A real prototype is presented that is designed to be transparent to the application and can run on general-purpose single-threaded programs without modifications to the program, operating system, or underlying hardware. The system is evaluated for fault coverage and performance on a four-way SMP machine and provides improved performance over existing software transient fault tolerance techniques with a 16.9 percent overhead for fault detection on a set of optimized SPEC2000 binaries.
Mask Particle Filter for Similar Objects Tracking
Authors: Huaping Liu, Fuchun Sun, Meng Gao
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Tracking appearance similar objects is very challenging. Conventional approaches often encounter "hijack" problem. That is to say, the tracking results for the smaller objects will be attracted to the larger one in the close vicinity. In this paper, we propose a decentralized particle filter approach for similar objects tracking. When the objects are close, the tracking results for the larger one will be masked and its influence will be eliminated. In principle, the tracker for the smaller object needs to be run two times, which increase the time costs. To tackle this, we construct the integral image for the mask region and dramatically decrease the calculation time of the evaluation of likelihood functions in the masked image. Experimental results show that the proposed approach effectively avoids "hijack" problems.
Text segmentation with LDA-based Fisher kernel
Authors: Qi Sun, Runxin Li, Dingsheng Luo, Xihong Wu
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

In this paper we propose a domain-independent text segmentation method, which consists of three components. Latent Dirichlet allocation (LDA) is employed to compute words semantic distribution, and we measure semantic similarity by the Fisher kernel. Finally global best segmentation is achieved by dynamic programming. Experiments on Chinese data sets with the technique show it can be effective. Introducing latent semantic information, our algorithm is robust on irregular-sized segments.
Epipolar Angular Factorisation of Essential Matrix for Camera Pose Calibration
Authors: Władysław Skarbek, Michał Tomaszewski
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

A novel epipolar angular representation for camera pose is introduced. It leads to a factorisation of the pose rotation matrix into three canonical rotations: around the dual epipole for the second camera, around the z axis, and around the dual epipole for the first camera. If the rotation around the z axis is increased by 90° and followed by the orthogonal projection on xy plane then the factorisation of essential matrix is produced. The proposed five parameter representation of the essential matrix is minimal. It exhibits the fast convergence in LMM optimization algorithm used for camera pose calibration. In such parametrisation the constraints based on the distance to the epipolar plane appeared slightly more accurate than constraints based on the distance to the epipolar line.