ppxscal/embedding_network huggingface dataset:
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Venue: Great Lakes Symposium on VLSI (2009)

Welcome to the 19th edition of the <i>Great Lakes Symposium on VLSI (GLSVLSI) 2009</i> held in Braintree, Massachusetts, one of the top academic, historic, and tourist attractions in the world. Since its first meeting in March 1991 in Kalamazoo, Michigan, GLSVLSI has traveled beyond the Great Lakes region of the United States and has become an international conference with submissions from all over the world. It has emerged as a premier conference for publishing innovations in VLSI. This year, 215 papers were submitted, of which 62 papers were accepted for oral presentation at the symposium (a 29% acceptance rate). With poster papers, a total of 100 papers will be presented at the symposium and published in the proceedings. The final technical program consists of 34 full presentations and 28 short presentations in 12 oral sessions and 38 posters in 2 poster sessions. This year, we have five excellent keynote speeches that will be delivered by Massoud Pedram (University of Southern California), Jacob White (Massachusetts Institute of Technology), Eby G. Friedman (University of Rochester), Pinaki Mazumder (University of Michigan, National Science Foundation) and Wolfgang Porod (University of Notre Dame). We are also looking forward to an exciting tutorial on emerging technologies scheduled for Sunday evening, the 10th of May. The tutorial is being presented by three well-known researchers spanning three different areas: biosensing, terahertz sensing, and meta-nanocircuits. The tutorial is free for all registered attendees of the conference. Congratulations to Yang Sun and Joseph Cavallaro from Rice University, for winning the GLSVLSI 2009 Best Student Paper Award for their paper "High Throughput VLSI Architecture for Soft-Output MIMO Detection Based on a Greedy Graph Algorithm".
Socio-technical design of service compositions: a coordination view
Authors: Marijn Janssen, Ralph Feenstra
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Nowadays new systems for electronic service delivery are comprised of components. These components may be locally developed, managed and optimized and not intended to be reused in composite applications. By compositing modular components in new systems large, distributed systems can be developed in which services provided by various stakeholders are combined. The creation of service compositions is an ill-posed and ill-structured design problem which must be tackled with great care and should take into account the various stakeholders and their technological systems. In this paper we present a socio-technical design approach for developing service compositions. This approach starts with analyzing both user requirements and analyzing available services. This is in contrast with existing approaches, which are primarily supply-driven, i.e. they take the available services as a starting point. In addition, the individual service components need to be coordinated to create a coherent composition. Therefore, the dependencies among components are analyzed which help to identify feasible and alternative compositions and enable communication and negotiation among stakeholders. We found that the dependencies among systems components are often viewed as simple sequential, connections whereas, they might not be. Moreover, it was found that a method focused on technical design alone, like most current composition approach, will be insufficient and that stakeholder-related social aspects need to be considered. A service compositions approach in organizational networks requires a high degree of stakeholder participation.
Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems
Authors: YoungSu Yun, Chiung Moon, Daeho Kim
Venue: Computers and Industrial Engineering (2009)

The optimal design of supply chain (SC) is a difficult task, if it is composed of the complicated multistage structures with component plants, assembly plants, distribution centers, retail stores and so on. It is mainly because that the multistage-based SC with complicated routes may not be solved using conventional optimization methods. In this study, we propose a genetic algorithm (GA) approach with adaptive local search scheme to effectively solve the multistage-based SC problems. The proposed algorithm has an adaptive local search scheme which automatically determines whether local search technique is used in GA loop or not. In numerical example, two multistage-based SC problems are suggested and tested using the proposed algorithm and other competing algorithms. The results obtained show that the proposed algorithm outperforms the other competing algorithms.
Hurricane! - a simulation-based program for science education
Authors: Jia Luo, Alpesh P. Makwana, Dezhi Liao, J. Peter Kincaid
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We describe the development, testing and fielding of a PC-based instructional program, Hurricane!. This program educates students about the effects of hurricane winds on different kinds of residential structures. The effects on the residential structures are physics-based. The program has been developed both for schools and science museums. The format is game-based with realistic graphics and sounds and students see different degrees of damage depending on choices that make. For example, a one story masonry house built to current Florida building code standards, is much less vulnerable than a two story wood structure built before 1985. Therefore, students who make the first choice see less damage. Several tests in middle school science classes have demonstrated that the game is highly interesting and effectively teaches concepts central to understanding how to prepare for a hurricane.
Efficiently discovering critical workflows in scientific explorations
Authors: Qihong Shao, Peng Sun, Yi Chen
Venue: Future Generation Computer Systems (2009)

