ppxscal/embedding_network huggingface dataset:
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
Authors: Li Zhang, Steven M. Seitz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterior (MAP) problem in which both a disparity map and MRF parameters are estimated from the stereo pair itself. We present an iterative algorithm for the MAP estimation that alternates between estimating the parameters while fixing the disparity map and estimating the disparity map while fixing the parameters. The estimated parameters include robust truncation thresholds for both data and neighborhood terms, as well as a regularization weight. The regularization weight can be either a constant for the whole image or spatially-varying, depending on local intensity gradients. In the latter case, the weights for intensity gradients are also estimated. Our approach works as a wrapper for existing stereo algorithms based on graph cuts or belief propagation, automatically tuning their parameters to improve performance without requiring the stereo code to be modified. Experiments demonstrate that our approach moves a baseline belief propagation stereo algorithm up six slots in the Middlebury rankings.
Controlling Learning
Authors: Jon Dron
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Sometimes, learners need to be in control. Sometimes, they need to delegate control to others, typically teachers. Often, with the aid of dialogue, the control is negotiated. Social software such as wikis, blogs and link sharing systems offer the potential to create online environments that enable students to choose the level of control that they need, However, it is very easy for this to be scary for both teachers and learners, and the extreme equalizing effect of such tools can lead to dangers that the blind might lead the blind, or that learners and teachers can become lost in a complex and uncoordinated structure of their own making. In this study we will examine the expected and unexpected outcomes of integrating a variety of social software into a new course, exploring the fears and misconceptions of both students and teacher.
Bayesian model order selection for the Karhunen-Loeve transform and the singular value decomposition
Authors: J. J. Rajan, P. J. W. Rayner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Discusses model order selection in relation to the discrete Karhunen-Loeve transform (DKLT) and the singular value decomposition (SVD). There are many applications of the DKLT and SVD where it is necessary to discard some of the small singular values that may represent corrupted signal information. Bayesian methods allow to determine the DKLT model order evidence which indicates the optimal number of basis vectors to choose for reconstruction such that the signal is not over-parameterised. Evidence methods can also be used for the SVD to determine the number of singular values (and hence the effective rank) of a singular or ill-conditioned matrix,.
Flow-based resource allocation in a multiple-access wireless market-setting using an auction
Authors: Matthias Roggendorf, Fernando Beltran
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

This paper presents a flow-based, auction-driven approach to resource allocation. This approach allows mobile stations to simultaneously negotiate for resources from competing providers. We use an auction at each provider to decide on the resource allocation, based on the offers made by agents representing mobile nodes. All agents in the system try to maximise their utility gained from the total allocation of resources. The focus of this paper is on the bidding strategy of a mobile station when faced with the opportunity to obtain network resources from multiple sources. We support the proposed bidding strategy by simulation experiments, which show that the resulting allocation is efficient under the limited scope of the simulation setup.We also show that multiple-access can increase the allocation efficiency compared to the situation in which agents have access to only one network.
Design of Ontology Mapping Framework
Authors: Zheng Liping, Li Guangyao, Shajing Shajing, Liang Yongquan
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Ontology heterogeneity is the primary obstacle for interoperation of ontology. Ontology mapping is the best way to solve this problem. In this paper, ontology heterogeneity and the current study situations of ontology mapping are discussed, and an ontology-mapping framework with a kind of hybrid architecture is put forward. An example of ontology mapping is given to explain the mapping framework.
Remembering the Office of the Future: The Origins of Word Processing and Office Automation
Authors: Thomas Haigh
Venue: IEEE Annals of the History of Computing (2006)

Word processing entered the American office in 1970 as an idea about reorganizing typists, but its meaning soon shifted to describe computerized text editing. The designers of word processing systems combined existing technologies to exploit the falling costs of interactive computing, creating a new business quite separate from the emerging world of the personal computer.
Simulation of fractal dimension evaluations
Authors: G. M. Behery
Venue: International Journal of Modelling and Simulation (2006)

