ppxscal/embedding_network huggingface dataset:
Designable visual markers
Authors: Enrico Costanza, Jeffrey Huang
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Visual markers are graphic symbols designed to be easily recognised by machines. They are traditionally used to track goods, but there is increasing interest in their application to mobile HCI. By scanning a visual marker through a camera phone users can retrieve localised information and access mobile services. One missed opportunity in current visual marker systems is that the markers themselves cannot be visually designed, they are not expressive to humans, and thus fail to convey information before being scanned. This paper provides an overview of d-touch, an open source system that allows users to create their own markers, controlling their aesthetic qualities. The system runs in real-time on mobile phones and desktop computers. To increase computational efficiency d-touch imposes constraints on the design of the markers in terms of the relationship of dark and light regions in the symbols. We report a user study in which pairs of novice users generated between 3 and 27 valid and expressive markers within one hour of being introduced to the system, demonstrating its flexibility and ease of use.
Generating spike trains with specified correlation coefficients
Authors: Jakob H. Macke, Philipp Berens, Alexander S. Ecker, Andreas S. Tolias, Matthias Bethge
Venue: Neural Computation (2009)

Spike trains recorded from populations of neurons can exhibit substantial pairwise correlations between neurons and rich temporal structure. Thus, for the realistic simulation and analysis of neural systems, it is essential to have efficient methods for generating artificial spike trains with specified correlation structure. Here we show how correlated binary spike trains can be simulated by means of a latent multivariate gaussian model. Sampling from the model is computationally very efficient and, in particular, feasible even for large populations of neurons. The entropy of the model is close to the theoretical maximum for a wide range of parameters. In addition, this framework naturally extends to correlations over time and offers an elegant way to model correlated neural spike counts with arbitrary marginal distributions.
Bootstrapping a Verb Lexicon for Biomedical Information Extraction
Authors: Giulia Venturi, Simonetta Montemagni, Simone Marchi, Yutaka Sasaki, Paul Thompson, John Mcnaught, Sophia Ananiadou
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

The extraction of information from texts requires resources that contain both syntactic and semantic properties of lexical units. As the use of language in specialized domains, such as biology, can be very different to the general domain, there is a need for domain-specific resources to ensure that the information extracted is as accurate as possible. We are building a large-scale lexical resource for the biology domain, providing information about predicate-argument structure that has been bootstrapped from a biomedical corpus on the subject of E. Coli. The lexicon is currently focussed on verbs, and includes both automatically-extracted syntactic subcategorization frames, as well as semantic event frames that are based on annotation by domain experts. In addition, the lexicon contains manually-added explicit links between semantic and syntactic slots in corresponding frames. To our knowledge, this lexicon currently represents a unique resource within in the biomedical domain.
Video Coding Using Spatially Varying Transform
Authors: Cixun Zhang, Kemal Ugur, Jani Lainema, Moncef Gabbouj
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we propose a novel algorithm, named as Spatially Varying Transform (SVT). The basic idea of SVT is that we do not restrict the transform coding inside normal block boundary but adjust it to the characteristics of the prediction error. With this flexibility, we are able to achieve coding efficiency improvement by selecting and coding the best portion of the prediction error in terms of rate distortion tradeoff. The proposed algorithm is implemented and studied in the H.264/AVC framework. We show that the proposed algorithm achieves 2.64% bit-rate reduction compared to H.264/AVC on average over a wide range of test set. Gains become more significant at high bit-rates and the bit-rate reduction can be up to 10.22%, which makes the proposed algorithm very suitable for future video coding solutions focusing on high fidelity applications. The decoding complexity is expected to be decreased because only a portion of the prediction error needs to be decoded.
Suffix caching: an approach to ensure data availability in P2P streaming systems
Authors: H. Alustwani, J. M. Bahi, A. Mostefaoui
Venue: International Journal of Internet Protocol Technology (2008)

The now emerging Peer-to-Peer (P2P) streaming systems suffer from a data unavailability problem resulting from the unpredictable peers departure. This paper describes our suffix caching approach to overcome this problem. We use an embedded Distributed Virtual Cache (DVC) amongst the peers to temporarily save the 'last part' (suffix) of 'now playing' videos, that are most likely to be watched to the end by some users. We leverage on efficient allocation policy that 'fairly' distributes the suffixes over the DVC. We dynamically adjust the size of the suffixes to the system workload by using a closed-loop feed back control system.
Implementing the Lorenz oscillator with translinear elements
Authors: Kofi Odame, Bradley Minch
Venue: Analog Integrated Circuits and Signal Processing (2009)

