ppxscal/embedding_network huggingface dataset:
A robust combinatorial auction mechanism against shill bidders
Authors: Tokuro Matsuo, Takayuki Ito, Robert W. Day, Toramatsu Shintani
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents a method for discovering and detecting shill bids in combinatorial auctions. The Vickrey-Clarke-Groves Mechanism is one of the most important combinatorial auctions because it can satisfy the strategy-proof property, individual rationality, and Pareto efficiency, that is, it is the only mechanism that simultaneously satisfies these properties. As Yokoo et al. pointed out, false-name bids and shill bids pose an emerging problem for auctions, since on the Internet it is easy to establish different e-mail addresses and accounts for auction sites. Yokoo et al. proved that VCG cannot satisfy the false-name-proof property, and they also proved that no auction protocol can satisfy all three of the above properties and the false-name proof property simultaneously. Their approach concentrates on designing a new mechanism that has desirable properties, but this is quite complicated. As a new approach against shill-bids, in this paper, we design a mechanism that utilizes VCG and an algorithm for finding potential shill bids. Our mechanism is quite simple compared with Yokoo's approaches [11][12][13]. Our mechanism can judge whether there might be a shill bid from the results of the VCG procedure. We prove a theorem stating that shill bidders cannot increase their utilities unless all shill bidders win in the auction. Based on this theorem, our proposed mechanism compares the agents' utilities in a conventional auction with those in an auction where a shill bidder does not join in the auction. When these agents' utilities are different between the above cases, such agents might be shill bidders. Then, our mechanism allocates items to the shill bidders as a group from the set of items obtained through successful bids by the agent in the conventional auction. This process prevents shill bidders from increasing unfair profits. Furthermore, even though shill bidders participate in the auction, the seller's profit does not decrease using our proposed method. Thus, our mechanism detects shill bids when it only detects the possibility of shill bids. Our proposed method has the following three key advantages. First, we propose a method to detect shill bidders by comparison between bidders utilities. Our method is superior than existing complex mechanisms in the point of view of generalization and wide-use, because our auction mechanism employs only VCG. Second, even though there are shill bidders in an auction, incentive compatibility property is preserved using our mechanism. Finally, the schemer, in our mechanism, does never have incentive to make shill bidders. The schemer's utility does not increase in our mechanism even though a schemer make shill bidders. Namely, not to make shill bidders is dominant strategy for the schemer.
BCH-based Compactors of Test Responses with Controllable Masks
Authors: Taweesak Reungpeerakul, Xiaoshu Qian, Samiha Mourad
Venue: Proceedings of the 15th Asian Test Symposium (2006)

This paper presents a novel approach to compacting test response results for a multiple scan chains design. The compactors are based on (n+1, k) extended BCH code and guarantee detecting up to 2t single-bit errors and any odd number of single-bit errors, where n, k, t are integers depending on the particular BCH code used. Another technique uses controllable masks to handle any number of X's on test responses. The techniques have ability to detect more single-bit errors with minimum numbers of compactor outputs and can be used to reduce tester channels, test application time, and test data volume, independent of circuit under test (CUT) and fault models.
Multi-Term Keywords for Indexing Multilingual Textual Repositories: Developing Language Resources and Algorithms.
Authors: Alessandro Panunzi, Marco Fabbri, Massimo Moneglia, Manuel Zini
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The tool for keyword extraction developed within the AXMEDIS project have been designed for working in a multilingual environment and new algorithms have been developed to generate keywords with higher representativeness for content search and identification. The paper specifies the linguistic criteria followed for building language resources for French, Italian, and German, which are comparable to those available for English and the algorithms used for enhancing keyword performance. The new algorithm extracts keyword collocations from the document and generates multiword keywords. The use of multi-term descriptors is a good means to better identify the content. The precision obtained with respect to mono-term keyword increase the performance of 100% relative factor.
Optimal Callback with Two-Level Adaptation for Wireless Data Access
Authors: Yang Xiao, Hui Chen
Venue: IEEE Transactions on Mobile Computing (2006)