A set of algorithms for computing the fractal dimension from image data is introduced. The advantages and disadvantages for each algorithm are clarified. The implementation of some of these algorithms for evaluating the fractal dimension to several images is also given. Such images are considered in the present work to be generated with the Mathematica package using fractal Brownian motion. Moreover, the author generates other images by introducing a noise with different levels to a smooth gray level surface. As a result, it is concluded that the Sarkar method gives results that are more efficient and accurate than the other considered results. Our conclusion is supported by charts illustrating these results.
Compliance Enforcement of Temporal and Dosage Constraints
Authors: P. H. Tsai, H. C. Yeh, C. Y. Yu, P. C. Hsiu, C. S. Shih, J. W. S. Liu
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Medication dispensers treated in this paper are designed to help improve compliance by users who live at homes and take medications over long periods of time. The paper first presents an overview of medication specifications that define constraints for dispensers and dispenser components that administer medications as specified. When given a specification and constraints defined by it, the dispenser scheduler checks for consistency and feasibility of constraints and schedules medications to meet the constraints. Several basic algorithms needed for these purposes are described and evaluated.
Strengthening the Weakest Link in Digital Protection
Authors: William Suchan, Edward Sobiesk
Venue: IEEE Security and Privacy (2006)

In our one-semester course at the US Military Academy in New York, we educate roughly 800 undergraduates from nontechnical fields each year on intermediate-level IT skills. We place our students in an isolated virtual-computing environment, give them hands-on experience with a variety of attack vectors that hackers use to exploit vulnerabilities, and provide them with a multidimensional framework for understanding and mitigating risks. As a result of this educational experience, our students are better able to internalize the concepts we teach and end up with an increased realization of the actions required to protect crucial resources.
Probabilistic strategies for the partition and plurality problems
Authors: Zdeněk Dvořák, Vít Jelínek, Daniel Král', Jan Kynčl, Michael Saks
Venue: Random Structures Algorithms (2007)

We consider a game played by two players, Paul and Carol. Carol fixes a coloring of n balls with three colors. At each step, Paul chooses a pair of balls and asks Carol whether the balls have the same color. Carol truthfully answers yes or no. In the Plurality problem, Paul wants to find a ball with the most common color. In the Partition problem, Paul wants to partition the balls according to their colors. Paul's goal is to ask Carol the fewest number of questions to reach his goal. We find optimal probabilistic strategies for the Partition problem and the Plurality problem in the considered setting. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Spreadsheet simulation
Authors: Andrew F. Seila
Venue: Proceedings of the 37th conference on Winter simulation (2005)

"Spreadsheet simulation" refers to the use of a spreadsheet as a platform for representing simulation models and performing simulation experiments. This tutorial explains the reasons for using this platform for simulation, discusses why this is frequently an efficient way to build simulation models and execute them, describes how to setup a spreadsheet simulation, and finally examines some limitations on the use of spreadsheets for simulation.
Dynamic Multi-Linked Negotiations in Multi-Echelon Production Scheduling Networks
Authors: Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which balances between global production cost and local utilities within the facilities.
A Hardware Resource Management System for Adaptive Computing on Dynamically Reconfigurable Devices
Authors: Toshiyuki Ito, Kazuya Mishou, Yuichi Okuyama, Kenichi Kuroda
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

This paper proposes a realization method of the computer system with dynamical hardware-resource allocation on dynamically reconfigurable devices. The system consists of two or more parts and they can change the number of processing units according to each processing load. In the system, there is a competition problem between these parts. In order to solve this problem, we investigate required functions of resource management units on a simple processing model. This model is an adapted load balancing model consisting of an upper management unit, two management units and processing units shared by them.
Complex Data-Intensive Systems and Semantic Grid: Applications in Satellite Missions
Authors: M. Sanchez-Gestido, L. Blanco-Abruna, M. S. Perez-Hernandez, R. Gonzalez-Cabero, A. Gomez-Perez, O. Corcho
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The use of a Semantic Grid architecture can ease the deployment of complex applications, in which several organizations are involved and where resources of diverse nature (data and computing elements) are shared. This is the situation in the Space domain, with a strong demand of computational resources inscribed in an extensive and heterogeneous network of facilities and institutions. This paper presents the S-OGSA architecture, defined in the Ontogrid project, as applied into a scenario for the overall monitoring and data analysis in a Satellite Mission currently in nominal operations. Flexibility, scalability, interoperability and use of a common framework for data sharing are the main advantages of a Semantic Grid implementation in Complex and dataintensive systems.
On achievable security levels for lattice data hiding in the known message attack scenario
Authors: Luis Pérez-Freire, Fernando Pérez-González, Teddy Furon
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret dither is used for watermarking multiple objects, an attacker can exploit the information leakage inherent to the lattice data hiding scheme in order to compute an estimate of the dither. Our analysis is aimed at measuring in an information-theoretic sense the amount of information that leaks from each watermarked signal, emphasizing the role of the embedding lattice on the achievable security level. The information leakage determines in a natural way the lowest dither estimation error attainable, which can be taken into account for design criteria. A comparison with spread spectrum methods in terms of security is also given.
Easy Grocery: 3D Visualization in e-Grocery
Authors: J. Somerville, L. J. Stuart, N. Barlow
Venue: Proceedings of the conference on Information Visualization (2006)

