ppxscal/embedding_network huggingface dataset:
An experience on Industry-University collaborative research
Authors: K. J. Nasr
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Industry-university collaboration is common at GMI Engineering & Management Institute, USA, a fully co-operative institution which requires students to write a fifth-year thesis on a project relevant to an industrial sponsor. While the undergraduate link between GMI and its industrial sponsors is strong, collaborating on higher level research projects is somewhat new. This paper documents the phases of a collaborative research experience between GMI Engineering and Management Institute and Ford Motor Company. It also presents the potential benefits to each party, describes appropriate relationships, and exhibits steps for continuing cooperation. The paper concludes with an outline for a successful collaboration and suggests ways to ensure a fruitful experience for both industry and university participants.
Partition search for non-binary constraint satisfaction
Authors: Julian R. Ullmann
Venue: Information Sciences: an International Journal (2007)

Previous algorithms for unrestricted constraint satisfaction use reduction search, which inferentially removes values from domains in order to prune the backtrack search tree. This paper introduces partition search, which uses an efficient join mechanism instead of removing values from domains. Analytical prediction of quantitative performance of partition search appears to be intractable and evaluation therefore has to be by experimental comparison with reduction search algorithms that represent the state of the art. Instead of working only with available reduction search algorithms, this paper introduces enhancements such as semijoin reduction preprocessing using Bloom filtering.
Communication Network Analysis in Maternity Hospital Bulletin Board System
Authors: Shunji Suto, Nobuyuki Ashida, Terumasa Higashi, Hideo Takemura, Koji Kurimoto, Shiro Yorifuji
Venue: Journal of Medical Systems (2007)

Recent changes in Japanese social environments consequently dropped total fertility rate, and poor interpersonal relationships in local communities have aggravated the environments for childbirth and child-rearing. Under such circumstances, we introduced a bulletin board system (BBS) to an official web-site of a maternity hospital to set up a community for its patients for communication regarding childbirth and the like. Based on the logs from BBS, we graphed types of communication among its users with to describe topologies. Additionally, we calculated degrees of centralization of entire networks and found the hospital role as the administrator becomes smaller as inter-user communication becomes more brisk. The analysis of contents of respective threads also revealed that main topics shifted from gestational matters to postnatal and child-rearing as communication became more brisk, which indicates those postnatal users are also strongly conscious with gestational and progestational contents and contribute to supporting the entire BBS.
Trace Recovery in Multi-Processing Systems: Architectural Considerations
Authors: J. A. Gannon, K. J. Williams, M. S. Andersland, T. L. Casavant, J. E. Lummp,  Jr.
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Execution monitoring plays a central role in most software development tools for parallel and distributed computer systems. However, such monitoring may induce delays that corrupt trace event timing. Recently we demonstrated that, given a safe timed Petri net model of monitored software, timestamp values that would have been observed had the delays not been present can sometimes be recovered from the corrupted trace. In this paper we discuss the architectural implications of applying this result to multi-processing systems.
Diagnosis of Full Open Defects in Interconnecting Lines
Authors: R. Rodriguez-Montanes, D. Arumi, J. Figueras, S. Einchenberger, C. Hora, B. Kruseman, M. Lousberg, A. K. Majhi
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

A proposal for enhancing the diagnosis of full open defects in interconnecting lines of CMOS circuits is presented. The defective line is first classified as fully opened by means of a logic-based diagnosis tool (Faloc). The proposal is based on the division of the defective line into a number of segments. The selected group of segments is derived from the topology of the line and its surrounding circuitry. The logical information related to the neighbouring metal lines for each considered test pattern is taken into account. With the proposed diagnosis methodology, a set of likely locations for the open defect on the line is obtained. A ranking between the set of possible locations is presented based on the analysis of the quiescent current consumption of the circuit under test. Examples are presented in which the use of the diagnosis methodology is shown to discriminate between different locations of the full open defect.
Multi-layered Data Consistency Technology in Autonomous Decentralized IC Card Ticket System
Authors: Akio Shiibashi, Yoshitaka Maruyama, Motoharu Yamana, Kinji Mori
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

