ppxscal/embedding_network huggingface dataset:
A Cell-Based Traffic Control Formulation: Strategies and Benefits of Dynamic Timing Plans
Authors: Hong K. Lo
Venue: Transportation Science (2001)

This study developed a dynamic traffic-control formulation that considers the entire Fundamental Diagram. This incorporation of the Fundamental Diagram is especially important for modeling oversaturated traffic. For this purpose, traffic is modeled after the cell-transmission model (CTM), which is a convergent numerical approximation to the hydrodynamic model. We transformed CTM to a set of mixed-integer constraints and subsequently cast the dynamic signal-control problem to a mixed-integer linear program. As a dynamic platform, the formulation is flexible in dealing with dynamic timing plans and traffic patterns. It can derive dynamic as well as fixed timing plans and address preexisting traffic conditions and time-dependent demand patterns. This study produced results to show the benefit of dynamic timing plans and demonstrated that some of the existing practice on signal coordination could be further improved.
Adaptation as Information Restriction: The Hot Stove Effect
Authors: Jerker Denrell, James G. March
Venue: Organization Science (2001)

Individuals and social systems are often portrayed as risk averse and resistant to change. Such propensities are characteristically attributed to individual, organizational, and cultural traits such as risk aversion, uncertainty-avoidance, discounting, and an unwillingness to change. This paper explores an alternative interpretation of such phenomena. We show how the reproduction of successful actions inherent in adaptive processes, such as learning and competitive selection and reproduction, results in a bias against alternatives that initially may appear to be worse than they actually are. In particular, learning and selection are biased against both risky and novel alternatives. Because the biases are products of the tendency to reproduce success that is inherent in the sequential sampling of adaptation, they are reduced whenever the reproduction of success is attenuated. In particular, when adaptation is slowed, made imprecise, or recalled less reliably, the propensity to engage in risky and new activities is increased. These protections against the error of rejecting potentially good alternatives on inadequate experiential evidence are costly, however. They increase the likelihood of persisting with alternatives that are poor in the long run as well as in the short run.
MISS: A Generic Model for MetaInformation SubSystems
Authors: José M. Martínez, Julián Cabrera, Jesús Bescós, Guillermo Cisneros, José M. Ménendez
Venue: Multimedia Tools and Applications (2003)

This paper presents an approach to a flexible model for building an indexing subsystem based on metadata: the MetaInformation Subsystem (MISS). The MISS model consists of a software architecture, a system architecture, and an information model. The software architecture relies on a model (based on four levels: database, storage retrieval, functional core, and application) used for the development of applications for information systems to search in and populate a database. The system architecture consists of a Browsing Application and a Populating Application, both built on top of a Metadata Database via the proposed software architecture. The Browsing Application is in charge of managing the user's interaction with the subsystem (navigation, search, and retrieval), whereas the Populating Application provides a mechanism to insert metadata and data views into the MISS databases. Finally, the proposed information model (the Metadata Information Model&mdash;MIM) consists of the metadata content, its structure, and the representation model, being in connection with the MPEG-7 standardisation work and providing impact to this Forum. In order to validate it, MISS has been used in the implementation of the Browsing and Retrieval System of the HYPERMEDIA ACTS 361 Project &ldquo;Continuous Audiovisual Market in Europe&rdquo; (publicly demonstrated in several workshops and in Telecom Americas 2000), obtaining very good results in terms of functionality, flexibility and reliability.
Hipótese de Smarandache: evidências, implicações e aplicações
Authors: Leonardo F. D. da Motta
Venue: Smarandache Notions Journal (2002)

Em 1993, Smarandache propôs que não hát uma velocidade limite na natureza, baseado no paradoxo EPR-Bell (Einstein, Podolsky, Rosen, Bell). Embora pareça que este paradoxo foi resolvido recentemente, ainda há várias outras evidências que nos guiam a acreditar que a hipótese de Smarandache está correta na mecânica quântica e até nas teorias de unificação. Se a hipótese de Smarandache revelarse verdadeira em qualquer circunstãncia, alguns aspectos da fisica moderna terão que se "reajustar" para concordar com a hipótese de Smarandache. Em adiçã, quando o significado da hipótese de Smarandache tornar-se totalmente entendido, uma revolução na tecnologia, especialmente nas comunicações, irá surgir.
The Effects of Network Contention on Processor Allocation Strategies
Authors: Sherry Moore, Lionel M. Ni
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.
Framework for Synthesizing Semantic-Level Indices
Authors: Ankush Mittal, Loong-Fah Cheong
Venue: Multimedia Tools and Applications (2003)

