ppxscal/embedding_network huggingface dataset:
A Semi-automatic Support to Adapt E-Documents in an Accessible and Usable Format for Vision Impaired Users
Authors: Elia Contini, Barbara Leporini, Fabio Paternò
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Electronic material (e-documents, e-books, on line resources, etc.) represents an essential tool for continuous learning for print-impaired people, provided it is well-structured. To obtain accessible and usable e-content, specific requirements should be applied from the early beginning or used when adapting existing electronic formats. In this paper we present a method, and a first associated prototype, for making e-documents in a format, which is accessible and usable for vision impaired users. The resulting environment is composed of various transformations, with different degree of automation, and applies a number of guidelines that have been defined for this purpose.
Greenhouse Air Temperature and Humidity Prediction Based on Improved BP Neural Network and Genetic Algorithm
Authors: Fen He, Chengwei Ma, Junxiong Zhang, Ying Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The adequacy of improved back propagation (IBP) neural network to model the inside air temperature and humidity of a production greenhouse as a function of outside parameters including temperature, relative humidity, wind speed, and solar radiation was addressed. To avoid standard BP algorithm's shortcoming of trapping to a local optimum and to take advantage of the genetic algorithm (GA)'s globe optimal searching, a new kind of hybrid algorithm was formed based on the IBP neural network and GA. BP neural network was improved by adding the inertia impulse and self-adaptation learning rate to lessen convergence vibration and increase the learning speed. Then the initialized weights and thresholds of IBP neural network were optimized with GA. Through carrying out the experiments, the specimen data were collected on half-hourly basis in a greenhouse. After the network structure and parameters were determined reasonably, the network was trained. A comparison was made between measured and predicted values of temperature and relative humidity, and the results showed that the IBP neural network model combined with GA given a good prediction for inside temperature and humidity. By using the root mean square error (RMSE) algorithm, the RMSE between temperature predicted and measured was 0.8°C, and the relative humidity RMSE was 1.1%, which can satisfy with the demand of greenhouse climate environment control.
The Effect of Model Granularity on Student Performance Prediction Using Bayesian Networks
Authors: Zachary A. Pardos, Neil T. Heffernan, Brigham Anderson, Cristina L. Heffernan
Venue: Proceedings of the 11th international conference on User Modeling (2007)

A standing question in the field of Intelligent Tutoring Systems and User Modeling in general is what is the appropriate level of model granularity (how many skills to model) and how is that granularity derived? In this paper we will explore models with varying levels of skill generality (1, 5, 39 and 106 skill models) and measure the accuracy of these models by predicting student performance within our tutoring system called ASSISTment as well as their performance on a state standardized test. We employ the use of Bayes nets to model user knowledge and to use for prediction of student responses. Our results show that the finer the granularity of the skill model, the better we can predict student performance for our online data. However, for the standardized test data we received, it was the 39 skill model that performed the best. We view this as support for fine-grained skill models despite the finest grain model not predicting the state test scores the best.
Gap Analysis in IP Multicast Dissemination
Authors: Hitoshi Asaeda, Bill Manning
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

IP multicast is advantageous for high quality streaming applications and future needs in the Internet. However, it is generally recognized that IP multicast requires significant routing coordination and configuration, and hence its routing protocols are non-scalable. Recently, Source-Specific Multicast (SSM) has been standardized and proposed as the deployable IP multicast communication architecture. SSM basically works for the one-to-many communication, and eliminates many of the complexities the traditional many-to-many multicast communication has. While SSM gives advantages for the IP multicast deployment, there is still a gap between what is reported as the state-of-the-art in the literature and what could be implemented in practice.In this paper, we analyze the deployment barriers SSM creates, and consider how we can ease some of the barriers. To define the possible approaches, we discuss the functions SSM requires, and the necessary components network operators and application developers need to know for fulfilling the demand.
Simulated Annealing Parallel Genetic Algorithm Based on Building Blocks Migration
Authors: Zhiyong Li, Xilu Zhu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Through analyzing schema theorem and building blocks theory, propose parallel genetic algorithms based on building blocks migration. Relying on convergence condition, receive building blocks from other populations. Using simulated annealing method prevent the density of good schema to increase greatly which will result in premature convergence. Theory analysis and experimental results show that the method not only reduce ineffective migration and decrease communication costs, but also lower the possibility of occurring premature and assure the capability of global convergence.
Reusing models in multi-agent simulation with software components
Authors: Paulo Salem da Silva, Ana C. V. de Melo
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Simulation models are abstract representations of systems one wants to study through computer simulation. In multi-agent based simulation, such models usually represent agents and their relations. An important issue concerning these models is how they can be effectively reused across different simulations. But while much attention has been given to other engineering issues, model reuse has remained mostly untreated. To help address this issue, in this paper we present both a method and a software architecture for multi-agent simulation designed with reuse in mind. We employ software components as fundamental reusable model assets and show how their composition can also be reused. Our technique depends on some domain specific assumptions, such as the fact that agents must be related by social networks, and we argue that these are actually helpful in the context of software components. A case study is also given in order to illustrate clearly how the same component can be reused in two distinct simulation problems using our approach.
BEinGRID: Development of Business Models for the Grid Industry
Authors: Katarina Stanoevska-Slabeva, Davide Maria Parrilli, George Thanos
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

