ppxscal/embedding_network huggingface dataset:
Proceedings of the 3rd International Conference on Tangible and Embedded Interaction
Venue: Tangible and embedded interaction (2009)

TEI'09 is the third international conference dedicated to presenting the latest results in tangible and embedded interaction, held in Cambridge, UK, on the 16th-18th of February 2009. Computing is progressively moving beyond the desktop into new physical and social contexts. One key area of innovation has been around tangible computing, which pushes the user interface beyond the digital into the physical world by means of mobile devices, graspable interfaces, physical computing, and interactive surfaces. A closely related topic is that of embedded interaction, where the everyday objects and environments we interact with are computationally augmented in new ways. Designing such systems requires interdisciplinary thinking: their creation must not only encompass software, electronics, and mechanics, but also the system's physical form and behaviour, and its social impacts. These proceedings act as an archive of the work presented at TEI'09. The work addresses HCI issues, design, user experience, tools and technologies, as well as interactive art in the broad area of tangible computing and embedded interactive systems. We believe this conference provides a unique forum for exchange and crosspollination of ideas between these fields. The high quality of the work included in these proceedings attests to the growing interest in the subject of tangible and embedded interaction, and reflects the diverse range of backgrounds of the practitioners and academics that engage and contribute to the field. Submissions and Review Process This year we received 160 submissions from all over the world --- a large number of submissions were made by individuals based in the USA, UK, Germany and Japan. All submissions were peer-reviewed and received at least three independent expert reviews. Acceptance was based on the recommendations from the peer review process. In total, 70 contributions were accepted for presentation at the conference. Out of these, 30 were selected for oral presentation; 11 as posters and 29 as exhibits and interactive demonstrations.
Semisupervised SVM batch mode active learning with applications to image retrieval
Authors: Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu
Venue: ACM Transactions on Information Systems (TOIS) (2009)

Support vector machine (SVM) active learning is one popular and successful technique for relevance feedback in content-based image retrieval (CBIR). Despite the success, conventional SVM active learning has two main drawbacks. First, the performance of SVM is usually limited by the number of labeled examples. It often suffers a poor performance for the small-sized labeled examples, which is the case in relevance feedback. Second, conventional approaches do not take into account the redundancy among examples, and could select multiple examples that are similar (or even identical). In this work, we propose a novel scheme for explicitly addressing the drawbacks. It first learns a kernel function from a mixture of labeled and unlabeled data, and therefore alleviates the problem of small-sized training data. The kernel will then be used for a batch mode active learning method to identify the most informative and diverse examples via a min-max framework. Two novel algorithms are proposed to solve the related combinatorial optimization: the first approach approximates the problem into a quadratic program, and the second solves the combinatorial optimization approximately by a greedy algorithm that exploits the merits of submodular functions. Extensive experiments with image retrieval using both natural photo images and medical images show that the proposed algorithms are significantly more effective than the state-of-the-art approaches. A demo is available at http://msm.cais.ntu.edu.sg/LSCBIR/.
Cultural dimensions for user experience: cross-country and cross-product analysis of users' cultural characteristics
Authors: Inseong Lee, Gi Woong Choi, Jinwoo Kim, Solyung Kim, Kiho Lee, Daniel Kim, Myunghee Han, Seung Yong Park, Yongil An
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

