ppxscal/embedding_network huggingface dataset:
Spatial correlation based fast field motion vector estimation algorithm for interlaced video encoding
Authors: K. Ramkishor, T. S. Raghu, K. Suman, P. S. S. B. K. Gupta
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A fast motion vector estimation algorithm for field motion estimation having computational complexity independent of search range is presented for interlaced video encoding. The algorithm is based on spatial correlation of motion vectors and yields good tradeoff between motion estimation distortion and number of SAD computations. The speed up achieved by the algorithm is in the order of 190-280 times and the SAD increase is 2-10% compared to full search. The number of bits required to code motion vectors is less as the algorithm is based on correlation of motion vectors. Overall performance of the algorithm is compared with full search and three-step search using speed-up, average SAD per macroblock (MB), motion vector bits per MB and PSNR as objective measure. The proposed algorithm can be used in standards such as MPEG-2, MPEG-4 ASP, etc. The proposed algorithm is implemented in our MPEG-2 encoder and performance of the algorithm is presented for the same.
Fuzzy Decision Based on Fuzzy Rough Set
Authors: Jin-Cherng Lin, Kuo-Chiang Wu
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Knowledge reduction is one of important theories about rough set. Knowledge reduction is aimed at under the premise that no change is taken place in the classification of knowledge base, deleting irrelevant or unimportant information to derive the decision rule of questions. This paper tries to apply the fuzzy decision of fuzzy theory into the rough set, that is, taking advantage of the constrain relationship between constrain set and goal set in fuzzy decision to conduct knowledge reduction and finally to derive the decision rule.
A reconstruction algorithm for L-convex polyominoes
Authors: Giusi Castiglione, Antonio Restivo, Roberto Vaglica
Venue: Theoretical Computer Science (2006)

We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
Beliefs, desires and intentions through the environment
Authors: Tom Holvoet, Paul Valckenaers
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

BDI-based agent architectures have proven their usefulness in building MASs for complex systems - their explicit attention for coping with dynamic environments is one obvious explanation for this. One large and quite interesting family of MAS applications is characterized (1) by their large scale in terms of number of agents and physical distribution, (2) by their very dynamic nature and (3) by their complex functional and non-functional requirements. This family includes a.o. manufacturing control, traffic control and web service coordination. In this paper, we present an innovative approach to BDI agents which alleviates agent complexity through "delegate MASs". Delegate MASs consist of light-weight agents, which are issued either by resources for building and maintaining information on the environment, or by task agents in order to explore the options on behalf of the agents and to coordinate their intentions.
Integrating Reservation Mechanism into Grid Resource Management
Authors: Chen Jing, Kong Ling-fu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In this paper, an architecture framework of grid resource management supports reservation mechanism is proposed, which provides end-to-end quality of service (QoS) for users and adjusts the level of QoS. And we describe the request definition and processing of resource reservation, and design the strategies of reservation. Reservation strategies integrate resource request control, which improves the resource performance and guarantee use's QoS.
A New Delay-Dependent Approach to Robust Stability for Uncertain Hybrid Bidirectional Associative Memory Neural Networks with Time-Varying Delays
Authors: Chien-Yu Lu, Te-Jen Su, Wen-Jye Shyr
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper considers the problem of global robust stability analysis for a class of bidirectional associative memory time-varying delayed neural networks with norm-bounded time-varying parameter uncertainties. The activation functions are assumed to be globally Lipschitz continuous. Globally delaydependent robust stability criteria are derived in the form of linear matrix inequalities by introducing some relaxation matrices which can be chosen properly to lead to a less conservative result. Numerical examples are given to illustrate the significant improvement on the conservativeness of the delay bound over some reported results in the literature.
Intelligent Systems and Formal Methods in Software Engineering
Authors: Bernhard Beckert, Tony Hoare, Reiner Hahnle, Douglas R. Smith, Cordell Green, Silvio Ranise, Cesare Tinelli, Thomas Ball, Sriram K. Rajamani
Venue: IEEE Intelligent Systems (2006)

Formal methods in software engineering are an increasingly important application area for intelligent systems. The field has outgrown the area of academic case studies, and industry is showing serious interest. This installment of Trends & Controversies looks at the state of the art in formal methods and discusses the developments that make successful applications possible.
Handoff performance improvement with latency reduction in next generation wireless networks
Authors: Özgür B. Akan, Buyurman Baykal
Venue: Wireless Networks (2005)