Driven by the increasing demand, grid technology is entering the business market in form of utility computing, grid middleware and grid-enabled application. However, the business market is interested in complete grid solutions. This means that for a successful take up of grid technology on the business market the establishment of grid value networks is required. This again can only be achieved by implementation of sound business models for each player providing part of a grid solution. This paper discusses the business models of providers of grid-enabled application.
Internationalisation in the telecommunications services industry: Literature review and research agenda
Authors: Nejc M. Jakopin
Venue: Telecommunications Policy (2008)

A review of 356 publications addressing internationalisation aspects of the telecommunications services industry (TSI) shows a growing body of contributions, mainly covering research themes like settlement and regulation policy, strategic alliances and incumbents' reactions to deregulation as well as opening of markets in-depth until recently. Wireline telephony TSI has been the dominant segment in most contributions, while the mobile or broadband Internet segments only featured in more recent work. Segment characteristics like non-uniform barriers to entry, different reasons for alliances and non-uniform levels of internationalisation differentiate these TSI segments pose a number of additional questions concerning telecom firms' internationalisation strategy and success promising for future research.
A GPU favor representation method for plenoptic-illumination function based on an efficient spherical partition scheme
Authors: Chi-Sing Leung, Ping-Man Lam, Tien-Tsin Wong
Venue: Image Communication (2008)

In image-based relighting (IBR), a set of reference images is pre-captured under various light directions. These reference images represent the appearance of a scene with an adjustable illumination. This paper describes a graphics process unit (GPU) favor relighting scheme for IBR. The scheme consists of two levels. In the first level, the reference images are converted into a number of lightmaps (floating point images) based on the proposing HEALPIX discrete cosine transform (HDCT). In the second level, the lightmaps are compressed with a GPU favor compression method. Novel images with complicated lighting conditions can be directly generated from those compressed lightmaps. The GPU accelerated relighting methods for the directional source and the point source are discussed. Compared with the spherical harmonic scheme and the radial basis function scheme, the proposed HDCT scheme offers the similar rendering speed and much better rendering quality.
Bounded Ciphertext Policy Attribute Based Encryption
Authors: Vipul Goyal, Abhishek Jain, Omkant Pandey, Amit Sahai
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

In a ciphertext policy attribute based encryption system, a user's private key is associated with a set of attributes (describing the user) and an encrypted ciphertext will specify an access policy over attributes. A user will be able to decrypt if and only if his attributes satisfy the ciphertext's policy.In this work, we present the first construction of a ciphertext-policy attribute based encryption scheme having a security proof based on a number theoretic assumption and supporting advanced access structures. Previous CP-ABE systems could either support only very limited access structures or had a proof of security only in the generic group model. Our construction can support access structures which can be represented by a bounded size access tree with threshold gates as its nodes. The bound on the size of the access trees is chosen at the time of the system setup. Our security proof is based on the standard Decisional Bilinear Diffie-Hellman assumption.
BAP: Broadcast Authentication Using Cryptographic Puzzles
Authors: Patrick Schaller, Srdjan Čapkun, David Basin
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