Strongly consistent callback cache mechanisms have been studied for data access in wireless networks. In cache access mechanisms, update information is extremely important since an updated data object in a remote server makes the corresponding data objects invalidated in mobile terminals (MTs), and the data object cache hit information in those MTs becomes almost useless. In this paper, we propose an adaptive access mechanism, called optimal callback with two-level adaptation. In the first-level adaptation, cache size in an MT is adaptively adjusted based on update-to-access-ratio (UAR), defined as the average number of updates per data object access. The range of the cache size is [0, M], where M is the maximum physical cache size of the MT. Two extreme cases are given as follows: 1) When the UAR is very large so that objects in the cache are always obsolete, the cache should not be used and, therefore, the cache size should be set to zero; 2) when the UAR is zero so that every object in the cache is valid, the cache size should be set to M. Under other situations, the cache size is dynamically changed between 0 and M. Define U{\hbox{-}}{\rm threshold} of the UAR for any object, a particular important threshold, as a UAR value, beyond which the object should be not cached at all. The idea of the second-level adaptation is that if an object size is small, sending back the object may be a better choice than sending back an invalidation message when the object is updated. Therefore, when an object is updated at the server, it is sent directly to MTs if the object size is smaller than a threshold, called Push Threshold (T); otherwise, an invalidation message is sent to the MTs. We analytically model cost function for the proposed adaptive scheme as the total traffic involved between the server and an MT per data object access, and the optimal cache size and the optimal T value are obtained simultaneously to minimize the cost function. Furthermore, U{\hbox{-}}{\rm threshold} is derived analytically. Both simulations and analytical results are used to study and compare the performance of the proposed scheme with several others under many different scenarios.
A Modified Genetic Algorithm with Multiple Subpopulations and Dynamic Parameters Applied in CVaR Model
Authors: Rongjun Li, Xianying Chang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Simple genetic algorithm (GA) involves only one initial population with fixed genetic operational parameters selected in advance. This paper presents a modified genetic algorithm (MGA) with multiple subpopulations and dynamic parameters. In the new algorithm, genetic operations are carried out on each subpopulation separately and the operational parameters are changed dynamically. In the meanwhile, the genetic information of individuals is transferred among all the subpopulations by means of migration operator throughout the evolution processes. Furthermore, the modified genetic algorithm has been applied to conditional value-at-risk (CVaR) model to solve financial risk problems and the results indicate that the solution obtained from MGA is much better than the one obtained from a GA. To make this clearer, a numerical example is demonstrated for algorithm illustration.
Object Orientation Agnosia: A Failure to Find the Axis?
Authors: Irina M. Harris, Justin A. Harris, Diana Caine
Venue: Journal of Cognitive Neuroscience (2001)

A dissociation between the ability to recognize misoriented objects and to determine their orientation has been reported in a small number of patients with vascular lesions. In this article, we describe a 57-year-old man with probable Alzheimer' s disease who shows the same dissociation. Neuroimaging findings indicated marked hypometabolism in the posterior cortical regions, particularly the postero-superior parietal lobes. Clinically, the patient had good object recognition accompanied by severely impaired spatial abilities. The experimental investigations comprised a variety of tasks in which he identified misoriented objects, evaluated the orientation of single objects, or discriminated the orientation of simultaneously presented items. Results revealed that his object recognition was independent of orientation and was largely mediated by salient features. With respect to orientation judgements, the patient displayed a profound inability to judge the orientation of nonupright objects, but remarkably intact (though largely implicit) knowledge of the upright orientation. Strikingly, his orientation judgements were also more accurate for upside-down objects than for other orientations (i.e., 90&deg;). We interpret these results as evidence that judgements about object orientation are facilitated when the orientation of the principal axis of the object matches that of an internal representation. We propose that the inability to determine other orientations may be due to the failure of an "axis-finding" mechanism implemented in the posterior parietal lobes, that translates between object-centered and eye-centered coordinates appropriate for guiding visual scanning.
The Deployment Production Line
Authors: Jez Humble, Chris Read, Dan North
Venue: Proceedings of the conference on AGILE 2006 (2006)

Testing and deployment can be a difficult and timeconsuming process in complex environments comprising application servers, messaging infrastructure and interfaces to external systems. We have seen deployments take several days, even in cases where teams have used automated builds to ensure their code is fully tested. In this paper we describe principles and practices which allow new environments to be created, configured and deployed to at the click of a button. We show how to fully automate your testing and deployment process using a multi-stage automated workflow. Using this "deployment production line", it is possible to deploy fully tested code into production environments quickly and with full confidence that you can fall back to a previous version easily should a problem occur.
Getting started with condor
Authors: Irfan Habib
Venue: Linux Journal (2006)

Computers of different feathers can still flock together with Condor.
J for the APL programmer
Authors: Chris Burke, Roger Hui
Venue: ACM SIGAPL APL Quote Quad (1996)

