ppxscal/embedding_network huggingface dataset:
Ontology Development for a Manufacturing Data Base for Products with Graded Properties
Authors: M. Reyes Perez, J. Gausemeier, D. Nordsiek
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Manufacturing technology opens new perspectives for tailored made parts. A new thermo-mechanically coupled forming process is used to affect the material properties at the microstructural level. With this process is possible to produce functional graded components. This means a steady progress of the microstructure's variation through at least one spatial dimension with the intention to establish macroscopic properties of the part. However, such manufacturing components need a sophisticated process design which takes into account the interaction between the manufacturing processes, the sequences of the manufacturing steps and the attributes of the part. Therefore we develop a methodology for the synthesis of the manufacturing process for these components. It starts with the description of the part and uses an Expert System to create the sequence of the manufacturing steps. The key factor of the Expert System is the synthesis of manufacturing functions. Hence, we are developing an ontology to support this. The focus of this paper is the ontology's design. We describe the modeling of the ontology starting with the knowledge extraction of the manufacturing process. Finally we apply the ontology on an example.
CAD for displays!
Authors: Mary Lou Jepsen
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We take displays for granted in devices like our laptops, television, cell phones, and cars -to name a few places. The TFT LCD processes in use now are as mature as CMOS was 20 years ago, which is when we started seeing ASIC companies doing fabless chip design and investing heavily in CAD. Today, the display, as I believe I showed while working on the OLPC, is really just an ASIC! Why focus on the display? The display is the most expensive and power hungry component in your laptops, it can now be "taped out" just like an ASIC using standard TFT LCD fabs, and -in the limit- the laptop or the cell phone will become just a display in which the electronics are integrated into. I believe that we are about to see a revolution in display design, with gradual subsumption of more and more of the CPU and motherboard electronics, to further drive down cost and power consumption. 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
Predicate dispatch for aspect-oriented programming
Authors: Shigeru Chiba
Venue: Proceedings of the 2nd Workshop on Virtual Machines and Intermediate Languages for emerging modularization mechanisms (2008)

Developing a machine model natively supporting aspect-oriented programming (AOP) is fruitful not only for implementing interpreters and compilers for AOP languages but also for understanding the essence of the AOP paradigm. This position paper shows a machine model based on open classes and predicate dispatch and it briefly describes a list of predicates that are necessary for modeling AspectJ. This machine model is useful for comparing AOP and object-oriented programming (OOP) on a side-by-side basis. Our initial observation is that AOP is a natural extension to OOP with respect to language constructs.
Decentralized message ordering for publish/subscribe systems
Authors: Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

We describe a method to order messages across groups in a publish/subscribe system without centralized control or large vector timestamps. We show that our scheme is practical---little state is required; that it is scalable---the maximum message load is limited by receivers; and that it performs well---the paths messages traverse to be ordered are not made much longer than necessary. Our insight is that only messages to groups that overlap in membership can be observed to arrive out of order: sequencing messages to these groups is sufficient to provide a consistent order, and when publishers subscribe to the groups to which they send, this message order is a causal order.
A New DEA Model for Classification Intermediate Measures and Evaluating Supply Chain and its Members
Authors: S. M. Hatefi, F. Jolai, H. Iranmanesh, H. Kor
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Appropriate selection of intermediate measure status in supply chain is an important requirement for the effective management of supply chain. The data envelopment analysis (DEA) is suitable tool for evaluating supply chain performance. In the conventional DEA it is deemed that the variable status of each performance measures from the pointview of input or output is known. In supply chain intermediate measures treat as both inputs of buyer and outputs of seller. Conventional data envelopment analysis cannot be employed directly to measure the performance of supply chain and its members, because of the existence of the intermediate measures that connects the supply chain members. In this paper we develop a DEA model to classify the status of intermediate measures and evaluate the performance of supply chain members. The proposed model for each DMU0 permits that supply chains (DMUs) choose which is best for each intermediate measure, whether to designate it as an output of seller or input of buyer. Then we illustrate the application of model in a numerical example.
Stability of random brain networks with excitatory and inhibitory connections
Authors: R. T. Gray, P. A. Robinson
Venue: Neurocomputing (2009)

