ppxscal/embedding_network huggingface dataset:
Vocal communication of emotion: a review of research paradigms
Authors: Klaus R. Scherer
Venue: Speech Communication (2003)

The current state of research on emotion effects on voice and speech is reviewed and issues for future research efforts are discussed. In particular, it is suggested to use the Brunswikian lens model as a base for research on the vocal communication of emotion. This approach allows one to model the complete process, including both encoding (expression), transmission, and decoding (impression) of vocal emotion communication. Special emphasis is placed on the conceptualization and operationalization of the major elements of the model (i.e., the speaker's emotional state, the listener's attribution, and the mediating acoustic cues). In addition, the advantages and disadvantages of research paradigms for the induction or observation of emotional expression in voice and speech and the experimental manipulation of vocal cues are discussed, using pertinent examples drawn from past and present research.
Optimal Integer Solutions to Industrial Cutting Stock Problems
Authors: Zeger Degraeve, Linus Schrage
Venue: INFORMS Journal on Computing (1999)

The "textbook" treatment of the cutting stock problem, using a method termed column generation, solves the problem as if one is allowed to use fractional amounts of patterns. In practice, one can typically run only an integer quantity of a pattern. Dyckhoff was the first to propose an integer linear programming formulation for the problem of getting a guaranteed global optimum to cutting stock problems under the integrality requirement. We describe and test an extension of a method proposed by Degraeve for embedding a column generation procedure within branch and bound. We show that our algorithm is quite general. It can easily cope with various combinations of real world complications, such as 1) upper bounds on the amount by which the demand may be oversatisfied, 2) a limit on maximum waste allowed in each pattern, and 3) a limit on the maximum number of knives in the cutting patterns. We validate our approach using both industrial data sets from the paper industry and generated data sets. The performance of the algorithm is compared with Dyckhoffs formulation.
Graph multidimensional scaling with self-organizing maps
Authors: Eric Bonabeau
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

Self-organizing maps (SOM) are unsupervised, competitive neural networks used to project high-dimensional data onto a low-dimensional space. In this paper it is shown that SOM can be used to perform multidimensional scaling (MDS) on graphs. The SOM-based approach is applied to two families of random graphs and three real-world networks.
Discovery point: enhancing the museum experience with technology
Authors: Marianne Berkovich, Jenna Date, Rachael Keeler, Marti Louw, Maureen O' Toole
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The Discovery Point prototype allows art museum visitors to hear stories about a work of art without burdening them with lengthy commentary. It is simple and compact; it has only four buttons and can be worn around the neck. It is a nearly invisible addition to the museum experience, but one that fills the need to deliver the right amount of information to visitors. To develop this concept, we observed and interviewed visitors, constructed a prototype, and then evaluated that prototype through two rounds of user tests at the museum.
An Empirical Examination of the Concern for Information Privacy Instrument
Authors: Kathy A. Stewart, Albert H. Segars
Venue: Information Systems Research (2002)

The arrival of the ?information age? holds great promise in terms of providing organizations with access to a wealth of information stores. However, the free exchange of electronic information also brings the threat of providing easy, and many times unwanted, access to personal information. Given the potential backlash of consumers, it is imperative that both researchers and practitioners understand the nature of consumers' concern for information privacy and accurately model the construct within evolving research and business contexts. Drawing upon a sample of 355 consumers and working within the framework of confirmatory factor analysis, this study examines the factor structure of the concern for information privacy (CFIP) instrument posited by Smith et al. (1996). Consistent with prior findings, the results suggest that each dimension of this instrument is reliable and distinct. However, the results also suggest that CFIP may be more parsimoniously represented as a higher-order factor structure rather than a correlated set of first-order factors. The implication of these results is that each dimension of CFIP as well as the supra dimension derived from the associations among dimensions are important in capturing CFIP and associating the construct to other important antecedents and consequences.
Smarandache cosets
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache notions (2002)

This paper aims to study the Smarandache cosets and derive some interesting results about them. We prove the classical Lagranges theorem for Smarandache semigroup is not true and that there does not exist a one-to-one correspondence between any two right cosets. We also show that the classical theorems cannot be extended to all Smarandache semigroups. This leads to the definition of Smarandache Lagrange semigroup, Smarandache p Sylow subgroup and Smarandache Cauchy elements. Further if we restrict ourselves to the subgroup of the Smarandache semigroup all results would follow trivially hence the Smarandache coset would become a trivial definition.
Ontologies for Enterprise Knowledge Management
Authors: Alexander Maedche, Boris Motik, Ljiljana Stojanovic, Rudi Studer, Raphael Volz
Venue: IEEE Intelligent Systems (2003)

