ppxscal/embedding_network huggingface dataset:
Reconfigurable SoC design with hierarchical FSM and synchronous dataflow model
Authors: Sunghyun Lee, Sungjoo Yoo, Kiyoung Choi
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation in system representation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short HFSM-SDF model. In reconfigurable SoC design with the HFSM-SDF model, the problem of configuration scheduling is challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex flow (in the HFSM), and complex schedules of SDF actor firing. Thus, compile-time static configuration scheduling may not efficiently hide configuration latency.To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configuration, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before the execution of state transition of top FSM. After obtaining the order information in a queue called ready configuration queue, we execute the state transition. During the execution, whenever there is new available FPGA resource, a new configuration is selected from the queue and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder design and obtained up to 21.8% improvement in system runtime with a negligible overhead of runtime (1.4%) and memory usage (0.94%).
A systematic methodology for the application of data transfer and storage optimizing code transformations for power consumption and execution time reduction in realizations of multimedia algorithms on programmable processors
Authors: Konstantinos Masselos, Francky Catthoor, Costas E. Goutis, Hugo Deman
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

A systematic methodology for the reduction of the power consumption and the execution time in realizations of multimedia applications on programmable processors is proposed. The methodology is mainly based on the application of data transfer and storage optimizing code transformations to a high-level description of the target algorithm. Application of the code transformations according to the proposed order moves the main part of the memory accesses from the large background memories (lying possibly off-chip) to smaller ones (on-chip) or even to foreground storage. Data cache performance is improved as well. In this way the power consumption in the data memory hierarchy of the target processor and in the related interconnect, which forms a significant part of the total power budget of the system, is heavily reduced. Execution time and the power consumption due to instruction storage and transfers are reduced as well after the application of the proposed methodology. Experimental results from real-life applications prove the effectiveness of the proposed methodology.
The Alliances of Spin-Offs Versus Start-Ups: Social Ties in the Genesis of Post-Soviet Alliances
Authors: Ram Gopalan, Kalyan T. Talluri, Judith Sedaitis
Venue: Organization Science (1998)

This paper links the alliance strategy of emergent firms to the structural relations in the network of new firm organizers. Data gathered in Russia from 1991 to 1993 on nine post-Soviet commodity exchange markets demonstrate how the difference in internal social structure between spin-off and startup exchanges shapes the strategy of their inter-firm networks and initial performance. The way in which managers come together structures their diversity and openness to the outside environment. In turn, the social structure internal to the firm affects the ran ge and scope of their ties to other organizations. I show how the high range of overlap among the ties between spin-off founders has a more concentrated connection to the outside environment than the exchanges created by more loosely-linked startup founders. The relational costs of the more concentrated ties increases the cost of search, however, it lowers the cost of malfeasance. Thus, the model suggested proposes that the relative advantage of investing in relational capital is a double-edged sword which poses constraints along with its particular advantages. Finally, the model also brings to question the relative merits of concentrated alliances supposedly advantageous to new firms in particular by suggesting that conditions of transition and institutional instability may under-cut the relative advantage of familiarity and specialization found in Western settings.
Learning social behaviors without sensing
Authors: Anand Panangadan, Michael G. Dyer
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

A learning algorithm is presented that enables agents that do not have the ability to sense other agents to adapt its behaviors (that were learned in a single agent environment) to novel situations (deadlocks arising from existing in an autonomous multi-agent system). This adaptation takes place as the agent continues to perform its construction task. When the agents are confined to narrow spaces, this learned behavior leads to a "bucket brigade". The algorithm also learns the pattern of activations on its spatial map that is associated with deadlocks and the new behaviors are exhibited when this pattern is later observed.
A general framework for ordering fuzzy sets
Authors: Ulrich Bodenhofer
Venue: Technologies for constructing intelligent systems: Tasks (2002)

Orderings and rankings of fuzzy sets have turned out to play a fundamental role in various disciplines. Throughout the previous 25 years, a lot a different approaches to this issue have been introduced, ranging from rather simple ones to quite exotic ones. The aim of this paper is to present a new framework for comparing fuzzy sets with respect to a general class of fuzzy orderings. This approach includes several known techniques based on generalizing the crisp linear ordering of real numbers by means of the extension principle, however, in its general form, it is applicable to any fuzzy subsets of any kind of universe for which a fuzzy ordering is known - no matter whether linear or partial.
Quasilinear elliptic problems interacting with its asymptotic spectrum
Authors: David Arcoya, José Carmona
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