Stability of randomly connected networks of neural populations with randomly distributed excitatory and inhibitory connections is investigated using a simplified physiologically-based model of brain electrical activity. Connections within a random network are randomly assigned to be excitatory or inhibitory, and the strengths of excitatory and inhibitory connections have two distinct distributions. Stability is shown to depend on the size of the network, the connection probability, and the mean and variance of the network's distribution of connection strengths, thus constraining these quantities. Networks with a nonzero variance for their excitatory and inhibitory strengths are less likely to be stable than networks with zero variance. The effect of changes in overall network activity on an individual population is also investigated. The maximum excitatory and inhibitory inputs into a population are constrained by stability and occur when the magnitudes of the mean excitatory and inhibitory connection strengths are equal and the proportion of connections that are inhibitory has a fixed value less than 0.5. Results consistent with experimentally determined brain networks.
Fractionally-sampled blind channel estimation for a mobile communication system
Authors: Hideo Murakami
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper introduces a blind channel estimation method for a block transmission system in which symbols are transmitted in blocks. In most of digital communication systems, low-pass filters are placed at a transmitter to confine the transmitting waveform to an allocated bandwidth and at a receiver to improve signal-to-noise power ratio. Consequently, if the received waveform is sampled with sufficiently fast rate, the resulting discrete-time signal is band-limited and exhibits a smooth waveform. The method exploits this smooth property for estimating the channel impulse response, via an interpolation formula. One block of transmission is sufficient to estimate the channel, making the method suitable for mobile communication environment, in which the channel characteristic changes in a relatively short time span. No knowledge of input statistics or the autocorrelation of the received signals is required.
Typed Datalog
Authors: David Zook, Emir Pasalic, Beata Sarna-Starosta
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Static type safety is an important feature of many commercial programming languages, as has become apparent in our experience developing LogicBlox--a Datalog-based platform for building enterprise-scale systems for corporate planning. Existing approaches to enhancing Datalog (and Prolog) with type safety are problematic for LogicBlox applications because (1) they do not support inclusion constraints, which are crucial for database reasoning, and (2) their worst-case running times are exponential in the size of the programs. In the LogicBlox environment--where clients interactively add and execute programs and queries--efficient compilation and execution are critical, and so a PTIME type-checking algorithm is preferred. Furthermore, one of the central design goals of LogicBlox is to express the compiler itself in Datalog, which in general excludes exponential-time algorithms.This paper presents a definition of type safety for Datalog which can express inclusion constraints along with an efficient (PTIME) and sound (but not complete) type-checking algorithm, proposes work-arounds for some common limitations of the algorithm, and indicates how the type-checking algorithm itself may be represented in Datalog.
WSC-08: Continuing the Web Services Challenge
Authors: Ajay Bansal, M. Brian Blake, Srividya Kona, Steffen Bleul, Thomas Weise, Michael C. Jaeger
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

The capabilities of organizations can be openly exposed, easily searched and discovered, and made readily-accessible to humans and particularly to machines, using service-oriented computing approaches. Artificial intelligence and software engineering researchers alike are tantalized by the promise of ubiquitously discovering and incorporating services into their own business processes (i.e. composition and orchestration). With growing acceptance of service-oriented computing, an emerging area of research is the investigation of technologies that will enable the discovery and composition of web services. The Web Services Challenge (WSC) is a forum where academic and industry researchers can share experiences of developing tools that automate the integration of Web services. In the fourth year (i.e. WSC-08) of the Web Services Challenge, software platforms will address several new composition challenges. Requests and results will be transmitted within SOAP messages. In addition, semantics will be represented as ontologies written in OWL, services will be represented in WSDL, and service orchestrations will be represented in WS-BPEL.
Enabling Global Multimedia Distributed Services Based on Hierarchical DHT Overlay Networks
Authors: Isaias Martinez-Yelmo, Alex Bikfalvi, Carmen Guerrero, Ruben Cuevas, Andreas Mauthe
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The provision of innovating multimedia services is a high priority for service providers. Due to the the high traffic volume characteristics of multimedia content, decentralised services are a desired solution for multimedia scenarios. Based on the ongoing work of the IETF P2PSIP WG this paper defines a simple wayto interconnect different domains using on peer-to-peer technology. The objective is to provide connectivity between users of different domains and allow decentralised multimedia services to be placed where they can be provided most effectively. Furthermore, the routing performance and routing state is analysed for the proposed hierarchical DHT overlay architecture.
Performance evaluation of multi-guard channel schemes in broadband mobile networks
Authors: Bor-Jiunn Hwang, I-Shyan Hwang, Ching-Yao Shen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, we proposed two Multi-Guard Channel Schemes (MGCS) for multi-threshold and multirate services. The purpose of MGCS is proposed to guarantee the quality of service for multimedia wireless cellular networks. Another contribution of this paper is to develop two generalized analytical models, two-dimensional Markov chain model, to investigate the performance of two proposed scheme and compared them with each other. The analytical results show that MGCS 2 achieves better results on the handoff dropping probability and new call blocking probability.
A Distributed Overlay Multicast Tree Reconstruction Algorithm for Live Streaming Media Applications
Authors: Shan Jin, Qin Xia, Lin-Feng Liu, Yi-Zhong Li
Venue: International Journal of Distributed Sensor Networks (2009)