Ontologies are a key technology for enabling semantics-driven knowledge processing, and it is widely accepted that the next generation of knowledge management system will rely on conceptual models in the form of ontologies. Unfortunately, the development of real-world enterprise-wide ontology-based knowledge management systems is still in an early stage. The authors present an integrated enterprise knowledge management architecture developed within the Ontologging project dealing with several challenges related to applying ontologies in real-world environments. They focus on two important ontology management problemsýnamely, supporting multiple ontologies and managing ontology evolution.
A general model for predicting the environmental impact of urban transportation
Authors: F. Calvino, M. La Gennusa, G. Rizzo, G. Scaccianoce
Venue: Development and application of computer techniques to environmental studies (2002)

In this paper a generalised model is described for the analysis of the pollutant substances released in the atmosphere by urban transportation means. It essentially requires data referring to the running transportation fleet, year by year, that are generally on disposal of the local administrators through official data-bases. Pollutant emissions are here taken into account by means of the algorithms provided by the COPERT methodology, that applies to many European countries.The method, by means of a suitable statistical analysis of data concerning the running car fleet, allows also the definition of an useful indicator, that is the "yearly average vehicle", that can be assumed as representative of the average pollutant emissions of a given urban context. This indicator can be adopted for suitably ranking the environmental effects produced by different policy options concerning the transportation sector.
Hierarchical Scheduling Windows
Authors: Edward Brekelbaum, Jeff Rupley, Chris Wilkerson, Bryan Black
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Large scheduling windows are an effective mechanism for increasing microprocessor performance through the extraction of instruction level parallelism. Current techniques do not scale effectively for very large windows, leading to slow wakeup and select logic as well as large complicated bypass networks. This paper introduces a new instruction scheduler implementation, referred to as Hierarchical Scheduling Windows or HSW, which exploits latency tolerant instructions in order to reduce implementation complexity. HSW yields a very large instruction window that tolerates wakeup, select, and bypass latency, while extracting significant far-flung ILP.Results: It is shown that HSW loses <0.5% performance per additional cycle of bypass/select/wakeup latency as compared to a monolithic window that loses ~5% per additional cycle. Also, HSW achieves the performance of traditional implementations with only 1/3 to 1/2 the number of entries in the critical timing path.
Synthesis of customized loop caches for core-based embedded systems
Authors: Susan Cotterell, Frank Vahid
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Embedded system programs tend to spend much time in small loops. Introducing a very small loop cache into the instruction memory hierarchy has thus been shown to substantially reduce instruction fetch energy. However, loop caches come in many sizes and variations -- using the configuration best on the average may actually result in worsened energy for a specific program. We therefore introduce a loop cache exploration tool that analyzes a particular program's profile, rapidly explores the possible configurations, and generates the configuration with the greatest power savings. We introduce a simulation-based approach and show the good energy savings that a customized loop cache yields. We also introduce a fast estimation-based approach that obtains nearly the same results in seconds rather than tens of minutes or hours.
On the facets of the simple plant location packing polytope
Authors: Lázaro Cánovas, Mercedes Landete, Alfredo Marín
Venue: Discrete Applied Mathematics (2002)

We introduce new classes of facet-defining inequalities for the polytope Ppd associated with the set packing formulation of the simple plant location problem (SPLP) with p plants and d destinations. The inequalities are obtained by identifying subgraphs of the intersection graph G(p,d) of SPLP that are facet-defining, and lifting their associated facets if it is necessary. To this end, we find subfamilies of previously known structured families of facet-defining graphs, like fans and wheels, inside G(p,d). We also characterize a class of facets of SPLP and summarize the previous polyhedral results on this problem.
Preparing new instructors to teach college mathematics courses: an objective-based teaching laboratory
Authors: Michael A. Brilleslyper
Venue: PRIMUS: problems, resources, and issues in mathematics undergraduate studies (2002)

This paper discusses the teaching preparation program for new instructors of mathematics at the U. S. Air Force Academy. The program is structured into a series of five practice lessons each focused on particular aspects of effective teaching. In addition, participant feedback from the program is summarized.
Investigating Dynamic Multifirm Market Interactions in Price and Advertising
Authors: Naufel J. Vilcassim, Vrinda Kadiyali, Pradeep K. Chintagunta
Venue: Management Science (1999)

