ppxscal/embedding_network huggingface dataset:
Augmenting Shape with Appearance in Vehicle Category Recognition
Authors: Ozge C. Ozcanli, Amir Tamrakar, Benjamin B. Kimia
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Shape is an important cue for generic object recognition but can be insufficient without other cues such as object appearance. We explore a number of ways in which the geometric aspects of an object can be augmented with its appearance. The main idea is to construct a dense correspondence between the interior regions of two shapes based on a shape-based correspondence so that the intensity and gradient distributions can be compared, e.g., using a mutual information paradigm. Three methods for regional alignment are suggested and compared here, based on: (i) propagation of correspondences from the silhouette to parallel curves in the interior, (ii) intersection of line segments anchored on corresponding points on the contour, and (iii) correspondence of shape skeletons. These methods have been implemented and applied to vehicle category recognition from aerial videos under known viewing and illumination conditions. We have constructed a photo-realistic synthetic video database to explore the performance of these methods under controlled conditions. We have also tested these algorithms on real video collected for this purpose from a balloon. Our findings indicate that (i) augmenting shape with appearance significantly increases recognition rate, and (ii) the region correspondence induced by the shape skeleton yields the highest performance.
Privatized rural postman problems
Authors: Julián Aráoz, Elena Fernández, Cristina Zoltan
Venue: Computers and Operations Research (2006)

In this work we analyze the privatized rural postman problem which is the edge version of the traveling salesman problems with profits.The problem is defined on a undirected graph G(V, E) with a distinguished vertex d, called the Depot. There are two non-negative real functions on the edge set E, which define the value of a cycle in G: one is the profit function, b, and the other one is the cost function, c. They have different meanings when a cycle C traverses an edge e (possibly more than once), because we pay a cost ce every time e is traversed, but we collect the profit be only the first time e is traversed. The privatized rural postman problem is to find a cycle C*, passing through d and not necessarily simple, which maximizes the sum of the values of the edges traversed in C*. That is, maxC {Σe∈C (be - teCe)} where te is the number of times that edge e is traversed in C.We study some properties of the problem: we show that it is NP-hard, its relation with known and new problems, and special cases with good algorithms. We also analyze several integer linear systems of inequalities, which define the polyhedral structure of the problem, and we give dominance and preprocessing conditions. We finish with some remarks and comments about future research.
Strangeness Based Feature Selection for Part Based Recognition
Authors: Fayin Li, Jana Ko!secka, Harry Wechsler
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Motivated by recent approaches to object recognition, where objects are represented in terms of parts, we propose a new algorithm for selecting discriminative features based on strangeness measure. We will show that k-nearest neighbour strangeness can be used to measure the uncertainty of individual features with respect to the class labels and forms piecewise constant decision boundary. We study its properties and generalization capability by comparing it with optimal decision boundary and boundary obtained by k-nearest-neighbor methods. The proposed feature selection algorithm is tested both in simulation and real experiments, demonstrating that meaningful discriminative local features are selected despite the presence of large numbers of distractors. In the second stage we demonstrate how to integrate the local evidence provided by the selected features in the boosting framework in order to obtain the final strong classifier. The performance of the feature selection algorithm and the classifier is evaluated on the Caltech five object category database, achieving superior results in comparison with existing approaches at lower computational cost.
Privacy, Security and Trust in P2P environments: A Perspective
Authors: Anirban Mondal, Masaru Kitsuregawa
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The Peer-to-Peer (P2P) paradigm of computing has been growing dramatically in popularity over the last decade. Consequently, large amounts of data are being shared among P2P users on a global-scale. Given the inherently untrustworthy nature of P2P networks, this paper provides a perspective concerning trust, privacy and security issues in P2P networks. Additionally, we discuss the applicability of the P2P paradigm to new application domains, the aim being to ensure that the power of the P2P paradigm goes well beyond P2P file-sharing interactions.
On using Monte Carlo methods for scheduling
Authors: Samarn Chantaravarapan, Ali Gunal, Edward J. Williams
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of &pi; by tossing a needle onto striped paper) to analyze phenomena which, due to their complexity and/or stochasticity, are beyond the reach of closed-form equations. Basic examples of such studies are estimating the probability that military field communications will remain intact in the face of attack or the number of fish in an irregularly shaped lake. Likewise, scheduling is a necessity for the planning, control, and implementation of increasingly large projects in manufacturing, civil construction, military operations, and many other fields. We provide a framework for applying scheduling algorithms based on Monte Carlo simulation, to provide a scheduler, who inevitably confronts numerous uncertainties, an inexpensive and a highly customizable tool that can be utilized in a common spreadsheet environment.
Magnetic resonance properties of La0.8Sr0.2MnO3 small particles
Authors: Yu. A. Koksharov, V. N. Nikiforov, V. D. Kuznetsov, G. B. Khomutov
Venue: Microelectronic Engineering (2005)