Extraction of the syntactic features is a well-defined problem thereby lending them to be exclusively employed in most of the content-based retrieval systems. However, semantic-level indices are more appealing to user as they are closer to the user's personal space. Most of the work done at semantic level is confined to a limited domain as the features developed and employed therein apply satisfactorily only to that particular domain. Scaling up such systems would inevitably result in large numbers of features. Currently, there exists a lacuna in the availability of a framework that can effectively integrate these features and furnish semantic level indices.The objective of this paper is to highlight some of the issues in the design of such a framework and to report on the status of its development. In our framework, construction of a high-level index is achieved through the synthesis of its large set of elemental features. From the large collection of these features, an image/video class is characterized by selecting automatically only a few principal features. By properly mapping the constrained multi-dimensional feature space constituted by these principal features, with the semantics of the data, it is feasible to construct high level indices. The problem remains, however, to automatically identify the principal or meaningful subset of features. This is done through the medium of Bayesian Network that discerns the data into cliques by training with pre-classified data. The Bayesian Network associates each clique of data points in the multi-dimensional feature space to one of the classes during training that can later be used for evaluating the most probable class to which that partition of feature space belongs. This framework neither requires normalization of different features or the aid of an expert knowledge base. The framework enables a stronger coupling between the feature extraction and meaningful high-level indices and yet the coupling is sufficiently domain independent, as shown by the experiments. The experiments were conducted over real video consisting of seven diverse classes and the results show its superiority over some of the standard classification tools.
Latecomer Strategies: Evidence From the Semiconductor Industry in Japan and Korea
Authors: Dong-Sung Cho, Dong-Jae Kim, Dong Kee Rhee
Venue: Organization Science (1998)

The effects of strategic order of entry on firms' performance have long been an issue in many areas of study. Past res earch efforts, however, have been concentrated mostly on first mover or early entrant advantages. To contribute to developing a theory of latecomer strategies, the authors investigate how latecomers compete successfully or even leapfrog early movers. They review previous studies on early mover advantages and disadvantages, and group the sources of such advantages or disadvantages into three areas: the firm, its market, and its competitors. The theoretical focus is how a firm converts the opportunities ste mming from entry order into performance. The authors seek to confirm and extend relevant theories by examining how late entrants have caught up with incumbent industry leaders in the global semiconductor industry. On the basis of in-depth case analysis of three Japanese and three Korean semiconductor companies, they identify and categorize successful latecomer strategies into two types: strategies for overcoming latecomer disadvantages and strategies for utilizing latecomer advantages. Focusing, thin margin or loss bearing, and volume building form the essence of strategies for overcoming disadvantages, whereas odd timing, time compression, human embodied technology transfer, benchmarking, technological leap frogging, and resource leveraging form the essence of strategies for utilizing advantages. Because many companies in Asia have had to face the reality of being latecomers, the Asian perspectives are particularly useful for studying and explicating latecomer strategies.
Deduction of a gene regulatory relationship framework from gene expression data by the application of graphical Gaussian modeling
Authors: Sachiyo Aburatani, Satoru Kuhara, Hiroyuki Toh, Katsuhisa Horimoto
Venue: Signal Processing (2003)

Recently, we developed an automatic system for deducing a framework of regulatory relationships from gene expression data on a genomic scale. One of the merits of our system is that it simultaneously performs the gene classification and the relation inference from a large amount of gene expression data by combining the graphical Gaussian modeling with standard multivariate statistical techniques. In this paper, we describe our modifications of the previous system to estimate the cluster boundaries, by setting a user-defined threshold for measuring the linear relationship between the profiles of clusters. The modified system was applied to a whole set of yeast expression profiles of 6152 genes available at a web site, and the results obtained by the present analyses were statistically evaluated by a simulation that calculates the chance probability of the inferred framework of regulatory relationships, in addition to the statistical evaluation of the clusters by a previous method. In particular, the feasibility of the modified system is demonstrated by the comparison between two frameworks inferred from two sets of clusters that were estimated by distinctive thresholds.
Evaluation of agent-based manufacturing systems based on a parallel simulator
Authors: Chin-Yin Huang, Shimon Y. Nof
Venue: Computers and Industrial Engineering (2002)