Nonlinear processing is often more suitable than the traditional linear approach is for analyzing biological signals. Unfortunately, digital nonlinear operations are computationaly expensive. In contrast, a large variety of nonlinear operations can efficiently be implemented in analog electronics, operating at real-time speeds. The low level of accuracy generally associated with analog processing is not a concern in this scenario, as biological signals themselves typically have low signal-to-noise ratios. One challenge of analog processing is in its apparently-ad hoc design, and the fact that there is very little wide-spread knowledge of systematically implementing analog electronics to perform arbitrary nonlinear computations. Another issue is the integrity of the analog components; the analog properties of electronic devices are prone to a large amount of mismatch. In this paper, we examine multiple-input translinear element (MITE) networks, a class of analog circuits that addresses the two concerns of a structured synthesis procedure and component mismatch. We test the ability of these MITE networks for accurately realizing linear and nonlinear systems with prescribed dynamics by attempting to implement the Lorenz equations. We will present the theoretical procedure, address practical implementation issues, and then show experimental results from a version of the circuit fabricated in a 0.5 μm CMOS technology through MOSIS.
Extracting high-level information from location data: the W4 diary example
Authors: Gabriella Castelli, Marco Mamei, Alberto Rosi, Franco Zambonelli
Venue: Mobile Networks and Applications (2009)

Services for mobile and pervasive computing should extensively exploit contextual information both to adapt to user needs and to enable autonomic behavior. To fulfill this idea it is important to provide two key tools: a model supporting context-data representation and manipulation, and a set of algorithms relying on the model to perform application tasks. Following these lines, we first describe the W4 context model showing how it can represent a simple yet effective framework to enable flexible and general-purpose management of contextual information. In particular, we show the model suitability in describing user-centric situations, e.g., describing situations in terms of where a user is located and what he is doing. Then, we illustrate a set of algorithms to semantically enrich W4 represented data and to extract relevant information from it. In particular, starting from W4 data, such algorithms are able to identify the places that matter to the user and to describe them semantically. Overall, we show how the context-model and the algorithms allow to create an high-level, semantic and context-aware diary-based service. This service meaningfully collects and classifies the user whereabouts and the places that the user visited.
Optimal fuzzy logic control for MDOF structural systems using evolutionary algorithms
Authors: Sk. Faruque Ali, Ananth Ramaswamy
Venue: Engineering Applications of Artificial Intelligence (2009)

The paper presents an optimal fuzzy logic control algorithm for vibration mitigation of buildings using magneto-rheological (MR) dampers. MR dampers are semi-active devices and are monitored using external voltage supply. The voltage monitoring of MR damper is accomplished using evolutionary fuzzy system, where the fuzzy system is optimized using evolutionary algorithms (EAs). A micro-genetic algorithm (&mu;-GA) and a particle swarm optimization (PSO) are used to optimize the FLC parameters. Two cases of optimal FLCs are shown. One where FLC is optimized keeping the rule base predefined and in the other case, FLC rule base is also optimized along with other FLC parameters. The FLC rule base and membership function parameters are optimized using 10 variables. Fuzzy controllers with a predefined rule base and with an optimal rule base are applied to a single degree of freedom (SDOF) and a multi-degree of freedom (MDOF) system. Finally, the study evaluates the performance of the fuzzy controller optimized off-line, on a three storey building model under seismic excitations. The main advantage of using FLC to drive the MR damper voltage is that it provides a gradual and smooth change in voltage. Consequently, the present approach provides a better vibration control for structures under earthquake excitations.
Image Segmentation - A State-Of-Art Survey for Prediction
Authors: Shital Adarsh Raut, M. Raghuwanshi, R. .. Dharaskar, Adarsh Raut
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Image Segmentation is a technique that partitioned the input image into prerequisite semantic unique regions. Segmentation should stop as object of interest in an application is isolated. The ultimate goal is to make the image more simplified one and that to get more meaningful to analyze. Number of segmentation techniques are available but none of them satisfy the global properties and thus remain challenge for researcher. Many computer applications like Object Recognition, Automatic pictorial Pattern Recognition, Automatic Traffic control are based on this analysis. As per need of an application segmentation techniques can be selected . This survey addressed various segmentation techniques, discussed fundamental methodologies , and issues related with specific techniques. It discussed its limitations and probable solution to recover it. It also include discussion on segmentation technique based on graph partitioning which would be helpful to add intelligence for prediction. Concept of Ontology is introduced in short as technical bridge in between segmentation and image prediction.
Web-scale extraction of structured data
Authors: Michael J. Cafarella, Jayant Madhavan, Alon Halevy
Venue: ACM SIGMOD Record (2009)

