ppxscal/embedding_network huggingface dataset:
Expressiveness of XSDs: from practice to theory, there and back again
Authors: Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an investigation of the XML Schema Definitions (XSDs) occurring in practice reveals that the vast majority of them are structurally equivalent to DTDs. This might be due to the complexity of the XML Schema specification and the difficulty to understand the effect of constraints on typing and validation of schemas. To shed some light on the actual expressive power of XSDs this paper studies the impact of the Element Declarations Consistent (EDC) and the Unique Particle Attribution (UPA) rule. An equivalent formalism based on contextual patterns rather than on recursive types is proposed which might serve as a light-weight front end for XML Schema. Finally, the effect of EDC and UPA on the way XML documents can be typed is discussed. It is argued that a cleaner, more robust, stronger but equally efficient class is obtained by replacing EDC and UPA with the notion of 1-pass preorder typing: schemas that allow to determine the type of an element of a streaming document when its opening tag is met. This notion can be defined in terms of restrained competition regular expressions and there is again an equivalent syntactical formalism based on contextual patterns.
Planning Marketing-Mix Strategies in the Presence of Interaction Effects
Authors: Prasad A. Naik, Kalyan Raman, Russell S. Winer
Venue: Marketing Science (2005)

Companies spend millions of dollars on advertising to boost a brand's image and simultaneously spend millions of dollars on promotion that many believe calls attention to price and erodes brand equity. We believe this paradoxical situation exists because both advertising and promotion are necessary to compete effectively in dynamic markets. Consequently, brand managers need to account for interactions between marketing activities and interactions among competing brands. By recognizing interaction effects between activities, managers can consider interactivity trade-offs in planning the marketing-mix strategies. On the other hand, by recognizing interactions with competitors, managers can incorporate strategic foresight in their planning, which requires them to look forward and reason backward in making optimal decisions. Looking forward means that each brand manager anticipates how other competing brands are likely to make future decisions, and then by reasoning backward deduces one's own optimal decisions in response to the best decisions to be made by all other brands. The joint consideration of interaction effects and strategic foresight in planning marketing-mix strategies is a challenging and unsolved marketing problem, which motivates this paper.This paper investigates the problem of planning marketing mix in dynamic competitive markets. We extend the Lanchester model by incorporating interaction effects, constructing the marketing-mix algorithm that yields marketing-mix plans with strategic foresight, and developing the continuous-discrete estimation method to calibrate dynamic models of oligopoly using market data. Both the marketing-mix algorithm and the estimation method are general, so they can be applied to any other alternative model specifications for dynamic oligopoly markets. Thus, this dual methodology augments the decision-making toolkit of managers, empowering them to tackle realistic marketing problems in dynamic oligopoly markets.We illustrate the application of this dual methodology by studying the dynamic Lanchester competition across five brands in the detergents market, where each brand uses advertising and promotion to influence its own market share and the shares of competing brands. Empirically, we find that advertising and promotion not only affect the brand shares (own and competitors') but also exert interaction effects, i.e., each activity amplifies or attenuates the effectiveness of the other activity. Normatively, we find that large brands underadvertise and overspend on promotion, while small brands underadvertise and underpromote. Finally, comparative statics reveal managerial insights into how a specific brand should respond optimally to the changes in a competing brand's situation; more generally, we find evidence that competitive responsiveness is asymmetric.
Energy-efficient datapath scheduling using multiple voltages and dynamic clocking
Authors: Saraju P. Mohanty, N. Ranganathan
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Recently, dynamic frequency scaling has been explored at the CPU and system levels for power optimization. Low-power datapath scheduling using multiple supply voltages has been well researched. In this work, we develop new datapath scheduling algorithms that use multiple supply voltages and dynamic frequency clocking in a coordinated manner in order to reduce the energy consumption of datapath circuits. In dynamic frequency clocking, the functional units can be operated at different frequencies depending on the computations occurring within the datapath during a given clock cycle. The strategy is to schedule high-energy units, such as multipliers at lower frequencies, so that they can be operated at lower voltages to reduce energy consumption and the low-energy units, such as adders at higher frequencies, to compensate for speed. The proposed time- and resource-constrained algorithms have been applied to various high-level synthesis benchmark circuits under different time and resource constraints. The experimental results show significant reduction in energy for both the algorithms.
A lower bound on the spectral radius of the universal cover of a graph
Authors: Shlomo Hoory
Venue: Journal of Combinatorial Theory Series B (2005)

For a finite connected graph G let ρ(G˜) be the spectral radius of its universal cover. We prove that ρ(G˜)≥2√d - 1 for any graph G of average degree d ≥ 2 and derive from it the following generalization of the Alon Boppana bound. If the average degree of the graph G after deleting any radius r ≥ 2 ball is at least d ≥ 2, then its second largest eigenvalue in absolute value λ(G) is at least 2 √d - 1(1 - c log r/r). for some absolute constant c. This result is tight in the sense that we can construct graphs with high average degree and diameter but small λ(G).For bipartite graphs with minimal degree at least two, we prove that ρ(G˜)≥√dL - 1 + √dR - 1, where dL, dR are the average degrees on the left and right hand sides.
Simple verification technique for complex Java bytecode subroutines: Research Articles
Authors: Alessandro Coglio
Venue: Concurrency and Computation: Practice Experience (2004)

Java is normally compiled to bytecode, which is verified and then executed by the Java Virtual Machine. Bytecode produced via compilation must pass verification. The main cause of complexity for bytecode verification is subroutines, used by compilers to generate more compact code. The techniques to verify subroutines proposed in the literature reject certain programs produced by mundane compilers, are difficult to realize within an implementation of the Java Virtual Machine or are relatively complicated. This paper presents a novel technique which is very simple to understand, implement and prove sound. It is also very powerful: the set of accepted programs has a simple characterization which most likely includes all the code produced by current compilers and which enables future compilers to make more extensive use of subroutines. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Optimal Control of Fed-Batch Processes Based on Multiple Neural Networks
Authors: Zhihua Xiong, Jie Zhang
Venue: Applied Intelligence (2005)

The performance of empirical model based fed-batch process optimal control is strongly affected by the model prediction reliability at the end-point of a batch. An optimal control profile calculated from an empirical model may not give the best performance when applied to the actual process due to model-plant mismatches. To tackle this issue, a new method for improving the reliability of fed-batch process optimal control by incorporating model prediction confidence bounds is proposed. Multiple neural networks (MNN) are used to build an empirical model of fed-batch process based on process operation data. Model prediction confidence bounds are calculated based on predictions of all component networks in an MNN model and the model prediction confidence bound at the end-point of a batch is incorporated into the optimization objective function. The modified objective function penalizes wide prediction confidence bounds in order to obtain a reliable optimal control profile. The non-linear optimization problem based on MNN with augmented objective function is solved by iterative dynamic programming. The proposed control strategy is illustrated on a simulated fed-batch ethanol fermentation process. The results demonstrate that the optimal control profile calculated from the proposed approach is reliable in the sense that its performance degradation is limited when applied to the actual process.
Signum 1971 nonacademic numerical mathematics survey: a brief summary of responses
Authors: F. N. Fritsch
Venue: ACM SIGNUM Newsletter (1972)

During the months of July and August 1971 a questionnaire was sent by SIGNUM to 447 nonacademic institutions in North America. (Of these, 16 were in Canada, 4 in Mexico.) These institutions were selected as known employers of mathematicians or users of large-scale scientific computers. According to the cover letter, the purpose of this survey was "to determine where numerical mathematicians are employed in the nonacademic world, how many there are, and what they are doing." This report is a brief summary of the responses to that survey. Complete details are given in reference [1].
Simple tutors for hard problems: understanding the role of pseudo-tutors
Authors: Matthew Hockenberry
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The construction of cognitive tutors is often focused on tightly constrained domains. This is because the creation of a cognitive tutor is a time-intensive process. Pseudo-tutors allow us to model a small number of problems in a relatively short time. There is no need to program a general cognitive model if we can demonstrate this model by example. The creation of a relatively small set of examples can have real cognitive benefit to the student.The LSAT Analytic Logic Tutor demonstrates that this is possible. This tutor was designed for teaching strategies for solving analytic logic games. Although such a task would be difficult to model in general, three rich problems produced enough of an impact to significantly improve student performance. This is an interesting example where a small suite of well-designed pseudo tutors are significantly more useful than a full cognitive tutor.
University of Manitoba: description of the NUBA system as used for MUC-5
Authors: Dekang Lin
Venue: Proceedings of the 5th conference on Message understanding (1993)

Abduction is the inference to the best explanation. Many tasks in natural language understanding such as word-sense disambiguity [1], local pragmatics [4], metaphor interpretation [3], and plan recognition [5, 8], can be viewed as abduction.
Machine translation based on NLG from XML-DB
Authors: Yohei Seki, Ken'ichi Harada
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

The purpose of this study is to propose a new method for machine translation. We have proceeded through with two projects for report generation (Kittredge and Polguere, 2000): Weather Forecast and Monthly Economic Report to be produced in four languages: English, Japanese, French, and German. Their input data is stored in XML-DB. We applied a three-stage pipelined architecture (Reiter and Dale, 2000), and each stage was implemented as XML transformation processes. We regard XML stored data as language-neutral intermediate form and employ the so-called 'sublanguage approach' (Somers, 2000). The machine translation process is implemented via XML-DB as a kind of interlingua approach instead of the conventional structure transfer approach.
Interior penalty method for the indefinite time-harmonic Maxwell equations
Authors: Paul Houston, Ilaria Perugia, Anna Schneebeli, Dominik Sch&#x00f6;tzau
Venue: Numerische Mathematik (2005)

In this paper, we introduce and analyze the interior penalty discontinuous Galerkin method for the numerical discretization of the indefinite time-harmonic Maxwell equations in the high-frequency regime. Based on suitable duality arguments, we derive a-priori error bounds in the energy norm and the L2-norm. In particular, the error in the energy norm is shown to converge with the optimal order ** (hmin{s,&#x2113;}) with respect to the mesh size h, the polynomial degree &#x2113;, and the regularity exponent s of the analytical solution. Under additional regularity assumptions, the L2-error is shown to converge with the optimal order ** (h&#x2113;+1). The theoretical results are confirmed in a series of numerical experiments.
THE MUTUAL ADAPTATION OF TECHNOLOGY AND ORGANIZATION DURING THE IMPLEMENTATION OF AN AUTOMATED LIBRARY SYSTEM
Authors: Cynthia Lopata
Venue: ACM SIGCHI Bulletin (1991)

The project investigates the factors that influence the exploratory interactions of users with new information domains. In this situation, one of the crucial factors driving the user's behaviour is interest. We view interest as the process of responding to the significance of information. As a process it has triggering conditions, it has a duration, and there are conditions which ensure its continuation. In general, we regard a user's path through an information space as being determined by the following principle: Principle of maximal interestingness - In situations in which a user explores an information space, her route through the space is along the path of maximal interestingness.
Alternate feature location for rapid navigation using a 3D map on a mobile device
Authors: Maximino Bessa, António Coelho, Alan Chalmers
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Finding one's way around an unfamiliar city can be a major challenge. While maps can provide a very good abstract representation of our world, and a simple and efficient way to navigate within that world, they are of little use when, for example, the absence of road signs prevents us from locating where we are on the map. Mobile devices offer the potential for providing relevant 3D information to enable us to locate ourselves, rapidly navigate around an unfamiliar environment and explore it interactively. However, mobile devices are constrained by resources such as bandwidth, storage and small displays. In this paper we investigate which is the most important visual information for position location within an unfamiliar urban environment and show how we can use this knowledge to provide a perceptually high quality 3D virtual environment on existing mobile devices.
Role mining with ORCA
Authors: Jürgen Schlegelmilch, Ulrike Steffens
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

With continuously growing numbers of applications, enterprises face the problem of efficiently managing the assignment of access permissions to their users. On the one hand, security demands a tight regime on permissions; on the other hand, users need permissions to perform their tasks. Role-based access control (RBAC) has proven to be a solution to this problem but relies on a well-defined set of role definitions, a role concept for the enterprise in question. The definition of a role concept (role engineering) is a difficult task traditionally performed via interviews and workshops. However, often users already have the permissions that they need to do their jobs, and roles can be derived from these permission assignments using data mining technology, thus giving the process of role concept definition a head-start.In this paper, we present the ORCA role mining tool and its algorithm. The algorithm performs a cluster analysis on permission assignments to build a hierarchy of permission clusters and presents the results to the user in graphical form. It allows the user to interactively add expert knowledge to guide the clustering algorithm. The tool provides valuable insights into the permission structures of an enterprise and delivers an initial role hierarchy for the definition of an enterprise role concept using a bottom-up approach.
Satellite Formation, a Mobile Sensor Network in Space
Authors: Arvind Krishnamurthy, Robert Preis
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

Several currently planned space missions consist of a set of satellites flying in a formation. This enables a much higher functionality of the mission compared to missions consisting of only a single satellite. On the other hand, this introduces several new problems, especially in the handling of the formation. Besides their geometric structure, the formation of satellites also has a communication network among the satellites which is the basis for the cooperative behavior, in order to accomplish the overall aim of the mission. The sensors present in each of the satellite enable sensing and communication between the satellites and form a wireless network. This gives rise to a mobile sensor network in space and hence many challenges with it. The topology of this communication in the mobile sensor network can be a bottleneck in the operation of the formation because the transmission of information and the efficient coordination of the formation relieson this topology. This is particularly the case for a large number of satellites in the network. In this paper we study the relative stability of communicating sensor topologies as a key characteristic of the formation of satellites and their behavior as a wireless sensor network in space.
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Authors: Ming Yang, Ying Wu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearances or to dynamically select features to track. However, this idea is threatened by the risk of adaptation drift that roots in its ill-posed nature, unless good constraints are imposed. Different from most existing adaptation schemes, we enforce three novel constraints for the optimal adaptation: (1) negative data, (2) bottom-up pair-wise data constraints, and (3) adaptation dynamics. Substantializing the general adaptation problem as a subspace adaptation problem, this paper gives a closed-form solution as well as a practical iterative algorithm. Extensive experiments have shown that the proposed approach can largely alleviate adaptation drift and achieve better tracking results.
Nomad: A Security Model with Non Atomic Actions and Deadlines
Authors: Frederic Cuppens, Nora Cuppens-Boulahia, Thierry Sans
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Modelling security policies requires means to specify permissions and prohibitions. However, this is generally not sufficient to express security properties such as availability and obligations must be also considered. By contrast to permissions and prohibitions, obligations are often associated with deadlines to specify bounded time availability requirements. In this case, a violation only occurs if the obliged action is not performed before the deadline. On the other hand, when specifying high level security policies, it is convenient to consider abstract non atomic actions. Since most access control mechanisms only deal with atomic actions such as read or write, these non atomic actions must be decomposed into more basic ones. In this paper, wedefine a formal security model called Nomad to express privileges on non atomic actions. This model combines deontic and temporal logics. In Nomad, we model conditional privileges and obligations with deadlines. We also formally analyze how privileges on non atomic actions can be decomposed into more basic privileges on elementary actions.
Need for non-visual feedback with long response times in mobile HCI
Authors: Virpi Roto, Antti Oulasvirta
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

When browsing Web pages with a mobile device, the system response times are variable and much longer than on a PC. Users must repeatedly glance at the display to see when the page finally arrives, although mobility demands a Minimal Attention User Interface. We conducted a user study with 27 participants to discover the point at which visual feedback stops reaching the user in mobile context. In the study, we examined the deployment of attention during page loading to the phone vs. the environment in several different everyday mobility contexts, and compared these to the laboratory context. The first part of the page appeared on the screen typically in 11 seconds, but we found that the user's visual attention shifted away from the mobile browser usually between 4 and 8 seconds in the mobile context. In contrast, the continuous span of attention to the browser was more than 14 seconds in the laboratory condition. Based on our study results, we recommend mobile applications provide multimodal feedback for delays of more than four seconds.
Evolving car designs using model-based automated safety analysis and optimisation techniques
Authors: Yiannis Papadopoulos, Christian Grante
Venue: Journal of Systems and Software (2005)

Development processes in the automotive industry need to evolve to address increasing demands for integration of car functions over common networked infrastructures. New processes must address cost and safety concerns and maximize the potential for automation to address the problem of increasing technological complexity. In this paper, we propose a design process in which techniques for semi-automatic safety and reliability analysis of systems models are combined with multi-objective optimisation techniques to assist the gradual development of designs that can meet reliability and safety requirements and maximise profit within pragmatic development cost constraints. The proposed process relies on tools to automate some aspects of the design that we believe could be automated and thus simplified without loss of the creative input brought in the process by designers.
A constructive approach to calculate parameter ranges for systems of geometric constraints
Authors: Hilderick A. van der Meiden, Willem F. Bronsvoort
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such systems. However, because allowable parameter values are not known to the user beforehand, this is often a trial-and-error process. We present a solution for automatically determining the allowable range for parameters of geometric constraints. Considered are systems of distance and angle constraints on points in 3D that can be decomposed into triangular and tetrahedral subproblems, by which most practical situations in parametric and feature-based CAD systems can be represented. Our method uses the decomposition to find critical parameter values for which subproblems degenerate. By solving one problem instance for each interval between two subsequent critical values, the exact parameter ranges are determined for which a solution exists.