The quality of user experience is intricately related to the users' cultural characteristics. However, not many studies have dealt with important cultural characteristics which are closely related to user experience. The main goals of this study are to identify important cultural dimensions that are closely related to the user experience of consumer electronic products and to measure them in different countries with different products. Contextual inquiries and online surveys were conducted in four different countries: the United States, Germany, Russia, and Korea. The study was participated by users of four different consumer electronic products: cellular phones, MP3 players, LCD-TVs, and refrigerators. The study identified ten cultural dimensions that were important to the user experience of consumer electronics. The cultural dimensions were also found to vary across the four different countries and four different products. This paper concludes with a discussion of the study's implications and its limitations.
XSED --- XML-Based Description of Status---Event Components and Systems
Authors: Alan Dix, Jair Leite, Adrian Friday
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Most user interfaces and ubiquitous systems are built around event-based paradigms. Previous work has argued that interfaces, especially those heavily depending on context or continuous data from sensors, should also give attention to status phenomena --- that is continuously available signals and state. Focusing on both status and event phenomena has advantages in terms of adequacy of description and efficiency of execution. This paper describes a collection of XML-based specification notations (called XSED) for describing, implementing and optimising systems that take account of this dual status---event nature of the real world. These notations cover individual components, system configuration, and separated temporal annotations. Our work also presents a implementation to generate Status-Event Components that can run in a stand-alone test environment. They can also be wrapped into a Java Bean to interoperate with other software infrastructure, particularly the ECT platform.
Effective demonstration of minicomputer-based systems by a novel digital simulation
Authors: Sadashiva S. Godbole
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Minicomputer-based systems are becoming more and more popular. A typical system of this type consists of an industrial process to be controlled/monitored and a minicomputer connected to it through an interface. (See Figure 1.) Effective demonstration of such a system is often required in many instances. For example, it is required in industry during the initial phase of justification (to the management) for the manufacture of such a system. It is also required in education while teaching minicomputer-based gadgets like optimum controller, Luenberger observer, and Kalman filter. Normally this is done through the usual digital or hybrid simulation. However, the usual digital simulation, while capable of providing all the desired information, is not very appealing because it does not physically bring out the conversation type interaction between the process and the computer. This is not true in the case of a hybrid simulation of the system where the process is simulated on the analog part and the minicomputer is played by the digital part. The hybrid simulation, however, requires the availability of a hybrid computer, a fairly expensive equipment, and may or may not be easy to implement depending on the features of the particular hybrid computer facility and the availability of personnel conversant with hybrid programming. Of course, a prototype system using the actual process and the proposed minicomputer is the most direct demonstration of the system but is generally a quite costly approach. Thus there seems to be a lack of an all-digital simulation that has the same appeal as the hybrid simulation and which is interactive and conversational. Such a simulation is developed next. 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
Weak Verifiable Random Functions
Authors: Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commitment to all values of the function and can then produce, for any input x, a proof that the function has been evaluated correctly on x, preserving pseudorandomness for all other inputs. No public-key (even a falsely generated one) should allow for proving more than one value per input.VRFs are both a natural and a useful primitive, and previous works have suggested a variety of constructions and applications. Still, there are many open questions in the study of VRFs, especially their relation to more widely studied cryptographic primitives and constructing them from a wide variety of cryptographic assumptions.In this work we define a natural relaxation of VRFs that we call weak verifiable random functions, where pseudorandomness is required to hold only for randomly selected inputs. We conduct a study of weak VRFs, focusing on applications, constructions, and their relationship to other cryptographic primitives. We show: Constructions. We present constructions of weak VRFs based on a variety of assumptions, including general assumptions such as (enhanced) trapdoor permutations, as well as constructions based on specific number-theoretic assumptions such as the Diffie-Hellman assumption in bilinear groups. Separations. Verifiable random functions (both weak and standard) cannot be constructed from one-way permutations in a black-box manner. This constitutes the first result separating (standard) VRFs from any cryptographic primitive. Applications. Weak VRFs capture the essence of constructing non-interactive zero-knowledge proofs for all NP languages.
Frame layer rate control for H.264/AVC with hierarchical B-frames
Authors: Ming Li, Yilin Chang, Fuzheng Yang, Shuai Wan, Sixin Lin, Lianhuan Xiong
Venue: Image Communication (2009)

Hierarchical B-frames contribute to improvement of coding performance when introduced into H.264/AVC. However, the existing rate control schemes for H.264/AVC, which are mainly applied to IPPP and IBBP coding structures, cannot work efficiently for the coding structures with hierarchical B-frames. In this paper, a frame layer rate control scheme for hierarchical B-frames is proposed. Firstly, an adaptive starting quantization parameter (QP) determination method is implemented to derive the QP for the first coding frame based on the available channel bit rate and the content of the current video sequence. Then, the target bit budget for a group of pictures (GOP) is calculated based on the target bit rate and the buffer status. Afterwards, a temporal level (TL) layer rate control phase is introduced, and the GOP layer target bit budget is allocated to each TL. In the frame layer rate control phase, a method based on a rate-distortion model and the coding properties of the previous coded key frames is derived to determine the QP for the current key frame. For hierarchical B-frames, we introduce a typical weighting factor in the determination of their target bit budgets to address the features of the hierarchical coding structures. This weighting factor is calculated according to the target bit budget of the GOP layer and the knowledge obtained from the previous coded B-frames in each TL. Subsequently, the QP for coding the current B-frame is computed by a quadratic model with different model parameters for different TLs, and the computed QP is further adaptively adjusted according to the usage of the target bit budgets. After coding the current frame, an update stage, in which a threshold-based method is integrated to avoid model degradation, is invoked to update the parameters for rate control. Experimental results demonstrate that when the proposed rate control scheme is applied to the coding structure with hierarchical B-frames in H.264/AVC, the actual coding bit rates can match the target bit rates very well, and the encoding performance is also improved.
Automated tremor amplitude and frequency determination from power spectra
Authors: Andrej Bartolić, Mihovil Šantić, Samo Ribarič
Venue: Computer Methods and Programs in Biomedicine (2009)

