ppxscal/embedding_network huggingface dataset:
Coupling interaction resources: an analytical model
Authors: Joëlle Coutaz, Stanislaw Borkowski, Nicolas Barralon
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper addresses the problem of coupling interaction resources. Coupling is the action of binding two entities so that they can operate together to provide a new set of functions. For example, coupling a piece of cardboard with a steerable camera-projector pair results in a portable interactive surface. Although coupling is not a new phenomenon, recent research demonstrates that coupling opens the way to unbounded forms of interaction. Because the risk of introducing complexity is high, we propose an analytical model that can serve two purposes: the model can be used to inform the design of novel user interfaces; the computational version of the model can be used at run time as a mechanism to evaluate candidate solutions when dynamic adaptation to the context of use must be undertaken. We illustrate the contribution of the model with three chosen running examples.
Band alignment between (100)Si and Hf-based complex metal oxides
Authors: V. V. Afanas'ev, A. Stesmans, C. Zhao, M. Caymax, Z. M. Rittersma, J. W. Maes
Venue: Microelectronic Engineering (2005)

The electron energy band alignment at the interfaces of Hf-based complex oxides with (100)Si and Au is determined using internal photoemission and photoconductivity measurements. In Hf:Al and Hf:Ti oxides the cations form two subnetworks with no detectable interaction of their unoccupied electron states in the oxide conduction band. Only in the case of Hf and Ta cations with the same symmetry and principal quantum number of the unoccupied atomic orbitals, a gradual variation of the conduction band bottom energy is observed suggesting quantum mixing of Hf-and Ta-5d* states.
Privacy-Preserving Alert Correlation: A Concept Hierarchy Based Approach
Authors: Dingbang Xu, Peng Ning
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

With the increasing security threats from infrastructure attacks such as worms and distributed denial of service attacks, it is clear that the cooperation among different organizations is necessary to defend against these attacks. However, organizations' privacy concerns for the incident and security alert data require that sensitive data be sanitized before they are shared with other organizations. Such sanitization process usually has negative impacts on intrusion analysis (such as alert correlation). To balance the privacy requirements and the need for intrusion analysis, we propose a privacy-preserving alert correlation approach based on concept hierarchies. Our approach consists of two phases. The first phase is entropy guided alert sanitization, where sensitive alert attributes are generalized to high-level concepts to introduce uncertainty into the dataset with partial semantics. To balance the privacy and the usability of alert data, we propose to guide the alert sanitization process with the entropy or differential entropy of sanitized attributes. The second phase is sanitized alert correlation. We focus on defining similarity functions between sanitized attributes and building attack scenarios from sanitized alerts. Our preliminary experimental results demonstrate the effectiveness of the proposed techniques.
Optimal 3-terminal cuts and linear programming
Authors: Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
Venue: Mathematical Programming: Series A and B (2006)

Given an undirected graph G=(V,E) and three specified terminal nodes t1,t2,t3, a 3-cut is a subset A of E such that no two terminals are in the same component of G\A. If a non-negative edge weight ce is specified for each e&#x2208;E, the optimal 3-cut problem is to find a 3-cut of minimum total weight. This problem is **-hard, and in fact, is max-** -hard. An approximation algorithm having performance guarantee ** has recently been given by C&#x0103;linescu, Karloff, and Rabani. It is based on a certain linear-programming relaxation, for which it is shown that the optimal 3-cut has weight at most ** times the optimal LP value. It is proved here that ** can be improved to **, and that this is best possible. As a consequence, we obtain an approximation algorithm for the optimal 3-cut problem having performance guarantee **. In addition, we show that ** is best possible for this algorithm.
Microformats: The Next (Small) Thing on the Semantic Web?
Authors: Rohit Khare
Venue: IEEE Internet Computing (2006)

Clever application of existing XHTML elements and class attributes can make it easier to describe people, places, events, and other semistructured information in human-readable form.
Empirical investigation of the acceptance and intended use of mobile commerce: location, personal privacy and trust
Authors: Deward Wayne Bedford
Venue:  (2005)

