ppxscal/embedding_network huggingface dataset:
The Use and Re-Use of Government Information from an EU Perspective
Authors: Johan Pas, Bruno De Vuyst
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The problems that occur in the commercial use and reuse of government information are the subject matter of a proposed EU directive. The paper describes the economic value of government information and documents, and its potential and actual commercial use. The paper then analyses the conceptually different approaches in Europe and the United States towards a legal framework for the commercial use of public sector documents and government information. The commercialization by governments of their own information and the arguabledifficulties it creates for fair competition with the private sector are indicated, with some policy and ethical considerations as conclusions.
An approach for supporting aspect-oriented domain modeling
Authors: Jeff Gray, Ted Bapty, Sandeep Neema, Douglas C. Schmidt, Aniruddha Gokhale, Balachandran Natarajan
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

This paper describes a technique for improving separation of concerns at the level of domain modeling. A contribution of this new approach is the construction of support tools that facilitate the elevation of crosscutting modeling concerns to first-class constructs in a type-system. The key idea is the application of a variant of the OMG Object Constraint Language to models that are stored persistently in XML. With this approach, weavers are generated from domain-specific descriptions to assist a modeler in exploring various alternative modeling scenarios. The paper examines several facets of Aspect-Oriented Domain Modeling (AODM), including: domain-specific model weavers, a language to support the concern separation, an overview of code generation issues within a meta-weaver framework, and a comparison between AODM and AOP. An example of the approach is provided, as well as a description of several future concepts for extending the flexibility within AODM.
The perception of managers on the impacts of the internet in Brazilian hotels: an exploratory study
Authors: Luiz Augusto Machado Mendes Filho, Anatália Saraiva Martins Ramos
Venue: Managing globally with information technology (2003)

The present study has an exploratory nature and aims to analyze the perception of managers on the efficiency, access importance, use as a communication tool, benefits and difficulties of Internet use in Brazilian hotels and also its effects according to the facilities rank and property size plus managers' age and experience time. It has been used as a questionnaire to collect data from the managers of 35 hotels in the city of Natal, RN, Brazil. By using analysis of variance (ANOVA) and the Tukey test, results showed that there is almost no significant difference on the perception of managers on the impact of Internet use in hotels. However, those variables that were different show that for younger and less experienced managers and luxurious hotels with more than 50 rooms, there is a more favorable perception on the impacts of the Internet.
Agent-Based Modeling for Competing Firms: From Balanced-Scorecards to Multi-Objective Strategies
Authors: Takao Terano, Kenichi Naitoh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

This paper proposes a novel method for agent-based modeling in business management domain. We will model competing companies with the Balanced Scorecards principle and examine their Value Proposition strategies for customers. The proposed method is characterized by (1) Designing decision making agents or competing companies with strategicparameters to be optimized; (2) Employing a multiobjective optimization framework with Genetic Algorithms to evolve the artificial simulated society; (3) Grounding the simulation conditions and results with marketing survey data in the real world, and (4) Validating the strategic parameters of the agents after simulation via statistical analysis of the individual genes. The objective of our agent-based modeling is to explore 'optimal' marketing strategies on given specific markets. Competing companies will thrive by choosing their customers, narrowing their focus, and dominating their markets. We will uncover which type of companies provide good value propositions for customers from their activities. Conventional research in business strategy literature states the importance of translating the strategy of a company into action to get the profit. In our study, on the contrary, we will observe agents' actions or companies' activities in the artificial society with given conditions and investigate the agents' or companies' strategy. From intensive experiments using our agent-based simulator in a television set market, we have observed that 1) the price and service are important for benefit and cash flow maximization; 2) there are few dominant strategies for share maximizaiton; 3) price and time will affect borrowing strategy, and 4) time is an important factor in a radio cassettes market. These results have suggested that our framework works well to analyze behaviors and strategies of competing firms.
Hierarchical multithreading architecture
Authors: Manoj Franklin
Venue:  (2003)

