ppxscal/embedding_network huggingface dataset:
Learning of Mediation Strategies for Heterogeneous Agents Cooperation
Authors: Romaric Charton, Anne Boyer, François Charpillet
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Making heterogeneous agents cooperate is still an open problem. We have studied the interaction between a human agent and an information service agent. Our approach is to introduce a mediator agent to formalize the requests of the users, according to their profile andthen to give the relevant answers. The mediator must find the best mediation strategy (a sequence of interactions) with a Markov Decision Process (MDP). The states are built on an attribute based referential and the capacity of the source to answer the request under formalization. The actions allow to ask questions to the user or to probe the information source. The rewards reflect the satisfaction of the user, the length of the mediation and the quantity of results. Our prototype uses reinforcement learning (QLearning) for an on-line adaptation without requiring an a priori model. We describe our experiments on a flight information service with a simulated behaviour.
Sophia: an Information Plane for networked systems
Authors: Mike Wawrzoniak, Larry Peterson, Timothy Roscoe
Venue: ACM SIGCOMM Computer Communication Review (2004)

This paper motivates and describes an example network Information Plane, called Sophia, currently deployed on PlanetLab. Sophia is a distributed system that collects, stores, propagates, aggregates, and reacts to observations about the network's current conditions. Sophia's approach is novel: it can be viewed as a multi-user distributed expression evaluator in which sensors and actuators form the ground terms, and statements take on the complete expressiveness of a logic language like Prolog. This paper argues that this approach has several advantages in managing and controlling a complex, federated, and evolving network: (1) a declarative logic language provides a natural way to express the kinds of statements that are common to this application domain, through temporal and positional logic rules, facts and expressions; and (2) distributed evaluation of such logic expressions provides many opportunities for performance optimization yielding an efficient system.
Segmented Linear Subspaces for Illumination-Robust Face Recognition
Authors: A. U. Batur, M. H. Hayes,  III
Venue: International Journal of Computer Vision (2004)

All images of a convex Lambertian surface captured with a fixed pose under varying illumination are known to lie in a convex cone in the image space that is called the illumination cone. Since this cone model is too complex to be built in practice, researchers have attempted to approximate it with simpler models. In this paper, we propose a segmented linear subspace model to approximate the cone. Our idea of segmentation is based on the fact that the success of low dimensional linear subspace approximations of the illumination cone increases if the directions of the surface normals get close to each other. Hence, we propose to cluster the image pixels according to their surface normal directions and to approximate the cone with a linear subspace for each of these clusters separately. We perform statistical performance evaluation experiments to compare our system to other popular systems and demonstrate that the performance increase we obtain is statistically significant.
ATE-Amenable Test Data Compression with No Cyclic Scan
Authors: Hamidreza Hashempour, Fabrizio Lombardi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper deals with a novel data compression technique for Automatic Test Equipment (ATE). A new correlation extraction technique is presented which allows spanning the compressed test data over the memory of multiple ATE channels. After reordering, vector processing is executed on a columnwise basis such that bits in the same position of all vectors are simultaneously provided to each pin of the head. Differentiation which is commonly used to extract correlation among vectors is not required in the proposed technique. Several ATE issues related to memory utilization, off-chip compression/decompression, decompression circuitry area overhead (inclusive of the area of the Cyclic-Scan-Register, CSR), and the entropy of test data (as figure of merit for correlation extraction) are analyzed. Experimental results for combinational and sequential benchmark circuits are presented to substantiate the validity of the proposed technique for an ATE environment.
Near-Optimal Precharging in High-Performance Nanoscale CMOS Caches
Authors: Se-Hyun Yang, Babak Falsafi
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