High-load transaction systems such as the IC (Integrated Circuit) Card Ticket System require high performance, high reliability, and service continuity. However, the wireless communications have a problem that higher performance at the gates results in lower reliability in the data. The solution is the Autonomous Decentralized Architecture, in which "IC cards," "terminals," and a "center server" are designed as the autonomous nodes. Based on the architecture, two technologies have been introduced: "Autonomous Decentralized Fare Calculation Algorithm" for high performance and "Autonomous Decentralized Data Consistency Technology" for high reliability. This paper looks into the Multi-layered Data Consistency Technology which assures service continuity, using heterogeneous data fields with various time ranges. Appropriate values are considered through theorization, modeling, and simulation. These conditions are used in the practical "Suica" system at East Japan Railway Company and the system is running satisfactory, without any fatal errors.
Loosely Trusted Yet Secure Roaming Architecture for Public Wireless Internet Service
Authors: Kenji Ohira, Ying Huang, Takaaki Komura, Yasuo Okabe
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

The demand of providing one's network bandwidth for another such as a business partner or a guest in a form like a so-called free wireless Internet access is rising. However, in some countries like Japan, the law concerning the responsibility of Internet service providers requires not only ISPs who operate roaming service but also anyone who provide access to the Internet to identify an illicit user when requested. Otherwise he himself may be treated as the illicit user. In this paper, we first categorize conventional roaming models and consider trust relationships in roaming. Conventional roaming models assume trust between a connectivity provider and an authenticator. Most measures are against abuse of a mobile user or a fake user as an attacker. Based on the consideration, we propose an autonomous distributed model account management architecture. With this architecture, when an illicit use occurs, every concerned party can find who do it even in the case that not only a mobile user but also a connectivity provider and/or an authenticator may do it. This is possible if a connectivity provider allows only traffics of some well known secure authentication protocols and user data which is authenticated with them to go through his network. This proposal makes it possible for a connectivity provider to provide access for a mobile user securely as easy as a free wireless access without trust with any authenticator.
A hybrid coder based on a new phase model for synchronization between harmonic and waveform coded segments
Authors: N. Katugampala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a hybrid coder with a new phase model to synchronize harmonic and waveform coded segments, with a target bit rate of 4 kbps. The coder also employs a new technique based on analysis by synthesis to distinguish between stationary and transitional segments. Harmonic excitation is synchronized with the LPC residual by transmitting the location of the pitch pulse closest to the frame boundary and a phase value that represents the shape of the corresponding pitch pulse. The performance of this phase model and the classification technique is evaluated using a hybrid coder. The coder has three modes: scaled white noise excitation colored by LPC for unvoiced, ACELP for transitions, and harmonic excitation for stationary segments. Subjective listening tests show that the coder produces good quality speech and the switching between the modes is transparent.
Polynomial time fragments of XPath with variables
Authors: Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO) queries modulo linear time transformations. In this paper, we distinguish a fragment of Core XPath 2.0 that remains FO-complete with respect ton-ary queries while enjoying polynomial-time query answering.
Symmetry in Process Algebra
Authors: Jianmin Jiang, Jinzhao Wu, Hongping Shu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process. Furthermore, an algorithm and two examples for this symmetric reduction are presented.
Formative motion estimation for translational, shear and zoom sequences
Authors: S. S. Skrzypkowiak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Digital television seeks to reduce the bit rate through the elimination of interframe redundancy. The more accurate the motion estimation, the lower the encoded bit rate with the same picture quality, resulting in more channels the provider can deliver to the consumer at a reduced price. We develop a neural network motion estimation technique which produces 4 to 11 dB improvement of peak signal to noise ratio (PSNR) over the other methods, thus creating the potential for improved compression. In contradistinction to the other methods, there is no need to carry out fractional-pixel interpolation. The technique is applicable to purely translational, shear, and zoom sequences. Further, it is formative in that it can form objects that are formed in the present frame and are non-existent in the previous frame.
Fast Protection of the Color of High Dimension Digital Painting Images
Authors: M. Chaumont, W. Puech
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In this paper, we propose a method to embed the color information of an high dimension image in its corresponding grey-level image. The objective of this work is to allow a free and rapid access to the grey-level image and give color image access to secret key owners. This method is made of two steps which are the fast high-dimension color image decomposition (in a grey-level image and its associated color information) and the data-hiding. The two main contributions of this paper are the energy function proposed to model the decomposition of the color image and the fast optimization. The optimization of the proposed energy function leads to the achievement of an index image and a color palette. The good properties of that decomposition are an index image which is similar to the luminance of the color image and a color palette which is well suit for the data-hiding. The obtained results confirm the model quality and the real-time property.
Evaluating and Balancing Reliability and Performance Properties of Software Architecture Using Formal Modeling Techniques
Authors: Jianli Xu
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The run-time quality properties of Software architecture, such as reliability and performance, are fundamental to telecom systems, but they are very hard to be precisely specified and evaluated with conventional methods. In our contribution we focus on modeling and analysis of architectural level run-time quality properties using formal methods. Colored Petri Nets (CPN) is used to create specific system behavior models of reliability and performance properties of software architecture, these properties are then evaluated with analysis and simulation techniques supported by CPN and its tools. In this paper we report our approach and experience on using CPN to model and evaluate the reliability and performance properties of different architecture designs of a critical software subsystem in a telephone switch system. The reliability and performance properties of two alternative solutions were modeled and compared through model analysis and extensive model simulation. The results helped us to find an ideal solution with high performance, low cost and acceptable reliability that met the industry standards.
Multi-font recognition of printed Arabic using the BBN BYBLOS speech recognition system
Authors: C. LaPre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We use a hidden Markov model (HMM) based continuous speech recognition system to perform off-line character recognition (OCR) of Arabic printed text. The HMM trainer and recognizer are used without change, however we modify the feature extraction stage to compute features relevant to OCR. Although we begin by segmenting the page into a collection of lines, no further segmentation is necessary for either recognition or training. Experiments on the ARPA Arabic data corpus yield a range of character error rates from under one percent for a single computer font to 2.8% for multiple-font recognition of a wide range of material from books, magazines and newspapers.
Robcast: A Singlehop Reliable Broadcast Protocol forWireless Sensor Networks
Authors: Murat Demirbas, Srivats Balachandran
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Empirical studies show that wireless sensor networks (WSNs) are extremely prone to the hidden terminal problem. As much as 50% of packet losses have been blamed to the hidden terminal problem under bursty communication. Current protocols use RTS-CTS handshakes to avoid collisions and alleviate the hidden terminal problem for unicast communication. However, it is not possible to directly or efficiently generalize this approach to broadcast communication. Motivated by this problem, we propose Robcast, a round-based self-stabilizing protocol for reliably broadcasting data using receiver-side collision detection feedback. The singlehop level reliability of Robcast can form a building block on which future applications and protocols can be designed for WSNs.
Parametric Performance Contracts for Software Components with Concurrent Behaviour
Authors: Jens Happe, Heiko Koziolek, Ralf Reussner
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Performance prediction methods for component-based software systems aim at supporting design decisions of software architects during early development stages. With the increased availability of multicore processors, possible performance gains by distributing threads and processes across multiple cores should be predictable by these methods. Many existing prediction approaches model concurrent behaviour insufficiently and yield inaccurate results due to hard underlying assumptions. In this paper, we present a formal performance prediction approach for component-based systems, which is parameterisable for the number of CPUs or CPU cores. It is able to predict the response time of component services for generally distributed execution times. An initial, simple case study shows that this approach can accurately predict response times of multithreaded software components in specific cases. However, it is limited if threads change the CPU during their execution, if the effect of processor cache thrashing is present, and if the memory bus is heavily used.
Exploring the potential of intractable parsers
Authors: Mark Hopkins, Jonas Kuhn
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We revisit the idea of history-based parsing, and present a history-based parsing framework that strives to be simple, general, and flexible. We also provide a decoder for this probability model that is linear-space, optimal, and anytime. A parser based on this framework, when evaluated on Section 23 of the Penn Tree-bank, compares favorably with other state-of-the-art approaches, in terms of both accuracy and speed.
Investigating the size and value effect in determining performance of Australian listed companies: a neural network approach
Authors: Justin Luu, Paul J. Kennedy
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