As we approach billion-transistor processor chips, the need for a new architecture to make efficient use of the increased transistor budget arises. Many studies have shown that significant amounts of unexploited parallelism exist at different granularities, especially for non-numeric programs that are very difficult to parallelize by compilers. Architectures such as superscalar and VLIW use centralized resources, which prohibit scalability and hence the ability to make use of the advances in semiconductor technology. Decentralized architectures make a step towards scalability, but are not geared to exploit parallelism at different granularities. In this thesis we present a new execution model and microarchitecture for exploiting both adjacent and distant parallelism in the dynamic instruction stream. Our model, called hierarchical multi-threading, uses a two-level hierarchical arrangement of processing elements. The lower level of the hierarchy exploits instruction-level parallelism and thread-level parallelism, whereas the upper level exploits more distant parallelism. A detailed description of a hierarchical multithreaded processor is presented. Several techniques to further enhance the performance of the hierarchical multithreading paradigm, such as dynamic profiling and return address prediction, are presented and analyzed. Detailed simulation studies with a cycle-accurate simulator indicate the potential of the hierarchical multithreading model versus the single-level speculative multithreaded paradigms by having an average speedup of 30%.
The secret of velvety skin
Authors: Jan Koenderink, Sylvia Pont
Venue: Machine Vision and Applications (2003)

Asperity scattering adds a 'surface lobe' to the usual diffuse, backscatter, and specular lobes of rough surfaces. Although rarely acknowledged, it is an important effect in many materials that are covered with a thin layer of sparse scatterers, such as dust or hairs. In common cases where single scattering predominates, asperity scattering adds important contributions to the structure of the occluding contour and the edge of the body shadow. This is because the bidirectional reflectance distribution function (BRDF) is inversely proportional to the cosines of both the illumination and viewing angles. The BRDF is generally low (and typically negligible) except when either the illuminating rays or visual directions graze the surface. Because asperity scattering selectively influences the edges in the image of an object, it has (as judged by photometric magnitudes) a disproportionally large effect on (human) visual appreciation. We identify it as a neglected but often decisive visual cue in the rendering of human skin. Its effect is to make smooth cheeks look 'velvety' or 'peachy', that is to say, soft (the appearances of both velvet and peachy skin are dominated by asperity scattering). This is a most important aesthetic and emotional factor that is lacking in Lambertian (looks merely dullish and paper-like), 'skin-type' BRDF (looks like glossy plastic), or even translucent (looks 'hard', vitreous) types of rendering.
A simple proof of the undecidability of strong normalisation
Authors: Paweł Urzyczyn
Venue: Mathematical Structures in Computer Science (2003)

The purpose of this note is to give a methodologically simple proof of the undecidability of strong normalisation in the pure lambda calculus. For this we show how to represent an arbitrary partial recursive function by a term whose application to any Church numeral is either strongly normalizable or has no normal form. Intersection types are used for the strong normalization argument.
Poster abstract: entropy-based sensor selection for localization
Authors: Hanbiao Wang, Kung Yao, Greg Pottie, Deborah Estrin
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

We propose a novel entropy-based sensor selection heuristic for localization. Given 1) a prior probability distribution of the target location, and 2) the locations and the sensing characteristics of a set of additional sensors, we would like to select an optimal additional sensor such that fusion of its measurements with existing information would yield the greatest entropy reduction of the target location distribution. The heuristic can select a sub-optimal additional sensor without retrieving the measurements of candidate sensors. The heuristic is computationally much simpler than the mutual information based sensor selection approaches for localization and tracking [1, 2]. Just as those existing approaches do, the heuristic greedily selects one sensor in each step.
Security Analysis of the SAML Single Sign-on Browser/Artifact Profile
Authors: Thomas Groβ
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Many influential industrial players are currentlypursuing the development of new protocols for federatedidentity management. The Security AssertionMarkup Language (SAML) is an important standardizedexample of this new protocol class and will bewidely used in business-to-business scenarios to reduceuser-management costs. SAML utilizes a constraint-basedspecification that is a popular design techniqueof this protocol class. It does not include a generalsecurity analysis, but provides an attack-by-attacklist of countermeasures as security consideration. Wepresent a security analysis of the SAML Single Sign-onBrowser/Artifact profile, which is the first one for sucha protocol standard. Our analysis of the protocol designreveals several flaws in the specification that can leadto vulnerable implementations. To demonstrate their impact,we exploit some of these flaws to mount attacks onthe protocol.
Performance evaluation of load balancing strategies for approximate string matching application on an MPI cluster of heterogeneous workstations
Authors: Panagiotis D. Michailidis, Konstantinos G. Margaritis
Venue: Future Generation Computer Systems (2003)