Diagnosing the nature and magnitu de of competitive interactions among firms is important for developing effective marketing strategies. In this paper, we formulate a game-theoretic model of firm interaction to analyze the dynamic price and advertising competition among firms in a given p roduct market. Firm (or brand) level demand functions account for the contemporaneous and carry-over effects of these marketing activities, and also allow for the effects of competitor actions. Firms take into consideration the actions of their rivals, as well as their own demand and cost functions (both production and advertising) when determining the profit-maximizing price and advertising levels. Our formulation enables us to quantify not only the direction and magnitude of competitive reactions, but also to identify the underlying form of market conduct that generates the particular pattern of interaction. We specify and estimate a fully structural econometric model for three firms constituting a distinct sub-market within a personal-care product category. We estimate the demand and competitive interaction parameters, as well as the production and advertising cost functions for each firm. We then derive implications for competitive interactions and market structure. Interestingly, we find that while firms seem to compete on advertising, they price cooperatively, thereby enhancing their price-cost margins.
Independence concepts for belief functions
Authors: Boutheina Ben Yaghlane, Philippe Smets, Khaled Mellouli
Venue: Technologies for constructing intelligent systems: tools (2002)

In this paper, we try to study the independence concept for belief functions theory, as applied to one interpretation of this theory called the transferable belief model (TBM). In this context, two new results are given in this paper : first, the concept of belief function independence has different intuitive meaning which are non-interactivity, irrelevance and doxastic independence, second, the concepts of non-interactivity and independence are identical under a new property called irrelevance preservation under Dempster's rule of combination.
Multi-dimensional interleaving for time-and-memory design optimization
Authors: N. L. Passes, E. H.-M. Sha, Liang-Fang Chao
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents a novel optimization technique for the design of application specific integrated circuits dedicated to perform iterative or recursive time-critical sections of multi-dimensional problems, such as image processing applications. These sections are modeled as cyclic multi-dimensional data flow graphs (MDFGs). This new technique, called multi-dimensional interleaving consists of an expansion and compression of the iteration space while considering memory requirements. It guarantees that all functional elements of a circuitry can be executed simultaneously, and no additional memory queues proportional to the problem size are required. The algorithm runs in O(|E|) time, where E is the set of edges of the MDFG representing the circuit.
Electrical characteristics of diodes fabricated with organic semiconductors
Authors: Guirong Liang, Tianhong Cui, Kody Varahramyan
Venue: Microelectronic Engineering (2003)

Organic diodes have been fabricated using 1,4,5,8-naphthalene-tetracarboxylic-dianhydride (NTCDA), poly(3,4-ethylenedioxythiophene) (PEDT), doped with poly(styrenesulfonate) (PSS) and polypyrrole (PPy) by simple and low-cost spin coating and thermal evaporation techniques. The current-voltage (I-V) characteristics have been investigated at room temperature, showing the breakdown voltages of about 9 V and the rectification ratios in excess of 4.1 × 103 for both NTCDA/PPy and NTCDA/(PEDT/PSS) diodes. The significant influence of acetone treatment on I-V characteristics is observed for NTCDA/PPy diodes.
Faster than light?
Authors: Felice Russo
Venue: Smarandache Notions Journal (2002)

The hypothesis formulated by Smarandache on the possibility that no barriers exist in the Universe for an object to travel at any speed is here shortly analyzed.
Augmented geophysical data interpretation through automated velocity picking in semblance velocity images
Authors: J. Ross Beveridge, Charlie Ross, Darrell Whitley, Barry Fish
Venue: Machine Vision and Applications (2002)

Velocity picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be expressed as a 2D color semblance velocity image. Currently, humans pick velocities by looking at the semblance velocity image; this process can take days or even weeks to complete for a seismic survey. The problem can be posed as a geometric feature-matching problem. A feature extraction algorithm can recognize islands (peaks) of maximum semblance in the semblance velocity image: a heuristic combinatorial matching process can then be used to find a subset of peaks that maximizes the coherence metric. The peaks define a polyline through the image, and coherence is measured in terms of the summed velocity under the polyline and the smoothness of the polyline. Our best algorithm includes a constraint favoring solutions near the median solution for the local area under consideration. First, each image is processed independently. Then, a second pass of optimization includes proximity to the median as an additional optimization criterion. Our results are similar to those produced by human experts.
Designing human-computer interfaces for quadriplegic people
Authors: Constantine E. Steriadis, Philip Constantinou
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2003)

