ppxscal/embedding_network huggingface dataset:
Ant Colony Optimization for Winner Determination in Combinatorial Auctions
Authors: Rongwei Gan, Qingshun Guo, Huiyou Chang, Yang Yi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Determining the winners of combinatorial auctions which maximize the profit of the auctioneer is NPComplete problem. This paper presents an efficient approximate searching algorithm IAA for the problem. The new algorithm uses the Ant Colony Optimization algorithm based on heuristic rules, the proposed algorithm not only give the way for identify feasible bids with a given partial solution but also avoid the unnecessary trials that will not lead to an optimal solution. We have implemented IAA with Visual C++6.0, experiment results show IAA has good performance. When the average error of IAA is less than 2%, the running time of IAA is less than half of Edo Zurel and Noam Nisan's ALPH algorithm in random and weighted random distributions. Meanwhile IAA can get excellent solution for problem with over 3000 items and 50000 bids.
The virtual cathedral and the virtual bazaar
Authors: Reina Y. Arakji, Karl R. Lang
Venue: ACM SIGMIS Database (2007)

Applying economic analysis, we explore the potential benefits and risks associated with firm-based and social production models and derive conditions that determine when open or closed innovation models are more appropriate. We contrast the newly emerging "user-generated approach" to innovation in virtual worlds with the traditional "producer-controlled approach". Taking the cases of World of Warcraft and Second Life, we show how the two virtual world providers use very different strategies to organize the creation of game content. We conclude with presenting a roadmap that businesses can use to conceive effective innovation and development strategies for designing virtual world offerings.
Web services (industrial session)
Authors: L. F. Cabrera
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Web services have become a mainstream developmemt in the industry. Their emergence is based on the mechanisms that made Web Browsing popular: the existence of a pervasive networking infrastructure, the widely deployed availability of communication protocols such as IP, TCP, UDP and HTTP, the standardization of XML documents and their display by browsers, and the emergence of higher level transports such as SOAP. In additiom standard services such as UDDI and description languages such as WSDL established a base on which services could be specified, described, and published. Thus, the begning of the inter Web Service communication was founded.
Node Mergers in the Presence of Don't Cares
Authors: Stephen M. Plaza, Kai-hui Chang, Igor L. Markov, Valeria Bertacco
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This provides significant advantages in synthesis by reducing circuit size and provides additional flexibility in technology mapping, which could be crucial in post-synthesis optimiza-tions. Furthermore, it is also critical in verification because it can reduce the complexity of the netlist to be analyzed in equivalence checking. Most algorithms available so far for this goal do not exploit observability don't cares (ODCs) for node merging since nodes equivalent up to ODCs do not form an equivalence relation. Although a few recently proposed solutions can exploit ODCs by overcoming this limitation, they constrain their analysis to just a few levels of surrounding logic to avoid prohibitive runtime. We develop an ODC-based node merging algorithm that performs efficient global ODC analysis (considering the entire netlist) through simulation and SAT. Our contributions which enable global ODC-based optimizations are: (1) a fast ODC-aware simulator and (2) an incremental verification strategy that limits computational complexity. In addition, our technique operates on arbitrarily mapped netlists, allowing for powerful post-synthesis optimizations. We show that global ODC analysis discovers on average 25% more (and up to 60%) node-merging opportunities than current state-of-the-art solutions based on local ODC analysis.
Untangling twisted nets for bus routing
Authors: Tan Yan, Martin D. F. Wong
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Previous works [1], [2] on PCB bus routing assume matched pin ordering for both sides. But in practice, the pin ordering might be mismatched and the nets become twisted. In this paper, we propose a preprocessing step to untangle such twisted nets. We also present an algorithm to solve this untangling problem. Our algorithm produces an optimal single-detour routing scheme that rematches the pin ordering. By integrating our preprocessing step into the bus router in [2], we show that many routing problems that cannot be solved previously can now be solved with insignificant increase in runtime.
Resistive Bridging Faults DFT with Adaptive Power Management Awareness
Authors: Urban Ingelsson, Paul Rosinger, S. Saqib Khursheed, Bashir M. Al-Hashimi, Peter Harrod
Venue: Proceedings of the 16th Asian Test Symposium (2007)