There are many deficiencies in the traditional electronic commerce schema. The main problem for consideration is the text and picture based design that underpins current HTML systems. This paper presents the online grocery shopping system called Easy Grocery which is available at www.easygrocery.co.uk. This system is based on the innovative concept of using a 3D system as an interface to the user during their shopping experience. Furthermore, this 3D system follows the mental model of the user as opposed to that of the developer. Additionally, the user is able to select the layout of the online store so that it matches the layout of their local store, thus enabling even new users to exploit their own knowledge of how items are organised to shop efficiently. The Easy Grocery system demonstrates that 3D online shopping can provide significant advantages for both consumers and retailers.
Ontology Driven Visualisation of Maps with SVG - An Example for Semantic Programming
Authors: Frank Ipfelkofer, Bernhard Lorenz, Hans Jurgen Ohlbach
Venue: Proceedings of the conference on Information Visualization (2006)

This article describes a particular use of ontologies for visualising maps in a browser window. Geographic data are represented as instances of concepts in an ontology of transportation networks which was designed in close relation to GDF. These data are transformed into SVG, whereas the transformation is specified symbolically as instances of a transformation ontology. This approach is extremely flexible and easily extendible to include all kinds of information in the generated maps. The basic implementation technique is to use classes and instances of ontologies in an intelligent way. This article is an abbreviated version of the research report [12].
Performance and overhead of semantic cache management
Authors: Björn Þór Jónsson, María Arinbjarnar, Bjarnsteinn Þórsson, Michael J. Franklin, Divesh Srivastava
Venue: ACM Transactions on Internet Technology (TOIT) (2006)

The emergence of query-based online data services and e-commerce applications has prompted much recent research on data caching. This article studies semantic caching, a caching architecture for such applications, that caches the results of selection queries. The primary contribution of this article is to revisit the performance and overhead of semantic caching using a modern database server and modern hardware. Initially, the performance study focuses on simple workloads and demonstrates several benefits of semantic caching, including low overhead, insensitivity to the physical layout of the database, reduced network traffic, and the ability to answer some queries without contacting the server. With moderately complex workloads, careful coding of remainder queries is required to maintain efficient query processing at the server. Using very complex workloads, we demonstrate that semantic caching works well in a range of applications, especially in network-constrained environments.
Auditory saliency captures visual timing: effect of luminance
Authors: Takuro Kayahara
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

A novel illusion in which saliency in an auditory stream (context) captures the timing of visual stimulus was reported by the author (Kayahara, 2005, Perception 34, 217). The illusion might indicate that cross-modal information binding is accomplished after "pre-process" such as grouping or segregation in one modality. In this study, the effect of luminance of visual stimulus on the illusion was examined, and regardless of the magnitude of the luminance, the illusion was robustly obtained.
Detecting opponent concessions in multi-issue automated negotiation
Authors: Scott Buffett, Luc Comeau, Bruce Spencer, Michael W. Fleming
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