Recently overlay multicast has become one of the hot issues on multicast research, as it is more flexible than IP multicast and can facilitate application-specific optimization. However, the intermediate nodes in overlay multicast are easier to be faulted compared to those in IP multicast. So it is significant to design an efficient topology maintenance algorithm in overlay multicast, especially for the live streaming media applications. In this paper, the degree and delay constrained topology maintenance problem is studied, and a novel distributed multicast tree reconstruction algorithm called LOcal Topology maintenance Algorithm (LOTA) is proposed. By adopting the active strategy and avoiding package duplicates, LOTA triggers nodes pre-calculate a backup parent periodically before the multicast tree splits rather than letting downstream nodes find a new parent after a node's departure. When a node which is neither root nor leaf is gone, all its children can interact with their respective backup parents to restore the tree immediately in order to enhance the reconstruction performance and save the system maintenance cost effectively. The results of simulation and experiment show that, in both the small-scale and the large-scale group, LOTA's efficiency of tree reconstruction is much higher than the passive strategies, and its control overhead is comparatively low. Therefore, the algorithm is quite suitable for the real-time streaming media applications.
BitVisor: a thin hypervisor for enforcing i/o device security
Authors: Takahiro Shinagawa, Hideki Eiraku, Kouichi Tanimoto, Kazumasa Omote, Shoichi Hasegawa, Takashi Horie, Manabu Hirano, Kenichi Kourai, Yoshihiro Oyama, Eiji Kawai, Kenji Kono, Shigeru Chiba, Yasushi Shinjo, Kazuhiko Kato
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

Virtual machine monitors (VMMs), including hypervisors, are a popular platform for implementing various security functionalities. However, traditional VMMs require numerous components for providing virtual hardware devices and for sharing and protecting system resources among virtual machines (VMs), enlarging the code size of and reducing the reliability of the VMMs. This paper introduces a hypervisor architecture, called parapass-through, designed to minimize the code size of hypervisors by allowing most of the I/O access from the guest operating system (OS) to pass-through the hypervisor, while the minimum access necessary to implement security functionalities is completely mediated by the hypervisor. This architecture uses device drivers of the guest OS to handle devices, thereby reducing the size of components in the hypervisor to provide virtual devices. This architecture also allows to run only single VM on it, eliminating the components for sharing and protecting system resources among VMs. We implemented a hypervisor called BitVisor and a parapass-through driver for enforcing storage encryption of ATA devices based on the parapass-through architecture. The experimental result reveals that the hypervisor and ATA driver require approximately 20 kilo lines of code (KLOC) and 1.4 KLOC respectively.
Improving Documentation for eSOA APIs through User Studies
Authors: Sae Young Jeong, Yingyu Xie, Jack Beaton, Brad A. Myers, Jeff Stylos, Ralf Ehret, Jan Karstens, Arkin Efeoglu, Daniela K. Busse
Venue: Proceedings of the 2nd International Symposium on End-User Development (2009)

All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a large and complex API for Enterprise Service-Oriented Architecture (eSOA), which identified many issues and recommendations for making API documentation easier to use. eSOA is an appropriate testbed because the target user groups range from high-level business experts who do not have significant programming expertise (and thus are end-participant developers), to professional programmers. Our study showed that the participants' background influenced how they navigated the documentation. Lack of familiarity with business terminology was a barrier we observed for developers without business application experience. Participants with business software experience had difficulty differentiating similarly named services. Both groups avoided areas of the documentation that had an inconsistent visual design. A new design for the documentation that supports flexible navigation strategies seem to be required to support the wide range of users for eSOA. This paper summarizes our study and provides recommendations for future documentation for developers.
Using historical accounting information to predict the resource usage of grid jobs
Authors: Rosario M. Piro, Andrea Guarise, Giuseppe Patania, Albert Werbrouck
Venue: Future Generation Computer Systems (2009)