Existing workflow management systems assume that scientists have a well-specified workflow design before the execution. In reality, a lot of scientific discoveries are made as a result of a dynamic process, where scientists keep proposing new hypotheses and verifying them through multiple tries of various experiments before achieving successful experimental results. Consequently, not all the experiments in a workflow execution have necessarily contributed to the final result. In this paper, we investigate the problem of effectively reproducing the results of previous scientific workflow executions by discovering the critical experiments leading to the success and the logical constraints on their execution order. Relational schema and SQL queries have been designed for effectively recording the workflow execution log, efficiently identifying the critical experiments from the log, and recommending experiment reproduction strategies to users. Furthermore, we propose optimization techniques for evaluating such SQL queries according to the unique characteristics of the log data. Experimental evaluations demonstrate the performance speedup of our approach.
The application of forgiveness in social system design
Authors: Asimina Vasalou, Jens Riegelsberger, Adam Joinson
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

When an offence occurs, the victim and offender can overcome the harm done through forgiveness. This paper demonstrates how forgiveness can be supported in social system design. We first describe what forgiveness is, how it is motivated and what benefits follow from forgiveness. Based on this theoretical analysis, we propose five provisions to guide designers who want to encourage reparation in social systems.
An Improved Symmetrical Modeling Method on 3D Tunnel Modeling
Authors: Zhi-hua Zhang, En-ke Hou, Zhou Zhao, Nian-dong Deng, Wen Pang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Tunnel is core of mine projects, and 3D tunnel is the important element of 3D geological models for digital mine. According to symmetry of two-dimensional tunnel along the centerline of the tunnel and symmetry of three-dimensional tunnel profiles along centerline, the paper introduced a method of new 3D tunnel modeling: symmetrical modeling, which can be used to realize the modeling of tunnels' intersection. It has resolved the problem that conventional modeling methods existed. But, there are several issues with method, such as data redundancy. Based on introduction of symmetrical modeling, the method is improved by analyzing existed issues. On the platform of Window XP, the MS Visual C++6.0 is selected as the tool of software development and the OpenGL is chosen as the main graphics manipulated tool, the visualization of models is constructed and realized. It is tested that the improved method inherits the merits of the original method and overcomes its' shortcomings, so that the 3D tunnel model is generated with high efficiency.
Spatio-Temporal Indexing for Large Multimedia Applications
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds etc.). Spatial and temporal relationships among these objects should be efficiently supported and retrieved within a multimedia authoring tool. In this paper we present several spatial, temporal and spatio-temporal relationships of interest and propose efficient indexing schemes, based on multi-dimensional (spatial) data structures, for large multimedia applications that involve thousands of objects. Evaluation models of the proposed schemes are also presented as well as hints for the selection of the most appropriate one, according to the multimedia author's requirements.
A Regression Method to Compare Network Data and Modeling Data Using Generalized Additive Model
Authors: Sooyoung Chae, Hosub Lee, Jaeik Cho, Manhyun Jung, Jongin Lim, Jongsub Moon
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

