ppxscal/embedding_network huggingface dataset:
Using ontologies and fuzzy relations in multimedia personalization
Authors: Phivos Mylonas, Manolis Wallace
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

In this paper we extend on previous work in order to address the problem of multimedia personalization at a semantic level. In different previous works we have developed algorithms to address computationally efficient handling of large but sparse fuzzy relations, and theory to address knowledge representation, thematic categorization and user modeling. In this work we take two further steps: i) we integrate ontologies in our original knowledge modeling approach and ii) we explain how these diverse algorithms and methodologies can be combined in order to approach a greater goal, that of semantic multimedia personalization.
Performance Evaluation of Dual Authentication Scheme in Mobile IPv6 Networks
Authors: Jong-Hyouk Lee, Tai-Myoung Chung
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Open medium transmission makes wireless networks convenient to use, easy to deploy, and probably more economic, while at the same time it brings up many security problems. Thus, security mechanisms are proposed to protect communications. As one of most widely used security mechanisms, authentication is used to identify mobile nodes, prevent unauthorized usage, and negotiate credentials. Unfortunately, authentication mechanisms have been proposed up to now are impertinent in case of a mobile node has a high velocity or is in the ping-pong effect. In this paper, we propose a dual authentication scheme using Identity-Based Encryption. Using this scheme, a mobile node employs a dual authentication policy so that it reduces the fault rate of authentication up to about 57.1% based on the same network parameters and solves the ping-pong effect. Numerical results presented in this paper shows that our scheme has superior performance comparing to the standard AAA architecture.
The problem of describing a problem: Supporting laypersons in presenting their queries to the Internet-based helpdesk
Authors: Matthias Nückles, Anna Ertelt
Venue: International Journal of Human-Computer Studies (2006)

Internet-based helpdesks for hardware and software are a common way to get expert advice. To communicate effectively with experts, laypersons should be able to provide the expert with a concise and comprehensive description of their computer problem. However, previous research on computer helpdesks has shown that laypersons' problem descriptions typically exhibit a number of unfavourable features making it difficult for the helpdesk expert to develop a correct understanding of the problem. Based on a discussion of these features, we developed a problem formulation script that supports laypersons in describing their computer problems. We conducted an experimental study (54 laypersons and 54 experts), which tested the effectiveness of different versions of the problem formulation script to improve the quality of laypersons' problem descriptions. The results show that computer experts were best able to reconstruct the actual problem from the layperson's description if they were prompted to describe successively (1) the goal of their interaction with the computer, (2) the steps they had undertaken so far and (3) a hypothesis why they had failed to reach the aim. The script helped the laypersons provide the relevant context information necessary to develop an adequate mental model of the problem. Hence, guiding laypersons' problem descriptions by a problem formulation script proved to be a successful approach to support Internet-based helpdesk communication between computer experts and laypersons.
MPEG-4 BIFS profile for 3D data contents on DMB
Authors: Hyun-Jeong Yim, Yoon-Chul Choy, Min-Hyung Choi, Soon-Bum Lim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

DMB (Digital Multimedia Broadcasting) choose MPEG-4 BIFS Core2D @ Level 1 as its domestic data standard to provide better service. MPEG-4 BIFS Core 2D @ Level 1 can represent simple 2D objects overlaying on video layer, and do not include 3D object representation. In this paper, we suggest a DMB profile of 3D representation for using 3D graphics on mobile multimedia environments. To define a profile, we survey the characteristic of DMB contents and analyze other standards for 3D representation on mobile environments such as OpenGL|ES, Direct3D Mobile and JSR184. Based upon the analysis, we composed a 3D profile on DMB by selecting suitable nodes for 3D contents from BIFS nodes and to verify the suggested profile, test contents were created.
Production Modeling Corp.
Authors: Onur Ülgen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We discuss applications of two specialized simulators. KanbanSIM is an assembly line simulator that optimizes the Card and Call Kanbans in the line while minimizing the flow and material handling in the system, capturing the variability in delivey of material and inventory levels at assembly stations, showing effects of material hanndling equipment scheduling, etc. PTMSim is a powerful simulation analysis tool for engine and transmission manufacturing lines. It provides users with predefined and parameterized manufacturing objects that are typical to such manufacturing environments. Threedimensional animation enables a better vision and shortens training time. Application of PTMSim to an engine line is discussed in detail.
The use of video-conferencing as a mechanism to facilitate and assess project-based learning
Authors: Jonathan E. Singer
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The focus of my thesis work is on the development and testing of an authentic assessment program to be used with Project-Based learning (PjBL). The student projects utilized in this study are conducted by high school students working over extended periods of time (minimum, one semester) to select and solve scientific or mathematical problems. The student subjects are high school seniors who are involved in a computational science class in which the completion of the project(s) is a primary component of the curriculum. The subjects are from two distinctly different locations in Missouri. The first site is located in a small agriculturally based town of northwestern Missouri. Site two is an upper-middle class suburban community located just outside Kansas City. Classes from both sites are taught by a team of two experienced (math and science) teachers and have a similar levels of computer technology available to facilitate the projects. The available technology includes direct internet access within the classroom, video conferencing capabilities, multiple (> 10) Macintosh, Windows and UNIX computers, and various software programs. Both sites are also part of NSF funded research program which provides them with technical support from the University of Missouri-Columbia.
On a Qualitiative Approximate Inclusion -- Application to the Division of Fuzzy Relations
Authors: PatricK Bosc, Olivier Pivert
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