Mobile commerce (m-commerce) has expanded the scope of service for customers and businesses, alike, enabling customers to shop any time and from any place and businesses to customize their products and services based on the current location of the customer. Consideration must be given to the implications of privacy and trust in m-commerce if utilization and mutual benefit is to be derived on a lasting basis. This research project addresses the factors involved in determining the behavioral intentions of customers toward acceptance and use of m-commerce. Specifically, the study examines the influence of trust on behavioral intent and specifies a model for the acceptance and use of m-commerce. The model developed in this study is an extension of the Unified Theory of Acceptance and Use of Technology (UTAUT) model developed by Venkatesh et al. Trust is added to the model as a determinant of behavioral intent. The research instrument consists of a 50-element questionnaire created in this research project to measure the determinants of trust and other factors related to the acceptance and use of m-commerce. Following three pretests, factor analysis reveals all constructs in the final instrument meet a minimum acceptability level of 0.6. A total of 323 business students comprise the sample pool for this study. ANOVA is used to identify differences in experience levels due to gender, age, and education level. Differences regarding individual privacy sensitivity are also measured. SEM is used to test a baseline model consisting of the components identified in the UTAUT model, which explains 82% of the total variance in m-commerce acceptance. Adding the trust factors to the baseline model increases the explanation value to 84%. Four components of trust (location disclosure, opportunistic behavior, privacy policies and unsolicited messages) are tested and found to be significant. The influence of gender, age, experience level, and privacy sensitivity on trust is accomplished by segmenting the total sample into categories for analysis. Results reveal lack of support for the moderating effect of gender and support for the moderating effect of privacy sensitivity. The moderating effects of age and experience could not be fully tested.
Collaborative Searching for Video Using the Físchlár System and a DiamondTouch Table
Authors: Alan F. Smeaton, Colum Foley, Cathal Gurrin, Hyowon Lee, Sinead McGivney
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

Fischlar-DT is one of a family of systems which support interactive searching and browsing through an archive of digital video information. Previous Fischlar systems have used a conventional screen, keyboard and mouse interface, but F´ýschlár-DT operates with using an horizontal, multiuser, touch sensitive tabletop known as a DiamondTouch. We present the Fischlar-DT system partly from a systems perspective, but mostly in terms of how its design and functionality supports collaborative searching. The contribution of the paper is thus the introduction of Fischlar-DT and a description of how design concerns for supporting collaborative search can be realised on a tabletop interface.
Sensor Grid: Integration ofWireless Sensor Networks and the Grid
Authors: Hock Beng Lim, Yong Meng Teo, Protik Mukherjee, Vinh The Lam, Weng Fai Wong, Simon See
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Wireless sensor networks have emerged as an exciting technology for a wide range of important applications that acquire and process information from the physical world. Grid computing has evolved as a standards-based approach for coordinated resource sharing. Sensor grids combine these two promising technologies by extending the grid computing paradigm to the sharing of sensor resources in wireless sensor networks. There are several issues and challenges in the design of sensor grids. In this paper, we propose a sensor grid architecture, called the Scalable Proxy-based aRchItecture for seNsor Grid (SPRING), to address these design issues. We also developed a sensor grid testbed to study the design issues of sensor grids and to improve our sensor grid architecture design.
A WBEM Based Disk Array Management Provider
Authors: Yu-an Tan, Guo-min Lin, Hong Deng, Xue-lan Zhang
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

As an enterprise resources management standard, WBEM (Web Based Enterprise Management) has been applied in many fields. In this paper, we introduce its application in storage management - SMI-S, which developed by SNIA and been wildly accepted by storage manufactures and end-users. We mainly focus on how to apply WBEM/SMI-S on developing a disk array provider. To make the legacy disk arrays management interface SMI-S compliant without significant reengineering, we design a proxy device interface to map our proprietary data model to SMI-S, and the provider supports the instance enumeration, association, method call, indication. The provider implements the required sub-profiles of the 'Array' profile defined in the SMI-S 1.0.2. It has successfully passed SNIA-Conformance Test Program (SNIA-CTP) test that indicates its conformance to SMI-S well.
Rethinking the Semantic Web, Part 1
Authors: Rob McCool
Venue: IEEE Internet Computing (2005)

This column proposes several reasons that the Semantic Web vision hasn¿t been adopted. Part two will present an alternate approach.
MAPNaS: A Lightweight, Locality-Aware Peer-to-Peer Based Name Service for MANETs
Authors: Thomas Zahn, Jochen Schiller
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Name services for mobile ad hoc networks are essential to discover and bind resources given by their name or URI to a specific network address. As there is no fixed infrastructure available in MANETs, nodes cannot rely on any DNS-like system as is taken for granted in the Internet. To keep up with the dynamicity of MANETs, a name service needs to be flexible and scalable. For this purpose, we propose MAPNaS (Mobile Ad-hoc Peerto- Peer Name Service), a lightweight and localityaware peer-to-peer based name service. MAPNaS runs on top of MADPastry [4], a general-purpose DHT substrate especially designed for MANETs. Through simulation we compare the performance of MAPNaS - both in terms of the success rate and overall network traffic - against an unstructured, broadcast-based reference approach. We will thereby demonstrate how to efficiently build a peer-to-peer based name service in mobile ad hoc networks.
Understanding oxide degradation mechanisms in ultra-thin SiO2 through high-speed, high-resolution in-situ measurements
Authors: S. Aresu, W. De Ceuninck, R. Degraeve, B. Kaczer, G. Knuyt, L. De Schepper
Venue: Microelectronic Engineering (2005)