This paper suggests a method to check whether the real network dataset and modeling dataset for real network has statistically similar characteristics. The method we adopt in this paper is a Generalized Additive Model. By using this method, we show how similar the MIT/LL Dataset and the KDD CUP 99' Dataset are regarding their characteristics. It provided reasonable outcome for us to confirm that MIT/LL Dataset and KDD Cup Dataset are not statistically similar.
Stochastic kriging for simulation metamodeling
Authors: Bruce Ankenman, Barry L. Nelson, Jeremy Staum
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We extend the basic theory of kriging, as applied to the design and analysis of deterministic computer experiments, to the stochastic simulation setting. Our goal is to provide flexible, interpolation-based metamodels of simulation output performance measures as functions of the controllable design or decision variables. To accomplish this we characterize both the intrinsic uncertainty inherent in a stochastic simulation and the extrinsic uncertainty about the unknown response surface. We use tractable examples to demonstrate why it is critical to characterize both types of uncertainty, derive general results for experiment design and analysis, and present a numerical example that illustrates the stochastic kriging method.
Dynamic replication, an overview
Authors: T. P. Daniell, R. C. Harding,  Jr., S. H. Nauckhoff
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Dynamic replication is a new technique for managing data in a distributed processing environment. It is a simple yet powerful scheme that addresses the major problems of distributing databases. This paper discusses dynamic replication and database distribution in three parts: First, several aspects of database distribution common to various techniques are described. Second, some capabilities of dynamic replication are emphasized, inasmuch as they are not available with other techniques. Third, an overview description of dynamic replication is given.
VST-Model: A Uniform Topological Modeling of the Visual-Spatio-Temporal Video Features
Authors: Zaher Aghbari, Kunihiko Kaneko, Akifumi Makinouchi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Recently, two approaches investigated indexing and retrieving video data. One approach utilized the visual features, and the other approach exploited the spatio-temporal features. In this paper, we present a new Visual-Spatio-Temporal model (VST model), to represent videos. The visual features and the spatio-temporal features of video objects are integrated and represented uniformally by a topological model. As a result, rich sets of new relationships are defined to support and simplify the formulation of more semantical queries. The expressiveness of the VST video model is validated by some query examples.
An Adaptive Transport Service for Multimedia Streams
Authors: L. Rojas-Cardenas, L. Dairaine, P. Senac, M. Diaz
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The study and the implementation of an adaptive service No order Total reliability Total 0rder otal Reliability for multimedia streams based on Partial Order and partial reliability Connections (POC) is presented in this paper. A POC connection provides a service authorized to support both bounded losses and bounded disorder. Such parameters can be used to accurately define the range of conditions over which an adaptive application can perform acceptably. The POC concept is motivated by the fact that heterogeneous switched packet networks are plagued by unordered delivery and packet losses which tax performances of both current protocols and application. The pegormances of the POC adaptive service are analyzed through one representative multimedia application: a MPEG video server.
Research on the Process of Urbanization Based on the Comparison of China's 35 Major Cities' Urbanization Levels
Authors: Xin Liu, Wei-dong Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Since the reform and opening-up policy, China's urbanization has improved continuously. Even though, here comes the bottleneck following the unplanned construction. In the face of obstacles, how to overcome these difficulties and by which means can we improve the level of urbanization comprehensively has become popular in the academic community. Whereas the situation mentioned above, this paper is to use factor analysis and hierarchical cluster analysis of multivariate statistical analysis to find the reasons for solving the problems based on the comparison of China's 35 major cities in the level of urbanization, and the results will be theoretical analyzed, the proposal of changing the model of urbanization from developing as fast as possible to developing comprehensively with proper speed will be proposed.
A sorting classification of parallel rendering
Authors: Steven Molnar, Michael Cox, David Ellsworth, Henry Fuchs
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We describe three broad classes of parallel rendering methods, based on where the sort from object-space to screen space occurs. These classes encompass most feed-forward parallel software and hardware rendering architectures that have been described to date. After introducing the classes, we perform a coarse analysis of the aggregate processing and communication costs of each and identify constraints they impose on the rendering application. The aim is to provide a conceptual model of the tradeoffs between the approaches as an aid to designers and implementers of high-performance, parallel rendering systems.
Using Affine Transformation to Obtain Approximate Offset Surface
Authors: Hongxing Zhao, Zhenglin Ye, Yaqin Meng
Venue: International Journal of Distributed Sensor Networks (2009)

For an arbitrary function C1 surface, we can use segment affine transformation to obtain a surface as its approximate offset surface. Each segment of the approximate offset surface and the corresponding segment of the original surface are proved to be of the same function type. After affine transformation, the geometric invariance of the original surface is proved to be retained in the approximate offset surface. The numerical example demonstrated the efficiency of our method.
Evaluating two ways of calculating priorities in requirements hierarchies - An experiment on hierarchical cumulative voting
Authors: Patrik Berander, Mikael Svahnberg
Venue: Journal of Systems and Software (2009)

