ppxscal/embedding_network huggingface dataset:
A Discussion on Personalized Trust Management for Flat P2P Communities
Authors: Min Zuo, Jian-hua Li, Gong-shen Liu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Flat P2P communities have no authorities or supervisors to act as the root of trust, therefore trust is difficult to establish between stranger peers. A personalized P2P trust management framework is proposed in this paper, to help good peers build up trust between each other and avoid malicious peers. This framework differs from others in that it totally abandons the attempt to achieve a global view, but instead, evaluates trust from a subjective point of view and gives personalized decision support to each peer. With DHT-based backward query and collaborative-filtering-based evaluating, this new idea achieves three main advantages: free of central control, strong immunity to misleading recommend-dations, and limited traffic overload. We examine the performance of the proposed scheme and prove its effectiveness by a series of simulation experiments under different environmental configurations.
The Synchronization Power of Coalesced Memory Accesses
Authors: Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Multicore processor architectures have established themselves as the new generation of processor architectures. As part of the one core to many cores evolution, memory access mechanisms have advanced rapidly. Several new memory access mechanisms have been implemented in many modern commodity multicore processors. Memory access mechanisms, by devising how processing cores access the shared memory, directly influence the synchronization capabilities of the multicore processors. Therefore, it is crucial to investigate the synchronization power of these new memory access mechanisms.This paper investigates the synchronization power of coalesced memory accesses, a family of memory access mechanisms introduced in recent large multicore architectures like the CUDA graphics processors. We first design three memory access models to capture the fundamental features of the new memory access mechanisms. Subsequently, we prove the exact synchronization power of these models in terms of their consensus numbers. These tight results show that the coalesced memory access mechanisms can facilitate strong synchronization between the threads of multicore processors, without the need of synchronization primitives other than reads and writes. In the case of the contemporary CUDA processors, our results imply that the coalesced memory access mechanisms have consensus numbers up to sixteen.
Alps: software framework for scheduling parallel computations with application to parallel space-time adaptive processing (stap)
Authors: Adam W. Bojanczyk
Venue:  (2008)

The goal of this project is to automatically generate executable files for optimal parallel implementation of large computational tasks defined by their high-level algorithmic description. This goal is realized by a set of software tools called ALPS software framework. We present this framework in the context of a large signal processing application known as STAP. Space-Time Adaptive Processing (STAP) refers to adaptive, radar processing algorithms to cancel interferences and detect a target. Considering the required number of operations and the real-time requirements of radar processing algorithms, parallel processing is required. However, good schedules for parallel implementation of such algorithms are hard to find manually. Different memory layouts, or different distribution among processors of data might lead to different performances. This makes mapping and scheduling STAP algorithms on parallel computers even more challenging. ALPS framework is designed to address this difficulty. ALPS software framework helps users to generate the executable files for parallel programs which are derived from the algorithmic description of the application. In ALPS software framework, ALPS library provides basic building blocks which are used to construct higher-level description of the target application. Users describe their algorithms as a task graph by interconnecting these basic building blocks. The framework maps and schedules the task graph onto parallel computers using execution time models associated with the building blocks. We show that the execution time of complex parallel algorithms can be accurately estimated and optimized based on the execution time models of basic building blocks. In particular, we show that the estimated execution time for STAP algorithms is close to the measured execution time. Our scheduling algorithm extends dynamic programming approach to tree-shaped task graphs. Schedules found by our scheduling algorithm are as good as or oh ell better than schedules found by other existing scheduling algorithms.
Status-Based Access Control
Authors: Steve Barker, Marek J. Sergot, Duminda Wijesekera
Venue: ACM Transactions on Information and System Security (TISSEC) (2008)