Analysis of tremor amplitude and frequency is often done in frequency domain from tremor power spectra. Several methods for tremor amplitude estimation from power spectra were described but have not been systematically compared and evaluated. In addition, current methods for tremor amplitude estimation from power spectra do not correct tremor amplitude when power spectra of adjacent peaks overlap and this could contribute to an overestimation of tremor amplitude. We developed a computer application for automated analysis of tremor power spectra that corrects tremor amplitude, when power spectra of adjacent peaks overlap, with a Gauss curve fitting method. The accuracy of previously described methods and new methods for tremor amplitude estimation from power spectra was evaluated by 78 simulated power spectra and 900 tremor power spectra records of 25 patients with Parkinson's disease. Thus the influence of peak amplitude, number of peaks and degree of peak overlapping on tremor amplitude estimation could be systematically evaluated and compared. We conclude that the Gauss curve fitting method (Gauss 1) enables a more accurate estimation of tremor amplitude than previously described methods.
MDC: A Software Tool for Developing MPEG Applications
Authors: Dongge Li, Ishwar K. Sethi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper presents a modularization method for the design of MPEG decoding software. Compared to the traditional MPEG decoder architecture, the architecture obtained from the modularization method can effectively improve the flexibility and reusability of MPEG decoding software without affecting the speed performance. Using this design approach the paper presents MPEG Developing Classes (MDC), a software tool for developing MPEG video applications. The feedback from users of MDC shows that MDC is flexible in use and easy to understand. It allows users to develop their specific decoders without going into details of MPEG.
Empirical Analysis and Countermeasures Research on Corporate Credit Taking Listed Companies of Anhui Province as an Example
Authors: Malin Song
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

As the dishonesty violations of the listed companies occur from time to time, the credit risk of listed companies has become an issue related to the financial system stability. By understanding the concepts of credit and credit risk, a quantitative research has been carried out on the credit taking listed company in Anhui Province as an example on the premise of considering the availability of data. According to analysis of the company's credit system, combined with of 46 financial statements of listed companies in Anhui Province, 12 indicators are selected for analysis and ranks with the company credit. Then through the cluster analysis of listed companies, these companies will be divided into three types. As results, some conclusions have been drawn from the Empirical Analysis that being work along both effective regulation and institutional innovation is an effective solution to the problem for the way of enhancing the company credit.
Coding Scene Contents using the Image Background
Authors: Paolo Gamba, Luca Lombardi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper we propose a scene coding approach that allows to maintain the spatial relations among the individuated objects and between these objects and the background by a suitable representation of their shapes. To this aim we apply the recently introduced Boundary Integral - Resonant Mode Expansion (BI-RME) approach for shape analysis, whose characteristics is to compute the vibration modes of an elastic sheet of fixed boundary to represent an arbitrarily shaped object. We demonstrate that the BI-RME algorithm is suitable to give contemporarily and efficiently the shape representation for all the objects present in the original image. Moreover, it preserves the spatial relations by the analysis of the scene background, i.e. the part of an image left when all the meaningful objects have been extracted.
Trading-off SAT search and variable quantifications for effective unbounded model checking
Authors: G. Cabodi, P. Camurati, L. Garcia, M. Murciano, S. Nocco, S. Quer
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Interpolant-based model checking has been shown effective on large verification instances, as it efficiently combines automated abstraction and fixed-point checks. On the other hand, methods based on variable quantification have proved their ability to remove free inputs, thus projecting the search space over state variables. In this paper we propose an integrated approach combining the abstraction power of interpolation with techniques relying on AIG and/or BDD representations of states, supporting variable quantification and fixed-point checks. The underlying idea of this combination is to adopt AIG- or BDD-based quantifications to limit and restrict the search space (and the complexity) of the interpolant-based approach. The exploited strategies, individually well-known, are integrated with a new flavor, specifically designed to improve their effectiveness on large verification instances. Experimental results, oriented to hard-to-solve verification problems, show the robustness of our approach.
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Authors: J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one cycle) by reducing it to the following embedding problem: Given a planar graph G, a cycle C of G, and a partitioning of the remaining vertices of G, does there exist a planar embedding in which the induced subgraph on each vertex partite of G&thinsp;∖&thinsp;C is contained entirely inside or outside C? For the latter problem, we present an algorithm that is based on SPQR-trees and has linear running time. We also show how we can employ SPQR-trees to decide SEFE for two planar graphs where one graph has at most two cycles and the intersection is a pseudoforest in linear time. These results give rise to our hope that our SPQR-tree approach might eventually lead to a polynomial-time algorithm for deciding the general SEFE problem for two planar graphs.
Role of surface oxygen vacancies in photoluminescence of tin dioxide nanobelts
Authors: F. Trani, M. Causí, S. Lettieri, A. Setaro, D. Ninno, V. Barone, P. Maddalena
Venue: Microelectronics Journal (2009)