A model is proposed and validated for the degradation mechanisms occurring in ultra-thin SiO2 at real operation conditions, based on high-resolution, high-speed in-situ measurements. This state-of-the-art set-up proves that oxide degradation still occurs at low stress conditions and allows distinguishing quantitatively the SILC-contribution from the contribution due to trapping.
Designing Graphics Programming Interfaces for Mobile Devices
Authors: Kari Pulli, Tomi Aarnio, Kimmo Roimela, Jani Vaarala
Venue: IEEE Computer Graphics and Applications (2005)

Mobile devices have evolved to a point where interactive 3D graphics is becoming feasible. The first standardized programming interfaces, OpenGL ES for native C/C++ and M3G for Java applications, are now available to hardware vendors and application developers. The interfaces are designed so that they complement rather than compete with each other, and can share the same underlying rendering engine, whether implemented in hardware or software. Mobile devices present unique challenges for real-time graphics, and mobile applications live in an environment different from the desktop. This article presents the design goals for successful mobile graphics architecture, and highlights key design decisions and nonobvious approaches taken during the standardization of these two interfaces.
Focused Community Discovery
Authors: Kirsten Hildrum, Philip S. Yu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present a new approach to community discovery. Community discovery usually partitions the graph into communities or clusters. Focused community discovery allows the searcher to specify start points of interest, and find the community of those points. Focused search allows for a much more scalable algorithm in which the time depends only on the size of the community, and not on the number of nodes in the graph, and so is scalable to arbitrarily large graphs. Furthermore, our algorithm is robust to imperfect data, such as extra or missing edges in the graph. We show the effectiveness of our algorithm using both synthetic graphs and on the real-life Livejournal friends graph, a publicly-available social network consisting of over two million users and 13 million edges.
Metal gate work function extraction using Fowler-Nordheim tunneling techniques
Authors: G. Sjöblom, L. Pantisano, T. Schram, J. Olsson, V. Afanas'ev, M. Heyns
Venue: Microelectronic Engineering (2005)

In this work, we demonstrate the advantages of using Fowler-Nordheim tunneling on degenerately doped substrates as an alternative to the capacitance-based VFB-EOT method for determining metal gate work functions. The work functions of PVD and ALD TaN on SiO2/p-Si are shown to be 4.4 and 4.8 eV respectively, which agrees well with standard internal photoemisson measurements (IPE) done on similar test capacitors. The method also detects barrier height shifts owing to the presence of interfacial ALD HfO2 as well as the effects of anneals at activation temperatures. The importance of proper measurement technique and stack preparation is also discussed.
An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors
Authors: Paolo Valente, Giuseppe Lipari
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Multiprocessors are now commonplace for efficiently achieving high computational power, even in embedded systems. A considerable research effort is being addressed to schedulability analysis of global scheduling in Symmetric Multiprocessor Platforms (SMP), where there is a global queue of ready tasks, and preemption and migration are allowed. In many soft real-time applications (as e.g. multimedia and telecommunication) a bounded lateness is often tolerated. Unfortunately, when considering priority-driven scheduling of periodic/sporadic tasks, previous results only focused on guaranteeing all deadlines, and provided worst-case utilization bounds that are lower than the maximum available computational power. In particular, until now, the existence of an upper bound on the lateness of soft real-time tasks for a fully utilized SMP was still an open problem. In this paper we do solve this problem by providing an upper bound to the lateness of periodic/sporadic tasks — with relative deadlines equal to periods/minimum inter-arrival times — scheduled by EDF on a SMP, under the only assumption that the total utilization is no higher than the total system capacity.
Monte Carlo simulation and its statistical design and analysis
Authors: Jack P. C. Kleijnen
Venue: ACM SIGSIM Simulation Digest (1974)

In this paper we shall discuss statistical aspects of the numerical technical called Monte Carlo simulation. In the present section we examine Monte Carlo simulation in general. Any solution method using random numbers (or pseudorandom numbers) we call a Monte Carlo method. As we know random numbers are stochastic variables that are uniformly distributed on the interval [0.1] and are statistically independent. On digital computers random numbers are approximated by pseudorandom numbers, i.e. numbers generated by deterministic algebraic formulas and for practical purposes considered to be purely random. Presently, the most used formula is the multiplicative congruential one, i.e. xi = a xi-1 + b (mod m) for i = 1, 2, ..., with prespecified a,b, m and x0. It is recommended to permute the resulting (pseudo) random numbers, ri = xi/m, in order to improve their statistical independence. Numerous publications on random number generation are available. For briefness' sake we mention only the bibliography (with 491 references) by Nance and Overstreet (1972): Marsaglia (1972) giving a table of recommended values for a when m = 232, 235, 236; and Lewis (1972). Transformations of random numbers can yield any other stochastic variable. For recent results, see Ahrens and Dieter (1972), Andrews et al. (1972, p. 56), Mihram (1972, p. 94--146), Nance and Overstreet (1972), Newman and Odell (1971, p. 18--52).
Decomposition of Multi-Output Functions for CPLDs
Authors: Dariusz Kania, Adam Milik, J6zef Kulisz
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