Despite their widespread adoption, Role-based Access Control (RBAC) models exhibit certain shortcomings that make them less than ideal for deployment in, for example, distributed access control. In the distributed case, standard RBAC assumptions (e.g., of relatively static access policies, managed by human users, with complete information available about users and job functions) do not necessarily apply. Moreover, RBAC is restricted in the sense that it is based on one type of ascribed status, an assignment of a user to a role. In this article, we introduce the status-based access control (SBAC) model for distributed access control. The SBAC model (or family of models) is based on the notion of users having an action status as well as an ascribed status. A user's action status is established, in part, from a history of events that relate to the user; this history enables changing access policy requirements to be naturally accommodated. The approach can be implemented as an autonomous agent that reasons about the events, actions, and a history (of events and actions), which relates to a requester for access to resources, in order to decide whether the requester is permitted the access sought. We define a number of algebras for composing SBAC policies, algebras that exploit the language that we introduce for SBAC policy representation: identification-based logic programs. The SBAC model is richer than RBAC models and the policies that can be represented in our approach are more expressive than the policies admitted by a number of monotonic languages that have been hitherto described for representing distributed access control requirements. Our algebras generalize existing algebras that have been defined for access policy composition. We also describe an approach for the efficient implementation of SBAC policies.
Discovery of Network Properties with All-Shortest-Paths Queries
Authors: Davide Bilò, Thomas Erlebach, Matúš Mihalák, Peter Widmayer
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

We consider the problem of discovering properties (such as the diameter) of an unknown network G(V,E) with a minimum number of queries. Initially, only the vertex set V of the network is known. Information about the edges and non-edges of the network can be obtained by querying nodes of the network. A query at a node q ¿ V returns the union of all shortest paths from q to all other nodes in V. We study the problem as an online problem --- an algorithm does not initially know the edge set of the network, and has to decide where to make the next query based on the information that was gathered by previous queries. We study how many queries are needed to discover the diameter, a minimal dominating set, a maximal independent set, the minimum degree, and the maximum degree of the network. We also study the problem of deciding with a minimum number of queries whether the network is 2-edge or 2-vertex connected. We use the usual competitive analysis to evaluate the quality of online algorithms, i.e., we compare online algorithms with optimum offline algorithms. For all properties except maximal independent set and 2-vertex connectivity we present and analyze online algorithms. Furthermore we show, for all the aforementioned properties, that "many" queries are needed in the worst case. As our query model delivers more information about the network than the measurement heuristics that are currently used in practise, these negative results suggest that a similar behavior can be expected in realistic settings, or in more realistic models derived from the all-shortest-paths query model.
An E-Learning System Engineering Ontology Model on the Semantic Web for Integration and Communication
Authors: Wenan Tan, Fujun Yang, Anqiong Tang, Suxian Lin, Xue Zhang
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

This paper investigates ontology-based approaches for representing information semantics and in E-learning system. A general E-learning system engineering (ESE) knowledge representation scheme, called an ESE ontology model, to facilitate communication and information exchange in heterogeneous E-learning systems. The proposed approach focuses on how to support the integration of heterogeneous E-learning systems, and how to complete information autonomy allowing the individual learners to keep their own information models rather than requiring them all to adopt standardized terminology. Meanwhile, a communication model Based on SOAP and ontology, is designed for heterogeneous information systems interoperable communications. A prototype interface has been developed to validate the communication model.
Fuzzy Linguistic Logic Programming
Authors: Van Hung Le, Fei Liu, Dinh Khang Tran
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper presents fuzzy linguistic logic programming which is developed based on fuzzy logic programming introduced by P. Vojtáš in order to facilitate the representation and reasoning on knowledge expressed in natural language. In fuzzy linguistic logic programming, truth values are linguistic terms such as true, very true, more or less true, and false taken from a hedge algebra of the truth variable, and linguistic hedges, e.g., very, more or less, quite, and rather, which are frequently used in natural language, can be used as unary connectives in formulae. In order to compute the truth value of a query, we provide a computational model which directly manipulates linguistic terms. The soundness of the computational model is proved. A fixpoint semantics of logic programs and the completeness of the computational model are discussed.
Cluster analysis and association analysis for the same data
Authors: Huaiguo Fu
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Both cluster analysis and association analysis are important tasks of data mining. In some applications, we need both cluster analysis and association analysis for the same data. Each task takes very high time cost to deal with large data. In order to reduce expensive cost of the two mining tasks for large data set of transactions, we propose one strategy to unify cluster analysis and association analysis. This paper presents a new core algorithm of the strategy for analysis of large and high-dimensional data as well. The experimental results show the efficiency of this algorithm.
The Romanian universities in the process of data and information system integration
Authors: Ana Ramona Lupu, Razvan Bologa, Gheorghe Sabau, Mihaela Muntean
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Our team has achieved a study about the current state of the integration of information systems and data within romanian universities. At this moment, the Romanian universities are using a pretty high number of various information systems, none of them covering all the specific business flows or ensuring the integration of all the functional areas in a university. This paper offers a view of the present situation in the Romanian academic environment and identifies the main factors that determined it.
Integrating Ajax into GIS Web Services for Performance Enhancement
Authors: Seung-Jun Cha, Yun-Young Hwang, Yoon-Seop Chang, Kyung-Ok Kim, Kyu-Chul Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In the GIS(Geospatial Information System) Web Services, SOAP/MTOM shows best performance when transferring large size of data between services. SOAP/MTOM uses XOP for message optimizing method, so data serialization and deserialization time is reduced. Additionally, integrating Ajax(Asynchronous JavaScript and XML) approach into GIS visualization Web Services have performance enhancement, because it provides more interactive user experience. Ajax, one of the technologies of "Web 2.0", is appeared after Dot Com bubble is occurred. The intent is to make web pages feel more responsive by exchanging small amounts of data with the server behind the scenes, so that the entire web page does not have to be reloaded each time the user requests a change.
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
Authors: Adam Kasperski, Paweł Zieliński
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this paper a general approach to combinatorial optimization problems with fuzzy weights is discussed. The results, valid for the interval-valued problems, are extended to the fuzzy-valued ones by exploiting the very recent notion of a gradual number. Some methods for determining the exact degrees of possible and necessary optimality and the possibility distributions of deviations of solutions and elements are proposed. The introduced notions are illustrated by practical examples.
Dimuse: an integrated framework for distributed multimedia system with database management and security support
Authors: Shu-Ching Chen
Venue:  (2007)