The role of surface oxygen vacancies in the optical properties of tin dioxide nanobelts is investigated in this paper. Using a first-principles approach, based on the density functional theory combined to a very accurate exchange correlation functional, we characterize SnO"2 (101), that is the nanobelt largest surface. We show that the presence of surface oxygen vacancies leads to the appearance of (i) occupied states located at about 1eV above the valence band and (ii) unoccupied states lying in resonance with the conduction band. Photoluminescence characterization performed on samples of SnO"2 nanobelts at low temperature shows that the basic spectral features of luminescence are in excellent agreement with theoretical predictions.
A gradient learning rule for the tempotron
Authors: Robert Urbanczik, Walter Senn
Venue: Neural Computation (2009)

We introduce a new supervised learning rule for the tempotron task: the binary classification of input spike trains by an integrate-and-fire neuron that encodes its decision by firing or not firing. The rule is based on the gradient of a cost function, is found to have enhanced performance, and does not rely on a specific reset mechanism in the integrate-and-fire neuron.
Managing feature interaction based on service broker in IP multimedia subsystem
Authors: Yu-mei Wang, Jian Qin, Rong-jun Li, Jia-Jia Wen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

It is generally accepted that the IP Multimedia Subsystem (IMS) based platform is the development trend of service platform for fixed and mobile convergence. With a variety of multimedia services provided flexibly by IMS, feature interaction between different sessions may appear. In this paper, we propose a mechanism to detect and resolve feature interaction occurred between different sessions that are used simultaneously by one user. The main idea is to add a Session Feature Comparison Module (SeFeCoM) containing a Session Feature Description List (SeFeDeL) and the corresponding processing logic to Service Broker that is under standardization by 3GPP (3rd Generation Partnership Project). With SeFeDeL, all information relating to the services currently provided can be recorded and then used by the processing logic to detect feature interaction between different sessions. The example of feature interaction detection and resolution rules contained in the processing logic is given to show how to resolve those interactions. The use case as well as the algorithm for the mechanism is also given to elaborate how the mechanism works
Iterative algorithm for optimal fiducials under weak perspective projection
Authors: Alfred M. Bruckstein, Robert J. Holt, Arun N. Netravali
Venue: International Journal of Imaging Systems and Technology (2009)

In previous work, we designed space fiducials with the aim of making camera pose determination as noise-insensitive as possible. These fiducials turned out to be sets of points that formed concentric regular polyhedra. Here, we apply an idea of Dementhon and Davis and test and analyze an iterative linear algorithm in conjunction with our optimal fiducials to increase the accuracy of the computed camera pose. We also analyze under what circumstances this iterative algorithm is guaranteed to converge to the correct solution. Comprehensive computer simulations illustrate the behavior of the algorithm and the degree of improvement in pose determination in case of convergence. &copy; 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 27&ndash;36, 2009