ppxscal/embedding_network huggingface dataset:
Open Source BI Platforms: A Functional and Architectural Comparison
Authors: Matteo Golfarelli
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

While in the past the BI market was strictly dominated by closed source and commercial tools, the last few years were characterized by the birth of open source solutions: first as single BI tools, and later as complete BI platforms. An Open Source BI platform provides a full spectrum of BI capabilities within a unified system that reduces the overhead for the development and management of each application, and lets the user feel like he/she was using a single BI solution. This paper proposes a comparative evaluation of three different Open Source BI platforms (namely JasperSoft, Pentaho and SpagoBI) aimed at understanding their current features, their future potentialities and their limits when adopted in real projects as well as a basis for research prototyping. Overall we try to understand if the open source phenomenon will be able to become a valid alternative to commercial platforms within the BI context.
Robust agent teams via socially-attentive monitoring
Authors: Gal A. Kaminka, Milind Tambe
Venue: Journal of Artificial Intelligence Research (2000)

Agents in dynamic multi-agent environments must monitor their peers to execute individual and group plans. A key open question is how much monitoring of other agents' states is required to be effective: The Monitoring Selectivity Problem. We investigate this question in the context of detecting failures in teams of cooperating agents, via Socially-Attentive Monitoring, which focuses on monitoring for failures in the social relationships between the agents. We empirically and analytically explore a family of socially-attentive teamwork monitoring algorithms in two dynamic, complex, multi-agent domains, under varying conditions of task distribution and uncertainty. We show that a centralized scheme using a complex algorithm trades correctness for completeness and requires monitoring all teammates. In contrast, a simple distributed teamwork monitoring algorithm results in correct and complete detection of teamwork failures, despite relying on limited, uncertain knowledge, and monitoring only key agents in a team. In addition, we report on the design of a socially-attentive monitoring system and demonstrate its generality in monitoring several coordination relationships, diagnosing detected failures, and both on-line and off-line applications.
Negotiation-tools in CSCL-scenarios: do they have a valid use?
Authors: Angela Carell, Thomas Herrmann
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Within discursive knowledge construction, students are expected to negotiate within their collaboration as soon as they face opinions, concepts, or meanings differing from their own. Therefore, negotiation has become a central issue of CSCL research. In an experimental field study with 16 groups of 3 individuals each, we examined whether the demand to use technically supported communication (e-negotiation) within an asynchronous and spatially distributed setting has a positive influence on group discussions and knowledge integration. Our results indicate that the implementation of e-negotiation is in fact advantageous, but does not automatically lead to a successful result. Employed intensively, e-negotiation allows group members to emphasize incompatible ideas and therefore offers advantages especially in creative problem-solving processes.
User Experience Strategies and Tactics
Authors: Matt Cibelli
Venue:  (2009)

It's no longer enough that a site looks good, it has to make sense to users. This work cuts through the confusion and complexity surrounding user experience and suggests a simple, common sense model. 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
Composite tense recognition and tagging in Serbian
Authors: Duško Vitas, Cvetana Krstev
Venue: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic Languages (2003)

The technology of finite-state transducers is implemented to recognize, lemmatize and tag composite tenses in Serbian in a way that connects the auxiliary and main verb. The suggested approach uses a morphological electronic dictionary of simple words and appropriate local grammars.
Development of CAN Network for VMS Based on XC164CS
Authors: Jinsong Kang, Ying Wu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In the design of modern vehicles, CAN-bus network has been applied for the information exchange among the ECUs of the vehicle. The CAN communication network for vehicle management system (VMS) is designed based on XC164CS microcontroller in the paper. The characteristics and construction of Twin CAN module of XC164CS were introduced. The principle of time triggered controller area network (TTCAN) is described. The hardware interface circuit is developed to increase the stability and safety of the CAN nodes. The drive software and multitask application is realized on the platform of embedded operation system μC/OS-II. This CAN bus network can improve the anti-jamming and dependability effectively, which was applied to control and exchange the information of the vehicles.
A Secure and Efficient Deniable Authentication Protocol
Authors: Xin Xiangjun, Chen Dongsheng
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