Though J shares many concepts with APL, in many respects it is radically different, and almost all APL constructions that are in J differ in some way. These differences can be a stumbling block to the newcomer who thinks that J is simply an ASCII version of APL, prompting questions such as:&bull; How do I save my workspace?&bull; Why do J functions work along the columns and not the rows?&bull; Can I have a version of J with &squ;io&larr;1?&bull; Can I have a version of J with real APL characters?
Multimedia index and retrieval under MARC framework
Authors: Wenying Wendy Gao, Jesse S. Jin
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

Information retrieval is the indexing and retrieving of data that match criteria specified by users. In today's age, the proliferation of multimedia information makes it necessary to revolutionise traditional type of information retrieval systems. Content Based Image Retrieval (CBIR) is a research area attempting to address this issue. It is primarily concerned with using content-based information such as visual features to specify search criteria and perform query on image collections. A number of different focuses exist in CBIR research, ranging from research on feature extraction techniques, different indexing schemes to collection organisation. In a CBIR system, like in any information retrieval system, in order to achieve effective indexing and retrieving of data, it is very important to have a cataloguing framework that enables easy maintenance of collections, otherwise it would not be possible to put the system into practical use.CBIR-VU is a content-based image retrieval system developed in the VIP Lab, University of NSW. This system has the problem of lacking a well-defined cataloguing framework, which severely restricts the system domain, and renders it impractical for real use. During a thesis project this year, a catalogue based on an internationally recognised cataloguing framework - MARC 21 format - has been developed for CBIR-VU.This catalogue enables effective organisation of many different medium of information, ranging from multimedia information to traditional material, and it is able to provide a solid backbone to new generation information retrieval systems like CBIR-VU.
A novel multiple-valued CMOS flip-flop employing multiple-valued clock
Authors: Yin-Shui Xia, Lun-Yao Wang, A. E. A. Almaini
Venue: Journal of Computer Science and Technology (2005)

A new CMOS quaternary D flip-flop is implemented employing a multiple-valued clock. PSpice simulation shows that the proposed flip-flop has correct operation. Compared with traditional multiple-valued flip-flops, the proposed multiple-valued CMOS flip-flop is characterized by improved storage capacity, flexible logic structure and reduced power dissipation.
Cell Breathing in Wireless LANs: Algorithms and Evaluation
Authors: Paramvir (Victor) Bahl, Mohammad T. Hajiaghayi Kamal Jain, Sayyed Vahab Mirrokni Lili Qiu
Venue: IEEE Transactions on Mobile Computing (2007)

Wireless LAN administrators often have to deal with the problem of sporadic client congestion in popular locations within the network. Existing approaches that relieve congestion by balancing the traffic load are encumbered by the modifications that are required to both access points and clients. We propose Cell Breathing, a well-known concept in cellular telephony, as a load balancing mechanism to handle client congestion in a wireless LAN. We develop power management algorithms for controlling the coverage of access points to handle dynamic changes in client workloads. We further incorporate hand-off costs and manufacturer specified power level constraints into our algorithms. Our approach does not require modification to clients or to the standard. It only changes the transmission power of beacon packets and does not change the transmission power of data packets to avoid the interactions with auto-rating. We analyze the worst-case bounds of the algorithms and show that they are either optimal or close to optimal. In addition, we evaluate our algorithms empirically using synthetic and real wireless LAN traces. Our results show that cell breathing significantly outperforms the commonly used fixed power scheme and performs at par with sophisticated load balancing schemes that require changes to both the client and access points.
Intelligent Fault Isolation of Control Valves in a Power Plant
Authors: A. Ramezanifar, A. Afshar, S. K. Yadavar Nikravesh
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper fault happening for control valves in a power plant is considered. The method is implemented for boiler feed water valve and is extendable to boiler fuel valve and governor valve. Fault kind and location is determined using measurement of boiler state variables. In spite of robust controller design, it may be unable to handle these faults and restricts their effects. A fuzzy compensator does fault accommodation tasks prosperously with modification set-points to the controller. Fuzzy supervisor is implemented in a way which prompts simulation time related to the current implements. Simulation results show the effectiveness of the proposed methodology.
A comparison between the China Scientific and Technical Papers and Citations Database and the Science Citation Index in terms of journal hierarchies and interjournal citation relations
Authors: Ping Zhou, Loet Leydesdorff
Venue: Journal of the American Society for Information Science and Technology (2007)