This paper is devoted to an extension of the inclusion operator. The logical view of the inclusion between fuzzy sets rests on the use of fuzzy implications. The idea suggested in this paper is to relax R-implications in order to tolerate low-level intensity exceptions and thus obtain a qualitative approximate inclusion. A concrete usage of this type of inclusion is illustrated in the area of databases, with the approximate division of relations.
Model-Based Face De-Identification
Authors: Ralph Gross, Latanya Sweeney, Fernando de la Torre, Simon Baker
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Advances in camera and computing equipment hardware in recent years have made it increasingly simple to capture and store extensive amounts of video data. This, among other things, creates ample opportunities for the sharing of video sequences. In order to protect the privacy of subjects visible in the scene, automated methods to de-identify the images, particularly the face region, are necessary. So far the majority of privacy protection schemes currently used in practice rely on ad-hoc methods such as pixelation or blurring of the face. In this paper we show in extensive experiments that pixelation and blurring offers very poor privacy protection while significantly distorting the data. We then introduce a novel framework for de-identifying facial images. Our algorithm combines a model-based face image parameterization with a formal privacy protection model. In experiments on two large-scale data sets we demonstrate privacy protection and preservation of data utility.
EDF: A framework for Semantic Annotation of Video
Authors: Pradeep Natarajan, Ramakant Nevatia
Venue: Proceedings of the Tenth IEEE International Conference on Computer Vision Workshops (2005)

Semantic annotation of multimedia data is needed for various tasks like content based indexing of databases and also for making inferences about the activities taking place in the environment. In this paper, we present a top level ontology which provides a framework for describing the semantic features in video. We do this in three steps - First, we identify the key components of semantic descriptions like objects and events and how domain specific ontologies can be developed from them. Second, we present a set of predicates for composing events and for describing various spatio-temporal relationships between events/entities. Third, we develop a scheme for reasoning with the developed ontologies to infer complex events from simple events using relational algebra. Finally, we have demonstrated the utility of our framework by developing an ontology for a specific domain. We conclude by analyzing the performance of the reasoning mechanism with simulated events in this domain.
WS-Auction: Mechanism Design for aWeb Services Market
Authors: Tiberiu Stef-Praun, Vernon Rego
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

As distributed systems become more complex in terms of the functionality and heterogeneity of their components, the ownership of those components becomes an issue in the allocation phase of the system design. The mechanism design community has addressed the allocation problem in an efficient, truthful, strategyproof way in several settings such as combinatorial auctions, on-line auctions, distributed allocation computation or information elicitation. We are extending the scope of mechanism design by shifting the focus from efficient individual allocations to systemwide efficient allocations. In this setting, we are addressing the spatial and temporal fragmentation of the information characteristic to a distributed market. This paper shows that the necessary mechanism for obtaining an efficient outcome in a distributed market is an indirect auction with provisional allocation and historical information. We also suggest and evaluate the bidding strategy in such an environment, and we show that the truthful strategy is to bid the true valuation at the arrival time in the system.
Virtually enhancing the perception of user actions
Authors: Patrick Horain, José Marques Soares, Piyush Kumar Rai, André Bideau
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper proposes using virtual reality to enhance the perception of actions by distant users on a shared application. Here, distance may refer either to space (e.g. in a remote synchronous collaboration) or time (e.g. during playback of recorded actions). Our approach consists in immersing the application in a virtual inhabited 3D space and mimicking user actions by animating avatars. We illustrate this approach with two applications, the one for remote collaboration on a shared application and the other to playback recorded sequences of user actions. We suggest this could be a low cost enhancement for telepresence.
Authoring tools for mobile multimedia content
Authors: T. Jokela
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