Under suitable assumptions on the coefficients of the matrix A(x, u) and on the nonlinear term f(x, u), we study the quasilinear problem in bounded domains Ω ⊂ RN -div(A(x, u)∇u) = f(x, u), x ∈ Ω, u = 0, x∈∂Ω. We extend the semilinear results of Landesman-Lazer (J. Math. Mech. 19 (1970) 609) and of Ambrosetti-Prodi (in: A Primer on Nonlinear Analysis, Cambridge University Press, Cambridge, 1993) for resonant problems. The existence of positive solution is also considered extending to the quasilinear case the classical result by Ambrosetti-Rabinowitz (J. Funct. Anal. 14 (1973) 349). In this case, the result is obtained as a corollary of the previous multiplicity result in the Ambrosetti-Prodi framework.
Handling heterogeneity in networked virtual environments
Authors: Helmuth Trefftz, Ivan Marsic, Michael Zyda
Venue: Presence: Teleoperators and Virtual Environments (2003)

The availability of inexpensive and powerful graphics cards as well as fast Internet connections make networked virtual environments viable for millions of users and many new applications. It is therefore necessary to cope with the growing heterogeneity that arises from differences in computing power, network speed, and users' preferences. This paper describes an architecture that accommodates the heterogeneity while allowing a manager to define systemwide policies. One of the main objectives of our scheme is to allow slower nodes to participate in the session by preventing fast nodes from flooding slow nodes with too many messages. Policies and users' preferences can be expressed as simple linear equations forming a model that describes the system as a whole as well as its individual components. When solutions to this model are mapped back to the problem domain, viable solutions that accommodate heterogeneity and system policies are obtained. For example, slower nodes may receive less frequent updates than faster ones for one or several information streams. The results of our experiments with a proof-of-concept system are described.
Improving cache hit ratio by extended referencing cache lines
Authors: Chit-Te Wang, Nelson Passos
Venue: Journal of Computing Sciences in Colleges (2003)

Cache memory has been proved to narrow the latency between CPU and main memory. In this study, an algorithm is presented to improve the cache-hit ratio by using an extension to the locality of references (spatial and temporal). The new algorithm extends the reference flagging to additional data lines already residing in the cache besides the one referenced by the processor. It is an extension to a two-way set associative mapping function working in conjunction with a LRU replacement technique. Experiments conducted with memory access traces of running an electrical circuit simulator showed a slight improvement over the standard LRU technique, justifying the use of the new algorithm.
Get your product used in anger!: (before assuming you understand its requirements)
Authors: Carl Myhill
Venue: interactions (2003)

Some months ago, Carl wrote to an email list about a bike light and a new requirement that he had discovered after using the light "in anger." "Anger!" I thought. "What a perfect topic for The Whiteboard! Use a product, get mad about its design, and take advantage of your anger to derive important but hidden requirements." It was only on receiving Carl's first draft that I discovered he wasn't talking about anger at all. In the UK, to use something "in anger" means to use it for real. But in fact, Carl does get angry about bad design. And I think that's a good thing.---Elizabeth Buie
A Comparative Study of Distributed Learning Environments on Learning Outcomes
Authors: Maryam Alavi, George M. Marakas, Youngjin Yoo
Venue: Information Systems Research (2002)

Advances in information and communication technologies have fueled rapid growth in the popularity of technology-supported distributed learning (DL). Many educational institutions, both academic and corporate, have undertaken initiatives that leverage the myriad of available DL technologies. Despite their rapid growth in popularity, however, alternative technologies for DL are seldom systematically evaluated for learning efficacy. Considering the increasing range of information and communication technologies available for the development of DL environments, we believe it is paramount for studies to compare the relative learning outcomes of various technologies.In this research, we employed a quasi-experimental field study approach to investigate the relative learning effectiveness of two collaborative DL environments in the context of an executive development program. We also adopted a framework of hierarchical characteristics of group support system (GSS) technologies, outlined by DeSanctis and Gallupe (1987), as the basis for characterizing the two DL environments.One DL environment employed a simple e-mail and listserv capability while the other used a sophisticated GSS (herein referred to as Beta system). Interestingly, the learning outcome of the e-mail environment was higher than the learning outcome of the more sophisticated GSS environment. The post-hoc analysis of the electronic messages indicated that the students in groups using the e-mail system exchanged a higher percentage of messages related to the learning task. The Beta system users exchanged a higher level of technology sense-making messages. No significant difference was observed in the students' satisfaction with the learning process under the two DL environments.
GLUMM: an application programming interface for multi-screen programming in a windows environment
Authors: Daniel C. Cliburn
Venue: Journal of Computing Sciences in Colleges (2003)

