ppxscal/embedding_network huggingface dataset:
Assessing the Filtering and Browsing Utility of Automatic Semantic Concepts for Multimedia Retrieval
Authors: Michael G. Christel, Milind R. Naphade, Apostol (Paul) Natsev, Jelena Tesic
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The contributions of automatic semantic concept classifiers for interactive filtering (classifiers in conjunction with query rankings) and browsing (classifiers in lieu of query rankings) are tested against three test corpora: an amateur photo collection, documentary video, and news video. Results show that current classifiers offer browsing utility twice as good as having no classifier at all, and that continuous improvements in the classifiers produce comparable improvements in the browsing utility. For filtering a wellordered set of results (e.g., a set retrieved from text search), concept classifiers need greater accuracy: current classifiers showed worse performance than not filtering at all, even when the classifiers' accuracy is nearly doubled. Results are consistent for all test corpora. Hence, automatic semantic concepts can offer significant utility for browsing at current levels of accuracy, but the requirement is much higher for filtering a well-ordered set of results, where extreme accuracy is necessary before benefits are seen.
Visualisations of execution traces (VET): an interactive plugin-based visualisation tool
Authors: Mike McGavin, Tim Wright, Stuart Marshall
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

An execution trace contains a description of everything that happened during an execution of a program. Execution traces are useful, because they can help software engineers understand code, resulting in a variety of applications such as debugging software, or more effective software reuse. Unfortunately, execution traces are also complex, typically containing hundreds of thousands of events for medium size computer programs, and more for large scale programs. We have developed an execution trace visualisation tool, called VET, that helps programmers manage the complexity of execution traces. VET is also plugin based. Expert users of VET can add new visualisations and new filters, without changing VET's main code base.
Children's text comprehension: effects of genre, knowledge, and text cohesion
Authors: Rachel Best, Yasuhiro Ozuru, Randy G. Floyd, Danielle S. McNamara
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Our goal in this project is to develop a better understanding of text comprehension exhibited by elementary-school children. The research focused on the role of text genre (narrative and expository text), text cohesion (high or low) and the readers' level of prior world knowledge (assessed using the Woodcock--Johnson III Academic Knowledge test). Sixty-four students in the fourth grade read four texts, including one high-cohesion and one low-cohesion text from each genre. Comprehension of each text was assessed with 12 multiple-choice questions, including both local questions (focusing on specific information contained in one or two sentences) and global questions (focusing on general themes). Children showed better comprehension of the narrative than expository texts, but this advantage appeared only on global questions. There was a benefit of higher knowledge, but only for the expository texts. The benefits of cohesion were greatest for narrative text comprehension and on global questions.
Recursive estimation of generative models of video
Authors: Nemanja Petrovic, Aleksandar Ivanovic, Nebojsa Jojic
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of the sources of variability in the video and fast transformation invariant frame clustering. We suggest a solution to the problem of computationally intensive learning in this model by combining the recursive model estimation, fast inference, and on-line learning. Thus, we achieve real time frame clustering performance. Novel aspects of this method include an algorithm for the clustering of Gaussian mixtures, and the fast computation of the KL divergence between two mixtures of Gaussians. The efficiency and the performance of clustering and KL approximation methods are demonstrated. We also present novel video browsing tool based on the visualization of the variables in the generative model.
Using a roles scheme to derive software project metrics
Authors: Yael Dubinsky, Orit Hazzan
Venue: Proceedings of the 2004 workshop on Quantitative techniques for software agile process (2004)

Roles' playing is common in our lives. We play different roles with our family, at work as well as in other environments. Role allocation in software development projects is also accepted though it may be implemented differently by different software development methods. In a previous work ([2]) we have found that personal roles may raise teammates' personal accountability while maintaining the essence of the software development method. In this paper we present our role scheme, elaborate on its implementation and explain how it can be used to derive metrics. We illustrate our ideas by data gathered in student projects in the university.
Visually Induced Auditory Expectancy in Music Reading: A Behavioral and Electrophysiological Study
Authors: Daniele Schön, Mireille Besson
Venue: Journal of Cognitive Neuroscience (2005)