With the recent explosion in the complexity and amount of digital multimedia data, there has been a huge impact on the operations of various organizations in distinct areas, such as government services, education, medical care, business, entertainment, etc. To satisfy the growing demand of multimedia data management systems, an integrated framework called DIMUSE is proposed and deployed for distributed multimedia applications to offer a full scope of multimedia related tools and provide appealing experiences for the users.This research mainly focuses on video database modeling and retrieval by addressing a set of core challenges. First, a comprehensive multimedia database modeling mechanism called Hierarchical Markov Model Mediator (HMMM) is proposed to model high dimensional media data including video objects, low-level visual/audio features, as well as historical access patterns and frequencies. The associated retrieval and ranking algorithms are designed to support not only the general queries, but also the complicated temporal event pattern queries. Second, system training and learning methodologies are incorporated such that user interests are mined efficiently to improve the retrieval performance. Third, video clustering techniques are proposed to continuously increase the searching speed and accuracy by architecting a more efficient multimedia database structure. A distributed video management and retrieval system is designed and implemented to demonstrate the overall performance. The proposed approach is further customized for a mobile-based video retrieval system to solve the perception subjectivity issue by considering individual user's profile. Moreover, to deal with security and privacy issues and concerns in distributed multimedia applications, DIMUSE also incorporates a practical framework called SMARXO, which supports multilevel multimedia security control. SMARXO efficiently combines role-based access control (RBAC), XML and object-relational database management system (ORDBMS) to achieve the target of proficient security control. A distributed multimedia management system named DMMManager (Distributed MultiMedia Manager) is developed with the proposed framework DEMUR; to support multimedia capturing, analysis, retrieval, authoring and presentation in one single framework.
Multi-objective Genetic Programming for Multiple Instance Learning
Authors: Amelia Zafra, Sebastián Ventura
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

This paper introduces the use of multi-objective evolutionary algorithms in multiple instance learning. In order to achieve this purpose, a multi-objective grammar-guided genetic programming algorithm (MOG3P-MI) has been designed. This algorithm has been evaluated and compared to other existing multiple instance learning algorithms. Research on the performance of our algorithm is carried out on two well-known drug activity prediction problems, Musk and Mutagenesis, both problems being considered typical benchmarks in multiple instance problems. Computational experiments indicate that the application of the MOG3P-MI algorithm improves accuracy and decreases computational cost with respect to other techniques.
Comparison between road test, loudspeaker and headphones evaluations of the sound quality of automobiles
Authors: Malcolm J. Crocker, Cédric Béchet, Ran Zhou, He Lingsong
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

