ppxscal/embedding_network huggingface dataset:
Management of Multiple Cards in NFC-Devices
Authors: Gerald Madlmayr, Oliver Dillinger, Josef Langer, Josef Scharinger
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

Near Field Communication (NFC) currently is one of the most promising technologies in handsets for contactless applications like ticketing or payment. These applications require a secure store for keeping sensitive data. Combining NFC with integrated smartcard chips in a mobile device allows the emulation of different cards. Representing each secure element with different UIDs poses several problems. Thus we propose an approach with a fixed UID dedicated to a Secure Element Controller (SEC). This approach allows an optimized backwards compatibility to already established reader infrastructures but also the communication in peer-to-peer mode with other NFC devices. Additionally the communication over peer-to-peer as well as the internal mode of secure elements at the same time is possible. This is approach poses a flexible alternative to the implementations proposed so far. In addition when there are to multiple, removable secure elements in a device it is ensured that the secure elements are only used by authorized user/devices. The SEC in this case handles the communication between the secure elements as well as their authentication.
Modeling time-varying uncertain situations using Dynamic Influence Nets
Authors: Sajjad Haider, Alexander H. Levis
Venue: International Journal of Approximate Reasoning (2008)

This paper enhances the Timed Influence Nets (TIN) based formalism to model uncertainty in dynamic situations. The enhancements enable a system modeler to specify persistence and time-varying influences in a dynamic situation that the existing TIN fails to capture. The new class of models is named Dynamic Influence Nets (DIN). Both TIN and DIN provide an alternative easy-to-read and compact representation to several time-based probabilistic reasoning paradigms including Dynamic Bayesian Networks. The Influence Net (IN) based approach has its origin in the Discrete Event Systems modeling. The time delays on arcs and nodes represent the communication and processing delays, respectively, while the changes in the probability of an event at different time instants capture the uncertainty associated with the occurrence of the event over a period of time.
An Area-Efficient Interpolator Applied in Audio Σ Δ DAC
Authors: Binming Luo, Yuanfu Zhao, Zongmin Wang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

An area-efficient 128× interpolation filter (IF) used in audio digital-to-analog converter (DAC) is presented in this paper. The digital interpolation filter consists of cascaded half band filter (HBF) which is followed by a 32×digital sample-and-hold (S/H) circuit. Optimization is also performed so that the filter requires no multipliers, with the registers in the filter decreasing by a half. No multiplier requirement and limited storage demand make it an economical alternative to the conventional implementation for audio application. The result shows that the interpolator achieves 66dB stop-band rejection and 0.008dB pass-band ripple when the coefficients are truncated to 16bit. The filter architecture proposed in this paper for the implementation of an area-efficient interpolator has been used in a 24-bit 96-KHz stereo DAC and is fully functional.
A Theory of Change for Attributed Spatial Entities
Authors: John Stell, Michael Worboys
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

New methods of data collection, in particular the wide range of sensors and sensor networks that are being constructed, with the ability to collect real-time data streams, provide a driver for an appropriate underlying theory for information related to dynamic geographic phenomena. This paper investigates the underlying processes by which entities with both spatial and aspatial components may evolve and change through time, and how the spatial and aspatial dimensions participate separately and together in such an evolution. The overall structure that we propose is that of attributed locations in space-time. After motivation and a survey of relevant background work, the paper introduces a formal framework and presents a case study that applies it to a detailed example. The focus is the impact of spatial change on attribute change, but also considered is the converse process. We conclude by discussing the relevance of this work to the extraction of dynamic objects and their changes from sequences of temporal snapshots of static scenes.
Swiss Experiment: from wireless sensor networks to e-science
Authors: Karl Aberer
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