Single-phase nanoparticles of La"0"."8Sr"0"."2MnO"3 have been synthesized via the freeze-drying synthesis technique and subsequent high-energy ball-milling. Transmission electron microscopy images showed aggregates of 300-500nm in size which consisted of spherical particles characterized by average diameter 30-50nm. Magnetic and magnetic resonance experiments on the nanoparticles allow us to determine their Curie temperature T"C=323+/-3K, which was markedly higher than value 302+/-2K of corresponding bulk single-crystalline sample. Short-range ferromagnetic correlations can be responsible for increasing of T"C in the manganite nanoparticles. We also found a significant enhancement of magnetic spin relaxation in the nanoparticles in comparison with the bulk samples. The observed effect can be explained by a strengthening of the spin-lattice relaxation for Mn^3^+ ions in the La"0"."8Sr"0"."2MnO"3 nanoparticles due to the increase of non-cubic components of the crystal field.
A Contention Window Based Differentiation Mechanism for providing QoS in Wireless LANs
Authors: Mayank Mishra, Anirudha Sahoo
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Running real time applications over wireless LANs is becoming common place. These applications require QoS. But the most widely used wireless LAN, IEEE 802.11, does not have QoS support. Hence, providing QoS in 802.11 WLANs is an important issue due to its large installation base. In this paper, we propose a priority based service differentiation mechanism at the MAC layer. The MAC assigns different contention windows to two priority classes to provide service differentiation. The MAC protocol was designed such that minimal change is required in 802.11 firmware and yet the performance is comparable to 802.11e MAC. When collision occurs, contention window is increased in a linear fashion and the new contention windows for high and low priority traffic become non-contiguous. This unique method of contention window management provides better relative performance between the two classes. We also propose an enhancement to our base protocol that further increases throughput at light load condition. We present our simulation experiment results that show that our protocol has performance comparable to 802.11e.
GOLI: Greedy On-Demand Routing Scheme Using Location Information for Mobile Ad Hoc Networks
Authors: Hiroshi Nakagawa, Kenji Ishida, Tomoyuki Ohta, Yoshiaki Kakuda
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In mobile ad hoc networks, routing schemes using location information have been proposed recently. The location information is able to be provided by location sensors, GPS devices, and so forth. In a typical on-demand routing scheme LAR (Location-Aided Routing) with location information has possibility to increase the number of control packets, because LAR uses flooding for route generation and route maintenance. Therefore, we present a new routing scheme GOLI (Greedy On-demand routing using Location Information) which can reduce the number of control packets and assure data packets to deliver to the destination node. Then, we show the effectiveness of the proposed scheme by simulation experiments.
Verification Framework for Dynamic Collaborative Services in Service-Oriented Architecture
Authors: W. T. Tsai, Qian Huang, Bingnan Xiao, Yinong Chen
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

This paper introduces a dynamic verification framework for collaborative services in Service- Oriented Architecture (SOA). Collaboration plays a critical role in SOA, an effective verification framework for collaboration will greatly reduce the effort for rapid and adaptive service composition and evaluation of applications based on collaborative services. The verification framework provides a service-oriented infrastructure for completeness and consistency analyses, model-checking, simulation, and policy enforcement of process specification based on collaborative services in SOA. The paper presents the concepts, architecture, profiling techniques and illustrative examples that demonstrate the concepts and the techniques.
On the price of anarchy in unbounded delay networks
Authors: Tao Wu, David Starobinski
Venue: Proceeding from the 2006 workshop on Game theory for communications and networks (2006)

We investigate the worst case delay ratio between the Nash equilibrium and the social optimum in networks of N parallel links (routes) with unbounded delay functions. We compute this ratio, known as the "price of anarchy", for the case when the link delay functions correspond to M/M/ 1-FCFS or M/G/ 1-PS. For this problem, we find that the price of anarchy depends on the network topology in the sense that it is precisely equal to N. We then extend our results to M/G/ 1-FCFS and G/G/ 1-FCFS delay functions and compute the price of anarchy in a heavy load regime. Our results indicate that, even in very simple topological settings, the price of selfish behavior can potentially be very high.
An Evolutionary Approach to the Selection and Allocation of Distributed Cubes
Authors: Jorge Loureiro, Orlando Belo
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

