ppxscal/embedding_network huggingface dataset:
An Efficient Approach for Classification of Speech and Music
Authors: Ei Mon Swe, Moe Pwint
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

A new method to classify an audio segment into speech and music related to the automatic transcription of broadcast news is presented. To discriminate between speech and music, sample entropy (SampEn), a time complexity measure, mainly operates as a feature. SampEn is a variant of the approximate entropy (ApEn) that measures the regularity of time series. The basic idea is to label a given audio into speech or music depending on its regularity. Based on the SampEn sequence calculated over a window, the regularity of a given audio stream is measured. The effectiveness of the proposed method is tested on experiments, including broadcast news shows from BBC radio stations, WBAI news, UN news and music genres with different temporal distributions. Results show the robustness of the proposed method achieving high discrimination accuracy for all tested experiments.
Multimedia Technologies in University Courses: Some Examples
Authors: Nicoletta Sala
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The increasing need of education in contemporary society and the reduction of overall costs and study flexibility, together with availability of powerful telecommunications and computer systems have fostered investigation and implementation of different types of technology-supported teaching and learning system [4]. This paper describes two activities that involve the use of multimedia technologies in educational process in University. One has been developed for a first-year undergraduate course of Mathematics at the Academy of Architecture of Mendrisio, University of Italian Switzerland. Other activity has been developed at the Department of Electronic - Politecnico of Torino in the field of computer based training in electronic instrumentation and measurements using some multimedia solutions.
Image-Based Rendering by Virtual 1D Cameras
Authors: Naoyuki Ichimura
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Image-based rendering (IBR) has been used to synthesize images corresponding to a new view point from stored images. Rendering methods based on a three-dimensional plenoptic function are attractive due to the simplicity of image capture. Only a few specific discussions, however, have been done for the scaling problem to correct aspect ratio distortion, which heavily affects the quality of a synthesized image. This paper presents a rendering algorithm with a scaling scheme, which is general in that it can handle arbitrary camera paths. We model a virtual camera by a set of one-dimensional (1D) cameras. The ray representation of the 1D camera enables us to devise a rendering algorithm for the cases where the camera paths to create ray databases are arbitrary curves. We conclude with experimental results that demonstrate the usefulness of the proposed algorithm.
Concept vector extraction from Wikipedia category network
Authors: Masumi Shirakawa, Kotaro Nakayama, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The availability of machine readable taxonomy has been demonstrated by various applications such as document classification and information retrieval. One of the main topics of automated taxonomy extraction research is Web mining based statistical NLP and a significant number of researches have been conducted. However, existing works on automatic dictionary building have accuracy problems due to the technical limitation of statistical NLP (Natural Language Processing) and noise data on the WWW. To solve these problems, in this work, we focus on mining Wikipedia, a large scale Web encyclopedia. Wikipedia has high-quality and huge-scale articles and a category system because many users in the world have edited and refined these articles and category system daily. Using Wikipedia, the decrease of accuracy deriving from NLP can be avoided. However, affiliation relations cannot be extracted by simply descending the category system automatically since the category system in Wikipedia is not in a tree structure but a network structure. We propose concept vectorization methods which are applicable to the category network structured in Wikipedia.
A Reconfigurable Processor Infrastructure for Accelerating Java Applications
Authors: Youngsun Han, Seok Joong Hwang, Seon Wook Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we present a reconfigurable processor infrastructure to accelerate Java applications, called Jaguar. The Jaguar infrastructure consists of a compiler framework and a runtime environment support. The compiler framework selects a group of Java methods to be translated into hardware for delivering the best performance under limited resources, and translates the selected Java methods into Verilog synthesizable code modules. The runtime environment support includes the Java virtual machine (JVM) running on a host processor to provide Java execution environment to the generated Java accelerator through communication interface units while preserving Java semantics. Our compiler infrastructure is a tightly integrated and solid compiler-aided solution for Java reconfigurable computing. There is no limitation in generating synthesizable Verilog modules from any Java application while preserving Java semantics. In terms of performance, our infrastructure achieves the speedup by 5.4 times on average and by up to 9.4 times in measured benchmarks with respect to JVM-only execution. Furthermore, two optimization schemes such as an instruction folding and a live buffer removal can reduce 24% on average and up to 39% of the resource consumption.
Familiarity or conceptual priming: Event-related potentials in name recognition
Authors: Georg Stenberg, Johan Hellman, Mikael Johansson, Ingmar Rosén
Venue: Journal of Cognitive Neuroscience (2009)