The emergence of novel sensing devices and sensor network technologies provides a whole new opportunity for global environmental studies and environment-related decision making. The Swiss Experiment is a newly initiated multidisciplinary project aimed at building a large scale platform, to support field investigations of environmental processes, which is based on new sensor and data management technology. In this talk we will first give an overview of the environmental problems being addressed in the Swiss Experiment and identify opportunities of supporting environmental scientists by recent advances in communications and information systems. We will discuss in particular our approach to support data and information management throughout experimental campaigns. This includes support for distributed data stream management based on Global Sensor Networks, for data warehousing and analysis, for map-based visualizations developed in collaboration with Microsoft's SensorMap team and for information sharing using a WIKI-based and semantics-enabled platform. We will demonstrate our initial results and identify some future challenges towards developing a truly comprehensive information management support for environmental sciences.
DVSMT: Dynamic Voltage Scaling for Scheduling Mixed Real-Time Tasks
Authors: Min-Sik Gong, Myoung-Jo Jung, Yong-Hee Kim, Moon-Haeng Cho, Joo-Man Kim, Cheol-Hoon Lee
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we address a power-aware scheduling algorithm for mixed real-time tasks. A mixed-task system consists of periodic and sporadic tasks, each of which is characterized by its worst-case execution requirements and a deadline. We propose a dynamic voltage scaling algorithm called DVSMT, which dynamically scales down the supplying voltage (and thus the operating frequency) using on-line slack distribution when jobs complete earlier while still meeting their deadlines. Simulation results show that DVSMT saves up to 60% more than the existing algorithms both in the periodic and mixed task systems.
Mining Bug Classifier and Debug Strategy Association Rules for Web-Based Applications
Authors: Lian Yu, Changzhu Kong, Lei Xu, Jingtao Zhao, Huihui Zhang
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

The paper uses data mining approaches to classify bug types and excavate debug strategy association rules for Web-based applications. Chi-square algorithm is used to extract bug features, and SVM to model bug classifier achieving more than 70% predication accuracy on average. Debug strategy association rules accumulate bug fixing knowledge and experiences regarding to typical bug types, and can be applied repeatedly, thus improving the bug fixing efficiency. With 575 training data, three debug strategy association rules are unearthed.
Realization of Neural Network Inverse System with PLC in Variable Frequency Speed-Regulating System
Authors: Guohai Liu, Fuliang Wang, Yue Shen, Huawei Zhou, Hongping Jia, Mei Kang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The variable frequency speed-regulating system which consists of an induction motor and a general inverter, and controlled by PLC is widely used in industrial field. However, for the multivariable, nonlinear and strongly coupled induction motor, the control performance is not good enough to meet the needs of speed-regulating. The mathematic model of the variable frequency speed-regulating system in vector control mode is presented and its reversibility has been proved. By constructing a neural network inverse system and combining it with the variable frequency speed-regulating system, a pseudo-linear system is completed, and then a linear close-loop adjustor is designed to get high performance. Using PLC, a neural network inverse system can be realized in actural system. The results of experiments have shown that the performances of variable frequency speed-regulating system can be improved greatly and the practicability of neural network inverse control was testified.
Examining presence and lightweight messaging in a social television experience
Authors: Crysta Metcalf, Gunnar Harboe, Joe Tullio, Noel Massey, Guy Romano, Elaine M. Huang, Frank Bentley
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

We report on a field evaluation of a prototype social television system (Social TV) that incorporates lightweight messaging as well as ambient awareness of user presence on the system. This evaluation was conducted over a two-week period and involved the participation of ten households. Participants appreciated the ability to see their buddies' presence on the system, the ability to see or suggest the programs they were currently watching, and the ability to send short messages to one another. The presence facilities available in Social TV also allowed participants to learn more about one another's TV viewing habits and preferences, and fostered a sense of connectedness between them. However, they also felt constrained by the limitations of the communication options available to them and demanded free-form text or voice chat to be able to fully express themselves.
Recognizing Individual Typing Patterns
Authors: Michał Choraś, Piotr Mroczkowski
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

In the article three methods of extracting individual typing patterns are proposed and tested. Moreover, we present satisfactory experimental results confirming that these typing patterns may be used as biometrics for human identification, especially in web-based applications (e.g. password hardening).
Path splicing
Authors: Murtaza Motiwala, Megan Elmore, Nick Feamster, Santosh Vempala
Venue: ACM SIGCOMM Computer Communication Review (2008)

We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees ("slices") to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change the path on which traffic is forwarded by changing a small number of additional bits in the packet header. We evaluate path splicing for intradomain routing using slices generated from perturbed link weights and find that splicing achieves reliability that approaches the best possible using a small number of slices, for only a small increase in latency and no adverse effects on traffic in the network. In the case of interdomain routing, where splicing derives multiple trees from edges in alternate backup routes, path splicing achieves near-optimal reliability and can provide significant benefits even when only a fraction of ASes deploy it. We also describe several other applications of path splicing, as well as various possible deployment paths.
Supervisors' perceptions on using course management software during business education student teaching experiences
Authors: Elaine Guerrazzi
Venue:  (2008)

