ppxscal/embedding_network huggingface dataset:
Heuristics for Dealing with a Shrinking Pie in Agent Coalition Formation
Authors: Kevin Westwood, Vicki H. Allan
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In coalition formation, often the utility associated with completion of a task changes over time. One common class of environments discounts utility in each time. We develop a strategy for decision making in the so called shrinking pie environment. We focus on compromising techniques and explore three different acceptance policies. Through our testing, we determine that agents must be willing to compromise and consider the discount in order to maximize their own utility and the overall efficiency of the system.
Building a controlled delay assured forwarding class in differentiated services networks
Authors: P. Kulkarni, M. Nazeeruddin, S. McClean
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Several Active Queue Management (AQM) based solutions have been proposed to enable service differentiation in the DiffServ Assured Forwarding (AF) class(es). Most of these solutions, however, provide throughput guarantees only. This paper proposes a new queue management approach called PAQMAN-DS which provides quantitative controlled delay guarantees to delay sensitive applications in the AF class. The proposed approach is based on predicting the future state of the queue and requires specification of only a single parameter (target delay) per hop. Performance evaluation of PAQMAN-DS through ns-2 simulations reveals that it regulates the delay around the target mark on a per-hop basis, discriminates in favour of IN contract traffic and simultaneously achieves high link utilization.
Proxy based EPC Track&Trace Service
Authors: Sunghak Song, Tak-Kiel Shim, Ju-Hyun Park
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Electronic Product Code (EPC) Track&Trace service is a method to realize real time visibility across a supply chain. EPC Track&Trace service gathers specific EPC information such as shipment time and place of the products tagged with RFID from each EPC information system (EPCIS). However, it takes a lot of time to retrieve all the EPC information from each EPCIS because of their distributed nature (world wide). In order to reduce the query response time from EPCISs, this paper proposes Proxy based EPC Track&Trace service architecture under EPCIS Phase2 that introduces a proxy layer inside the EPCIS. EPCIS that requests EPC information can receive the data locally by connecting to the proxy layer without connecting to the remote EPCIS each time, which reduces the query response time. This paper also proposes a data structure scheme and a synchronization method between the EPCIS and the proxy layer under the EPCIS Phase2 working draft. These schemes improve the performance in data query response time and data reusability.
Increasing the readability of graph drawings with centrality-based scaling
Authors: Damian Merrick, Joachim Gudmundsson
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networks can result in drawings that are not highly readable in the dense areas. Additionally, networks whose layouts are defined geographically often have dense areas that are located within small geographical regions relative to the size of the entire network. In cases where relationships within these dense areas are of interest, it is desirable to be able to distort the graph layout such that the denser areas are enlarged from their original sizes.In this paper, we propose a technique for enlarging dense areas of a given graph layout, and shrinking sparse areas. This technique is applied to geographical layouts of railway networks and force-directed layouts of non-geographical networks. The results show an increase in readability of dense parts of the networks. In addition, they provide improved starting layouts for schematisation methods which may be used to further increase readability.
Perception Strategies in Hierarchical Vision Systems
Authors: Lior Wolf, Stan Bileschi, Ethan Meyers
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Flat appearance-based systems, which combine clever image representations with standard classifiers, might be the most effective way to recognize objects using current technologies. In the future, however, it seems probable that hierarchical representations might have better performance. In such systems, the image representation consists of a sequence of sets of features, where each subsequent set is computed based on the previous sets. The main contributions of this paper are to: (1) pose the question "what is the best way to employ discriminative methods for hierarchical image representations?"; (2) enumerate some of the alternative hierarchies while drawing connections to recent work by brain researchers; (3) study experimentally the different alternatives. As we will show, the strategy used can make a substantial difference.
A Comprehensive Framework for Dynamic Web Services Integration
Authors: Zhile Zou, Zhenhua Duan, Jianli Wang
Venue: Proceedings of the European Conference on Web Services (2006)

