ppxscal/embedding_network huggingface dataset:
System engineering applied to specification and characterisation of data management systems for collaborative engineering
Authors: T. Nguyen Van, B. Maillé, B. Yannou, J. P. Bourey
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Collaborative platforms are presently a growing concept to enable the concurrent development of product in the context of extended enterprise. Product design has seen around 10 years the increase of software solutions for 3D modeling and data management. Major consequence of such development is that amount of data created during a project has increased and the exchanges between partners around the product definition have become more difficult. This need to create a collaborative environment has developed the creation of such platform. This paper proposes to define a guideline for designing such collaborative environment by using system engineering concepts. It is explained the different integration fields that have to be considered on this topic. We finish this study by an application to the design and simulation integration for collaborative purpose.
Similarity caching
Authors: Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

We introduce the similarity caching problem, a variant of classical caching in which an algorithm can return an element from the cache that is similar, but not necessarily identical, to the query element. We are motivated by buffer management questions in approximate nearest-neighbor applications, especially in the context of caching targeted advertisements on the web. Formally, we assume the queries lie in a metric space, with distance function d(.,.). A query p is considered a cache hit if there is a point q in the cache that is sufficiently close to p, i.e., for a threshold radius r, we have d(p,q) ≤ r. The goal is then to minimize the number of cache misses, vis-à-vis the optimal algorithm. As with classical caching, we use the competitive ratio to measure the performance of different algorithms. While similarity caching is a strict generalization of classical caching, we show that unless the algorithm is allowed extra power (either in the size of the cache or the threshold r) over the optimal offline algorithm, the problem is intractable. We then proceed to quantify the hardness as a function of the complexity of the underlying metric space. We show that the problem becomes easier as we proceed from general metric spaces to those of bounded doubling dimension, and to Euclidean metrics. Finally, we investigate several extensions of the problem: dependence of the threshold r on the query and a smoother trade-off between the cache-miss cost and the query-query similarity.
Integration method and Runge-Kutta method
Authors: Wannaporn Sanprasert, Ungsana Chundang, Maitree Podisuk
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In [1], M. Podisuk, U. Chundang and W. Sanprasert introduced the integration method for finding the numerical solution of the initial value problem of ordinary differential equation which turned out to be the multi-step method. In this paper, the single step method of this integration method with the help of Gauss-Legendre Quadrature integration formula and the Taylor series expansion is explored. The results of some examples that include the initial value problem of fourth order of ordinary differential equation are shown. These results are compared to the results that obtain by the Runge-Kutta method.
Managing Networks and Services of the Future
Authors: Edmundo R. Madeira, Bruno Schulze
Venue: Journal of Network and Systems Management (2009)

Today, we see several emerging environments, with a large diversity of devices, networks, providers and service domains, characterized as the networks and services of the future. This special issue contains four papers on how to manage important topics of these environments: policy model to support ontology-driven reasoning for autonomic computing, SOA-based NGM management, metrics to distinguish application traffic, and SLA design and service provisioning for outsourced services.
Use noisy link analysis to improve web search
Authors: Yitong Wang, Jingbo Chu
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Link-based ranking algorithm is very important for current success and popular of Web Search Engine. In order to get high rank, some try to improve contents of web pages while others just put dirty tricks, such as link spam. Link spam is a trick targeting at link-based ranking algorithms by artificially created tight link structures to push some target pages get undeserved high ranks. This problem becomes even worse with the advent of wikis, blogs, forums, which are rich in links. We tackle the problem of improving link-based ranking by more fundamental viewpoint--"noisy link" analysis. Motivated by how "non-voting" hyperlinks affect quality of ranking, we propose an approach and corresponding penalty strategies to both detect and handle "noisy link" effectively and automatically. We also compared our approach with other related works to demonstrate that our approach is rather effective in noisy link filtering and could improve the final search results significantly.
Hard Life with Weak Binders
Authors: Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We introduce weak binders, a lightweight construct to deal with fresh names in nominal calculi. Weak binders do not define the scope of names as precisely as the standard @n-binders, yet they enjoy strong semantic properties. We provide them with a denotational semantics, an equational theory, and a trace inclusion preorder. Furthermore, we present a trace-preserving mapping between weak binders and @n-binders.
Foundation and applications of visual languages
Authors: Kang Zhang
Venue:  (2005)