Advances in technology and learning theory have significantly changed the landscape in higher education. These changes also impact the preparation of teachers and the supervision of student teachers. The purpose of this study was to understand the perceptions of business education university supervisors at National Association of Business Teacher Education (NABTE) Institutions regarding the use of course management software in the supervision of business student teachers. The study also aimed to provide a description of how and to what extent course management software is currently being used in the supervision of business education student teachers at NABTE Institutions. A Web-based questionnaire was used to collect data from university supervisors of business student teachers at NABTE Institutions throughout the United States. The questionnaire contained both closed and open-ended questions. Open-ended questions were analyzed using a content analysis approach to find reoccurring themes and close-ended questions were analyzed using descriptive statistics. Thirty-six business education university supervisors at NABTE Institutions responded to the questionnaire. Ten of the 36 university supervisors reported using course management software in their supervision practices. The most used features of course management software were announcements, dropbox, and e-mail features. University supervisors using course management software do so most often to communicate with student teachers and collect information. Overall, 73.3% of respondents to the questionnaire felt that they have administrative support for new and innovative methods in the supervision of student teachers; yet, an analysis of the open-ended comments demonstrates that gaining support is complicated and may have conditional elements. An analysis of the data is inconclusive about overall support for using course management software as a whole, but the majority of business education university supervisors have not yet ruled out the use of course management software in the future. A need exists to conduct additional research on course management software and student teacher supervision. The benefits and value of using course management software in relationship to learning theory and best practices in student teacher supervision must be examined.
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
Authors: Paul Bonsma, Frederic Dorn
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

An out-tree T of a directed graph D is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By ¿(D) and ¿ s (D) we denote the maximum number of leaves over all out-trees and out-branchings of D, respectively. We give fixed parameter tractable algorithms for deciding whether ¿ s (D) ¿ k and whether ¿(D) ¿ k for a digraph D on n vertices, both with time complexity 2 O(klogk) ·n O(1). This proves the problem for out-branchings to be in FPT, and improves on the previous complexity of $2^{O(k\log^2 k)} \cdot n^{O(1)}$ for out-trees. To obtain the algorithm for out-branchings, we prove that when all arcs of D are part of at least one out-branching, ¿ s (D) ¿ ¿(D)/3. The second bound we prove states that for strongly connected digraphs D with minimum in-degree 3, $\ell_s(D)\geq \Theta(\sqrt{n})$, where previously $\ell_s(D)\geq \Theta(\sqrt[3]{n})$ was the best known bound. This bound is tight, and also holds for the larger class of digraphs with minimum in-degree 3 in which every arc is part of at least one out-branching.
Interaction-Based Design for Mobile Collaborative-Learning Software
Authors: María Ester Lagos, Rosa Alarcón, Miguel Nussbaum, Francisca Capponi
Venue: IEEE Software (2007)

The main difficulties in designing collaborative-learning applications are understanding which interactions between learners and teachers are the appropriate ones and then building software that takes such dynamics into account. Some researchers address this challenge by defining reusable components for specific learning tasks. The problems are that developers impose their particular solution, adapting components to requirement changes requires much effort, developers might lack the expertise to identify the appropriate group dynamics, and the resulting software might be used in unexpected ways. An approach based on an interaction model lets designers and educational experts specify the interactions in a learning activity. They can then define a set of reusable interaction components. The resulting flexible model is the basis for a flexible architecture that lets you create, extend, reuse, and compose diverse educational software products.
AIS Based Distributed Wireless Sensor Network for Mobile Search and Rescue Robot Tracking
Authors: Albert Ko, Henry Y. Lau, Nicole M. Lee
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