The materialization of mu ltidimensional structures is a common way to speed up OLAP queries. Since there might be a huge number of those structures, a variety of proposals tried to select the most beneficial set, based on the profile of the queries and observing some constraints as materializing space and maintenance time, addressing a centralized storage facility. Only recently, the dist ributed scenario came to stage on this area, introducing the space dimension (and corresponding communication costs) into the equation to minimize costs. This paper focuses on the selection and allocation of distributed OLAP cubes, using evolutionary algorithms, having an extended aggregation lattice as framework to capture the distributed semantics. Moreover, the evaluation of the fitness of evolutionary solutions is based on cost estimation algorithms that simulate the execution of parallel tasks, using time units as cost metric.
Video Completion by Motion Field Transfer
Authors: Takaaki Shiratori, Yasuyuki Matsushita, Xiaoou Tang, Sing Bing Kang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Existing methods for video completion typically rely on periodic color transitions, layer extraction, or temporally local motion. However, periodicity may be imperceptible or absent, layer extraction is difficult, and temporally local motion cannot handle large holes. This paper presents a new approach for video completion using motion field transfer to avoid such problems. Unlike prior methods, we fill in missing video parts by sampling spatio-temporal patches of local motion instead of directly sampling color. Once the local motion field has been computed within the missing parts of the video, color can then be propagated to produce a seamless hole-free video. We have validated our method on many videos spanning a variety of scenes. We can also use the same approach to perform frame interpolation using motion fields from different videos.
No Right to Speak? The Relationship between Object Naming and Semantic Impairment: Neuropsychological Evidence and a Computational Model
Authors: M. A. Lambon Ralph, J. L. Mcclelland, K. Patterson, C. J. Galton, J. R. Hodges
Venue: Journal of Cognitive Neuroscience (2001)

The processes required for object naming were addressed in a study of patients with semantic dementia (a selective decline of semantic memory resulting from progressive temporal lobe atrophy) and in a computational model of single-word production. Although all patients with semantic dementia are impaired in both single-word production and comprehension, previous reports had indicated two different patterns: (a) a parallel decline in accuracy of naming and comprehension, with frequent semantic naming errors, suggesting a purely semantic basis for the anomia and (b) a dramatic progressive anomia without commensurate decline in comprehension, which might suggest a mainly postsemantic source of the anomia. Longitudinal data for 16 patients with semantic dementia reflected these two profiles, but with the following additional important specifications: (1) despite a few relatively extreme versions of one or other profile, the full set of cases formed a continuum in the extent of anomia for a given degree of degraded comprehension; (2) the degree of disparity between these two abilities was associated with relative asymmetry in laterality of atrophy: a parallel decline in the two measures characterized patients with greater right- than left-temporal atrophy, while disproportionate anomia occurred with a predominance of atrophy in the left-temporal lobe. In an implemented computational model of naming, semantic representations were distributed across simulated left- and right-temporal regions, but the semantic units on the left were more strongly connected to left-lateralized phonological representations. Asymmetric damage to semantic units reproduced the longitudinal patient profiles of naming relative to comprehension, plus additional characteristics of the patients' naming performance. On the basis of both the neuropsychological and computational evidence, we propose that semantic impairment alone can account for the full range of word production deficits described here.
CASO: a framework for dealing with objectives in a constraint-based extension to AgentSpeak(L)
Authors: Aniruddha Dasgupta, Aditya K. Ghose
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Incorporating constraints into a reactive BDI agent programming language can lead to better expressive capabilities as well as more efficient computation (in some instances). More interestingly, the use of constraint-based representations can make it possible to deal with explicit agent objectives (as distinct from agent goals) that express the things that an agent may seek to optimize at any given point in time. In this paper we extend the preliminary work of Ooi et.al in augmenting the popular Belief-Desire-Intention (BDI) language AgentSpeak(L) with constraint-handling capabilities. We present a slightly modified version of their proposal, in the form of the language CAS (Constraint AgentSpeak). We then extend CAS to form the language CASO (Constraint AgentSpeak with Objectives) to incorporate explicit objectives (represented as objective functions) and present techniques for performing option selection (selecting the best plan to use to deal with the current event) as well as intention selection. In both cases, we present parametric look-ahead techniques, i.e., techniques where the extent of look-ahead style deliberation can be adjusted.
Modeling Architectural Non Functional Requirements: From Use Case to Control Case
Authors: Joe Zou, Christopher J. Pavlovski
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