A long-standing goal of Web research has been to construct a unified Web knowledge base. Information extraction techniques have shown good results on Web inputs, but even most domain-independent ones are not appropriate for Web-scale operation. In this paper we describe three recent extraction systems that can be operated on the entire Web (two of which come from Google Research). The TextRunner system focuses on raw natural language text, the WebTables system focuses on HTML-embedded tables, and the deep-web surfacing system focuses on "hidden" databases. The domain, expressiveness, and accuracy of extracted data can depend strongly on its source extractor; we describe differences in the characteristics of data produced by the three extractors. Finally, we discuss a series of unique data applications (some of which have already been prototyped) that are enabled by aggregating extractedWeb information.
Design and implementation of soft handoff support for SIP-NEMO
Authors: Shun-Ren Yang, Ya-Jun Huang, Chun-Wei Chiu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

SIP-NEMO has previously been proposed in the literature as a NEtwork MObility (NEMO) solution. However, the SIP-NEMO handoff delay has been shown to be more than 320 ms, which is intolerable to real-time services. In this paper, we focus on the SIP-NEMO and aim to reduce the handoff delay of SIP-NEMO. We design soft handoff mechanism for SIP-NEMO and implement a test-bed of SIP-NEMO with soft handoff support. Our experimental results indicate that our SIP-NEMO with soft handoff support can effectively lower down the handoff disruption time compared with SIP-NEMO without soft handoff and MIPv4-NEMO with fast handover. Thus, our proposed soft handoff mechanism for SIP-NEMO can improve the handoff performance to meet the delay requirement of real-time multimedia applications.
Experiences of learning and satisfaction with teaching of basic courses of ergonomics over Internet--the Ergonetti program
Authors: Annina Ropponen
Venue: Education and Information Technologies (2009)

Single courses offered over the Internet have been evaluated over the years, but no reports seem to be available for a group of courses or for entire study programs. Internet learning has increased both in quantity and quality in higher education; not only theoretical but also practical learning can be provided over the Internet. The purpose of this study was to evaluate an entire programme covering basic studies of ergonomics i.e., the Internet-based Ergonetti program of 28 credits provided by the Open University of Kuopio, Finland. The specific aims were to investigate experiences related to learning and how the Internet environment can affect learning, the assignments of workplaces, work communities and environments, and the workload of the courses. An Internet questionnaire including structured and open questions was mailed to the students (n¿=¿46) who were undertaking or had completed the Ergonetti's Summary-course. The response rate for the questionnaire was 46%. Utilization of learning cycle, combination of the Internet learning environment and the involvement of the workplaces, and the relationship between theory and practices were rated as very successful ways to promote the learning of basics of ergonomics. The involvement of the workplaces and measurements made at the workplaces meant that the workload was well proportioned to the course credits. Based on this relatively limited data it seems that an Internet learning environment when combined with real-world assignments can represent a successful way to provide instruction in a multidisciplinary subject, such as basics of ergonomics.
Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols
Authors: Konrad Iwanicki, Maarten Steen
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In this paper, we revisit the fundamental problem of maintenance of such a hierarchy. To this end, we observe that, due to tightly coupling their operation with the topology of the hierarchy, existing state-of-the-art cluster hierarchy maintenance protocols may not necessarily be efficient. Based on our observations, we make a case for a novel gossip-based hierarchy maintenance protocol that decouples its operation from the hierarchy topology. Through experiments with actual embedded implementations we have developed, we confirm that our protocol can outperform the existing state-of-the-art solutions by a few factors in terms of both the energy consumption and the latency of bootstrapping and recovering the hierarchy.
A performance model of selection techniques for p300-based brain-computer interfaces
Authors: Jean-Baptiste Sauvan, Anatole Lécuyer, Fabien Lotte, Géry Casiez
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we propose a model to predict the performance of selection techniques using Brain-Computer Interfaces based on P300 signals. This model is based on Markov theory and can compute both the time required to select a target and the number of visual flashes needed. We illustrate how to use this model with three different interaction techniques to select a target. A first experimental evaluation with three healthy participants shows a good match between the model and the experimental data.
Semantic web services discovery based on structural ontology matching
Authors: Beniamino Di Martino
Venue: International Journal of Web and Grid Services (2009)