Recent interest has been drawn to the separate components of recognition memory, as studied by event-related potentials (ERPs). In ERPs, recollection is usually accompanied by a late, parietal positive deflection. An earlier, frontal component has been suggested to be a counterpart, accompanying recognition by familiarity. However, this component, the FN400, has alternatively been suggested to reflect a form of implicit memory, conceptual priming. The present study examined the ERP components of recognition memory using an episodic memory task with a stimulus material consisting of names, half of which were famous. Along a different dimension, the names varied in how rare or common they were. These dimensions, frequency and fame, exerted powerful effects on memory accuracy, and dissociated the two recognition processes, such that frequency gave rise to familiarity and fame fostered recollection, when the receiver operating characteristics data were analyzed with Yonelinas' dual-process signal detection model. The ERPs corresponded fully to the behavioral data because frequency affected the frontal component exclusively, and fame affected the parietal component exclusively. Moreover, a separate behavioral experiment showed that conceptual priming was sensitive to fame, but not to frequency. Our data therefore indicate that the FN400 varies jointly with familiarity, but independently of conceptual priming.
A tiny portable language-independent macroprocessor and some applications
Authors: Robert C. Gammill
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A tiny language-independent macroprocessor is described. It is easily implemented in most programming languages. A compact and portable implementation in ANSI FORTRAN is given. The simplicity of the implementation results from a user-specified escape character used to mark all macro calls. The result is a macro language not easily read by beginners. All primitive macro operations, including definition, are simple macro calls. The tiny macroprocessor has proved a powerful software tool in a number of applications. These include source text decompression, character set encoding for transmission, and as the basis for a linking loader. The compactness and portability of the processor make it useful in moving software from one machine to another. The simplicity of the processor makes it easy to extend or modify for new applications. The tiny macroprocessor is a simple yet useful addition to the software engineer's tool kit.
Selective Code Compression Scheme for Embedded Systems
Authors: Shlomit S. Pinter, Israel Waldman
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

The extensive usage of embedded systems involves running complex applications that require tightly limited resources such as memory and storage. One efficient way to satisfy the resource requirements is to reduce the code size through code compression. Our work describes a software-based code compression scheme that reduces the storage space of a program, which in turn induces a reduction of access time to off-chip memory in SoC (System-on-a-chip) embedded architectures. To select those sections of code that are most advantageous for compression, our scheme utilizes profiling information to evaluate and trade off storage space reduction for future run-time overhead. During run-time, the compressed parts are decompressed as necessary into a run-time buffer for execution. Experimental results on the SPEC CPU2000 and MediaBench suites show reduction in code size averaging 18.5%, along with reasonable memory consumption overhead averaging 3.8%, and a reasonable run-time overhead averaging 7.8%.
Estimation of Geographic Relevance for Web Objects Using Probabilistic Models
Authors: Taro Tezuka, Hiroyuki Kondo, Katsumi Tanaka
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

