ppxscal/embedding_network huggingface dataset:
Construction and Analysis of Artificial Stock Markets Using ADG; Automatically Defined Groups
Authors: Akira Hara, Tomoharu Nagao
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

With the aim of analyzing the mechanism of the stock price change, we construct an artificial stock market composed of multiple agents whose investment strategies are represented by tree-shaped programs.The market is optimized by using a Genetic Programming so that the change of its stock price resembles that of "real "stock market statistically.In order to perform an efficient optimization and to analyze agents 'behavior easily, we use ADG; Automatically Defined Groups previously proposed by authors.We show experimentally that complex changes like real market appears in the proposed artificial market.
Extraction of Place-Name from Natural Scenes
Authors: Takuma Yamaguchi, Yasuaki Nakano
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper proposes an experimental character recognition system to recognise place-names written on signboards. Recently, mobile phones with digital cameras and handy digital cameras have be come popular, so we think this system is useful. In experiments, we tested a total of 112 natural scene images with 320 characters. We obtained a correct character recognition rate of 99% and a place-name recognition rate of 98% (with a rejection rate 2%).
Semi-automatic Transformation from Formal Specifications to Programs
Authors: Shaoying Liu, Chris Ho-Stuart
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

As model-based formal methods (e.g. VDM, Z) are becoming popular for the development of safety-critical and complex systems in industry, automatic transformation from formal specifications to programs is an ideal and efficient approach to software production. However, it is impossible in general for this transformation to be fully automatic, because of the language of first order logic used for specification is not decidable. This paper uses VDM (Vienna Development Method) as an example to investigate this difficulty, and proposes an approach to address the problem. Rules for automatically transforming abstract level VDM specifications are described, and further transformation at a detailed level is discussed. Finally, further work towards the construction of a rule-based software system to support the transformation from VDM specifications to programs in general is addressed.
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
Authors: Zeljko Zilic, Katarzyna Radecka
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

We present the role that spectral methods play in the developmentof the most impressive quantum algorithms, such as thepolynomial time number factoring algorithm by Shor. While thefast transform algorithms reduce the number of operations neededin obtaining the transforms from O(2^2n) to O(n^2n), quantumtransforms are in comparison super-fast. The Quantum FourierTransform can be performed in O(n^2) time, while the specificcases of Walsh-Hadamard and Chrestenson Transforms requireonly O(n) operations. We derive Quantum Fourier Transform overnon-binary quantum digits using the Chrestenson gate, which canserve as a basic block for quantum transforms.implication of making the number factorization-basedencryption methods breakable. Several classes of quantumtransform implementations are presented. Further, weconsider the issue of the multiple-valued logic quantumgates. As most quantum computing results have so far beenobtained for binary logic, we consider the problem of thedesign of non-binary quantum logic gates and demonstratethe usefulness of the Chrestenson gate, which can serve asa basic block for quantum transforms.
Analysis of Memory Hierarchy Performance of Block Data Layout
Authors: Neungsoo Park, Bo Hong, Viktor K. Prasanna
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Recently, several experimental studies have been conducted on block data layout as a data transformation technique used in conjunction with tiling to improve cache performance. In this paper, we provide a theoretical analysis for the TLB and cache performance of block data layout. For standard matrix access patterns, we derive an asymptotic lower bound on the number of TLB misses for any data layout and show that block data layout achieves this bound. We show that block data layout improves TLB misses by a factor of O(B) compared with conventional data layouts, where B is the block size of block data layout. This reductioncontributes to the improvement in memory hierarchy performance. Using our TLB and cache analysis, we also discuss the impact of block size on the overall memory hierarchy performance. These results are validated through simulations and experiments on state-of-the-art platforms.
Solution of transient nonlinear structural dynamics problems using the modified iterative group-implicit algorithm
Authors: Y. Dere, E. D. Sotelino
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this work, the Modified Group Implicit (MIGI) algorithm, a domain-by-domain solution algorithm is extended for the solution of nonlinear structural dynamics problems concurrently. In a transient nonlinear analysis, nonlinear iterations are necessary to satisfy the dynamic equilibrium along with the MIGI iterations. These two iterations may be combined and performed in a single process loop or they may be isolated. Both schemes have been implemented and tested. It is found that the isolation of the iterations produces a more efficient scheme than the one resulting from combination of the two loops. A fully nonlinear transient analysis of a 20- storey model building is carried out, using the separate loop scheme, on an IBM SP multi-computer and a network of SUN workstations. Excellent accuracy in the solution has been obtained with significant speedup of the computations.
Transferring Research Results in Requirements to Practice: Obstacles and Incentives
Authors: Constance L. Heitmeyer
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

