ppxscal/embedding_network huggingface dataset:
Approximating revenue-maximizing combinatorial auctions
Authors: Anton Likhodedov, Tuomas Sandholm
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Designing revenue-maximizing combinatorial auctions (CAs) is a recognized open problem in mechanism design. It is unsolved even for two bidders and two items for sale. Rather than attempting to characterize the optimal auction, we focus on designing approximations (suboptimal auction mechanisms which yield high revenue). Our approximations belong to the family of virtual valuations combinatorial auctions (VVCA). VVCA is a Vickrey-Clarke-Groves (VCG) mechanism run on virtual valuations that are linear transformations of the bidders' real valuations. We pursue two approaches to constructing approximately optimal CAs. The first is to construct a VVCA with worst-case and average-case performance guarantees. We give a logarithmic approximation auction for basic important special cases of the problem: 1) limited supply of items on sale with additive valuations and 2) unlimited supply. The second approach is to search the parameter space of VVCAs in order to obtain high-revenue mechanisms for the general problem. We introduce a series of increasingly sophisticated algorithms that use economic insights to guide the search and thus reduce the computational complexity. Our experiments demonstrate that in many cases these algorithms perform almost as well as the optimal VVCA, yield a substantial increase in revenue over the VCG mechanism and drastically outperform the straightforward algorithms in run-time.
Study on Information Integration Frame and Key Technique about ERP and E-commerce
Authors: Kong Zaojie, Liu Yunsheng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

To deal with the new economic development, e-commerce and ERP systems have been implemented at enterprises. In the process of enterprise information, that how to achieve e-commerce and ERP systems effective integration has become an important issue. The paper proposes the information integration frame of ERP and e-commerce, discusses the system function implanting, and introduces the core technology of system integration, the conversion between XML and Relational Database, in detail.
A semantics and complete algorithm for subsumption in the classic description logic
Authors: Alex Borgida, Peter F. Patel-Schneider
Venue: Journal of Artificial Intelligence Research (1993)

This paper analyzes the correctness of the subsumption algorithm used in CLASSIC, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in CLASSIC descriptions, the developers have had to use an algorithm that is incomplete with respect to the standard, model-theoretic semantics for description logics. We provide a variant semantics for descriptions with respect to which the current implementation is complete, and which can be independently motivated. The soundness and completeness of the polynomial-time subsumption algorithm is established using description graphs, which are an abstracted version of the implementation structures used in CLASSIC, and are of independent interest.
Design of Open-Source Joint C and VHDL "Twin" Program Module Libraries for Digital Signal Processing
Authors: Tao Zeng, Shilong Xue, François Auger
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In the domain of digital signal processing, the microcontrollers、the Digital Signal Processors(DSPs) and the Field Programmable Gate Arrays(FPGAs) are widely used.The microcontrollers and DSPs can use the C language, whilethe FPGAs use the VHDL language. To ease the coding, simulation and implication of digital signal processing, a new engineering tool is presented. The open-source joint C and VHDL “twin” program module libraries have many advantages. Firstly, they make choosing the ideal chip amongthe microcontrollers 、 DSPs and FPGAs more easily. Secondly, they can solve the problem of simulation and fixing the length of signals in VHDL language. Thirdly, they make the job of constructing programs more efficient.
Residual Images Remove Illumination Artifacts!
Authors: Tobi Vaudrey, Reinhard Klette
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

In past studies, illumination effects have been proven to cause the most common problems in correspondence algorithms. In this paper, we conduct a study identifying that the residual images (i.e., differences between images and their smoothed versions) contain the important information in an image. We go on to show that this approach removes illumination artifacts between corresponding pairs of images (i.e., optical flow and stereo) using a mixture of synthetic and real-life images.
Objective analysis of simple kidney cysts from CT images
Authors: S. Battiato, G. M. Farinella, G. Gallo, O. Garretto, C. Privitera
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