A key design constraint of circuits used in handheld devices is the power consumption, due mainly to the limitations of battery life. The employment of adaptive power management (APM) methods optimizes the power consumption of such circuits. This paper describes an effective APM-aware DFT technique that consists of a Test Generation Suite, including fault list generation, test pattern generation and fault simulation. The test generation suite is capable of generating test patterns for multiple supply voltage (Vdd) settings to maximize coverage of resistive bridging faults; and a method to reduce the number of Vdd settings without compromising the fault coverage in order to reduce the cost of test. Preliminarily validations of the proposed DFT technique using a number of benchmark circuits demonstrate its effectiveness.
Visualizing Causal Semantics Using Animations
Authors: Nivedita Kadaba, Pourang Irani
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Michotte's theory of ampliation suggests that causal relationships are perceived by objects animated under appropriate spatiotemporal conditions. We extend the theory of ampliation and propose that the immediate perception of complex causal relations is also dependent on a set of structural and temporal rules. We designed animated representations, based on Michotte's rules, for showing complex causal relationships or causal semantics. In this paper we describe a set of animations for showing semantics such as causal amplification, causal strength, causal dampening, and causal multiplicity. In a two part study we compared the effectiveness of both the static and animated representations. The first study (N=44) asked participants to recall passages that were previously displayed using both types of representations. Participants were 8% more accurate in recalling causal semantics when they were presented using animations instead of static graphs. In the second study (N=112) we evaluated the intuitiveness of the representations. Our results showed that while users were as accurate with the static graphs as with the animations, they were 9% faster in matching the correct causal statements in the animated condition. Overall our results show that animated diagrams that are designed based on perceptual rules such as those proposed by Michotte have the potential to facilitate comprehension of complex causal relations.
Neural systems with numerically matched input-output statistic: isotonic bivariate statistical modeling
Authors: Simone Fiori
Venue: Computational Intelligence and Neuroscience (2007)

Bivariate statistical modeling from incomplete data is a useful statistical tool that allows to discover the model underlying two data sets when the data in the two sets do not correspond in size nor in ordering. Such situation may occur when the sizes of the two data sets do not match (i.e., there are "holes" in the data) or when the data sets have been acquired independently. Also, statistical modeling is useful when the amount of available data is enough to show relevant statistical features of the phenomenon underlying the data. We propose to tackle the problem of statistical modeling via a neural (nonlinear) system that is able to match its input-output statistic to the statistic of the available data sets. A key point of the new implementation proposed here is that it is based on look-up-table (LUT) neural systems, which guarantee a computationally advantageous way of implementing neural systems. A number of numerical experiments, performed on both synthetic and real-world data sets, illustrate the features of the proposed modeling procedure.
An Experiment on Human Engineering of Interactive Software
Authors: H. F. Ledgard
Venue: IEEE Transactions on Software Engineering (1980)

Improved human engineering can add significantly to the acceptance and use of computer technology. We report here an experiment in which users with varying degrees of interactive computing experience used two versions of an interactive text editor: one with an English-like command syntax, the other with a more notational syntax. User performance differences strongly favored the English-like editor at all levels of experience.
Compressed data structures: Dictionaries and data-aware measures
Authors: Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
Venue: Theoretical Computer Science (2007)