The next generation (NG) wireless networks are expected to provide mobile users with the real-time multimedia services. High sensitivity to time constraints like delay and jitter is one of the important characteristics of the multimedia traffic. In order to maintain a certain quality of service (QoS) level, the handoff latency should be minimized. Furthermore, if the new cell is not ready at the actual handoff time, the handoff call may be even forced terminated. Hence, the handoff preparation latency directly affects the performance of the cellular networks in terms of QoS support and the handoff blocking probability. In this paper, we present the expected visitor list (EVL) method to achieve reduced handoff blocking probability and maintain a certain QoS level in the network by minimizing handoff preparation latency. The handoff signaling decomposition is introduced to make the neighbor cells aware of the resource demands and QoS requirements of the mobile terminal before the actual handoff time. The obtained information about the prospective active mobile terminal is stored in an EVL entry at the neighbor cells. The call admission control (CAC) with QoS-provisioning is run against each EVL entry. According to the CAC result, the network preparation algorithms are executed and the results are stored in the entry. No resource reservation or allocation is performed in advance, and the varying network conditions are reflected to validity and admission status of the entries. The results of handoff preparation algorithms stored in the EVL entry are activated at the actual handoff time and hence the handoff latency is minimized. Performance evaluation through mathematical analysis and extensive simulation experiments show that the EVL method reduces handoff latency and hence handoff call blocking probability significantly without introducing high overhead.
Debugging and repair of owl ontologies
Authors: James Hendler
Venue:  (2006)

With the advent of Semantic Web languages such as OWL (Web Ontology Language), the expressive Description Logic SHOIN is exposed to a wider audience of ontology users and developers. As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors becomes an extremely hard task even for experts. The problem is worse for newcomers to OWL who have little or no experience with DL-based knowledge representation. Existing ontology development environments, in conjunction with a reasoner, provide some limited debugging support, however this is restricted to merely reporting errors in the ontology, whereas bug diagnosis and resolution is usually left to the user. In this thesis, I present a complete end-to-end framework for explaining, pinpointing and repairing semantic defects in OWL-DL ontologies (or in other words, SHOIN a knowledge base). Semantic defects are logical contradictions that manifest as either inconsistent ontologies or unsatisfiable concepts. Where possible, I show extensions to handle related defects such as unsatisfiable roles, unintended entailments and non-entailments, or defects in OWL ontologies that fall outside the DL scope (OWL-Full). The main contributions of the thesis include: (1) Definition of three novel OWL-DL debugging/repair services: Axiom Pinpointing, Root Error Pinpointing and Ontology Repair. This includes formalizing the notion of precise justifications for arbitrary OWL entailments (used to identify the cause of the error), root/derived unsatisfiable concepts (used to prune the error space) and semantic/syntactic relevance of axioms (used to rank erroneous axioms). (2) Design and Analysis of decision procedures (both glass-box or reasoner dependent, and black-box or reasoner independent) for implementing the services. (3) Performance and Usability evaluation of the services on realistic OWL-DL ontologies, which demonstrate its practical use and significance for OWL ontology modelers and users.
An Educational System Based on Several Ontologies
Authors: Bich-Lien Doan, Yolaine Bourda
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Metadata are required for finding, exchanging, and managing learning objects. But, their semantics is not clear. Furthermore, the IEEE LOM (Learning Object Metadata) is an IEEE standard since July 2002 but, even if it is widely used, it is not the only one standard used to describe learning objects. The use of ontologies is a key step forward for describing the semantics of information on the Web. We propose to specify the semantics of metadata by using a formal language of ontology, OWL. Furthermore, assuming that we are in an open world and in order to facilitate the exchange of learning resources with other institutions, we propose a solution based on several ontologies.
Numerical study of time-splitting and space-time adaptive wavelet scheme for Schrödinger equations
Authors: R. Zhang, K. Zhang, Y. S. Zhou
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, we present a time-splitting and space-time adaptive wavelet scheme for solving Schrödinger equations with a small Planck constant. The scheme is stable and it can overcome high-frequency pseudo-oscillation of the solution. The concrete steps and numerical experiments are also given.
A large-scale analysis of query logs for assessing personalization opportunities
Authors: Steve Wedig, Omid Madani
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Query logs, the patterns of activity left by millions of users, contain a wealth of information that can be mined to aid personalization. We perform a large-scale study of Yahoo! search engine logs, tracking 1.35 million browser-cookies over a period of 6 months. We define metrics to address questions such as 1) How much history is available?, 2) How do users' topical interests vary, as reflected by their queries?, and 3) What can we learn from user clicks? We find that there is significantly more expected history for the user of a randomly picked query than for a randomly picked user. We show that users exhibit consistent topical interests that vary between users. We also see that user clicks indicate a variety of special interests. Our findings shed light on user activity and can inform future personalization efforts.
Predicting Success: Patterns of Cortical Activation and Deactivation Prior to Response Inhibition
Authors: Robert L. Hester, Kevin Murphy, John J. Foxe, Deirdre M. Foxe, Daniel C. Javitt, Hugh Garavan
Venue: Journal of Cognitive Neuroscience (2004)