We present two broadcast authentication protocols based on delayed key disclosure. Our protocols rely on symmetric-key cryptographic primitives and use cryptographic puzzles to provide efficient broadcast authentication in different application scenarios, including those with resource-constrained wireless devices such as sensor nodes. The strong points of the protocols proposed are that one protocol allows instantaneous message origin authentication, whereas the other has low communication overhead. In addition to formalizing and analyzing these specific protocols, we carry out a general analysis of broadcast authentication protocols based on delayed key disclosure. This analysis uncovers fundamental limitations of this class of protocols in terms of the required accuracy of message propagation time estimations, if the protocols are to guarantee security and run efficiently.
Boundary Labeling with Octilinear Leaders
Authors: Michael A. Bekos, Micheal Kaufmann, Martin Nöllenburg, Antonios Symvonis
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

A major factor affecting the readability of an illustration that contains textual labels is the degree to which the labels obscure graphical features of the illustration as a result of spatial overlaps. Boundary labeling addresses this problem by attaching the labels to the boundary of a rectangle that contains all features. Then, each feature should be connected to its associated label through a polygonal line, called leader, such that no two leaders intersect.In this paper we study the boundary labeling problem along a new line of research, according to which different pairs of type leaders (i.e. do and pd, od and pd) are combined to produce boundary labelings. Thus, we are able to overcome the problem that there might be no feasible solution when labels are placed on different sides and only one type of leaders is allowed. Our main contribution is a new algorithm for solving the total leader length minimization problem (i.e., the problem of finding a crossing free boundary labeling, such that the total leader length is minimized) assuming labels of uniform size. We also present an NP-completeness result for the case where the labels are of arbitrary size.
A Framework for Comparing Perspectives on Privacy and Pervasive Technologies
Authors: Anne R. Jacobs, Gregory D. Abowd
Venue: IEEE Pervasive Computing (2003)

Each of the many viable definitions of personal privacy reflects a distinct set of beliefs about what types of information the courts should protect. As those beliefs change and evolve, so does the law. Pervasive computing research has also evolved, investigating mechanisms for supporting some predefined notion of privacy, typically favoring individual rights over the rights of the community. Developing a framework for judging pervasive technologies against social norms can give technology developers insight into how and why the systems they create test those norms.
Provenance framework in support of data quality estimation
Authors: Beth Plale, Dennis Gannon
Venue:  (2007)

Science has evolved over the past several decades, from an empirical and theoretical approach to one that includes computational simulations and modeling, commonly known as e-Science. Advances in cyberinfrastructure for e-Science have enabled researchers to run complex, computational investigations that include data access, analysis, and model runs that execute, largely automated, as data-driven workflows. Provenance is metadata that describes the process by which datasets are generated by the workflows. This data derivation history is essential to understand how a datum was created, verify and validate the experimental results, and determine the quality of the derived data. This dissertation makes two key contributions to scientific data management. First, it proposes a low-overhead provenance collection framework for scientific workflows. The Karma Provenance Framework is a prototype implementation that collects provenance activities from automatically instrumented services and builds a data provenance model from runtime information. Karma provides a service interface to query for different forms of provenance. The framework has been applied in the LEAD cyberinfrastructure and its performance validated through empirical analysis. Second, it defines a data quality model for estimating the subjective quality of derived data for scientific applications. The model uses a holistic set of quality metrics, including provenance, intrinsic metadata, quality of service, and community perception, to estimate a numerical quality score for the data. This enables a scientist to select the best quality dataset for their application from numerous that qualify. Experimental studies conducted on a prototype quality broker validate the feasibility and prediction accuracy of the model.
Linear time-varying systems: theory and identification of model parameters
Authors: Kyarash Shahriari, Stanislaw Tarasiewicz, Olivier Adrot
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

A strategy is proposed to model the complex industrial systems using linear time-varying system (LTV S). The proposed methodology is independent of model structure and the model may take any classic linear structure such as finite impulse response, input-output relation structures etc. To take into account the error between system and model due to model order reduction, variation of system behavior in time and perturbations, model's parameters are considered varying but bounded variables characterized by intervals. The output of this model is characterized by a function of the piecewise linear parameters which contains all possible system's responses taking into account modeling error as well as the perturbations.
A Service Gateway for Networked Sensor Systems
Authors: Peter Schramm, Edwin Naroska, Peter Resch, Jorg Platte, Holger Linde, Guido Stromberg, Thomas Sturm
Venue: IEEE Pervasive Computing (2004)