This paper describes sound quality evaluations of five different automobiles. The primary purpose of the study was to compare sound quality evaluations made of interior vehicle noise during road tests with recordings of the noise of the vehicles played back to a jury of subjects using different playback methods. The experiment consisted of recording the sound fields inside the five cars with dual channel microphones situated in a dummy head. The study involved using a jury comprised of a large number of student subjects who first evaluated the sound quality of the five vehicles during the road tests, as well as later evaluating recordings of the same five vehicles played back through loudspeakers and headphones. It was found that there is a high correlation between the three different methods of evaluation used for the same vehicle. This study demonstrates that it is possible to evaluate the sound quality of a car in the laboratory with some confidence using the playback methods described in this paper. It also shows that laboratory evaluations, which are less expensive to conduct than road test evaluations, are good enough for manufacturers to determine the sound quality of a vehicle and to decide on the important sound quality factors needing improvement.
Computer Vision Approaches to Pedestrian Detection: Visible Spectrum Survey
Authors: David Gerónimo, Antonio López, Angel D. Sappa
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Pedestrian detection from images of the visible spectrum is a high relevant area of research given its potential impact in the design of pedestrian protection systems. There are many proposals in the literature but they lack a comparative viewpoint. According to this, in this paper we first propose a common framework where we fit the different approaches, and second we use this framework to provide a comparative point of view of the details of such different approaches, pointing out also the main challenges to be solved in the future. In summary, we expect this survey to be useful for both novel and experienced researchers in the field. In the first case, as a clarifying snapshot of the state of the art; in the second, as a way to unveil trends and to take conclusions from the comparative study.
ICT-Supported Dispute Resolution
Authors: Claudia Cevenini, Gianluigi Fioriglio
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

This paper aims at describing how the use of Information and Communication Technologies can positively contribute to the resolution of disputes. Once a conflict arises, the parties have on the one side the possibility to resort to Courts (judicial dispute resolution); on the other side, they can agree to submit the issue to an arbitrator or mediator (alternative dispute resolution). While in judicial dispute resolution and partly in arbitration the introduction of ICT necessarily has to comply with the rules of procedural law, mediation allows for a higher freedom and possibly for entirely on-line procedures. Both cases are examined below.
Safe Cross-Language Inheritance
Authors: Kathryn E. Gray
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed language with a dynamically-typed class can require a significant number of manual indirections and other error-prone complications. Building on our previous interoperability work, we introduce a technique that allows safe, easy inheritance across languages. We demonstrate our technique for cross-language inheritance with a statically-typed object calculus and a dynamically-typed object calculus, where a statically-typed class can extend a dynamically-typed one and vice versa. We provide a proof sketch of soundness, as well as a guarantee that dynamic type errors do not arise due to statically-typed expressions.
Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
Authors: Roberto Santana, Pedro Larrañaga, José A. Lozano
Venue: Journal of Heuristics (2008)

The aim of this work is to introduce several proposals for combining two metaheuristics: variable neighborhood search (VNS) and estimation of distribution algorithms (EDAs). Although each of these metaheuristics has been previously hybridized in several ways, this paper constitutes the first attempt to combine both optimization methods. The different ways of combining VNS and EDAs will be classified into three groups. In the first group, we will consider combinations where the philosophy underlying VNS is embedded in EDAs. Considering different neighborhood spaces (points, populations or probability distributions), we will obtain instantiations for the approaches in this group. The second group of algorithms is obtained when probabilistic models (or any other machine learning paradigm) are used in order to exploit the good and bad shakes of the randomly generated solutions in a reduced variable neighborhood search. The last group of algorithms contains the results of alternating VNS and EDAs. An application of the first approach is presented in the protein side chain placement problem. The results obtained show the superiority of the hybrid algorithm in comparison with EDAs and VNS.
An Empirical Investigation on Dynamic Modeling in Requirements Engineering
Authors: Carmine Gravino, Giuseppe Scanniello, Genoveffa Tortora
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Modeling is a fundamental activity within the requirements engineering process concerning the construction of abstract descriptions of system requirements that are amenable to interpretation and validation. In this paper we report on a controlled experiment aimed at assessing whether dynamic modeling of system requirements provides an accurate account of stakeholders' requirements. The context is constituted of second year Bachelor students in Computer Science at the University of Basilicata. The data analysis reveals that there is not significant difference in the comprehension of system requirements achieved by using or not dynamic modeling.