The need for participation in an emerging Information Society has led to several research efforts for designing accessibility solutions for disabled people. In this paper we present a method for developing Human-Computer Interfaces (HCIs) for quadriplegic people in modern programming environments. The presented method accommodates the design of scanning interfaces with modern programming tools, leading to flexible interfaces with improved appearance and it is based on the use of specially designed software objects called "wifsids" (Widgets For Single-switch Input Devices). The wifsid structure is demonstrated and 4 types of wifsids are analyzed. Developed software applications are to be operated by single-switch activations that are captured through the wifsids, with the employment of several modes of the scanning technique. We also demonstrate the "Autonomia" software application, that has been developed according to the specific methodology. The basic snapshots of this application are analyzed, in order to demonstrate how the wifsids cooperate with the scanning process in a user-friendly environment that enables a quadriplegic person to access an ordinary computer system.
ICENI: an open grid service architecture implemented with Jini
Authors: Nathalie Furmento, William Lee, Anthony Mayer, Steven Newhouse, John Darlington
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

The move towards Service Grids, where services are composed to meet the requirements of a user community within constraints specified by the resource provider, present many challenges to service provision and description. To support our research activities in the autonomous composition of services to form a Semantic Service Grid we describe the adoption within ICENI of web services to enable interoperability with the recently proposed Open Grid Services Architecture.
Replication as Strategy
Authors: Sidney G. Winter, Gabriel Szulanski
Venue: Organization Science (2001)

Replication, a familiar phenomenon sometimes referred to as the "McDonalds approach," entails the creation and operation of a large number of similar outlets that deliver a product or perform a service. Companies pursuing this strategy are now active in over 60 industries. Although replicators are becoming one of the dominant organizational forms of our time, they have been neglected by scholars interested in organizations. As a result of this neglect, replication is typically conceptualized as little more than the exploitation of a simple business formula. Such a view clouds the strategic subtlety of replication by sidestepping the exploration efforts to uncover and develop the best business model as well as the ongoing assessment that precedes large-scale replication of it. Empirical evidence supports an alternative view of replication strategy as a process that involves a regime of exploration in which the business model is created and refined, followed by a phase of exploitation in which the business model is stabilized and leveraged through large-scale replication.In this paper we present the key elements of a theory of replication strategy. We discuss key aspects of a replication strategy, namely the broad scope of knowledge transfer and the role of the central organization, and the analytical concepts of template and Arrow core as a preamble for specifying hypotheses about the conditions under which a replication strategy is more likely to succeed in a competitive setting. Replication strategy provides unusually transparent examples of the process of leveraging knowledge assets; we exploit this in our concluding discussion.
Dense linear manifolds of monsters
Authors: Luis Bernal-González, María Del Carmen Calderón-Moreno
Venue: Journal of Approximation Theory (2002)

In this paper the new concept of totally omnipresent operators is introduced. These operators act on the space of holomorphic functions of a domain in the complex plane. The concept is more restrictive than that of strongly omnipresent operators, also introduced by the authors in an earlier work, and both of them are related to the existence of functions whose images under such operators exhibit an extremely wild behaviour near the boundary. Sufficient conditions for an operator to be totally omnipresent as well as several outstanding examples are provided. After extending a statement of the first author about the existence of large linear manifolds of hypercyclic vectors for a sequence of suitable continuous linear mappings, it is shown that there is a dense linear manifold of holomorphic monsters in the sense of Luh, so completing earlier nice results due to Luh and Grosse-Erdmann.
A language for implementing parallel and distributed systems using asynchronous point-to-point communication
Authors: A. S. Bavan, E. Illingworth
Venue: Information processing and technology (2001)

LIPS (Language for Implementing Parallel Systems) is a paxallel/distdbuted message passing language that promotes the separation of communication from the necessary computation by using a technique based on a modified form of the calculus of communicating systems by Milner [20,21]. The approach adopted here is to define a network of dedicated communication channels for data exchange in LIPS-compliant programs, thus promoting portability between different computing platforms. This has also permitted the use of a modified SCCS[10,19] notation to formulate a design pattern based on a framework of four system design rules to guarantee reliable point-to-point intercommunication between LIPS nodes. The results achieved using this design pattern allow the development of programs that eliminate the likelihood of deadlock conditions with the minimum of software support tools. The LIPS nodes that make up a program are reusable and allow the dynamic creation of interconnected programs for performing distributed computation using a plug and play approach to achieve an optimum network performance.