ppxscal/embedding_network huggingface dataset:
A Web-Based Virtual Machine for Developing Computational Societies
Authors: Sergio Saugar, Juan M. Serrano
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

Different theoretical and practical insights into the field of computational organisations and electronic institutions has led to a clear separation of concerns between societal and agent-based features in the implementation of multiagent systems. From a theoretical perspective, this separation of concerns is also at the core of recent proposals towards a societal programming language. Building on the operational model of one of these proposals, this paper addresses the practical issue of implementing a web-based virtual machine for that language. The resulting framework is intended to be used in a wide range of applications, all of them related to the implementation of social processes (business processes, social networks, etc.).
The Research and Geometric Analysis of Indoor Positioning Using Multiple Pseudolites Signals
Authors: Hui-hui Wang, Chuan-run Zhai, Xing-qun Zhan, Di-er Song
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Either as a significant augmentation of GPS system, or as an independent system for indoor positioning, pseudolites augmenting GPS technique has become an exciting technology whose potential can be explored for a wide range of positioning and navigation application. Indoor positioning using multiple pseudolites signals, however, comes up against a number of obstacles, and there are some challenging issues in research and geometry design. In this paper, by dealing with some major problems, such as dead reckoning using epoch pseudolite double difference, multipath effect and pseudolite location errors. Furthermore, by simulation and analyzing PDOP results, we figure out an optimal geometric design for indoor positioning.
Automated Identity Theft
Authors: Bill McCarty
Venue: IEEE Security and Privacy (2003)

Honeynet intruders often use Internet Relay Chat (IRC) to communicate with their peers. When they do, honeynet operators can observe social interactions among black hats, which may disclose their attack and intrusion tactics, describe their motives, or otherwise shed light on their underground activities. In one recent case, honeynet intruders exposed the existence of automated tools that support and facilitate identity theft and credit-card fraud. Members of a community who call themselves carders use these tools to defraud Internet merchants and consumers of potentially large financial sums.
Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model
Authors: Xiangjun Dong, Zhendong Niu, Donghua Zhu, Zhiyun Zheng, Qiuting Jia
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

MLMS (Multiple Level Minimum Supports) model which uses multiple level minimum supports to discover infrequent itemsets and frequent itemsets simultaneously is proposed in our previous work. The reason to discover infrequent itemsets is that there are many valued negative association rules in them. However, some of the itemsets discovered by the MLMS model are not interesting and ought to be pruned. In one of Xindong Wu's papers [1], a pruning strategy (we call it Wu's pruning strategy here) is used to prune uninteresting itemsets. But the pruning strategy is only applied to single minimum support. In this paper, we modify the Wu's pruning strategy to adapt to the MLMS model to prune uninteresting itemsets and we call the MLMS model with the modified Wu's pruning strategy IMLMS (Interesting MLMS) model. Based on the IMLMS model, we design an algorithm to discover simultaneously both interesting frequent itemsets and interesting infrequent itemsets. The experimental results show the validity of the model.
λ'-optimal digraphs
Authors: Shiying Wang, Shangwei Lin
Venue: Information Processing Letters (2008)

Restricted arc-connectivity is a more refined network reliability index than arc-connectivity. In this paper, we first introduce the concept of minimum arc-degree and show for many digraphs, the minimum arc-degree is an upper bound on the restricted arc-connectivity. Next we call a strongly connected digraph a @l^'-optimal digraph if its restricted arc-connectivity is equal to its minimum arc-degree. Finally, we give some sufficient conditions for a digraph to be @l^'-optimal.
On a Possible Privacy Flaw in Direct Anonymous Attestation (DAA)
Authors: Adrian Leung, Liqun Chen, Chris J. Mitchell
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