In this paper, we present three parallel approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at low cost. The first method is the static master-worker with uniform distribution strategy, the second one is the dynamic master-worker with allocation of subtexts and the third one is the dynamic master-worker with allocation of text pointers. Further, we propose a hybrid parallel method that combines the advantages of static and dynamic parallel methods in order to reduce the load imbalance and communication overhead. This hybrid method is based on the following optimal distribution strategy: the text collection is distributed proportional to workstation's speed. We evaluated and compared the performance of the four methods with clusters one, two, four, six and eight heterogeneous workstations. The experimental results demonstrate that dynamic allocation of text pointers and hybrid methods achieve better performance than the two original ones. We also present an analytical performance model for the four methods that confirms the actual behaviour of the experimental results.
A Petri-net-based approach to real-time program analysis
Authors: Ugo Buy, Robert Sloan
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

We propose to extend existing Petri-net-based tools for concurrency analysis to real-time analysis. The goal is to create a fully automated system, which starts from code in a higher level language for real-time programming, and answers programmers' queries about timing properties of the code.The key difficulty with all reachability-based approaches is that the state space quickly becomes intractably large. To circumvent this state explosion problem, we propose using a combination of several heuristics for model reduction and state space reduction that have been effective for untimed concurrency analysis.
The Bass-Station: a community based information space
Authors: Ahmi Wolf, Mark Argo
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The Bass-Station is a novel mobile device that allows people to easily share their artistic digital belongings with their immediate physical community. Building on currently available technology, incorporated into an everyday object, we create an information space that affords people of an artistic and collaborative community the ability to share and exchange their personal media. The Bass-Station facilitates communication and sharing between people in a local community, making use of technology as a medium for developing relationships and new artistic forms.
Study of a Non-Markovian Stack Management Model in a Two-Level Memory
Authors: E. A. Aksenova, A. A. Lazutina, A. V. Sokolov
Venue: Programming and Computing Software (2004)

A non-Markovian model of stack behavior is suggested and studied. In this model, the probability of the operation to be performed on the stack at the next step depends on the operation performed at the current step. Theoretically optimal stack control algorithms in a two-level memory are suggested.
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence
Authors: Andrew J. Bennett, Paul H. J. Kelly, Ross A. Paterson
Venue: Journal of Functional Programming (2001)