High-performance caches statically pull up the bit-linesin all cache subarrays to optimize cache accesslatency. Unfortunately, such an architecture results in asignificant waste of energy in nanoscale CMOS implementationsdue to high leakage and bitline discharge inthe unaccessed subarrays. Recent research advocatesbitline isolation to control precharging of individualsubarrays using bitline precharge devices. In this paper,we carefully evaluate the energy and performancetrade-offs of bitline isolation, and propose a techniqueto exploit nearly its full potential to eliminate dischargeand reduce overall energy in level-one caches.Cycle-accurate and circuit simulation results of awide-issue superscalar processor indicate that: (1) infuture CMOS technologies (e.g., 70nm and beyond),cache architectures that exploit bitline isolation caneliminate up to 90% of the bitline discharge, (2) on-demandprecharging (i.e., decoding the address andsubsequently precharging the accessed subarrays) is notviable in level-one caches because prechargingincreases the cache access latency, and (3) our proposalfor gated precharging to exploit subarray referencelocality and precharging only the recently accessed sub-arrayseliminates nearly all of bitline discharge innanoscale CMOS caches with only a 1% of performancedegradation.
E-government: an overview
Authors: Shannon Howle Schelin
Venue: Public information technology: policy and management issues (2003)

Information technology has fundamentally altered many aspects of daily life, including interactions with the government. The role of the Internet continues to increase as more citizens use it to find pertinent information, purchase goods and services, and to participate in virtual communities. By capitalizing on the Internet revolution, governments can create new channels of communication and new methods for participation via e-government. The changing environment, coupled with citizen and business demands, encourages government involvement in e-government initiatives and related uses of information technologies. This essay offers an overview of the historical premises, theoretical constructs, and associated typologies of e-government. These typologies posit a framework for understanding e-government, its potential benefits, and its related challenges.
Video games and education: (Education in the Face of a “Parallel School”)
Authors: Miguel de Aguilera, Alfonso Mendiz
Venue: Computers in Entertainment (CIE) (2003)

Fully integrated into the everyday lives of millions of young people throughout the world, video games are a vital part of contemporary culture and society. But the reaction of many authorities and the majority of educators has been to discredit video games by assuming their negative effects. After more than two decades of research, however, many studies have been published that have gradually led to a more complex, nuanced, and useful understanding of video games. This article focuses on one of the most interesting alternative perspectives--that of their educational potential as teaching and learning tools. After justifying this point of view, we offer a critical review of previous research on the subject; and finally reach some conclusions on the advantages of using video games for educational purposes.
Trust in Virtual Teams: Towards an Integrative Model of Trust Formation
Authors: Yu-Ting Caisy Hung, Alan R. Dennis, Lionel Robert
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Traditional models of trust have seen trust as being created as a result of a long history of interaction, but recent studies of trust in virtual teams have shown the existence of high initial trust among team members. This paper proposes an integrated model of trust that encompasses both the traditional view of trust and the swift trust found in virtual teams. Based on the dual process theories of cognition, we argue that individuals form trust attitudes via three distinct routes at different stages of a relationship: the peripheral route, the central route, and the habitual route, irrespective. In the initial stages of a relationship when individuals lack information about each other, they rely on peripheral cues (e.g., third party information, social categories, roles, and rules) to form trust. Once individuals have shared history and knowledge of the other party, they use the central route, which involves the assessment of the other party's ability, integrity, and benevolence. Finally, after long periods of shared history in which the individuals develop a habitual pattern of trust, along with possible emotional bonds, they are no longer motivated to deliberately assess trust, and instead simply enact prior trust attitudes via the habitual route. The mediated communication environment predominantly used by virtual teams slows down the progression among the three routes, and increases perceived risk.
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Authors: Krzysztof Pietrzak
Venue: Journal of Computer and System Sciences (2003)