This dissertation provides a formal foundation, i.e. the spatial graph grammar (SGG), for specifying and interpreting well-formed visual languages. The spatial graph grammar is different from other graph grammar formalisms by introducing spatial notions to the abstract syntax. The direct representation of spatial information in the abstract syntax reduces the gap between the concrete representation of graphical models and the specification of grammatical rules, and thus makes grammatical rules easier to design and understand. By taking advantage of the spatial information, the parser of the SGG performs in polynomial time with an improved parsing complexity over its non-spatial predecessor, i.e. the reserved graph grammar. The expressiveness of the spatial graph grammar is demonstrated by its application to online adaptive layout and model driven development. With the facility for spatial specifications, the SGG is used to analyze Web pages and derive a hierarchical structure about the composition of multimedia objects in a Web page. Based on the extracted structure, the original Web page is partitioned to fit both spatially and semantically for displaying on mobile devices. The SGG also serves as a foundation for a grammatical approach to authoring and presenting adaptive structure-directed layouts, emphasizing on the style adaptation. Based on the spatial graph grammar, this dissertation specifies the behavioral semantics of UML models based on the SGG. In order to interpret state transitions of simple and composite states, a graph grammar automatically produced from a state machine is used to validate, recognize and generate state configurations. The automation mechanism for generating graph grammars and their validation and recognition capability would populate the automated design of model-driven architectures. An integrated behavioral semantics of UML object and state diagrams is given by an event driven graph transformation and grammar system. This dissertation also provides a style-driven framework for specifying software architectures by drawing graphs. The structural integrity of user specified architecture is validated by the SGG parser.
An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks
Authors: Kalyan Kuppuswamy, Daniel C. Lee
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

For all-optical WDM networks that provide multiple classes of service, we present a methodology for computing approximate blocking probabilities of dynamic routing and wavelength assignment policies. Each service class is characterized by its resource requirements (number of wavelengths needed for a call) and expected call holding time (or subscription period). Under the wavelength continuity constraint on lightpaths and loss network formulation, we develop fixed-point approximation algorithms that compute approximate blocking probabilities of all classes. We then apply them to the random wavelength assignment policy for the following wavelength routing policies: Fixed Routing (FR), Least Loaded Routing (LLR) and Fixed Alternate Routing (FAR). Simulation results on different network topologies and routing policies considered demonstrate that the simulation results match closely with the blocking probabilities computed by our methods for different multiclass call traffic loading scenarios.
Optimal Digital Content Distribution Strategy in the Presence of the Consumer-to-Consumer Channel
Authors: Yunfang Feng, Zhiling Guo, Wei-Yu Chiang
Venue: Journal of Management Information Systems (2009)

Although the online business-to-consumer (B2C) channel is the primary selling channel for digital content (e.g., videos, images, and music), modern digital technology has made possible the legal dissemination of such content over the consumer-to-consumer (C2C) channel through personal computing devices, such as PCs, mobile phones, and portable media players. This paper investigates the optimal channel structure and the corresponding pricing and service strategies for digital content distribution in order to understand the business value of introducing the C2C channel alongside the prevailing B2C channel. We identify conditions under which it is more profitable to use both B2C and C2C channels simultaneously (i.e., the dual-channel distribution). In such cases, the seller performs price discrimination among consumers but provides them with a higher level of service. Our analysis further characterizes the benefits of service provision. We show that service provision can increase the dual-channel pricing flexibility, reduce the seller's B2C channel dependence, and allow the seller to tolerate higher C2C channel redistribution costs. Finally, in examining the effect of a competitively determined B2C channel price on optimal channel strategy, we find that the seller prefers a dual-channel distribution under higher B2C channel prices.
Efficient learning algorithms for changing environments
Authors: Elad Hazan, C. Seshadhri
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in hindsight. Hence, regret minimizing algorithms tend to converge to the static best optimum, clearly a suboptimal behavior in changing environments. On the other hand, various metrics proposed to strengthen regret and allow for more dynamic algorithms produce inefficient algorithms. We propose a different performance metric which strengthens the standard metric of regret and measures performance with respect to a changing comparator. We then describe a series of data-streaming-based reductions which transform algorithms for minimizing (standard) regret into adaptive algorithms albeit incurring only poly-logarithmic computational overhead. Using this reduction, we obtain efficient low adaptive-regret algorithms for the problem of online convex optimization. This can be applied to various learning scenarios, i.e. online portfolio selection, for which we describe experimental results showing the advantage of adaptivity.
Solutions of strategic games under common belief of sure-thing principle
Authors: Michael Trost
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