A deniable authentication can be used to provide secure negotiation on the Internet. Although many deniable authentication protocols have been proposed, most of them are interactive or vulnerable to various cryptanalytic attacks. To find a secure and efficient deniable authentication protocol, by encrypting a random and the time stamp and signing the corresponding ciphertext and the message to be sent with Schnorr signature scheme, a new deniable authentication protocol is proposed. The non-interactive manners make that the new scheme is efficient. On the other hand, the new deniable protocol not only has the properties deniability and completeness but also has the enhanced security. The proposed scheme can be proved to be secure against forgery attack, impersonation attack, compromised session secret attack and key compromise impersonation (KCI) attack.
The Parameter Optimization of Human-Simulated Intelligent Controller Based on Improved Genetic Algorithm
Authors: Guiqiang Chen, Linjian Tang, Yan Tang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The human-simulated intelligent controller, using a hierarchical and multi-mode control structure, effectively solves the control difficult problems of many complex systems. But there are many parameters to be determined. In order to solve them, the paper introduces an improved genetic algorithm (IGA) which is combined with orthogonal design method. It is served as the simulation experiment platform by the cart-double pendulum. Through selected the reasonable fitness function and determined the appropriate parameters range, using the IGA, the parameters of the human-simulated intelligent controller are optimized. The simulation results show the IGA is better than the manual adjustment method. So it is proved that the IGA is more effective in solving the parameter optimization of human-simulated intelligent controller, and also promotes the more extended application space of intelligent control theory.
An experiment on "free generation" from single RDF triples
Authors: Xiantang Sun, Chris Mellish
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

This paper introduces our domain independent approach to "free generation" from single RDF triples without using any domain dependent knowledge. Our approach is developed based on our argument that RDF representations carry rich linguistic information, which can be used to achieve readable domain independent generation. In order to examine to what extent our argument is realistic, we carry out an evaluation experiment, which is the first evaluation of this kind of domain independent generation in the field.
Evaluating GETARUNS parser with GREVAL test suite
Authors: Rodolfo Delmonte
Venue: Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data (2004)

GREVAL, the test suite of 500 English sentences taken from SUSANNE Corpus and made available by John Carroll and Ted Briscoe at their website, has been used to test the performance of a symbolic linguistically-based parser called GETARUNS presented in (Delmonte, 2002). GETARUNS is a symbolic linguistically-based parser written in Prolog Horn clauses which uses a strong deterministic policy by means of a lookahead mechanism and a WFST. The grammar allows the specification of linguistic rules in a highly declarative mode: it works topdown and by making a heavy use of linguistic knowledge may achieve an almost complete deterministic policy: in this sense it is equivalent to an LR parser. The results obtained fare higher that the ones reported in (Preis, 2003) and this we argue is due basically to the symbolic rule-based approach: we reach 96% precision (coverage) and 84% recall (accuracy). We assume that from a psycholinguistic point of view, parsing requires setting up a number of disambiguating strategies, to tell arguments apart from adjuncts and reduce the effects of backtracking. To do that the system is based on LFG theoretical framework and uses Grammatical Functions information to help the parser cope with syntactic ambiguity. In the paper we shall comment on some shortcomings of the Greval corpus annotation and more in general we shall criticize some aspects of the Dependency Structure representation.
Discovery of Migration Habitats and Routes of Wild Bird Species by Clustering and Association Analysis
Authors: Mingjie Tang, Yuanchun Zhou, Peng Cui, Weihang Wang, Jinyan Li, Haiting Zhang, Yuansheng Hou, Baoping Yan
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Knowledge about the wetland use of migratory bird species during the annual life circle is very interesting to biologists, as it is critically important for conservation site construction and avian influenza control. The raw data of the habitat areas and the migration routes can be determined by high-tech GPS satellite telemetry, that usually are large scale with high complexity. In this paper, we convert these biological problems into computational studies, and introduce efficient algorithms for the data analysis. Our key idea is the concept of hierarchical clustering for migration habitat localization, and the notion of association rules for the discovery of migration routes. One of our clustering results is the Spatial-Tree, an illusive map which depicts the home range of bar-headed geese. A related result to this observation is an association pattern that reveals a high possibility of bar-headed geese's potential migration routes. Both of them are of biological novelty and meaning.
Silverlight 2 Web Development: Problem-Design- Solution
Authors: Steven A. Smith, R. Craig Palenshus, C. Brendan Enrick
Venue:  (2009)