Recent research in artificial autonomous agents has paved a way to fulfill the requirements of autonomous operations in manufacturing systems in terms of planning, scheduling, control, and processing. Those manufacturing systems are also coined agent-based manufacturing systems (ABMS). However, it still lacks an evaluation tool to judge the performance of a designed ABMS. Hence, an ABMS is difficult to be accepted by users and managers, and is diffficult to be realized in the real world.Based on a developed ABMS model, this research develops a simulator on a parallel computer system. The simulator is designed to imitate the changes of the environment by the changes of incoming tasks, and to imitate the internal changes by the resource breakdowns. Besides, the autonomous, communicative, and cooperative behaviors of agents are also developed in the simulators.Cases and scenarios for ABMS are developed to apply in the simulator. The analytical results show that through the simulators, decision-makers can clearly observe the viability of each agent as well as the whole ABMS. Thus, adjustments on the ABMS design can be made accordingly and the final ABMS can successfully survive in the real world.
Laboratory exercises for a computer security course
Authors: Charles E. Frank, Gregory A. Wells
Venue: Journal of Computing Sciences in Colleges (2002)

This paper describes laboratory exercises used in a computer security course. These exercises taught students how to locate potential computer vulnerabilities. The computer security course was taught using a networked Linux laboratory. This paper explains how to obtain and install the free software used in these exercises. It also describes the design of the laboratory exercises.
Beyond Networks and Hierarchies: Latent Organizations in the U.K. Television Industry
Authors: Ken Starkey, Christopher Barnatt, Sue Tempest
Venue: Organization Science (2000)

Since the mid 1980s, organization theorists have highlighted the emergence of the networked model of organization as a response to global competition and pressures for increased market flexibility. Cultural industries have not been immune from this development. In this paper, we examine the shift from hierarchy to network in the U.K. television industry. We argue that an important result of this disaggregation is the emergence oflatent organization, groupings of individuals and teams of individuals that persist through time and are periodically drawn together for recurrent projects by network brokers who either buy in programmes for publisher-broadcasters or who draw together those artists and technicians who actually produce them. In conclusion, we note how latent organizations may become increasingly important foreffective cultural industry production, and in particular how they may provide stable points of reference and recurring work projects for those many individuals now working outside of large, vertically integrated producer-broadcasters.
Balancing Act: Learning from Organizing Practices in Cultural Industries
Authors: Joseph Lampel, Theresa Lant, Jamal Shamsie
Venue: Organization Science (2000)

The dilemmas experienced by managers in cultural industries are also to be found in a growing number of other industries where knowledge and creativity are key to sustaining competitive advantage. Firms that compete in cultural industries must deal with a combination of ambiguity and dynamism, both of which are intrinsic to goods that serve an aesthetic or expressive rather than a utilitarian purpose. Managers involved with the creation, production, marketing, and distribution of cultural goods must navigate tensions that arise from opposing imperatives that result from these industry characteristics. In this paper we outline five polarities that are shaping organizational practices in cultural industries. First, managers must reconcile expression of artistic values with the economics of mass entertainment. Second, they must seek novelty that differentiates their products without making them fundamentally different in nature from others in the same category. Third, they must analyse and address existing demand while at the same time using their imagination to extend and transform the market. Fourth, they must balance the advantages of vertically integrating diverse activities under one roof against the need to maintain creative vitality through flexible specialization. And finally, they must build creative systems to support and market cultural products but not allow the system to suppress individual inspiration, which is ultimately at the root of creating value in cultural industries.
Metacomputing: technology and applications
Authors: T. G. Typou, K. G. Margaritis
Venue: Highly parallel computaions: algorithms and applications (2001)

High performance computing deals with solving large computational problems. New and existing applications demand more and more computing resources, not found in any current computing system, be it a powerful workstation, a LAN or a single massively parallel platform. Metacomputing is an effort to utilize the overall existing inter-networked computing power. Supercomputers, parallel computers, powerful workstations, clusters as well as simple LANs may soon become part of global computing systems, i.e., metacomputers.
Computer aided fusion for algebraic program derivation
Authors: Walter Dosch, Sönke Magnussen
Venue: Nordic Journal of Computing (2001)