The present study investigated the relationships between attention and other preparatory processes prior to a response inhibition task and the processes involved in the inhibition itself. To achieve this, a mixed fMRI design was employed to identify the functional areas activated during both inhibition decision events and the block of trials following a visual cue introduced 2 to 7 sec prior (cue period). Preparing for successful performance produced increases in activation for both the cue period and the inhibition itself in the frontoparietal cortical network. Furthermore, preparation produced activation decreases in midline areas (insula and medial prefrontal) argued to be responsible for monitoring internal emotional states, and these cue period deactivations alone predicted subsequent success or failure. The results suggest that when cues are provided to signify the imminent requirement for behavioral control, successful performance results from a coordinated pattern of preparatory activation in task-relevant areas and deactivation of task-irrelevant ones.
Testing a Datawarehouse - An Industrial Challenge
Authors: Harry M. Sneed
Venue: Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques (2006)

This contribution is an experience report on system testing and in particular on the testing of a datawarehouse system. Datawarehouses are large databases used solely for querying and reporting purposes. The datawarehouse in question here was dedicated to fulfilling the reporting requirements of the BASEL-II agreement on the provision of auditing data by the banks, the European equivalent of the Sarbane-Oxley Act. The purpose of the testing project was to prove that the contents of the datawarehouse are correct in accordance with the rules specified to fill them. In the end, the only way to achieve this was to rewrite the rule specifications in a machine readable form and to transform them into post assertions, which could be interpreted by a data verification tool for comparison of the actual data contents with the expected data contents. The testing project was never fully completed, since not all of the rules could be properly transformed. Keywords: System Testing, Datawarehouse Testing, Data Transformation Rules, Post Conditions Assertions, Formal Verification.
MONIC: modeling and monitoring cluster transitions
Authors: Myra Spiliopoulou, Irene Ntoutsi, Yannis Theodoridis, Rene Schult
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

There is much recent work on detecting and tracking change in clusters, often based on the study of the spatiotemporal properties of a cluster. For the many applications where cluster change is relevant, among them customer relationship management, fraud detection and marketing, it is also necessary to provide insights about the nature of cluster change: Is a cluster corresponding to a group of customers simply disappearing or are its members migrating to other clusters? Is a new emerging cluster reflecting a new target group of customers or does it rather consist of existing customers whose preferences shift? To answer such questions, we propose the framework MONIC for modeling and tracking of cluster transitions. Our cluster transition model encompasses changes that involve more than one cluster, thus allowing for insights on cluster change in the whole clustering. Our transition tracking mechanism is not based on the topological properties of clusters, which are only available for some types of clustering, but on the contents of the underlying data stream. We present our first results on monitoring cluster transitions over the ACM digital library.
Safety Analysis for Dynamic Update of Object Oriented Programs
Authors: Yogesh Murarka, Umesh Bellur, Rushikesh K. Joshi
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Maintenance downtime and overheads for applying patches are major concerns for systems requiring round the clock availability. Hence, methods for carrying out dynamic updates are needed. However, correctness of the system during and after every dynamic update needs to be ensured. This paper defines two safety criteria, type consistency and isolation of process execution for dynamic software update. Updates involving one or more insertions of new classes, removals of old classes and replacements of old classes are considered. The condition for producing a type safe update schedule is defined. The parts of the program whose execu- tions have to be isolated from process update are annotated by the user. Conditions are also provided for ensuring isola- tion of the update process from execution of annotated parts of the program.
Voromap: A Voronoi-based tool for visual exploration of multi-dimensional data
Authors: Roberto Pinho, Maria Cristina Ferreira de Oliveira, Rosane Minghim, Marinho G. Andrade
Venue: Proceedings of the conference on Information Visualization (2006)