During the past decade, researchers have proposed numerous formal techniques for describing and analyzing system and software requirements. These include 1) special languages for specifying requirements, such as RSML and SCR, and 2) software tools, such as consistency checkers, simulators, model checkers, and theorem provers, for detecting errors in requirements specifications, for validating that the specifications capture the intended system behavior, and for verifying that the specifications satisfy selected properties. These properties include type correctness, consistency (no unwanted nondeterminism), and completeness (no missing cases) as well as application properties, such as security and safety properties. Although some limited progress has been made in applying these formal techniques in the practical development of requirements documents, use of the techniques by software developers remains rare. This is in sharp contrast to hardware design, where, at companies such as Intel and Motorola, the use of formally based tools such as model checkers is more common. Recently, these and other hardware companies have begun to integrate formally based techniques into their design environments.
Foundations for an access control model for privacy preservation in multi-relational association rule mining
Authors: Stanley R. M. Oliveira, Osmar R. Zaïane
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

Recent data mining algorithms have been designed for application domains that involve several types of objects stored in multiple relations in relational databases. This fact has motivated the increasing number of successful applications of relational data mining over recent years. On the other hand, such applications have introduced a new threat to privacy and information security since from non-sensitive data one is able to infer sensitive information, including personal information, facts or even patterns that are not supposed to be disclosed. The existing access control models adopted to successfully manage the access of information in complex systems present some limitations in the context of data mining tasks. The main reason is that such models were designed to protect the access to explicit data (e.g. tables, attributes, views, etc), whereas data mining tasks deal with the discovery of implicit data (e.g. patterns). In this paper, we take a first step toward an access control model for ensuring privacy in relational data mining, notably in multi-relational association rules (MRAR). In this model, users associated with different mining access levels, even using the same algorithm, are allowed to mine different sets of association rules. We provide the groundwork to build our access control model over existing technologies and discuss some directions for future work.
Computer Analysis of Tv Spots: The Semiotics Perspective
Authors: M. Caliani, A. Del Bimbo, P. Pala, C. Colombo
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Commercial videos exploit simultaneously several planes of expression (colors, editing effects, viewpoints and rhythms, etc.) to encode the message being vehiculated to the audience in the most persuasive way. In this paper, previous research in the marketing and semiotics fields is translated into a multimedia engineering perspective by formalizing a set of rules mapping visual features at the perceptual level onto higher level features capturing the main narrative structures of the spot. The rules are embedded in a video retrieval system supporting access to a database of commercials based either on semiotic video categories or on global similarity with respect to a template spot.
Full-Chip Signal Interconnect Analysis for Electromigration Reliability
Authors: Steffen Rochel, N. S. Nagaraj
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Metal electromigration affects the functionality and lifetime of integrated circuits. This problem has so far been addressed by imposing simple design rules and current density limits during the design and validation of Ics, but a barrier has been reached in UDSM. State-of-the-art, high-speed circuit designs require current densities in signal nets close to the material limits to meet timing budgets. The validation of electromigration reliability becomes imperative. This paper introduces analysis techniques specifically for signal net electromigration validation at the full-chip level. Results of this analysis provide feedback to the designer to permit engineering decisions between opposing design constraints with consideration to electromigration reliability.
The Impact of Backoff, EIFS, and Beacons on the Performance of IEEE 802.11 Wireless LANs
Authors: Armin Heindl, Reinhard German
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

In late 1997, IEEE standardized the physical layers and the medium access for wireless local area networks. This paper presents a performance study of the distributed coordination function, the fundamental contention based access mechanism. Most performance studies adopt unchecked simplifying assumptions or do not reveal all details of the simulation model. We develop a Stochastic Petri net model, which captures all relevant system aspects in a concise way. Simulation allows quantifying the influence of many mandatory features of the standard on performance, especially the backoff procedure, extended interframe spaces, and the timing synchronization function. This study also serves to identify conditions when simplifying assumptions commonly used in analytical modeling are justified.
Networking Complete, 3 edition
Venue:  (2002)