The latest generation of mobile phones comes with a rich set of capabilities for presenting multimedia information and it is expected that the mobile phone will soon be one of the most widespread devices for consuming multimedia content. In this paper, we present an overview of the key opportunities and challenges in developing tools for authoring multimedia content for the mobile environment. First, we discuss on a general level the different needs of professionals, hobbyists, and ordinary phone users for mobile multimedia authoring tools. We then focus on easy-to-use mobile phone based authoring tools aimed for ordinary phone users. We present some of the most important applications of user-created mobile multimedia content. We conclude by looking at the typical characteristics of the current and near future mobile phones from the perspective of multimedia content authoring and discussing two common authoring approaches used.
On the dynamics of the LRE algorithm: a distribution learning approach to adaptive equalization
Authors: T. Adali, M. K. Sonmez, K. Patel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We present the general formulation for the adaptive equalization by distribution learning introduced by Adali (see Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, vol.3, p.297-300, April 1994) In this framework, adaptive equalization can be viewed as a parametrized conditional distribution estimation problem where the parameter estimation is achieved by learning on a multilayer perceptron (MLP). Depending on the definition of the conditioning event set either supervised or unsupervised (blind) algorithms in either recurrent or feedforward networks result. We derive the least relative entropy (LRE) algorithm for binary data communications and analyze its statistical and dynamical properties. Particularly, we show that LRE learning is consistent and asymptotically normal by working in the partial likelihood estimation framework, and that the algorithm can always recover from convergence at the wrong extreme as opposed to the MSE based MLP's by working within an extension of the well-formed cost functions framework of Wittner and Denker (1988). We present simulation examples to demonstrate this fact.
A Tool to Compute ReliableWeb Links and Its Applications
Authors: Akiyoshi Nakamizo, Toshinari Iida, Atsuyuki Morishima, Shigeo Sugimoto, Hiroyuki Kitagawa
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We are developing a software tool that finds destinations (new URLs) of Web pages after pages are moved. A point of the tool is that it tries to find "reliable Web links," which are links always to be kept updated. We believe this is a new approach in finding new URLs for Web pages. This paper explains how the tool works internally and shows some results of its applications to the problem of finding new locations of real Web pages.
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
Authors: Alysson Neves Bessani, Joni da Silva Fraga, Miguel Correia, Lau Cheuk Lung
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes subject to Byzantine failures using shared memory have appeared. This paper presents a new computing model in which shared memory objects are protected by fine-grained access policies, and a new shared memory object, the policy-enforced augmented tuple space (PEATS). We show the benefits of this model by providing simple and efficient consensus algorithms. These algorithms are much simpler and use less memory bits than previous algorithms based on ACLs and sticky bits. We also prove that PEATSs are universal (they can be used to implement any shared memory object), and present a universal construction.
Robust stability check of fractional order linear time invariant systems with interval uncertainties
Authors: YangQuan Chen, Hyo-Sung Ahn, Igor Podlubny
Venue: Signal Processing (2006)

