ppxscal/embedding_network huggingface dataset:
Flexible decision-making in sequential auctions
Authors: Gangshu Cai
Venue:  (2005)

Because sequential auctions have permeated society more than ever, it is desirable for participants to have the optimal strategies beforehand. However, finding closed-form solutions to various sequential auction games is challenging. Current literature provides some answers for specific cases but not for general cases. A decision support system that can automate optimal bids for players in different sequential auction games will be useful in solving these complex economic problems, which requires not only economic but also computational efficiency. This thesis contributes in several directions. First, this dissertation derives results related to the multiplicity of equilibria in first-price, sealed-bid (FPSB) auctions, and sequential FPSB auctions, with discrete bids under complete information. It also provides theoretical results for FPSB auctions with discrete bids under incomplete information. These results are applicable to both two-person and multi-person cases. Second, this thesis develops a technique to compute strategies in sequential auctions. It applies Monte Carlo simulation to approximate perfect Bayesian equilibrium for sequential auctions with discrete bids and incomplete information. It also utilizes the leveraged substructure of the game tree which can dramatically reduce the memory and computation time required to solve the game. This approach is applicable to sequences of a wide variety of auctions. Finally, this thesis analyzes the impact of information in sequential auctions with continuous bids and incomplete information when bids are revealed. It provides theoretical results especially the non-existence of pure-strategy symmetric equilibrium in both the symmetric sequential FPSB and the symmetric sequential Vickrey auctions.
Mathematical models for academic webs: linear relationship or non-linear power law?
Authors: Nigel Payne, Mike Thelwall
Venue: Information Processing and Management: an International Journal (2005)

Previous studies of academic web interlinking have tended to hypothesise that the relationship between the research of a university and links to or from its web site should follow a linear trend, yet the typical distribution of web data, in general, seems to be a non-linear power law. This paper assesses whether a linear trend or a power law is the most appropriate method with which to model the relationship between research and web site size or outlinks. Following linear regression, analysis of the confidence intervals for the logarithmic graphs, and analysis of the outliers, the results suggest that a linear trend is more appropriate than a non-linear power law.
Discriminant Substrokes for Online Handwriting Recognition
Authors: Karteek Alahari, Satya Lahari Putrevu, C. V. Jawahar
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A discriminant-based framework for automatic recognition of online handwriting data is presented in this paper. We identify the substrokes that are more useful in discriminating between two online strokes. A similarity/dissimilarity score is computed based on the discriminatory potential of various parts of the stroke for the classification task. The discriminatory potential is then converted to the relative importance of the substroke. Experimental verification on online data such as numerals, characters supports our claims. We achieve an average reduction of 41% in the classification error rate on many test sets of similar character pairs.
Traceability Map: Foundations to Automate for Product Line Engineering
Authors: Soo Dong Kim, Soo Ho Chang, Hyun Jung La
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Product line engineering (PLE) is an emerging reuse approach, and it has two processes; core asset engineering and application engineering. Various artifacts are produced in PLE, and there is no strong consensus on the key elements of each artifact. Moreover, precise mappings and relationships among the artifacts are yet to define. In order to apply PLE practically and to automate PLE process, elements of artifacts and their relationships should be precisely specified. In this paper, we first present a generic PLE process based on representative PLE approaches. Then, we define meta-models of PLE artifacts, to show how each artifact can be represented at conceptual and physical levels. Finally, we specify an overall traceability map, trace links and mapping relationships. With our foundation of PLE traceability, PLE artifacts such as core assets and instantiated products can be more efficiently and correctly developed. Also, this work paves the way to semi-automate the overall PLE process.
Resolvable Steiner Quadruple Systems for the Last 23 Orders
Authors: L. Ji, L. Zhu
Venue: SIAM Journal on Discrete Mathematics (2005)

A Steiner quadruple system of order v, denoted by SQS(v), is a pair $(X,{\cal B}),$ where X is a v-set of points and ${\cal B}$ is a set of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in exactly one block of ${\cal B}$. An SQS(v) is resolvable if its block set can be partitioned into parallel classes. In 1987, Hartman showed that the necessary condition $v\equiv 4$ or $8\ (\rm {mod}\ 12)$ for the existence of a resolvable SQS(v) is sufficient with 23 possible exceptions. In this paper, we construct resolvable SQS(v)s for the 23 undecided orders.
Latency-Based Supervisors for Enforcing Deadlines in Time Petri Nets
Authors: Ugo Buy, Mihai Lehene, Houshang Darabi
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

