ppxscal/embedding_network huggingface dataset:
Moving surface extraction based on unordered hexagonal perfect submaps projection: Applications to 3D feature tracking
Authors: Antonio Adán, Andrés S. Vázquez, Carlos Cerrada, Santiago Salamanca
Venue: Image and Vision Computing (2009)

In this paper, we present a structured light technique based on the projection of a color coded hexagonal array that is able to obtain range images from moving scenes. Repetition and disorder is allowed in the codeword which implies several advantages: the mean Hamming distance between contiguous codewords of the pattern increases, the code loss due to occlusions and discontinuities can be efficiently handled and the computational cost in the pattern-image correspondence phase is highly reduced. The structured light projection system has been tested under real moving scenes on medium resolution range images and for slow controlled movements. In order to validate the performance of our range vision system we have used it to identify and track several 3D feature points as the scene moves. To measure the accuracy of the tracking a 6 DOF manipulator robot has been included in the experimental setup. All this experimental work, the results and the main contributions of our method compared to other perfect map and submap based techniques are detailed in the paper.
What queries are likely to recur in web search?
Authors: Dell Zhang, Jinsong Lu
Venue: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval (2009)

We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective query recurrence whereas query recency is more useful in predicting individual query recurrence. Our findings provide valuable insights for understanding and improving Web search.
Research Note---Wine Journalism---Marketing or Consumers' Guide?
Authors: Øyvind Horverak
Venue: Marketing Science (2009)

This article explores some aspects of wine journalism in Norwegian newspapers. Two issues are discussed: First, are wine sales influenced by wine journalists' reviews? Second, do experts agree on what makes a good wine buy? The results show that wine sales are indeed significantly influenced by the judgements of wine critics; a 10% rise in newspapers' scores in Norway was accompanied by an average increase of 16%--18% in sales figures for table wines. The effect of wine reviews varied somewhat from newspaper to newspaper. It proved difficult to establish criteria for a good wine buy that are objective and independent of the person making the judgement. The journalists gave no unanimous recommendation of good wine buys to the consumers; the same wine could get good reviews in some papers and might well receive run-of-the-mill reviews in others. However, a majority of the reviewers seemed to agree in the ranking of most of the wines, even if the absolute value of the scores differed.
A new MAC protocol for reducing effect of needless transmission deferment induced by missed RTS/CTS handshake
Authors: Tetsuya Shigeyasu, Daishi Inoue, Hiroshi Matsuno, Norihiko Morinaga
Venue: Mobile Information Systems (2009)

IEEE802.11DCF employs RTS/CTS (Request To Send/Clear To Send) mechanism for mitigating effect of hidden terminals. The RTS/CTS mechanism sets transmission deferral timer to neighbor terminals by exchanging RTS and CTS between transmitter and receiver. Then, in the case that RTS/CTS exchange succeeds, effect of hidden terminals could be suppressed, otherwise, any neighbor which received RTS and/or CTS defers its new transmission needlessly although DATA packet corresponding to the previous RTS/CTS exchange will not be transmitted. In this paper, we propose Cancel CTS, procedure in order to cope with the unnecessarily transmission deferment. Results of computer simulation confirms that our method well improves the throughput performance of IEEE802.11DCF.
Document engineering approaches toward scalable and structured multimedia, web and printable documents
Authors: Maria Da Pimentel, Dick C. Bulterman, Luiz Fernando Soares
Venue: Multimedia Tools and Applications (2009)