For uncertain fractional-order linear time invariant (FO-LTI) systems with interval coefficients described in state space form, the robust stability check problem is solved for the first time in this paper. Both the checking procedure and the Matlab code are presented with two illustrative examples. The conservatism is shown to be small.
Logics of propositional control
Authors: Jelle Gerbrandy
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The 'Cooperation Logic of Propositional Control', CL-PC, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a certain state of affairs in a situation in which each of the agents controls a number of propositional variables.We present a number of generalizations of this model, to represent situations in which agents only partially control the value of a variable, or cases in which agents share the control of a variable. We discuss and axiomatize some of these logics of 'partial control.' In addition, we show how this family of logics are closely connected to a body of work in mathematical logic: Cylindric Modal Logic.
Identifying Community Structure in Semantic Peer-to-Peer Networks
Authors: Hanhua Chen, Hai Jin
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The research community has turned to create Semantic Overlay Networks for information retrieval in large scale peer-to-peer networks. Much research work in semantic overlay protocols and searching algorithms is done and their results indicate that semantic overlay is powerful for content searching in peer-to-peer network. However, very limited work has been done in analyzing and evaluating characteristic about semantic overlay network. In this paper we identify a natural property of semantic overlay network, community structure. We setup a mathematical model to evaluate the community structure property. A heuristic backtrace-greedy hybrid algorithm is also designed to optimize the evaluation value of a given overlay network. Using the evaluation model we compare the SemreX semantic overlay with the Gnutella network. We find that the SemreX overlay network has a distinct feature of community structure, while the Gnutella network does not have such feature.
A Measurement Study of the Structured Overlay Network in P2P File-Sharing Applications
Authors: Mo Zhou, Yafei Dai, Xiaoming Li
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The architecture of P2P file-sharing applications have been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, robustness of the system, and to make it free from single- point failure. We believe that the measurement study of the overlay network used in the real file-sharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, the modified client provides view to the overlay network from a single user vision. Second, the instances of crawler pro- grams deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDos at- tack can be launched.
Semiotic Dynamics for Embodied Agents
Authors: Luc Steels
Venue: IEEE Intelligent Systems (2006)

Semiotic dynamics involves the processes whereby groups of people or artificial agents collectively invent and negotiate shared semiotic systems, which they use for communication or information organization. Tagging systems (such as Flickr, CiteULike, del.icio.us, orconnotea) offer examples of human semiotic dynamics at work, aided by technologies such as the Internet but also by a new sense of collective action in an increasingly connected world.Semiotic dynamics builds on many earlier AI developments: the insights into and technologiesof semantic networks and knowledge representation from the seventies, the ideas onembodiment and grounding from the late eighties, and the perspective of multiagent systemsfrom the nineties. But all these aspects join together into a new vision on intelligence, with thesocial, collective dynamics of representation-making at the center. These new AIdevelopments don't stand in isolation; they resonate with recent developments in linguistics,psychology, and the mathematical study of networks. This article briefly illustrates the currentstudy of semiotic dynamics, the resulting technologies, and the field's impact on current andfuture intelligent systems applications. This article is part of a special issue on the Future of AI.
A Recommender Agent for Software Libraries: An Evaluation of Memory-Based and Model-Based Collaborative Filtering
Authors: Frank McCarey, Mel O. Cinneide, Nicholas Kushmerick
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Software Agents can conveniently facilitate knowledge discovery and knowledge sharing across an organisation. We contend that programming tasks are often mimicked, that knowledge concerning reusable libraries can be extracted automatically from source code repositories, and that this knowledge can then be filtered and presented to a developer in a manner that will encourage and support future software reuse. We describe RASCAL, a recommender agent that continually recommends a set of task-relevant library methods to a developer. RASCAL learns information regarding how a particular reusable library is used and then employs this insight to make task-relevant recommendations to a developer. In this paper we detail our RASCAL agent and compare two recommendation techniques, namely Memory-Based and Model-Based Collaborative Filtering. We are interested in producing a scalable and efficient real-time recommender and thus ideally would favour a Model-Based approach. However, each scheme is evaluated against both runtime performance and recommendation accuracy. We present results and discuss the merits and limitations of each technique.
An Algorithm for Computing Global-Based Outlier Degrees on Data Sets
Authors: Takeshi Fushimi, Yoko Kamidoi, Shinichi Wakabayashi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Huge information can be easily collected now due to drastic improvement in computer throughput and cost reduction of mass memory medium. Recently, there is a strong expectation for establishment of a new technology called data mining for discovering useful knowledge from a lot of data in various fields. One of these technologies is t o detect outliers. Detecting outliers is a technology that is useful for detecting fraud, finding exceptional data and other by detecting abnormal data objects from data such as business data and network access log. The aim of this research is to assign a high outlier degree to a data object, which is globally separated from clusters. We propose a method of calculating global-based outlier degrees on data sets, and the proposed method is evaluated experimentally.