The general aim of this experiment was to investigate the processes involved in reading musical notation and to study the relationship between written music and its auditory representation. It was of main interest to determine whether musicians are able to develop expectancies for specific tonal or atonal auditory events based on visual score alone. Can musicians expect an "atonal" event or will it always sound odd? Moreover, it was of interest to determine whether the modulations in amplitude of a late positive component (P600) described in previous studies are linked to a general mismatch detection process or to specific musical expectancies. Results showed clearly that musicians are able to expect tonal auditory endings based on visual information and are also able to do so for atonal endings, although to a smaller extent. Strong interactions seem to exist between visual and auditory musical codes and visual information seems to influence auditory processing as early as 100 msec. These results are directly relevant for the question of whether music reading is actually music perception.
Interaction of neuronal I-O functions with STDP
Authors: Hidetoshi Urakubo, Masataka Watanabe, Shunsuke Kondo
Venue: Systems and Computers in Japan (2007)

Spike timing-dependent synaptic plasticity (STDP) develops neural circuits through close interaction with the firing function of single neurons. Here, we investigate the neuronal firing function dependency of STDP about a single-compartment Hodgkin&ndash;Huxley (HH) model neuron and a leaky integrate-and-fire (LIF) model neuron. Computer simulation shows that the development of synaptic strength by synaptic input pairs with constant intervals depends on the firing function of the models. The more organized packet inputs also develop synaptic strength in a firing function-dependent manner, to realize specific information processing. These results suggest that in real biological systems too, STDP with the same time window will develop different neural circuits, depending on the neuronal firing functions. &copy; 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 38(1): 41&ndash;50, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20234
Issues in the design of store buffers in dynamically scheduled processors
Authors: R. Bhargava
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

Processor performance can be sensitive to load-store ordering, memory bandwidth, and memory access latency. A store buffer is a mechanism that exists in many current processors to accomplish one or more of the following: store access ordering, latency hiding, and data forwarding. Different policies that govern store buffer behavior can affect overall processor performance. However, the performance impact of various store buffer policies is not clearly analyzed in available literature. In this paper, we look into various store buffer issues such as i) where to place it in the pipeline, ii) when to remove a store entry from the store buffer, iii) when to allow the stores to be retired, and iv) if, when, and how to set the contention priority of memory operations. These issues are explained in detail while design and performance tradeoffs are assessed. Using a variety of C, C++, and Java benchmarks, we establish how these design policies influence performance. We find that the policies for store entry removal and store buffer pipeline placement have a large effect on the overall performance of a microprocessor. In addition, we see that smaller, well-designed store buffers can achieve comparable performance to larger, basic store buffers. Combining these results with an analysis of the benchmarks can help one fully understand the role of the store buffer and the tradeoffs involved.
Semi-analytical time-domain low-frequency scattering formulation for biological applications: Research Articles
Authors: Il-Suek Koh, Woo-Tae Kim, Jong-Gwan Yook, Jae-Chon Park
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

In this paper, an efficient time domain formulation is proposed for a low-frequency scattering by a complicated inhomogeneous dielectric scatterer. The formulation is based on the Born approximation and a sampling theorem. To extend the valid region of the proposed solution, the Rayleigh scattering formulation for a small dielectric object is used to modify the Born current inside the scatterer. In order to verify the obtained formulation, scatterings by several canonical objects such as a cubic box and a sphere are compared, which are calculated by the proposed formulation and the known exact or approximate solutions of a Mie series and the Rayleigh scattering. In addition, scattering by a human head is investigated at a very low-frequency band (< 100 Hz). For the simulation, two excitations are considered: plane wave incidence from outside the head and an artificial point source located inside the head. The head model is discretized by a 3 &times; 3 &times; 3 mm3 cubic box, which is comprised of eight types of tissue. These are blood, bone, fat, grey matter, white matter, muscle, skin and vitreous humor. Copyright &copy; 2006 John Wiley & Sons, Ltd.
A usage study of retrieval modalities for video shot retrieval
Authors: Alan F. Smeaton, Paul Browne
Venue: Information Processing and Management: an International Journal (2006)