* As Microsoft's solution for building rich, interactive applications, Silverlight is gaining rapid popularity among ASP.NET developers * This book shows how to enhance Web applications with Silverlight 1.1 via a tutorial that walks readers through each stage of application development * The author team uses the extremely popular TheBeerHouse application to present readers with a problem, a design, and the solution, with the end result being a real-world, working application that demonstrates the graphics, animation, audio, and video capabilities of Silverlight 1.1
A methodology for tuning two-level cache hierarchy considering energy and performance
Authors: A. G. Silva-Filho, C. C. Araújo
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

In this paper we propose a hybrid methodology for tuning both instruction and data cache configurations in a two-level memory hierarchy. The method aims to minimize energy consumption without compromise the performance. It combines two optimization mechanisms in order improve energy and performance results without increasing the configuration space. Experiments based on simulations were performed for 12 applications from the Mibench suite benchmark and the proposed methodology achieved better efficiency in 60% of the evaluated cases compared with existing heuristics.
An Anycast Routing Protocol for Wireless Mesh Access Network
Authors: Ling Song, Zheng-bing Xia
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Wireless mesh network is a new broad bandwidthdistributing wireless access network system. It can accessInternet through Gateway nodes. When network load of accessis heavy or network size is expanding, One gateway node willbecome a bottleneck of the access network because of theserious congestion of a large number of data packetstransmitted to the gateway node. Based on the research ofDSR(Dynamic Source Routing Protocol) and anycast service, amulti-gateway wireless mesh network routing protocol(MAMSR) was presented. In this protocol, the anycast groupmembers were multiple gateways, and DSR was expanded tosupport anycast. Simulation results show MAMSR caneffectively solve the congestion of single gateway, maintainhigh packet mailing rate，low delay and routing cost, andmake the access network run stably and efficiently.
Pearl River Delta PM10 Remote Sensing Monitoring and System Design
Authors: Fengbin Zheng, Baojun Qiao, Jun Ma, Zhongting Wang, Shenshen Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

PM10 (Particle Matter 10) is the major air pollutants. In this paper, the monitoring of PM10 from MODIS (Moderate Resolution Imaging Spectroradiometer) data was applied at Pearl River Delta, China. The method was as follow: 1) By DDV (dark dense vegetation) algorithm, the AOD (aerosol optical depth) was retrieved; 2) The PM10 was worked out from AOD. Using .NET multi-layer architecture, combined with MatlabCOM, ArcEngine and other components, we establish a PM10 Remote Sensing Monitoring System. After validated by ground-based measurements, it is shown that MODIS can monitor the spatial structure of PM10.
Design for Web Service Composition Tool Based on Qos Ontology and BPEL
Authors: Yao Shijun, Zhang Ping, Xie Lei, Wang Xuhui, Zhou Chunhua, Wu Zhitie
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The Architecture of visual process modeling tools for web services composition based on BPEL is introduced in detail. The concepts of arcs and nodes are imported and a visual process editor is implemented. Meanwhile, graphical method and the mapping technology which maps flow chart to BPEL elements are adopted. We give the method of describing QoS ontology of Web servicesand propose a solution to the service query and selection based on web service QoS constraint, which makes the web services thatmeet the consumers' requirement be bound with the business process dynamically and flexibly.
Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy
Authors: Giovanni Crescenzo, Ron Menendez, Shahab Etemad, Janet Jackel
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