Simple kidney cysts analysis from CT images is nowadays performed in a direct visual and hardly reproducible way. Computer-aided measurements of simple kidney cysts from CT images may help radiologists to accomplish an objective analysis of the clinical cases under observation. We propose a semi-automatic segmentation algorithm for this task. Experiments performed on real datasets confirm the effectiveness and usefulness of the proposed method.
Bilinear Pairing Based DAA Protocol
Authors: Hong-hu Zhen, Yue Chen
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Direct Anonymous Attestation (DAA) is adopted by the Trusted Platform Module (TPM) of v1.2 standard described by the Trusted Computing Group (TCG), aimed at settling protocols for trusted platform attestation and platform privacy protection. This paper gives a presentation of the new DAA protocol based on bilinear pairings and an analysis of its capacity to realize both attestation anonymity and detection of malicious attacks. Comparing with the existing three kinds of DAA protocols (the initial one, the improved one and the one based on oblivious transfer), this new protocol is of the simplest but also the most efficient.
TEMPO 3.1: A Body Area Sensor Network Platform for Continuous Movement Assessment
Authors: Adam T. Barth, Mark A. Hanson, Harry C. Powell Jr., John Lach
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This work presents TEMPO (Technology-Enabled Medical Precision Observation) 3.1, a third generation body area sensor platform that accurately and precisely captures, processes, and wirelessly transmits six-degrees-of-freedom inertial data in a wearable, non-invasive form factor. TEMPO 3.1 is designed to be usable to both the wearer and researcher, thereby enabling motion capture applications in body area sensor networks (BASNs). A complete system is designed and developed that includes the following: (1) enabling technologies and hardware design of TEMPO 3.1, (2) a custom real-time operating system (TEMPOS) that manages all aspects of signal acquisition, signal processing, data management, peripheral control, and wireless communication on a TEMPO node, and (3) a custom case design. The system is evaluated and compared to existing BASN hardware platforms. TEMPO 3.1 creates new opportunities for wearable, continuous monitoring applications and extends the research space of current efforts.
Are User Interface Pattern Languages Usable? A Report from the Trenches
Authors: Regina Bernhaupt, Marco Winckler, Florence Pontico
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Patterns languages pattern languages for interaction design have been an active research field in the area of Human-Computer Interaction. However, only few researchers have explored the impact of pattern languages in real application domains. This work reports a field study on acceptance and adoption of pattern languages by development teams in industry. Our results show that pattern languages should take into account the idiosyncrasies of the application domain and results show that pattern languages can be a great leverage to improve usability culture in industry.
Research on Efficient Coverage Problem of Node in Wireless Sensor Networks
Authors: Xueqing Wang, Shuqin Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Efficient coverage area and efficient coverage area ratio of node are put forward by analysis of coverage problem of wireless sensor networks (WSN). It is theoretically proved through math modeling, theoretical analysis and formula deducting that how much the maximum efficient coverage area, the maximum efficient coverage area ratio, the maximum of net efficient coverage area and the maximum of net efficient coverage area ratio of node is if full seamless coverage is met in wireless sensor networks. At last, the analysis formula is given that minimum number of radio nodes is demanded in a given sensor field if the field is covered fully and seamlessly. The formula resolves a math problem of wireless sensor networks in theory. The research on the size of nodes has significant meanings of theory research and networks designing of wireless sensor networks.
Research on an Improved Virus Evolutionary Genetic Algorithm
Authors: JingJing Liu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

An improved virus evolutionary genetic algorithm was proposed in this article. Some of initial virus individuals were generated from some better host individuals, so that the fitness and the infection of virus individuals were improved and the average fitness of the host population was also improved. At the same time the theory of static multiplication was introduced to the algorithm, as a result the loss of optimum solution was avoided effectively and convergence performance and speed were increased. At last the simulation results to virus evolutionary genetic algorithm were showed. 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
Distributed Data Mining Based on Semantic Web and Grid
Authors: Huimin Wang, Guihua Nie, Kui Fu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Nowadays, the process of data mining is one of the most important topics in scientific and business problems. Grid Computing can be used as infrastructures to provide an effective computational support for distributed data mining applications. The paper proposed a data mining architecture from large-scale distributed and semantically heterogeneous data resources in order to efficiently support knowledge acquisition. Grid technology and semantic web technology were combined to solve the difficult problem of distributed data mining. Data mining in the Grid environment can provide highly efficient and powerful data analysis and knowledge discovery solution and semantic web can effectively solve the heterogeneity of data sources and make them available for data mining.
Heuristics for the multi-period orienteering problem with multiple time windows
Authors: Fabien Tricoire, Martin Romauch, Karl F. Doerner, Richard F. Hartl
Venue: Computers and Operations Research (2010)

We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms.
Interference between Sounding Reference Signal and Random Access Preamble Based on LTE Uplink
Authors: Ying Zhang, Fa-tang Chen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