:This third edition of the best-selling Networking Complete is a one-of-a-kind computer book-valuable for its broad content and its low price. This book contains updated coverage of the essential information you need to know about networking, both in the office and in the home. With Networking Complete, you'll learn about designing, installing, maintaining, and administering networks using a variety of operating systems, including Windows 2000, Mac OS, NetWare 6, Linux, and UNIX. You'll quickly take advantage of all that networking has to offer. Get up to speed with the basics, then move on to develop intranet systems. Finally, an extensive section on network security and firewalls will help you ensure the reliability and security of your home or business network. The reference section contains a comprehensive networking glossary, which you'll find to be an invaluable daily tool. Finally, you can examine the exciting IT consulting career opportunities awaiting you. Networking Complete introduces you to the work of some of Sybex's finest authors, so you'll know where to go to learn even more about what's possible with your network. Inside: Networking Fundamentals An Introduction to Networking Networks in the Workplace Topologies and Network Types OSI Model and Major Protocol Suites Wireless-Cell, Radio, Satellite Networking Hardware and Software Installing Cards and Cables Repeaters, Hubs, Routers, Switches, and Bridges Network Operating Systems and Client Software Networking with Windows 2000 and Windows XP Thin Client Networking Using Citrix MetaFrame XP Web Applications Network Design, Maintenance, and Troubleshooting Principles of Network Design Home Networking Choices Managing Windows 2000 Networks Network Troubleshooting and Disaster Recovery Intranets and Interconnecting Networks Building an Intranet Infrastructure Remote Access Concepts Java, E-Commerce, ASP Network Security Security Concepts and Terminology NetWare 6 Network Security Unix Security Virtual Private Networking L2TP, PPTP, RADIUS Firewalls, Proxy Servers, and Encryption Networking References How to Become an IT Consultant Glossary The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance of ATM available bit rate for bursty TCP sources and interfering traffic
Authors: D. P. Hong, T. Suda
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The available bit rate (ABR) service dynamically utilizes free bandwidth in ATM networks for data traffic. ABR enables data sources to efficiently utilize network resources without adversely affecting the performance of guaranteed traffic such as for video. However, the majority of research to date on the performance of ABR schemes has ignored the effects of guaranteed traffic. The vast majority of research has also only utilized persistent sources although real data traffic, such as Internet traffic, is bursty. This paper presents a simulation study of bursty Internet TCP traffic over ATM with bursty interfering traffic streams. Two major ABR schemes, rate based ABR with explicit rate (ER) control and the credit based quantum flow control (QFC), are compared. The results indicate that performance with QFC is significantly better than with ER control.
Explicit OR-Dispersers with Polylogarithmic Degree
Authors: Michael Saks, Shiyu Zhou
Venue:  (1996)