Document engineering is the computer science discipline that investigates systems for documents in any form and in all media. As with the relationship between software engineering and software, document engineering is concerned with principles, tools and processes that improve our ability to create, manage, and maintain documents ( http://www.documentengineering.org ). The ACM Symposium on Document Engineering is an annual meeting of researchers active in document engineering: it is sponsored by ACM by means of the ACM SIGWEB Special Interest Group. In this editorial, we first point to work carried out in the context of document engineering, which are directly related to multimedia tools and applications. We conclude with a summary of the papers presented in this special issue.
Belief revision with reinforcement learning for interactive object recognition
Authors: Thomas Leopold, Gabriele Kern-Isberner, Gabriele Peters
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

From a conceptual point of view, belief revision and learning are quite similar. Both methods change the belief state of an intelligent agent by processing incoming information. However, for learning, the focus in on the exploitation of data to extract and assimilate useful knowledge, whereas belief revision is more concerned with the adaption of prior beliefs to new information for the purpose of reasoning. In this paper, we propose a hybrid learning method called SPHINX that combines low-level, non-cognitive reinforcement learning with high-level epistemic belief revision, similar to human learning. The former represents knowledge in a sub-symbolic, numerical way, while the latter is based on symbolic, non-monotonic logics and allows reasoning. Beyond the theoretical appeal of linking methods of very different disciplines of artificial intelligence, we will illustrate the usefulness of our approach by employing SPHINX in the area of computer vision for object recognition tasks. The SPHINX agent interacts with its environment by rotating objects depending on past experiences and newly acquired generic knowledge to choose those views which are most advantageous for recognition.
On Bayesian techniques for evaluation of water quality
Authors: Kamarulzaman Ibrahim, Naiemah Mamat, Abdul Aziz Bidin, Ahmad Mahir Razali, Azami Zaharim
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

Clean water is essential for the sustainability of an ecosystem. The level of water pollution can be measured using Shannon diversity index based on certain indicator organism. In this study, Bayesian techniques, particularly hierarchical Bayesian models, were applied to the data of Shannon diversity indices found using the macro benthic organism for the period of August 2002 to September 2006 at three different stations in Bintulu waters. Sampling on the benthic organism was carried out every month for the first three months of the study period and every three months thereafter except for the period from February 2005 to March 2005. Three different hierarchical Bayesian models were fitted to the data. Based on the first two models, Models 1 and 2, analysis of individual station was carried out separately, with two slightly different assumptions for the first hierarchy of the models. Model 1 assumes that for a particular station, the observed indices over the study period follow a normal distribution with a common underlying mean and variance. However, Model 2 assumes that the observed indices, say at time j, follow a normal distribution with mean and variance specific to time j. Model 3 involves two stages of modeling where the first stage describes the distribution of the estimated mean for each station and the second stage allows for the variation of the means between stations. The overall results based on Model 3 indicated that the overall mean diversity index was 1.47, implying that the water quality had reached a warning level since the acceptable level of diversity index indicating no pollution is between 1.5 to 3.5.
The gMenu User Interface for Virtual Reality Systems and Environments
Authors: Andrew Dunk, Adrian Haffegee
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Desktop computers are able to provide a user interface with many features that allow the user to perform tasks such as execute applications load files and edit data. The gMenu system proposed in this paper is a step closer to having these same facilities in virtual reality systems. The gMenu can currently be used to perform a selection of common tasks provided by a user interface, for example executing or closing virtual reality applications or scenes. It is fully customisable and can be used to create many different styles of menu by both programmers and users. It also has shown promising results bringing some of the system based commands into the virtual environment, as well as keeping the functionality and adaptions required by applications. The use cases presented demonstrate a collection of these abilities.
Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures
Authors: V. I. Shynkarenko, V. M. Ilman, V. V. Skalozub
Venue: Cybernetics and Systems Analysis (2009)

A structural approach to modelling algorithms is proposed. The concept of an algorithmic structure with operations over algorithms is introduced. Models of algorithms constructed from algorithmic structures reflect aspects of algorithm representation and execution. Examples of structural and path models of algorithms are considered.
Digestive casebase mining based on possibility theory and linear unidimensional scaling
Authors: Anas Dahabiah, John Puentes, Basel Solaiman
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

In this paper, we present a very general and powerful approach that enables us to mine easily depending on the concept of similarity any casebase consisting of a large number of objects (cases) containing heterogeneous, imperfect and missing data by organizing and gathering these objects into meaningful groups in such a way that efficient analysis and retrieval of information could be easily achieved. Our method is based essentially on possibility theory and on the linear unidimensional scaling representation and is applied on a real digestive database.
Mining hidden associations in text corpora through concept chain and graph queries
Authors: Rohini K. Srihari
Venue:  (2008)

The availability of large volumes of text documents has created the potential to discover valuable information hidden in those texts. This in turn has created the need for automated methods of discovering such information without having to read it all. The main theme of this dissertation is based on the hypotheses that the whole (document collection) is greater than the sum of its parts (individual documents). Interesting links and hidden information that connect facts, propositions or hypotheses can be found by using novel text mining techniques along with traditional data mining techniques. We refer to this research area as unapparent information revelation (UIR). The goal of this dissertation is to automate techniques that will sift through these extensive document collections and find such links. Previous work in our UIR group has defined Concept Chain Queries (CCQ) and Concept Graph Queries (CGQ), special cases of text mining in document collections focusing on detecting links between two or more concepts across text documents. A concept chain query involving concepts A and B has the following meaning: find the most plausible relationships between concept A and concept B assuming that one or more instances of both concepts occur in the corpus, but not necessarily in the same document. Different from traditional search, CCQ is interpreted as finding the best concept chain and evidence trail across multiple documents that connect two concepts. CCQ can be extended to CGQ where three or more concepts are involved.In this dissertation, the UIR problem is approached from various perspectives. I adapt the traditional bag-of-words approach, the existing Association Rule Mining method and the Local Context Analysis technique to address this problem. Specifically, I have shown that it is possible to improve knowledge discovery in document collections through combining text retrieval and link analysis techniques. Additionally, an explanation of the retrieved chain (graph), in terms of a cross-document evidence trail, is also generated for further investigation. The latter is a special case of a cross document summary.Experiments on different data sets are presented that demonstrate the effectiveness of the new algorithm.
Optimal Control of Production Processes with Variable Execution Times
Authors: Davide Giglio, Riccardo Minciardi, Simona Sacone, Silvia Siri
Venue: Discrete Event Dynamic Systems (2009)

The paper deals with the optimal control of production processes characterized by the possibility of performing operations (relevant to the processing of a set of jobs) with variable execution times. A production process relevant to a single machine is addressed first. An optimization problem with a quite general cost function is considered, and some properties of optimal solutions are derived. Then, a particular version of the problem is analyzed, in which the cost function is the weighted sum of the quadratic earliness and tardiness of jobs and of quadratic deviations between pre-defined nominal unitary processing times and the actual ones. The decision variables of the problem are the possible idle times inserted before job executions and the processing times of jobs. This single machine problem is stated as an optimal control problem and a closed-loop solution is derived. Then, a second production process is considered, in which multiple machines serve jobs in parallel, again with variable processing times and with different processing costs. With reference to this second production scheme, a significant decision problem refers to the splitting of jobs over the different machines. Then, on the basis of a sensitivity analysis of the single machine problem solution, some conditions to verify the optimality of a pre-defined splitting are derived. An on-line splitting scheme using such conditions is finally presented.
Extending X3D for distributed multimedia processing and control
Authors: Michael Repplinger, Alexander Löffler, Benjamin Schug, Philipp Slusallek
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Web-based applications of interactive 3D computer graphics are showing a tendency to get more interconnected and visually complex. Virtual communities like Second Life demand realism not only in terms of realistic rendering, but also in terms of integrated multimedia content. For these Web-based applications, X3D is the ISO-standard way to specify and manipulate scene descriptions. In terms of multimedia integration, however, X3D offers to specify content only in the form of URLs pointing to files. Modern middleware for distributed multimedia, on the other hand, allows applications to harness the full range of multimedia processing as well as transparent use and full control of both local and remote components. Integrating a full multimedia processing pipeline into X3D would enable Web authors to use, for example, streaming media, post-processing on media streams, or routing between scene elements (e.g., sensors) and elements of multimedia processing (e.g., TV cards). A full integration of multimedia in X3D is yet missing. In this paper, we propose X3D extensions for a seamless mapping of a distributed multimedia flow graph onto an X3D scene graph, making all the features of a distributed multimedia middleware accessible and usable within an X3D scene. We present our proposed specification and implementation of multimedia nodes for X3D. Using examples and implemented X3D application scenarios, we show the simplicity and feasibility of our approach.
Integrating Viability Information into a Cardiac Model for Interventional Guidance
Authors: Helko Lehmann, Reinhard Kneser, Mirja Neizel, Jochen Peters, Olivier Ecabert, Harald Kühl, Malte Kelm, Jürgen Weese
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

It has been demonstrated that 3D anatomical models can be used effectively as roadmaps in image guided interventions. However, besides the anatomical information also the integrated display of functional information is desirable. In particular, a number of procedures such as the treatment of coro nary artery disease by revascularization and myocardial repair by targeted cell delivery require information about myocardial viability. In this paper we show how we can determine myocardial viability and integrate the information into a patient-specific cardiac 3D model. In contrast to other work we associate the viability information directly with the 3D patient anatomy. Thus we ensure that the functional information can be visualized in a way suitable for interventional guidance. Furthermore we propose a workflow that allows the nearly automatic generation of the patient-specific model. Our work is based on a previously published cardiac model that can be automatically adapted to images from different modalities like CT and MR. To enable integration of myocardial viability we first define a new myocardium surface model that encloses the left ventricular cavity in a way that suits robust viability measurements. We modify the model-based segmentation method to allow accurate adaptation of this new model. Second, we extend the model and the segmentation method to incorporate volumetric tissue properties. We validate the accuracy of the segmentation of the left ventricular cavity systematically using clinical data and illustrate the complete method for integrating myocardial viability by an example.
Flexible visualization of automatic simulation based on structured graph transformation
Authors: Enrico Biermann, Claudia Ermel, Jonas Hurrelmann, Karsten Ehrig
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis for simulation with the purpose to validate the model with respect to its requirements. Graph transformation systems have shown to be suitable for the definition of various kinds of visual modeling languages. They define a model’s operational semantics as the set of all transformations of a model which are specified by graph transformation rules. For automatic simulation, rules have to be structured to control their application order. During simulation, the state changes after each rule application should be visualized in the concrete syntax of the modeling language. In this paper, we propose a generic approach to specify simulation environments based on a model’s concrete syntax definition and suitable rule structuring techniques. We implement our approach using TIGER, a tool for defining visual languages based on graph transformation, and generate the specified simulation environment as plug-in for ECLIPSE. We demonstrate our approach by a case study for automatic simulation of Rubik’s Clock, a mechanical two-sided puzzle of clocks controlled by rotating wheels.
Learning Sequences Construction Using Ontology and Rules
Authors: Ruei-Yan Chen, Shian-Shyong Tseng, Chien-Liang Liu, Chun-Yen Chang, Chang-Sheng Chen
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

In this paper, we propose a SCORM-based (i.e., Shareable Content Object Reference Model), learning sequence construction model using DNS ontology and rules to simplify the complexity of learning sequence construction on DNS Tutoring subsystem of iDNS-KDE (http://idns-kde.nctu.edu.tw) system and to help alleviate the system management issues on the DNS domain.
Toward communicating simple sentences using pictorial representations
Authors: Rada Mihalcea, Chee Wee Leong
Venue: Machine Translation (2008)

This paper addresses and evaluates the hypothesis that pictorial representations can be used to effectively convey simple sentences across language barriers. The paper makes two main contributions. First, it proposes an approach to augmenting dictionaries with illustrative images using volunteer contributions over the Web. The paper describes the PicNet illustrated dictionary, and evaluates the quality and quantity of the contributions collected through several online activities. Second, starting with this illustrated dictionary, the paper describes a system for the automatic construction of pictorial representations for simple sentences. Comparative evaluations show that a considerable amount of understanding can be achieved using visual descriptions of information, with evaluation figures within a comparable range of those obtained with linguistic representations produced by an automatic machine translation system.
Development of a haptic environment for biomedical engineering simulation An educational software to help demonstrate a virtual human torso model
Authors: Behrad Vahedi, William Tiu
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In the current world, by and large, computer interaction relies on visual and auditory feedback and to make interactions more realistic, tactile response would be essential e.g. for medical training simulations.
A TCP starvation problem in combining TCP and max-weight scheduling of cross-layer algorithms in WMNs
Authors: Junhee Lee, Kyunghan Lee, Jinsung Lee, Jaesung Jung, Song Chong
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

In this paper, we investigate the problem coming from the adaptation of legacy protocol TCP to the cross-layer protocols that is likely happen in future Internet. We point out named a TCP starvation problem in combining TCP and max-weight scheduling of cross-layer algorithms in wireless mesh networks. TCP starvation occurs when neighbor nodes are already scheduled with large queue length. To overcome TCP starvation as denoted in this paper, we propose a simple remedy named fake-ACK algorithm.
Metareasoning for adaptation of classification knowledge
Authors: Joshua Jones, Ashok Goel
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

AI research on metareasoning for agent self-adaptation has generally focused on modifying the agent's reasoning processes (e.g., [2]). In this paper, we describe our ongoing work on the equally important problem of using metareasoning for modifying the agent's domain knowledge. Since classification is a ubiquitous task in AI, we consider the problem of using meta-knowledge for repairing classification knowledge when the classifier supplies an incorrect class label. More specifically, we consider the subclass of classification problems that can be decomposed into a hierarchical set of smaller classification problems; alternatively, problems in which features describing the world are progressively aggregated and abstracted into higher-level abstractions until a class label is produced at the root node. This subclass of classification problems is recognized as capturing a common pattern of classification [1] [3]. We will call this classification task compositional classification, and the hierarchy of abstractions an abstraction network (AN).