As an information medium, video offers many possible retrieval and browsing modalities, far more than text, image or audio. Some of these, like searching the text of the spoken dialogue, are well developed, others like keyframe browsing tools are in their infancy, and others not yet technically achievable. For those modalities for browsing and retrieval which we cannot yet achieve we can only speculate as to how useful they will actually be, but we do not know for sure. In our work we have created a system to support multiple modalities for video browsing and retrieval including text search through the spoken dialogue, image matching against shot keyframes and object matching against segmented video objects. For the last of these, automatic segmentation and tracking of video objects is a computationally demanding problem which is not yet solved for generic natural video material, and when it is then it is expected to open up possibilities for user interaction with objects in video, including searching and browsing. In this paper we achieve object segmentation by working in a closed domain of animated cartoons. We describe an interactive user experiment on a medium-sized corpus of video where we were able to measure users' use of video objects versus other modes of retrieval during multiple-iteration searching. Results of this experiment show that although object searching is used far less than text searching in the first iteration of a user's search it is a popular and useful search type once an initial set of relevant shots have been found.
How can we use concept maps for prior knowledge activation: different mapping-tasks lead to different cognitive processes
Authors: Johannes Gurlitt, Alexander Renkl, Michael A. Motes, Sabine Hauser
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

A think-aloud-study was conducted to examine how characteristic affordances of concept maps could be used for prior knowledge activation. Characteristic affordances of concept maps are connection lines representing the relationships between concepts and the labeling of these lines specifying the type of the semantic relationships. To investigate the effects of generating semantic relationships versus labeling existing semantic relationships during prior knowledge activation, 20 psychology students were given two concept-mapping tasks: 1) They had to draw and label the connections between the concepts of a map, and 2) they were given a map of concepts with connection lines and had to label the connections. Thinking-aloud protocols indicated more elaboration processes in the labeling-the-lines task than in the finding-and-labeling-the-lines task. On the other hand, the protocols indicated more overview and organization-processes in the finding-and-labeling-the-lines task. Thus, particular concept-mapping tasks elicit qualitative differences in prior knowledge activation processes, which has important practical implications.
Children and elders sharing stories: lessons from two online oral history projects
Authors: Jason B. Ellis, Amy S. Bruckman, Robert C. Satterwhite
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Oral history projects provide a way for students to learn history by engaging with elders sharing stories relevant to their experience. However, these kinds of projects require a large amount of effort to undertake. We believe computing technology can help. Here, we examine the role of existing technology in allowing kids and elders to share historical stories. We present the results of two pilot studies. Lessons learned for CSCL system design and classroom implementation are presented, along with future directions.
Reading LCD/LED Displays with a Camera Cell Phone
Authors: Huiying Shen, James Coughlan
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Being able to read LCD/LED displays would be a very important step towards greater independence for persons who are blind or have low vision. A fast graphical model based algorithm is proposed for reading 7-segment digits in LCD/LED displays. The algorithm is implemented for Symbian camera cell phones in Symbian C++. The software reads one display in about 2 seconds by a push of a button on the cell phone (Nokia 6681, 220 MHz ARM CPU).
A Knowledge Grid Architecture Based on Mobile Agent
Authors: Gang Wang, Tao Wen, Quan Guo, Xuebin Ma
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The performance of services implemented in the serviceoriented knowledge grid becomes one of the most key issues that affect the development of the knowledge grid. This paper presents a knowledge grid architecture based on mobile agent and effectively utilizes mobile agent's mobility, flexibility and intelligence to implement knowledge grid services. The idea that applies MA technologies to the knowledge grid can reduce network traffic and improve the intelligence of knowledge grid services. The integration of two main distributed technologies provides a new way to develop knowledge grid.
A separate compilation extension to standard ML
Authors: David Swasey, Tom Murphy,  VII, Karl Crary, Robert Harper
Venue: Proceedings of the 2006 workshop on ML (2006)

We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on one another in a way specified by the programmer. A dependency may be mediated by an interface (the type of a unit); if so, the units can be compiled separately. Otherwise, they must be compiled in sequence. We also propose a methodology for programming in SMLSC that reflects code development practice and avoids syntactic repetition of interfaces. The language is given a formal semantics, and we argue that this semantics is implementable in a variety of compilers.
Privacy leakage in multi-relational databases: a semi-supervised learning perspective
Authors: Hui Xiong, Michael Steinbach, Vipin Kumar
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2006)