The Business Process Execution Language for Web Services (BPEL4WS) offers a formal specification for integrating loose-coupled web services and building flexible business processes. However, due to the increasing number of the available services, it is becoming a new challenge to dynamically select and integrate the appropriate partner services for internet-scale business processes. In this paper, we provide a comprehensive framework to implement such dynamic selections and integrations. In this framework, the abstract process template (APT) is utilized as the starting point for the dynamic integrations; the domain services and partner requirements are semantically described with SSD and PPC models, respectively. In this way, the qualified services can be selected through the matchmaking between SSD and PPC instances, and the technical information of the selected operations can be merged into APT through APT binding. To this end, the selected partner services can dynamically be integrated.
Testability Estimation Based on Controllability and Observability Parameters
Authors: Tomas Pe!cenka, Josef Strnadel, Zden!ek Kotasek, Lukas Sekanina
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In the paper a method for estimation the circuit testability on the Register Transfer Level (RTL) is presented. The method allows to perform fast testability estimation in linear time complexity (regarding the number of components and interconnects of the circuit). Proposed approach is based on utilization of controllability and observability measurement for estimation of overall circuit testability. The application of developed method is demonstrated in a software tool for the development of RTL benchmark circuits with predefined testability properties. The results gained by our testability analysis method are compared with the results of professional ATPG tool. Experiments show the good correlation of the results obtained by our method and professional ATPG tool with significantly lower time complexity when our algorithm is used.
Performance evaluation of a WiMAX testbed under VoIP traffic
Authors: Nicola Scalabrino, Francesco De Pellegrini, Imrich Chlamtac, Andrea Ghittino, Sandro Pera
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

Among several first mile solutions proposed so far, the key advantage of the IEEE 802.16 standard, widely known as WiMAX, is to ensure large area coverage and rather inexpensive equipment at the subscriber side. Modern requirements to wireless connectivity include mandatory QoS guarantees for a wide set of real-time applications: this is the case of the ever growing trend of VoIP calls. To this aim, WiMAX supports natively real-time traffic. In this paper, we report on the results of measurements performed on a WiMAX Alvarion testbed, located in Turin, Italy. In particular, through synthetic VoIP traffic generation, we obtained the corresponding E-model figures, thus tracing the system operation intervals.
Multiscale Gradient Vector Field with Application to Image Denoising and Enhancement
Authors: Jinye Peng, Wanhai Yang, Yichun Wang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Image denoising and enhancement is one of the most important tasks in image processing. Self-snake model is a most basic and important image denoising method based on PDE (Partial Differential Equation), in which the stop function is very important and is usually related to the gradient of the image. But it's difficult to choose the smoothness scale as we usually do in acquiring the gradients of the approximating image by smoothening it with a single scale. So we proposed a multiscale gradient vector which integrate the different scale gradient vector from coarse image to fine according to our some defined rulers instead of single-scaled gradient vector of images to improve the performance of self-snake model. The efficiency of our proposal was proved by experimental results.
Analysis of the Consumer Preferences toward M-Commerce Applications Based on an Empirical Study
Authors: Yonghee Shin, Hyori Jeon, Munkee Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In this paper, new concept of value proposition for m-commerce is set up based on the study on previous value propositions for m-commerce, and clustering a great number of m-commerce applications by 4 sectors. These 4-sector applications are evaluated by 17 detail propositions. Then these propositions are reorganized structurally by factor analysis, of which result can be used point for drawing perceptual map. This paper identifies the degree of importance in respective propositions through experimental analysis. These experimental analyses are able to hold up objectivity of research methods, and suggest multi-points of view. This result can be used for setting up m-commerce strategy. The implications of this paper are providing diagnostic information to design a new applications or devices. And concretizing value propositions for mcommerce make a operators clear in their decisionmaking.
Local Parameters Particle Swarm Optimization
Authors: Peter Tawdross, Andreas Konig
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Recently the particle swarm optimization (PSO) has been used in many engineering applications, which operate in dynamic environment and has proved its competitiveness over genetic algorithmin many natural number approaches. In the state of the art, it is assumed that all the particles have the same parameters, while in the real world; each individual has its own character, which means each particle has different parameters. In this paper, we study the feasibility and the behavior of local parameters for each particle in the PSO, and control the parameters by a simple algorithm. More advanced control algorithm can be applied to improve the search. Adjusting our PSO for different applications is easier as the swarm parameters are adjusted automatically for each particle. However, this modification of PSO can be applied for any type of PSO to improve it. As an example, we apply it to the hierarchical particle swarm optimization (HPSO). The results are obtained in static and dynamic environments. Local approach with a naive controller overcomes the other approaches in most of the cases.
On Adaptive and Online Data Integration
Authors: Janusz R. Getta
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The recent works on integration of large database systems distributed over wide-area networks concentrate on the adaptive and online techniques. Online property of data integration means continuous integration of transmitted data with the already available results. Adaptivity materializes in a form of dynamic adjustments to the data integration plans in a response to the recent characteristics of data transmission. Implementation of adaptive and online data integration needs the specialized systems of operations and transformations of integration plans. This paper describes a new class of elementary operations on increments and/or decrements of data and shows how to express data integration plans as sequences of elementary operations. We demonstrate that class of operations proposed in the paper is sufficient for implementation of online and adaptive data integration systems and we discuss the operational properties of such systems.
Evolving color constancy
Authors: Marc Ebner
Venue: Pattern Recognition Letters (2006)