In this paper, we propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem on set data, where the task is to construct a data structure for representing a set S of n items out of a universe U={0,...,u-1} and supporting various queries on S. We use a well-known data-aware measure for set data called gap to bound the space of our data structures. We describe a novel dictionary structure that requires gap+O(nlog(u/n)/logn)+O(nloglog(u/n)) bits. Under the RAM model, our dictionary supports membership, rank, and predecessor queries in nearly optimal time, matching the time bound of Andersson and Thorup's predecessor structure [A. Andersson, M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in: ACM Symposium on Theory of Computing, STOC, 2000], while simultaneously improving upon their space usage. We support select queries even faster in O(loglogn) time. Our dictionary structure uses exactly gap bits in the leading term (i.e., the constant factor is 1) and answers queries in near-optimal time. When seen from the worst-case perspective, we present the first O(nlog(u/n))-bit dictionary structure that supports these queries in near-optimal time under the RAM model. We also build a dictionary which requires the same space and supports membership, select, and partial rank queries even more quickly in O(loglogn) time. We go on to show that for many (real-world) datasets, data-aware methods lead to a worthwhile compression over combinatorial methods. To the best of our knowledge, these are the first results that achieve data-aware space usage and retain near-optimal time.
Single-Phase Shunt Hybrid Active Power Filter Based on ANN
Authors: Wenjin Dai, Taiyang Huang, Na Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, a single-phase shunt hybrid active power filter (APF) is presented to compensate reactive power and eliminate harmonics in power system. The hybrid active filter consists of one active filter and one passive filter connected in series. By controlling the equivalent output voltage of active filter, the harmonic currents generated by the nonlinear load are blocked and flowed into the passive filter. Sensing load current, dc bus voltage, dc bus reference voltage and source voltage compute reference voltage of APF through modified adaptive artificial neural network (ANN). And a voltage controller is used to generate the firing pulses of the voltage source inverter. The proposed system is implemented using Digital Signal Processor (DSP). Simulating results are presented to confirm the validity of the scheme. Keywords: shunt hybrid active power filter, voltage controller, artificial neural network
A CCS based Model for Describing and Verifying the Behavior of Web Service
Authors: Zhiying Cao, Li Bao, Weishi Zhang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Guaranteeing the correct behavior of Web service composition which is composed of independent, communicating Web services is an essential problem. A CCS-based model which generalizes the behavior of Web services and their composition is proposed in this paper. The application of this model is further investigated in a case study.
A Novel Classification Algorithm Based on Fuzzy Kernel Multiple Hyperspheres
Authors: Lei Gu, Hui-zhong Wu, Liang Xiao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper a novel classification algorithm based on fuzzy kernel multiple hyperspheres is presented. In the training process all training samples of each class are covered by the constructed multiple hyperspheres. Each hypersphere encompasses as many samples with the same class as possible via the greedy method. A fuzzy member- ship function is defined to label the testing samples in the classification process. Moreover, the kernel function is used instead of Euclidean inner product. Finally, Experiments on three artificial datasets and five real datasets show that our approach is valid and has encouraging pattern classification performance.
Zoetmorerope: non-optical physical space 3d-animation
Authors: Yasuhiro Sakamoto, Yu Sudo, Masa Inakage
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Zoetmorerope is a computer-controlled animation device, which produces the same phenomenon as a motion picture by manipulating just the angular velocity of rotary motion. Since the invention of film, motion picture media have accompanied with optical technology, and instruments such strobes and projection. Confronting this situation, we have made Zoetmorerope to establish non-optical animation media. In this research, solid model animations produced in real world has been realized.
Research issues and overview of economic models in Mobile-P2P networks
Authors: Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The mobile-P2P paradigm is becoming increasingly popular. Existing mobile-P2P solutions largely do not consider economic incentive models for enticing peer participation without eliminating free-riders and for effectively handling mobile resource constraints such as energy. This paper presents an executive summary of the existing solutions and an overview of some of the important issues for handling problems in mobile-P2P networks using economic models. We also present our perspectives on building "real' mobile-P2P applications using economic models.
Pictorial Information Processing of Landsat Data for Geographic Analysis
Authors: A. L. Zobrist
Venue: Computer (1981)

For geographic applications, satellite image data must be combined with aerial photos, census data, and existing maps. ntegrating the various data forms is a complex, multistep operation.
Evaluation of content-based image descriptors by statistical methods
Authors: Horst Eidenberger
Venue: Multimedia Tools and Applications (2007)

Evaluation of visual information retrieval systems is usually performed by executing test queries and computing recall- and precision-like measures based on predefined media collections and ground truth information. This process is complex and time consuming. For the evaluation of feature transformations (transformation of visual media objects to feature vectors) it would be desirable to have simpler methods available as well. In this paper we introduce a supplementary evaluation procedure for features that is founded on statistical data analysis. A second novelty is that we make use of the existing visual MPEG-7 descriptors to judge the characteristics of feature transformations. The proposed procedure is divided into four steps: (1) feature extraction, (2) merging with MPEG-7 data and normalisation, (3) statistical data analysis and (4) visualisation and interpretation. Three types of statistical methods are used for evaluation: (1) univariate description (moments, etc.), (2) identification of similarities between feature elements (e.g. cluster analysis) and (3) identification of dependencies between variables (e.g. factor analysis). Statistical analysis provides beneficial insights into the structure of features that can be exploited for feature redesign. Application and advantages of the proposed approach are shown in a number of toy examples.
A Complex Integer Multiplier Using the Quadratic-Polynomial Residue Number System with Numbers of Form 22n+ 1
Authors: H. C. Shyu
Venue: IEEE Transactions on Computers (1987)

A quadratic-polynomial Fermat residue number system (QFNS) can be used to compute the complex multiplications needed to perform a DFT. The advantage of such a QFNS is that complex multiplication can be accomplished with only two integer multiplications. In this paper, it is shown that a new set of numbers of the form Tn = 22n + 1 can be used in place of the set of Fermat numbers. This new quadratic residue number system can be used also to compute a complex multiplication with only two integer multiplications.
Radio resource management for downlink multimedia services in TDMA/CDMA interference-limited cellular networks
Authors: Tallal Elshabrawy, Tho Le-Ngoc
Venue: Wireless Personal Communications: An International Journal (2007)