In this paper, we present an approach to semantic-based web service discovery and a prototypical tool based on syntactic and structural schema matching. It is based on matching an input ontology, describing a service request, to web services descriptions at the 'syntactic level' through Web Services Description Language (WSDL) or, at the semantic level, through service ontologies described with languages such as Ontology Web Language for Services (OWL-S), Web Services Modelling Ontology (WSMO), Semantic Web Services Framework (SWSF) and Web Services Description Language Semantics (WSDL-S). The different input schemas, WSDL descriptions, Ontology Web Language (OWL) ontologies, OWL-S, WSMO, SWSF and WSDL-S components are represented in a uniform way by means of directed rooted graphs, where nodes represent schema elements, connected by directed links of different types, e.g., for containment and referential relationships. On this uniform internal representation, a number of matching algorithms operate, including structural-based algorithms (Children Matcher, Leaves Matcher, Graph and SubGraph Isomorphism) and syntactical ones (Edit Distance (Levenshtein Distance or LD) and Synonym Matcher (through the WordNet synonyms thesaurus)).
Maximum Margin Clustering with Pairwise Constraints
Authors: Yang Hu, Jingdong Wang, Nenghai Yu, Xian-Sheng Hua
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Maximum margin clustering (MMC), which extends the theory of support vector machine to unsupervised learning, has been attracting considerable attention recently. The existing approaches mainly focus on reducing the computational complexity of MMC. The accuracy of these methods, however, has not always been guaranteed. In this paper, we propose to incorporate additional side-information, which is in the form of pairwise constraints, into MMC to further improve its performance. A set of pairwise loss functions are introduced into the clustering objective function which effectively penalize the violation of the given constraints. We show that the resulting optimization problem can be easily solved via constrained concave-convex procedure (CCCP). Moreover, for constrained multi-class MMC, we present an efficient cutting-plane algorithm to solve the sub-problem in each iteration of CCCP. The experiments demonstrate that the pairwise constrained MMC algorithms considerably outperform the unconstrained MMC algorithms and two other clustering algorithms that exploit the same type of side-information.
Realignment of objectives in information system degree programs
Authors: J. Daniel Couger
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Development of degree programs in information system analysis and designed lagged demand by nearly five years. Now the growth of these programs appears to be outdistancing demand.
Who's viewed you?: the impact of feedback in a mobile location-sharing application
Authors: Janice Y. Tsai, Patrick Kelley, Paul Drielsma, Lorrie Faith Cranor, Jason Hong, Norman Sadeh
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Feedback is viewed as an essential element of ubiquitous computing systems in the HCI literature for helping people manage their privacy. However, the success of online social networks and existing commercial systems for mobile location sharing which do not incorporate feedback would seem to call the importance of feedback into question. We investigated this issue in the context of a mobile location sharing system. Specifically, we report on the findings of a field de-ployment of Locyoution, a mobile location sharing system. In our study of 56 users, one group was given feedback in the form of a history of location requests, and a second group was given no feedback at all. Our major contribution has been to show that feedback is an important contributing factor towards improving user comfort levels and allaying privacy concerns. Participants' privacy concerns were reduced after using the mobile location sharing system. Additionally,our study suggests that peer opinion and technical savviness contribute most to whether or not participants thought they would continue to use a mobile location technology.
An EDA tool for implementation of low power and secure crypto-chips
Authors: Behnam Ghavami, Hossein Pedram, Mehrdad Najibi
Venue: Computers and Electrical Engineering (2009)

Regarding the significant mathematical immunity of recent cryptographic algorithms, attacks considering the physical aspects of these algorithms, known as side channel attacks, have received much of interest. Today, it is quite clear that asynchronous circuits possess considerable inherent countermeasure capabilities against side channel attacks, and therefore they are more immune for cryptographic systems compared to synchronous design. However, due to lack of automatic synthesis and optimization tools for these circuits, implementation of secure asynchronous circuits encounters many difficulties. In this paper, a fully automated secure design flow and a set of secure library cells resistant to power analysis and fault injection attacks are introduced for quasi delay insensitive asynchronous circuits. In the proposed flow, a high-level description of the system is received in Verilog format powered by some special macros, and then the corresponding specification will be decomposed into smaller circuits directly mappable to predefined circuit templates. With the use of a special standard-cell library, the final circuit is resistive to differential power analysis on faulty hardware attack. We suggest a restructuring on the conditional statements in the high-level description of the circuit which leads to a considerable optimization in power consumption after the decomposition of the system. To verify the efficiency of our presented design flow, we implemented data encryption standard (DES) and advanced encryption standard (AES) algorithms, and we showed 23% less power consumption compared to the existing data driven decomposition asynchronous synthesis method. Also, these implementations are three times faster than the synchronous implementations on average, in TSMC 0.18@mm technology.