This paper discussed the interference between 3G LTE random access preamble and the SRS (Sounding Reference Signal) via multi-UE link-level simulations, analyzed the performance changes of two types of signal under the influence of interference and found out the factors which leading these changes, then we summarized the way of reducing the interference.
Evaluating algorithms for the generation of referring expressions using a balanced corpus
Authors: Albert Gatt, Ielka van der Sluis, Kees van Deemter
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

Despite being the focus of intensive research, evaluation of algorithms that generate referring expressions is still in its infancy. We describe a corpus-based evaluation methodology, applied to a number of classic algorithms in this area. The methodology focuses on balance and semantic transparency to enable comparison of human and algorithmic output. Although the Incremental Algorithm emerges as the best match, we found that its dependency on manually-set parameters makes its performance difficult to predict.
Reasoning about Success and Failure in Intentional Agents
Authors: Timothy William Cleaver, Abdul Sattar, Kewen Wang
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

Rational agents must be aware of their success and failure to truly assess their own progress towards their intended goals. In this study we describe a detailed investigation of how current BDI agents monitor their successes and failures during their reasoning cycle. Our analysis indicates that the existing architectures are inadequate to specifically detect failures in their own behaviors. This makes them unaware of the reality of the environment in which they are operating. We propose an extended BDI-like architecture to address these problems. We extend the current reasoning cycle by reformulating the execution of actions and plans, and introducing additional rules to detect failures. The resulting reformulation can be applied to existing systems such as JACK, JAM, etc. As a case study we extended JASON to implement the extended BDI architecture.
Proceedings of the 4th International Workshop on Semantic Evaluations
Venue: ACL Workshops (2007)

This volume contains papers describing the tasks and participating systems in SemEval-2007 --- the Fourth International Workshop on Semantic Evaluations. The SemEval-2007 workshop was held in conjunction with the Association for Computational Linguistics meeting on June 23-24, 2007 in Prague, Czech Republic. The ACL Special Interest Group on the Lexicon (SIGLEX) is the umbrella organization for SemEval-2007. SIGLEX previously ran three highly successful evaluation exercises for word sense disambiguation under the name Senseval. As the nature of the tasks in Senseval has evolved to include semantic analysis tasks outside of word sense disambiguation, the Senseval Committee changed the name of the evaluation exercises to SemEval. SemEval-2007 was very successful. Our call for tasks solicited 27 task proposals. After a careful review process and a call for interest in participation, we selected 18 tasks to be part of the evaluation. Over 100 teams participated with over 125 unique systems. As a comparison, Senseval-3 (2004) organized 14 tasks with 55 teams.
LTAG dependency parsing with bidirectional incremental construction
Authors: Libin Shen, Aravind K. Joshi
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

In this paper, we first introduce a new architecture for parsing, bidirectional incremental parsing. We propose a novel algorithm for incremental construction, which can be applied to many structure learning problems in NLP. We apply this algorithm to LTAG dependency parsing, and achieve significant improvement on accuracy over the previous best result on the same data set.
Multiple-goal recognition from low-level signals
Authors: Xiaoyong Chai, Qiang Yang
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Researchers and practitioners from both the artificial intelligence and pervasive computing communities have been paying increasing attention to the task of inferring users' high-level goals from low-level sensor readings. A common assumption made by most approaches is that a user either has a single goal in mind, or achieves several goals sequentially. However, in real-world environments, a user often has multiple goals that are concurrently carried out, and a single action can serve as a common step towards multiple goals. In this paper, we formulate the multiple-goal recognition problem and exemplify it in an indoor environment where an RF-based wireless network is available. We propose a goal-recognition algorithm based on a dynamic model set and show how goal models evolve over time based on pre-defined states. Experiments with real data demonstrate that our method can accurately and efficiently recognize multiple interleaving goals in a user's trace.
The Fuzzy Based Compact Genetic Algorithm for Online TSP
Authors: Li Shugang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In this paper, we extend the definition of the common TSP and propose the online TSP, whose purpose is to find the shortest time of visiting all cities while considering the traffic conditions. We also propose a fuzzy based compact genetic algorithm (FCGA) for online TSPs. The basic idea of FCGA is to adapt the size of population simulated of CGA with a fuzzy neural network (FNN) based knowledge machine, which online refines the existing fuzzy rules and infers the fuzzy output directly without the complex fuzzy inference operations.
Exploration of Affect Sensing from Speech and Metaphorical Text
Authors: Li Zhang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