This paper addresses the radio resource management (RRM) structure and efficient dynamic capacity allocation techniques for hybrid TDMA/ CDMA mobile cellular networks to support downlink multimedia services with different quality-of-service (QoS) requirements in an interference-limited environment. Various burst-driven timeslot-code assignment algorithms suitable for distributed processing are proposed to achieve high system capacity in terms of b/s/Hz/cell while maintaining a required percentage of satisfied users. Simulation results for various traffic scenarios are used for performance evaluation and comparison. The impacts of bursty WWW traffic on speech performance are also examined. It is shown that interference information can be used in timeslot-code assignment to significantly improve the system performance. Based on the received interference information, the minimum instantaneous power (MIP) algorithm aims to assign timeslot-codes that minimize the required transmitted power to maintain a target SINR. The MIP can provide an increase of 23% in system capacity. By considering to reduce both potentially received and generated interference in timeslot-code assignment, the Minimum Sum of Path-loss Ratios (MS-PLR) algorithm can further offer an additional capacity increase of 24%.
Realising the potential of access networks using DSL
Authors: K. T. Foster, G. Young, J. W. Cook, D. E. Clarke, R. H. Kirkby, M. G. Booth
Venue: BT Technology Journal (2007)

This paper provides an overview of digital subscriber line (DSL) technology and describes some of the key technical issues facing BT's DSL engineering team. The factors which determine the theoretical information-carrying capacity of BT's access network cables are discussed to give the reader a feel for the potential of the existing access network to deliver broadband services. Transmission on this network will be subject to impairments which will limit the achievable capacity, and there is an urgent need to ensure that all DSL systems are spectrally compatible if the capacity of the network is to be fully realised.
Note: A note on the existence of sequences with small star discrepancy
Authors: Josef Dick
Venue: Journal of Complexity (2007)

It was shown by Heinrich et al. [The inverse of the star-discrepancy depends linearly on the dimension, Acta Arith. 96 (2001) 279-302] that there exist point sets for which the inverse of the star discrepancy depends linearly on the dimension. In this paper we extend those results by showing that there exist point sets extensible in the modulus and the dimension for which the star discrepancy satisfies a tractability bound for all dimensions and moduli.
Deterministic constructions of compressed sensing matrices
Authors: Ronald A. DeVore
Venue: Journal of Complexity (2007)

Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However, for possible circuit implementation, it is important to understand what can be done with purely deterministic sampling. In this note, we show how to construct sampling matrices using finite fields. One such construction gives cyclic matrices which are interesting for circuit implementation. While the guaranteed performance of these deterministic constructions is not comparable to the random constructions, these matrices have the best known performance for purely deterministic constructions.
Combining global and local information for knowledge-assisted image analysis and classification
Authors: G. Th. Papadopoulos, V. Mezaris, I. Kompatsiaris, M. G. Strintzis
Venue: EURASIP Journal on Advances in Signal Processing (2007)

A learning approach to knowledge-assisted image analysis and classification is proposed that combines global and local information with explicitly defined knowledge in the form of an ontology. The ontology specifies the domain of interest, its subdomains, the concepts related to each subdomain as well as contextual information. Support vector machines (SVMs) are employed in order to provide image classification to the ontology subdomains based on global image descriptions. In parallel, a segmentation algorithm is applied to segment the image into regions and SVMs are again employed, this time for performing an initial mapping between region low-level visual features and the concepts in the ontology. Then, a decision function, that receives as input the computed region-concept associations together with contextual information in the form of concept frequency of appearance, realizes image classification based on local information. A fusion mechanism subsequently combines the intermediate classification results, provided by the local-and global-level information processing, to decide on the final image classification. Once the image subdomain is selected, final region-concept association is performed using again SVMs and a genetic algorithm (GA) for optimizing the mapping between the image regions and the selected subdomain concepts taking into account contextual information in the form of spatial relations. Application of the proposed approach to images of the selected domain results in their classification (i.e., their assignment to one of the defined subdomains) and the generation of a fine granularity semantic representation of them (i.e., a segmentation map with semantic concepts attached to each segment). Experiments with images from the personal collection domain, as well as comparative evaluation with other approaches of the literature, demonstrate the performance of the proposed approach.