The rapidly increasing use of geographically restrictive web search has made determination of the geographic relevance of web content an important task. We have developed a method that uses Gaussian mixture models to estimate the geographic relevance of web pages and arbitrary topics and have implemented a visualization interface that maps pages and topics to geographic space. The system enables the user to retrieve web pages and topics expressed on the Web that are relevant to an arbitrary geographic area.
Full or tailored mobile web- where and how do people browse on their mobiles?
Authors: Anne Kaikkonen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Mobile Internet is still a fairly new phenomenon and will be changing in the near future. Today, owners of advanced phones can access full web sites and sites tailored for the mobile with their mobile phone browsers. In addition to this, increasing number of other phone applications connect to Internet. A global online survey and a set of interviews were conducted in Hong Kong, London and New York in late spring 2007. 390 mobile Internet users took part in the study and in addition, 23 face to face interviews were carried out. This study revealed some interesting usage patterns of mobile Internet users: full web and mobile tailored web are used for slightly different reasons. Also the user profiles and usage patterns are different in different countries. In Asia, mobile Internet has hit the mass. Users are often female with non-technical background, where as in Europe and North America users are still early adopters. This leads to differentiation in the activities users do. Asian users often use mobile tailored operator portals where as European and American users are more familiar with full web and newest gadgets.
A multiple supply voltage based power reduction method in 3-D ICs considering process variations and thermal effects
Authors: Shih-An Yu, Pei-Yu Huang, Yu-Min Lee
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, a grid-based multiple supply voltage (MSV) assignment method is presented to statistically minimize the total power consumption of 3-D IC. This method consists of a statistical electro-thermal simulator to get the mean and variance of on-chip, a thermal-aware statistical static timing analysis (SSTA) to take into account the thermal effect on circuit timing, the statistical power_delay_sensitivity-slack product to be the optimization criterion, and an incremental update of statistical timing to save the runtime. The experimental results demonstrate the effectiveness of the developed methodology and indicate that the consideration of the thermal effect in the circuit simulation is imperative.
On metricity of two heterogeneous measures in the presence of missing values
Authors: Martti Juhola, Jorma Laurikkala
Venue: Artificial Intelligence Review (2007)

Heterogeneous Euclidean-overlap metric and heterogeneous value difference metric given in machine learning literature are useful for the consideration of mixed-type data for machine learning, pattern recognition and data mining tasks. Mixed-type variables are quite common in practical problems, but this property has been taken into account only seldom in pattern recognition, data mining and decision making algorithms. We observed that these two distance measures are not actually metrics after having found a special situation when they are not metric, but pseudometric, a feature to be noted while using them. Nevertheless, by changing their definitions somewhat, it is possible to meet the metricity. Especially in medical applications, the redefinition of the two measures might be important, since otherwise it is possible in theory that, for example, two identical cases would be classified differently. Nearest neighbor searching tests with medical data were run to illustrate the behavior of these measures. Notwithstanding the violation of the metricity their original forms yielded slightly better classification results. The reason was that in real data sets tested there were very few almost similar cases according to these distance measures, and the original forms based on more separating distances than the redefinitions were slightly better in the classification.
Organic Pie Charts
Authors: Fabian Moerchen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex data analysis techniques as it builds on the well known concept of pie charts. The non-linear projection capabilities of Emergent Self-Organizing Maps (ESOM) are used to generate a topology-preserving ordering of the data points on a circle. The distance structure within the high dimensional space is visualized on the circle analogously to the U-Matrix method for two-dimensional SOM. The resulting display resembles pie charts but has an organic structure that naturally emerges from the data. Pie segments correspond to groups of similar data points. Boundaries between segments represent low density regions with larger distances among neighboring points in the high dimensional space. The representation of distances in the form of a periodic sequence of values makes time series segmentation applicable to automated clustering of the data that is in sync with the visualization. We discuss the usefulness of the method on a variety of data sets to demonstrate the applicability in applications such as document analysis or customer segmentation.
Impact on Genetic Algorithm of Different Parameters
Authors: Xiang Li, Qiao Chen, Yanli Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Genetic algorithm is a highly efficient parallel evolution algorithm of the global search which is decided by the balance of the exploitation and exploration. This balance also depends on population size, the biggest evolution of algebra, coding length, crossover rate and mutation rate, etc., therefore, the set of evolution parameters for the search properties of the entire GA has played a crucial role. This paper solved PERT in the multi-task scheduling problem, focused on population size, the cross-probability and the mutation rate of GA and analyzed their impact factors.
Trust-based contextual information filtering
Authors: Eugenia Kondratova, Stephen Marsh, Ali Ghorbani
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

We describe a multilayer information filtering approach, implemented as part of the Comprehensive Information Filtering System (CIFS) - a personal filtering system for mobile users. CIFS combines the message content, context, and contact information into a scenario that maintains an amalgamated relevance, privacy and trust rating.
The PIAM approach to modular integrated assessment modelling
Authors: Jochen Hinkel
Venue: Environmental Modelling Software (2009)