While the functional requirements of a system can be effectively modeled through the Use Case driven approach, there is no standard or de facto method for modeling non-functional requirements of the system architecture. Often such requirements are dealt with in a reactive manner rather than proactively. Yet increasingly a contributing factor in project difficulty and failure are the non-functional requirements imposed on the solution architecture. This paper proposes a Control Case approach to record and model non-functional requirements. This technique enables the control case to represent the nonfunctional requirements from different perspectives, most typically the various operating conditions. Furthermore, we propose an extension to the 4+1" view model for depicting software architecture by adding the control case view. The combination of both the use case and control case views thus reflects the complete requirements across the collective system life cycle views: design, process, implementation and deployment.
Testing an extended model of IT acceptance in the Chinese cultural context
Authors: En Mao, Prashant Palvia
Venue: ACM SIGMIS Database (2006)

Research on technology acceptance and diffusion is critical, providing insights into how organizations can manage the adoption and use of information technology. With globalization, it is important to understand IT adoption in other cultures. The primary purpose of this study is to enrich the understanding of IT acceptance by extending a U.S.-based research model to a different culture, namely China. We conducted a cross-sectional survey of e-mail users in 30 Chinese organizations. Structural equation modeling was used to validate the model and test the hypotheses. We draw comparisons between our findings and existing studies, and discuss theoretical and practical implications.
Model and Algorithm for a Time-Constrained Regions-Integrated Distribution Problem
Authors: Xiang Liu, Yanhui Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Besides minimizing the delivery cost, the design of distribution system should also satisfied the time limit of the supply for resellers in e-business environment, in which traditional region-based distribution model can no longer meet the requirements of logistics distribution. Rather, a new distribution strategy of regions- integrated with replenishments along the distribution routine can solve the above-mentioned contradiction effectively. This paper firstly stated the assumptions of the strategy, and then built the model for regions-integrated distribution system. According to the model's specific configuration, a heuristic algorithm was developed for gradual optimization, by which a time-constrained distribution routing can be established via methods of inserting routing parts in descending order of their saving values. A numerical example was given to demonstrate the arithmetic operation at the end of this paper.
3D Multiple Digital Watermarking Framework for Joint-Creatorship Verification
Authors: Misung Cho, Yuseung Sohn, Soyoung Bu
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

Virtual Reality(VR) data in VR environment like manufacturing industries are often created jointly by many creators. It is then necessary to provide protection of the joint-creatorship and the creatorship of each participating creator. This paper proposes 3D Multiple Digital Watermarking Framework(MDWF) to solve the problem of joint-creatorship. The proposed framework, MDWF, makes use of 3D private multiple watermarking technology and efficient group key generation protocols for joint-creatorship verification. By using MDWF, each participating creator can prove his/her partial creatorship as well as joint-creatorship by MDWF. In addition, MDWF can solve the collusion problems because Group-Secret- Key(GSK) should be made by every users.
An Ontology Solution for Government Horizon Business Integration in Multi-agent Settings
Authors: Lin Feng, Dingming Guo, Tao Sun
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

A common objective of horizontal integration across different government agencies is to provide customer-centric online one-stop services. In this paper, we firstly analyze the requirements of a government horizon business integration management system (GHBIMS) from technology aspect and then propose an ontology solution for implementing one-stop government portal in multi-agent settings. Finally, a typical case is discussed to validate the feasibility of the proposed solution and explain the use of ontology technology in this system.
Learning from induced changes in opponent (re)actions in multi-agent games
Authors: P. J. 't Hoen, S. M. Bohte, J. A. La Poutré
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Multi-agent learning is a growing area of research. An important topic is to formulate how an agent can learn a good policy in the face of adaptive, competitive opponents. Most research has focused on extensions of single agent learning techniques originally designed for agents in more static environments. These techniques however fail to incorporate a notion of the effect of own previous actions on the development of the policy of the other agents in the system. We argue that incorporation of this property is beneficial in competitive settings. In this paper, we present a novel algorithm to capture this notion, and present experimental results to validate our claims.