This paper is an exploration of the parallel graph reduction approach to parallel functional programming, illustrated by a particular example: pipelined, dynamically-scheduled implementation of search, updates and read-modify-write transactions on an in-store binary search tree. We use program transformation, execution-driven simulation and analytical modelling to expose the maximum potential parallelism, the minimum communication and synchronisation overheads, and to control the overall space requirement. We begin with a lazy functional program specifying a series of transactions on a binary tree, each involving several searches and updates, in a side-effect-free fashion. Transformation of the source code produces a formulation of the program with greater locality and larger grain size than can be achieved using naive parallelization methods, and we show that, with care, these tasks can be scheduled effectively. Even with a workload using random keys, significant spatial locality is found, and we evaluate a modified cache coherency protocol which avoids false sharing so that large cache lines can be used to minimise the number of messages required. As expected with a pipeline, the application should reach a steady state as soon as the first transaction is completed. However, if the network latency is too large, the rate of completion lags behind the rate at which work is admitted, and internal queues grow without bound. We determine the conditions under which this occurs, and show how it can be avoided while maximising speedup.
Success Factors of Virtual Communities from the Perspective of Members and Operators: An Empirical Study
Authors: Jan Marco Leimeister, Pascal Sidiras, Helmut Krcmar
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Virtual communities have been the focus of research for some time. However, while many studies provide recommendations on how to build, extend and manage virtual communities, few verify the success factors they consider essential for virtual communities. Conclusions made regarding basic preferences and distinct priorities of different stakeholders in virtual communities have not been empirically substantiated. This study uses an online survey of members and operators of virtual communities to evaluate success factors discussed in the literature. Incongruences between members and operators are identified and analysed. This research gains first empirically validated insights into success factors for establishing and managing virtual communities. The study results are summarised in ten hypotheses.
Complex Branch Profiling for Dynamic Conditional Execution
Authors: Rafael R. dos Santos, Tatiana G. S. dos Santos, Mauricio L. Pilla, Philippe O. A. Navaux, Sergio Bampi, Mario Nemirovsky
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Branch predictors are widely used as an alternative to deal with conditional branches. Despite the high accuracy rates, misprediction penalties are still large in any super-scalar pipeline. DCE, or Dynamic Conditional Execution, is an alternative to reduce the number of predicted branches by executing both paths of certain branches, reducing the number of predictions and, therefore, the occurrence of mispredictions. The goal of this work is to analyze the complexity of branch structures and determine the number of branches that can be predicated in DCE and the distribution of mispredictions according to the proposed classification. The complex branch classification proposed extends the classification presented by Klauser [3]. As result, we show that an average of 35% of all branches can be predicated in DCE and around 32% of all mispredictions fall into these branches.
Racing car design using knowledge aided engineering
Authors: Lorenzo Susca, Ferruccio Mandorli, Caterina Rizzi, Umberto Cugini
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The evolution of computer aided design (CAD) systems and related technologies has promoted the development of software for the automatic configuration of mechanical systems. This occurred with the introduction of knowledge aided engineering (KAE) systems that enable computers to support the designer during the decision-making process. This paper presents a knowledge-based application that allows the designer to automatically compute and evaluate mass properties of racing cars. The system is constituted by two main components: the computing core, which determines the car model, and the graphic user interface, because of which the system may be used also by nonprogrammers. The computing core creates the model of the car based on a tree structure, which contains all car subsystems (e.g., suspension and chassis). Different part&ndash;subpart relationships define the tree model and link an object (e.g., suspension) to its components (e.g., wishbones and wheel). The definition of independent parameters (including design variables) and relationships definition allows the model to configure itself by evaluating all properties related to dimension, position, mass, etc. The graphic user interface allows the end user to interact with the car model by editing independent design parameters. It visualizes the main outputs of the model, which consist in numeric data (mass, center of mass of both the car and its subsystems) and graphic elements (car and subsystems 3D representation).
The XIS Generative Programming Techniques
Authors: Alberto Rodrigues da Silva, Gonçalo Lemos, Tiago Matias, Marco Costa
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Abstract. XIS 1 is a R&D project which main mission is toanalyze, develop and evaluate mechanisms and tools toproduce information systems from a more abstract, high-level,efficient and productive way than it is done currently.XIS project is influenced by MDA reference model, and ismainly based on three principles: namely high-level modelsspecification; generative programming techniques; and it iscomponent-based architecture-centric. XIS is not aconceptual research plan, it is a working on project withconcrete results and produced systems. In this paper wedetail the generative programming techniques used in theXIS project as well as the discussions and main decisionstackled on. Finally, we present the main conclusions, therelationship between XIS and MDA, and the work that willbe handled in the near future.
Quantum bit-commitment for small storage based on quantum one-way permutations
Authors: Keisuke Tanaka
Venue: New Generation Computing (2003)

We propose a quantum bit-commitment scheme based on quantum one-way permutations with the unconditionally binding and computationally concealing property. Our scheme reduces exponentially the number Of bits which the receiver needs to store until the opening phase compared with the classical counterpart.
Modeling and Simulating Critical Infrastructures and Their Interdependencies
Authors: Steven M. Rinaldi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Our national security, economic prosperity, and national well-being are dependent upon a set of highly interdependent critical infrastructures. Examples of these infrastructures include the national electrical grid, oil and natural gas systems, telecommunication and information networks, transportation networks, water systems, and banking and financial systems. Given the importance of their reliable and secure operations, understanding the behavior of theseinfrastructures -- particularly when stressed or under attack -- is crucial. Models and simulations can provide considerable insight into the complex nature of their behaviors and operational characteristics. These models and simulations must include interdependencies among infrastructures if they are to provide accurate representations of infrastructure characteristics and operations. A number of modeling and simulation approaches under development today directly address interdependencies and offer considerable insight into the operational and behavioral characteristics of critical infrastructures.
Liouvillian solutions of third order differential equations
Authors: Felix Ulmer
Venue: Journal of Symbolic Computation (2003)

The Kovacic algorithm and its improvements give explicit formulae for the Liouvillian solutions of second order linear differential equations. Algorithms for third order differential equations also exist, but the tools they use are more sophisticated and the computations more involved. In this paper we refine parts of the algorithm to find Liouvillian solutions of third order equations. We show that, except for four finite groups and a reduction to the second order case, it is possible to give a formula in the imprimitive case. We also give necessary conditions and several simplifications for the computation of the minimal polynomial for the remaining finite set of finite groups (or any known finite group) by extracting ramification information from the character table. Several examples have been constructed, illustrating the possibilities and limitations.