The next generation of integrated assessment modelling is envisaged as being organised as a modular process, in which modules encapsulating knowledge from different scientific disciplines are independently developed at distributed institutions and coupled afterwards in accordance with the question raised by the decision maker. Such a modular approach needs to respect several stages of the model development process, approaching modularisation and integration on a conceptual, numerical, and technical level. The paper discusses the challenges at each level and presents partial solutions developed by the PIAM (Potsdam Integrated Assessment Modules) project at the Potsdam Institute for Climate Impact Research (PIK). The challenges at each level differ greatly in character and in the work done addressing them. At the conceptual level, the notion of conceptual consistency of modular integrated models is discussed. At the numerical level, it is shown how an adequate modularisation of a problem from climate-economy leads to a modular configuration into which independently developed climate and economic modules can be plugged. At the technical level, a software tool is presented which provides a simple consistent interface for data transfer between modules running on distributed and heterogeneous computer platforms.
CoSense: enhancing sensemaking for collaborative web search
Authors: Sharoda A. Paul, Meredith Ringel Morris
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Making sense of the information found during an investigational Web search task can be daunting. With the recent emergence of tools to support collaborative Web search, the associated sensemaking task has become even more complex, requiring sense to be made not only of the products of a search (i.e., results found) but of the process, as well (i.e., group division of labor and decision-making). We present the findings of a formative study illustrating the sensemaking challenges posed by collaborative search tools. Based on these findings, we created CoSense, a system that supports sensemaking for collaborative Web search tasks by providing several rich, interactive views of a group's search activities. We describe an evaluation of CoSense, reflecting on how its features supported different aspects of sensemaking, and how future collaborative search systems can benefit from these findings.
Design and Implementation for High Speed LDPC Decoder with Layered Decoding
Authors: Hong Ding, Shuai Yang, Wu Luo, Mingke Dong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper presents a layered decoding algorithm for LDPC code and analyzes the advantages and challenge for high speed implementation. Simulation result indicates that layered decoding algorithm converge two times faster than traditional decoding algorithm. A new code construction scheme aimed to design high speed LDPC decoder with layered decoding algorithm is put forward. This code construction method helps to increase the parallel degree of decoder by suffering with little performance loss. Using the layered decoding algorithm and code construction scheme, a length 2304, rate 1/2 LDPC decoder which can achieve about 768 Mbps information throughput has been implemented on FPGA platform.
Qub
Authors: Karim Khenissi, Emilie Clavel
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In the near future, an old man wants to make the world rounder by creating a new sort of life ...
Engineering Graphics Theory and Problems Second Edition Workbook: Problem Set A, 2nd edition
Authors: Timothy Sexton
Venue:  (2007)

Engineering Graphics: Theory and Problems gives students a basic understanding of how to create and read engineering drawings. The book consist of twelve chapters that cover the basics of Engineering Graphics. The text is 134 pages in length and is followed by 40 exercise sheets. The exercise sheets both challenge the students and allow them to practice the topics covered in the text. Instructors have the choice of four different sets of exercise sheets to be bundled with this textbook. The text from the chapters are the same and the problem sets are similar. Instructors can switch the problem sets every semester to discourage students from sharing old assignments. Table of Contents 1. Hand Lettering 2. Sketching Techniques 3. Line Types 4. Measurement and Scale 5. Multiview Drawing 6. Isometric Drawing 7. Auxliary Views 8. Dimensioning 9. Sectional Views 10. Threads 11. Working Drawings 12. General Tolerance 13. General Dimensioning and Tolerancing
Data model processing
Authors: Matthew B. Koll, W. Terry Hardgrave, Sandra B. Salazar
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The Data Model Processor (DMP) is an interactive tool for defining and evaluating data models. It is based on Positional Set Notation, a formalism for uniform representation of data modeling objects. The DMP allows the user to enter a set-theoretic description of a data model's structures and a definition of the model's primitive operations based on positional set operations. Based on the data model definition, the DMP then emulates a database management system (DBMS) implementing that data model. It allows the user to play various roles associated with a DBMS, such as database definer and end user. This paper gives an overview of the DMP and discusses its foundations, namely, Positional Set Notation and a Positional Set Processor. It traces an example showing how the DMP has been used to model the relational data model. (Hierarchical and network models have also been implemented on the DMP.) Future applications of the DMP are considered.