An $(N,M,T)$-OR-disperser is a bipartite multigraph $G=(V,W,E)$ with $|V|=N$, and $|W|=M$, having the following expansion property: any subset of $V$ having at least $T$ vertices has a neighbor set of size at least $M/2$. For any pair of constants $\xi,\lam, 1\ge\xi<\lam\ge 0$, any sufficiently large $N$, and for any $T\ge 2^{(\log N)^{\xi}}$, $M \leq 2^{(\log N)^{\lam}}$, we give an explicit elementary construction of an $(N,M,T)$-OR-disperser such that the out-degree of any vertex in $V$ is at most polylogarithmic in $N$. Using this with known applications of OR-dispersers yields several results. First, our construction implies that the complexity class Strong-RP defined by Sipser, equals RP. Second, for any fixed $\eta < 0$, we give the first polynomial-time simulation of RP algorithms using the output of any ``$\eta$-minimally random'''' source. For any integral $R < 0$, such a source accepts a single request for an $R$-bit string and generates the string according to a distribution that assigns probability at most $2^{-R^\eta}$ to any string. It is minimally random in the sense that any weaker source is insufficient to do a black-box polynomial-time simulation of RP algorithms.
Full Chip Thermal Simulation
Authors: Zhiping Yu, Dan Yergeau, Robert W. Dutton, Sam Nakagawa, Norman Chang, Shen Lin, Weize Xie
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

A multilayer, full chip thermal analysis is presented. The design of the chip at functional-block level is directly captured to the simulator, allowing the assessment of the chip layout impact on the system performance due to the elevated operational temperature. The heat generation for each block is obtained by running the circuit-level electrical simulation separately on individual functional units. The thermal diffusion equation is then solved based on the actual structure of the chip including substrate and interconnect/insulating layers. Different thermal conductivity can be specified for each material layer. The effect of package on chip temperature distribution is modeled using thermally resistive layers as boundary between the simulated structure and surrounding environment. Proper adjustment of the boundary thermal resistance results in the correct range of simulated temperature distribution as compared to the measured data.Both physics and implementation for the thermal simulation will be described. The code is applied to the analysis of a realistic design of CPU chip made of SOI technology with up to six metal interconnect layers. A comprehensive review of simulation results will be presented.
Circuit-Switched Routings for Automorphisms of a Hypercube
Authors: I. Hal Sudborough, Taoyu Zhang
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

We consider, for d>1, a directed d-dimensional hypercube, Q d =(V,E), where V is a set of 2 d nodes, each denoted by a distinct binary string of length d, and E is the set of edges (x,y), such that x,yÎV differ in exactly one position of their bit strings. Given a permutation of the vertices of Q d , which describes a source-destination mapping, we study the existence of a set of paths from each source to each destination such that no edge of Q d is assigned to more than one path. For a multiprocessor connected in such a manner, such a set of paths could be used for circuit switching of messages between source-destination processors (nodes). We show that for any automorphism of Q d , there is such a set of paths.
Multi-Modal Verification of Patient Positioning in Radiotherapy
Authors: J. Stratford
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Conformal radiotherapy uses multi-leaf collimation to customise radiation dose fields to the three-dimensional shape of the target tumour. Its effectiveness is governed by the precision of dose delivery achieved using a few coplanar tattoo markers. During a course of treatment, the patient's body surface profile fluctuates causing the reference skin tattoo markers to move and hence, without the ability to verify target position, the precision of pre-treatment set-ups will degrade, often significantly.Cross-modal patient set-up verification software has been developed which allows the user to examine images from various modalities. All imaging modalities available can be used to collectively define anatomical landmarks, outlined on a representative reference image in order to verify radiation field placement using anterior and lateral pre-treatment portal images. This software is presently being used within a national clinical trial for recording the field placement error observed daily at pre-treatment. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Image Disorientation Auto-Recovery
Authors: Jia Wang, Yin Zhang, Zhiyuan Chen, Yu Zhang
Venue:  (1999)

Automatically detecting and correcting disoriented image frames in a content-related image sequence is a problem that must be addressed in many image and video applications. In this paper, we give a robust feature-based algorithm to efficiently detect and adjust the disorientation of images.
Early elicitation and definition of requirements for an interactive multimedia information system
Authors: S. Jones, C. Britton
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The literature on requirements engineering contains little in the way of either theoretical guidance or empirical case studies relating to the specification of requirements for interactive multimedia information systems. This paper describes some of the special difficulties currently encountered in the early stages of developing such systems. It then presents a description of the methods and tools used in the early stages of the MARS project, whose aim is to develop an interactive multimedia system for use in school-based health education and anti-smoking campaigns directed at children aged 9-10. The paper ends with a discussion of lessons learnt with respect to some current issues in requirements engineering, and considers the extent to which the particular problems identified earlier in the paper were addressed by the methods and tools used in the MARS project. We conclude that further work in this area is badly needed, so that better guidance on the specification of requirements for interactive multimedia information systems can be given in future.
Long Arithmetic Progressions of Primes: Some Old, Some New
Authors: Paul Pritchard
Venue:  (1984)

NO SUPPLIED
Integrating Nonelectronic Components into Electronic Microsystems
Authors: Bruno Murari
Venue: IEEE Micro (2003)

Microelectromechanical systems will soon usher in a new technological renaissance. Just as ICs brought the pocket calculator, PC, and video games, MEMS will provide a new set of products and markets. Learn about the state of the art, from inertial sensors to microfluidic devices. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour
Authors: Ozalp Babaoglu
Venue:  (1981)

We consider the problem of generating memory reference strings that are to be used instead of real program address traces with the generator based on the Least-Recently-Used Stack Model (LRUSM) of program behaviour. A method to transform the stack distance probability mass function that drives the generator is proposed which results in memory reference strings that are a fraction of theoriginal string length while preserving most of its essential performance characteristics. The reduced string can be processed in much the same way as the original string for virtual memory studies that deal with memory sizes greater than $k$, the parameter of the transformation.