Networked sensor systems are an emerging area in the field of ubiquitous computing. The typical approach is to connect sensor-actuator devices using classic network infrastructures at a low level. A promising new approach is to integrate them into high-level ad hoc networking communities. These ad hoc networks can serve as infrastructures to dynamically integrate sensors and actuators into complex interactive systems while providing convenient interfaces to users. However, because they are usually heterogeneous, such networks often require platform-independent middleware systems. Unfortunately, these middleware systems make great demands on the participating devices in terms of computing resources. On the other hand, sensor-actuator modules (SAMs) should be as inexpensive and small as possible to achieve market success and save energy resources. Hence, they usually do not meet the requirements for joining ad hoc networks. Shaman, an extendable Java-based service gateway for networked sensor systems, solves this problem. Shaman integrates small network-attached SAMs into heterogeneous, high-level networking communities. The system unburdens the SAMs and provides multiple interfaces for common standards of ad hoc networking. Because some cases require direct user access to services, the system also provides a self-contained mapping of graphical user interfaces. Shaman's one-GUI, x-interfaces concept minimizes design efforts because a single GUI component automatically maps to each kind of user interface.. Currently, the system provides automatic generation of Jini-, Java-applet-, and HTML-based user interfaces. This allows easy minimization of SAM parameters such as physical size, cost, and energy consumption without affecting convenience or performance.
Techniques for Maintaining Population Diversity in Classical and Agent-Based Multi-objective Evolutionary Algorithms
Authors: Rafał Dreżewski, Leszek Siwik
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The loss of population diversity is one of the main problems in some applications of evolutionary algorithms. In order to maintain useful population diversity some special techniques must be used, like niching or co-evolutionary mechanisms. In this paper the mechanisms for maintaining population diversity in agent-based multi-objective (co-)evolutionary algorithms are proposed. The presentation of techniques is accompanied by the results of experiments and comparisons to "classical" evolutionary multi-objective algorithms.
Distinct Triangle Areas in a Planar Point Set
Authors: Adrian Dumitrescu, Csaba D. Tóth
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

Erdős, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least $\lfloor \frac{n-1}{2} \rfloor$, which is attained for ¿n / 2¿ and respectively $\lfloor n/2\rfloor$ equally spaced points lying on two parallel lines. We show that this number is at least $\frac{17}{38}n -O(1) \approx 0.4473n$. The best previous bound, $(\sqrt{2}-1)n-O(1)\approx 0.4142n$, which dates back to 1982, follows from the combination of a result of Burton and Purdy [5] and Ungar's theorem [23] on the number of distinct directions determined by n noncollinear points in the plane.
An empirical study of bandwidth predictability in mobile computing
Authors: Jun Yao, Salil S. Kanhere, Mahbub Hassan
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

While bandwidth predictability has been well studied in static environments, it remains largely unexplored in the context of mobile computing. To gain a deeper understanding of this important issue in the mobile environment, we conducted an eight-month measurement study consisting of 71 repeated trips along a 23Km route in Sydney under typical driving conditions. To account for the network diversity, we measure bandwidth from two independent cellular providers implementing the popular High-Speed Downlink Packet Access (HSDPA) technology in two different peak access rates (1.8 and 3.6Mbps). Interestingly, we observe no significant correlation between the bandwidth signals at different points in time within a given trip. This observation eventually leads to the revelation that the popular time series models, e.g. the Autoregressive and Moving Average, typically used to predict network traffic in static environments are not as effective in capturing the regularity in mobile bandwidth. Although the bandwidth signal in a given trip appears as a random white noise, we are able to detect the existence of patterns by analyzing the distribution of the bandwidth observed during the repeated trips. We quantify the bandwidth predictability reflected by these patterns using tools from information theory, entropy in particular. The entropy analysis reveals that the bandwidth uncertainty may reduce by as much as 46% when observations from past trips are accounted for. We further demonstrate that the bandwidth in mobile computing appears more predictable when location is used as a context. All these observations are consistent across multiple independent providers offering different data transfer rates using possibly different networking hardware.
UseCase-Wise Development: Retrenchment for Event-B
Authors: Richard Banach
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

UseCase-wise Development, the introduction of functionality into an application in stages, with each stage being carried through to (ideally) implementation before the next is considered, is examined with a view to its being treated via an Event-B methodology. The need to modify top level behaviour in a non-skip way precludes its naive treatment via Event-B refinement, and paves the way for the use of retrenchment in Event-B. The details of an Event-B formulation of retrenchment, aligned to the practical details of the Rodin toolset, are described. The details of refinement/retrenchment interworking needed to handle UseCase-wise development are outlined, and a simple case study is given.