The General Suppression Control Framework (GSCF) is a framework inspired by the suppression hypothesis of the immune discrimination theory. The framework consists of five distinct components, the Affinity Evaluator, Cell Differentiator, Cell Reactor, Suppression Modulator, and the Local Environment. These reactive components, each responsible for a specific function, can generate long-term and short-term influences to other components by the use of humoral and cellular signals.This paper presents the design and application of a GSCF based distributed wireless sensor network prototyping system for tracking mobile search and rescue robots. The main objective of this physical prototyping system is to demonstrate the possibility of applying advanced Zigbee sensors to form a network that can locate a small group of mobile robots within the wireless sensor network. Another important objective of the prototyping system presented is to identify potential technological constraints in the physical system. Referencing to the result obtained, future research can be formulated and realistic simulation environment can be developed.
Generating Mutiresolution Models for Deforming Surfaces Based on Shape Feature Analysis
Authors: Shixue Zhang, Enhua Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

In computer graphics, investigation has been made in many years in mesh simplification to alleviate the workload of visualization processing. However, most of the simplification algorithms proposed focus on static meshes, and very little works are to deal with deforming surfaces. In this paper, we propose a novel method for generating progressive multiresolution models of deforming surfaces base on shape feature analysis. By the method we first use the curvature and torsion to analysis the shape feature of the original model, then use the famous QEM method as our basic edge contraction metric to generate a base hierarchy. The sequence of the simplified models is generated progressively from frame to frame. Based on the edge collapse sequence in the previous frame, edge contraction order is adjusted according to the deformation degree in the current frame. We demonstrate that our method works efficiently and can generate better approximations with well-preserved features than previous methods.
Exploiting Decomposition in Constraint Optimization Problems
Authors: Matthew Kitching, Fahiem Bacchus
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch and bound techniques. In this paper we present a new search algorithm that can obtain many of the computational benefits of decomposition without having to resort to separate recursions. That is, the algorithm explores a standard OR tree not an AND-OR tree. In this way incremental information gathered from any component can be immediately applied to improve the bounding information for all of the other components. We also discuss how caching and local propagation can be combined with our approach and finally test our methods empirically to verify their potential.
Topology in Fuzzy Class Theory: Basic Notions
Authors: Libor Běhounek, Tomáš Kroupa
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In the formal and fully graded setting of Fuzzy Class Theory (or higher-order fuzzy logic) we make an initial investigation into basic notions of fuzzy topology. In particular we study graded notions of fuzzy topology regarded as a fuzzy system of open or closed fuzzy sets and as a fuzzy system of fuzzy neighborhoods. We show their basic graded properties and mutual relationships provable in Fuzzy Class Theory and give some links to the traditional notions of fuzzy topology.
Comparison of steady-state methods computing Markov modulated fluid models
Authors: Wassim Abbessi, Hédi Nabli
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

The Markov-modulated fluid models (MMFM) are widely used in networks modeling. They assimilate the network traffic to a fluid generated by sources at a rate controlled by a background Markov process. Bursts of data are considered as continuous fluid flows and variations of cell inter-arrival times are assumed too small compared with the burst times for traffic evolving periodically in different timescales.
On defuzzyfication functionals in fuzzy number calculus
Authors: Witold Kosinski
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

Ordered fuzzy numbers (OFN) form a generalization of classical convex fuzzy numbers, for which membership functions may not exist; however, they posssess oriented membership curves.The generalized concept of a fuzzy number, namely OFN, appears as an ordered pair of continuous real functions defined on the interval [0, 1]. New class of defuzzyfication functionals is introduced within the concept of ordered fuzzy numbers. With the help of the variational calculus next defuzzyfication functionals can be obtained.
A Hybrid Method of User Identification with Use Independent Speech and Facial Asymmetry
Authors: Mariusz Kubanek, Szymon Rydzek
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Speaker identification is the process of identifying an unknown speaker from a set of known speakers. In a speaker identification or verification, the prime interest is not in recognizing the words but determining who is speaking the words. In systems of speaker identification, a test of signal from an unknown speaker is compared to all known speaker signals in the set. The signal that has the maximum probability is identified as the unknown speaker. In security systems based on speaker identification, faultless identification has huge meaning for safety.In aim of increasing safety, in this work it was proposed own approach to user identification, based on independent speech and facial asymmetry. Extraction of the audio features of person's speech is done using mechanism of cepstral speech analysis.The part of the work that deals with face recognition was based on the technique of automatic authentication of a person with assumption that the use of automatically extracted, structural characteristics of the face asymmetry (in particular within the eyes and mouth regions as the most informative parts of the face) leads to improvement of the biometrical authentication systems.Finally, the paper will show results of user identification.