The state of the art in Virtual Reality (VR) and Immersive Visualization software today often requires multiple screens or display devices. This additional screen space can offer many views into the same scene or provide an abundance of screen space for maximum display of information. There are many APIs in existence for development of software that can take advantage of multiple screens, however, few support development in a Windows environment (most are for some variant of the UNIX operating system). In addition the specialized hardware for which many of these APIs are designed is very expensive (these hardware systems can be priced at more than one million dollars). The standard Windows PC is extremely cheap in comparison, so there is a push in today's VR and visualization community to find PC solutions to hardware requirements. GLUT (Graphics Library Utility Toolkit) is a simple window manager and event-handler used by many institutions in conjunction with OpenGL for teaching introductory graphics programming. In this paper, I discuss GLUMM (Graphics Library Utility for Multi-Monitors) a GLUT-like API for development of multi-monitor applications on one PC with multiple graphics boards (or a single board with multiple heads) supporting OpenGL and running Windows 2000 or higher. I believe the step from single display graphics programming to multi-monitor applications is much easier when done with an API similar to that which students are taught in their first graphics course. GLUMM makes it possible to develop multi-monitor applications with little prior graphics programming experience, and for undergraduate students to get a feel for state of the art visualization software in small school settings.
Consistent database sampling as a database prototyping approach
Authors: Jesús Bisbal, Jane Grimson
Venue: Journal of Software Maintenance: Research and Practice (2002)

Requirements elicitation has been reported to be the stage of software development when errors have the most expensive consequences. Users usually find it difficult to articulate a consistent and complete set of requirements at the beginning of a development project. Prototyping is considered a powerful technique to case this problem by exposing a partial implementation of the software system to the user, who can then identify required modifications. When prototypiug data-intensive applications a so-called prototype database is needed.This paper investigates how a prototype database can be built. Two different approaches are analysed, namely test databases and sample databases; the former populates the resulting database with synthetic values, while the latter uses data values from an existing database. The application areas that require prototype databases, in addition to requirements analysis, are also identified. The paper reports on existing research into the construction of both types of prototype databases, and indicates to which type of application area each is best suited. This paper advocates for the use of sample databases when an operational database is available, as is commonly the case in software maintenance and evolution. Domain-relevant data values and integrity constraints will produce a prototype database which will support the information system development process better than synthetic data. The process of extracting a sample database is also investigated.
Computational grids in action: the national fusion collaboratory
Authors: K. Keahey, T. Fredian, Q. Peng, D. P. Schissel, M. Thompson, I. Foster, M. Greenwald, D. McCune
Venue: Future Generation Computer Systems (2002)

The National Fusion Collaboratory (NFC) project was created to advance scientific understanding and innovation in magnetic fusion research by enabling more efficient use of existing experimental facilities through more effective integration of experiment, theory, and modeling. To achieve this objective, NFC introduced the concept of "network services", which build on top of computational Grids, and provide Fusion codes, together with their maintenance and hardware resources as a service to the community. This mode of operation requires the development of new authorization and enforcement capabilities. In addition, the nature of Fusion experiments places strident quality of service requirements on codes run during the experimental cycle. In this paper, we describe Grid computing requirements of the Fusion community, and present our first experiments in meeting those requirements.
Near-Optimal Pricing and Replenishment Strategies for a Retail/Distribution System
Authors: Fangruo Chen, Awi Federgruen, Yu-Sheng Zheng
Venue: Operations Research (2001)

This paper integrates pricing and replenishment decisions for the following prototypical two-echelon distribution system with deterministic demands. A supplier distributes a single product to multiple retailers, who in turn sell it to consumers. The retailers serve geographically dispersed, heterogeneous markets. The demand in each retail market arrives continuously at a constant rate, which is a general decreasing function of the retail price in the market. The supplier replenishes its inventory through orders (purchases, production runs) from a source with ample capacity. The retailers replenish their inventories from the supplier. We develop efficient algorithms to determine optimal pricing and replenishment strategies for the following three channel structures. The first is the vertically integrated channel, where the system-wide pricing and replenishment strategies are determined by a central planner whose objective is to maximize the system-wide profits. The second structure is that of a vertically integrated channel in which pricing and operational decisions are made sequentially by separate functional departments. The third channel structure is decentralized, i.e., the supplier and the retailers are independent, profit-maximizing firms with the supplier acting as a Stackelberg game leader. We apply our algorithms to a set of numerical examples to quantify the supply chain inefficiencies due to functional segregation or uncoordinated decision making in a decentralized channel. We also gain insight into systematic differences in the associated pricing and operational patterns.
Combining KADS with ZEUS to Develop a Multi-Agent E-Commerce Application
Authors: Darryl N. Davis, Yuan Luo, Kecheng Liu
Venue: Electronic Commerce Research (2003)