An agent engaged in multi-issue automated negotiation can benefit greatly from learning about its opponent's preferences. Knowledge of the opponent's preferences can help the agent not only to find mutually acceptable agreements more quickly, but also to negotiate deals that are better for the agent in question. In this paper, we describe a new technique for learning about an opponent's preferences by observing its history of offers in a negotiation. Patterns in the similarity between the opponent's offers and our own agent's offers are used to determine the likelihood that the opponent is making a concession at each stage in the negotiation. These probabilities of concession are then used to determine the opponent's most likely preference relation over all offers. Experimental results show that our technique significantly outperforms a previous method that assumes that a negotiation agent will always make concessions during the course of a negotiation.
An RSA Implementation Resistant to Fault Attacks and to Simple Power Analysis
Authors: Christophe Giraud
Venue: IEEE Transactions on Computers (2006)

Nowadays, Side Channel Attacks allow an attacker to recover secrets stored in embedded devices more efficiently than any other kind of attack. Among the former, Fault Attacks (FA) and Single Power Analysis (SPA) are probably the most effective: When applied to straightforward implementations of the RSA cryptosystem, only one execution of the algorithm is required to recover the secret key. Over recent years, many countermeasures have been proposed to prevent Side Channel Attacks on RSA. Regarding Fault Attacks, only one countermeasure offers effective protection and it can be very costly. In this paper, we focus on a means to counteract Fault Attacks by presenting a new way of implementing exponentiation algorithms. This method can be used to obtain fast FA-resistant RSA signature generations in both the Straightforward Method and Chinese Remainder Theorem modes. Moreover, as it has been shown that Fault Attacks can benefit from the weaknesses introduced by some SPA countermeasures, we ensure that our method resists SPA and, thus, does not require supplementary SPA countermeasures.
Sensornet 2.0: The New Frontier
Authors: Feng Zhao
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Feng Zhao (http://research.microsoft.com/~zhao) is a Principal Researcher at Microsoft Research, where he manages the Networked Embedded Computing Group. He received his PhD in Electrical Engineering and Computer Science from MIT and has taught at Stanford University and Ohio State University. Dr. Zhao was a Principal Scientist at Xerox PARC and directed PARC's sensor network research effort. He serves as the founding Editor-In-Chief of ACM Transactions on Sensor Networks, and has authored or co-authored more than 100 technical papers and books, including a recent book published by Morgan Kaufmann, "Wireless Sensor Networks: An Information Processing Approach." He has received a number of awards, and his work has been featured in news media such as BBC World News, BusinessWeek, and Technology Review.
Information of Binding Sites Improves Prediction of Protein-Protein Interaction
Authors: Tapan Patel, Manoj Pillay, Rahul Jawa, Li Liao
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Protein-Protein interaction is essential to cellular functions. In this work, we describe a simple, novel approach to improve the accuracy of predicting protein-protein interaction by incorporating the binding site information. First, we assess the importance of the seven attributes that are used by Bradford et. al (2005) for predicting protein binding sites. The leave-one-out cross validation experiments and principal component analysis indicate that some attributes such as residue propensity and hydrophobicity are more important than other attributes such as curvedness and shape index in differentiating a binding patch from nonbinding patch. Second, we incorporate those attributes to predict protein-protein interaction by simple concatenation of the attribute vectors of candidate interacting partners. A support vector machine is trained to predict the interacting partners. This is combined with using the attributes directly derived from the primary sequence at the binding sites. The results from the leave-one-out cross validation experiments show significant improvement in prediction accuracy by incorporating the structural information at the binding sites.
A Multi-Layer Ubiquitous Middleware for Bijective Adaptation between Context and Activity in a Mobile and Collaborative learning
Authors: Jihen Malek, Mona Laroussi, Alain Derycke
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In all learning scenarios and especially mobile and collaborative ones, the learner's context is an essential asset in designing the learning process. Researches in context aware mobile learning have concentrated on how to adapt applications to context. In this paper, we present an innovative approach for modeling a bijective adaptation between context and learning activities because they influence each others in learning processes. Furthermore, it proposes an ubiquitous middleware, a new multi-layer conceptual framework for building contextaware mobile learning systems. This framework supports tasks including: acquiring, interpreting, modeling, storing, reasoning, updating and adapting context. The originality of this framework comes especially from its top-most layer which is an adaptor that defines two classes of functionalities: the adaptation of learning activity to context and the adaptation of context to learning activity.