We outline a supervisory control method for enforcing deadlines in real-time systems modeled as time Petri nets. Given a time Petri net NT, a net transition td, and a deadline d, we generate supervisory controllers that force td to fire at most d time units since the previous firing of td. Our method uses the unfolding of the ordinary (untimed) Petri net underlying NT in order to define control supervisors enforcing the deadline. The unfolding of a Petri net is an acyclic Petri net whose markings correspond to the markings of the original Petri net. An advantage of net unfoldings is that they show the causal relation among transition firings in the original Petri net. Using a net unfolding, we define a so-called latency for each transition in NT, which we assume to be live. The latency of a transition is an upper bound on the delay between the firing of that transition and the firing of td. Our supervisory controllers dynamically disable the firing of transitions whose latency is greater than the time left until the expiration of the deadline on td. Here we discuss the most crucial aspect of this method, namely the definition of transition latencies from net unfoldings.
Algorithms for data dissemination and collection
Authors: Yung-Chun Wan
Venue:  (2005)

Broadcasting and gossiping are classical problems that have been widely studied for decades. In broadcasting, one source node wishes to send a message to every other node, while in gossiping, each node has a message that they wish to send to everyone else. Both are some of the most basic problems arising in communication networks. In this dissertation we study problems that generalize gossiping and broadcasting. For example, the source node may have several messages to broadcast or multicast. Many of the works on broadcasting in the literature are focused on homogeneous networks. The algorithms developed are more applicable to managing data on local-area networks. However, large-scale storage systems often consist of storage devices clustered over a wide-area network. Finding a suitable model and developing algorithms for broadcast that recognize the heterogeneous nature of the communication network is a significant part of this dissertation. We also address the problem of data collection in a wide-area network, which has largely been neglected, and is likely to become more significant as the Internet becomes more embedded in everyday life. We consider a situation where large amounts of data have to be moved from several different locations to a destination. In this work, we focus on two key properties: the available bandwidth can fluctuate, and the network may not choose the best route to transfer the data between two hosts. We focus on improving the task completion time by re-routing the data through intermediate hosts and show that under certain network conditions we can reduce the total completion time by a factor of two. This is done by developing an approach for computing coordinated data collection schedules using network flows.
Management and Retrieval of Web Services Based on Formal Concept Analysis
Authors: Dunlu Peng, Sheng Huang, Xiaoling Wang, Aoying Zhou
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

After introducing some basic concepts of Web services and the definition of their relationships, we formally define the problem of managing and retrieving of Web services. This paper presents Formal Concept Analysis to manage Web services and generate the concept lattice describing the relationship between them. We demonstrate how to express the relationship between Web services using concept lattice effectively and develop algorithms to retrieve Web services accurately in the lattices. Meanwhile, some strategies are also proposed to minimize the impacts of factors on the efficiency of Web service retrieval. Experimental results show our approach can manage Web services effectively and retrieve them with high efficiency and accuracy.
Constructing Efficient Multi-hop Mesh Networks
Authors: Rui Zhao, Bernhard Walke, Michael Einhaus
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The Wireless Channel-oriented Ad-hoc Multi-hop Broadband (W-CHAMB) is a new link layer protocol with the aim of being able to support Quality of Service (QoS) in multi-hop operation in fully distributed ad hoc networks. It is based on Time Division Multiple Access (TDMA) technology, operating on a single frequency channel. In this paper, we improve the prioritized access mechanism by inserting the Contention Phase (CP) into the access slot. Then we propose 3 new algorithms to enhance the traffic performance in the multi-hop environment: On demand Time Division Duplex (On-demand-TDD) for achieving high channel utilization; Fairness Algorithm (FA) for acquiring the fairness even in a highly interfered multi-hop network; Setting Valid Transmission Time (VTT) for each traffic channel to prevent an excessive use of the traffic channel. The extensive simulations are performed by evaluating Transmission Control Protocol (TCP) performance over W-CHAMB multi-hop networks under heavy load situations. The achievable TCP throughput, packet delay, fairness and stability have been investigated. Results exhibit the outstanding multi-hop performance of the W-CHAMB protocol.
The computer age and the White Man's burden
Authors: Diana Patterson
Venue: ACM SIGSOC Bulletin (1981)