A possible privacy flaw in the TCG implementation of the Direct Anonymous Attestation (DAA) protocol has recently been discovered by Rudolph. This flaw allows a DAA Issuer to covertly include identifying information within DAA Certificates, enabling a colluding DAA Issuer and one or more verifiers to link and uniquely identify users, compromising user privacy and thereby invalidating the key feature provided by DAA . In this paper we argue that, in typical usage scenarios, the weakness identified by Rudolph is not likely to lead to a feasible attack; specifically we argue that the attack is only likely to be feasible if honest DAA signers and verifiers never check the behaviour of issuers. We also suggest possible ways of avoiding the threat posed by Rudolph's observation.
Combining Wikipedia and Newswire Texts for Question Answering in Spanish
Authors: César Pablo-Sánchez, José L. Martínez-Fernández, Ana González-Ledesma, Doaa Samy, Paloma Martínez, Antonio Moreno-Sandoval, Harith Al-Jumaily
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper describes the adaptations of the MIRACLE group QA system in order to participate in the Spanish monolingual question answering task at QA@CLEF 2007. A system, initially developed for the EFE collection, was reused for Wikipedia. Answers from both collections were combined using temporal information extracted from questions and collections. Reusing the EFE subsystem has proven not feasible, and questions with answers only in Wikipedia have obtained low accuracy. Besides, a co-reference module based on heuristics was introduced for processing topic-related questions. This module achieves good coverage in different situations but it is hindered by the moderate accuracy of the base system and the chaining of incorrect answers.
Mobile ATM for developing countries
Authors: Amila Karunanayake, Kasun De Zoysa, Sead Muftic
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

Society benefits from M-Commerce applications to a greater extent. The most attractive benefit of M-Commerce applications is the mobility. Even though users have a poor computer literacy, they will be able to use the M-Commerce applications easily. Additionally, the M-Commerce applications have the potential of reducing the distance barriers. In developing countries, especially in rural areas, accessing financial and banking services is a critical issue. This paper proposes a system called Mobile-ATM to address this problem by incorporating the mobile technology. Also it discusses the limitations of traditional ATM systems, the need of a new M-Commerce application to overcome the limitations and security related issues. In the proposed solution, people can withdraw money from a Mobile-ATM without going to a traditional ATM. The Mobile-ATM system uses even cheap mobile phones, functioning as payment terminals. It will reduce the limitations of traditional ATM and enables confidential and secured ATM transactions.
A real-time streaming games-on-demand system
Authors: Theofilos Karachristos, Dimitrios Apostolatos, Dimitrios Metafas
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The present paper introduces a new notion of a Games-on-Demand service. Each game is executed on a game server situated in the vendor's premises and the game's visual output is streamed to the subscriber's client in real time via any broadband network, preferably a DSLAM. Correspondingly, the subscriber's response is streamed back to the game server and fed into the game's process, in order to produce the game's new state. Since no gaming data are installed or saved on the subscriber's client, there is no need for the subscriber to acquire and frequently upgrade a powerful machine. Also, the subscribers have the freedom to use the operating system of their choice, regardless of the game they want to play. Moreover, the service can be provided even to users with little or zero basic computer knowledge.
Exact Max 2-Sat: Easier and Faster
Authors: Martin Fürer, Shiva Prasad Kasiviswanathan
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, counting) weighted Max 2-Sat instances. One of them has a good performance if the underlying constraint graph has a small separator decomposition, another has a slightly improved worst case performance. For a 2-Sat instance F with n variables, the worst case running time is $\tilde{O}(2^{(1-1/(\tilde{d}(F)-1))n})$, where $\tilde{d}(F)$ is the average degree in the constraint graph defined by F.We use strict ¿-gadgets introduced by Trevisan, Sorkin, Sudan, and Williamson to get the same upper bounds for problems like Max 3-Sat and Max Cut. We also introduce a notion of strict (¿,β)-gadget to provide a framework that allows composition of gadgets. This framework allows us to obtain the same upper bounds for Max k -Sat and Max k -Lin-2.
Ontology Supported Selection of Versions for N-Version Programming in Semantic Web Services
Authors: Paweł L. Kaczmarek
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Web Services environment provides capabilities for effective N-version programming as there exist different versions of software that provide the same functionality. N-version programming, however, faces the significant problem of co-relation of failures in different software versions. This paper presents a solution that attempts to reduce the risk of co-relation of failures by selecting for invocation services having relatively different non-functional features. We use an ontology-driven approach to identify and store information about software features related to differences in software versions, such as: software vendor, design technology or implementation language. We present an algorithm for selection of software versions using the designed ontology. The solution was verified in a prototypical implementation with the use of an existing OWL-S API library.
Dynamic Axial Curve ---Pair Based Deformation
Authors: M. L. Chan, K. C. Hui
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Deformation of 3D objects plays an important role in computer graphics, simulation and computer-aided design. Using a deformation tool, a simple geometric model can be deformed to take useful and intuitive shapes. The axial deformation technique allows a 3D object to be deformed by adjusting the shape of an axial curve. However, due to lack of control on the local coordinate frame, unexpected twist may result. The axial curve-pair based deformation technique provides a scheme for controlling the local coordinate frame intuitively. Nevertheless, achieving a physically viable deformation relies very much on the experience and skill of the user in manipulating the shape of the curve-pair. The dynamic axial curve-pair based deformation technique enhances the system by incorporating a special mass-spring model for the 1-dimensional curve-pair structure. Movement of the point masses of the mass spring system deforms the embedded curve-pair, which in turn deforms the associated geometric shape. The proposed technique is particularly useful for the design and animation of soft objects such as animals and characters.
A Hardware Syntactic Analysis Processor
Authors: Mohammad Sanamrad, Koichi Wada, Haruya Matsumoto
Venue: IEEE Micro (1987)