Motivated by the recent emergence of ultra-high speed (e.g., 100Gb/s) optical networks, some researchers have recently started the study of optical encryption techniques that offer secrecy of information transfer over such networks. Despite significant attention to this problem, we are not aware of attempts made to define a formal cryptographic model for the study of such schemes. In this paper we fill this gap by proposing a formal model for the investigation of symmetric encryption with Shannon secrecy over a specific type of optical networks frequently studied in the related literature, where the security is imparted through all-optical signal processing. This model is then used to formally prove the Shannon secrecy of a construction obtained by carefully combining and improving ideas appeared in the optical network literature. In our construction the key stream rate is the same as the data stream rate, which is optimal for this level of security.
Action-space partitioning for planning
Authors: Natalia H. Gardiol, Leslie Pack Kaelbling
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the problem of planning in such domains and show how structured representations of the environment's dynamics can help partition the action space into a set of equivalence classes at run time. The partitioned action space is then used to produce a reduced set of actions. This technique speeds up search and can yield significant gains in planning efficiency.
Anytime coordination using separable bilinear programs
Authors: Marek Petrik, Shlomo Zilberstein
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm and derive both online and offline error bounds for approximate solutions. Moreover, we propose an effective way to automatically reduce the complexity of the interaction. Our experiments show that this is a promising approach to solve a broad class of decentralized decision problems. The general formulation used by the algorithm makes it both easy to implement and widely applicable to a variety of other AI problems.
Method for Inferring High-Order and Dynamic User-Context
Authors: Nakatani Yuichi
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

We propose an inference system that determines user context. In particular, we focus on high-order and dynamic information such as user’s mood and actions, which cannot be measured via any single sensor, and whose inference logics are individual for each user. Therefore, we propose an inference system, which enables us to easily aggregate all sensing information based on a Bayesian belief network and helps general users make their own networks by reducing the technicality of a method for constructing the networks.
Research on Unstructured Road Detection Algorithm Based on the Machine Vision
Authors: Wei Wu, Gong ShuFeng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper presents an unstructured road detection algorithm which can improve the detecting speed and accuracy of unstructured road detection. In this algorithm, first, we process the original images with the median value filter, and suppress the stochastic noise; Then an Otsu multi-threshold algorithm based on two-peak method for rapid image segmentation is used, which cause the division effect and the division time to be optimum; Finally the primary edge detection with the Canny operator and mathematics morphology are used, which can obtain the complete and clear path edge image, eventually enhance the accuracy of the path examination obviously. The simulation results show that the unstructured path examination method has the good characteristics of detecting speed and accuracy.
Skin Detection Using Contourlet-Based Texture Analysis
Authors: Mehran Fotouhi, Mohammad H. Rohban, Shohreh Kasaei
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

Detection of skin pixels in arbitrary images is addressed in this paper. We have combined texture and color information to segment skin regions. First, a pixel-based boosted skin detection method is used to locate skin pixels. To further improve the detect performance, skin region texture features are employed using the nonsubsampled contourlet coefficients.For the candidate skin pixels, the set of 8x8 patches around that pixel in all subimages are selected and the feature vector of each patch is extracted. Multilayer perceptron is then utilized to learn features and classify any given input sample. The proposed algorithm has achieved true positive rate of about 82.8% and false positive rate of about 7.6% on the test set that contains 300 images. Experimental results show the effectiveness of the proposed method when compared to the other state-of-the-art texture-based skin segmentation approaches.
Modeling and synthesis of the interdigital-stub composite right-left-handed artificial transmission line
Authors: R. Siragusa, H. V. Nguyen, P. Lemaître-Auger, S. Tedjini, C. Caloz
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

An efficient design procedure, including both analysis and synthesis, is proposed for Composite Right-Left Handed (CRLH) interdigital-stub structures. Improved models are developed for both the interdigital capacitor and the shorted stub inductor including its ground via hole. Subsequent optimal formulas are recommended to model these components with their parasitic effects. The models and formulas are verified by both full-wave and experimental results. A CAD program with a friendly GUI, available online, is provided and its operation is described in details. This program allows a very fast design of the CRLH structure, and its synthesis parameters are proven very accurate without any full-wave optimization. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
Introduction to Instruction-Set Customization
Authors: Carlo Galuzzi
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Over the last years, we have witnessed the increased use of customizable processors. These processors can be tuned and/or extended to meet specific requirements and to achieve a balance between performance, power, hardware resources and time-to-market. The problems involved are numerous and they tend to have high computational complexity. One of the main approaches is the identification of the most suitable instructions to include in the instruction-set. The customization of a given instruction-set with specialized application-specific instructions has become a common technique used to speed up the execution of applications. As a result, in this session we first present two papers focusing on methods to design custom instructions and then, a paper which gives an overview on contemporary architectures that offer dynamic instruction-set support.