The Computer Age is nearly upon us. That's when the ordinary worker and householder find that they have to use a computer regularly during the course of their day. Making the Computer Age a reality has been, and continues to be, another White Man's Burden. The White Man, in this case, is not necessarily white or male, but his burden is as real to him now as it was to the Victorian Englishman. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Learning classifier system equivalent with reinforcement learning with function approximation
Authors: Atsushi Wada, Keiki Takadama, Katsunori Shimohara
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We present an experimental comparison of the reinforcement process between Learning Classifier System (LCS) and Reinforcement Learning (RL) with function approximation (FA) method, regarding their generalization mechanisms. To validate our previous theoretical analysis that derived equivalence of reinforcement process between LCS and RL, we introduce a simple test environment named Gridworld, which can be applied to both LCS and RL with three different classes of generalization: (1) tabular representation; (2) state aggregation; and (3) linear approximation. From the simulation experiments comparing LCS with its GA-inactivated and corresponding RL method, all the cases regarding the class of generalization showed identical results with the criteria of performance and temporal difference (TD) error, thereby verifying the equivalence predicted from the theory.
Physics-motivated features for distinguishing photographic images and computer graphics
Authors: Tian-Tsong Ng, Shih-Fu Chang, Jessie Hsu, Lexing Xie, Mao-Pei Tsui
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The increasing photorealism for computer graphics has made computer graphics a convincing form of image forgery. Therefore, classifying photographic images and photorealistic computer graphics has become an important problem for image forgery detection. In this paper, we propose a new geometry-based image model, motivated by the physical image generation process, to tackle the above-mentioned problem. The proposed model reveals certain physical differences between the two image categories, such as the gamma correction in photographic images and the sharp structures in computer graphics. For the problem of image forgery detection, we propose two levels of image authenticity definition, i.e., imaging-process authenticity and scene authenticity, and analyze our technique against these definitions. Such definition is important for making the concept of image authenticity computable. Apart from offering physical insights, our technique with a classification accuracy of 83.5% outperforms those in the prior work, i.e., wavelet features at 80.3% and cartoon features at 71.0%. We also consider a recapturing attack scenario and propose a counter-attack measure. In addition, we constructed a publicly available benchmark dataset with images of diverse content and computer graphics of high photorealism.
News Briefs
Venue: IT Professional (2005)

According to the Associated Press, momentum is building for a new standard protocol that will enable network operators to bridge the gaps between mobile provider's voice calls and data services. The current standard--Internet Protocol for Multimedia Subsystems (IMS)--will serve only as a springboard for convergence between future services, nearly all of which will need to be adapted or replaced over time. Despite the growth of phone and Internet services, such as Voice over Internet Protocol (VoIP), most wireline and wireless calls aren't transmitted in IP from start-to-finish; calls get converted to traditional phone protocols on either or both ends. The new capabilities this new standard is expected to usher in--including using a cell phone to view live television broadcasts, check the program listings, program a digital video recorder, or even watch programs stored on that DVR--are forecast to arrive by mid-2006. A report released this past November on science and technology in the US entitled, "Rising Above the Gathering Storm: Energizing and Employing America for a Brighter Economic Future," says that the future of IT in this country looks grim. Norman Augustine, former chairman and CEO of Lockheed Martin Corporation and one of the main authors of the study, appeared before Congress to report on his findings. Among other factors contributing to what Augustine calls "a serious and intensifying challenge with regard to its future competitiveness and standard of living" in the US, he and his committee of 20 national science, technology, business, and policy experts said that the end of the Cold War, the expansion of aviation, and the development of technology have eliminated barriers and produced almost "three billion highly motivated, often well-educated, new capitalists" into the job market.According to technology research firm IDTechEx, postal and courier mail services are expected to become the second largest market for radio frequency identification (RFID) item-level tagging. The firm expects that by 2020 postal and carrier services will label one trillion packages and letters annually, making this the second largest application--following the retail sector--of RFID in the world.
Modeling of the City Transport Flows as Applied to the Moscow Agglomeration
Authors: A. S. Aliev, A. I. Strel'Nikov, V. I. Shvetsov, Yu. Z. Shershevskii
Venue: Automation and Remote Control (2005)