In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensitive information. However, recent developments in data mining present a new challenge for database security even when traditional database security techniques, such as database access control, are employed. This paper presents a data mining framework using semi-supervised learning that demonstrates the potential for privacy leakage in multi-relational databases. Many different types of semi-supervised learning techniques, such as the K-nearest neighbor (KNN) method, can be used to demonstrate privacy leakage. However, we also introduce a new approach to semi-supervised learning, hyperclique pattern-based semi-supervised learning (HPSL), which differs from traditional semi-supervised learning approaches in that it considers the similarity among groups of objects instead of only pairs of objects. Our experimental results show that both the KNN and HPSL methods have the ability to compromise database security, although the HPSL is better at this privacy violation (has higher prediction accuracy) than the KNN method. Finally, we provide a principle for avoiding privacy leakage in multi-relational databases via semi-supervised learning and illustrate this principle with a simple preventive technique whose effectiveness is demonstrated by experiments.
WINFO: Wearable Micro Info-broadcaster
Authors: Kenji Sasaki, Yoshito Tobe
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This paper proposes a system of presenting an environmental information map for urban people called Wearable micro-INFOrmation broadcaster (WINFO). WINFO assumes that individual persons carry wearable computers that collect various information, the collected information is aggregated at a server, and the aggregated information can be viewed at client computers. In order to accommodate the granularity and precision of data in spatial and temporal domains, the notion of precision-based Dynamic Mesh is introduced. In this paper, we describe the conceptual architecture and prototype of WINFO.
Building Maps of Unknown Environment through Observation of Human Actions
Authors: Masakatsu Mitani, Mamoru Takaya, Atsuhiro Kojima, Kunio Fukunaga
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, we propose a novel method for building maps of unknown environment based on relationship between human actions and objects by a mobile robot. Most of previous works on map-building tasks by robots focused on generating obstacle maps for path-planning. In addition, model-based object recognition techniques are also used for searching particular objects. It is, however, difficult in reality to prepare a lot of models in advance for recognizing various objects in unknown environment. On the other hand, human can often recognize objects not from their appearances but by watching other person taking actions on them. This is because the function and/or the usage of the objects are closely related with human actions. Therefore, we introduce conceptual models of human actions and objects for classifying objects by observing human activities. Finally, we demonstrate a map can be built in unknown environment.
Plant identification via adaptive combination of transversal filters
Authors: Jerónimo Arenas-García, Manel Martínez-Ramón, Ángel Navia-Vázquez, Aníbal R. Figueiras-Vidal
Venue: Signal Processing (2006)

For least mean-square (LMS) algorithm applications, it is important to improve the speed of convergence vs the residual error trade-off imposed by the selection of a certain value for the step size. In this paper, we propose to use a mixture approach, adaptively combining two independent LMS filters with large and small step sizes to obtain fast convergence with low misadjustment during stationary periods. Some plant identification simulation examples show the effectiveness of our method when compared to previous variable step size approaches. This combination approach can be straightforwardly extended to other kinds of filters, as it is illustrated with a convex combination of recursive least-squares (RLS) filters.
Video Transmission Performance Evaluation of Ad Hoc Routing Protocols
Authors: Ku-Lan Kao, Chih-Heng Ke, Ce-Kuen Shieh
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper evaluates the video transmission performance of three well-known ad-hoc routing protocols. Due to high mobility and rapid movement characteristics, video transmission over ad-hoc networks is becoming more difficult than simple data transmission. Consequently, finding an efficient way for multimedia communication is becoming an important issue nowadays. We make a complete comparison between the two prominent on-demand reactive routing protocols, DSR and AODV, and the proactive DSDV routing protocol. Our improved simulation tool-set is used with NS-2 and myEvalvid-NT in this simulation, and we adopted the PSNR performance evaluation metric. Results indicate that DSDV is much worse than the other protocols for video transmission, and AODV is the best routing protocol in our simulation.
Information Delivery in Computational Mineral Science: The eMinerals Data Handling System
Authors: Toby O. H. White, Martin T. Dove, Richard P. Bruin, Kat F. Austen, Andrew M. Walker, Emilio Artacho, Arnaud Marmier, Steve C. Parker, Peter Murray-Rust, Andrew D. Walkingshaw, Philip A. Couch, Rik P. Tyer, Ilian T. Todorov, Dan J. Wilson
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Escience technologies are designed to address problems arising in the practice of computational science. The outcome of computational science is the generation of data, and a significant portion of these problems concern Information Delivery: the process of disseminating data across virtual organizations, and of contextualizing that data so that relevant quantities may be extracted and examined with the minimum of difficulty. This paper describes some of these issues encountered in the particular field of computational mineral science, and the solutions that the eMinerals consortium has developed to address them.