ppxscal/embedding_network huggingface dataset:
Detailed Building Facades
Authors: Dieter Finkenzeller
Venue: IEEE Computer Graphics and Applications (2008)

Many virtual environments require architectural settings, which often prove time consuming and tedious to model. Here the author introduces methods and techniques for rapid modeling and modifying of detailed building facades that adapt to geometry automatically. Designers can then modify the facade's outline, window placement, and different styles on an abstract level.
An Information System Development Method Based on the Link of Business Process Modeling with Executable UML Modeling and its Evaluation by Prototyping
Authors: Tsutomu Okawa, Tsukasa Kaminishi, Syuichi Hirabayashi, Hisao Koizumi, Jun Sawamoto
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Currently, Business Process Modeling (BPM) is used to create current analytical model (As-Is model) of the work processes, upon which an optimized model (the To-Be model) can be based, including the optimization of system configuration. Also, there is strong interest in the eXecutableUML (xUML), which makes it possible to validate system viability before it is implemented. This paper proposes a methodology for configuring information systems that links BPM and xUML techniques, and evaluates its applicability. In the proposed method, bottlenecks are analyzed and evaluated using simulation of the work process flow in BPM and, after translating this model into UML model elements, and after the UML model has been created, expands it to xUML. Then, in xUML modeling, dynamic system evaluation is carried out with automatic generation of the code for actual implementation. The proposed method was applied to the development of an actual prototype information system and evaluated.
A new VoIP quality evaluation for 60 GHz wireless campus network
Authors: Toshihiko Wakahara, Meng Yao, Kamugisha Kazaura, Tetsuji Yamato, Hideyuki Ohara, Mitsuji Matsumoto, Takao Shimizu
Venue: International Journal of Wireless and Mobile Computing (2008)

We present the design concept of a campus network based on 60 GHz wireless links suitable for distance learning application and propose a new voice objective measurement method of Voice over IP (VoIP). A practical and convenient network design method for the 60 GHz wireless campus LAN is outlined. For the voice quality measurements a subjective evaluation by human Mean Opinion Score (MOS) is considered the best evaluation, although it has its drawbacks including costs and time for arranging such tests. A new objective measurement method is presented which simplifies the measurement for voice quality and the validity of the proposed method is confirmed by experiments.
USING CORRESPONDENCE ANALYSIS WHEN THE SYSTEM DESCRIPTION YIELDS SEVERAL TRANSITION MATRICES. EXAMPLES WITH SIMULATED DATA AND REAL DRIVER-CAR-ENVIRONMENT SYSTEM DATA
Authors: Pierre Loslever, Jean Christoffe Popieul, P. Simon
Venue: Cybernetics and Systems (2007)