In this paper we address the issue which solution concept for strategic games is consistent to common belief that each player satisfies the sure-thing principle. Traditional epistemic analysis takes for granted that there is common belief that each player acts according to some expected utility function. Because our presumptions are milder than the traditional ones we are forced to modify the traditional epistemic approach and follow the idea of Morris (1996) to fasten the beliefs of the players to their preferences. One central finding of our paper is that common belief of sure-thing principle plus state-independence characterizes the solution concept proposed by B&ouml;rgers (1993).
Dynamic COQUALMO: Defect Profiling over Development Cycles
Authors: Dan Houston, Douglas Buettner, Myron Hecht
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

Various techniques have been used for managing software quality, including those that predict defect counts over time. This paper introduces a simulation model based on COQUALMO, which can be calibrated to organizational process performance for estimating counts of residual defects. This simulator has the additional benefit of producing a set of estimated defectivity profiles over a software development cycle. Such a set of profiles can be used to support quality management decisions regarding the amount and level of defect removal activities to be applied during a development cycle.
The use of multimodality metaphors in e-learning
Authors: Dimitrios Rigas, Mohamed Sallam
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

This paper describes an initial experiment that investigates the use of multimodal metaphors (text, graphic and speech) in e-learning application. The aim of this experiment is to compare the efficiency of these metaphors regard to task accomplishment time and the number of errors that occurred during the experiment. In order to carry out this comparative investigation, two experimental interfaces were built. The experiment was divided into two independent groups, each group consisted 22 participants. The first interface, a combination of multimodal metaphors (text, graphic and speech) was used and tested by the experimental group of users and the second interface used text only metaphors and evaluated by the control group of users. Participants were randomly assigned to one of the two groups and each of the participants individually had to accomplish a number of tasks. The experiment time was recorded for each task and for the overall experiment too. The number of questions and errors was recorded for all tasks. The results obtained from the experiment showed that the experimental interfaces were more usable in comparison with the textual interface.
Leveraging discarded samples for tighter estimation of multiple-set aggregates
Authors: Edith Cohen, Haim Kaplan
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

Many datasets, including market basket data, text or hypertext documents, and events recorded in different locations or time periods, can be modeled as a collection of sets over a ground set of keys. Common queries over such data, including similarity or association rules are represented as the weight or selectivity of keys that satisfy some selection predicate defined over keys' attributes and memberships in particular sets. On massive data sets, exact computation of such aggregates can be inefficient or infeasible, and therefore, approximate queries are processed over sketches of the sets. Sketches based on coordinated random samples are scalable and flexible and well suited for many applications. Queries are resolved by producing a sketch of the union of sets used in the predicate from the sketches of these sets and then applying an estimator to this union-sketch. We derive novel tighter (unbiased) estimators that leverage sampled keys that are present in the union of applicable sketches but excluded from the union sketch. We establish analytically that our estimators dominate estimators applied to the union-sketch for all queries and data sets. Empirical evaluation on synthetic and real data reveals that on typical applications we can expect a 25% 4 fold reduction in estimation error.
What do exploratory searchers look at in a faceted search interface?
Authors: Bill Kules, Robert Capra, Matthew Banta, Tito Sierra
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This study examined how searchers interacted with a web-based, faceted library catalog when conducting exploratory searches. It applied eye tracking, stimulated recall interviews, and direct observation to investigate important aspects of gaze behavior in a faceted search interface: what components of the interface searchers looked at, for how long, and in what order. It yielded empirical data that will be useful for both practitioners (e.g., for improving search interface designs), and researchers (e.g., to inform models of search behavior). Results of the study show that participants spent about 50 seconds per task looking at (fixating on) the results, about 25 seconds looking at the facets, and only about 6 seconds looking at the query itself. These findings suggest that facets played an important role in the exploratory search process.
Applying Data Mapping Techniques to Vector DSPs
Authors: Peter Westermann, Ludwig Schwoerer, Andre Kaufmann
Venue: Journal of Signal Processing Systems (2009)