A paper presents decomposition method dedicated for PAL based CPLDs. Non-standard usage of decomposition, that leads to minimization of area in implemented circuit and reduction of used logic blocks in programmable structure is the aim of proposed method. Each decomposition step (bound set selection, graph colouring, column pattern coding, etc) is oriented for implementation in PAL-based structure that characterized by PAL-based logic block. Proposed decomposition method is an extension of classical approach commonly thought to be suflciently eflcient, Experiments that were carried out on typical benchmarks show significant area reduction.
Exploring the application of an evolutionary educational complex systems framework to teaching and learning about issues in the science and technology classroom
Authors: Susan Anne Yoon
Venue:  (2005)

Understanding the world through a complex systems lens has recently garnered a great deal of interest in many knowledge disciplines. In the educational arena, interactional studies, through their focus on understanding patterns of system behaviour including the dynamical processes and trajectories of learning, lend support for investigating how a complex systems approach can inform educational research. This study uses previously existing literature and tools for complex systems applications and seeks to extend this research base by exploring learning outcomes of a complex systems framework when applied to curriculum and instruction. It is argued that by applying the evolutionary dynamics of variation, interaction and selection, complexity may be harnessed to achieve growth in both the social and cognitive systems of the classroom. Furthermore, if the goal of education, i.e., the social system under investigation, is to teach for understanding, conceptual knowledge of the kind described in Popper's (1972; 1976) World 3, needs to evolve. Both the study of memetic processes and knowledge building pioneered by Bereiter (cf. Bereiter, 2002) draw on the World 3 notion of ideas existing as conceptual artifacts that can be investigated as products outside of the individual mind providing an educational lens from which to proceed. The curricular topic addressed is the development of an ethical understanding of the scientific and technological issues of genetic engineering. 11 grade 8 students are studied as they proceed through 40 hours of curricular instruction based on the complex systems evolutionary framework. Results demonstrate growth in both complex systems thinking and content knowledge of the topic of genetic engineering. Several memetic processes are hypothesized to have influenced how and why ideas change. Categorized by factors influencing either reflective or non-reflective selection, these processes appear to have exerted differential effects on students' abilities to think and act in complex ways at various points throughout the study. Finally, an analysis of winner and loser memes is offered that is intended to reveal information about the conceptual system&mdash;its strengths and deficiencies&mdash;that can help educators assess curricular goals and organize and construct additional educational activities.
Interpreting social science link analysis research: A theoretical framework
Authors: Mike Thelwall
Venue: Journal of the American Society for Information Science and Technology (2006)

Link analysis in various forms is now an established technique in many different subjects, reflecting the perceived importance of links and of the Web. A critical but very difficult issue is how to interpret the results of social science link analyses. It is argued that the dynamic nature of the Web, its lack of quality control, and the online proliferation of copying and imitation mean that methodologies operating within a highly positivist, quantitative framework are ineffective. Conversely, the sheer variety of the Web makes application of qualitative methodologies and pure reason very problematic to large-scale studies. Methodology triangulation is consequently advocated, in combination with a warning that the Web is incapable of giving definitive answers to large-scale link analysis research questions concerning social factors underlying link creation. Finally, it is claimed that although theoretical frameworks are appropriate for guiding research, a Theory of Link Analysis is not possible. &copy; 2006 Wiley Periodicals, Inc.
Bias Analysis in Text Classification for Highly Skewed Data
Authors: Lei Tang, Huan Liu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Feature selection is often applied to high-dimensional data as a preprocessing step in text classification. When dealing with highly skewed data, we observe that typical feature selection metrics like information gain or chi-squared are biased toward selecting features for the minor class, and the metric of bi-normal separation can select features for both minor and major classes. In this work, we investigate how these feature selection metrics impact on the performance of frequently used classifiers such as Decision Trees, Na¨ýve Bayes, and Support Vector Machines via bias analysis for highly skewed data. Three types of biases are metric bias, class bias, and classifier bias. Extensive experiments are designed to understand how these biases can be employed in concert and efficiently to achieve good classificationperformance. We report our findings and present recommended approaches to text classification based on bias analysis and the empirical study.