An innovative algorithm for syntactic analysis could be the first step toward placing grammar on a chip.
Discovering acyclic dependency relationships by evolutionary computation
Authors: Kwong-Sak Leung
Venue:  (2007)

Data mining algorithms discover knowledge from data. The knowledge are commonly expressed as dependency relationships in various forms, like rules, decision trees and Bayesian Networks (BNs). Moreover, many real-world problems are multi-class problems, in which more than one of the variables in the data set are considered as classes. However, most of the rule learners available were proposed for single-class problems only and would produce cyclic rules if they are applied to multi-class ones. In addition, most of them produce rules with conflicts, i.e. more than one of the rules classify the same data items and different rules have different predictions. Similarly, existing decision trees learners cannot handle multi-class problems, and thus cannot detect and avoid cycles. In contrast, BNs represent acyclic dependency relationships among variables, but they can handle discrete values only. They cannot manage continuous, interval and ordinal values and cannot represent higher-order relationships. Consequently, BNs have higher network complexity and lower understandability when they are used for such problems. This thesis has studied in depth discovering dependency relationships in various forms by Evolutionary Computation (EC). Through analysis of the reasons leading to the disadvantages of rules, decision trees and BNs, and their learners, we have proposed a sequence of EAs, a novel functional dependency network (FDN) and two techniques for dependency relationship learning and for multi-class problems. They are the multi-population Genetic Programming (GP) using backward chaining procedure and the GP employing co-operating scoring stage for acyclic rules learning. The dependency network with functions can manage all kinds of values and represent any kind of relationships among variables, the flexible and robust MDLGP to learn the novel dependency network and BN. Based on the FDN we have further developed the techniques to learn rules without conflict and acyclic decision trees for multi-class problems respectively. The new self-organizing map (SOM) with expanding force for clustering and data visualization for data preprocessing have also been given in the appendix.
Practical Prosody
Authors: Elizabeth Shriberg
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Prosody is clearly valuable for human understanding, but can be difficult to model in spoken language technology. This talk describes a "direct modeling" approach, which does not require any hand-labeling of prosodic events. Instead, prosodic features are extracted directly from the speech signal, based on time alignments from automatic speech recognition. Machine learning techniques then determine a prosodic model, and the model is integrated with lexical and other information to predict the target classes of interest. The talk presents a general method for prosodic feature extraction and design (including a special-purpose tool developed at SRI), and illustrates how it can be successfully applied in three different types of tasks: (1) detection of sentence or dialog act boundaries; (2) classification of emotion and affect, and (3) speaker classification.
Exponential Type Adaptive Inertia Weighted Particle Swarm Optimization Algorithm
Authors: JianXin Wu, WenZhi Liu, WeiGuo Zhao, Qiang Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Adaptive inertia weight is proposed to rationally balance the global exploration and local exploitation abilities for particle swarm optimization. This paper describes an adaptive strategy for tuning the inertia weight parameter of the PSO algorithm - Exponential type adaptive inertia weighted Particle Swarm Optimization (EPSO). This adaptive tuning strategy is based on the inertia weight dynamic decreased according to iterative generation increasing. The stochastic convergence of the EPSO has been analyzed with the probability density functions of objective function. EPSO algorithm is tested with a set of 5 benchmark functions and compared with standard PSO. Experimental results indicate that the EPSO algorithm improves the search performance on the benchmark functions significantly.
Intelligent risk prophecy using more quality attributes injected ATAM and design patterns
Authors: N. Sankar Ram, Paul Rodrigues
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Architectural Tradeoff Analysis Method is a method for evaluation of architecture-level designs and identifies trade-off points between attributes, facilitates communication between stakeholders. ATAM has got the limitations like not a predictor of quality achievement., not deals more quality attributes, Efficiency always depends on the expertise and potential of stakeholders. In this paper we have proposed a system which uses ATAM to predict the risk analysis, with more possible quality attributes. We have used artificial intelligence to predict the risk of the SA based on the Knowledge base of the Stakeholder Experts.
Stroke Suite: Cad Systems for Acute Ischemic Stroke, Hemorrhagic Stroke, and Stroke in ER
Authors: Wieslaw L. Nowinski, Guoyu Qian, K. N. Prakash, Ihar Volkau, Wing Keet Leong, Su Huang, Anand Ananthasubramaniam, Jimin Liu, Ting Ting Ng, Varsha Gupta
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