Vector digital signal processors (DSPs) offer a good performance to power consumption ratio. Therefore, they are suitable for mobile devices in software defined radio applications. These vector DSPs require input algorithms with vector operations. The performance of vectorized algorithms to a great extent depends on the distribution of data on vector elements. Traditional algorithms for vectorization focus on the extraction of parallelism from a program; we propose an analysis tool that focuses on the selection of an efficient dynamic data mapping for vector DSPs. We transferred Garcia's communication parallelism graph (Garcia et al., IEEE Trans Parallel Distrib Syst 12: 416---431, 2001) for distributed memory multiprocessor systems to vector DSPs. By alternating the representation of two-dimensional data distributions and the cost models, we are able to determine a dynamic mapping of data on vector elements on the Embedded Vector Processor (EVP) (van Berkel et al., Proceedings of the 2004 software-defined radio technical conference SDR'04, 2004). Additionally, we propose a new efficient algorithm for processing the graph representation that operates in two steps. We demonstrate the capabilities of our tool by describing the vectorization of some MIMO OFDM algorithms.
A TLA+ Formal Specification and Verification of a New Real-Time Communication Protocol
Authors: Paul Regnier, George Lima, Aline Andrade
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We describe the formal specification and verification of a new fault-tolerant real-time communication protocol, called DoRiS, which is designed for supporting distributed real-time systems that use a shared high-bandwidth medium. Since such a kind of protocol is reasonably complex and requires high levels of confidence on both timing and safety properties, formal methods are useful. Indeed, the design of DoRiS was strongly based on formal methods, where the TLA+ language and its associated model-checker TLC were the supporting design tool. The protocol conception was improved by using information provided by its formal specification and verification. In the end, a precise and highly reliable protocol description is provided.
Power-delay tradeoff over wireless networks
Authors: Jia Tang, Xi Zhang
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

When transmitting stochastic traffic flows over wireless networks, there exists an inherent tradeoff between average transmit power and corresponding queuing-delay bound. In this paper, we investigate such a trade-off and show how average power increases as delay-bound requirement becomes stringent. Specifically, we propose the resource allocation schemes to minimize the power consumption subject to a delay quality-of-service (QoS) constraint, where the delay constraint is in terms of queue-length decaying rate when an arrival traffic is transmitted through the wireless networks. We focus on orthogonal-frequency-division-multiplexing (OFDM) communications under three different network infrastructures, namely, point-to-point link, multihop amplify-and-forward (AF) network, and multiuser cellular network. We derive the optimal resource allocation policies for each scenario, and compare their performances with other existing resource-allocation policies. The obtained simulation and numerical results show that using our proposed optimal resource-allocation policies, significant power saving can be achieved. Furthermore, our OFDM-based communications systems can significantly save the power consumption, especially under stringent delay constraint.
Using the metaphysics of quality to define design science
Authors: Christoph Bartneck
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

Design has evolved from a craft into an academic discipline, but it still falls short on defining its own science. I review previous approaches to Design Science and conclude that the subject-object dualism is the one of the main obstacles. I then apply the Metaphysics of Quality to overcome the dualism and propose Quality as the phenomenon of Design Science. Next, I propose to utilize the analysis of interaction effects as a mean to investigate Quality. Last, I recommend steps we can take to mature this new Design Science and strategies how we can gain the acknowledgement of the other sciences.
From NARS to a Thinking Machine
Authors: Pei Wang
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

NARS is an AGI project developed in the framework of reasoning system, and it adapts to its environment with insufficient knowledge and resources. The development of NARS takes an incremental approach, by extending the formal model stage by stage. The system, when finished, can be further augmented in several directions.
Porting an Intelligent Tutoring System across Domains
Authors: Min Chi, Kurt Vanlehn
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

One possible approach to reducing the cost of developing an intelligent tutoring system (ITS) is to reuse the components of an existing ITS. We used this approach to develop an Andes probability tutoring system by modifying the declarative knowledge of the Andes physics tutoring system. We claim that if we cluster various educational domains into groups based on their problem-solving methods [2], then it will be more efficient to port an existing ITS to a new domain in the same cluster than to build a new ITS from scratch.