We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1] = FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences.
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
Authors: Fariza Sabrina, Sanjay Jha
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In active and programmable networks, packetprocessing could be accomplished in the router withinthe data path. For efficient resource allocation in suchnetworks, the packet scheduling schemes should considermultiple resources such as CPU and memory in additionto the bandwidth to improve overall performance. Theinherent unpredictability of processing times of activepackets poses a significant challenge in CPU scheduling.It has been identified that unlike bandwidth scheduling,prior estimation of CPU requirements of a packet is verydifficult since it is platform dependent and it alsodepends on processing load at the time of execution andoperating system scheduling etc. This paper presents anadaptive solution for estimating the processingrequirements of active flows efficiently and accurately.The estimation process has been used in our compositescheduling algorithm called CBCS WFQ to estimateprocessing requirement. The performances of theestimation process for our composite scheduler havebeen analyzed through simulation works.
Identifying audio clips with RARE
Authors: Chris J. C. Burges, John C. Platt, Jonathan Goldstein
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we describe RARE (Robust Audio Recognition Engine): a system for identifying audio streams and files. RARE can be used in a variety of applications: from enhancing the consumer listening experience to cleaning large audio databases. RARE was designed with two key qualities in mind: robustness to distortion of the audio, and lookup speed. RARE identifies audio clips in a stream against a database of 1/4 million songs in real time using approximately 10% CPU on an 850 MHz P3, and with a measured false positive rate of 1.5x10-8 per clip, per database entry, at a false negative rate of 0.2% per clip. We demo RARE in real-time on a stream and on distorted files.
Culture and anonymity in GSS meetings
Authors: Moez Limayem, Mohamed Khalifa, John Coombes
Venue: Information management: support systems & multimedia technology (2003)

Anonymity is an important aspect of group support systems (GSS). However, as to the overall effectiveness of the use of anonymity, findings have been inconclusive. Some studies show positive effects in the number of ideas generated, quality of ideas, and uniqueness of ideas, whereas other studies show negative or neutral effects. An examination of social psychology literature indicates that the effect of public self-awareness on evaluation apprehension in different cultural groups may play a crucial role. Thus, social psychology and Hofstede's model of cultural differentiation are used in this chapter to explain the different effects of anonymity on the behavior of Hong Kong and Canadian groups during GSS sessions. It is hoped that understanding the effects of anonymity in different cultural contexts will better inform the design and facilitation of GSS in increasingly diverse global settings.
Experimental design for solicitation campaigns
Authors: Uwe F. Mayer, Armand Sarkissian
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These techniques often rely on statistical models based on trial performance data. This trial performance data is typically obtained by soliciting a smaller sample of the possible prospect pool. Collecting this trial data involves a cost; therefore the fundraiser is interested in keeping the trial size small while still collecting enough data to build a reliable statistical model that will be used to evaluate the remainder of the prospects.We describe an experimental design approach to optimally choose the trial prospects from an existing large pool of prospects. Prospects are clustered to render the problem practically tractable. We modify the standard D-optimality algorithm to prevent repeated selection of the same prospect cluster, since each prospect can only be solicited at most once.We assess the benefits of this approach on the KDD-98 data set by comparing the performance of the model based on the optimal trial data set with that of a model based on a randomly selected trial data set of equal size.
Consumer Sequential Search: Not Enough or Too Much?
Authors: Rami Zwick, Amnon Rapoport, Alison King Chung Lo, A. V. Muthukrishnan
Venue: Marketing Science (2003)

We study sequential search behavior in a generalized "secretary problem" in which a single object is to be selected from a set ofn alternatives. Alternatives are inspected in a random order, one at a time, and only the rank order of the current alternative relative to the ones that have already been observed can be ascertained. At each period, the consumer may either accept the current alternative, continue to search and pay a fixed cost, or recall an alternative that has already been inspected. A recalled alternative is assumed to be available with a known probability. The consumer's goal is to select the overall best alternative from the fixed set.We describe the results of an experiment designed to test the optimal model and compare it to a behavioral decision model that incorporates local patterns of the observed sequence. Both set size and search cost are manipulated experimentally in a 2 x 2 factorial design. Our results show that cost and set size affect the amount of search in the predicted direction. However, in the two no-cost conditions subjects search too little in comparison to the optimal model, whereas in the two cost conditions they search too much. The behavioral decision rule that we propose provides a possible account for the observed pattern of the behavioral regularities.
Ensembles of Cascading Trees
Authors: Jinyan Li, Huiqing Liu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We introduce a new method, called CS4, to constructcommittees of decision trees for classification. The methodconsiders different top-ranked features as the root nodes ofmember trees. This idea is particularly suitable for dealingwith high-dimensional bio-medical data as top-ranked featuresin this type of data usually possess similar merits forclassification. To make a decision, the committee combinesthe power of individual trees in a weighted manner. UnlikeBagging or Boosting which uses bootstrapped trainingdata, our method builds all the member trees of a committeeusing exactly the same set of training data. We have testedthese ideas on UCI data sets as well as recent bio-medicaldata sets of gene expression or proteomic profiles that areusually described by more than 10,000 features. All the experimentalresults show that our method is efficient and thatthe classification performance are superior to C4.5 familyalgorithms.
Extensionality of the RCC8 composition table
Authors: Sanjiang Li, Mingsheng Ying
Venue: Fundamenta Informaticae (2002)