This article considers systems described in terms of a qualitative variable with S states, investigated in numerous empirical situations. Thus, the experimental design or observational design yields N time data sets, one for each empirical situation. Each data set is characterized by an S*S transition matrix and all the transition values are placed on a data table with N rows and S*S columns. The table is subjected to correspondence analysis, which highlights the inter-and intra-individual differences. To illustrate the approach, a didactic example using simulated data is presented, followed by an actual example using eye movement in car driving.
On the second eigenvalue and linear expansion of regular graphs
Authors: N. Kahale
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors investigate the relation between the second eigen-value and the linear expansion of regular graphs. The spectral method is the best currently known technique to prove lower bounds on the expansion. He improves this technique by showing that the expansion coefficient of linear-sized subsets of a k-regular graph G is at least k/2(1- square root max(0,1-/sub lambda 1(G)2//sup 4k-4/))/sup -/ , where lambda /sub 1/(G) is the second largest eigenvalue of the graph. In particular, the linear expansion of Ramanujan graphs, which have the property that the second largest eigenvalue is at most 2 square root k-1, is at least (k/2)/sup -/. This improves upon the best previously known lower bound of 3(k-2)/8. For any integer k such that k-1 is prime, he explicitly constructs an infinite family of k-regular graphs G/sub n/ on n vertices whose linear expansion is k/2 and such that lambda /sub 1/(G/sub n/)
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data
Authors: Guoliang Li, Beng Chin Ooi, Jianhua Feng, Jianyong Wang, Lizhu Zhou
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Conventional keyword search engines are restricted to a given data model and cannot easily adapt to unstructured, semi-structured or structured data. In this paper, we propose an efficient and adaptive keyword search method, called EASE, for indexing and querying large collections of heterogenous data. To achieve high efficiency in processing keyword queries, we first model unstructured, semi-structured and structured data as graphs, and then summarize the graphs and construct graph indices instead of using traditional inverted indices. We propose an extended inverted index to facilitate keyword-based search, and present a novel ranking mechanism for enhancing search effectiveness. We have conducted an extensive experimental study using real datasets, and the results show that EASE achieves both high search efficiency and high accuracy, and outperforms the existing approaches significantly.
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
Authors: Adi Ben-Israel, Yuri Levin
Venue: Discrete Applied Mathematics (2008)

The Newton Bracketing method [Y. Levin, A. Ben-Israel, The Newton Bracketing method for convex minimization, Comput. Optimiz. Appl. 21 (2002) 213-229] for the minimization of convex functions f:R^n->R is extended to affinely constrained convex minimization problems. The results are illustrated for affinely constrained Fermat-Weber location problems.
Decodability of group homomorphisms beyond the johnson bound
Authors: Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Given a pair of finite groups G and H, the set of homomorphisms from G to H form an error-correcting code where codewords differ in at least 1/2 the coordinates. We show that for every pair of abelian groups G and H, the resulting code is (locally) list-decodable from a fraction of errors arbitrarily close to its distance. At the heart of this result is the following combinatorial result: There is a fixed polynomial p(•) such that for every pair of abelian groups G and H, if the maximum fraction of agreement between two distinct homomorphisms from G to H is Λ, then for every ε> 0 and every function f:G -> H, the number of homomorphisms that have agreement Λ + ε with f is at most p(1/ε). We thus give a broad class of codes whose list-decoding radius exceeds the "Johnson bound". Examples of such codes are rare in the literature, and for the ones that do exist, "combinatorial" techniques to analyze their list-decodability are limited. Our work is an attempt to add to the body of such techniques. We use the fact that abelian groups decompose into simpler ones and thus codes derived from homomorphisms over abelian groups may be viewed as certain "compositions" of simpler codes. We give techniques to lift list-decoding bounds for the component codes to bounds for the composed code. We believe these techniques may be of general interest.
A nonparametric procedure for blind image deblurring
Authors: Peihua Qiu
Venue: Computational Statistics Data Analysis (2008)

Observed images are usually blurred versions of true images, due to imperfections of imaging devices, atmospheric turbulence, out of focus lens, motion blurs, and so forth. The major purpose of image deblurring is to restore the original image from its blurred version. A blurred image can be described by convolution of the original image with a point spread function (psf) that characterizes the blurring mechanism. Thus, one essential problem for image deblurring is to estimate the psf from the observed but blurred image, which turns out to be a challenging task, due to the ''ill-posed'' nature of the problem. In the literature, most existing image deblurring procedures assume that either the psf is completely known or it has a parametric form. Motivated by some image applications, including handwritten text recognition and calibration of imaging devices, we suggest a method for estimating the psf nonparametrically, in cases when the true image has one or more line edges, which is usually satisfied in the applications mentioned above and which is not a big restriction in some other image applications, because it is often convenient to take pictures of objects with line edges, using the imaging device under study. Both theoretical justifications and numerical studies show that the proposed method works well in applications.
An enhanced method and its application for fuzzy multi-criteria decision making based on vague sets
Authors: Kuo-Chen Hung, Gino K. Yang, Peter Chu, Warren Tsu-huei Jin
Venue: Computer-Aided Design (2008)

Ye [Ye Jun. Improved method of multicriteria fuzzy decision making based on vague sets. Computer-Aid Design 2007;39:164-9] presented an improved method to handle multi-criteria fuzzy decision-making problems based on vague set theory. He/She provided some functions to measure the degree of suitability of each alternative with respect to a set of criteria presented by vague values. However, in some cases, these functions do not give sufficient information about alternatives. Therefore, in this paper, an enhanced method is provided to measure the accuracy membership of each alternative so as to give additional information for the decision maker. In addition, to making computing and ranking results easier and to increase the recruiting productivity, a computer-based decision-support system is also developed, which may help to make a decision more efficiently.
Exact controllability of semilinear evolution equation and applications
Authors: Hugo Leiva
Venue: International Journal of Systems, Control and Communications (2008)

In this paper we characterise the exact controllability for the following semilinear evolution equation z&prime; = Az + Bu(t) + F(t, z, u(t)), t>0, z&epsilon; Z, u&epsilon; U, where Z, U are Hilbert spaces, A : D(A) &sub; Z &rarr; Z is the infinitesimal generator of strongly continuous semigroup {T(t)}t&ge;0 in Z, B insin; L(U,Z), the control function u belongs to L&sup2;(0, &tau;; U) and F : [0, &tau;] &times; Z &times; U &rarr; Z is a suitable function. First, we give a necessary and sufficient condition for the exact controllability of the linear system z&prime; = Az + Bu(t). Second, under some conditions on F, we prove that the exact controllability of the linear system is preserved by the semilinear system, in this case the control u steering an initial state z0 to a final state z1 at time &tau; > 0 is given by the following formula: u(t) = B*T*(&tau; &minus; t)W-1(I + K)-1(z-1 T(&tau;)z0), according to Theorem 3.1. Finally, these results can be applied to the controlled damped wave equation.
Multi-Token Distributed Mutual Exclusion Algorithm
Authors: Md. Abdur Razzaque, Choong Seon Hong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

This paper is a contribution to the inception of multiple tokens in solving distributed mutual exclusion problem. The proposed algorithm is based on the token ring approach and allows simultaneous existence of multiple tokens in the logical ring of the network. Each competing process generates a unique token and sends it as request to enter the critical section that travels along the ring. The process can only enter the critical section if it gets back its own token. The algorithm also handles the coincident existence of multiple critical sections (if any) in the system. The algorithm eliminates the idle time message passing, increases overall throughput and provides fault-tolerance. We discuss the impact of process failures and loss of tokens and propose corresponding recovery methods. The results of simulation show that the proposed algorithm overcomes the key limitations of the major token ring algorithms.
VoIP at the crossroads: A critical overview of feasible European regulatory models
Authors: Claudio Feijóo, José Luis Gómez-Barroso, Sergio Ramos, David Rojo-Alonso
Venue: Information and Communications Technology Law (2007)

After some previous commercial failures, VoIP (Voice over Internet Protocol) is returning to the foreground. The importance of the success of VoIP is obvious, especially when one considers the boost it represents to broadband technologies. However, the progress of VoIP is conditioned by the regulatory framework designed for it. This article reviews the evolution of VoIP. It then studies the circumstances required for it to replace traditional telephony, both from the demand and supply perspectives. Finally, it analyses five main VoIP development scenarios that represent an adjustment of the specific regulatory intervention in basic issues such as interconnection, numbering, operator obligations and user rights.
A flexible approach to Bayesian multiple curve fitting
Authors: Carsten H. Botts, Michael J. Daniels
Venue: Computational Statistics Data Analysis (2008)

We model sparse functional data from multiple subjects with a mixed-effects regression spline. In this model, the expected values for any subject (conditioned on the random effects) can be written as the sum of a population curve and a subject-specific deviate from this population curve. The population curve and the subject-specific deviates are both modeled as free-knot b-splines with k and k^' knots located at t"k and t"k"^"', respectively. To identify the number and location of the ''free'' knots, we sample from the posterior p(k,t"k,k^',t"k"^"'|y) using reversible jump MCMC methods. Sampling from this posterior distribution is complicated, however, by the flexibility we allow for the model's covariance structure. No restrictions (other than positive definiteness) are placed on the covariance parameters @j and @s^2 and, as a result, no analytical form for the likelihood p(y|k,t"k,k^',t"k"^"') exists. In this paper, we consider two approximations to p(y|k,t"k,k^',t"k"^"') and then sample from the corresponding approximations to p(k,t"k,k^',t"k"^"'|y). We also sample from p(k,t"k,k^',t"k"^"',@j,@s^2|y) which has a likelihood that is available in closed form. While sampling from this larger posterior is less efficient, the resulting marginal distribution of knots is exact and allows us to evaluate the accuracy of each approximation. We then consider a real data set and explore the difference between p(k,t"k,k^',t"k"^"',@j,@s^2|y) and the more accurate approximation to p(k,t"k,k^',t"k"^"'|y).
New synchronization method for robust watermarking using dual PN
Authors: Mostafa Ghannadrezaii
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents new synchronization method for audio watermarking although it is applicable in other media as same. This method, which has been based on using two-PN for synchronization, presents lower overhead beside its robustness that makes it more interesting.
An unpublished theorem of Manfred Schocker and the Patras-Reutenauer algebra
Authors: Dieter Blessenohl
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

Patras, Reutenauer (J. Algebr. Comb. 16:301---314, [2002]) describe a subalgebra $\mathfrak{A}$ of the Malvenuto-Reutenauer algebra ¿. Their paper contains several characteristic properties of this subalgebra. In an unpublished manuscript Manfred Schocker states without proof a theorem, providing two further characterizations of the Patras-Reutenauer algebra. In this paper we establish a slightly generalized version of Schocker's theorem, and give some applications. Finally we describe a derivation of the convolution algebra $\mathfrak{A}$ , which is a homomorphism for the inner product.
A system for developing tablet pc applications for education
Authors: Sam Kamin, Michael Hines, Chad Peiper, Boris Capitanu
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

We describe a new system for building Tablet PC-based classroom software. The system, called SLICE, is built for extensibility, using a unique "explicit state" model. Applications developed thus far include presentation, classroom interaction, shared code review, and exam grading. The paper presents an overview of the system and describes these four applications. It then explains the extensibility model, showing how users can add new features.
An Adaptive Data Dissemination Strategy for Wireless Sensor Networks
Authors: S. Selvakennedy, S. Sinnappan
Venue: International Journal of Distributed Sensor Networks (2007)

Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. However, the nodes are typically highly resource-constrained. Since the communication task is a significant power consumer, various attempts have been made to introduce energy-awareness at different levels within the communication stack. Clustering is one such attempt to control energy dissipation for sensor data dissemination in a multihop fashion. The Time-Controlled Clustering Algorithm (TCCA) is proposed to realize a network-wide energy reduction. A realistic energy dissipation model is derived probabilistically to quantify the sensor network's energy consumption using the proposed clustering algorithm. A discrete-event simulator is developed to verify the mathematical model and to further investigate TCCA in other scenarios. The simulator is also extended to include the rest of the communication stack to allow a comprehensive evaluation of the proposed algorithm.
Automatic Discovery of Physical Topology in Ethernet Networks
Authors: Vinicius Garcia de Oliveira, János Farkas, Marcos Rogerio Salvador, Giovanni Curiel dos Santos
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Ethernet is becoming increasingly popular in metro and access networks due to the high bandwidth available at lowcost. Nonetheless, native Ethernet lacks some features that are important for sophisticated network management; providing accurate knowledge on the physical topology is one of them. Therefore, automatic physical topology discovery in support of network management is essential in Ethernet networks. Former work either focused on Layer-3 topology discovery or only provided the active topology excluding the physical links inactivated by Rapid Spanning Tree Protocol [1]. This paper introduces a novel mechanism capable of automatically discovering the entire physical topology of Ethernet networks. Our algorithm collects information available even in low-cost offthe-shelf Ethernet switches and then calculates the physical topology of the entire network. This paper describes the method and its implementation in a testbed network for assessing the performance and the robustness of the mechanism.
Advanced synchronization scheme for wideband SS modulation system
Authors: Saki Yatano, Yumi Takizawa, Atsushi Fukasawa
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper describes a high performance scheme of synchronization with simplified algorithm and numerical operations. Analog numerical operation has been introduced, and a set of parallel matched filters has been applied to realize the scheme. An enhanced wideband Spread Spectrum (SS) modulation system was designed for a prototype hardware providing a type of Software Defined Radio (SDR) with an MPU and a FPGA. A new scheme of synchronization has proved effectively fast and reliable operation and reduction of circuit complexity and power consumption.
The simplex method applied to wavelet decomposition
Authors: Gavriel Yarmish
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Wavelet decomposition problems have been modeled as linear programs - but only as extremely dense problems. Both revised simplex and interior point methods have difficulty with dense linear programs. The question then is how to get around that issue. In our experiments the standard method outperforms a revised implementation for these problems. Moreover, the standard method can be easily and scalably distributed. Hence the standard simplex method should be useful in solving wavelet decomposition problems.
Strong clique trees, neighborhood trees, and strongly chordal graphs
Authors: Terry A. McKee
Venue: Journal of Graph Theory (2000)

Maximal complete subgraphs and clique trees are basic to both the theory and applications of chordal graphs. A simple notion of strong clique tree extends this structure to strongly chordal graphs. Replacing maximal complete subgraphs with open or closed vertex neighborhoods discloses new relationships between chordal and strongly chordal graphs and the previously studied families of chordal bipartite graphs, clique graphs of chordal graphs (dually chordal graphs), and incidence graphs of biacyclic hypergraphs. &copy; 2000 John Wiley & Sons, Inc. J. Graph Theory 33: 151&ndash;160, 2000
Databases and Web 2.0 panel at VLDB 2007
Authors: Sihem Amer-Yahia, Volker Markl, Alon Halevy, AnHai Doan, Gustavo Alonso, Donald Kossmann, Gerhard Weikum
Venue: ACM SIGMOD Record (2008)

Web 2.0 refers to a set of technologies that enables indviduals to create and share content on the Web. The types of content that are shared on Web 2.0 are quite varied and include photos and videos (e.g., Flickr, YouTube), encyclopedic knowledge (e.g., Wikipedia), the blogosphere, social book-marking and even structured data (e.g., Swivel, Many-eyes). One of the important distinguishing features of Web 2.0 is the creation of communities of users. Online communities such as LinkedIn, Friendster, Facebook, MySpace and Orkut attract millions of users who build networks of their contacts and utilize them for social and professional purposes. In a nutshell, Web 2.0 offers an architecture of participation and democracy that encourages users to add value to the application as they use it.
Verification in the Large via Symbolic Approximation
Authors: Peter T. Breuer, Simon Pickin
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

This article describes the technique, symbolic approximation, that we have evolved to handle the post-hoc verification of C code in very large open source projects such as the Linux kernel, essentially consisting of deliberate approximation in a symbolic domain. Using the technique, we are treating millions of lines of C code source in a few hours on very modest support platforms. The theoretical foundation is a configurable compositional programming logic and a notion of approximation that is tied to what can be deduced about a program, in that adjusting the logic for reasoning about it adjusts the goodness of the approximation to it.