This paper explores the size and value effect in influencing performance of individual companies using backpropagation neural networks. According to existing theory, companies with small market capitalization and high book to market ratios have a tendency to perform better in the future. Data from over 300 Australian Stock Exchange listed companies between 2000-2004 is examined and a neural network is trained to predict company performance based on market capitalization, book to market ratio, beta and standard deviation. Evidence for the value effect was found over longer time periods but there was less for the size effect. Poor company performance was also observed to be correlated with high risk.
Feature extraction based on zero-crossings with peak amplitudes for robust speech recognition in noisy environments
Authors: Doh-Suk Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The ensemble interval histogram (EIH) is an auditory model which can be used as a robust "front-end" for speech recognition systems. The utilization of multiple level-crossing detectors in the EIH provides frequency and intensity information, which may be useful for speech processing. Proper determination of the number of levels and the level values is very important for reliable performance of the system. An analytic relationship is developed for the variance and SNR of the level-crossing intervals as a function of the crossing level value, and a new feature extraction method based on zero-crossings with peak amplitudes is proposed for robust speech recognition in noisy environments. The proposed method not only can preserve intensity information, but also is robust to noise in estimating the frequency information without the need to determine the level values and the number of levels. Experimental results show the robustness of the proposed method.
Voronoi Tessellations and the Cosmic Web: Spatial Patterns and Clustering across the Universe
Authors: Rien van de Weygaert
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