We present an extension of the Lübeck Transformation System LTS automating the fusion of a function with a catamorphism as a refinement step in algebraic program development. The system detects catamorphisms in constructor-based higher-order algebraic specifications and generates an axiomatisation of the composition function. As the basis we give a generalized treatment of the fusion theorem in the setting of algebraic specifications. We illustrate the approach presenting compound fusion transformations for non-free data structures.
Personal media exploration with semantic regions
Authors: Hyunmo Kang
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Computer users deal with large amount of personal media data and they often face problems in managing and exploring them. The paper presents an innovative approach, Semantic Regions that are rectangular regions directly drawn on 2D space with semantics so that their layout can form users' various mental models toward the personal media data. A prototype personal media exploring application, MediaFinder, based on the concept of Semantic Regions is presented. Usability tests will be conducted to evaluate the Semantic Regions as a personal media management model including organization, search, navigation, indexing, meaning extraction, and distribution.
A novel framework for multilevel routing considering routability and performance
Authors: Shih-Ping Lin, Yao-Wen Chang
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We propose in this paper a novel framework for multilevel routing considering both routability and performance. The two-stage multilevel framework consists of coarsening followed by uncoarsening. Unlike the previous multilevel routing, we integrate global routing, detailed routing, and resource estimation together at each level of the framework, leading to more accurate routing resource estimation during coarsening and thus facilitating the solution refinement during uncoarsening. Further, the exact routing information obtained at each level makes our framework more flexible in dealing with various routing objectives (such as crosstalk, power, etc). Experimental results show that our approach obtains significantly better routing solutions than previous works. For example, for a set of 11 commonly used benchmark circuits, our approach achieves 100% routing completion for all circuits while the previous multilevel routing, the three-level routing, and the hierarchical routing can complete routing for only 3, 0, 3 circuits, respectively. In particular, the number of routing layers used by our router is even smaller. We also have performed experiments on timing-driven routing. The results are also very promising.
Partitioning cursor movements in "point and click" tasks
Authors: Faustina Hwang
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Studies of cursor trajectories can help explain performance differences in "point and click" tasks. As users can have different difficulties with moving the cursor to a point on the screen, as compared with pressing a button to select an object, it is helpful to study the two stages of the interaction separately. This paper proposes a method of partitioning a cursor trajectory into a travel and a select phase. The movements of motion-impaired users are studied to show that, by analyzing the two phases separately, it is possible to capture aspects of movement that may otherwise be lost.
On the use of interval arithmetic in geometric branch and bound algorithms
Authors: T. M. Breuel
Venue: Pattern Recognition Letters (2003)

Branch and bound methods have become established methods for geometric matching over the last decade. This paper presents techniques that improve on previous branch and bound methods in two important ways: they guarantee reliable solutions even in the presence of numerical roundoff error, and they eliminate the need to derive bounding functions manually. These new techniques are compared experimentally with recognition-by-alignment and previous branch and bound techniques on geometric matching problems. Novel methods for non-linear baseline finding and globally optimal robust linear regression using these techniques are described.
Data abstractions for decision tree induction
Authors: Yoshimitsu Kudoh, Makoto Haraguchi, Yoshiaki Okubo
Venue: Theoretical Computer Science (2003)

When descriptions of data values in a database are too concrete or too detailed, the computational complexity needed to discover useful knowledge from the database will be generally increased. Furthermore, discovered knowledge tends to become complicated. A notion of data abstraction seems useful to resolve this kind of problems, as we obtain a smaller and more general database after the abstraction, from which we can quickly extract more abstract knowledge that is expected to be easier to understand. In general, however, since there exist several possible abstractions, we have to carefully select one according to which the original database is generalized. An inadequate selection would make the accuracy of extracted knowledge worse.From this point of view, we propose in this paper a method of selecting an appropriate abstraction from possible ones, assuming that our task is to construct a decision tree from a relational database. Suppose that, for each attribute in a relational database, we have a class of possible abstractions for the attribute values. As an appropriate abstraction for each attribute, we prefer an abstraction such that, even after the abstraction, the distribution of target classes necessary to perform our classification task can be preserved within an acceptable error range given by user.By the selected abstractions, the original database can be transformed into a small generalized database written in abstract values. Therefore, it would be expected that, from the generalized database, we can construct a decision tree whose size is much smaller than one constructed from the original database. Furthermore, such a size reduction can be justified under some theoretical assumptions. The appropriateness of abstraction is precisely defined in terms of the standard information theory. Therefore, we call our abstraction framework Information Theoretical Abstraction.We show some experimental results obtained by a system ITA that is an implementation of our abstraction method. From those results, it is verified that our method is very effective in reducing the size of detected decision tree without making classification errors so worse.