A map of multi-dimensional data is a graphical representation - defined in 2D or 3D space - of a set of data points that reflects similarity relationships amongst them. Triangulations of those points can be produced to generate surface meshes on which additional information can be mapped to visual attributes such as color or height. Such surfaces may then be used to explore the data set and the similarities between the different data points. In this paper we introduce Voromap, an exploration tool that is based on Voronoi diagrams of the projected data, and compare that representation with a standard representation that uses triangulations. Voronoi diagrams represent each element in the data set by the area of a polygon in which every point within the polygon is closer to its generating point than to any other point from the data set. A user experiment was conducted to compare Voronoi maps with equivalent maps represented by surface triangulations explored with a similar triangulation-based tool.
Prototyping 3APL in the Maude term rewriting language
Authors: M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. We argue that Maude is very well suited for prototyping agent programming languages such as 3APL.
The Cost of Code Quality
Authors: Yuri Khramov
Venue: Proceedings of the conference on AGILE 2006 (2006)

Using data from more than 80 development projects, this paper attempts to answer the question: How much effort should be invested into code quality? It is shown that a "quick and dirty" approach is actually preferable in some situations. Volatility of requirements, expected breadth of usage, customers' defect tolerance, cost of defect fixing and system lifespan are suggested as the main factors determining how much effort to spend on improving code. These factors are then used to identify situations where XP coding practices are inefficient and to find boundaries within which simpler, less expensive methods give better results.
Role-based access control for a distributed calculus
Authors: Chiara Braghin, Daniele Gorla, Vladimiro Sassone
Venue: Journal of Computer Security (2006)

Rôle-based access control (RBAC) is increasingly attracting attention because it reduces the complexity and cost of security administration by interposing the notion of rôle in the assignment of permissions to users. In this paper, we present a formal framework relying on an extension of the π-calculus to study the behaviour of concurrent systems in a RBAC scenario. We define a type system ensuring that the specified policy is respected during computations, and a behavioural equivalence to equate systems. We then consider a more sophisticated feature that can be easily integrated in our framework, i.e., the possibility of automatically adding rôle activations and deactivations to processes to be run under a given policy (whenever possible). Finally, we show how the framework can be easily extended to express significant extensions of the core RBAC model, such as rôles hierarchies or constraints determining the acceptability of the system components.
Fairness considerations of scheduling in multi-server and multi-queue systems
Authors: David Raz, Benjamin Avi-Itzhak, Hanoch Levy
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Multi-server and multi-queue architectures are common mechanisms used in a large variety of applications (call centers, Web services, computer systems). One of the major motivations behind common queue operation strategies is to grant fair service to the jobs (customers). Such systems have been thoroughly studied by Queueing Theory from their performance (delay distribution) perspective. However, their fairness aspects have hardly been studied and have not been quantified to date. In this work we use the Resource Allocation Queueing Fairness Measure (RAQFM) to quantitatively analyze several multi-server systems and operational mechanisms. The results yield the relative fairness of the mechanisms as a function of the system configuration and parameters. Practitioners can use these results to quantitatively account for system fairness and to weigh efficiency aspects versus fairness aspects in designing and controlling their queueing systems. In particular, we quantitatively demonstrate that: 1) Joining the shortest queue increases fairness, 2) A single "combined" queue system is more fair than "separate" (multi) queue system and 3) Jockeying from the head of a queue is more fair than jockeying from its tail.
Can self-organizing P2P file distribution provide QoS guarantees?
Authors: Ruchir Bindal, Pei Cao
Venue: ACM SIGOPS Operating Systems Review (2006)

In this paper, we examine the factors that contribute to the variability in download time of a self-organizing P2P file distribution application such as BitTorrent. We conducted a series of side-by-side live experiments, involving two clients running on the same machine downloading the same file at the same time. We found that the download latency varied significantly, sometimes by a factor of 2. Surprisingly, the main contributing factor isn't the network bandwidths of the set of neighbors that a client is given. Rather, it has to do with the frequency of turn-overs in "close" neighbors, i.e. those that are in a stable data-exchange relationship with the client. Analysis of the log data shows that a client obtains over 90% of the file from a small set of close neighbors, and if a close neighbor leaves the network, it takes the client a long time, over half an hour, to find another one. This suggests that self-organizing P2P file distributions indeed need external help in order to provide QoS guarantees, but such guarantees are achievable with proper enhancements to the P2P network.