The spatial cosmic matter distribution on scales of a few up to more than a hundred Megaparsec displays a salient and pervasive foamlike pattern. Voronoi tessellations are a versatile and flexible mathematical model for such weblike spatial patterns. They would be the natural result of an evolution in which low-density expanding void regions dictate the spatial organization of the Megaparsec Universe, while matter assembles in high-density filamentary and wall-like interstices between the voids. We describe the results of ongoing investigations of a variety of aspects of cosmologically relevant spatial distributions and statistics within the framework of Voronoi tessellations. Particularly enticing is the finding of a profound scaling of both clustering strength and clustering extent for the distribution of tessellation nodes, suggestive for the clustering properties of galaxy clusters. Cellular patterns may be the source of an intrinsic "geometrically biased" clustering.
Enlightenment and the Linux desktop
Authors: Geoff Harrison
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The Linux Desktop is a constantly changing and evolving topic. Find out the current state of Linux on the desktop, and where enlightenment plays into the scheme of things. We'll talk a bit about where enlightenment is going, in addition to showing plenty of demonstrations. Mandrake will be assisted by The Rasterman.
Generating representative ISP topologies from first-principles
Authors: Chong Wang, John W. Byers
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Understanding and modeling the factors that underlie the growth and evolution of network topologies are basic questions that impinge upon capacity planning, forecasting, and protocol research. Early topology generation work focused on generating network-wide connectivity maps, either at the AS-level or the router-level, typically with an eye towards reproducing abstract properties of observed topologies. But recently, advocates of an alternative "first-principles" approach question the feasibility of realizing representative topologies with simple generative models that do not explicitly incorporate real-world constraints, such as the relative costs of router configurations, into the model. Our work synthesizes these two lines by designing a topology generation mechanism that incorporates first-principles constraints. Our goal is more modest than that of constructing an Internet-wide topology: we aim to generate representative topologies for single ISPs. However, our methods also go well beyond previous work, as we annotate these topologies with representative capacity and latency information. Taking only demand for network services over a given region as input, we propose a natural cost model for building and interconnecting PoPs and formulate the resulting optimization problem faced by an ISP. We devise hill-climbing heuristics for this problem and demonstrate that the solutions we obtain are quantitatively similar to those in measured router-level ISP topologies, with respect to both topological properties and fault-tolerance.