We present a suite of computer aided-diagnosis (CAD) systems for acute ischemic stroke, hemorrhagic stroke, and stroke in emergency room. A software architecture common for them is described. The acute ischemic stroke CAD system supports thrombolysis. Our approach shifts the paradigm from a 2D visual inspection of individual scans/maps to atlas-assisted quantification and simultaneous visualization of multiple 2D/3D images. The hemorrhagic stroke CAD system supports the evacuation of hemorrhage by thrombolytic treatment. It aims at progression and quantification of blood clot removal. The clot is automatically segmented from CT time series, its volume measured, and displayed in 3D along with a catheter. A stroke CAD in emergency room enables rapid atlas-assisted decision support regarding the stroke and its location. Our stroke CAD systems facilitate and speed up image analysis, increase confidence of interpreters, and support decision making. They are potentially useful in diagnosis and research, particularly, for clinical trials.
Extending agent languages for autonomy
Authors: Felipe Rech Meneguzzi
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

BDI agent languages provide a useful abstraction for complex systems comprised of interactive autonomous entities, but they have been used mostly in the context of single agents with a static plan library of behaviours invoked reactively. These languages provide a theoretically sound basis for agent design but are very limited in providing direct support for autonomy and societal cooperation needed for large scale systems. Some techniques for autonomy and cooperation have been explored in the past in ad hoc implementations, but not incorporated in any agent language. In order to address these shortcomings we extend the well known AgentSpeak(L) BDI agent language to include behaviour generation through planning, declarative goals and motivated goal adoption. We also develop a language-specific multiagent cooperation scheme and, to address potential problems arising from autonomy in a multiagent system, we extend our agents with a mechanism for norm processing leveraging existing theoretical work. These extensions allow for greater autonomy in the resulting systems, enabling them to synthesise new behaviours at runtime and to cooperate in non-scripted patterns.
An Integrated Clinico-Proteomics Information Management and Analysis Platform
Authors: Manos Kalaitzakis, Vangelis Kritsotakis, Haridimos Kondylakis, George Potamias, Manolis Tsiknakis, Dimitris Kafetzopoulos
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Detecting proteins in human blood holds the promise of a revolution in cancer diagnosis. Also, the ability to perform laboratory operations on small scales using miniaturized (lab-on-a-chip) devices has many benefits. Designing and fabricating such systems is extremely challenging, but physicists and engineers are beginning to construct such highly integrated and compact labs on chips with exciting functionality. This paper focuses on the presentation of the information technology layer in such an integrated platform that has been developed in the LOCCANDIA project. LOCCANDIA ultimate objective is to develop an innovative nano-technology based (lab-on-a-chip) platform for the medical-proteomics field. The paper presents the main engineering aspects and the architecture of the Integrated Clinico-Proteomic Environment.
Analyzing the efficacy of using digital ink devices in a learning environment
Authors: Akila Varadarajan, Nilesh Patel, Bruce Maxim, William I. Grosky
Venue: Multimedia Tools and Applications (2008)

There has been increased interest on the impact of mobile devices such as PDAs and Tablet PCs in introducing new pedagogical approaches and active learning experiences. We propose an intelligent system that efficiently addresses the inherent subjectivity in student perception of note taking and information retrieval. We employ the idea of cross indexing the digital ink notes with matching electronic documents in the repository. Latent Semantic Indexing is used to perform document and page level indexing. Thus for each retrieved document, the user can go over to the relevant pages that match the query. Techniques to handle problems such as polysemy (multiple meanings of a word) in large databases, document folding and no match for query are discussed. We tested our system for its performance, usability and effectiveness in the learning process. The results from the exploratory studies reveal that the proposed system provides a highly enhanced student learning experience, thereby facilitating high test scores.