The journal structure in the China Scientific and Technical Papers and Citations Database (CSTPCD) is analyzed from three perspectives: the database level, the specialty level, and the institutional level (i.e., university journals vs. journals issued by the Chinese Academy of Sciences). The results are compared with those for (Chinese) journals included in the Science Citation Index (SCI). The frequency of journal&ndash;journal citation relations in the CSTPCD is an order of magnitude lower than in the SCI. Chinese journals, especially high-quality journals, prefer to cite international journals rather than domestic ones; however, Chinese journals do not get an equivalent reception from their international counterparts. The international visibility of Chinese journals is low, but varies among fields of science. Journals of the Chinese Academy of Sciences have a better reception in the international scientific community than university journals. &copy; 2007 Wiley Periodicals, Inc.
Application of KM measures to the impact of a specialized groupware system on corporate productivity and operations
Authors: Hassan A. Artail
Venue: Information and Management (2006)

Here we describe an experiment to show the improvement in productivity resulting from use of a specialized groupware system, using quantitative data and observations of the knowledge management (KM) processes, styles, and critical success factors. Data describing the work process before and after the deployment of the system was applied to measure the impact on performance, operations, and knowledge sharing behavior. The attitude of the organization toward knowledge sharing and the deployed groupware system was then studied along several dimensions that represent KM styles, by assessing the KM orientation and motivation of the organization. Lessons learned were presented and used for directing the attention of management to the importance of supporting collaborative and KM technologies for corporate strategic competitiveness.
Optimal Block Design for Asynchronous Wake-Up Schedules and Its Applications in Multihop Wireless Networks
Authors: Rong Zheng, Jennifer C. Hou, Lui Sha
Venue: IEEE Transactions on Mobile Computing (2006)

In this paper, we consider the problem of designing optimal asynchronous wake-up schedules to facilitate distributed power management and neighbor discovery in multihop wireless networks. We first formulate it as a block design problem and derive the fundamental trade-offs between wake-up latency and the average duty cycle of a node. After the theoretical foundation is laid, we then devise a neighbor discovery and schedule bookkeeping protocol that can operate on the optimal wake-up schedule derived. To demonstrate the usefulness of asynchronous wake-up, we investigate the efficiency of neighbor discovery and the application of on-demand power management, which overlays a desirable communication schedule over the wake-up schedule mandated by the asynchronous wake-up mechanism. Simulation studies demonstrate that the proposed asynchronous wake-up protocol has short discovery time which scales with the density of the network; it can accommodate various traffic characteristics and loads to achieve an energy savings that can be as high as 70 percent, while the packet delivery ratio is comparable to that without power management.
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems
Authors: R. I. Davis, A. Burns
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

This paper focuses on resource sharing in hierarchical fixed priority pre-emptive systems where a number of separate applications, each with its own server, reside on a single processor. It defines the Hierarchical Stack Resource Policy, an appropriate global resource access policy that bounds priority inversion and also limits interference due to overruns during resource access. The paper provides detailed response time analysis enabling the schedulability of application servers and tasks to be determined for systems with local and global resource access. This analysis is applicable to real-world systems where server-based applications need mutually exclusive access to shared resources such as communications buffers, peripheral devices, operating system calls and data structures shared with interrupt handlers.
Relaxing join and selection queries
Authors: Nick Koudas, Chen Li, Anthony K. H. Tung, Rares Vernica
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Database users can be frustrated by having an empty answer to a query. In this paper, we propose a framework to systematically relax queries involving joins and selections. When considering relaxing a query condition, intuitively one seeks the 'minimal' amount of relaxation that yields an answer. We first characterize the types of answers that we return to relaxed queries. We then propose a lattice based framework in order to aid query relaxation. Nodes in the lattice correspond to different ways to relax queries. We characterize the properties of relaxation at each node and present algorithms to compute the corresponding answer. We then discuss how to traverse this lattice in a way that a non-empty query answer is obtained with the minimum amount of query condition relaxation. We implemented this framework and we present our results of a thorough performance evaluation using real and synthetic data. Our results indicate the practical utility of our framework.
Intelligent talking book software for supporting the teaching of reading in British primary schools
Authors: Cathy Lewin
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

It is widely recognised that children learn to read in a variety of ways. Talking book software, replicating real books on the computer screen with the additional feature of speech feedback, is becoming increasingly popular in primary education and many publishers are promoting software designed to support their reading schemes. There has been little research in this field, but the findings of a recent evaluation case study (Lewin, 1995) on the use of existing talking book software in British classrooms show that such software has limitations in supporting reading. The software demonstrated here is designed to overcome these limitations and provide adaptive feedback for early readers. It is underpinned by current theories of learning to read, and incorporates the strengths and addresses the weaknesses of existing talking book software. Many educators accept that children utilise visual, semantic, syntactical and phonic strategies (e.g. Clay, 1993). A conclusion of the case study was that the software evaluated did not provide coaching in all these strategies, particularly in the area of phonics.