A KADS based requirement analysis for the management of stock trading portfolios is presented. This provides a theoretical foundation for a stock trading system. This system is designed around portfolio management tasks that include eliciting user profiles, collecting information on the user's portfolio position, monitoring the environment on behalf of the user, and making decision suggestions to meet the user's investment goals. The requirement analysis defines a framework for a Multi-Agent System for Stock Trading (MASST). Experiments in task decomposition and agent interaction using a partially implemented system are described.
The ordered weighted Geometric operator: properties and application in MCDM problems
Authors: Francisco Chiclana, Francisco Herrera, Enrique Herrera-Viedma
Venue: Technologies for constructing intelligent systems: tools (2002)

The aim of this paper is to present the Ordered Weighted Geometric (OWG) operator. The OWG operator is based on the geometric mean and the OWA operator. It is a fuzzy majority guided aggregation operator proposed to aggregate information given on a ratio scale. Therefore, it allows us to incorporate the concept of fuzzy majority in problems where the information is provided using a ratio scale. Its properties are studied and an application for multicriteria decision making problems with multiplicative preference relations is presented [1].
Fuzzy sets from a mathematical-naïve point of view
Authors: E. Trillas, C. Alsina
Venue: Technologies for constructing intelligent systems: tools (2002)

This paper introduces, in a naïve style, a symbolic and axiomatic generalization of Set Theory, the Loose-Set Theory, as a framework for the Standard Theories of Fuzzy Sets. Those theories are placed inside Set Theory and, among them, the case of Functionally Expressible Loose-Set Theories are distinguished as isomorphic to a very general Fuzzy Set Theory.
A two-step explicit P-stable method for solving second order initial value problems
Authors: Qinghong Li, Xinyuan Wu
Venue: Applied Mathematics and Computation (2003)

The conceptions of periodicity interval and P-stability were introduced by Lambert and Watson [J. Inst. Math. Appl. 18 (1976) 189] in connection with multistep methods for second order initial value problems. This paper presents a new two-step explicit P- stable method of order two for solving initial value problems of second order ordinary differential equations. Based on a special vector operation, the method can be extended to be vector applicable.
Analytical determination of limit-cycle pollutant concentrations in small tidal embayments
Authors: R. W. Barber, M. J. Wearing
Venue: Development and application of computer techniques to environmental studies (2002)

This paper describes the development of a novel mathematical model for predicting the water quality response of small tidal harbours and marinas which are subjected to a continuous release of conservative pollutant. The model is based upon a 'tidal prism' or 'zero-dimensional' approach and uses a simple analytical technique to predict the periodic variations in pollutant concentration. The mathematical model provides a viable and computationally inexpensive alternative to conventional multi-dimensional pollution transport simulations and offers an insight into the interrelationship between the main physical parameters which govern the dispersion of pollution from a tidal harbour.Predictions from the analytical formulation are compared with experimental pollution data from a 1:400 scale laboratory model of a generic square harbour. The results indicate that the tidal prism approach offers a simple yet robust method of determining the water quality response of well-mixed tidal basins.
Optimizing Rhenania's Mail-Order Business Through Dynamic Multilevel Modeling (DMLM)
Authors: Ralf Elsner, Manfred Krafft, Arnd Huchzermeier
Venue: Interfaces (2003)

Rhenania, a German direct mail-order company, turned its catalog mailing practices around within one year and consequently moved up in market position from number 5 to number 2. A dynamic multilevel modeling (DMLM) approach uses elasticities to determine the optimal frequency of catalog mailings, a customer-segmentation approach allows for optimization of mailings, and a recency, frequency, monetary-value (RFM) segmentation in combination with a chi-square automatic interaction detection (CHAID) algorithm determines when customers should receive a reactivation package--as opposed to a catalog--to optimize mailing efficiency further. The DMLM approach was so effective that Rhenania acquired two competitors (one a subdivision of Springer Verlag).