When developing large-scale software systems, there is often a large amount of requirements present, and they often reside on several hierarchical levels. In most cases, not all stated requirements can be implemented into the product due to different constraints, and the requirements must hence be prioritized. As requirements on different abstraction levels shall not be compared, prioritization techniques that are able to handle multi-level prioritization are needed. Different such techniques exist, but they seem to result in unfair comparisons when a hierarchy is unbalanced. In this paper, an empirical experiment is presented where an approach that compensate for this challenge is evaluated. The results indicate that some form of compensation is preferred, and that the subjects' preference is not influenced by the amount of information given.
An examination of psychoticism and motion capture controls as moderators of the effects of violent video games
Authors: Patrick M. Markey, Kelly Scherer
Venue: Computers in Human Behavior (2009)

The current study examined the potential moderating effects of motion capture technology and participants' own level of psychoticism on their hostility and aggressive thoughts after playing violent video games. A total of 118 participants (68 females, 50 males) first completed a measure of psychoticism and then played either a violent video game or a non-violent video game using either a traditional controller or motion capture controls. Immediately after the video game play period, participants' current level of hostility and aggressive cognitions were assessed using self-report questionnaires. Results indicated that the use of motion capture controls did not increase the negative effects of violent video games. However, participants with elevated levels of psychoticism were much more affected by violent video games than other participants. Such findings suggest that only some individuals are adversely affected by violent video games and that those who are affected have preexisting dispositions which make them susceptible to such violent media.
User Interface for a Digital Library to Support Construction of a "Virtual Personal Library"
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

This paper describes the development of a prototype user interface to support construction of "virtual personal libraries" from digital libraries. The virtual personal library provides broad support for user information activities such as browsing, editing, storing, and annotating. We propose the use of a book-metaphor interface that represents virtual books and bookshelves on computer displays. Users can browse, edit, and store information freely by using this interface. We also propose a pointer-storing method based on the concept of transclusion to legally validate the use of information resources. An extended HTML is used to realize the pointer- storing method on the WWW. 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
A search optimization model in a network having broken packages
Authors: Dana Simian, Vladislav Georgiev, Corina Simian
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The aim of this paper is analyze the possibility of detecting the source of broken packages in a big network. A measurement of the traffic through the router gives us the time when the broken packages appear. We can locate the network where the broken packages are coming from, using the information from vlan, but we can not locate the host. We develop a model in order to make an optimization of the searching process of broken packages source in a computer network. In particular, we apply this model in the computer network of Sofia University.
Consultation Mechanism in Multi-agent System Based on J2EE
Authors: Xiaomin Ma
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper analyzes the structure of Java-based Agent development framework JADE. Based on the traditional consultative mechanism, give the model of consultation for single-to-many projects. In the true sense, the logic model establishment of the e-commerce consultation, and this makes the entire consultation system get higher autonomy and intelligent.
Operational ontological approach to formal programming language specification
Authors: I. S. Anureev
Venue: Programming and Computing Software (2009)

Development of formal programming language specifications is an important problem of theoretical and practical programming. The paper presents operational ontological approach to formal specification of programming languages. It defines formalism for introduction of operational ontological semantics of programming languages: ontological transition systems, description language for ontological transition systems (OTSL), and methodology of applying the OTSL to the development of formal specifications of programming languages.
CuNoC: A dynamic scalable communication structure for dynamically reconfigurable FPGAs
Authors: S. Jovanović, C. Tanougast, C. Bobda, S. Weber
Venue: Microprocessors Microsystems (2009)

The growing complexity of integrated circuits imposes to the designers to change and direct the traditional bus-based design concepts towards NoC-based. Networks on-chip (NoCs) are emerging as a viable solution to the existing interconnection architectures which are especially characterized by high level of parallelism, high performances and scalability. The already proposed NoC architectures in the literature are destined to System-on-chip (SoCs) designs. For a FPGA-based system, in order to take all benefits from this technology, the proposed NoCs are not suitable. In this paper, we present a new paradigm called CuNoC for intercommunication between modules dynamically placed on a chip for the FPGA-based reconfigurable devices. The CuNoC is based on a scalable communication unit characterized by unique architecture, arbitration policy base on the priority-to-the-right rule and modified XY adaptive routing algorithm. The CuNoC is namely adapted and suited to the FPGA-based reconfigurable devices but it can be also adapted with small modifications to all other systems which need an efficient communication medium. We present the basic concept of this communication approach, its main advantages and drawbacks with regards to the other main already proposed NoC approaches and we prove its feasibility on examples through the simulations. Performance evaluation and implementation results are also given.