We report new developments on affect detection from textual metaphorical affective expression and affect sensing from speech. The textual affect detection component has been embedded in an intelligent conversational AI agent interacting with human users under loose scenarios. The detected affective states from text also play an important role in producing emotional animation for users' avatars. Evaluation of the affect detection from speech and text is provided. Our work contributes to the conference themes on engagement and emotion, virtual AI agents, narrative storytelling in education and evaluation of affective social interaction.
Ontology-Based Knowledge Extraction for Relational Database Schema
Authors: Guoqiang Zhang, Suling Jia
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Translating large amounts of relational data into ontological knowledge can be a major challenge. Based on the DL-based formalization of E-R model and OWL DL ontology, this paper studies the method for translating E-R model to OWL DL-based ontology and constructs corresponding mapping relationship between them. A translation algorithm has been improved to realize the translation. Finally, a case is designed to verify the algorithm. Analysis indicates that the algorithm is accurate and effective; and it proposes a new method for construct ontology.
WebArrayDB
Authors: Xiao-Qin Xia, Michael McClelland, Steffen Porwollik, Wenzhi Song, Xianling Cong, Yipeng Wang
Venue: Bioinformatics (2009)

Motivation: Cross-platform microarray analysis is an increasingly important research tool, but researchers still lack open source tools for storing, integrating and analyzing large amounts of microarray data obtained from different array platforms. Results: An open source integrated microarray database and analysis suite, WebArrayDB ( http://www.webarraydb.org), has been developed that features convenient uploading of data for storage in a MIAME (Minimal Information about a Microarray Experiment) compliant fashion, and allows data to be mined with a large variety of R-based tools, including data analysis across multiple platforms. Different methods for probe alignment, normalization and statistical analysis are included to account for systematic bias. Student's t-test, moderated t-tests, non-parametric tests and analysis of variance or covariance (ANOVA/ANCOVA) are among the choices of algorithms for differential analysis of data. Users also have the flexibility to define new factors and create new analysis models to fit complex experimental designs. All data can be queried or browsed through a web browser. The computations can be performed in parallel on symmetric multiprocessing (SMP) systems or Linux clusters. Availability: The software package is available for the use on a public web server (http://www.webarraydb.org) or can be downloaded. Contact:xqxia70@gmail.com; mcclelland.michael@gmail.com; yipengw@gmail.com Supplementary information:Supplementary data are available at Bioinformatics online.
Using a mutual information-based site transition network to map the genetic evolution of influenza A/H3N2 virus
Authors: Zhen Xia, Gulei Jin, Jun Zhu, Ruhong Zhou
Venue: Bioinformatics (2009)

Motivation: Mapping the antigenic and genetic evolution pathways of influenza A is of critical importance in the vaccine development and drug design of influenza virus. In this article, we have analyzed more than 4000 A/H3N2 hemagglutinin (HA) sequences from 1968 to 2008 to model the evolutionary path of the influenza virus, which allows us to predict its future potential drifts with specific mutations. Results: The mutual information (MI) method was used to design a site transition network (STN) for each amino acid site in the A/H3N2 HA sequence. The STN network indicates that most of the dynamic interactions are positioned around the epitopes and the receptor binding domain regions, with strong preferences in both the mutation sites and amino acid types being mutated to. The network also shows that antigenic changes accumulate over time, with occasional large changes due to multiple co-occurring mutations at antigenic sites. Furthermore, the cluster analysis by subdividing the STN into several subnetworks reveals a more detailed view about the features of the antigenic change: the characteristic inner sites and the connecting inter-subnetwork sites are both responsible for the drifts. A novel five-step prediction algorithm based on the STN shows a reasonable accuracy in reproducing historical HA mutations. For example, our method can reproduce the 2003–2004 A/H3N2 mutations with ~70% accuracy. The method also predicts seven possible mutations for the next antigenic drift in the coming 2009–2010 season. The STN approach also agrees well with the phylogenetic tree and antigenic maps based on HA inhibition assays. Availability: All code and data are available at http://ibi.zju.edu.cn/birdflu/ Contact: ruhongz@us.ibm.com Supplementary information:Supplementary data are available at Bioinformatics online.