Basing job scheduling decisions on estimated queue wait times may help in efficiently balancing the workload on the grid. Previous work on usage prediction has mainly described methods for the estimation of queue wait times on clusters and supercomputers, based on the prediction of the run times of single jobs in a queue. We evaluate the possibility to use the historical information provided by a grid accounting system to predict not only run times of grid jobs, but also other types of resource usage (or resource consumption), hence increasing the parameter space on which job scheduling decisions may be based. For this purpose we analyze three grid accounting datasets from a large-scale production environment and report interesting findings about their characteristics.
An experimental study of an iterative simulation-optimization algorithm for production planning
Authors: Durmus Fatih Irdem, Necip Baris Kacar, Reha Uzsoy
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

It is well known from queueing and simulation models that cycle times in capacitated production systems increase nonlinearly with resource utilization, which poses considerable difficulty for the conventional linear programming (LP) models used for this purpose. Hung and Leachman (1996) propose a highly intuitive iterative approach where a detailed simulation model of the production facility is used to estimate flow time parameters used in an LP model We examine the convergence of this method under different experimental conditions, and conclude that it is hard to determine precisely when the method converges.
An Improved Self-Adaptive Particle Swarm Optimization Approach for Short-Term Scheduling of Hydro System
Authors: Shuangquan Liu, Jinwen Wang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

An improved particle swarm optimization approach is introduced in this paper, the improvements involves the ‘worst’ particle’s impact on the particles in addition to that of the ‘best’ one. Meanwhile, a self-adaptive inertia weight is adopted to enhance the performance of the approach. With nonlinear constraints handled by a penalty function, the proposed approach is applied to solve the short-term hydro scheduling of an example hydro system, the proposed approach shows a higher performance and obtains promising results compared to the standard particle swarm optimization and other methods of previous researches.
A practical secure neighbor verification protocol for wireless sensor networks
Authors: Reza Shokri, Marcin Poturalski, Gael Ravot, Panos Papadimitratos, Jean-Pierre Hubaux
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Wireless networking relies on a fundamental building block, neighbor discovery (ND). The nature of wireless communications, however, makes attacks against ND easy: An adversary can simply replay or relay (wormhole) packets across the network and mislead disconnected nodes into believing that they communicate directly. Such attacks can compromise the overlying protocols and applications. Proposed methods in the literature seek to secure ND, allowing nodes to verify they are neighbors. However, they either rely on specialized hardware or infrastructure, or offer limited security. In this paper, we address these problems, designing a practical and secure neighbor verification protocol for constrained Wireless Sensor networks (WSNs). Our scheme relies on estimated distance between nodes and simple geometric tests, and it is fully distributed. We prove our protocol is secure against the classic 2-end wormhole attack. Moreover, we provide a proof-of-concept implementation with off-the-shelf WSN equipment: Cricket motes.
Mapping method for dynamically reconfigurable architecture
Authors: Akira Kuroda, Mayuko Koezuka, Hidenori Matsuzaki, Takashi Yoshikawa, Shigehiro Asano
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We present a mapping algorithm for our dynamically reconfigurable architecture suitable for stream applications such as H.264. Because our target architecture consists heterogeneously of four different configuration format units, it's difficult to apply the conventional algorithms. We propose a heuristic mapping algorithm enabling the mapping of generic dataflow graph onto this complex hardware automatically. We mapped five main functions of H.264 decoder onto our architecture and compared the results with those of manual mapping performed by an experienced engineer. The results show optimization of three of the five functions is equal to that in the case of the manual mapping.
Minamitama district
Authors: Nobuo Takahashi
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

After World War II, Japan accomplished an economic revival. The concentration of population in the cities came during the period of strong economic growth after the war. Construction and housing development advanced rapidly. Financial institutions were rescued during the economic bubble of the 1990s. As a result, large-scale, quasi-public corporations developed one after another. However, this development ended with the bursting of the bubble economy. Real estate values dropped sharply. Bad loans caused financial failures. A fiscal deficit was generated by the government's protection of financial institutions. In 2006, total debt held by the Japanese government exceeded 800 trillion yen.
Translating Multiset Tree Automata into P Systems
Authors: José M. Sempere
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

In this work we propose a translation scheme to obtain P systems with membrane creation rules from transitions of multiset tree automata (MTA).