The ability to compute color constant descriptors of objects in view irrespective of the light illuminating the scene is called color constancy. We have used genetic programming to evolve an algorithm for color constancy. The algorithm runs on a grid of processing elements. Each processing element is connected to neighboring processing elements. Information exchange can therefore only occur locally. Randomly generated color Mondrians were used as test cases. The evolved individual was tested on synthetic as well as real input images. Encouraged by these results we developed a parallel algorithm for color constancy. This algorithm is based on the computation of local space average color. Local space average color is used to estimate the illuminant locally for each image pixel. Given an estimate of the illuminant, we can compute the reflectances of the corresponding object points. The algorithm can be easily mapped to a neural architecture and could be implemented directly in CCD or CMOS chips used in todays cameras.
Misconceptions in natural selection: conceptual change through time in biology classrooms
Authors: Christine Manzey, Kevin Pugh, Kristin Kelly, Victoria Stewart
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Our findings concurs with previous studies that high school biology students hold misconceptions explaining and applying key concepts in natural selection. We explored specific misconceptions prior to instruction, immediately following instruction, and five weeks later. We found qualitatively distinct categories of conceptual understanding suggesting levels in the development of conceptual understanding and tracked changes over time. We found classroom practices can impact conceptual change, with students possessing initial misconceptions often developing hybrid understandings.
The Role of VMPC in Metamemorial Judgments of Content Retrievability
Authors: David M. Schnyer, Lindsay Nicholls, Mieke Verfaellie
Venue: Journal of Cognitive Neuroscience (2005)

Making judgments about the retrievability of information is a critical part of the metamemory processes engaged during remembering. A recent study of patients with frontal lesions suggests that ventral medial prefrontal cortex (VMPC) plays a critical role in such judgments [Schnyer, D. M., Verfaellie, M., Alexander, M. P., Lafleche, G., Nicholls, L., & Kaszniak, A. W. A role for right medial prefrontal cortex in accurate feeling of knowing judgments: Evidence from patients with lesions to frontal cortex. Neuropsychologia, 42, 957&ndash;966, 2004]. The observed impairment was thought to reflect an inability to determine the accessibility of memory contents. To further examine the neuroanatomical basis of content accessibility assessment, we used fMRI in an episodic feeling-of-knowing (FOK) paradigm. Participants were asked to make trial-by-trial predictions about the retrievability of the final word that completed studied sentences and then to select the correct completion from among alternatives. Results indicated that the VMPC is engaged during accurate FOK judgments and its activation is modulated by retrieval rating. Structural equations modeling supported the notion that VMPC, as part of a broader left hemisphere network involved in memory retrieval, monitors the output of the retrieval process. More generally, VMPC may participate in metacognitive processes that allow for the comparison of available data against an internal model.
Using reflection for querying XML documents
Authors: Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter Schewe, Alexei Tretiakov
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

XML-based databases have become a major area of interest in database research. Abstractly speaking they can be considered as a resurrection of complex-value databases using constructors for records, lists, unions plus optionality and references. XQuery has become the standard query language for XML. In this paper an implementation of XQuery based on linguistic reflection is proposed. That is, XQuery is translated into a query algebra for rational tree types based on simple operations and structural recursion for lists. The major purpose of using reflection is to expand path expressions in a type-safe way.
When are Building Blocks Useful?
Authors: Christopher R. Stephens, Edgar Arenas, Jorge Cervantes, Beatriz Peralta, Esteban Ricalde, Christian Segura
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