A mathematical model of the transport system of a city or an urban agglomeration intended for forecasting the transport and passenger flows was described. It is distinguished for (i) modeling the differences in the structure of travels at different times of day as well as at different days of week and seasons and (ii) consistent use of the concept of "generalized cost" of travel as a criterion for estimating the paths and inter-district "transport" distances. The model was calibrated in practice for the transport network of the Moscow agglomeration which includes the city of Moscow and its suburbs where the major part of the population of the Moscow province is concentrated. The computer-aided realization was based on the TRANSNET integrated designer environment for transport flow modeling.
Cluster-based solution for virtual and augmented reality applications
Authors: Antoine Tarault, Thomas Convard, Patrick Bourdot, Jean-Marc Vézien
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This paper presents a cluster-based architecture designed for an augmented reality interface. It can manage and synchronize live video streams as well as 3D deformable objects inside OpenSceneGraph. To preserve modularity, the framework was implemented in RTMaps&reg;, a realtime data flow manager. Based on graphical programming, RTMaps greatly facilitates the design of a customized Virtual and Augmented Reality application with acquisition and rendering components distributed over a network.
Bridging the Processor-Memory Performance Gapwith 3D IC Technology
Authors: Christianto C. Liu, Ilya Ganusov, Martin Burtscher, Sandip Tiwari
Venue: IEEE Design Test (2005)

Bringing the memory close to the processor is obviously a good idea forreducing latency, but the memory is not a monolith: It includes submodules, and their arrangement determines the effectiveness of using 3D technology. The authors look at various scenarios for arranging the CPU relative to the memory modules and provide a quantitative comparison.
Reproducible resistance switching characteristics of pulsed laser-deposited polycrystalline Nb2O5
Authors: Hyunjun Sim, Dooho Choi, Dongsoo Lee, Musarrat Hasan, Chandan B. Samantaray, Hyunsang Hwang
Venue: Microelectronic Engineering (2005)

We investigated the reproducible and memory resistance switching characteristics of pulsed-laser deposited thin polycrystalline Nb2O5 film for application to nonvolatile memory devices. Reproducible switching cycles were observed, and the resistance ratios of two distinct conduction states were approximately two orders of magnitude. Two resistance switching states were also obtained for pulse duration as much as 10 ns. The degradation of both resistance states at 125°C, indicating memory characteristics, was expected within 8 percent for 10 years. We also investigated the temperature-dependent conduction mechanisms of the high resistance state and the low resistance state, and we discussed a plausible resistance switching mechanism.
Language Learning: From Individual Learners to Communities
Authors: Sobah A. Petersen, Monica Divitini
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Mobile personal technologies are mostly used to support the mobile learners of a language by promoting anytime anywhere access to learning resources. In our work, we rather focus on the need to look at the communities where the learning takes place and is contextualised. This opens for a complementary usage of mobile technologies to promote anytime anywhere access to other people and the contextualisation of learning resources. In this paper, we present some initial scenarios illustrating different forms of mobility. We then identify key dimensions to understand mobility of learners across multiple communities and draw some initial implications for design of mobile technologies.
HRIC: Hybrid Resource Information Service Architecture Based on GMA
Authors: Hongbo Zou, Hai Jin, Zongfen Han, Xuanhua Shi, Hanhua Chen
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Resource information service, as a key component of grid, is the basis of the resource allocation, resource performance evaluation and prediction. The validity of the resource information service directly influences the availability of the whole system. One of key points to make information service work well is the precise of the information collected, how to get the valid system information with low system cost has became a difficult problem in current information service. In this paper, we propose hybrid resource information service architecture based on Grid Monitoring Architecture to promote the validity of the resource information service in grid. HRIC is an improved information service architecture that utilizes resource changing self-monitoring mechanism to offset the blind spot of the periodical information collection and combine the advantages of two traditional information collection methods - periodic collection and stochastic reporting, thereby improving the accuracy of resource information service. Compared with the existing resource information systems, HRIC's performance has been validated by several applications.
Putting Semantics into e-Science and Grids
Authors: Carole Goble
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

What is the Semantic Grid? How can e-Science benefit from the technologies of the Semantic Web? Can we build a Semantic Web for e-Science? Would that differ from a Semantic Grid? Given our past experiences with Scientists, Grid developers and Semantic web researchers, what are the prospects, and pitfalls, of putting semantics into e-Science applications and Grid infrastructure?
Reasoning Technique for Extended Fuzzy Description Logics
Authors: Yanhui Li, Baowen Xu, Jianjiang Lu, Dazhou Kang, Jie Xu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

A family of extended fuzzy description logics, which includes a framework of syntax, semantics, knowledge base form and reasoning tasks, is proposed to enable representation and reasoning for complex fuzzy information. This paper discusses the reasoning technique for reasoning tasks of extended fuzzy description logics, which adopts classical description logics to discretely simulate extended fuzzy description logic in polynomial time and reuses the existing reasoning result to prove the complexity of reasoning tasks of extended fuzzy description logics.