This paper is mainly concerned with the RCC8 composition table entailed by the Region Connection Calculus (RCC), a well-known formalism for Qualitative Spatial Reasoning. This table has been independently generated by Egenhofer in the context of Geographic Information Systems. It has been known for some time that the table is not extensional for each RCC model. This paper however shows that the Egenhofer model is indeed an extensional one for the RCC8 composition table. Moreover this model is the maximal extensional one for the RCC8 composition table in a sense.
Automatic Lesion/Tumor Detection Using Intelligent Mesh-Based Active Contour
Authors: Lijun Yin, Sandeep Deshpande, Ja Kwei Chang
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Automatic detection of the lesion/tumor region is always of interest in medical imaging system. We address this issue in this paper for improving the accuracy and robustness as compared to the conventional methods. Active contour has been commonly used for the detection of irregular shape of region, however, it suffers the problem of the false attraction given the noisy image, and requires the correct estimation of the initial location of the object to be detected. Inthis paper, we present a novel method for robustly locating the object area by using a so-called intelligent mesh. With the accurate location and shape approximation in the initial stage, the object of interest is correctly detected by using a mesh-based active contour model. The correctness and robustness of the proposed algorithm are demonstrated on extracting the lesion/tumor regions of CT and Mammography images as an intensive test.
Pseudo-cycle-based multicast routing in wormhole-routed networks
Authors: JianPing Song, ZiFeng Hou, Ming Xu
Venue: Journal of Computer Science and Technology (2003)

This paper addresses the problem of fault-tolerant multicast routing in wormhole-routed multicomputers. A new pseudo-cycle-based routing method is presented for constructing deadlock-free multicast routing algorithms. With at most two virtual channels this technique can be applied to any connected networks with arbitrary topologies. Simulation results show that this technique results in negligible performance degradation even in the presence of a large number of faulty nodes.
Toward dynamic spectral/hp refinement: algorithms and applications to flow-structure interactions
Authors: George Em Karniadakis
Venue:  (2003)

In this thesis we focus on the use of the discontinuous Galerkin method for solving the compressible Navier-Stokes equations for moving geometries. Following the work of Lomtev et al. [52], we employ the arbitrary Lagrangian-Eulerian method for solving flow problems in moving geometries, and further extend Lomtev's work by accomplishing the fluid-structure coupling with the hp-FEM code StressCheck. In addition to this extension, we attempt to address some of the robustness issues of the discontinuous Galerkin method in four ways: through an examination of the fluxes used in the discontinuous Galerkin formulation, through an examination of over-integration as a means of alleviating the effects of polynomial aliasing, through an examination of the use of spectral vanishing viscosity as a means of maintaining monotonicity, and through an examination of the use of non-conforming finite volume discretizations for solving problems which contain shock discontinuities. In each case, both theory and numerical examples are provided which validate the conclusions drawn. We conclude by summarizing this thesis work and by suggesting some future research areas in this subject matter.
A Novel Implementation of Tile-Based Address Mapping
Authors: Sambuddhi Hettiaratchi, Peter Y. K. Cheung
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Tile-based data layout has been applied to achieve various objectives such as minimizing cache conflicts and memory row switching activity. In some applications of tile-based mapping, the size of the tile can be assumed to be a power of two. In this paper, this power of two' assumption has been used to drastically simplify the tile-based address mapping functions. Once optimized, the implementation of the non-linear tile-based mapping consumes 60% less power than the implementation of the linear row-major mapping. This result is very interesting because one would normally expect a power penalty in the address generation stage of the more sophisticated tile-based mapping. Moreover, on average tile-based mapping implementation takes 10% less area and incurs virtually no additional delay over row-major mapping implementation.