There is still debate about as to how GAs work. Although exact mathematical formulations have been available for quite some time, they have not really led to much progress in terms of giving an intuitive answer to this question. One of the principle reasons for this is that exact formulations have traditionally been written in terms of strings. For a recombinative GA however, Building Block schemata are the most natural description. We make an experimental study in the context of a family of modular fitness landscapes and compare with theoretical results of the infinite population model. We show how the utility of recombination is linked to the nature of the fitness landscape, the more modular the landscape the more useful is recombination, and from that how the nature - length, order, geometry - of what are optimal Building Blocks manifests itself.
Optimal Pose for Face Recognition
Authors: Xiaoming Liu, Jens Rittscher, Tsuhan Chen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Researchers in psychology have well studied the impact of the pose of a face as perceived by humans, and concluded that the so-called 3/4 view, halfway between the front view and the profile view, is the easiest for face recognition by humans. For face recognition by machines, while much work has been done to create recognition algorithms that are robust to pose variation, little has been done in finding the most representative pose for recognition. In this paper, we use a number of algorithms to evaluate face recognition performance when various poses are used for training. The result, similar to findings in psychology that the 3/4 view is the best, is also justified by the discrimination power of different regions on the face, computed from both the appearance and the geometry of these regions. We believe our study is both scientifically interesting and practically beneficial for many applications.
Automatic Generation of Students' Conceptual Models Underpinned by Free-Text Adaptive Computer Assisted Assessment
Authors: Diana Perez-Marin, Enrique Alfonseca, Manuel Freire, Pilar Rodriguez, Jose Maria Guirao, Antonio Moreno-Sandoval
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we present an automatic procedure to generate students' knowledge conceptual models from their answers to an automatic free-text scoring system. The conceptual model is defined as a simplified representation of the concepts and relationships among them that each student keeps in his or her mind about an area of knowledge. It is considered that each area of knowledge comprises several topics and each topic several concepts. Each concept can be identified by a term that the students should use. A concept can belong to one topic or to several topics. The conceptual model is graphically displayed to the teachers as a conceptual map so that they can instantly see which concepts have already been assimilated and which ones should still be reviewed as they have been misunderstood.
Processor Allocation in Mesh Multiprocessors Using a Hybrid Method
Authors: Sanya Attari, Ayaz Isazadeh
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Mesh-connected systems have become popular because of their simple structure. Most of the allocation strategies in mesh systems are contiguous or noncontiguous. We propose a new hybrid processor allocation algorithm for mesh-connected systems. This method starts by processor allocation, contiguously; when contiguous aNocation is notpossible, the request is decomposed into smaller sub-meshes, such that for each sub-mesh a region can be allocated. Regions formed in this method have no regular forms and as a result all the free processors in a mesh are usefil in allocating process and number of rejected requests have become minimum. Compared to the other schemes, the proposed algorithm minimizes the communication delay among the selected processors. Our method combines the advantages of both contiguous and non-contiguous allocation schemes. We will show that it achieves minimum job response time and waiting time compared to the other strategies as well as improving the system utilization by using all idle processors in the system.
A Parametric Manipulation of Factors Affecting Task-induced Deactivation in Functional Neuroimaging
Authors: Kristen A. Mckiernan, Jacqueline N. Kaufman, Jane Kucera-thompson, Jeffrey R. Binder
Venue: Journal of Cognitive Neuroscience (2003)

Task-induced deactivation (TID) refers to a regional decrease in blood flow during an active task relative to a "resting" or "passive" baseline. We tested the hypothesis that TID results from a reallocation of processing resources by parametrically manipulating task difficulty within three factors: target discriminability, stimulus presentation rate, and short-term memory load. Subjects performed an auditory target detection task during functional magnetic resonance imaging (fMRI), responding to a single target tone or, in the short-term memory load conditions, to target sequences. Seven task conditions (a common version and two additional levels for each of the three factors) were each alternated with "rest" in a block design. Analysis of covariance identified brain regions in which TID occurred. Analyses of variance identified seven regions (left anterior cingulate/superior frontal gyrus, left middle frontal gyrus, right anterior cingulate gyrus, left and right posterior cingulate gyrus, left posterior parieto-occipital cortex, and right precuneus) in which TID magnitude varied across task levels within a factor. Follow-up tests indicated that for each of the three factors, TID magnitude increased with task difficulty. These results suggest that TID represents reallocation of processing resources from areas in which TID occurs to areas involved in task performance. Short-term memory load and stimulus rate also predict suppression of spontaneous thought, and many of the brain areas showing TID have been linked with semantic processing, supporting claims that TID may be due in part to suspension of spontaneous semantic processes that occur during "rest" (Binder et al., 1999). The concept that the typical "resting state" is actually a condition characterized by rich cognitive activity has important implications for the design and analysis of neuroimaging studies.